url
stringlengths 16
775
| text
stringlengths 100
1.02M
| date
timestamp[s] | metadata
stringlengths 1.07k
1.1k
|
|---|---|---|---|
https://indico.fnal.gov/event/17199/contributions/42066/
|
Indico search will be reestablished in the next version upgrade of the software: https://getindico.io/roadmap/
# Next steps in Quantum Science for HEP
12-14 September 2018
Fermilab - Wilson Hall
US/Central timezone
## Guass's Law and Hilbert Space Constructions for U(1) Lattice Gauge Theories
Sep 12, 2018, 9:40 AM
25m
One West (Fermilab - Wilson Hall)
### One West
#### Fermilab - Wilson Hall
Fermi National Accelerator Laboratory Batavia, IL
### Speaker
Dr Jesse Stryker (University of Washington)
### Description
Motivated by the limited capabilities of near-term quantum computers, we reconsider the Hamiltonian formulation of lattice gauge theories and the method of truncating Hilbert space to render it finite-dimensional. Conventional formulations lead to a Hilbert space largely spanned by unphysical states; given the current inability to perform fault-tolerant large scale quantum computations, we examine here how one might restrict wave function evolution entirely or mostly to the physical subspace. We consider such constructions for the simplest of these theories containing dynamical gauge bosons — $U(1)$ lattice gauge theory without matter in d = 2, 3 spatial dimensions — and find that electric-magnetic duality naturally plays an important role. We conclude that this approach is likely to significantly reduce computational overhead in d = 2 by a reduction of variables. We further investigate potential advantages of regulating magnetic fluctuations in asymptotically-free theories, instead of electric fluctuations, which have been the focus of previous truncation proposals.
Slides
| 2021-10-18T17:13:33 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.5357465147972107, "perplexity": 2143.5098183279397}, "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/1634323585204.68/warc/CC-MAIN-20211018155442-20211018185442-00550.warc.gz"}
|
https://gssc.esa.int/navipedia/index.php/Receiver_Antenna_Phase_Centre
|
If you wish to contribute or participate in the discussions about articles you are invited to join Navipedia as a registered user
Fundamentals
Author(s) J. Sanz Subirana, J.M. Juan Zornoza and M. Hernández-Pajares, Technical University of Catalonia, Spain.
Level Basic
Year of Publication 2011
The measurements are referred to the Antenna Phase Centre (APC) position. As this location is frequency dependent, a point tied to the base of the antenna is used as a more suitable reference. This point is named Antenna Reference Point (ARP). The manufacturers provide technical information on the APC position relative to the ARP. On the other hand, relative and absolute antenna phase centre corrections have been compiled by IGS and are provided in the PCV and ANTEX files respectively for several antenna models (see Antenna Phase Centre).
In geodetic positioning, the receiver coordinates are referred to a Monument Marker (MM) or to an external Benchmark (BM). Figure 1 illustrates this concept.
Figure 1: Layout of a permanent receiver site with indication of the Monument Marker, Antenna Reference Point and Antenna Phase Centre.
In the IGS SINEX files, the computed coordinates for Monument Marker coordinates are given in the block "SOLUTION/ESTIMATE", in ECEF coordinates, for each processed station. The position of the ARP relative to the MM, or the site eccentricity vector, are given the block "SITE/ECCENTRICITY" in Up North East (UNE) coordinates. Finally, the Antenna Phase Centre offsets for the different frequencies used and the Antenna Calibration model (e.g., ANTEX file) are given in the "SITE/GPS_PHASE_CENTER" block of data [footnotes 1].
Let ${\mathbf r}_{M}$ be the position of Monument Marker in a ECEF reference frame. Let ${\boldsymbol \Delta}_{ARP}$ be the offset vector defining the ARP position relative to the Monument Marker, and ${\boldsymbol \Delta}_{APC}$ the offset vector defining the APC position relative to the ARP. Thence the receiver APC position ${\mathbf r}$, in a ECEF reference frame is given by [footnotes 2]:
${\mathbf r}={\mathbf r}_M+{\boldsymbol \Delta}_{ARP}+{\boldsymbol \Delta}_{APC} \qquad\mbox{(1)}$
frameless frameless frameless First row shows the horizontal (left) and vertical (right) positioning error using (blue) or not using (red) the Receiver APC correction. The variation in range is shown in the second row at left. As the APC vector is along the vertical axis, its effect is a displacement in the vertical component
Figure 2, shows an example illustrating the effect of APC correction in the positioning domain (first row) and range domain (second row). The solution computed using the APC correction is shown in blue and the solution without using the APC in red. The projection in range of the APC offset is shown in the second row at left. The results correspond to an Ashtech-ZXII3 receiver with ASH70093D_M antenna, located at coordinates $\lambda=34^o45^m$, $\phi=30^o36^m$ (Israel), on May 2nd 2000 and positioned in Kinematic Precise Point Positioning (PPP) mode.
## Notes
1. ^ See SINEX format at: http://www.iers.org/MainDisp.csl?pid=190-1100110. SINEX files can be found at ftp://cddis.gsfc.nasa.gov/pub/gps/products.
2. ^ Note: As commented before, ${\boldsymbol \Delta}_{APC}$ is a frequency dependent correction. Equation
${\boldsymbol \Delta}_{APC_{LC}}=\frac{f_1^2 {\boldsymbol \Delta}_{APC_{L1}}-f_2^2 {\boldsymbol \Delta}_{APC_{L2}}}{f_1^2-f_2^2}$
gives the correction ${\boldsymbol \Delta}_{{APC}_{LC}}$ from the L1, L2 APCs vectors.
| 2019-02-23T15:59: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.5818571448326111, "perplexity": 2907.7839773299547}, "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/1550249504746.91/warc/CC-MAIN-20190223142639-20190223164639-00429.warc.gz"}
|
https://phys.libretexts.org/Bookshelves/University_Physics/Book%3A_University_Physics_(OpenStax)/Map%3A_University_Physics_I_-_Mechanics%2C_Sound%2C_Oscillations%2C_and_Waves_(OpenStax)/05%3A_Newton's_Laws_of_Motion/5.07%3A_Common_Forces
|
$$\require{cancel}$$
# 5.7: Common Forces
Learning Objectives
• Define normal and tension forces
• Distinguish between real and fictitious forces
• Apply Newton’s laws of motion to solve problems involving a variety of forces
Forces are given many names, such as push, pull, thrust, and weight. Traditionally, forces have been grouped into several categories and given names relating to their source, how they are transmitted, or their effects. Several of these categories are discussed in this section, together with some interesting applications. Further examples of forces are discussed later in this text.
# A Catalog of Forces: Normal, Tension, and Other Examples of Forces
A catalog of forces will be useful for reference as we solve various problems involving force and motion. These forces include normal force, tension, friction, and spring force.
## Normal force
Weight (also called the force of gravity) is a pervasive force that acts at all times and must be counteracted to keep an object from falling. You must support the weight of a heavy object by pushing up on it when you hold it stationary, as illustrated in Figure 5.21(a). But how do inanimate objects like a table support the weight of a mass placed on them, such as shown in Figure 5.21(b)? When the bag of dog food is placed on the table, the table sags slightly under the load. This would be noticeable if the load were placed on a card table, but even a sturdy oak table deforms when a force is applied to it. Unless an object is deformed beyond its limit, it will exert a restoring force much like a deformed spring (or a trampoline or diving board). The greater the deformation, the greater the restoring force. Thus, when the load is placed on the table, the table sags until the restoring force becomes as large as the weight of the load. At this point, the net external force on the load is zero. That is the situation when the load is stationary on the table. The table sags quickly and the sag is slight, so we do not notice it. But it is similar to the sagging of a trampoline when you climb onto it.
We must conclude that whatever supports a load, be it animate or not, must supply an upward force equal to the weight of the load, as we assumed in a few of the previous examples. If the force supporting the weight of an object, or a load, is perpendicular to the surface of contact between the load and its support, this force is defined as a normal force and here is given by the symbol $$\vec{N}$$. (This is not the newton unit for force, or N.) The word normal means perpendicular to a surface. This means that the normal force experienced by an object resting on a horizontal surface can be expressed in vector form as follows:
$$\vec{N} = -m \vec{g} \ldotp \tag{5.11}$$
In scalar form, this becomes
$$N = mg \ldotp \tag{5.12}$$
The normal force can be less than the object’s weight if the object is on an incline.
Example 5.12
### Weight on an Incline
Consider the skier on the slope in Figure 5.22. Her mass including equipment is 60.0 kg. (a) What is her acceleration if friction is negligible? (b) What is her acceleration if friction is 45.0 N?
### Strategy
This is a two-dimensional problem, since not all forces on the skier (the system of interest) are parallel. The approach we have used in two-dimensional kinematics also works well here. Choose a convenient coordinate system and project the vectors onto its axes, creating two one-dimensional problems to solve. The most convenient coordinate system for motion on an incline is one that has one coordinate parallel to the slope and one perpendicular to the slope. (Motions along mutually perpendicular axes are independent.) We use x and y for the parallel and perpendicular directions, respectively. This choice of axes simplifies this type of problem, because there is no motion perpendicular to the slope and the acceleration is downslope. Regarding the forces, friction is drawn in opposition to motion (friction always opposes forward motion) and is always parallel to the slope, wx is drawn parallel to the slope and downslope (it causes the motion of the skier down the slope), and wy is drawn as the component of weight perpendicular to the slope. Then, we can consider the separate problems of forces parallel to the slope and forces perpendicular to the slope.
### Solution
The magnitude of the component of weight parallel to the slope is
$$w_{x} = w \sin 25^{o} = mg \sin 25^{o},$$
and the magnitude of the component of the weight perpendicular to the slope is
$$w_{y} = w \cos 25^{o} = mg \cos 25^{o} \ldotp$$
1. Neglect friction. Since the acceleration is parallel to the slope, we need only consider forces parallel to the slope. (Forces perpendicular to the slope add to zero, since there is no acceleration in that direction.) The forces parallel to the slope are the component of the skier’s weight parallel to slope wx and friction f. Using Newton’s second law, with subscripts to denote quantities parallel to the slope, $$a_{x} = \frac{F_{net\; x}}{m}$$where Fnet x = wx - mg sin 25°, assuming no friction for this part. Therefore, $$a_{x} = \frac{F_{net\; x}}{m} = \frac{mg \sin 25^{o}}{m} = g \sin 25^{o}$$ $$(9.80\; m/s^{2})(0.4226) = 4.14\; m/s^{2}$$is the acceleration.
2. Include friction. We have a given value for friction, and we know its direction is parallel to the slope and it opposes motion between surfaces in contact. So the net external force is $$F_{net\; x} = w_{x} - f \ldotp$$Substituting this into Newton’s second law, ax = $$\frac{F_{net\; x}}{m}$$, gives $$a_{x} = \frac{F_{net\; x}}{m} = \frac{w_{x} - f}{m} = \frac{mg \sin 25^{o} - f}{m} \ldotp$$We substitute known values to obtain $$a_{x} = \frac{(60.0\; kg)(9.80\; m/s^{2})(0.4226) - 45.0\; N}{60.0\; kg} \ldotp$$This give us $$a_{x} = 3.39\; m/s^{2},$$which is the acceleration parallel to the incline when there is 45.0 N of opposing friction.
### Significance
Since friction always opposes motion between surfaces, the acceleration is smaller when there is friction than when there is none. It is a general result that if friction on an incline is negligible, then the acceleration down the incline is a = g sin $$\theta$$, regardless of mass. As discussed previously, all objects fall with the same acceleration in the absence of air resistance. Similarly, all objects, regardless of mass, slide down a frictionless incline with the same acceleration (if the angle is the same).
When an object rests on an incline that makes an angle $$\theta$$ with the horizontal, the force of gravity acting on the object is divided into two components: a force acting perpendicular to the plane, wy , and a force acting parallel to the plane, wx (Figure 5.23). The normal force $$\vec{N}$$ is typically equal in magnitude and opposite in direction to the perpendicular component of the weight wy. The force acting parallel to the plane, wx, causes the object to accelerate down the incline.
Be careful when resolving the weight of the object into components. If the incline is at an angle θ to the horizontal, then the magnitudes of the weight components are
$$w_{x} = w \sin \theta = mg \sin \theta$$
and
$$w_{y} = w \cos \theta = mg \cos \theta$$
We use the second equation to write the normal force experienced by an object resting on an inclined plane:
$$N = mg \cos \theta \ldotp \tag{5.13}$$
Instead of memorizing these equations, it is helpful to be able to determine them from reason. To do this, we draw the right angle formed by the three weight vectors. The angle $$\theta$$ of the incline is the same as the angle formed between w and wy. Knowing this property, we can use trigonometry to determine the magnitude of the weight components:
$$\cos \theta = \frac{w_{y}}{w},\quad w_{y} = w \cos \theta = mg \sin \theta$$
$$\sin \theta = \frac{w_{x}}{w},\quad w_{x} = w \sin\theta = mg \sin \theta$$
Exercise 5.8
A force of 1150 N acts parallel to a ramp to push a 250-kg gun safe into a moving van. The ramp is frictionless and inclined at 17°. (a) What is the acceleration of the safe up the ramp? (b) If we consider friction in this problem, with a friction force of 120 N, what is the acceleration of the safe?
## Tension
A tension is a force along the length of a medium; in particular, it is a pulling force that acts along a stretched flexible connector, such as a rope or cable. The word “tension” comes from a Latin word meaning “to stretch.” Not coincidentally, the flexible cords that carry muscle forces to other parts of the body are called tendons. Any flexible connector, such as a string, rope, chain, wire, or cable, can only exert a pull parallel to its length; thus, a force carried by a flexible connector is a tension with a direction parallel to the connector. Tension is a pull in a connector. Consider the phrase: “You can’t push a rope.” Instead, tension force pulls outward along the two ends of a rope. Consider a person holding a mass on a rope, as shown in Figure 5.24. If the 5.00-kg mass in the figure is stationary, then its acceleration is zero and the net force is zero. The only external forces acting on the mass are its weight and the tension supplied by the rope. Thus,
$$F_{net} = T - w = 0,$$
where T and w are the magnitudes of the tension and weight, respectively, and their signs indicate direction, with up being positive. As we proved using Newton’s second law, the tension equals the weight of the supported mass:
$$T = w = mg \ldotp \tag{5.14}$$
Thus, for a 5.00-kg mass (neglecting the mass of the rope), we see that
$$T = mg = (5.00\; kg)(9.80\; m/s^{2}) = 49.0\; N \ldotp$$
If we cut the rope and insert a spring, the spring would extend a length corresponding to a force of 49.0 N, providing a direct observation and measure of the tension force in the rope.
Flexible connectors are often used to transmit forces around corners, such as in a hospital traction system, a tendon, or a bicycle brake cable. If there is no friction, the tension transmission is undiminished; only its direction changes, and it is always parallel to the flexible connector, as shown in Figure 5.25.
Example 5.13
### What Is the Tension in a Tightrope?
Calculate the tension in the wire supporting the 70.0-kg tightrope walker shown in Figure 5.26.
### Strategy
As you can see in Figure 5.26, the wire is bent under the person’s weight. Thus, the tension on either side of the person has an upward component that can support his weight. As usual, forces are vectors represented pictorially by arrows that have the same direction as the forces and lengths proportional to their magnitudes. The system is the tightrope walker, and the only external forces acting on him are his weight $$\vec{w}$$ and the two tensions $$\vec{T}_{L}$$ (left tension) and $$\vec{T}_{R}$$ (right tension). It is reasonable to neglect the weight of the wire. The net external force is zero, because the system is static. We can use trigonometry to find the tensions. One conclusion is possible at the outset—we can see from Figure 5.26(b) that the magnitudes of the tensions TL and TR must be equal. We know this because there is no horizontal acceleration in the rope and the only forces acting to the left and right are TL and TR. Thus, the magnitude of those horizontal components of the forces must be equal so that they cancel each other out.
Whenever we have two-dimensional vector problems in which no two vectors are parallel, the easiest method of solution is to pick a convenient coordinate system and project the vectors onto its axes. In this case, the best coordinate system has one horizontal axis (x) and one vertical axis (y).
### Solution
First, we need to resolve the tension vectors into their horizontal and vertical components. It helps to look at a new free-body diagram showing all horizontal and vertical components of each force acting on the system (Figure 5.27).
Consider the horizontal components of the forces (denoted with a subscript x):
$$F_{net x} = T_{Rx} − T_{Lx} \ldotp$$
The net external horizontal force Fnet x = 0, since the person is stationary. Thus,
$$F_{net x} = 0 = T_{Rx} − T_{Lx} \ldotp$$
$$T_{Lx} = T_{Rx} \ldotp$$
Now observe Figure 5.27. You can use trigonometry to determine the magnitude of TL and TR:
$$\cos 5.0^{o} = \frac{T_{Lx}}{T_{L}}, \quad T_{Lx} = T_{L} \cos 5.0^{o}$$
$$\cos 5.0^{o} = \frac{T_{Rx}}{T_{R}}, \quad T_{Rx} = T_{R} \cos 5.0^{o} \ldotp$$
Equating TLx and TRx:
$$T_{L} \cos 5.0^{o} = T_{R} \cos 5.0^{o} \ldotp$$
Thus,
$$T_{L} = T_{R} = T,$$
as predicted. Now, considering the vertical components (denoted by a subscript y), we can solve for T. Again, since the person is stationary, Newton’s second law implies that Fnet y = 0. Thus, as illustrated in the free-body diagram,
$$F_{net y} = T_{Ly} + T_{Ry} - w = 0 \ldotp$$
We can use trigonometry to determine the relationships among TLy, TRy, and T. As we determined from the analysis in the horizontal direction, TL = TR = T:
$$\sin 5.0^{o} = \frac{T_{Ly}}{T_{L}}, \quad T_{Ly} = T_{L} \sin 5.0^{o} = T \sin 5.0^{o}$$
$$\sin 5.0^{o} = \frac{T_{Ry}}{T_{R}}, \quad T_{Ry} = T_{R} \sin 5.0^{o} = T \sin 5.0^{o} \ldotp$$
Now we can substitute the vales for TLy and TRy, into the net force equation in the vertical direction:
$$F_{net y} = T_{Ly} + T_{Ry} - w = 0$$
$$F_{net y} = 0 = T \sin 5.0^{o} + T \sin 5.0^{o} - w = 0$$
$$2T \sin 5.0^{o} - w = 0$$
$$2T \sin 5.0^{o} = w$$
and
$$T = \frac{w}{2 \sin 5.0^{o}} = \frac{mg}{2 \sin 5.0^{o}},$$
so
$$T = \frac{(70.0\; kg)(9.80\; m/s^{2})}{2(0.0872)},$$
and the tension is
$$T = 3930\; N \ldotp$$
### Significance
The vertical tension in the wire acts as a force that supports the weight of the tightrope walker. The tension is almost six times the 686-N weight of the tightrope walker. Since the wire is nearly horizontal, the vertical component of its tension is only a fraction of the tension in the wire. The large horizontal components are in opposite directions and cancel, so most of the tension in the wire is not used to support the weight of the tightrope walker.
If we wish to create a large tension, all we have to do is exert a force perpendicular to a taut flexible connector, as illustrated in Figure 5.26. As we saw in Example 5.13, the weight of the tightrope walker acts as a force perpendicular to the rope. We saw that the tension in the rope is related to the weight of the tightrope walker in the following way:
$$T = \frac{w}{2 \sin \theta} \ldotp$$
We can extend this expression to describe the tension T created when a perpendicular force (F$$\perp$$) is exerted at the middle of a flexible connector:
$$T = \frac{F_{\perp}}{2 \sin \theta} \ldotp$$
The angle between the horizontal and the bent connector is represented by $$\theta$$. In this case, T becomes large as $$\theta$$ approaches zero. Even the relatively small weight of any flexible connector will cause it to sag, since an infinite tension would result if it were horizontal (i.e., $$\theta$$ = 0 and sin $$\theta$$ = 0). For example, Figure 5.28 shows a situation where we wish to pull a car out of the mud when no tow truck is available. Each time the car moves forward, the chain is tightened to keep it as straight as possible. The tension in the chain is given by T = $$\frac{F_{\perp}}{2 \sin \theta}$$, and since $$\theta$$ is small, T is large. This situation is analogous to the tightrope walker, except that the tensions shown here are those transmitted to the car and the tree rather than those acting at the point where F$$\perp$$ is applied.
Exercise 5.9
One end of a 3.0-m rope is tied to a tree; the other end is tied to a car stuck in the mud. The motorist pulls sideways on the midpoint of the rope, displacing it a distance of 0.25 m. If he exerts a force of 200.0 N under these conditions, determine the force exerted on the car.
In Applications of Newton’s Laws, we extend the discussion on tension in a cable to include cases in which the angles shown are not equal.
## Friction
Friction is a resistive force opposing motion or its tendency. Imagine an object at rest on a horizontal surface. The net force acting on the object must be zero, leading to equality of the weight and the normal force, which act in opposite directions. If the surface is tilted, the normal force balances the component of the weight perpendicular to the surface. If the object does not slide downward, the component of the weight parallel to the inclined plane is balanced by friction. Friction is discussed in greater detail in the next chapter.
## Spring force
A spring is a special medium with a specific atomic structure that has the ability to restore its shape, if deformed. To restore its shape, a spring exerts a restoring force that is proportional to and in the opposite direction in which it is stretched or compressed. This is the statement of a law known as Hooke’s law, which has the mathematical form
$$\vec{F} = -k \vec{x} \ldotp$$
The constant of proportionality k is a measure of the spring’s stiffness. The line of action of this force is parallel to the spring axis, and the sense of the force is in the opposite direction of the displacement vector (Figure 5.29). The displacement must be measured from the relaxed position; x = 0 when the spring is relaxed.
# Real Forces and Inertial Frames
There is another distinction among forces: Some forces are real, whereas others are not. Real forces have some physical origin, such as a gravitational pull. In contrast, fictitious forces arise simply because an observer is in an accelerating or noninertial frame of reference, such as one that rotates (like a merry-go-round) or undergoes linear acceleration (like a car slowing down). For example, if a satellite is heading due north above Earth’s Northern Hemisphere, then to an observer on Earth, it will appear to experience a force to the west that has no physical origin. Instead, Earth is rotating toward the east and moves east under the satellite. In Earth’s frame, this looks like a westward force on the satellite, or it can be interpreted as a violation of Newton’s first law (the law of inertia). We can identify a fictitious force by asking the question, “What is the reaction force?” If we cannot name the reaction force, then the force we are considering is fictitious. In the example of the satellite, the reaction force would have to be an eastward force on Earth. Recall that an inertial frame of reference is one in which all forces are real and, equivalently, one in which Newton’s laws have the simple forms given in this chapter.
Earth’s rotation is slow enough that Earth is nearly an inertial frame. You ordinarily must perform precise experiments to observe fictitious forces and the slight departures from Newton’s laws, such as the effect just described. On a large scale, such as for the rotation of weather systems and ocean currents, the effects can be easily observed (Figure 5.30).
The crucial factor in determining whether a frame of reference is inertial is whether it accelerates or rotates relative to a known inertial frame. Unless stated otherwise, all phenomena discussed in this text are in inertial frames.
The forces discussed in this section are real forces, but they are not the only real forces. Lift and thrust, for example, are more specialized real forces. In the long list of forces, are some more basic than others? Are some different manifestations of the same underlying force? The answer to both questions is yes, as you will see in the treatment of modern physics later in the text
Simulation
Explore forces and motion in this interactive simulation as you push household objects up and down a ramp. Lower and raise the ramp to see how the angle of inclination affects the parallel forces. Graphs show forces, energy, and work.
Simulation
Stretch and compress springs in this activity to explore the relationships among force, spring constant, and displacement. Investigate what happens when two springs are connected in series and in parallel.
# Contributors
• Samuel J. Ling (Truman State University), Jeff Sanny (Loyola Marymount University), and Bill Moebs with many contributing authors. This work is licensed by OpenStax University Physics under a Creative Commons Attribution License (by 4.0).
| 2020-01-26T17:45: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": 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.7122785449028015, "perplexity": 366.4638796974323}, "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-2020-05/segments/1579251690095.81/warc/CC-MAIN-20200126165718-20200126195718-00109.warc.gz"}
|
https://nroer.gov.in/55ab34ff81fccb4f1d806025/file/58da7fd0472d4a243c592df0
|
### 10 Alternative Fuels – A Boon For Future Generations:
The world is heavily dependent on fossil fuels for meeting energy needs. Somehow we are forgetting that these are replenishable resources. This paper focuses on alternative fuels which could meet energy crisis of the next generations to come.
| 2020-11-27T14:54:47 |
{"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.9887418150901794, "perplexity": 3384.5840506493846}, "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/1606141193221.49/warc/CC-MAIN-20201127131802-20201127161802-00008.warc.gz"}
|
https://clashofclans.fandom.com/wiki/Party_Wizard
|
## FANDOM
973 Pages
"The distant echo of a kick snare or a high hat can only mean one thing: the Party Wizard is making his grand entrance. Dropping phat beats and massive fireballs, he's the soul of post-battle celebrations."
Level 1-9
• Summary
• The Party Wizard is a temporary troop available during the 7th anniversary.
• Party Wizards are specially-themed Wizards. They differ from regular Wizards in that they have increased damage output, faster movement speed, and also attack and retarget faster, but they have less hitpoints.
• However, at lower levels (Town Hall 6 and below), they have lower damage output than normal Wizards.
• Party Wizards have no preferred target when attacking; they will simply attack the closest building. However, once they become aware of enemy Clan Castle troops, Heroes, or Skeleton Trap skeletons (either by being attacked themselves or by being near another friendly troop under attack), they will leave their previously targeted building and instead engage the enemy troops. Once all of the nearby enemy troops are defeated, the Party Wizards will proceed to attack the nearest structure.
• Like other temporary troops, they cannot be donated to Clan Castles.
• Offensive Strategy
• Since they have a higher damage output than the normal wizard after town hall level 7, they work better with tanks like P.E.K.K.A or Barbarian King; the higher dps means they can funnel faster for the tank, so they will not be distracted and can go towards the center or important buildings. You can also place a golem to tank and take the defenses out
• Be aware that due to having lower hitpoints than normal wizards, they are even more vulnerable if left unprotected. It is important to place them behind a tank and scatter their position so all of them aren't splashed by defences like a mortar.
• Defensive Strategy
• Trivia
• You could have a maximum of 70 Party Wizards at one time in a complete set of fully upgraded Army Camps. On the battlefield, you could clone an additional 21 Party Wizards with three fully upgraded Clone Spells.
• Party Wizards cannot be upgraded in the Laboratory. Instead, its statistics depend on the player's Town Hall level. Laboratory level does not affect statistics whatsoever.
• To calculate the health and damage statistics, two factors are considered: the base statistic and Town Hall multiplier. The base statistic for a particular Town Hall level is based on the stats of the maximum level of Wizards available at that Town Hall level, but with +50% extra damage per second and -20% hitpoints.
• Each base statistic is then multiplied by a fixed multiplier for each Town Hall level; the multiplier follows a roughly linear scale. For Town Hall level x, the multiplier is$(\lfloor 30 + (x-1)*70/11 \rfloor)/100$. Once the multiplier is applied, the statistic is rounded down to give the final statistic.
• Note that other statistics, such as training cost, are not multiplied by the multiplier.
• The fireballs that are cast by the Party Wizard have purple patterns on the bright orange surface.
• While at least one Party Wizard is active on the battlefield, the game's battle music will temporarily change to a remixed version of the standard battle theme.
Preferred Target Attack Type Housing Space Movement Speed Attack Speed Barracks Level Required Range
None Area Splash (Ground & Air) 4 24 1s 7 3 tiles
Training Time of Wizards
Number of level 7 or higher Barracks that aren't under upgrade Training Time
1 2 minutes
2 1 minute
3 40 seconds
4 30 seconds
Level * Damage per Second Damage per Attack Hitpoints Training Cost Town Hall Level Required
1 57 57 39 1,400 5
2 82 82 52 1,800 6
3 127 127 70 2,200 7
4 188 188 92 2,600 8
5 222 222 112 3,000 9
6 261 261 132 3,400 10
7 299 299 156 3,800 11
8 345 345 184 4,200 12
*The "level" column does not match up with the in-game level, but is used to clarify between different Town Hall levels, which have different statistics.
For additional statistics and information, see the Unit Calculators page.
Home Village Army
Elixir Troops Barbarian (Super) • ArcherGiant (Super) • Goblin (Sneaky) • Wall Breaker (Super) • BalloonWizardHealerDragonP.E.K.K.ABaby DragonMinerElectro DragonYeti (Yetimite)
Dark Elixir Troops MinionHog RiderValkyrieGolem (Golemite) • Witch (Skeleton) • Lava Hound (Lava Pup) • BowlerIce Golem
Heroes Barbarian KingArcher QueenGrand WardenRoyal Champion
Spells Lightning SpellHealing SpellRage SpellJump SpellFreeze SpellClone Spell
Dark Spells Poison SpellEarthquake SpellHaste SpellSkeleton SpellBat Spell
Siege Machines Wall WreckerBattle BlimpStone SlammerSiege Barracks
Temporary Contents
Temporary Troops Ice WizardBattle RamPumpkin BarbarianGiant SkeletonSkeleton BarrelEl PrimoParty WizardRoyal Ghost
Temporary Spells Santa's SurpriseBirthday Boom
Temporary Traps Pumpkin BombSanta StrikeFreeze TrapShrink Trap
Other Temporary Contents The Waterfall
Community content is available under CC-BY-SA unless otherwise noted.
| 2020-04-01T06:20:51 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.23716367781162262, "perplexity": 11153.634583442865}, "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/1585370505366.8/warc/CC-MAIN-20200401034127-20200401064127-00507.warc.gz"}
|
http://mathonline.wikidot.com/the-group-of-invertible-elements-in-an-algebra
|
The Group of Invertible Elements in an Algebra
Table of Contents
# The Group of Invertible Elements in an Algebra
Proposition 1: Let $X$ be an algebra with unit. Then $(\mathrm{Inv}(X), \cdot )$ is a group.
• Proof: We will prove that all of the group axioms hold.
• 1. Closure under Multiplication: Let $x, y \in \mathrm{Inv}(X)$. Let $z = y^{-1}x^{-1}$. Then:
(1)
\begin{align} \quad xyz = xy(y^{-1}x^{-1}) = 1 \\ \quad zxy = (y^{-1}x^{-1})xy = 1 \end{align}
• Thus $xy \in \mathrm{Inv}(X)$ and $(xy)^{-1} = y^{-1}x^{-1}$.
• 2. Associativity of Multiplication: This follows immediately from the fact that $X$ is an algebra (and so $\cdot$ is associative).
• 3. Existence of an Identity Element: This hollows immediately from the fact that $X$ is an algebra with unit.
• 4. Existence of Inverse Elements: Again, this follows by the definition of $\mathrm{Inv}(X)$.
• Thus $(\mathrm{Inv}(X), \cdot)$ is a group. $\blacksquare$
Definition: Let $X$ be an algebra with unit. Then $(\mathrm{Inv}, \cdot)$ is called the Group of Invertible Elements for the algebra $X$.
Unless otherwise stated, the content of this page is licensed under Creative Commons Attribution-ShareAlike 3.0 License
| 2018-05-20T15:41:37 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 1, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.9969001412391663, "perplexity": 314.42627338004917}, "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-22/segments/1526794863626.14/warc/CC-MAIN-20180520151124-20180520171124-00248.warc.gz"}
|
http://www.itl.nist.gov/div898/software/dataplot/refman1/auxillar/ecdfplot.htm
|
Dataplot Vol 1 Vol 2
# EMPIRICAL CDF PLOT
Name:
EMPIRICAL CDF PLOT
Type:
Graphics Command
Purpose:
Generates a empirical cumulative distribution function (cdf) plot.
Description:
In reliability analysis, many data sets consists of a set of failure times, which may be truncated at some limit value. The cumulative distribution function (CDF) is defined as:
F(t) = prob(T < t)
where T is the lifetime of a randomly selected unit.
A empirical cdf plot is a plot of the empirical CDF versus failure time. The failure time is plotted on the horizontal axis. At each failure time, the following two points are calculated and plotted on the vertical axis:
$$y_1 = \frac{i-1}{n}$$
$$y_2 = \frac{i}{n}$$
with n and i denoting the number of data points and the rank of the failure time, respectively. The last failure time only calculates one of these points.
When all of the points are connected, a staircase type plot results. The vertical step is constant for the failure times, while the lengths of the horizontal steps are determined by the distances between failure times.
This plot is closely related to the TAIL AREA PLOT and the KAPLAN MEIER PLOT.
Syntax 1:
EMPIRICAL CDF PLOT <y> <SUBSET/EXCEPT/FOR qualification>
where <y> is a response variable containing failure times;
and where the <SUBSET/EXCEPT/FOR qualification> is optional.
Syntax 2:
EMPIRICAL CDF PLOT <y> <x> <SUBSET/EXCEPT/FOR qualification>
where <y> is a response variable containing counts;
<x> is a response variable containing failure times;
and where the <SUBSET/EXCEPT/FOR qualification> is optional.
This synatx is used for binned data. That is, contains the failure times and contains the number of occurences corresponding to each failure time.
Examples:
EMPIRICAL CDF PLOT Y1
EMPIRICAL CDF PLOT Y1 SUBSET TAG > 1
EMPIRICAL CDF PLOT Y X
Default:
None
Synonyms:
None
Related Commands:
LINES = Sets the type for plot lines. CHARACTERS = Sets the type for plot characters. TAIL AREA PLOT = Generates a tail area plot. KAPLAN MEIER PLOT = Generates a Kaplan Meier plot. ... HAZARD PLOT = Generates a hazard plot. PROBABILITY PLOT = Generates a probability plot. PLOT = Generates a data or function plot.
Applications:
Reliability
Implementation Date:
1998/8
Program:
SKIP 25
| 2016-02-09T05:34: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.5120216012001038, "perplexity": 4209.6203773016905}, "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-07/segments/1454701156520.89/warc/CC-MAIN-20160205193916-00301-ip-10-236-182-209.ec2.internal.warc.gz"}
|
https://par.nsf.gov/biblio/10318263-search-new-phenomena-pp-collisions-final-states-tau-leptons-jets-missing-transverse-momentum-atlas-detector
|
skip to main content
This content will become publicly available on December 1, 2022
Search for new phenomena in $pp$ collisions in final states with tau leptons, $b$ -jets, and missing transverse momentum with the ATLAS detector
| 2022-06-27T23:31:18 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 4, "mathjax_tag": 0, "mathjax_inline_tex": 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.5494643449783325, "perplexity": 3349.34505200164}, "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-2022-27/segments/1656103344783.24/warc/CC-MAIN-20220627225823-20220628015823-00225.warc.gz"}
|
https://ftp.aimsciences.org/article/doi/10.3934/mbe.2008.5.175
|
Article Contents
Article Contents
# Estimation of invasive pneumococcal disease dynamics parameters and the impact of conjugate vaccination in Australia
• Pneumococcal diseases, or infections from the etiological agent Streptococcus pneumoniae, have long been a major cause of morbidity and mortality worldwide. Recent advances in the development of vaccines for these infections have raised questions concerning their widespread and/or long-term use. In this work, we use surveillance data collected by the Australian National Notifiable Diseases Surveillance system to estimate parameters in a mathemat- ical model of pneumococcal infection dynamics in a population with partial vaccination. The parameters obtained are of particular interest as they are not typically available in reported literature or measurable. The calibrated model is then used to assess the impact of the recent federally funded program that provides pneumococcal vaccines to large risk groups. The results presented here suggest the state of these infections may be changing in response to the programs, and warrants close quantitative monitoring.
Mathematics Subject Classification: Primary: 92D30, 49N45; Secondary: 62P10.
Citation:
Open Access Under a Creative Commons license
| 2023-01-27T08:23:38 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 1, "x-ck12": 0, "texerror": 0, "math_score": 0.2959115505218506, "perplexity": 2402.675870342513}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 20, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2023-06/segments/1674764494974.98/warc/CC-MAIN-20230127065356-20230127095356-00496.warc.gz"}
|
https://zbmath.org/authors/?q=ai%3Agompf.robert-e
|
# zbMATH — the first resource for mathematics
## Gompf, Robert E.
Compute Distance To:
Author ID: gompf.robert-e Published as: Gompf, Robert; Gompf, Robert E. External Links: MGP · Wikidata · GND
Documents Indexed: 50 Publications since 1983, including 1 Book
all top 5
#### Co-Authors
37 single-authored 3 Calcut, Jack S. 2 Freed, Daniel Stuart 1 Bižaca, Žarko 1 Cochran, Thomas (Tim) Daniel 1 Freedman, Michael Hartley 1 McCarthy, John D. 1 Miyazaki, Katura 1 Morrison, Scott 1 Mrowka, Tomasz S. 1 Scharlemann, Martin G. 1 Singh, Sukhjit 1 Stipsicz, András I. 1 Thompson, Abigail A. 1 Walker, Kevin
all top 5
#### Serials
5 Journal of Differential Geometry 5 Topology 5 Topology and its Applications 4 Geometry & Topology 3 Annals of Mathematics. Second Series 3 Algebraic & Geometric Topology 2 Inventiones Mathematicae 2 Turkish Journal of Mathematics 2 The Journal of Symplectic Geometry 1 Communications in Mathematical Physics 1 Mathematische Annalen 1 Proceedings of the Edinburgh Mathematical Society. Series II 1 Ergodic Theory and Dynamical Systems 1 Notices of the American Mathematical Society 1 Journal of Knot Theory and its Ramifications 1 Communications in Analysis and Geometry 1 Topology Proceedings 1 Mathematical Research Letters 1 Physical Review Letters 1 Graduate Studies in Mathematics 1 Journal of Topology 1 Quantum Topology
all top 5
#### Fields
48 Manifolds and cell complexes (57-XX) 12 Differential geometry (53-XX) 5 Several complex variables and analytic spaces (32-XX) 4 Algebraic geometry (14-XX) 3 General topology (54-XX) 3 Global analysis, analysis on manifolds (58-XX) 2 Dynamical systems and ergodic theory (37-XX) 1 Group theory and generalizations (20-XX) 1 Quantum theory (81-XX)
#### Citations contained in zbMATH Open
43 Publications have been cited 994 times in 739 Documents Cited by Year
4-manifolds and Kirby calculus. Zbl 0933.57020
Gompf, Robert E.; Stipsicz, András I.
1999
A new construction of symplectic manifolds. Zbl 0849.53027
Gompf, Robert E.
1995
Handlebody construction of Stein surfaces. Zbl 0919.57012
Gompf, Robert E.
1998
Computer calculation of Witten’s 3-manifold invariant. Zbl 0739.53065
Freed, Daniel S.; Gompf, Robert E.
1991
Applications of Donaldson’s theorems to classical knot concordance, homology 3-spheres and property P. Zbl 0669.57003
Cochran, Tim D.; Gompf, Robert E.
1988
Nuclei of elliptic surfaces. Zbl 0732.57010
Gompf, Robert E.
1991
Irreducible 4-manifolds need not be complex. Zbl 0805.57012
Gompf, Robert E.; Mrowka, Tomasz S.
1993
Smooth concordance of topologically slice knots. Zbl 0596.57005
Gompf, Robert E.
1986
Man and machine thinking about the smooth 4-dimensional Poincaré conjecture. Zbl 1236.57043
Freedman, Michael H.; Gompf, Robert E.; Morrison, Scott; Walker, Kevin
2010
An infinite set of exotic $${\mathbb{R}}^ 4$$’s. Zbl 0562.57009
Gompf, Robert E.
1985
Toward a topological characterization of symplectic manifolds. Zbl 1084.53072
Gompf, Robert E.
2004
Three exotic $$R^ 4$$’s and other anomalies. Zbl 0496.57007
Gompf, Robert E.
1983
Killing the Akbulut-Kirby 4-sphere, with relevance to the Andrews-Curtis and Schoenflies problems. Zbl 0715.57016
Gompf, Robert E.
1991
More Cappell-Shaneson spheres are standard. Zbl 1244.57061
Gompf, Robert E.
2010
An exotic menagerie. Zbl 0808.57012
Gompf, Robert E.
1993
Elliptic surfaces and some simple exotic $$\mathbb{R}^ 4$$’s. Zbl 0868.57023
Bižaca, Žarko; Gompf, Robert E.
1996
Sums of elliptic surfaces. Zbl 0751.14024
Gompf, Robert E.
1991
Infinite order corks. Zbl 1420.57058
Gompf, Robert
2017
The topology of symplectic manifolds. Zbl 0989.53054
Gompf, Robert E.
2001
Symplectically aspherical manifolds with nontrivial $$\pi_2$$. Zbl 0943.53049
Gompf, Robert E.
1998
$$\text{Spin}^ c$$-structures and homotopy equivalences. Zbl 0886.57021
Gompf, Robert E.
1997
On fundamental groups of quotient spaces. Zbl 1233.54003
Calcut, Jack S.; Gompf, Robert E.; McCarthy, John D.
2012
Fibered knots and potential counterexamples to the property 2R and slice-ribbon conjectures. Zbl 1214.57008
Gompf, Robert E.; Scharlemann, Martin; Thompson, Abigail
2010
Stein surfaces as open subsets of $$\mathbb C^2$$. Zbl 1118.32011
Gompf, Robert E.
2005
Some well-disguised ribbon knots. Zbl 0844.57004
Gompf, Robert E.; Miyazaki, Katura
1995
Stable diffeomorphism of compact 4-manifolds. Zbl 0589.57017
Gompf, Robert E.
1984
Minimal genera of open 4-manifolds. Zbl 1369.57028
Gompf, Robert E.
2017
Infinite families of Casson handles and topological disks. Zbl 0534.57007
Gompf, Robert E.
1984
Some new symplectic 4-manifolds. Zbl 0863.53025
Gompf, Robert E.
1994
On Cappell-Shaneson 4-spheres. Zbl 0783.57016
Gompf, Robert E.
1991
Periodic ends and knot concordance. Zbl 0687.57004
Gompf, Robert E.
1989
Infinite order corks via handle diagrams. Zbl 1380.57024
Gompf, Robert E.
2017
Smooth embeddings with Stein surface images. Zbl 1286.32011
Gompf, Robert E.
2013
Orbit spaces of gradient vector fields. Zbl 1286.37019
Calcut, Jack S.; Gompf, Robert E.
2013
Symplectic structures from Lefschetz pencils in high dimensions. Zbl 1083.57035
Gompf, Robert E.
2004
Group actions, corks and exotic smoothings of $$\mathbb{R}^4$$. Zbl 1406.57017
Gompf, Robert E.
2018
Quotient manifolds of flows. Zbl 1408.37037
Gompf, Robert E.
2017
Locally holomorphic maps yield symplectic structures. Zbl 1085.53078
Gompf, Robert E.
2005
Kirby calculus for Stein surfaces. Zbl 0948.57021
Gompf, Robert E.
1998
Smooth 4-manifolds and symplectic topology. Zbl 0849.57017
Gompf, Robert E.
1995
Computer tests of Witten’s Chern-Simons theory against the theory of three-manifolds. Zbl 0968.57502
Freed, Daniel S.; Gompf, Robert E.
1991
A moduli space of exotic $${\mathbb{R}}^ 4$$’s. Zbl 0683.57006
Gompf, Robert E.
1989
On Freedman’s reimbedding theorems. Zbl 0575.57006
Gompf, Robert E.; Singh, Sukhjit
1984
Group actions, corks and exotic smoothings of $$\mathbb{R}^4$$. Zbl 1406.57017
Gompf, Robert E.
2018
Infinite order corks. Zbl 1420.57058
Gompf, Robert
2017
Minimal genera of open 4-manifolds. Zbl 1369.57028
Gompf, Robert E.
2017
Infinite order corks via handle diagrams. Zbl 1380.57024
Gompf, Robert E.
2017
Quotient manifolds of flows. Zbl 1408.37037
Gompf, Robert E.
2017
Smooth embeddings with Stein surface images. Zbl 1286.32011
Gompf, Robert E.
2013
Orbit spaces of gradient vector fields. Zbl 1286.37019
Calcut, Jack S.; Gompf, Robert E.
2013
On fundamental groups of quotient spaces. Zbl 1233.54003
Calcut, Jack S.; Gompf, Robert E.; McCarthy, John D.
2012
Man and machine thinking about the smooth 4-dimensional Poincaré conjecture. Zbl 1236.57043
Freedman, Michael H.; Gompf, Robert E.; Morrison, Scott; Walker, Kevin
2010
More Cappell-Shaneson spheres are standard. Zbl 1244.57061
Gompf, Robert E.
2010
Fibered knots and potential counterexamples to the property 2R and slice-ribbon conjectures. Zbl 1214.57008
Gompf, Robert E.; Scharlemann, Martin; Thompson, Abigail
2010
Stein surfaces as open subsets of $$\mathbb C^2$$. Zbl 1118.32011
Gompf, Robert E.
2005
Locally holomorphic maps yield symplectic structures. Zbl 1085.53078
Gompf, Robert E.
2005
Toward a topological characterization of symplectic manifolds. Zbl 1084.53072
Gompf, Robert E.
2004
Symplectic structures from Lefschetz pencils in high dimensions. Zbl 1083.57035
Gompf, Robert E.
2004
The topology of symplectic manifolds. Zbl 0989.53054
Gompf, Robert E.
2001
4-manifolds and Kirby calculus. Zbl 0933.57020
Gompf, Robert E.; Stipsicz, András I.
1999
Handlebody construction of Stein surfaces. Zbl 0919.57012
Gompf, Robert E.
1998
Symplectically aspherical manifolds with nontrivial $$\pi_2$$. Zbl 0943.53049
Gompf, Robert E.
1998
Kirby calculus for Stein surfaces. Zbl 0948.57021
Gompf, Robert E.
1998
$$\text{Spin}^ c$$-structures and homotopy equivalences. Zbl 0886.57021
Gompf, Robert E.
1997
Elliptic surfaces and some simple exotic $$\mathbb{R}^ 4$$’s. Zbl 0868.57023
Bižaca, Žarko; Gompf, Robert E.
1996
A new construction of symplectic manifolds. Zbl 0849.53027
Gompf, Robert E.
1995
Some well-disguised ribbon knots. Zbl 0844.57004
Gompf, Robert E.; Miyazaki, Katura
1995
Smooth 4-manifolds and symplectic topology. Zbl 0849.57017
Gompf, Robert E.
1995
Some new symplectic 4-manifolds. Zbl 0863.53025
Gompf, Robert E.
1994
Irreducible 4-manifolds need not be complex. Zbl 0805.57012
Gompf, Robert E.; Mrowka, Tomasz S.
1993
An exotic menagerie. Zbl 0808.57012
Gompf, Robert E.
1993
Computer calculation of Witten’s 3-manifold invariant. Zbl 0739.53065
Freed, Daniel S.; Gompf, Robert E.
1991
Nuclei of elliptic surfaces. Zbl 0732.57010
Gompf, Robert E.
1991
Killing the Akbulut-Kirby 4-sphere, with relevance to the Andrews-Curtis and Schoenflies problems. Zbl 0715.57016
Gompf, Robert E.
1991
Sums of elliptic surfaces. Zbl 0751.14024
Gompf, Robert E.
1991
On Cappell-Shaneson 4-spheres. Zbl 0783.57016
Gompf, Robert E.
1991
Computer tests of Witten’s Chern-Simons theory against the theory of three-manifolds. Zbl 0968.57502
Freed, Daniel S.; Gompf, Robert E.
1991
Periodic ends and knot concordance. Zbl 0687.57004
Gompf, Robert E.
1989
A moduli space of exotic $${\mathbb{R}}^ 4$$’s. Zbl 0683.57006
Gompf, Robert E.
1989
Applications of Donaldson’s theorems to classical knot concordance, homology 3-spheres and property P. Zbl 0669.57003
Cochran, Tim D.; Gompf, Robert E.
1988
Smooth concordance of topologically slice knots. Zbl 0596.57005
Gompf, Robert E.
1986
An infinite set of exotic $${\mathbb{R}}^ 4$$’s. Zbl 0562.57009
Gompf, Robert E.
1985
Stable diffeomorphism of compact 4-manifolds. Zbl 0589.57017
Gompf, Robert E.
1984
Infinite families of Casson handles and topological disks. Zbl 0534.57007
Gompf, Robert E.
1984
On Freedman’s reimbedding theorems. Zbl 0575.57006
Gompf, Robert E.; Singh, Sukhjit
1984
Three exotic $$R^ 4$$’s and other anomalies. Zbl 0496.57007
Gompf, Robert E.
1983
all top 5
#### Cited by 631 Authors
18 Stipsicz, András I. 16 Lisca, Paolo 15 Ozbagci, Burak 15 Park, B. Doug 13 Akhmedov, Anar 12 Gompf, Robert E. 11 Park, Jongil 11 Szabo, Zoltan 10 Geiges, Hansjörg 10 Ruberman, Daniel 9 Akbulut, Selman 8 Calcut, Jack S. 8 Cochran, Thomas (Tim) Daniel 8 Etnyre, John B. 8 Hedden, Matthew 8 Li, Tian-Jun 8 Rozansky, Lev 8 Stoimenow, Alexander 8 Torres, Rafael 7 Baykur, Refik İnanç 7 Ghiggini, Paolo 7 Livingston, Charles 7 Melvin, Paul M. 7 Monden, Naoyuki 7 Ozsváth, Peter Steven 7 Ray, Arunima 7 Tralle, Aleksy E. 7 Yasui, Kouichi 6 Aßelmeyer-Maluga, Torsten 6 Etgü, Tolga 6 Hamilton, Mark J. D. 6 Kamada, Seiichi 6 Kim, Hee Jung 6 Muñoz Velázquez, Vicente 5 Auckly, David R. 5 Bazzoni, Giovanni 5 Ding, Fan 5 Endo, Hisaaki 5 Fernández Rodríguez, Marisa 5 Friedl, Stefan 5 Hayano, Kenta 5 Honda, Ko 5 Korkmaz, Mustafa 5 Mark, Thomas E. 5 Némethi, András 5 Zinger, Aleksey 4 Abe, Tetsuya 4 Borodzik, Maciej 4 Chen, Weimin 4 Costantino, Francesco 4 Davis, Christopher William 4 Dorfmeister, Josef Gerhard 4 Farajzadeh Tehrani, Mohammad 4 Feehan, Paul M. N. 4 Forstnerič, Franc 4 Freedman, Michael Hartley 4 Gukov, Sergei 4 Hillman, Jonathan Arthur 4 Katzarkov, Ludmil 4 Kȩdra, Jarek 4 Kirby, Robion Cromwell 4 Kirk, Paul A. 4 Krol, Jerzy 4 László, Tamás 4 Lecuona, Ana G. 4 Lekili, Yankı 4 Leness, Thomas G. 4 Matsumoto, Yukio 4 Meier, Jeffrey 4 Oba, Takahiro 4 Plamenevskaya, Olga 4 Rudyak, Yuli B. 4 Stern, Ronald John 4 Tange, Motoo 4 Vidussi, Stefano 4 Wu, Weiwei 4 Yamada, Yuichi 4 Yun, Ki-Heon 3 Auroux, Denis 3 Catanese, Fabrizio M. E. 3 Cavalcanti, Gil Ramos 3 Cha, Jae Choon 3 Cho, Yong Seung 3 Dittrich, Bianca 3 Durst, Sebastian 3 Fintushel, Ronald 3 Gay, David T. 3 Golla, Marco 3 Hamada, Noriyuki 3 Harvey, Shelly L. 3 Hikami, Kazuhiro 3 Horn, Peter D. 3 Kauffman, Louis Hirsch 3 Kegel, Marc 3 Kotschick, Dieter 3 Lee, Yongnam 3 Lewark, Lukas 3 Li, Youlin 3 Lipshitz, Robert 3 Liu, Ximin ...and 531 more Authors
all top 5
#### Cited in 124 Serials
65 Algebraic & Geometric Topology 63 Topology and its Applications 61 Geometry & Topology 44 Proceedings of the American Mathematical Society 44 Transactions of the American Mathematical Society 33 Journal of Knot Theory and its Ramifications 26 Advances in Mathematics 24 Communications in Mathematical Physics 18 Duke Mathematical Journal 17 Inventiones Mathematicae 17 Mathematische Annalen 15 International Journal of Mathematics 14 Mathematische Zeitschrift 14 Journal of Topology 13 Geometriae Dedicata 12 Journal of Mathematical Physics 12 Michigan Mathematical Journal 11 Journal of Geometry and Physics 7 Manuscripta Mathematica 7 Osaka Journal of Mathematics 7 Journal of High Energy Physics 6 Bulletin of the London Mathematical Society 6 Bulletin of the American Mathematical Society. New Series 6 Communications in Contemporary Mathematics 5 Israel Journal of Mathematics 5 Mathematical Proceedings of the Cambridge Philosophical Society 5 The Journal of Geometric Analysis 5 Annales de la Faculté des Sciences de Toulouse. Mathématiques. Série VI 5 Selecta Mathematica. New Series 5 Journal of Gökova Geometry Topology GGT 5 Quantum Topology 4 Rocky Mountain Journal of Mathematics 4 Journal für die Reine und Angewandte Mathematik 4 Annals of Global Analysis and Geometry 4 Forum Mathematicum 4 Differential Geometry and its Applications 4 Journal of the European Mathematical Society (JEMS) 3 International Journal of Modern Physics A 3 Journal of the London Mathematical Society. Second Series 3 Journal of the Mathematical Society of Japan 3 Pacific Journal of Mathematics 3 Acta Mathematica Hungarica 3 L’Enseignement Mathématique. 2e Série 3 Expositiones Mathematicae 3 Revista Matemática Complutense 3 Qualitative Theory of Dynamical Systems 3 Comptes Rendus. Mathématique. Académie des Sciences, Paris 2 General Relativity and Gravitation 2 Letters in Mathematical Physics 2 Nuclear Physics. B 2 The Mathematical Intelligencer 2 Acta Mathematica Vietnamica 2 Annales de l’Institut Fourier 2 Archiv der Mathematik 2 Compositio Mathematica 2 Glasgow Mathematical Journal 2 Kodai Mathematical Journal 2 Memoirs of the American Mathematical Society 2 Proceedings of the London Mathematical Society. Third Series 2 Siberian Mathematical Journal 2 Tohoku Mathematical Journal. Second Series 2 Ergodic Theory and Dynamical Systems 2 Annals of Mathematics. Second Series 2 Central European Journal of Mathematics 2 International Journal of Geometric Methods in Modern Physics 2 Journal of Fixed Point Theory and Applications 2 Kyoto Journal of Mathematics 2 Complex Manifolds 2 Winter Braids Lecture Notes 1 Bulletin of the Australian Mathematical Society 1 International Journal of Theoretical Physics 1 Jahresbericht der Deutschen Mathematiker-Vereinigung (DMV) 1 Reviews of Modern Physics 1 Ukrainian Mathematical Journal 1 Beiträge zur Algebra und Geometrie 1 Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg 1 Annali di Matematica Pura ed Applicata. Serie Quarta 1 Annales Polonici Mathematici 1 Bulletin de la Société Mathématique de France 1 Canadian Mathematical Bulletin 1 Commentarii Mathematici Helvetici 1 Czechoslovak Mathematical Journal 1 Hiroshima Mathematical Journal 1 Illinois Journal of Mathematics 1 Indiana University Mathematics Journal 1 Publications Mathématiques 1 Journal of Algebra 1 Journal of Differential Equations 1 Journal of Geometry 1 Nonlinear Analysis. Theory, Methods & Applications. Series A: Theory and Methods 1 Proceedings of the Japan Academy. Series A 1 Rendiconti del Seminario Matematico della Università di Padova 1 Tokyo Journal of Mathematics 1 Advances in Applied Mathematics 1 Chinese Annals of Mathematics. Series B 1 Journal of the American Mathematical Society 1 Annals of Physics 1 Elemente der Mathematik 1 Proceedings of the Indian Academy of Sciences. Mathematical Sciences 1 Chinese Science Bulletin ...and 24 more Serials
all top 5
#### Cited in 34 Fields
604 Manifolds and cell complexes (57-XX) 236 Differential geometry (53-XX) 72 Algebraic geometry (14-XX) 65 Several complex variables and analytic spaces (32-XX) 52 Quantum theory (81-XX) 45 Algebraic topology (55-XX) 44 Global analysis, analysis on manifolds (58-XX) 32 Group theory and generalizations (20-XX) 25 Relativity and gravitational theory (83-XX) 18 Dynamical systems and ergodic theory (37-XX) 13 Nonassociative rings and algebras (17-XX) 11 Category theory; homological algebra (18-XX) 11 General topology (54-XX) 9 Number theory (11-XX) 7 Combinatorics (05-XX) 5 History and biography (01-XX) 4 Associative rings and algebras (16-XX) 4 Mechanics of particles and systems (70-XX) 3 Order, lattices, ordered algebraic structures (06-XX) 3 Linear and multilinear algebra; matrix theory (15-XX) 3 $$K$$-theory (19-XX) 3 Functional analysis (46-XX) 3 Statistical mechanics, structure of matter (82-XX) 2 Topological groups, Lie groups (22-XX) 2 Functions of a complex variable (30-XX) 2 Geometry (51-XX) 2 Convex and discrete geometry (52-XX) 2 Fluid mechanics (76-XX) 2 Optics, electromagnetic theory (78-XX) 1 Measure and integration (28-XX) 1 Partial differential equations (35-XX) 1 Approximations and expansions (41-XX) 1 Calculus of variations and optimal control; optimization (49-XX) 1 Computer science (68-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-21T08:04: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": 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.4918362498283386, "perplexity": 6744.548910579667}, "config": {"markdown_headings": true, "markdown_code": true, "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-25/segments/1623488268274.66/warc/CC-MAIN-20210621055537-20210621085537-00301.warc.gz"}
|
https://tjyj.stats.gov.cn/CN/abstract/abstract4773.shtml
|
• 论文 •
中国式分权、市场化进程与经济增长
• 出版日期:2016-03-15 发布日期:2016-03-21
Chinese-style Decentralization, Marketization Process and Economic Growth
Shao Chuanlin
• Online:2016-03-15 Published:2016-03-21
Abstract:
This article explained the impact of Chinese-style decentralization on regional economic growth from the theoretical logic, as well as the impact of the marketization process as a threshold effect variable on economic growth effect of Chinese-style decentralization, and tested the threshold effect of the marketization process based on a threshold panel model of province-level. Empirical results showed that, Chinese-style decentralization and marketization process had a positive effect on regional economic growth, and the promoting effect of Chinese-style decentralization on economic growth had a downward trend when marketization process was higher than a threshold value. Unanimous conclusions were obtained by various robustness tests. Conclusions in this paper had important theoretical and policy implications in current background of new normal economy in China.
| 2022-08-19T04:38: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": 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.1839398443698883, "perplexity": 6479.80484274445}, "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/1659882573623.4/warc/CC-MAIN-20220819035957-20220819065957-00536.warc.gz"}
|
https://par.nsf.gov/biblio/10390200-plus-dr1-galaxy-clusters-groups-catalogue-using-pzwav
|
S-PLUS DR1 galaxy clusters and groups catalogue using PzWav
ABSTRACT
We present a catalogue of 4499 groups and clusters of galaxies from the first data release of the multi-filter (5 broad, 7 narrow) Southern Photometric Local Universe Survey (S-PLUS). These groups and clusters are distributed over 273 deg2 in the Stripe 82 region. They are found using the PzWav algorithm, which identifies peaks in galaxy density maps that have been smoothed by a cluster scale difference-of-Gaussians kernel to isolate clusters and groups. Using a simulation-based mock catalogue, we estimate the purity and completeness of cluster detections: at S/N > 3.3, we define a catalogue that is 80 per cent pure and complete in the redshift range 0.1 < z < 0.4, for clusters with M200 > 1014 M⊙. We also assessed the accuracy of the catalogue in terms of central positions and redshifts, finding scatter of σR = 12 kpc and σz = 8.8 × 10−3, respectively. Moreover, less than 1 per cent of the sample suffers from fragmentation or overmerging. The S-PLUS cluster catalogue recovers ∼80 per cent of all known X-ray and Sunyaev-Zel’dovich selected clusters in this field. This fraction is very close to the estimated completeness, thus validating the mock data analysis and paving an efficient way to find new groups and clusters of galaxies using data from the more »
Authors:
; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ;
Publication Date:
NSF-PAR ID:
10390200
Journal Name:
Monthly Notices of the Royal Astronomical Society
Volume:
519
Issue:
2
Page Range or eLocation-ID:
p. 2630-2645
ISSN:
0035-8711
Publisher:
Oxford University Press
National Science Foundation
##### More Like this
1. ABSTRACT We present optical and near-infrared imaging covering a ∼1.53 deg2 region in the Super-Cluster Assisted Shear Survey (SuperCLASS) field, which aims to make the first robust weak lensing measurement at radio wavelengths. We derive photometric redshifts for ≈176 000 sources down to $i^\prime _{\rm AB}\sim 24$ and present photometric redshifts for 1.4 GHz expanded Multi-Element Radio Linked Interferometer Network (e-MERLIN) and Karl G. Jansky Very Large Array (VLA) detected radio sources found in the central 0.26 deg2. We compile an initial catalogue of 149 radio sources brighter than S1.4 > 75 μJy and find their photometric redshifts span 0 < zphot < 4 with radio luminosities between 1021 and 1025 W Hz−1, with medians of $\langle z \rangle \, =0.55$ and $\langle L_{1.4}\rangle \, =1.9\times 10^{23}$ W Hz−1, respectively. We find 95 per cent of the μJy radio source sample (141/149) have spectral energy distributions (SEDs) best fit by star-forming templates while 5 per cent (8/149) are better fit by active galactic nuclei (AGN). Spectral indices are calculated for sources with radio observations from the VLA and Giant Metrewave Radio Telescope (GMRT) at 325 MHz, with an average spectral slope of α = 0.59 ± 0.04. Using the full photometric redshift catalogue, we construct a density map at the redshift of the known galaxy clusters,more »
2. ABSTRACT In this work, we explore the application of intensity mapping to detect extended Ly α emission from the IGM via cross-correlation of PAUS images with Ly α forest data from eBOSS and DESI. Seven narrow-band (FWHM = 13 nm) PAUS filters have been considered, ranging from 455 to 515 nm in steps of 10 nm, which allows the observation of Ly α emission in a range 2.7 < z < 3.3. The cross-correlation is simulated first in an area of 100 deg2 (PAUS projected coverage), and second in two hypothetical scenarios: a deeper PAUS (complete up to iAB < 24 instead of iAB < 23, observation time ×6), and an extended PAUS coverage of 225 deg2 (observation time ×2.25). A hydrodynamic simulation of size 400 Mpc h−1 is used to simulate both extended Ly α emission and absorption, while the foregrounds in PAUS images have been simulated using a lightcone mock catalogue. Using an optimistic estimation of uncorrelated PAUS noise, the total probability of a non-spurious detection is estimated to be 1.8 per cent and 4.5 per cent for PAUS-eBOSS and PAUS-DESI, from a run of 1000 simulated cross-correlations with different realisations of instrumental noise and quasar positions. The hypothetical PAUS scenarios increase this probability to 15.3 per cent (deeper PAUS) and 9.0 per cent (extendedmore »
3. ABSTRACT
We present a mock image catalogue of ∼100 000 MUV ≃ −22.5 to −19.6 mag galaxies at z = 7–12 from the bluetides cosmological simulation. We create mock images of each galaxy with the James Webb Space Telescope (JWST), Hubble, Roman, and Euclid Space Telescopes, as well as Subaru, and VISTA, with a range of near- and mid-infrared filters. We perform photometry on the mock images to estimate the success of these instruments for detecting high-z galaxies. We predict that JWST will have unprecedented power in detecting high-z galaxies, with a 95 per cent completeness limit at least 2.5 mag fainter than VISTA and Subaru, 1.1 mag fainter than Hubble, and 0.9 mag fainter than Roman, for the same wavelength and exposure time. Focusing on JWST, we consider a range of exposure times and filters, and find that the NIRCam F356W and F277W filters will detect the faintest galaxies, with 95 per cent completeness at m ≃ 27.4 mag in 10-ks exposures. We also predict the number of high-z galaxies that will be discovered by upcoming JWST imaging surveys. We predict that the COSMOS-Web survey will detect ∼1000 M1500 Å < −20.1 mag galaxies at 6.5 < z < 7.5, by virtue of its large surveymore »
4. ABSTRACT
We search for ultraluminous Quasi-Stellar Objects (QSOs) at high redshift using photometry from the SkyMapper Southern Survey Data Release 3 (DR3), in combination with 2MASS, VHS DR6, VIKING DR5, AllWISE, and CatWISE2020, as well as parallaxes and proper motions from Gaia DR2 and eDR3. We report 142 newly discovered Southern QSOs at 3.8 < z < 5.5, of which 126 have M145 < −27 AB mag and are found in a search area of 14 486 deg2. This Southern sample, utilizing the Gaia astrometry to offset wider photometric colour criteria, achieves unprecedented completeness for an ultraluminous QSO search at high redshift. In combination with already known QSOs, we construct a sample that is >80 per cent complete for M145 < −27.33 AB mag at z = 4.7 and for M145 < −27.73 AB mag at z = 5.4. We derive the bright end of the QSO luminosity function at rest frame 145 nm for z = 4.7–5.4 and measure its slope to be β = −3.60 ± 0.37 and β = −3.38 ± 0.32 for two different estimates of the faint-end QSO density adopted from the literature. We also present the first z ∼ 5 QSO luminosity function at rest frame 300 nm.
5. ABSTRACT
We analyse strongly lensed images in eight galaxy clusters to measure their dark matter density profiles in the radial region between 10 kpc and 150 kpc, and use this to constrain the self-interaction cross-section of dark matter (DM) particles. We infer the mass profiles of the central DM haloes, bright central galaxies, key member galaxies, and DM subhaloes for the member galaxies for all eight clusters using the qlens code. The inferred DM halo surface densities are fit to a self-interacting dark matter model, which allows us to constrain the self-interaction cross-section over mass σ/m. When our full method is applied to mock data generated from two clusters in the Illustris-TNG simulation, we find results consistent with no dark matter self-interactions as expected. For the eight observed clusters with average relative velocities of $1458_{-81}^{+80}$ km s−1, we infer $\sigma /m = 0.082_{-0.021}^{+0.027} \rm cm^2\, g^{ -1}$ and $\sigma /m \lt 0.13~ \rm cm^2\, g^{ -1}$ at the 95 per cent confidence level.
| 2023-03-30T00:01: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.570658266544342, "perplexity": 3802.3609151454475}, "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/1679296949035.66/warc/CC-MAIN-20230329213541-20230330003541-00215.warc.gz"}
|
https://phys.libretexts.org/Bookshelves/Conceptual_Physics/Book%3A_Body_Physics_-_Motion_to_Metabolism_(Davis)/04%3A_Better_Body_Composition_Measurement/4.05%3A_Under_Water_Weight
|
$$\require{cancel}$$
# 4.5: Under Water Weight
## Apparent Weight
When an object is held still under water it appears to weigh less than it does in air because the buoyant force is helping to hold it up (balance its weight). For this reason, the reduced force you need to apply to hold the object is known as the apparent weight. When a scale is used to weigh an object submerged in water the scale will read the apparent weight. When performing hydrostatic weighing for body composition measurement the apparent weight is often called the under water weight ().
## Static Equilibrium
When weighing under water we know the buoyant force must be equal to the difference between the weight and apparent weight because the object remains still, which is a state known as static equilibrium. For an object to be in static equilibrium, all of the forces on it must be balanced so that there is no net force. For the case of under water weighing, the buoyant force plus the force provided by the scale (apparent weight) must perfectly balance the weight of the object, as long as the person is holding still. We can use arrows (vectors) to represent the forces on an object and visualize how they are balanced or unbalanced. This type of diagram is known as a free body diagram (FBD). The FBD for a person undergoing hydrostatic weighing would look like this:
Free body diagram of an object hanging from a scale, submerged in water. The length of the weight arrow is equal to the combined lengths of the force supplied by the scale and the buoyant force. A scale will read the weight that it must supply, therefore it will read an apparent weight for submerged objects that is less than the actual weight.
## Archimedes’ Principle
Measuring the weight and apparent weight of a body allows us to calculate its density because the buoyant force that causes the reduction in apparent weight has a special relation to the amount of water being displaced by the body. Archimedes' Principle states that the buoyant force provided by a fluid is equal to the weight of the fluid displaced.
#### Reinforcement Exercises
Hold your hand under water. Now take an empty water bottle and try to hold it under water.
In which case is the total buoyant force larger? Use Archimedes’ Principle to explain why.
Demonstration of Archimedes’ Principle. The buoyant force is equal to the weight of the water displaced, which in this case is 3 N. The buoyant force cancels out 3 N worth of the objects weight, so the scale only pulls up with 1 N to hold the object in static equilibrium. As a result, the scale reads an apparent weight of only 1 N. Image Credit: “Archimedes-principle” by MikeRun via Wikimedia Commons
### Buoyant Force and Density
A given mass of low density tissue will take up volume relative to the same mass of high density tissue. Taking up the volume means more water is displaced when the body is submerged so the buoyant force will be larger compared to the weight than it would be for a more dense body. In turn, that means that apparent weight is smaller relative to actual weight for bodies of higher density. By comparing weight and apparent weight, the body density can be determined. We will do that in the next chapter, but first we should become more familiar with the Buoyant force.
#### Everyday Example
The water displaced by a brick weighs less than the brick so the buoyant force cannot cancel out the weight of the brick and it will tend to sink (left diagram). To hold the brick in place you must provide the remaining upward force to balance the weight and maintain static equilibrium. That force is less than the weight in air so the brick appears to weigh less in the water (right diagram).
Free body diagrams for bricks in water. The brick on the left is sinking, the brick on the right is being held in place by you.
If you let go of the brick it will be out of equilibrium and sink to the pool bottom. At that point the pool bottom is providing the extra upward force to balance out the weight, and the brick is once again in static equilibrium.
Free body diagram of a brick sitting on the bottom of a pool.
The water displaced by an entire beach ball weighs more than a beach ball, so if you hold one under water the buoyant force will be greater than the weight. Your hand is providing the extra downward force to balance out the forces and maintain static equilibrium (left diagram). When you let go, the forces will be unbalanced and the ball will begin moving upward (right diagram).
Free body diagrams of a beach ball under water. The ball on the left is held in place by you. The ball on the right will float upwards.
The density of ice is only about 9/10 that of water. The weight of the water displaced by only 9/10 of the iceberg has the same weight as the entire iceberg. Therefore, 1/10 of the iceberg must remain exposed in order for the weight and buoyant forces to be balanced and the iceberg to be in static equilibrium.
An iceberg floating with roughly 9/10 of its volume submerged. Image Credit: “Iceberg” created by Uwe Kils (iceberg) and User:Wiska Bodo (sky) via Wikimedia Commons
Check out this buoyancy simulation which lets you control how much objects of different masses are submerged and shows you the resulting buoyant force along with forces provided by you and a scale at the bottom of the pool (apparent weight).
#### Not-So-Everyday Example
Submarines control how much water they displace by pumping water in and out of tanks within the submarine. When water is pumped inside, then that water is not displaced by the sub and it doesn’t count toward increasing the buoyant force. Conversely, when water is pumped out that water is now displaced by the sub and the buoyant force increases, which is the concept behind the maneuver in the following video:
A YouTube element has been excluded from this version of the text. You can view it online here: https://openoregon.pressbooks.pub/bodyphysics/?p=1497
1. "Archimedes-principle"By MikeRun [CC BY-SA 4.0 (https://creativecommons.org/licenses/by-sa/4.0)], from Wikimedia Commons
2. "Iceberg" created by Uwe Kils (iceberg) and User:Wiska Bodo (sky). [GFDL (http://www.gnu.org/copyleft/fdl.html) or CC-BY-SA-3.0 (http://creativecommons.org/licenses/by-sa/3.0/)], via Wikimedia Commons
| 2021-01-25T01:12:05 |
{"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.37587669491767883, "perplexity": 539.7398257238839}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 5, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2021-04/segments/1610703561996.72/warc/CC-MAIN-20210124235054-20210125025054-00226.warc.gz"}
|
https://www.zbmath.org/authors/?q=ai%3Ashkalikov.andrei-andreevich
|
# zbMATH — the first resource for mathematics
## Shkalikov, Andreĭ Andreevich
Compute Distance To:
Author ID: shkalikov.andrei-andreevich Published as: Shalikov, Andrey A.; Shkalikov, A.; Shkalikov, A. A.; Shkalikov, Andrei; Shkalikov, Andrei A.; Shkalikov, Andrey A.; Shkalikov, Andreĭ Andreevich; Skalikov, A. A. External Links: MGP · Math-Net.Ru · Wikidata · GND
Documents Indexed: 132 Publications since 1975 Biographic References: 2 Publications
all top 5
all top 5
#### Serials
31 Mathematical Notes 11 Functional Analysis and its Applications 9 Russian Mathematical Surveys 7 Moscow University Mathematics Bulletin 5 Mathematische Nachrichten 5 Soviet Mathematics. Doklady 4 Russian Journal of Mathematical Physics 4 Doklady Mathematics 3 Transactions of the Moscow Mathematical Society 3 Mathematics of the USSR, Sbornik 3 Journal of Mathematical Sciences (New York) 3 Proceedings of the Steklov Institute of Mathematics 2 Matematicheskie Zametki 2 Uspekhi Matematicheskikh Nauk [N. S.] 2 Zeitschrift für Angewandte Mathematik und Mechanik (ZAMM) 2 Integral Equations and Operator Theory 2 Journal of Soviet Mathematics 2 Matematicheskiĭ Sbornik. Novaya Seriya 2 Vestnik Moskovskogo Universiteta. Seriya I. Matematika, Mekhanika 2 Trudy Seminara Imeni I. G. Petrovskogo 2 Fundamental’naya i Prikladnaya Matematika 2 Differential Equations 1 Funktsional’nyĭ Analiz i ego Prilozheniya 1 Pacific Journal of Mathematics 1 Siberian Mathematical Journal 1 Sibirskiĭ Matematicheskiĭ Zhurnal 1 Studia Scientiarum Mathematicarum Hungarica 1 Transactions of the American Mathematical Society 1 Proceedings of the Royal Society of Edinburgh. Section A. Mathematics 1 Matematicheskiĭ Sbornik 1 The Canadian Applied Mathematics Quarterly 1 St. Petersburg Mathematical Journal 1 Izvestiya: Mathematics 1 Methods of Functional Analysis and Topology 1 Proceedings of Institute of Mathematics and Mechanics. National Academy of Sciences of Azerbaijan 1 Zbirnyk Prats’ Instytutu Matematyky NAN Ukraïny 1 Eurasian Mathematical Journal
all top 5
#### Fields
79 Operator theory (47-XX) 61 Ordinary differential equations (34-XX) 14 Partial differential equations (35-XX) 14 Fluid mechanics (76-XX) 13 Functional analysis (46-XX) 11 History and biography (01-XX) 8 Mechanics of deformable solids (74-XX) 7 Functions of a complex variable (30-XX) 5 Sequences, series, summability (40-XX) 4 Harmonic analysis on Euclidean spaces (42-XX) 4 Mechanics of particles and systems (70-XX) 3 Quantum theory (81-XX) 2 Special functions (33-XX) 1 General and overarching topics; collections (00-XX) 1 Linear and multilinear algebra; matrix theory (15-XX) 1 Potential theory (31-XX) 1 Dynamical systems and ergodic theory (37-XX) 1 Approximations and expansions (41-XX) 1 Integral transforms, operational calculus (44-XX) 1 Integral equations (45-XX) 1 Probability theory and stochastic processes (60-XX) 1 Numerical analysis (65-XX)
#### Citations contained in zbMATH
106 Publications have been cited 1,129 times in 717 Documents Cited by Year
Sturm-Liouville operators with singular potentials. Zbl 0968.34072
Savchuk, A. M.; Shkalikov, A. A.
1999
Boundary value problems for ordinary differential equations with a parameter in the boundary conditions. Zbl 0553.34014
Shkalikov, A. A.
1983
Sturm-Liouville operators with distribution potentials. Zbl 1066.34085
Savchuk, A. M.; Shkalikov, A. A.
2003
The essential spectrum of some matrix operators. Zbl 0831.47001
Atkinson, F. V.; Langer, H.; Mennicken, R.; Shkalikov, A. A.
1994
Boundary problems for ordinary differential equations with parameter in the boundary conditions. Zbl 0609.34019
Shkalikov, A. A.
1986
On the basis problem of the eigenfunctions of an ordinary differential operator. Zbl 0471.34014
Shkalikov, A. A.
1979
On the Riesz basis property of the eigen- and associated functions of periodic and antiperiodic Sturm-Liouville problems. Zbl 1190.34111
Shkalikov, A. A.; Veliev, O. A.
2009
Elliptic equations in Hilbert space and spectral problems connected with them. Zbl 0695.34023
Shkalikov, A. A.
1989
On the essential spectrum of matrix operators. Zbl 0871.47005
Shkalikov, A. A.
1995
On the eigenvalues of the Sturm-Liouville operator with potentials from Sobolev spaces. Zbl 1129.34055
Savchuk, A. M.; Shkalikov, A. A.
2006
The Dirac operator with complex-valued summable potential. Zbl 1320.34118
Savchuk, A. M.; Shkalikov, A. A.
2014
Spectral decomposition of symmetric operator matrices. Zbl 0874.47009
Mennicken, Reinhard; Shkalikov, Andrey A.
1996
The basis problem of the eigenfunctions of ordinary differential operators with integral boundary conditions. Zbl 0565.34020
Shkalikov, A. A.
1982
Inverse problems for Sturm-Liouville operators with potentials in Sobolev spaces: uniform stability. Zbl 1271.34017
Savchuk, A. M.; Shkalikov, A. A.
2010
Self$$adjoint$$ quadratic operator pencils and elliptic problems. Zbl 0531.47017
Kostyuchenko, A. G.; Shkalikov, A. A.
1983
Perturbations of self-adjoint and normal operators with discrete spectrum. Zbl 1367.47021
Shkalikov, A. A.
2016
On the eigenvalue accumulation of Sturm-Liouville problems depending nonlinearly on the spectral parameter. Zbl 0892.34019
Mennicken, R.; Schmid, H.; Shkalikov, A. A.
1998
Operator pencils arising in elasticity and hydrodynamics: The instability index formula. Zbl 0860.47009
Shkalikov, A. A.
1996
Strongly definitizable linear pencils in Hilbert space. Zbl 0794.47009
Lancaster, P.; Shkalikov, A.; Ye, Qiang
1993
Schrödinger operators with singular potentials from the space of multiplicators. Zbl 0991.47036
Neiman-Zade, M. I.; Shkalikov, A. A.
1999
On the basis property of root vectors of a perturbed self-adjoint operator. Zbl 1200.47021
Shkalikov, A. A.
2010
Spectral portraits of the Orr-Sommerfeld operator with large Reynolds numbers. Zbl 1074.76018
Shkalikov, A. A.
2003
Spectral analysis for linear pencils $$N-\lambda P$$ of ordinary differential operators. Zbl 0862.34058
Shkalikov, Andrey A.; Tretter, Christiane
1996
Bounds on variation of spectral subspaces under $$J$$-self-adjoint perturbations. Zbl 1197.47024
Albeverio, Sergio; Motovilov, Alexander K.; Shkalikov, Andrei A.
2009
Inverse problem for Sturm-Liouville operators with distribution potentials: reconstruction from two spectra. Zbl 1396.34008
Savchuk, A. M.; Shkalikov, A. A.
2005
Kamke problems. Properties of the eigenfunctions. Zbl 0813.34071
Shalikov, Andrey A.; Tretter, Christiane
1994
The completeness of eigenfunctions and associated functions of an ordinary differential operator with irregular-separated boundary conditions. Zbl 0354.34023
Shkalikov, A. A.
1977
On the properties of maps connected with inverse Sturm-Liouville problems. Zbl 1233.34010
Savchuk, A. M.; Shkalikov, A. A.
2008
On the limit behaviour of the spectrum of a model problem for the Orr-Sommerfeld equation with Poiseuille profile. Zbl 1056.34092
Shkalikov, A. A.; Tumanov, S. N.
2002
A Sturm-Liouville problem with physical and spectral parameters in boundary conditions. Zbl 0958.34023
Ben Amara, J.; Shkalikov, A. A.
1999
Regular and completely regular differential operators. Zbl 1156.34075
Shiryaev, E. A.; Shkalikov, A. A.
2007
Multipliers in dual Sobolev spaces and Schrödinger operators with distribution potentials. Zbl 1029.46029
Bak, Dzh.-G.; Shkalikov, A. A.
2002
The limit behavior of the spectrum for large parameter values in a model problem. Zbl 0937.34071
Shkalikov, A. A.
1997
Damped vibrations of beams and related spectral problems. Zbl 0801.73044
Lancaster, Peter; Shkalikov, A.
1994
Elliptic equations in Hilbert space and associated spectral problems. Zbl 0703.34083
Shkalikov, A. A.
1990
Theorems of Tauberian type on the distribution of the zeros of holomorphic functions. Zbl 0545.30021
Shkalikov, A. A.
1984
Exponential stability of semigroups associated with some operator models in mechanics. Zbl 1061.34042
Griniv, R. O.; Shkalikov, A. A.
2003
On the stability of a top with a cavity filled with a viscous fluid. Zbl 0960.76037
Kostyuchenko, A. G.; Shkalikov, A. A.; Yurkin, M. Yu.
1998
Differential operators of even order with distribution coefficients. Zbl 1394.47046
Mirzoev, Karahan A.; Shkalikov, A. A.
2016
Spectral and oscillatory properties of a linear pencil of fourth-order differential operators. Zbl 1283.34075
Ben Amara, J.; Shkalikov, A. A.; Vladimirov, A. A.
2013
Strongly elliptic operators with singular coefficients. Zbl 1173.35429
Neiman-Zade, M. I.; Shkalikov, A. A.
2006
On an operator pencil arising in the problem of beam oscillation with internal damping. Zbl 0944.47031
Shkalikov, A. A.; Griniv, R. O.
1994
Strongly damped pencils of operators and solvability of the corresponding operator-differential equations. Zbl 0668.47010
Shkalikov, A. A.
1989
Boundary-value problems for ordinary differential equations with a parameter in the boundary conditions. Zbl 0515.34019
Shkalikov, A. A.
1983
On the Hamiltonian property of linear dynamical systems in Hilbert space. Zbl 06769031
Treshchev, D. V.; Shkalikov, A. A.
2017
Asymptotics of the solutions of the Sturm-Liouville equation with singular coefficients. Zbl 1338.34065
Shkalikov, A. A.; Vladykina, V. E.
2015
The $$n$$-fold basis property of the characteristic functions of certain regular boundary-value problems. Zbl 0358.34022
Orazov, M. B.; Skalikov, A. A.
1977
Spectral properties of the complex Airy operator on the half-line. Zbl 1372.34131
Savchuk, Artem M.; Shkalikov, A. A.
2017
Recovering a potential of the Sturm-Liouville problem from finite sets of spectral data. Zbl 1327.34031
Savchuk, A. M.; Shkalikov, A. A.
2014
Dissipative operators in a Krein space. Invariant subspaces and properties of restrictions. Zbl 1255.47045
Shkalikov, A. A.
2007
Overdamped operator pencils and solvability of corresponding operator- differential equations. Zbl 0652.47011
Shkalikov, A. A.
1988
Some questions of the theory of polynomial operator pencils. Zbl 0527.47012
Shkalikov, A. A.
1983
Uniform stability of the inverse Sturm-Liouville problem with respect to the spectral function in the scale of Sobolev spaces. Zbl 1292.34014
Savchuk, A. M.; Shkalikov, A. A.
2013
Semiclassical approximation for a nonself-adjoint Sturm-Liouville problem with a parabolic potential. Zbl 1192.34032
Pokotilo, V. I.; Shkalikov, A. A.
2009
Pencils of differential operators containing the eigenvalue parameter in the boundary conditions. Zbl 1055.34021
Marletta, Marco; Shkalikov, Andrei; Tretter, Christiane
2003
On a model problem for the Orr-Sommerfeld equation with linear profile. Zbl 1036.34094
Dyachenko, A. V.; Shkalikov, A. A.
2002
On the spectrum localization of the Orr–Sommerfeld problem for large Reynolds numbers. Zbl 1022.76016
Shkalikov, A. A.; Tumanov, S. N.
2002
Boundary value problems with the spectral parameter in the boundary conditions. Zbl 0889.34066
Shkalikov, A. A.
1996
On selection principles and properties of a part of eigen- and associated elements of operator bundles. Zbl 0661.47017
Shkalikov, A. A.
1988
Estimates of meromorphic functions and summability theorems. Zbl 0521.47012
Shkalikov, A. A.
1982
Basis properties of root functions of differential operators with spectral parameter in the boundary conditions. Zbl 1422.34249
Shkalikov, A. A.
2019
Spectral properties of ordinary differential operators with involution. Zbl 1418.34156
Vladykina, V. E.; Shkalikov, A. A.
2019
On the asymptotic behavior of solutions to two-term differential equations with singular coefficients. Zbl 1403.34060
Konechnaya, N. N.; Mirzoev, K. A.; Shkalikov, A. A.
2018
On the interpolation of analytic mappings. Zbl 1291.46020
Savchuk, A. M.; Shkalikov, A. A.
2013
Asymptotics of eigenvalues of a second-order non-self-adjoint differential operator on the axis. Zbl 1315.34095
Kusainova, L. K.; Monashova, A. Zh.; Shkalikov, A. A.
2013
Eigenvalue asymptotics of perturbed selfadjoint operators. Zbl 1243.47032
Shkalikov, A. A.
2012
Oscillation theorems for Sturm-Liouville problems with distribution potentials. Zbl 1304.34069
Ben Amara, J.; Shkalikov, A. A.
2009
Invariant subspaces of dissipative operators in a space with indefinite metric. Zbl 1146.47005
Shkalikov, A. A.
2005
Exponential decay of solution energy for equations associated with some operator models of mechanics. Zbl 1084.34057
Hryniv, R. O.; Shkalikov, A. A.
2004
Spectral analysis of the Regge problem. Zbl 1186.34126
Shkalikov, A. A.
2001
On the existence of invariant subspaces of dissipative operators in space with indefinite metric. Zbl 0960.47020
Shkalikov, A. A.
1999
The problem of steady-state oscillations of transversally isotropic half- cylinder. Zbl 0772.73053
Shkalikov, A. A.; Shkred, A. V.
1992
A problem on stationary vibrations of a transversally isotropic semi- cylinder. Zbl 0746.73014
Shkalikov, A. A.; Shkred, A. V.
1991
Selection principles and properties of some proper and adjoined elements of operator pencils. Zbl 0708.47014
Shkalikov, A. A.
1988
On the minimality of the derivative chains corresponding to the part of eigen and associated elements of selfadjoint operator pencils. Zbl 0591.47014
Shkalikov, A. A.
1985
Über die Summierbarkeit von Entwicklungen nach Eigenfunktionen von Differential- und Faltungsoperatoren. Zbl 0394.34018
Kostyuchenko, A. G.; Shkalikov, A. A.
1978
Über ein System von Funktionen. Zbl 0321.42013
Skalikov, A. A.
1975
Regular ordinary differential operators with involution. Zbl 1443.34064
Vladykina, V. E.; Shkalikov, A. A.
2019
Multipliers in Bessel potential spaces with smoothness indices of different sign. Zbl 1412.31005
Belyaev, A. A.; Shkalikov, A. A.
2019
Multipliers in spaces of Bessel potentials: the case of indices of nonnegative smoothness. Zbl 1390.46035
Belyaev, Alexei A.; Shkalikov, A. A.
2017
The limit spectral graph in semiclassical approximation for the Sturm-Liouville problem with complex polynomial potential. Zbl 1337.34028
Tumanov, S. N.; Shkalikov, A. A.
2015
Spectral analysis of the Redge problem. Zbl 1282.34091
Shkalikov, A. A.
2007
Invariant subspaces of dissipative operators in Krein space and Sobolev problem on a rotating top. Zbl 1097.47037
Shkalikov, A. A.
2004
Operator models in elasticity theory and hydromechanics and the associated analytic semigroups. Zbl 1049.76536
Griniv, R. O.; Shkalikov, A. A.
1999
How to define the Orr-Sommerfeld operator? Zbl 1029.47503
Shkalikov, A. A.
1998
Criterion on the eigenvalue accumulation of nonlinear spectral problems for ordinary differential operators with singularities. Zbl 0819.76100
Mennicken, R.; Schmid, H.; Shkalikov, A. A.
1994
On properties of some of the eigenelements and associated elements of selfadjoint quadratic operator pencils. Zbl 0666.42019
Shkalikov, A. A.
1985
Operator differential equations on a semiaxis and related spectral problems for selfadjoint pencils of operators. Zbl 0596.34033
Shkalikov, A. A.
1984
Zero distribution for pairs of holomorphic functions with applications to eigenvalue distribution. Zbl 0545.30020
Shkalikov, A. A.
1984
Some problems in the theory of polynomial operator pencils. Zbl 0557.47011
Shkalikov, A. A.
1983
Property of the eigenvectors of quadratic operator pencils of being a basis. Zbl 0493.47012
Shkalikov, A. A.
1981
Über eine n-fache Basis von Eigenfunktionen bei einigen regulären Randwertproblemen. Zbl 0338.34018
Orazov, M. B.; Shkalikov, A. A.
1976
A system of functions. Zbl 0326.42010
Skalikov, A. A.
1976
Preservation of the unconditional basis property under non-self-adjoint perturbations of self-adjoint operators. Zbl 1436.46012
Motovilov, A. K.; Shkalikov, A. A.
2019
A note on reverses of the Young type inequalities via Kantorovich constant. Zbl 1413.47024
Nasiri, Leila; Shkalikov, Andrei A.; Shakoori, Mahmood
2018
On perturbation theory for points of discrete spectrum of dissipative operator functions. Zbl 1178.47008
Shkalikov, A. A.
2009
In memory of Boris Levitan. Zbl 1118.01308
Kostyuchenko, A. G.; Maslov, V. P.; Sadovnichii, V. A.; Sargsyan, I. S.; Shkalikov, A. A.; Zhikov, V. V.
2006
Spectral analysis of periodic differential operator matrices of mixed order. Zbl 1064.34074
Hryniv, R.; Shkalikov, A.; Vladimirov, A.
2002
On the computing of the eigenvalues of the Orr-Sommerfeld problem. Zbl 1052.65069
Neiman-zade, M. I.; Shkalikov, A. A.
2002
An operator model for the oscillation problem of liquids on an elastic bottom. Zbl 0973.35140
Griniv, R. O.; Dobrokhotov, S. Yu.; Shkalikov, A. A.
2000
Basis properties of root functions of differential operators with spectral parameter in the boundary conditions. Zbl 1422.34249
Shkalikov, A. A.
2019
Spectral properties of ordinary differential operators with involution. Zbl 1418.34156
Vladykina, V. E.; Shkalikov, A. A.
2019
Regular ordinary differential operators with involution. Zbl 1443.34064
Vladykina, V. E.; Shkalikov, A. A.
2019
Multipliers in Bessel potential spaces with smoothness indices of different sign. Zbl 1412.31005
Belyaev, A. A.; Shkalikov, A. A.
2019
Preservation of the unconditional basis property under non-self-adjoint perturbations of self-adjoint operators. Zbl 1436.46012
Motovilov, A. K.; Shkalikov, A. A.
2019
On the asymptotic behavior of solutions to two-term differential equations with singular coefficients. Zbl 1403.34060
Konechnaya, N. N.; Mirzoev, K. A.; Shkalikov, A. A.
2018
A note on reverses of the Young type inequalities via Kantorovich constant. Zbl 1413.47024
Nasiri, Leila; Shkalikov, Andrei A.; Shakoori, Mahmood
2018
On the Hamiltonian property of linear dynamical systems in Hilbert space. Zbl 06769031
Treshchev, D. V.; Shkalikov, A. A.
2017
Spectral properties of the complex Airy operator on the half-line. Zbl 1372.34131
Savchuk, Artem M.; Shkalikov, A. A.
2017
Multipliers in spaces of Bessel potentials: the case of indices of nonnegative smoothness. Zbl 1390.46035
Belyaev, Alexei A.; Shkalikov, A. A.
2017
Perturbations of self-adjoint and normal operators with discrete spectrum. Zbl 1367.47021
Shkalikov, A. A.
2016
Differential operators of even order with distribution coefficients. Zbl 1394.47046
Mirzoev, Karahan A.; Shkalikov, A. A.
2016
Asymptotics of the solutions of the Sturm-Liouville equation with singular coefficients. Zbl 1338.34065
Shkalikov, A. A.; Vladykina, V. E.
2015
The limit spectral graph in semiclassical approximation for the Sturm-Liouville problem with complex polynomial potential. Zbl 1337.34028
Tumanov, S. N.; Shkalikov, A. A.
2015
The Dirac operator with complex-valued summable potential. Zbl 1320.34118
Savchuk, A. M.; Shkalikov, A. A.
2014
Recovering a potential of the Sturm-Liouville problem from finite sets of spectral data. Zbl 1327.34031
Savchuk, A. M.; Shkalikov, A. A.
2014
Spectral and oscillatory properties of a linear pencil of fourth-order differential operators. Zbl 1283.34075
Ben Amara, J.; Shkalikov, A. A.; Vladimirov, A. A.
2013
Uniform stability of the inverse Sturm-Liouville problem with respect to the spectral function in the scale of Sobolev spaces. Zbl 1292.34014
Savchuk, A. M.; Shkalikov, A. A.
2013
On the interpolation of analytic mappings. Zbl 1291.46020
Savchuk, A. M.; Shkalikov, A. A.
2013
Asymptotics of eigenvalues of a second-order non-self-adjoint differential operator on the axis. Zbl 1315.34095
Kusainova, L. K.; Monashova, A. Zh.; Shkalikov, A. A.
2013
Eigenvalue asymptotics of perturbed selfadjoint operators. Zbl 1243.47032
Shkalikov, A. A.
2012
Inverse problems for Sturm-Liouville operators with potentials in Sobolev spaces: uniform stability. Zbl 1271.34017
Savchuk, A. M.; Shkalikov, A. A.
2010
On the basis property of root vectors of a perturbed self-adjoint operator. Zbl 1200.47021
Shkalikov, A. A.
2010
On the Riesz basis property of the eigen- and associated functions of periodic and antiperiodic Sturm-Liouville problems. Zbl 1190.34111
Shkalikov, A. A.; Veliev, O. A.
2009
Bounds on variation of spectral subspaces under $$J$$-self-adjoint perturbations. Zbl 1197.47024
Albeverio, Sergio; Motovilov, Alexander K.; Shkalikov, Andrei A.
2009
Semiclassical approximation for a nonself-adjoint Sturm-Liouville problem with a parabolic potential. Zbl 1192.34032
Pokotilo, V. I.; Shkalikov, A. A.
2009
Oscillation theorems for Sturm-Liouville problems with distribution potentials. Zbl 1304.34069
Ben Amara, J.; Shkalikov, A. A.
2009
On perturbation theory for points of discrete spectrum of dissipative operator functions. Zbl 1178.47008
Shkalikov, A. A.
2009
On the properties of maps connected with inverse Sturm-Liouville problems. Zbl 1233.34010
Savchuk, A. M.; Shkalikov, A. A.
2008
Regular and completely regular differential operators. Zbl 1156.34075
Shiryaev, E. A.; Shkalikov, A. A.
2007
Dissipative operators in a Krein space. Invariant subspaces and properties of restrictions. Zbl 1255.47045
Shkalikov, A. A.
2007
Spectral analysis of the Redge problem. Zbl 1282.34091
Shkalikov, A. A.
2007
On the eigenvalues of the Sturm-Liouville operator with potentials from Sobolev spaces. Zbl 1129.34055
Savchuk, A. M.; Shkalikov, A. A.
2006
Strongly elliptic operators with singular coefficients. Zbl 1173.35429
Neiman-Zade, M. I.; Shkalikov, A. A.
2006
In memory of Boris Levitan. Zbl 1118.01308
Kostyuchenko, A. G.; Maslov, V. P.; Sadovnichii, V. A.; Sargsyan, I. S.; Shkalikov, A. A.; Zhikov, V. V.
2006
Inverse problem for Sturm-Liouville operators with distribution potentials: reconstruction from two spectra. Zbl 1396.34008
Savchuk, A. M.; Shkalikov, A. A.
2005
Invariant subspaces of dissipative operators in a space with indefinite metric. Zbl 1146.47005
Shkalikov, A. A.
2005
Exponential decay of solution energy for equations associated with some operator models of mechanics. Zbl 1084.34057
Hryniv, R. O.; Shkalikov, A. A.
2004
Invariant subspaces of dissipative operators in Krein space and Sobolev problem on a rotating top. Zbl 1097.47037
Shkalikov, A. A.
2004
Sturm-Liouville operators with distribution potentials. Zbl 1066.34085
Savchuk, A. M.; Shkalikov, A. A.
2003
Spectral portraits of the Orr-Sommerfeld operator with large Reynolds numbers. Zbl 1074.76018
Shkalikov, A. A.
2003
Exponential stability of semigroups associated with some operator models in mechanics. Zbl 1061.34042
Griniv, R. O.; Shkalikov, A. A.
2003
Pencils of differential operators containing the eigenvalue parameter in the boundary conditions. Zbl 1055.34021
Marletta, Marco; Shkalikov, Andrei; Tretter, Christiane
2003
On the limit behaviour of the spectrum of a model problem for the Orr-Sommerfeld equation with Poiseuille profile. Zbl 1056.34092
Shkalikov, A. A.; Tumanov, S. N.
2002
Multipliers in dual Sobolev spaces and Schrödinger operators with distribution potentials. Zbl 1029.46029
Bak, Dzh.-G.; Shkalikov, A. A.
2002
On a model problem for the Orr-Sommerfeld equation with linear profile. Zbl 1036.34094
Dyachenko, A. V.; Shkalikov, A. A.
2002
On the spectrum localization of the Orr–Sommerfeld problem for large Reynolds numbers. Zbl 1022.76016
Shkalikov, A. A.; Tumanov, S. N.
2002
Spectral analysis of periodic differential operator matrices of mixed order. Zbl 1064.34074
Hryniv, R.; Shkalikov, A.; Vladimirov, A.
2002
On the computing of the eigenvalues of the Orr-Sommerfeld problem. Zbl 1052.65069
Neiman-zade, M. I.; Shkalikov, A. A.
2002
Spectral analysis of the Regge problem. Zbl 1186.34126
Shkalikov, A. A.
2001
An operator model for the oscillation problem of liquids on an elastic bottom. Zbl 0973.35140
Griniv, R. O.; Dobrokhotov, S. Yu.; Shkalikov, A. A.
2000
Sturm-Liouville operators with singular potentials. Zbl 0968.34072
Savchuk, A. M.; Shkalikov, A. A.
1999
Schrödinger operators with singular potentials from the space of multiplicators. Zbl 0991.47036
Neiman-Zade, M. I.; Shkalikov, A. A.
1999
A Sturm-Liouville problem with physical and spectral parameters in boundary conditions. Zbl 0958.34023
Ben Amara, J.; Shkalikov, A. A.
1999
On the existence of invariant subspaces of dissipative operators in space with indefinite metric. Zbl 0960.47020
Shkalikov, A. A.
1999
Operator models in elasticity theory and hydromechanics and the associated analytic semigroups. Zbl 1049.76536
Griniv, R. O.; Shkalikov, A. A.
1999
On the eigenvalue accumulation of Sturm-Liouville problems depending nonlinearly on the spectral parameter. Zbl 0892.34019
Mennicken, R.; Schmid, H.; Shkalikov, A. A.
1998
On the stability of a top with a cavity filled with a viscous fluid. Zbl 0960.76037
Kostyuchenko, A. G.; Shkalikov, A. A.; Yurkin, M. Yu.
1998
How to define the Orr-Sommerfeld operator? Zbl 1029.47503
Shkalikov, A. A.
1998
Factorization of elliptic pencils and the Mandelstam hypothesis. Zbl 0919.47013
Shkalikov, A. A.
1998
The limit behavior of the spectrum for large parameter values in a model problem. Zbl 0937.34071
Shkalikov, A. A.
1997
Spectral decomposition of symmetric operator matrices. Zbl 0874.47009
Mennicken, Reinhard; Shkalikov, Andrey A.
1996
Operator pencils arising in elasticity and hydrodynamics: The instability index formula. Zbl 0860.47009
Shkalikov, A. A.
1996
Spectral analysis for linear pencils $$N-\lambda P$$ of ordinary differential operators. Zbl 0862.34058
Shkalikov, Andrey A.; Tretter, Christiane
1996
Boundary value problems with the spectral parameter in the boundary conditions. Zbl 0889.34066
Shkalikov, A. A.
1996
On the essential spectrum of matrix operators. Zbl 0871.47005
Shkalikov, A. A.
1995
The essential spectrum of some matrix operators. Zbl 0831.47001
Atkinson, F. V.; Langer, H.; Mennicken, R.; Shkalikov, A. A.
1994
Kamke problems. Properties of the eigenfunctions. Zbl 0813.34071
Shalikov, Andrey A.; Tretter, Christiane
1994
Damped vibrations of beams and related spectral problems. Zbl 0801.73044
Lancaster, Peter; Shkalikov, A.
1994
On an operator pencil arising in the problem of beam oscillation with internal damping. Zbl 0944.47031
Shkalikov, A. A.; Griniv, R. O.
1994
Criterion on the eigenvalue accumulation of nonlinear spectral problems for ordinary differential operators with singularities. Zbl 0819.76100
Mennicken, R.; Schmid, H.; Shkalikov, A. A.
1994
Strongly definitizable linear pencils in Hilbert space. Zbl 0794.47009
Lancaster, P.; Shkalikov, A.; Ye, Qiang
1993
Basis property of eigenfunctions of a problem on antiplanar vibrations of a cylinder with external friction. Zbl 0794.73034
Shkalikov, A. A.
1993
The problem of steady-state oscillations of transversally isotropic half- cylinder. Zbl 0772.73053
Shkalikov, A. A.; Shkred, A. V.
1992
A problem on stationary vibrations of a transversally isotropic semi- cylinder. Zbl 0746.73014
Shkalikov, A. A.; Shkred, A. V.
1991
Elliptic equations in Hilbert space and associated spectral problems. Zbl 0703.34083
Shkalikov, A. A.
1990
Elliptic equations in Hilbert space and spectral problems connected with them. Zbl 0695.34023
Shkalikov, A. A.
1989
Strongly damped pencils of operators and solvability of the corresponding operator-differential equations. Zbl 0668.47010
Shkalikov, A. A.
1989
Compact perturbations of overdamped operator pencils. Zbl 0677.47011
Shkalikov, A. A.; Pliev, V. T.
1989
Overdamped operator pencils and solvability of corresponding operator- differential equations. Zbl 0652.47011
Shkalikov, A. A.
1988
On selection principles and properties of a part of eigen- and associated elements of operator bundles. Zbl 0661.47017
Shkalikov, A. A.
1988
Selection principles and properties of some proper and adjoined elements of operator pencils. Zbl 0708.47014
Shkalikov, A. A.
1988
Boundary problems for ordinary differential equations with parameter in the boundary conditions. Zbl 0609.34019
Shkalikov, A. A.
1986
On the minimality of the derivative chains corresponding to the part of eigen and associated elements of selfadjoint operator pencils. Zbl 0591.47014
Shkalikov, A. A.
1985
On properties of some of the eigenelements and associated elements of selfadjoint quadratic operator pencils. Zbl 0666.42019
Shkalikov, A. A.
1985
Theorems of Tauberian type on the distribution of zeros of holomorphic functions. Zbl 0565.30025
Shkalikov, A. A.
1985
Theorems of Tauberian type on the distribution of the zeros of holomorphic functions. Zbl 0545.30021
Shkalikov, A. A.
1984
Operator differential equations on a semiaxis and related spectral problems for selfadjoint pencils of operators. Zbl 0596.34033
Shkalikov, A. A.
1984
Zero distribution for pairs of holomorphic functions with applications to eigenvalue distribution. Zbl 0545.30020
Shkalikov, A. A.
1984
Boundary value problems for ordinary differential equations with a parameter in the boundary conditions. Zbl 0553.34014
Shkalikov, A. A.
1983
Self$$adjoint$$ quadratic operator pencils and elliptic problems. Zbl 0531.47017
Kostyuchenko, A. G.; Shkalikov, A. A.
1983
Boundary-value problems for ordinary differential equations with a parameter in the boundary conditions. Zbl 0515.34019
Shkalikov, A. A.
1983
Some questions of the theory of polynomial operator pencils. Zbl 0527.47012
Shkalikov, A. A.
1983
Some problems in the theory of polynomial operator pencils. Zbl 0557.47011
Shkalikov, A. A.
1983
Kostyuchenko, A. G.; Shkalikov, A. A.
1983
The basis problem of the eigenfunctions of ordinary differential operators with integral boundary conditions. Zbl 0565.34020
Shkalikov, A. A.
1982
Estimates of meromorphic functions and summability theorems. Zbl 0521.47012
Shkalikov, A. A.
1982
Property of the eigenvectors of quadratic operator pencils of being a basis. Zbl 0493.47012
Shkalikov, A. A.
1981
On the basis problem of the eigenfunctions of an ordinary differential operator. Zbl 0471.34014
Shkalikov, A. A.
1979
Über die Basiseigenschaften der Eigenfunktionen eines gewöhnlichen Differentialoperators. Zbl 0438.34021
Shkalikov, A. A.
1979
...and 6 more Documents
all top 5
#### Cited by 637 Authors
46 Shkalikov, Andreĭ Andreevich 18 Jeribi, Aref 18 Savchuk, Artem M. 18 Tretter, Christiane 16 Akhtyamov, Azamat Moukhtarovich 13 Mityagin, Boris Samuilovich 13 Veliev, Oktay Alish 13 Wang, Junmin 12 Malamud, Mark M. 12 Vlasov, Viktor Valentinovich 10 Möller, Manfred 10 Motovilov, Aleksandr Konstantinovich 10 Sadovnichiĭ, Viktor Antonovich 10 Sultanaev, Yaudat Talgatovich 9 Aliyev, Ziyatkhan S. 9 Freiling, Gerhard 9 Kerimov, Nazim B. 9 Kostenko, Aleksey S. 9 Mennicken, Reinhard 9 Vladimirov, Anton A. 8 Albeverio, Sergio A. 8 Aliev, Araz R. 8 Djakov, Plamen B. 8 Kappeler, Thomas 8 Langer, Heinz 8 Mirzoev, Karakhan Agakhan 8 Rautian, Nadegda Aleksandrovna 8 Sadovnichaya, I. V. 7 Eckhardt, Jonathan 7 Moalla, Nedra 7 Mukhtarov, Oktay Sh. 7 Xu, Gen-Qi 7 Yurko, Vjacheslav Anatoljevich 6 Ammar, Aymen 6 Ben Amara, Jamel 6 Bruk, Vladislav Moiseevich 6 Guo, Bao-Zhu 6 Hryniv, Rostyslav O. 6 Kritskov, Leonid V. 6 Shafarevich, Andreĭ Igorevich 6 Siegl, Petr 6 Topalov, Peter J. 6 Trunk, Carsten 5 Gesztesy, Fritz 5 Güldü, Yalçın 5 Ishkin, Khabir Kabirovich 5 Kanguzhin, Baltabek Esmatovich 5 Kapustin, N. Yu 5 Konechnaya, Natal’ya Nikolaevna 5 Kozlov, Valeriĭ Vasil’evich 5 Krichen, Bilel 5 Langer, Matthias 5 Lunyov, Anton A. 5 Mirzoev, Sabir Sultanaga 5 Mitrokhin, Sergeĭ Ivanovich 5 Ozkan, Ahmet Sinan 5 Polyakov, Dmitriĭ Mikhaĭlovich 5 Teschl, Gerald 5 Vladykina, Veronika Evgen’evna 5 Walha, Ines 4 Binding, Paul Anthony 4 Buterin, Sergey Alexandrovich 4 Chen, Shaozhu 4 Imanbaev, Nurlan Sayramovich 4 Kaya, Ufuk 4 Kostyuchenko, Anatolii Gordeevich 4 Lomov, Igor’ Sergeevich 4 Mamedov, Khanlar R. 4 Mazzone, Giusy 4 Pechentsov, A. S. 4 Qi, Jiangang 4 Ran, André C. M. 4 Ugurlu, Ekin 4 Yang, Chuanfu 4 Yung, Siu Pang 3 Akdoğan, Zülfigar 3 Allahverdiev, Bilender Paşaoğlu 3 Baskakov, Anatoliĭ Grigor’evich 3 Behrndt, Jussi 3 Belyaev, Alexei A. 3 Boulton, Lyonell S. 3 Braeutigam, Irina N. 3 Browne, Patrick J. 3 Chen, Alatancang 3 Eryılmaz, Aytekin 3 Esina, A. I. 3 Guo, Yanni 3 Ibrogimov, Orif O. 3 Jovanovic, Vojin T. 3 Keskin, Baki 3 Khanmamedov, Agil Khanmamed ogly 3 Kostin, Andrey B. 3 Kurbanov, Vali M. 3 Lancaster, Peter 3 Makin, Alexander S. 3 Markus, Alexander S. 3 Molnar, Jan-Cornelius 3 Mykytyuk, Yaroslav V. 3 Naboko, Serguei N. 3 Nazarov, Alexander I. ...and 537 more Authors
all top 5
#### Cited in 174 Serials
78 Mathematical Notes 60 Differential Equations 26 Journal of Mathematical Analysis and Applications 24 Journal of Differential Equations 22 Integral Equations and Operator Theory 21 Journal of Mathematical Sciences (New York) 19 Mathematische Nachrichten 19 Doklady Mathematics 18 Functional Analysis and its Applications 15 Journal of Functional Analysis 12 Siberian Mathematical Journal 11 Linear Algebra and its Applications 11 Ufimskiĭ Matematicheskiĭ Zhurnal 10 Journal of Mathematical Physics 10 Mathematical Methods in the Applied Sciences 10 Ukrainian Mathematical Journal 10 Results in Mathematics 9 Transactions of the Moscow Mathematical Society 9 Russian Mathematics 9 Mediterranean Journal of Mathematics 9 Boundary Value Problems 9 Complex Analysis and Operator Theory 8 Proceedings of the Steklov Institute of Mathematics 8 Eurasian Mathematical Journal 7 Theoretical and Mathematical Physics 7 Computational Mathematics and Mathematical Physics 7 Russian Journal of Mathematical Physics 6 Applicable Analysis 6 Moscow University Mathematics Bulletin 6 Russian Mathematical Surveys 5 Proceedings of the American Mathematical Society 5 St. Petersburg Mathematical Journal 5 Central European Journal of Mathematics 5 Analysis and Mathematical Physics 4 Archive for Rational Mechanics and Analysis 4 Israel Journal of Mathematics 4 Linear and Multilinear Algebra 4 Journal of Computational and Applied Mathematics 4 Systems & Control Letters 4 Journal of Inverse and Ill-Posed Problems 4 European Series in Applied and Industrial Mathematics (ESAIM): Control, Optimization and Calculus of Variations 4 Journal of Dynamical and Control Systems 3 Communications in Mathematical Physics 3 Journal of Applied Mathematics and Mechanics 3 Journal of Engineering Mathematics 3 Letters in Mathematical Physics 3 Rocky Mountain Journal of Mathematics 3 Applied Mathematics and Computation 3 Mathematische Zeitschrift 3 Acta Applicandae Mathematicae 3 Physica D 3 Communications in Partial Differential Equations 3 Proceedings of the Royal Society of Edinburgh. Section A. Mathematics 3 Electronic Journal of Differential Equations (EJDE) 3 Abstract and Applied Analysis 3 Lobachevskii Journal of Mathematics 3 Journal of Pseudo-Differential Operators and Applications 3 Izvestiya Saratovskogo Universiteta. Novaya Seriya. Seriya Matematika, Mekhanika, Informatika 2 Computers & Mathematics with Applications 2 Journal d’Analyse Mathématique 2 Annali di Matematica Pura ed Applicata. Serie Quarta 2 International Journal of Mathematics and Mathematical Sciences 2 Journal of Soviet Mathematics 2 Mathematische Annalen 2 Quaestiones Mathematicae 2 Applied Mathematics Letters 2 SIAM Journal on Mathematical Analysis 2 Annales Mathématiques Blaise Pascal 2 Turkish Journal of Mathematics 2 Opuscula Mathematica 2 Izvestiya: Mathematics 2 Acta Mathematica Sinica. English Series 2 Communications on Pure and Applied Analysis 2 Vladikavkazskiĭ Matematicheskiĭ Zhurnal 2 Advances in Difference Equations 2 Operators and Matrices 2 Journal of Spectral Theory 2 Afrika Matematika 2 Carpathian Mathematical Publications 2 Journal of Function Spaces 1 Acta Mechanica 1 International Journal of Control 1 Inverse Problems 1 Journal of Fluid Mechanics 1 Journal of Statistical Physics 1 Moscow University Mechanics Bulletin 1 Reports on Mathematical Physics 1 ZAMP. Zeitschrift für angewandte Mathematik und Physik 1 Zhurnal Vychislitel’noĭ Matematiki i Matematicheskoĭ Fiziki 1 Reviews in Mathematical Physics 1 Theory of Probability and its Applications 1 Advances in Mathematics 1 Archiv der Mathematik 1 BIT 1 Calcolo 1 Glasgow Mathematical Journal 1 Inventiones Mathematicae 1 Journal of Approximation Theory 1 Journal of Optimization Theory and Applications 1 Journal für die Reine und Angewandte Mathematik ...and 74 more Serials
all top 5
#### Cited in 38 Fields
415 Ordinary differential equations (34-XX) 327 Operator theory (47-XX) 140 Partial differential equations (35-XX) 41 Mechanics of deformable solids (74-XX) 37 Quantum theory (81-XX) 32 Fluid mechanics (76-XX) 30 Functional analysis (46-XX) 25 Systems theory; control (93-XX) 19 Linear and multilinear algebra; matrix theory (15-XX) 19 Integral equations (45-XX) 16 Dynamical systems and ergodic theory (37-XX) 14 Numerical analysis (65-XX) 11 Harmonic analysis on Euclidean spaces (42-XX) 9 Probability theory and stochastic processes (60-XX) 9 Mechanics of particles and systems (70-XX) 9 Statistical mechanics, structure of matter (82-XX) 6 Difference and functional equations (39-XX) 5 Real functions (26-XX) 5 Calculus of variations and optimal control; optimization (49-XX) 4 Global analysis, analysis on manifolds (58-XX) 3 Functions of a complex variable (30-XX) 3 Several complex variables and analytic spaces (32-XX) 3 Special functions (33-XX) 3 Optics, electromagnetic theory (78-XX) 3 Biology and other natural sciences (92-XX) 2 History and biography (01-XX) 2 Potential theory (31-XX) 2 Approximations and expansions (41-XX) 1 General and overarching topics; collections (00-XX) 1 Combinatorics (05-XX) 1 Algebraic geometry (14-XX) 1 Sequences, series, summability (40-XX) 1 Integral transforms, operational calculus (44-XX) 1 Differential geometry (53-XX) 1 General topology (54-XX) 1 Astronomy and astrophysics (85-XX) 1 Geophysics (86-XX) 1 Information and communication theory, circuits (94-XX)
#### Wikidata Timeline
The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.
| 2021-01-22T19:15:48 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 1, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.7858811020851135, "perplexity": 5189.3194188008065}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2021-04/segments/1610703531335.42/warc/CC-MAIN-20210122175527-20210122205527-00084.warc.gz"}
|
https://par.nsf.gov/biblio/10161733
|
Accelerating Model Free Reinforcement Learning with Imperfect Model Knowledge in Dynamic Spectrum Access
Current studies that apply reinforcement learning (RL) to dynamic spectrum access (DSA) problems in wireless communications systems are mainly focusing on model-free RL. However, in practice model-free RL requires large number of samples to achieve good performance making it impractical in real time applications such as DSA. Combining model-free and model-based RL can potentially reduce the sample complexity while achieving similar level of performance as model-free RL as long as the learned model is accurate enough. However, in complex environment the learned model is never perfect. In this paper we combine model-free and model-based reinforcement learning, introduce an algorithm that can work with an imperfectly learned model to accelerate the model-free reinforcement learning. Results show our algorithm achieves higher sample efficiency than standard model-free RL algorithm and Dyna algorithm (a standard algorithm that integrating model-based and model-free RL) with much lower computation complexity than the Dyna algorithm. For the extreme case where the learned model is highly inaccurate, the Dyna algorithm performs even worse than the model-free RL algorithm while our algorithm can still outperform the model-free RL algorithm.
Authors:
; ; ; ; ; ; ;
Award ID(s):
Publication Date:
NSF-PAR ID:
10161733
Journal Name:
IEEE Internet of Things Journal
Page Range or eLocation-ID:
1 to 1
ISSN:
2372-2541
| 2023-03-30T06:07:39 |
{"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.8182137608528137, "perplexity": 909.3941387715014}, "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/1679296949097.61/warc/CC-MAIN-20230330035241-20230330065241-00631.warc.gz"}
|
https://gea.esac.esa.int/archive/documentation/GDR1/datamodel/Ch4/igsl_source.html
|
# 4.2 igsl_source
The Initial Gaia Source List (IGSL) was commissioned by DPAC to fulfil the following broad requirements: all-sky positions, proper motions, and magnitudes for objects to a limit of Gaia magnitude $G$ = 21 where possible, e.g., where there are large ($>$10000 square degrees) catalogs that reach that limit. The proper motions and magnitudes are provided on a best effort basis, nominally with precisions of 10 mas yr${}^{-1}$ and 0.3 magnitudes, respectively, but obviously limited by the currently available large catalogs. The DPAC Quasar and the Ecliptic Pole catalogs are included with no selection on magnitudes. HIPPARCOS objects were also included with no selection on magnitudes. The IGSL has been used as the starting point for the Initial Data Treatment (IDT) cross-matching routines (see Smart, R.L. and Nicastro, L., A&A, 570, A87 (2014) for further details).
Columns description:
solution_id : Solution Identifier (long)
The data in the MDB will be described by means of a ”Solution identifier” parameter. This will be a numeric field attached to each table row that can be used to unequivocally identify the version of all the subsystems that where used in the generation of the data as well as the input data used. Each DPC generating the data will have the freedom to choose the Solution identifier number, but they must ensure that given the Solution identifier they can provide detailed information about the ”conditions” used to generate the data: versions of the software, version of the data used…
source_id : source identifier (long)
A unique single numerical identifier of the source (for a detailed description see gaia_source.source_id)
ra : Right Ascension at catalogue epoch (double, Angle[deg])
The right ascension at epoch and equinox J2000
dec : Declination at catalogue epoch (double, Angle[deg])
The declination at epoch and equinox J2000
ra_error : Error in Right Ascension (float, Angle[mas])
The mean error in the right ascension at mean epoch
dec_error : Error in Declination (float, Angle[mas])
The mean error in the declination at mean epoch
ra_epoch : Mean Epoch of Right Ascension (float, Time[GaiaTime] )
The mean epoch of the right ascension Julian Year in TCB. Note if there are proper motions the actual position will be at J2000 to have a consistent catalog and this is provided if the user wishes to add new information or find the best position.
dec_epoch : Mean Epoch of Declination (float, Time[GaiaTime] )
The mean epoch of the declination Julian Year in TCB. Note if there are proper motions the actual position will be at J2000 to have a consistent catalog and this is provided if the user wishes to add new information or find the best position.
source_position : Source of the position estimate (byte)
The code that appears in the IgslReferences that describes where the positional information comes from.
pm_ra : Proper motion in RA * at catalogue epoch (float, Angular Velocity[mas/year])
Proper motion in right ascension multiplied by cos(declination).
pm_dec : Proper motion in DEC at catalogue epoch (float, Angular Velocity[mas/year])
Proper motion in declination
pm_ra_error : Error in Proper motion in RA (float, Angular Velocity[mas/year])
Mean error of proper motion in RA * cos(declination)
pm_dec_error : Error in proper motion in DEC (float, Angular Velocity[mas/year])
Mean error of proper motion in declination
source_mu : Source of the proper motions (byte)
The code that appears in the IgslReferences that describes where this data point comes from.
galactic_lon : Galactic Longditude (float, Angle[deg] )
Galactic Longditude calculated in float to use for indexing
galactic_lat : Galactic Latitude (float, Angle[deg] )
Galactic Latitude calculated in float to use for indexing
ecliptic_lon : Ecliptic Longditude (float, Angle[deg] )
Ecliptic Longditude calculated in float to use for indexing
ecliptic_lat : Ecliptic Latitude (float, Angle[deg] )
Ecliptic Latitude calculated in float to use for indexing
mag_bj : B mag measure, GSC23 system (float, Magnitude[mag])
The $B_{J}$ magnitude from the GSC23 when present or estimated from transformations when not present in the GSC23 or too bright to be reliable from GSC23. Very similar to B Johnson.
mag_bj_error : Error in B mag measure (float, Magnitude[mag])
Error in the $B_{J}$ magnitude
source_mag_bj : source B mag (byte)
Code in IgslReferences that describes where this magnitude comes from.
mag_rf : R mag measure, GSC23 system (float, Magnitude[mag])
The $R_{F}$ magnitude from the GSC23 when present or estimated from transformations when not present in the GSC23 or too bright to be reliable from GSC23. Very similar to R cousins.
mag_rf_error : Error in R mag measure (float, Magnitude[mag])
Error in $R_{F}$
source_mag_rf : source of R mag (byte)
Code in IgslReferences that describes where this magnitude comes from.
mag_g : G mag estimate (float, Magnitude[mag])
Estimated $G$ magnitude based on transformations in livelink document RLS 001
mag_g_error : Error in G mag estimate (float, Magnitude[mag])
Estimated of error on G magnitude
source_mag_g : Source G mag (byte)
Code in IgslReferences that describes which transformation used.
mag_grvs : Grvs mag estimate (float, Magnitude[mag])
Estimated $G_{r}vs$ magnitude based on transformations in livelink document RLS 004
mag_grvs_error : Error in Grvs mag estimate (float, Magnitude[mag])
Estimated of error on $G_{r}vs$ magnitude
source_mag_grvs : Source Grvs mag (byte)
Code in SourceCatalogIDs that describes where base magnitudes came from
classification : Classification (boolean)
Classification, simply a 0=star and 1=nonstar taken from different sources as given in the souceClass field
source_classification : source of Classification (byte)
Code in IgslReferences that describes where this datapoint comes from.
toggle_asc : Toggle for Atittude Star Catalog (boolean)
A boolean that indicates if the objects is to be used for the Atittude Star Catalog.
aux_gsc23 : Present in the GSC2.3 catalog (boolean)
A boolean that indicates if the objects is present in the GSC2.3 cat, 0=no, 1=yes. Version and catalog details in the SourceCatalogReferences table. If yes the GSC2.3 id is in the SourceCatalogIDs as idGSC23.
aux_sdss : Present in the SDSS catalog (boolean)
A boolean that indicates if the objects is present in the SDSS cat, 0=no, 1=yes. Version and catalog details in the SourceCatalogReferences table. If yes the ID is in the the SourceCatalogIDs as idSDSS
aux_ucac : Present in the UCAC3 catalog (boolean)
A boolean that indicates if the objects is present in the UCAC cat, 0=no, 1=yes. Version and catalog details in the SourceCatalogReferences table. If yes the ID is in the the iSourceCatalogIDs as idUCAC.
aux_lqrf : Present in the LQRF QSO aux catalog (boolean)
A boolean that indicates if the objects is present in the CU3 QSO Aux cat GIQC, 0=no, 1=yes. Version and catalog details in the SourceCatalogReferences table. If yes the ID is in the the SourceCatalogIDs as idLQRF.
aux_tycho : Present in the TYCHO2 catalog (boolean)
A boolean that indicates if the objects is present in theTYCHO2 cat, 0=no, 1=yes. Version and catalog details in the SourceCatalogReferences table. If yes the ID is in the the SourceCatalogIDs as idTYCHO
aux_hip : Present in the Hipparcos catalog (boolean)
A boolean that indicates if the objects is present in the Hipparcos catalog, 0=no, 1=yes=true.
aux_ppmxl : Present in the PPMXL catalog (boolean)
A boolean that indicates if the objects is present in the PPMXL cat, 0=no, 1=yes. Version and catalog details in the SourceCatalogReferences table. If yes the ID is in the the SourceCatalogIDs as idPPMXL
aux_ogle : Present in the OGLE catalog (boolean)
A boolean that indicates if the objects is present in the OGLE cat, 0=no, 1=yes. Version and catalog details in the SourceCatalogReferences table. If yes the ID is in the the SourceCatalogIDs as idOGLE
aux_tmass : Present in the Two MASS PSC catalog (boolean)
A boolean that indicates if the objects is present in the Two-MASS cat, 0=no, 1=yes. Version and catalog details in the SourceCatalogReferences table. If yes the ID is in the the SourceCatalogIDs as idTMASS.
aux_epc : Present in the Ecliptic Poles Catalog (boolean)
A boolean that indicates if the objects is present in the EPC, false=no, true=yes. Version and catalog details in the SourceCatalogReference table. If yes, the number in the SourceCatalogIDs table is the number in EPC.
| 2021-08-02T01:56:50 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 10, "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.41728392243385315, "perplexity": 8467.086213398654}, "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-31/segments/1627046154302.46/warc/CC-MAIN-20210802012641-20210802042641-00329.warc.gz"}
|
https://www.usgs.gov/media/images/focal-mechanism-normal-fault-left-and-thrust-fault-right
|
# Focal Mechanism for normal fault (left) and thrust fault (right)
### Detailed Description
Example of a focal mechanism for a normal fault (left) and a thrust fault (right). A sketch of the cross-section for the normal fault is under the focal mechanism representing that fault type on the left, and the cross-section for the thrust fault is under the focal mechanism representing that fault type on the right.
Public Domain.
| 2023-03-29T14:32:55 |
{"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.8508681654930115, "perplexity": 2491.9153934063233}, "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/1679296948976.45/warc/CC-MAIN-20230329120545-20230329150545-00753.warc.gz"}
|
https://dlmf.nist.gov/18.35
|
# §18.35 Pollaczek Polynomials
## §18.35(i) Definition and Hypergeometric Representation
18.35.1 $\displaystyle P^{(\lambda)}_{-1}\left(x;a,b\right)$ $\displaystyle=0,$ $\displaystyle P^{(\lambda)}_{0}\left(x;a,b\right)$ $\displaystyle=1,$ ⓘ Symbols: $P^{(\NVar{\lambda})}_{\NVar{n}}\left(\NVar{x};\NVar{a},\NVar{b}\right)$: Pollaczek polynomial and $x$: real variable Permalink: http://dlmf.nist.gov/18.35.E1 Encodings: TeX, TeX, pMML, pMML, png, png See also: Annotations for §18.35(i), §18.35 and Ch.18
and
18.35.2 $(n+1)P^{(\lambda)}_{n+1}\left(x;a,b\right)={2((n+\lambda+a)x+b)}P^{(\lambda)}_% {n}\left(x;a,b\right)-{(n+2\lambda-1)}P^{(\lambda)}_{n-1}\left(x;a,b\right),$ $n=0,1,\dots$. ⓘ Symbols: $P^{(\NVar{\lambda})}_{\NVar{n}}\left(\NVar{x};\NVar{a},\NVar{b}\right)$: Pollaczek polynomial, $n$: nonnegative integer and $x$: real variable Permalink: http://dlmf.nist.gov/18.35.E2 Encodings: TeX, pMML, png See also: Annotations for §18.35(i), §18.35 and Ch.18
Next, let
18.35.3 $\tau_{a,b}(\theta)=\frac{a\cos\theta+b}{\sin\theta},$ $0<\theta<\pi$. ⓘ Defines: $\tau_{a,b}(\theta)$ (locally) Symbols: $\pi$: the ratio of the circumference of a circle to its diameter, $\cos\NVar{z}$: cosine function and $\sin\NVar{z}$: sine function Permalink: http://dlmf.nist.gov/18.35.E3 Encodings: TeX, pMML, png See also: Annotations for §18.35(i), §18.35 and Ch.18
Then
18.35.4 $P^{(\lambda)}_{n}\left(\cos\theta;a,b\right)=\frac{{\left(\lambda-\mathrm{i}% \tau_{a,b}(\theta)\right)_{n}}}{n!}e^{\mathrm{i}n\theta}\*{{}_{2}F_{1}}\left({% -n,\lambda+\mathrm{i}\tau_{a,b}(\theta)\atop-n-\lambda+1+\mathrm{i}\tau_{a,b}(% \theta)};e^{-2\mathrm{i}\theta}\right)=\sum_{\ell=0}^{n}\frac{{\left(\lambda+% \mathrm{i}\tau_{a,b}(\theta)\right)_{\ell}}}{\ell!}\frac{{\left(\lambda-% \mathrm{i}\tau_{a,b}(\theta)\right)_{n-\ell}}}{(n-\ell)!}e^{\mathrm{i}(n-2\ell% )\theta}.$ ⓘ Defines: $P^{(\NVar{\lambda})}_{\NVar{n}}\left(\NVar{x};\NVar{a},\NVar{b}\right)$: Pollaczek polynomial Symbols: ${{}_{2}F_{1}}\left(\NVar{a},\NVar{b};\NVar{c};\NVar{z}\right)$: $=F\left(\NVar{a},\NVar{b};\NVar{c};\NVar{z}\right)$ notation for Gauss’ hypergeometric function, ${\left(\NVar{a}\right)_{\NVar{n}}}$: Pochhammer’s symbol (or shifted factorial), $\cos\NVar{z}$: cosine function, $\mathrm{e}$: base of natural logarithm, $!$: factorial (as in $n!$), $\ell$: nonnegative integer, $n$: nonnegative integer, $x$: real variable and $\tau_{a,b}(\theta)$ Permalink: http://dlmf.nist.gov/18.35.E4 Encodings: TeX, pMML, png See also: Annotations for §18.35(i), §18.35 and Ch.18
For the hypergeometric function ${{}_{2}F_{1}}$ see §§15.1, 15.2(i).
## §18.35(ii) Orthogonality
18.35.5 ${\int_{-1}^{1}P^{(\lambda)}_{n}\left(x;a,b\right)P^{(\lambda)}_{m}\left(x;a,b% \right)w^{(\lambda)}(x;a,b)\mathrm{d}x=0},$ $n\neq m$,
where
18.35.6 $w^{(\lambda)}(\cos\theta;a,b)=\pi^{-1}\*2^{2\lambda-1}\*e^{(2\theta-\pi)\*\tau% _{a,b}(\theta)}\*(\sin\theta)^{2\lambda-1}\*{\left|\Gamma\left(\lambda+\mathrm% {i}\tau_{a,b}(\theta)\right)\right|^{2}},$ $a\geq b\geq-a$, $\lambda>-\frac{1}{2}$, $0<\theta<\pi$.
## §18.35(iii) Other Properties
18.35.7 $(1-ze^{\mathrm{i}\theta})^{-\lambda+\mathrm{i}\tau_{a,b}(\theta)}(1-ze^{-% \mathrm{i}\theta})^{-\lambda-\mathrm{i}\tau_{a,b}(\theta)}=\sum_{n=0}^{\infty}% P^{(\lambda)}_{n}\left(\cos\theta;a,b\right)z^{n},$ $|z|<1$, $0<\theta<\pi$.
18.35.8 $P^{(\lambda)}_{n}\left(x;0,0\right)=C^{(\lambda)}_{n}\left(x\right),$
18.35.9 $P^{(\lambda)}_{n}\left(\cos\phi;0,x\sin\phi\right)=P^{(\lambda)}_{n}\left(x;% \phi\right).$
For the polynomials $C^{(\lambda)}_{n}\left(x\right)$ and $P^{(\lambda)}_{n}\left(x;\phi\right)$ see §§18.3 and 18.19, respectively.
See Bo and Wong (1996) for an asymptotic expansion of $P^{(\frac{1}{2})}_{n}\left(\cos\left(n^{-\frac{1}{2}}\theta\right);a,b\right)$ as $n\to\infty$, with $a$ and $b$ fixed. This expansion is in terms of the Airy function $\mathrm{Ai}\left(x\right)$ and its derivative (§9.2), and is uniform in any compact $\theta$-interval in $(0,\infty)$. Also included is an asymptotic approximation for the zeros of $P^{(\frac{1}{2})}_{n}\left(\cos\left(n^{-\frac{1}{2}}\theta\right);a,b\right)$.
| 2018-11-17T01:21:39 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 84, "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.9854201078414917, "perplexity": 9851.213705001084}, "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-47/segments/1542039743247.22/warc/CC-MAIN-20181116235534-20181117021534-00211.warc.gz"}
|
http://dlmf.nist.gov/3.3
|
# §3.3 Interpolation
## §3.3(i) Lagrange Interpolation
The nodes or abscissas are real or complex; function values are . Given distinct points and corresponding function values , the Lagrange interpolation polynomial is the unique polynomial of degree not exceeding such that , . It is given by
3.3.1
where
3.3.2
Here the prime signifies that the factor for is to be omitted, is the Kronecker symbol, and is the nodal polynomial
3.3.3
With an error term the Lagrange interpolation formula for is given by
3.3.4
If , (), and the nodes are real, and is continuous on the smallest closed interval containing , then the error can be expressed
3.3.5
for some . If is analytic in a simply-connected domain 1.13(i)), then for ,
where is a simple closed contour in described in the positive rotational sense and enclosing the points .
## §3.3(ii) Lagrange Interpolation with Equally-Spaced Nodes
The -point formula (3.3.4) can be written in the form
3.3.7,
where the nodes () and function are real,
3.3.8
3.3.9
and are the Lagrangian interpolation coefficients defined by
3.3.10
The remainder is given by
3.3.11
where is as in §3.3(i).
Let be defined by
3.3.12
where the maximum is taken over -intervals given in the formulas below. Then for these -intervals,
3.3.13
3.3.14,
3.3.15.
3.3.16,
3.3.18.
3.3.19,
3.3.21
3.3.22,
3.3.23
3.3.24
3.3.25,
3.3.26
3.3.27
3.3.28,
3.3.29
3.3.30
3.3.31,
3.3.33
## §3.3(iii) Divided Differences
The divided differences of relative to a sequence of distinct points are defined by
3.3.34
and so on. Explicitly, the divided difference of order is given by
3.3.35
If and the () are real, and is times continuously differentiable on a closed interval containing the , then
3.3.36
and again is as in §3.3(i). If is analytic in a simply-connected domain , then for ,
where is given by (3.3.3), and is a simple closed contour in described in the positive rotational sense and enclosing .
## §3.3(iv) Newton’s Interpolation Formula
This represents the Lagrange interpolation polynomial in terms of divided differences:
3.3.38
The interpolation error is as in §3.3(i). Newton’s formula has the advantage of allowing easy updating: incorporation of a new point requires only addition of the term with to (3.3.38), plus the computation of this divided difference. Another advantage is its robustness with respect to confluence of the set of points . For example, for coincident points the limiting form is given by .
## §3.3(v) Inverse Interpolation
In this method we interchange the roles of the points and the function values . It can be used for solving a nonlinear scalar equation approximately. Another approach is to combine the methods of §3.8 with direct interpolation and §3.4.
### ¶ Example
To compute the first negative zero of the Airy function 9.2). The inverse interpolation polynomial is given by
3.3.39
compare (3.3.38). With , , , we obtain
3.3.40
and with we find that , with 4 correct digits. By using this approximation to as a new point, , and evaluating , we find that , with 9 correct digits.
For comparison, we use Newton’s interpolation formula (3.3.38)
3.3.41
with the derivative
3.3.42
and compute an approximation to by using Newton’s rule (§3.8(ii)) with starting value . This gives the new point . Then by using in Newton’s interpolation formula, evaluating and recomputing , another application of Newton’s rule with starting value gives the approximation , with 8 correct digits.
## §3.3(vi) Other Interpolation Methods
For Hermite interpolation, trigonometric interpolation, spline interpolation, rational interpolation (by using continued fractions), interpolation based on Chebyshev points, and bivariate interpolation, see Bulirsch and Rutishauser (1968), Davis (1975, pp. 27–31), and Mason and Handscomb (2003, Chapter 6). These references also describe convergence properties of the interpolation formulas.
For interpolation of a bounded function on the cardinal function of is defined by
3.3.43
where
3.3.44
is called the Sinc function. For theory and applications see Stenger (1993, Chapter 3).
| 2013-05-19T12:24:41 |
{"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.9593007564544678, "perplexity": 1235.284367101991}, "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-2013-20/segments/1368697503739/warc/CC-MAIN-20130516094503-00033-ip-10-60-113-184.ec2.internal.warc.gz"}
|
https://indico.fnal.gov/event/20381/contributions/57283/
|
# New Perspectives 2019
Jun 10 – 11, 2019
Fermi National Accelerator Laboratory
US/Central timezone
## Improving the spatial resolution of the ATLAS IBL silicon pixel detectors
Jun 10, 2019, 10:25 AM
15m
One West (Fermi National Accelerator Laboratory)
Oral
### Speaker
Spoorthi Nagasamudram
### Description
This project was realized primarily to test and improve the spatial tracking resolution of the ANL (Argonne National Laboratory) telescope consisting of the ATLAS IBL silicon pixel sensors and FE-I4 chips by making use of the test beam at Fermilab. In this paper, we will discuss the overall performance of the modules and how it can be improved. We will also discuss efforts made to improve the spatial resolution of the modules. In addition, we will also talk about successful attempts to simulate the spatial resolution of the modules using Allpix$^2$.
Slides
| 2023-01-28T13:12: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": 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.22066128253936768, "perplexity": 2602.645162082681}, "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/1674764499634.11/warc/CC-MAIN-20230128121809-20230128151809-00218.warc.gz"}
|
https://pos.sissa.it/297/253/
|
Volume 297 - XXV International Workshop on Deep-Inelastic Scattering and Related Subjects (DIS2017) - WG6 Spin and 3D Structure
The gluon Sivers asymmetry measurements at COMPASS
A. Szabelski* on behalf of the COMPASS Collaboration
*corresponding author
Full text: pdf
Pre-published on: 2017 October 16
Published on: 2018 January 16
Abstract
The Sivers function describes the correlation between the transverse spin of a nucleon and the transverse motion of its partons.
As such, a nonzero Sivers effect for gluons could be a signature of their nonzero orbital angular momentum inside the nucleon.
COMPASS has collected data of semi-inclusive deep inelastic scattering by impinging 160 GeV$/c$ muons on transversely polarised proton
and deuteron targets.
The gluon Sivers asymmetry is extracted from a high-$p_T$ hadron pair sample with the use of monte carlo simulations and the a neural network approach.
The results of a similar analysis for a Collins-like asymmetry for gluons will also be given.
DOI: https://doi.org/10.22323/1.297.0253
Open Access
Copyright owned by the author(s) under the term of the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
| 2018-07-16T23:44:36 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 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.5298138856887817, "perplexity": 5850.618853505164}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.3, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2018-30/segments/1531676589536.40/warc/CC-MAIN-20180716232549-20180717012549-00309.warc.gz"}
|
http://pdglive.lbl.gov/Particle.action;jsessionid=713CDCCEA231F9B59ECE13077BF54AB5?node=M300&init=0
|
OTHER LIGHT MESONS INSPIRE search
# Further States
This section contains states observed by a single group or states poorly established that thus need confirmation. QUANTUM NUMBERS, MASSES, WIDTHS, AND BRANCHING RATIOS
$\mathbf {{{\mathit X}{(360)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = ?{}^{?}(?{}^{?+})$
$\mathbf {{{\mathit X}{(1070)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = ?{}^{?}(0{}^{++})$
$\mathbf {{{\mathit X}{(1110)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 0{}^{+}(even{}^{++})$
$\mathbf {{{\mathit f}_{{0}}{(1200-1600)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 0{}^{+}(0{}^{++})$
$\mathbf {{{\mathit X}{(1420)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 2{}^{+}(0{}^{++})$
$\mathbf {{{\mathit X}{(1545)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = ?{}^{?}(?{}^{++})$
$\mathbf {{{\mathit X}{(1575)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = ?{}^{?}(1{}^{--})$
$\mathbf {{{\mathit X}{(1600)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 2{}^{+}(2{}^{++})$
$\mathbf {{{\mathit X}{(1650)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 0{}^{-}(?{}^{?-})$
$\mathbf {{{\mathit X}{(1730)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = ?{}^{?}(?{}^{?+})$
$\mathbf {{{\mathit X}{(1750)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = ?{}^{?}(1{}^{--})$
$\mathbf {B( {{\mathit X}{(1750)}} \rightarrow {{\overline{\mathit K}}^{*}{(892)}^{0}} {{\mathit K}^{0}} \rightarrow {{\mathit K}^{\pm}} {{\mathit \pi}^{\mp}} {{\mathit K}_S^0} )/B( {{\mathit X}{(1750)}} \rightarrow {{\mathit K}^{+}} {{\mathit K}^{-}} )}$
$\mathbf {B( {{\mathit X}{(1750)}} \rightarrow {{\mathit K}^{*}{(892)}^{\pm}} {{\mathit K}^{\mp}} \rightarrow {{\mathit K}_S^0} {{\mathit \pi}^{\pm}} {{\mathit K}^{\mp}} )/B( {{\mathit X}{(1750)}} \rightarrow {{\mathit K}^{+}} {{\mathit K}^{-}} )}$
$\mathbf {{{\mathit f}_{{2}}{(1750)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 0{}^{+}(2{}^{++})$
$\mathbf { \Gamma\mathrm {( {{\mathit K}} {{\overline{\mathit K}}} )} }$
$\mathbf { \Gamma\mathrm {( {{\mathit \gamma}} {{\mathit \gamma}} )} }$
$\mathbf { \Gamma\mathrm {( {{\mathit \pi}} {{\mathit \pi}} )} }$
$\mathbf { \Gamma\mathrm {( {{\mathit \eta}} {{\mathit \eta}} )} }$
$\mathbf {{{\mathit X}{(1775)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 1{}^{-}(?{}^{-+})$
$\mathbf {{{\mathit f}_{{0}}{(1800)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 0{}^{+}(0{}^{++})$
$\mathbf {{{\mathit X}}(1850 - 3100)}$ $\mathit I\mathit G(\mathit J{}^{PC}) = ?{}^{?}(1{}^{--})$
$\mathbf {{{\mathit X}{(1855)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = ?{}^{?}(?{}^{??})$
$\mathbf {{{\mathit X}{(1870)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = ?{}^{?}(2{}^{??})$
$\mathbf {{{\mathit a}_{{3}}{(1875)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 1{}^{-}(3{}^{++})$
$\mathbf {B( {{\mathit a}_{{3}}{(1875)}} \rightarrow {{\mathit f}_{{2}}{(1270)}} {{\mathit \pi}} )/B( {{\mathit a}_{{3}}{(1875)}} \rightarrow {{\mathit \rho}} {{\mathit \pi}} )}$
$\mathbf {B( {{\mathit a}_{{3}}{(1875)}} \rightarrow {{\mathit \rho}_{{3}}{(1690)}} {{\mathit \pi}} )/B( {{\mathit a}_{{3}}{(1875)}} \rightarrow {{\mathit \rho}} {{\mathit \pi}} )}$
$\mathbf {{{\mathit a}_{{1}}{(1930)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 1{}^{-}(1{}^{++})$
$\mathbf {{{\mathit X}{(1935)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 1{}^{+}(1{}^{-?})$
$\mathbf {{{\mathit \rho}_{{2}}{(1940)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 1{}^{+}(2{}^{--})$
$\mathbf {{{\mathit \omega}_{{3}}{(1945)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 0{}^{-}(3{}^{--})$
$\mathbf {{{\mathit a}_{{2}}{(1950)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 1{}^{-}(2{}^{++})$
$\mathbf {{{\mathit \omega}{(1960)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 0{}^{-}(1{}^{--})$
$\mathbf {{{\mathit b}_{{1}}{(1960)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 1{}^{+}(1{}^{+-})$
$\mathbf {{{\mathit h}_{{1}}{(1965)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 0{}^{-}(1{}^{+-})$
$\mathbf {{{\mathit f}_{{1}}{(1970)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 0{}^{+}(1{}^{++})$
$\mathbf {{{\mathit X}{(1970)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = ?{}^{?}(?{}^{??})$
$\mathbf {{{\mathit X}{(1975)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = ?{}^{?}(?{}^{??})$
$\mathbf {{{\mathit \omega}_{{2}}{(1975)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 0{}^{-}(2{}^{--})$
$\mathbf {{{\mathit a}_{{2}}{(1990)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 1{}^{-}(2{}^{++})$
$\mathbf {\Gamma\mathrm {( {{\mathit \gamma}} {{\mathit \gamma}} )} \Gamma\mathrm {( {{\mathit \pi}^{+}} {{\mathit \pi}^{-}} {{\mathit \pi}^{0}} )} / \Gamma\mathrm {(total)}}$
$\mathbf {{{\mathit \rho}{(2000)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 1{}^{+}(1{}^{--})$
$\mathbf {{{\mathit f}_{{2}}{(2000)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 0{}^{+}(2{}^{++})$
$\mathbf {{{\mathit X}{(2000)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 1{}^{-}(?{}^{?+})$
$\mathbf {{{\mathit X}{(2000)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = ?{}^{?}(4{}^{++})$
$\mathbf {{{\mathit \pi}_{{2}}{(2005)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 1{}^{-}(2{}^{-+})$
$\mathbf {{{\mathit \eta}{(2010)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 0{}^{+}(0{}^{-+})$
$\mathbf {{{\mathit \pi}_{{1}}{(2015)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 1{}^{-}(1{}^{-+})$
$\mathbf {{{\mathit a}_{{0}}{(2020)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 1{}^{-}(0{}^{++})$
$\mathbf {{{\mathit X}{(2020)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = ?{}^{?}(?{}^{??})$
$\mathbf {{{\mathit h}_{{3}}{(2025)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 0{}^{-}(3{}^{+-})$
$\mathbf {{{\mathit b}_{{3}}{(2030)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 1{}^{+}(3{}^{+-})$
$\mathbf {{{\mathit a}_{{2}}{(2030)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 1{}^{-}(2{}^{++})$
$\mathbf {{{\mathit a}_{{3}}{(2030)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 1{}^{-}(3{}^{++})$
$\mathbf {{{\mathit \eta}_{{2}}{(2030)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 0{}^{+}(2{}^{-+})$
$\mathbf {B( {{\mathit a}_{{2}}} {{\mathit \pi}} )_{\mathit L=0}/B( {{\mathit a}_{{2}}} {{\mathit \pi}} )_{\mathit L=2}}$
$\mathbf {B( {{\mathit a}_{{0}}} {{\mathit \pi}} )/B( {{\mathit a}_{{2}}} {{\mathit \pi}} )_{\mathit L=2}}$
$\mathbf {B( {{\mathit f}_{{2}}} {{\mathit \eta}} )/B( {{\mathit a}_{{2}}} {{\mathit \pi}} )_{\mathit L=2}}$
$\mathbf {{{\mathit f}_{{3}}{(2050)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 0{}^{+}(3{}^{++})$
$\mathbf {{{\mathit f}_{{0}}{(2060)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 0{}^{+}(0{}^{++})$
$\mathbf {{{\mathit \pi}{(2070)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 1{}^{-}(0{}^{-+})$
$\mathbf {{{\mathit X}{(2075)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = ?{}^{?}(?{}^{??})$
$\mathbf {{{\mathit X}{(2080)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = ?{}^{?}(?{}^{??})$
$\mathbf {{{\mathit X}{(2080)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = ?{}^{?}(3{}^{-?})$
$\mathbf {{{\mathit a}_{{1}}{(2095)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 1{}^{-}(1{}^{++})$
$\mathbf {B( {{\mathit a}_{{1}}{(2095)}} \rightarrow {{\mathit f}_{{1}}{(1285)}} {{\mathit \pi}} ) / B( {{\mathit a}_{{1}}{(2095)}} \rightarrow {{\mathit a}_{{1}}{(1260)}} )}$
$\mathbf {{{\mathit \eta}{(2100)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 0{}^{+}(0{}^{-+})$
$\mathbf {{{\mathit X}{(2100)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = ?{}^{?}(0{}^{??})$
$\mathbf {{{\mathit X}{(2110)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 1{}^{+}(3{}^{-?})$
$\mathbf {{{\mathit f}_{{2}}{(2140)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 0{}^{+}(2{}^{++})$
$\mathbf {{{\mathit X}{(2150)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = ?{}^{?}(2{}^{+?})$
$\mathbf {{{\mathit a}_{{2}}{(2175)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 1{}^{-}(2{}^{++})$
$\mathbf {{{\mathit \eta}{(2190)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 0{}^{+}(0{}^{-+})$
$\mathbf {{{\mathit \omega}_{{2}}{(2195)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 0{}^{-}(2{}^{--})$
$\mathbf {{{\mathit \omega}{(2205)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 0{}^{-}(1{}^{--})$
$\mathbf {{{\mathit X}{(2210)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = ?{}^{?}(?{}^{??})$
$\mathbf {{{\mathit X}{(2210)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = ?{}^{?}(?{}^{??})$
$\mathbf {{{\mathit h}_{{1}}{(2215)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 0{}^{-}(1{}^{+-})$
$\mathbf {{{\mathit \rho}_{{2}}{(2225)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 1{}^{+}(2{}^{--})$
$\mathbf {{{\mathit \rho}_{{4}}{(2230)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 1{}^{+}(4{}^{--})$
$\mathbf {{{\mathit b}_{{1}}{(2240)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 1{}^{+}(1{}^{+-})$
$\mathbf {{{\mathit f}_{{2}}{(2240)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 0{}^{+}(2{}^{++})$
$\mathbf {{{\mathit b}_{{3}}{(2245)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 1{}^{+}(3{}^{+-})$
$\mathbf {{{\mathit \eta}_{{2}}{(2250)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 0{}^{+}(2{}^{-+})$
$\mathbf {{{\mathit \pi}_{{4}}{(2250)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 1{}^{-}(4{}^{-+})$
$\mathbf {{{\mathit \omega}_{{4}}{(2250)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 0{}^{-}(4{}^{--})$
$\mathbf {{{\mathit \omega}_{{5}}{(2250)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 0{}^{-}(5{}^{--})$
$\mathbf {{{\mathit \omega}_{{3}}{(2255)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 0{}^{-}(3{}^{--})$
$\mathbf {{{\mathit a}_{{4}}{(2255)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 1{}^{-}(4{}^{++})$
$\mathbf {{{\mathit a}_{{2}}{(2255)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 1{}^{-}(2{}^{++})$
$\mathbf {{{\mathit X}{(2260)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 0{}^{+}(4{}^{+?})$
$\mathbf {{{\mathit \rho}{(2270)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 1{}^{+}(1{}^{--})$
$\mathbf {{{\mathit a}_{{1}}{(2270)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 1{}^{-}(1{}^{++})$
$\mathbf {{{\mathit h}_{{3}}{(2275)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 0{}^{-}(3{}^{+-})$
$\mathbf {{{\mathit a}_{{3}}{(2275)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 1{}^{-}(3{}^{++})$
$\mathbf {{{\mathit \pi}_{{2}}{(2285)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 1{}^{-}(2{}^{-+})$
$\mathbf {{{\mathit \omega}_{{3}}{(2285)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 0{}^{-}(3{}^{--})$
$\mathbf {{{\mathit \omega}{(2290)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 0{}^{-}(1{}^{--})$
$\mathbf {{{\mathit f}_{{2}}{(2295)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 0{}^{+}(2{}^{++})$
$\mathbf {{{\mathit f}_{{3}}{(2300)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 0{}^{+}(3{}^{++})$
$\mathbf {{{\mathit f}_{{1}}{(2310)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 0{}^{+}(1{}^{++})$
$\mathbf {{{\mathit \eta}{(2320)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 0{}^{+}(0{}^{-+})$
$\mathbf {{{\mathit \eta}_{{4}}{(2330)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 0{}^{+}(4{}^{-+})$
$\mathbf {{{\mathit \omega}{(2330)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 0{}^{-}(1{}^{--})$
$\mathbf {{{\mathit X}{(2340)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = ?{}^{?}(?{}^{??})$
$\mathbf {{{\mathit \pi}{(2360)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 1{}^{-}(0{}^{-+})$
$\mathbf {{{\mathit X}{(2360)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = ?{}^{?}(4{}^{+?})$
$\mathbf {{{\mathit X}{(2440)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = ?{}^{?}(5{}^{-?})$
$\mathbf {{{\mathit X}{(2540)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 0{}^{+}(0{}^{++})$
$\mathbf { \Gamma\mathrm {( {{\mathit \gamma}} {{\mathit \gamma}} )} {\times } B( {{\mathit K}} {{\overline{\mathit K}}} ) }$
$\mathbf {{{\mathit X}{(2632)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = ?{}^{?}(?{}^{??})$
$\mathbf {B( {{\mathit X}{(2632)}} \rightarrow {{\mathit D}^{0}} {{\mathit K}^{+}} )/B( {{\mathit X}{(2632)}} \rightarrow {{\mathit D}_{{s}}^{+}} {{\mathit \eta}} )}$
$\mathbf {{{\mathit X}{(2680)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = ?{}^{?}(?{}^{??})$
$\mathbf {{{\mathit X}{(2710)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = ?{}^{?}(6{}^{+?})$
$\mathbf {{{\mathit X}{(2750)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = ?{}^{?}(7{}^{-?})$
$\mathbf {{{\mathit f}_{{6}}{(3100)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = 0{}^{+}(6{}^{++})$
$\mathbf {{{\mathit X}{(3250)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = ?{}^{?}(?{}^{??})$ 3-Body Decays
$\mathbf {{{\mathit X}{(3250)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = ?{}^{?}(?{}^{??})$ 4-Body Decays
$\mathbf {{{\mathit X}{(3350)}}}$ $\mathit I\mathit G(\mathit J{}^{PC}) = ?{}^{?}(?{}^{??})$
| 2018-04-26T11:19: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.9849756956100464, "perplexity": 7.1037505391527525}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2018-17/segments/1524125948126.97/warc/CC-MAIN-20180426105552-20180426125552-00406.warc.gz"}
|
https://par.nsf.gov/biblio/10369400
|
Dark Energy Survey Year 3 results: Imprints of cosmic voids and superclusters in the Planck CMB lensing map
ABSTRACT
The CMB lensing signal from cosmic voids and superclusters probes the growth of structure in the low-redshift cosmic web. In this analysis, we cross-correlated the Planck CMB lensing map with voids detected in the Dark Energy Survey Year 3 (Y3) data set (∼5000 deg2), expanding on previous measurements that used Y1 catalogues (∼1300 deg2). Given the increased statistical power compared to Y1 data, we report a 6.6σ detection of negative CMB convergence (κ) imprints using approximately 3600 voids detected from a redMaGiC luminous red galaxy sample. However, the measured signal is lower than expected from the MICE N-body simulation that is based on the ΛCDM model (parameters Ωm = 0.25, σ8 = 0.8), and the discrepancy is associated mostly with the void centre region. Considering the full void lensing profile, we fit an amplitude $A_{\kappa }=\kappa _{{\rm DES}}/\kappa _{{\rm MICE}}$ to a simulation-based template with fixed shape and found a moderate 2σ deviation in the signal with Aκ ≈ 0.79 ± 0.12. We also examined the WebSky simulation that is based on a Planck 2018 ΛCDM cosmology, but the results were even less consistent given the slightly higher matter density fluctuations than in MICE. We then identified superclusters in the DES and the MICE catalogues, more »
Authors:
; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; more »
Award ID(s):
Publication Date:
NSF-PAR ID:
10369400
Journal Name:
Monthly Notices of the Royal Astronomical Society
Volume:
515
Issue:
3
Page Range or eLocation-ID:
p. 4417-4429
ISSN:
0035-8711
Publisher:
Oxford University Press
2. ABSTRACT Measurements of large-scale structure are interpreted using theoretical predictions for the matter distribution, including potential impacts of baryonic physics. We constrain the feedback strength of baryons jointly with cosmology using weak lensing and galaxy clustering observables (3 × 2pt) of Dark Energy Survey (DES) Year 1 data in combination with external information from baryon acoustic oscillations (BAO) and Planck cosmic microwave background polarization. Our baryon modelling is informed by a set of hydrodynamical simulations that span a variety of baryon scenarios; we span this space via a Principal Component (PC) analysis of the summary statistics extracted from these simulations. We show that at the level of DES Y1 constraining power, one PC is sufficient to describe the variation of baryonic effects in the observables, and the first PC amplitude (Q1) generally reflects the strength of baryon feedback. With the upper limit of Q1 prior being bound by the Illustris feedback scenarios, we reach $\sim 20{{\ \rm per\ cent}}$ improvement in the constraint of $S_8=\sigma _8(\Omega _{\rm m}/0.3)^{0.5}=0.788^{+0.018}_{-0.021}$ compared to the original DES 3 × 2pt analysis. This gain is driven by the inclusion of small-scale cosmic shear information down to 2.5 arcmin, which was excluded in previous DES analyses that did not model baryonicmore »
3. ABSTRACT The canonical Lambda cold dark matter (ΛCDM) cosmological model makes precise predictions for the clustering and lensing properties of galaxies. It has been shown that the lensing amplitude of galaxies in the Baryon Oscillation Spectroscopic Survey (BOSS) is lower than expected given their clustering properties. We present new measurements and modelling of galaxies in the BOSS LOWZ sample. We focus on the radial and stellar mass dependence of the lensing amplitude mismatch. We find an amplitude mismatch of around $35{{\ \rm per\ cent}}$ when assuming ΛCDM with Planck Cosmological Microwave Background (CMB) constraints. This offset is independent of halo mass and radial scale in the range Mhalo ∼ 1013.3−1013.9h−1 M⊙ and $r=0.1\!-\!60 \, h^{-1} \mathrm{Mpc}$ ($k \approx 0.05\!-\!20 \, h \, {\rm Mpc}^{-1}$). The observation that the offset is both mass and scale independent places important constraints on the degree to which astrophysical processes (baryonic effects, assembly bias) can fully explain the effect. This scale independence also suggests that the ‘lensing is low’ effect on small and large radial scales probably have the same physical origin. Resolutions based on new physics require a nearly uniform suppression, relative to ΛCDM predictions, of the amplitude of matter fluctuations on these scales.more »
5. ABSTRACT We use a simulation-based modelling approach to analyse the anisotropic clustering of the BOSS LOWZ sample over the radial range $0.4 \, h^{-1} \, \mathrm{Mpc}$ to $63 \, h^{-1} \, \mathrm{Mpc}$, significantly extending what is possible with a purely analytic modelling framework. Our full-scale analysis yields constraints on the growth of structure that are a factor of two more stringent than any other study on large scales at similar redshifts. We infer fσ8 = 0.471 ± 0.024 at $z$ ≈ 0.25, and fσ8 = 0.430 ± 0.025 at $z$ ≈ 0.40; the corresponding ΛCDM predictions of the Planck cosmic microwave background (CMB) analysis are 0.470 ± 0.006 and 0.476 ± 0.005, respectively. Our results are thus consistent with Planck, but also follow the trend seen in previous low-redshift measurements of fσ8 falling slightly below the ΛCDM + CMB prediction. We find that small- and large-radial scales yield mutually consistent values of fσ8, but there are 1−2.5σ hints of small scales ($\lt 10 \, h^{-1} \, \mathrm{Mpc}$) preferring lower values for fσ8 relative to larger scales. We analyse the constraining power of the full range of radial scales, finding that most of the multipole information about fσ8 is contained in the scales \$2 \, h^{-1} \, \mathrm{Mpc}\lesssim s \lesssim 20 \, h^{-1}more »
| 2022-11-30T04:55: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": 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.8106779456138611, "perplexity": 2152.804650958279}, "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/1669446710719.4/warc/CC-MAIN-20221130024541-20221130054541-00042.warc.gz"}
|
https://zbmath.org/authors/?q=ai%3Aharris.theodore-e
|
Harris, Theodore Edward
Compute Distance To:
Author ID: harris.theodore-e Published as: Harris, T. E.; Harris, Theodore E.; Harris, Theodore more...less Further Spellings: Harris, Ted External Links: MGP · Wikidata · GND · IdRef
Documents Indexed: 32 Publications since 1947, including 4 Books 1 Further Contribution Biographic References: 1 Publication Co-Authors: 7 Co-Authors with 7 Joint Publications 355 Co-Co-Authors
all top 5
Co-Authors
25 single-authored 4 Bellman, Richard Ernest 1 Arrow, Kenneth Joseph 1 Baxendale, Peter H. 1 Brown, George W. 1 DeMarcus, Wendell C. 1 Echols, Robert L. 1 Forsythe, George E. 1 Germond, Hallet Hunt 1 Goertzel, G. H. 1 Golomb, Solomon Wolf 1 Hammer, Preston Clarence 1 Householder, Alston Scott 1 Kahn, Herman 1 King, Gilbert W. 1 Marschak, Jacob 1 Mayer, Maria G. 1 Nelson, Lewis 1 Seberry, Jennifer R. 1 Shapiro, Harold N. 1 Shoor, B. A. 1 Snyder, Walter S. 1 Spinrad, B. L. 1 von Neumann, John
all top 5
Serials
6 The Annals of Probability 3 Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete 2 Pacific Journal of Mathematics 2 Transactions of the American Mathematical Society 2 Annals of Mathematical Statistics 1 Advances in Mathematics 1 Econometrica 1 Journal of Applied Probability 1 Proceedings of the American Mathematical Society 1 Proceedings of the National Academy of Sciences of the United States of America 1 Stochastic Processes and their Applications 1 Notices of the American Mathematical Society 1 Annals of Mathematics. Second Series 1 Proceedings of the Cambridge Philosophical Society 1 Grundlehren der Mathematischen Wissenschaften
all top 5
Fields
13 Probability theory and stochastic processes (60-XX) 1 History and biography (01-XX) 1 Dynamical systems and ergodic theory (37-XX) 1 Global analysis, analysis on manifolds (58-XX) 1 Statistical mechanics, structure of matter (82-XX) 1 Operations research, mathematical programming (90-XX)
Citations contained in zbMATH Open
30 Publications have been cited 1,944 times in 1,753 Documents Cited by Year
The theory of branching processes. Zbl 0117.13002
Harris, T. E.
1963
Contact interactions on a lattice. Zbl 0334.60052
Harris, T. E.
1974
A lower bound for the critical probability in a certain percolation process. Zbl 0122.36403
Harris, T. E.
1960
Optimal inventory policy. Zbl 0045.23205
Arrow, Kenneth J.; Harris, Theodore; Marschak, Jacob
1951
Additive set-valued Markov processes and graphical methods. Zbl 0378.60106
Harris, T. E.
1978
Nearest-neighbor Markov interaction processes on multidimensional lattices. Zbl 0267.60107
Harris, T. E.
1972
Branching processes. Zbl 0041.45603
Harris, T. E.
1948
The theory of branching processes. Corrected reprint of the 1963 original. Zbl 1037.60001
Harris, Theodore E.
2002
Diffusion with ’collisions’ between particles. Zbl 0139.34804
Harris, T. E.
1965
First passage and recurrence distributions. Zbl 0048.36301
Harris, T. E.
1952
On age-dependent binary branching processes. Zbl 0046.35502
Bellman, Richard; Harris, Theodore
1952
On a class of set-valued Markov processes. Zbl 0357.60049
Harris, T. E.
1976
On chains of infinite order. Zbl 0066.11402
Harris, T. E.
1955
Isotropic stochastic flows. Zbl 0606.60014
Baxendale, Peter; Harris, Theodore E.
1986
On the theory of age-dependent stochastic branching processes. Zbl 0041.45604
Bellman, Richard; Harris, Theodore E.
1948
A correlation inequality for Markov processes in partially ordered state spaces. Zbl 0381.60072
Harris, T. E.
1977
The existence of stationary measures for certain Markov processes. Zbl 0072.35201
Harris, T. E.
1956
Coalescing and noncoalescing stochastic flows in $$R_ 1$$. Zbl 0536.60016
Harris, Theodore E.
1984
Random measures and motions of point processes. Zbl 0194.49204
Harris, T. E.
1971
Brownian motions on the homeomorphisms of the plane. Zbl 0457.60013
Harris, Theodore E.
1981
Some mathematical models for branching processes. Zbl 0045.07701
Harris, T. E.
1951
Recurrence times for the Ehrenfest model. Zbl 0045.07802
Bellman, Richard; Harris, Theodore
1951
Counting measures, monotone random set functions. Zbl 0165.18902
Harris, T. E.
1968
Transient Markov chains with stationary measures. Zbl 0087.13501
Harris, T. E.
1957
Interacting systems, stirrings, and flows. Zbl 0798.60087
Harris, T. E.
1991
Infinite-product Markov processes. Zbl 0159.47003
Harris, T. E.
1968
Correction to a proof. Zbl 0169.20801
Harris, T. E.
1969
Monte Carlo method. Zbl 0045.22105
1951
Studies in functional equations occuring in decision processes. Zbl 0053.41403
Harris, T. E.; Bellman, R.; Shapiro, H. N.
1953
Les processus de ramification. Applications à la physique et à la biologie. Traduit de l’anglais par C. Reboul et L. Hermann. Zbl 0174.21303
Harris, T. E.
1969
The theory of branching processes. Corrected reprint of the 1963 original. Zbl 1037.60001
Harris, Theodore E.
2002
Interacting systems, stirrings, and flows. Zbl 0798.60087
Harris, T. E.
1991
Isotropic stochastic flows. Zbl 0606.60014
Baxendale, Peter; Harris, Theodore E.
1986
Coalescing and noncoalescing stochastic flows in $$R_ 1$$. Zbl 0536.60016
Harris, Theodore E.
1984
Brownian motions on the homeomorphisms of the plane. Zbl 0457.60013
Harris, Theodore E.
1981
Additive set-valued Markov processes and graphical methods. Zbl 0378.60106
Harris, T. E.
1978
A correlation inequality for Markov processes in partially ordered state spaces. Zbl 0381.60072
Harris, T. E.
1977
On a class of set-valued Markov processes. Zbl 0357.60049
Harris, T. E.
1976
Contact interactions on a lattice. Zbl 0334.60052
Harris, T. E.
1974
Nearest-neighbor Markov interaction processes on multidimensional lattices. Zbl 0267.60107
Harris, T. E.
1972
Random measures and motions of point processes. Zbl 0194.49204
Harris, T. E.
1971
Correction to a proof. Zbl 0169.20801
Harris, T. E.
1969
Les processus de ramification. Applications à la physique et à la biologie. Traduit de l’anglais par C. Reboul et L. Hermann. Zbl 0174.21303
Harris, T. E.
1969
Counting measures, monotone random set functions. Zbl 0165.18902
Harris, T. E.
1968
Infinite-product Markov processes. Zbl 0159.47003
Harris, T. E.
1968
Diffusion with ’collisions’ between particles. Zbl 0139.34804
Harris, T. E.
1965
The theory of branching processes. Zbl 0117.13002
Harris, T. E.
1963
A lower bound for the critical probability in a certain percolation process. Zbl 0122.36403
Harris, T. E.
1960
Transient Markov chains with stationary measures. Zbl 0087.13501
Harris, T. E.
1957
The existence of stationary measures for certain Markov processes. Zbl 0072.35201
Harris, T. E.
1956
On chains of infinite order. Zbl 0066.11402
Harris, T. E.
1955
Studies in functional equations occuring in decision processes. Zbl 0053.41403
Harris, T. E.; Bellman, R.; Shapiro, H. N.
1953
First passage and recurrence distributions. Zbl 0048.36301
Harris, T. E.
1952
On age-dependent binary branching processes. Zbl 0046.35502
Bellman, Richard; Harris, Theodore
1952
Optimal inventory policy. Zbl 0045.23205
Arrow, Kenneth J.; Harris, Theodore; Marschak, Jacob
1951
Some mathematical models for branching processes. Zbl 0045.07701
Harris, T. E.
1951
Recurrence times for the Ehrenfest model. Zbl 0045.07802
Bellman, Richard; Harris, Theodore
1951
Monte Carlo method. Zbl 0045.22105
1951
Branching processes. Zbl 0041.45603
Harris, T. E.
1948
On the theory of age-dependent stochastic branching processes. Zbl 0041.45604
Bellman, Richard; Harris, Theodore E.
1948
all top 5
Cited by 2,076 Authors
27 Durrett, Richard Timothy 26 Lanchier, Nicolas 22 Chen, Anyue 20 Li, Junping 18 Mode, Charles J. 15 Pakes, Anthony G. 15 Yanev, Nikolay Mihailov 14 Newman, Charles Michael 13 Xue, Xiaofeng 12 Allen, Linda J. S. 12 Ferrari, Pablo Augusto 11 Galves, Antonio 11 Kesten, Harry 11 Schinazi, Rinaldo B. 10 Huillet, Thierry E. 10 Kahn, Jeff D. 10 Liggett, Thomas Milton 10 Liu, Quansheng 10 Neuhauser, Claudia 10 Yakovlev, Andrej Yu. 9 Griffeath, David 9 Hautphenne, Sophie 8 Bellman, Richard Ernest 8 Bramson, Maury D. 8 Cox, J. Theodore 8 Grimmett, Geoffrey R. 8 Mountford, Thomas S. 8 Pollett, Philip K. 8 Zucca, Fabio 7 Bahadoran, Christophe 7 Bollobás, Béla 7 Chayes, Jennifer Tour 7 Hering, Heinrich 7 Jagers, Peter 7 Kiefer, Stefan 7 Klebaner, Fima C. 7 Ney, Peter E. 7 Pollak, Edward 7 Ravishankar, Krishnamurthi 7 Schonmann, Roberto Henrique 7 Sidoravicius, Vladas 7 Vares, Maria Eulalia 6 Athreya, Krishna Balasundaram 6 Bertacchi, Daniela 6 Chayes, Lincoln 6 Ferrari, Patrik Lino 6 Karlin, Samuel 6 Mitov, Kosto V. 6 Scheutzow, Michael K. R. 6 Seneta, Eugene 6 Shoikhet, David 6 Stacey, Alan M. 6 Tóth, Bálint 6 van den Berg, Rob 6 Warnke, Lutz 6 Zhang, Hanjun 5 Alexander, Kenneth S. 5 Andjel, Enrique Daniel 5 Brázdil, Tomáš 5 Crump, Kenny S. 5 Duffy, Ken R. 5 Duminil-Copin, Hugo 5 Esparza, Javier 5 Fontes, Luiz Renato G. 5 Foxall, Eric 5 Gao, Zhiqiang 5 Häggström, Olle 5 Harris, Theodore Edward 5 Hyrien, Ollivier 5 Imomov, Azam Abdurakhimovich 5 Jara, Milton D. 5 Kaplan, Norman L. 5 Kozma, Gady 5 Meester, Ronald W. J. 5 Menshikov, Mikhail V. 5 Nejjar, Peter 5 Peres, Yuval 5 Riordan, Oliver Maxim 5 Roitershtein, Alexander 5 Saada, Ellen 5 Sagitov, Serik 5 Slavtchova-Bojkova, Maroussia Nikiforova 5 Szász, Domokos 5 Tassion, Vincent 5 Toninelli, Cristina 5 Valesin, Daniel 5 Yannakakis, Mihalis 4 Asmussen, Søren 4 Baxendale, Peter H. 4 Braunsteins, Peter 4 Delmas, Jean-François 4 Donnelly, Peter 4 Etessami, Kousha 4 Gallo, Sandro 4 Garcia, Nancy L. 4 Grabner, Peter J. 4 Grosjean, Nicolas 4 Heyde, Christopher Charles 4 Hilário, Marcelo Richard 4 Holley, Richard A. ...and 1,976 more Authors
all top 5
Cited in 312 Serials
106 Stochastic Processes and their Applications 97 Journal of Statistical Physics 74 Mathematical Biosciences 70 Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete 64 The Annals of Probability 62 Journal of Applied Probability 58 The Annals of Applied Probability 55 Probability Theory and Related Fields 37 Journal of Mathematical Analysis and Applications 36 Statistics & Probability Letters 33 Journal of Mathematical Biology 31 European Journal of Operational Research 30 Theoretical Population Biology 28 Communications in Mathematical Physics 28 Transactions of the American Mathematical Society 27 Journal of Theoretical Biology 26 Advances in Applied Probability 23 Electronic Journal of Probability 20 Physica A 20 Bulletin of Mathematical Biology 20 Journal of Theoretical Probability 18 Annales de l’Institut Henri Poincaré. Probabilités et Statistiques 15 Random Structures & Algorithms 15 Journal of Statistical Mechanics: Theory and Experiment 15 ALEA. Latin American Journal of Probability and Mathematical Statistics 14 Israel Journal of Mathematics 13 Stochastic Analysis and Applications 13 Annales de l’Institut Henri Poincaré. Nouvelle Série. Section B. Calcul des Probabilités et Statistique 12 Stochastic Models 11 Journal of the Australian Mathematical Society 9 Journal of Soviet Mathematics 9 Stochastics and Dynamics 8 Mathematical Notes 8 Journal of Multivariate Analysis 8 Theoretical Computer Science 8 Communications in Statistics. Theory and Methods 8 Bernoulli 8 Probability in the Engineering and Informational Sciences 8 Methodology and Computing in Applied Probability 7 Journal of Mathematical Sciences (New York) 7 Frontiers of Mathematics in China 7 Science China. Mathematics 6 Lithuanian Mathematical Journal 6 Mathematical Proceedings of the Cambridge Philosophical Society 6 Chaos, Solitons and Fractals 6 Advances in Mathematics 6 Journal of Combinatorial Theory. Series A 6 Journal of Economic Theory 6 Queueing Systems 6 Journal of Biological Dynamics 6 Probability Surveys 5 Discrete Applied Mathematics 5 Journal of Mathematical Physics 5 Stochastics 5 Ukrainian Mathematical Journal 5 Proceedings of the American Mathematical Society 5 Advances in Applied Mathematics 5 Information and Computation 5 Computers & Operations Research 5 Science in China. Series A 5 Annals of Operations Research 5 Linear Algebra and its Applications 5 Combinatorics, Probability and Computing 5 The Electronic Journal of Combinatorics 5 Brazilian Journal of Probability and Statistics 5 Stochastics 5 Bulletin of the American Mathematical Society 5 The Bulletin of Mathematical Biophysics 5 Electronic Journal of Statistics 4 Information Processing Letters 4 Theory of Probability and its Applications 4 The Annals of Statistics 4 Biometrics 4 Journal of Combinatorial Theory. Series B 4 Journal of Number Theory 4 European Journal of Combinatorics 4 Combinatorica 4 Mathematical and Computer Modelling 4 International Transactions in Operational Research 4 European Series in Applied and Industrial Mathematics (ESAIM): Probability and Statistics 4 Discrete and Continuous Dynamical Systems. Series B 4 Comptes Rendus. Mathématique. Académie des Sciences, Paris 4 Modern Stochastics. Theory and Applications 4 Stochastics and Quality Control 3 Bulletin of the Australian Mathematical Society 3 Discrete Mathematics 3 International Journal of Mathematical Education in Science and Technology 3 Physics Letters. A 3 Reports on Mathematical Physics 3 Annales de l’Institut Fourier 3 Annals of the Institute of Statistical Mathematics 3 Annales Scientifiques de l’Université de Clermont-Ferrand II. Mathématiques 3 International Journal of Computer & Information Sciences 3 Journal of Statistical Planning and Inference 3 Mathematics and Computers in Simulation 3 Ergodic Theory and Dynamical Systems 3 Operations Research Letters 3 Probability and Mathematical Statistics 3 Acta Applicandae Mathematicae 3 Statistics ...and 212 more Serials
all top 5
Cited in 51 Fields
1,252 Probability theory and stochastic processes (60-XX) 320 Biology and other natural sciences (92-XX) 284 Statistical mechanics, structure of matter (82-XX) 134 Statistics (62-XX) 130 Combinatorics (05-XX) 128 Operations research, mathematical programming (90-XX) 81 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 71 Computer science (68-XX) 51 Dynamical systems and ergodic theory (37-XX) 39 Numerical analysis (65-XX) 31 Measure and integration (28-XX) 26 Partial differential equations (35-XX) 18 Quantum theory (81-XX) 16 Ordinary differential equations (34-XX) 16 Fluid mechanics (76-XX) 16 Systems theory; control (93-XX) 14 Linear and multilinear algebra; matrix theory (15-XX) 11 Functions of a complex variable (30-XX) 11 Operator theory (47-XX) 10 Number theory (11-XX) 10 Information and communication theory, circuits (94-XX) 8 Global analysis, analysis on manifolds (58-XX) 7 Difference and functional equations (39-XX) 6 Mathematical logic and foundations (03-XX) 6 Integral equations (45-XX) 6 Calculus of variations and optimal control; optimization (49-XX) 5 History and biography (01-XX) 5 Potential theory (31-XX) 5 Special functions (33-XX) 4 Order, lattices, ordered algebraic structures (06-XX) 4 Real functions (26-XX) 4 Integral transforms, operational calculus (44-XX) 4 Convex and discrete geometry (52-XX) 3 Group theory and generalizations (20-XX) 3 Harmonic analysis on Euclidean spaces (42-XX) 3 Functional analysis (46-XX) 3 Classical thermodynamics, heat transfer (80-XX) 2 General and overarching topics; collections (00-XX) 2 Several complex variables and analytic spaces (32-XX) 2 Approximations and expansions (41-XX) 2 Mechanics of deformable solids (74-XX) 2 Relativity and gravitational theory (83-XX) 1 Commutative algebra (13-XX) 1 Associative rings and algebras (16-XX) 1 Sequences, series, summability (40-XX) 1 Geometry (51-XX) 1 Differential geometry (53-XX) 1 Algebraic topology (55-XX) 1 Mechanics of particles and systems (70-XX) 1 Optics, electromagnetic theory (78-XX) 1 Geophysics (86-XX)
Wikidata Timeline
The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.
| 2022-11-28T12:06:35 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 1, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.4747568666934967, "perplexity": 6455.34187900456}, "config": {"markdown_headings": false, "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-49/segments/1669446710503.24/warc/CC-MAIN-20221128102824-20221128132824-00719.warc.gz"}
|
https://www.nist.gov/publications/coherent-quantum-frequency-bridge-phase-preserving-nearly-noiseless-parametric
|
# Coherent quantum frequency bridge: phase preserving, nearly-noiseless parametric frequency converter
Published: May 03, 2017
### Author(s)
Ivan A. Burenkov, Yu-Hsiang Cheng, Tim O. Thomay, Glenn S. Solomon, Alan L. Migdall, Thomas Gerrits, Adriana E. Lita, Sae Woo Nam, Lynden K. Shalm, Sergey V. Polyakov
### Abstract
We characterize an efficient and nearly-noiseless parametric frequency upconverter. The ultra- low noise regime is reached by the wide spectral separation between the input and pump frequencies and the low pump frequency relative to the input photons. The background of only $\approx$100 photons per hour is demonstrated. We demonstrate phase preservation in a frequency upconversion process at the single-photon level. We summarize our efforts to measure this ultra-low noise level, and discuss both single-photon avalanche photodiode measurements and a photon-counting transition edge sensor (TES) measurements. To reach the required accuracy, we supplemented our TES with a dark count reduction algorithm. The preservation of the coherence was demonstrated by simultaneously upconverting the input of each arm of a Mach-Zehnder interferometer through high interference fringe contrast. We observe fringe visibilities of $\geq0.97$ with faint coherent input.
Citation: Proceedings of SPIE Defense and Security Symposium
Volume: 10212
Pub Type: Journals
| 2019-06-21T00:34:20 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 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.2835354208946228, "perplexity": 9577.070267864825}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2019-26/segments/1560627999291.1/warc/CC-MAIN-20190620230326-20190621012326-00306.warc.gz"}
|
http://math.nist.gov/mcsd/Seminars/2013/2013-05-22-Chen.html
|
# Reed-Frost Transition on Dense Graphs
Guantao Chen
Department of Mathematics and Statistics, Georgia State University
Wednesday, May 22, 2013 15:00-16:00,
Building 101, Lecture Room C
Gaithersburg
Wednesday, May 22, 2013 13:00-14:00,
Room 1-4058
Boulder
Abstract:
The classic Reed-Frost stochastic epidemic process on a population of $n$ elements with probability p can be viewed as a percolation on a complete graph with a given number of initially infective vertices. At each step each infected vertex infects an undeleted and uninfected vertex independently with probability $p$, and all previously infected vertices are removed. The process stops if there is no new infected vertex. The percolation time is the time $t$ when all vertices have been infected or $+\infty$.
In this talk, we extend the the Reed-Frost process from complete graphs to general graphs and obtain a few sufficient conditions on the density of graphs and probability such that with high probability that the percolation time is bounded above by a constant. We also notice that these conditions are best possible in some sense.
Presentation Slides: PDF
Contact: J. Shook
Note: Visitors from outside NIST must contact Cathy Graham; (301) 975-3800; at least 24 hours in advance.
| 2014-12-20T16:31: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": 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.6368358731269836, "perplexity": 1086.0451221835638}, "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-52/segments/1418802770043.48/warc/CC-MAIN-20141217075250-00037-ip-10-231-17-201.ec2.internal.warc.gz"}
|
https://www.zbmath.org/authors/?q=ai%3Achung.fan
|
zbMATH — the first resource for mathematics
Chung Graham, Fan-Rong King
Compute Distance To:
Author ID: chung.fan Published as: Chung Graham, Fan; Chung, F.; Chung, F. K.; Chung, F. R. K.; Chung, Fan; Chung, Fan R. K.; Chung, Fan Rong K.; Fan, C.; Fan, Chung Graham; Graham, Fan Chung Homepage: http://www.math.ucsd.edu/~fan/ External Links: Women in Mathematics · MGP · Wikidata · dblp · GND · MacTutor Member of Collective: Peck, G. W.
Documents Indexed: 310 Publications since 1973, including 12 Books Biographic References: 1 Publication
all top 5
Co-Authors
61 single-authored 100 Graham, Ronald Lewis 23 Lu, Linyuan 17 Yau, Shing-Tung 14 Erdős, Pál 11 Hwang, Frank Kwangming 8 Andersen, Reid 8 Rosenberg, Arnold Leonard 7 Horn, Paul S. 6 Leighton, Frank Thomson 6 Tsiatas, Alexander 5 Bhatt, Sandeep N. 4 Alon, Noga M. 4 Bonato, Anthony 4 Butler, Steven Kay 4 Diaconis, Persi Warren 4 Garey, Michael Randolph 4 Simpson, Olivia 4 Zhao, Wenbo 3 Aiello, William A. 3 Fishburn, Peter Clingerman 3 Goldwasser, John L. 3 Grigor’yan, Alexander Asaturovich 3 Lang, Kevin J. 3 Mao, Jia 3 Prałat, Paweł 3 Seymour, Paul D. 3 Shearer, James B. 3 Spencer, Joel H. 3 Tarjan, Robert Endre 3 Trotter, William T. jun. 3 Vu, Van H. 3 Wei, Victor K.-W. 2 Aksoy, Sinan G. 2 Alavi, Yousef 2 Bollobás, Béla 2 Braun, Oliver 2 Claesson, Anders 2 Cummings, Jay 2 Dukes, Mark 2 Frankl, Péter 2 Furedi, Zoltan 2 Gilbert, Edgar Nelson 2 Hughes, Jacob 2 Hutchinson, Joan P. 2 Knuth, Donald Ervin 2 Leighton, Tom 2 Lin, Yong 2 Lu, Lincoln 2 Mumford, David Bryant 2 Peng, Xing 2 Saks, Michael E. 2 Sternberg, Shlomo 2 Tetali, Prasad 2 Tobin, Josh 2 Wilson, Richard Michael 2 Xu, Wensong 2 Yao, Andrew Chi-Chih 1 Babai, László 1 Bauer, Frank 1 Belongie, Serge 1 Bertozzi, Andrea Louise 1 Bhagwan, Ranjita 1 Bienstock, Daniel 1 Blum, Edward Kenneth 1 Brown, Thomas Craig 1 Calderbank, Arthur Robert 1 Calkin, Neil J. 1 Canfield, Rodney E. 1 Chartrand, Gary Theodore 1 Zweig Chinn, Phyllis 1 Cleve, Richard 1 Cockayne, Ernest J. 1 Coffman, Edward Grady jun. 1 Cohen, Joel E. 1 Coppersmith, Donald 1 Dagum, Paul 1 Debroy, T. 1 Delorme, Charles 1 Ellis, Robert Byron 1 Faber, Vance 1 Folkman, Jon 1 Fowlkes, Charless C. 1 Fraenkel, Aviezri Siegmund 1 Fredman, Michael L. 1 Gardner, Martin 1 Garrett, Mark 1 Goddard, Wayne Dean 1 Greene, Curtis 1 Grinstead, Charles M. 1 Gyárfás, András 1 Hajela, D. J. 1 Handjani, Shirin J. 1 Herman, Joan E. 1 Hoffman, Frederick 1 Hogben, Leslie 1 Hoggatt, Verner E. jun. 1 Hong, Jiawei 1 Hsu, D. Frank 1 Johnson, David Stifler 1 Jungreis, Doug ...and 61 more Co-Authors
all top 5
Serials
15 Journal of Combinatorial Theory. Series A 15 Journal of Graph Theory 15 Internet Mathematics 12 Discrete Mathematics 11 SIAM Journal on Discrete Mathematics 10 The Electronic Journal of Combinatorics 9 Bell System Technical Journal 8 Journal of Combinatorial Theory. Series B 8 Advances in Applied Mathematics 8 SIAM Journal on Algebraic and Discrete Methods 8 Random Structures & Algorithms 6 Combinatorica 6 Annals of Combinatorics 5 Journal of Computer and System Sciences 5 Discrete & Computational Geometry 5 Proceedings of the National Academy of Sciences of the United States of America 4 Journal of Number Theory 4 Communications in Analysis and Geometry 4 Lecture Notes in Computer Science 4 Journal of Combinatorics 3 American Mathematical Monthly 3 Discrete Applied Mathematics 3 Networks 3 European Journal of Combinatorics 3 Graphs and Combinatorics 3 Algorithmica 3 Combinatorics, Probability and Computing 2 IEEE Transactions on Information Theory 2 Mathematics Magazine 2 Ars Combinatoria 2 Transactions of the American Mathematical Society 2 Journal of the American Mathematical Society 2 Notices of the American Mathematical Society 1 Computers & Mathematics with Applications 1 International Journal of Heat and Mass Transfer 1 Journal of Mathematical Analysis and Applications 1 Advances in Mathematics 1 The Annals of Probability 1 Geometriae Dedicata 1 Journal of the American Statistical Association 1 Journal of the London Mathematical Society. Second Series 1 Mathematical Systems Theory 1 Pacific Journal of Mathematics 1 Proceedings of the American Mathematical Society 1 SIAM Journal on Computing 1 Theoretical Computer Science 1 Caribbean Journal of Mathematics 1 Order 1 Bulletin of the Institute of Mathematics. Academia Sinica 1 Linear Algebra and its Applications 1 SIAM Journal on Applied Mathematics 1 Experimental Mathematics 1 Turkish Journal of Mathematics 1 Mathematical Research Letters 1 Theory of Computing Systems 1 Journal of Scheduling 1 Journal of the ACM 1 OR Spectrum 1 Communications in Mathematical Sciences 1 Regional Conference Series in Mathematics 1 ICCM Notices 1 CBMS Regional Conference Series in Mathematics 1 Discrete Mathematics and its Applications
all top 5
Fields
228 Combinatorics (05-XX) 74 Computer science (68-XX) 24 Information and communication theory, circuits (94-XX) 22 Probability theory and stochastic processes (60-XX) 15 Number theory (11-XX) 12 General and overarching topics; collections (00-XX) 12 Operations research, mathematical programming (90-XX) 12 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 10 Convex and discrete geometry (52-XX) 10 Global analysis, analysis on manifolds (58-XX) 6 Linear and multilinear algebra; matrix theory (15-XX) 4 Partial differential equations (35-XX) 3 History and biography (01-XX) 3 Order, lattices, ordered algebraic structures (06-XX) 3 Statistics (62-XX) 2 Mathematical logic and foundations (03-XX) 2 Group theory and generalizations (20-XX) 2 Potential theory (31-XX) 2 Difference and functional equations (39-XX) 2 Operator theory (47-XX) 2 Differential geometry (53-XX) 2 Numerical analysis (65-XX) 2 Quantum theory (81-XX) 1 Algebraic geometry (14-XX) 1 Real functions (26-XX) 1 Several complex variables and analytic spaces (32-XX) 1 Functional analysis (46-XX) 1 Geometry (51-XX) 1 Algebraic topology (55-XX) 1 Fluid mechanics (76-XX) 1 Classical thermodynamics, heat transfer (80-XX) 1 Statistical mechanics, structure of matter (82-XX) 1 Mathematics education (97-XX)
Citations contained in zbMATH
245 Publications have been cited 4,013 times in 3,080 Documents Cited by Year
Spectral graph theory. Zbl 0867.05046
Chung, Fan R. K.
1997
Quasi-random graphs. Zbl 0715.05057
Chung, F. R. K.; Graham, R. L.; Wilson, R. M.
1989
Connected components in random graphs with given expected degree sequences. Zbl 1009.05124
Chung, Fan; Lu, Linyuan
2002
The average distances in random graphs with given expected degrees. Zbl 1064.05137
Chung, Fan; Lu, Linyuan
2002
Optical orthogonal codes: design, analysis, and applications. Zbl 0676.94021
Chung, Fan R. K.; Salehi, Jawad A.; Wei, Victor K.
1989
Open problems of Paul Erdös in graph theory. Zbl 0872.05052
Chung, F. R. K.
1997
Explicit construction of linear sized tolerant networks. Zbl 0657.05068
Alon, N.; Chung, F. R. K.
1988
Complex graphs and networks. Zbl 1114.90071
Chung, Fan; Lu, Linyuan
2006
Diameters and eigenvalues. Zbl 0678.05037
Chung, F. R. K.
1989
The number of Baxter permutations. Zbl 0398.05003
Chung, F. R. K.; Graham, R. L.; Hoggatt, V. E. jun.; Kleiman, M.
1978
Embedding graphs in books: a layout problem with applications to VLSI design. Zbl 0617.68062
Chung, Fan R. K.; Leighton, Frank Thomson; Rosenberg, Arnold L.
1987
Pebbling in hypercubes. Zbl 0727.05043
Chung, Fan R. K.
1989
Some intersection theorems for ordered sets and graphs. Zbl 0655.05001
Chung, F. R. K.; Graham, R. L.; Frankl, P.; Shearer, J. B.
1986
Laplacians and the Cheeger inequality for directed graphs. Zbl 1059.05070
Chung, Fan
2005
On packing two-dimensional bins. Zbl 0495.05016
Chung, F. R. K.; Garey, M. R.; Johnson, D. S.
1982
Spectra of random graphs with given expected degrees. Zbl 1064.05138
Chung, Fan; Lu, Linyuan; Vu, Van
2003
A random graph model for massive graphs. Zbl 1296.05172
Aiello, William; Chung, Fan; Lu, Linyuan
2000
The average distance in a random graph with given expected degrees. Zbl 1065.05084
Chung, Fan; Lu, Linyuan
2003
The maximum number of edges in $$2K_ 2$$-free graphs of bounded degree. Zbl 0698.05039
Chung, F. R. K.; Gyárfás, A.; Tuza, Z.; Trotter, W. T.
1990
Universal cycles for combinatorial structures. Zbl 0776.05001
Chung, Fan; Diaconis, Persi; Graham, Ron
1992
The forwarding index of communication networks. Zbl 0626.94019
Chung, Fan R. K.; Coffman, Edward G. jun.; Reiman, Martin I.; Simon, Burton
1987
A random graph model for power law graphs. Zbl 0971.05100
Aiello, William; Chung, Fan; Lu, Linyuan
2001
Concentration inequalities and martingale inequalities: a survey. Zbl 1111.60010
Chung, Fan; Lu, Linyuan
2006
The average distance and the independence number. Zbl 0644.05029
Chung, F. R. K.
1988
Labelings of graphs. Zbl 0656.05058
Chung, F. R. K.
1988
The diameter of sparse random graphs. Zbl 0977.05127
Chung, Fan; Lu, Linyuan
2001
Quasi-random hypergraphs. Zbl 0708.05044
Chung, F. R. K.; Graham, R. L.
1990
Discrete Green’s functions. Zbl 0963.65120
Chung, Fan; Yau, S.-T.
2000
Quasi-random set systems. Zbl 0761.05072
Chung, F. R. K.; Graham, R. L.
1991
Diameter bounds for altered graphs. Zbl 0562.05030
Chung, F. R. K.; Garey, M. R.
1984
Edge-colored complete graphs with precisely colored subgraphs. Zbl 0529.05041
Chung, F. R. K.; Graham, R. L.
1983
The spectra of random graphs with given expected degrees. Zbl 1080.05021
Chung, Fan; Lu, Linyuan; Vu, Van
2004
Erdős on graphs. His legacy of unsolved problems. Zbl 0890.05049
Chung, Fan; Graham, Ron
1998
The diameter of a cycle plus a random matching. Zbl 0664.05036
Bollobás, Béla; Chung, F. R. K.
1988
Highly irregular graphs. Zbl 0665.05043
Alavi, Yousef; Chartrand, Gary; Chung, F. R. K.; Erdős, Paul; Graham, Ronald L.; Oellermann, Ortrud R.
1987
Logarithmic Harnack inequalities. Zbl 0880.58026
Chung, F. R. K.; Yau, S.-T.
1996
On multicolor Ramsey numbers for complete bipartite graphs. Zbl 0298.05122
Chung, Fan R. K.; Graham, R. L.
1975
Regularity lemmas for hypergraphs and quasi-randomness. Zbl 0756.05081
Chung, Fan R. K.
1991
A combinatorial Laplacian with vertex weights. Zbl 0866.05039
Chung, F. R. K.; Langlands, Robert P.
1996
An upper bound on the diameter of a graph from eigenvalues associated with its Laplacian. Zbl 0808.05072
Chung, F. R. K.; Faber, V.; Manteuffel, Thomas A.
1994
Quasi-random classes of hypergraphs. Zbl 0739.05066
Chung, Fan R. K.
1990
A dynamic location problem for graphs. Zbl 0692.05055
Chung, F. R. K.; Graham, R. L.; Saks, M. E.
1989
Random evolution in massive graphs. Zbl 1024.68073
Aiello, William; Chung, Fan; Lu, Linyuan
2002
Universal graphs for bounded-degree trees and planar graphs. Zbl 0674.05037
Bhatt, Sandeep N.; Chung, F. R. K.; Leighton, F. T.; Rosenberg, Arnold L.
1989
Graphs with small bandwidth and cutwidth. Zbl 0668.05039
Chung, F. R. K.; Seymour, P. D.
1989
Harnack inequalities for graphs with non-negative Ricci curvature. Zbl 1309.05117
Chung, Fan; Lin, Yong; Yau, S.-T.
2014
Quasi-random tournaments. Zbl 0728.05025
Chung, F. R. K.; Graham, R. L.
1991
On the cover polynomial of a digraph. Zbl 0839.05045
Chung, F. R. K.; Graham, R. L.
1995
Random walks arising in random number generation. Zbl 0622.60016
Chung, F. R. K.; Diaconis, Persi; Graham, R. L.
1987
Strongly connected orientations of mixed multigraphs. Zbl 0645.90097
Chung, Fan R. K.; Garey, Michael R.; Tarjan, Robert E.
1985
On universal graphs for spanning trees. Zbl 0509.05033
Chung, F. R. K.; Graham, R. L.
1983
On concentrators, superconcentrators, generalizers, and nonblocking networks. Zbl 0415.94021
Chung, F. R. K.
1979
On the spectra of general random graphs. Zbl 1229.05248
Chung, Fan; Radcliffe, Mary
2011
Small spectral gap in the combinatorial Laplacian implies Hamiltonian. Zbl 1229.05193
Butler, Steve; Chung, Fan
2010
Higher eigenvalues and isoperimetric inequalities on Riemannian manifolds and graphs. Zbl 1001.58022
Chung, Fan; Grigor’yan, Alexander; Yau, Shing-Tung
2000
Upper bounds for eigenvalues of the discrete and continuous Laplace operators. Zbl 0844.53029
Chung, F. R. K.; Grigor’yan, A.; Yau, Shing-Tung
1996
A survey of bounds for classical Ramsey numbers. Zbl 0508.05046
Chung, F. R. K.; Grinstead, C. M.
1983
The number of different distances determined by a set of points in the Euclidean plane. Zbl 0755.52005
Chung, Fan R. K.; Szemerédi, E.; Trotter, W. T.
1992
On optimal linear arrangements of trees. Zbl 0533.05022
Chung, F. R. K.
1984
On the coverings of graphs. Zbl 0451.05037
Chung, F. R. K.
1980
Steiner trees for ladders. Zbl 0384.05030
Chung, F. R. K.; Graham, R. L.
1978
The volume of the giant component of a random graph with given expected degrees. Zbl 1119.05098
Chung, Fan; Lu, Linyuan
2006
Coupling online and offline analyses for random power law graphs. Zbl 1089.05021
Chung, Fan; Lu, Linyuan
2004
Sparse quasi-random graphs. Zbl 0997.05090
Chung, Fan; Graham, Ronald
2002
Efficient embeddings of trees in hypercubes. Zbl 0743.68037
Bhatt, Sandeep N.; Chung, Fan R. K.; Leighton, F. Thomson; Rosenberg, Arnold L.
1992
On induced subgraphs of the cube. Zbl 0653.05037
Chung, F. R. K.; Füredi, Zoltán; Graham, R. L.; Seymour, P.
1988
On the decomposition of graphs. Zbl 0499.05046
Chung, F. R. K.
1981
Quasi-random graphs with given degree sequences. Zbl 1130.05052
Chung, Fan; Graham, Ron
2008
The Laplacian of a hypergraph. Zbl 0790.05061
Chung, Fan R. K.
1993
Subgraphs of a hypercube containing no small even cycles. Zbl 0766.05039
Chung, Fan R. K.
1992
A new bound for Euclidean Steiner minimal trees. Zbl 0572.05022
Chung, F. R. K.; Graham, R. L.
1985
Distance realization problems with applications to internet tomography. Zbl 1006.68102
Chung, Fan; Garrett, Mark; Graham, Ronald; Shallcross, David
2001
Forced convex $$n$$-gons in the plane. Zbl 0908.52004
Chung, F. R. K.; Graham, R. L.
1998
On Steiner trees for bounded point sets. Zbl 0475.05023
Chung, F. R. K.; Graham, R. L.
1981
Recent results in graph decompositions. Zbl 0464.05046
Chung, F. R. K.; Graham, R. L.
1981
On graphs which contain all small trees. Zbl 0374.05042
Chung, F. R. K.; Graham, R. L.
1978
An upper bound for the Turán number $$t_3(n,4)$$. Zbl 0946.05063
Chung, Fan; Lu, Linyuan
1999
Quasi-random subsets of $$\mathbb{Z}_ n$$. Zbl 0779.05046
Chung, F. R. K.; Graham, R. L.
1992
Dynamic search in graphs. Zbl 0643.68083
Chung, F. R. K.; Graham, R. L.; Saks, M. E.
1987
A lower bound for the Steiner tree problem. Zbl 0376.05020
Chung, F. R. K.; Hwang, F. K.
1978
Universal graphs and induced-universal graphs. Zbl 0707.05036
Chung, Fan R. K.
1990
On graphs which contain all sparse graphs. Zbl 0495.05035
Babai, Laszlo; Chung, F. R. K.; Erdős, Paul; Graham, Ronald L.; Spencer, J. H.
1982
On universal graphs. Zbl 0478.05056
Chung, F. R. K.; Graham, R. L.
1979
Eigenvalues of random power law graphs. Zbl 1017.05093
Chung, Fan; Lu, Linyuan; Vu, Van
2003
Eigenvalues of graphs and Sobolev inequalities. Zbl 0843.05073
Chung, F. R. K.; Yau, Shing-Tung
1995
Communication complexity and quasi randomness. Zbl 0771.05073
Chung, Fan R. K.; Tetali, Prasad
1993
The number of different distances determined by n points in the plane. Zbl 0536.05003
Chung, F. R. K.
1984
Edge flipping in graphs. Zbl 1234.05210
Chung, Fan; Graham, Ron
2012
Combinatorics for the East model. Zbl 1006.82014
Chung, Fan; Diaconis, Persi; Graham, Ronald
2001
Coverings, heat kernels and spanning trees. Zbl 0915.05084
Chung, Fan; Yau, S.-T.
1999
On sampling with Markov chains. Zbl 0861.60079
Chung, F. R. K.; Graham, R. L.; Yau, S.-T.
1996
Laplacians of graphs and Cheeger’s inequalities. Zbl 0864.05070
Chung, F. R. K.
1996
A Harnack inequality for homogeneous graphs and subgraphs. Zbl 0834.05038
Chung, F. R. K.; Yau, Shing-Tung
1994
Routing permutations on graphs via matchings. Zbl 0812.05029
Alon, Noga; Chung, F. R. K.; Graham, R. L.
1994
Chordal completions of planar graphs. Zbl 0809.05038
Chung, F. R. K.; Mumford, David
1994
On the fractional covering number of hypergraphs. Zbl 0724.05054
Chung, F. R. K.; Füredi, Z.; Garey, M. R.; Graham, R. L.
1988
Diameters of graphs: Old problems and new results. Zbl 0695.05029
Chung, Fan R. K.
1987
On the cutwidth and the topological bandwidth of a tree. Zbl 0565.05019
Chung, Fan R. K.
1985
Isoperimetric inequalities for Cartesian products of graphs. Zbl 0911.05038
Chung, F. R. K.; Tetali, Prasad
1998
The largest minimal rectilinear Steiner trees for a set of n points enclosed in a rectangle with given perimeter. Zbl 0401.94044
Chung, F. R. K.; Hwang, F. K.
1979
The maximum relaxation time of a random walk. Zbl 1397.05096
Aksoy, Sinan G.; Chung, Fan; Tait, Michael; Tobin, Josh
2018
The digraph drop polynomial. Zbl 1400.05103
Chung, Fan; Graham, Ron
2018
Curvature aspects of graphs. Zbl 1361.31013
Bauer, F.; Chung, F.; Lin, Y.; Liu, Y.
2017
The spectral gap of graphs arising from substring reversals. Zbl 1368.05093
Chung, Fan; Tobin, Josh
2017
Juggling card sequences. Zbl 1370.05011
Butler, Steve; Chung, Fan; Cummings, Jay; Graham, Ron
2017
A strong Harnack inequality for graphs. Zbl 1378.05119
Chung, Fan; Yau, Shing-Tung
2017
Worst-case analysis of the LPT algorithm for single processor scheduling with time restrictions. Zbl 1339.90128
Braun, Oliver; Chung, Fan; Graham, Ron
2016
Decomposition of random graphs into complete bipartite graphs. Zbl 1330.05124
Chung, Fan; Peng, Xing
2016
A generalized Alon-Boppana bound and weak Ramanujan graphs. Zbl 1339.05223
Chung, Fan
2016
The matrix cover polynomial. Zbl 1336.05048
Chung, Fan; Graham, Ron
2016
On the discrepancy of circular sequences of reals. Zbl 1409.11055
Chung, Fan; Graham, Ron
2016
Edge flipping in the complete graph. Zbl 1327.05306
Butler, Steve; Chung, Fan; Cummings, Jay; Graham, Ron
2015
Distributed algorithms for finding local clusters using heat kernel PageRank. Zbl 1342.05159
Chung, Fan; Simpson, Olivia
2015
Computing heat kernel Pagerank and a local clustering algorithm. Zbl 1401.05273
Chung, Fan; Simpson, Olivia
2015
Harnack inequalities for graphs with non-negative Ricci curvature. Zbl 1309.05117
Chung, Fan; Lin, Yong; Yau, S.-T.
2014
Single-processor scheduling with time restrictions. Zbl 1305.68041
Braun, O.; Chung, F.; Graham, R.
2014
Discrepancy inequalities for directed graphs. Zbl 1298.05142
Chung, Fan; Kenter, Franklin
2014
From quasirandom graphs to graph limits and graphlets. Zbl 1300.05281
Chung, Fan
2014
A local clustering algorithm for connection graphs. Zbl 1342.05158
Chung, Fan; Kempton, Mark
2013
Inversion-descent polynomials for restricted permutations. Zbl 1256.05007
Chung, Fan; Graham, Ron
2013
Solving linear systems with boundary conditions using heat kernel PageRank. Zbl 1342.05057
Chung, Fan; Simpson, Olivia
2013
Edge flipping in graphs. Zbl 1234.05210
Chung, Fan; Graham, Ron
2012
Quasi-random hypergraphs revisited. Zbl 1236.05179
Chung, Fan
2012
Ranking and sparsifying a connection graph. Zbl 1342.05182
Chung, Fan; Zhao, Wenbo
2012
Braess’s paradox in expanders. Zbl 1256.05226
Chung, Fan; Young, Stephen J.; Zhao, Wenbo
2012
Hypergraph coloring games and voter models. Zbl 1342.05087
Chung, Fan; Tsiatas, Alexander
2012
Generalized Eulerian sums. Zbl 1291.05006
Chung, Fan; Graham, Ron
2012
On the spectra of general random graphs. Zbl 1229.05248
Chung, Fan; Radcliffe, Mary
2011
PageRank as a discrete Green’s function. Zbl 1255.68109
Chung, Fan
2011
Dirichlet PageRank and trust-based ranking algorithms. Zbl 1327.68031
Chung, Fan; Tsiatas, Alexander; Xu, Wensong
2011
Small spectral gap in the combinatorial Laplacian implies Hamiltonian. Zbl 1229.05193
Butler, Steve; Chung, Fan
2010
Descent polynomials for permutations with bounded drop size. Zbl 1227.05011
Chung, Fan; Claesson, Anders; Dukes, Mark; Graham, Ronald
2010
PageRank and random walks on graphs. Zbl 1208.05137
Chung, Fan; Zhao, Wenbo
2010
Tiling polygons with lattice triangles. Zbl 1205.52013
Butler, Steve; Chung, Fan; Graham, Ron; Laczkovich, Miklós
2010
Graph theory in the information age. Zbl 1274.05461
Chung, Fan
2010
Four proofs for the Cheeger inequality and graph partition algorithms. Zbl 1210.05076
Chung, Fan
2010
A symmetrical Eulerian identity. Zbl 1223.05005
Chung, Fan; Graham, Ron; Knuth, Donald E.
2010
A local graph partitioning algorithm using heat kernel pagerank. Zbl 1238.05208
Chung, Fan
2009
Distributing antidote using PageRank vectors. Zbl 1210.68010
Chung, Fan; Horn, Paul; Tsiatas, Alexander
2009
Packing equal squares into a large square. Zbl 1178.52015
Chung, Fan; Graham, Ron
2009
Percolation in general graphs. Zbl 1238.05244
Chung, Fan; Horn, Paul; Lu, Linyuan
2009
A local graph partitioning algorithm using heat kernel pagerank. Zbl 1207.05194
Chung, Fan
2009
The giant component in a random subgraph of a given graph. Zbl 1207.05177
Chung, Fan; Horn, Paul; Lu, Linyuan
2009
Quasi-random graphs with given degree sequences. Zbl 1130.05052
Chung, Fan; Graham, Ron
2008
Primitive juggling sequences. Zbl 1170.05006
Chung, Fan; Graham, Ron
2008
Local partitioning for directed graphs using pagerank. Zbl 1206.68347
Andersen, Reid; Chung, Fan; Lang, Kevin
2008
Random walks and local cuts in graphs. Zbl 1115.05054
Chung, Fan
2007
Local partitioning for directed graphs using PageRank. Zbl 1136.68317
Andersen, Reid; Chung, Fan; Lang, Kevin
2007
Oblivious and adaptive strategies for the majority and plurality problems. Zbl 1124.68075
Chung, Fan; Graham, Ron; Mao, Jia; Yao, Andrew
2007
Using PageRank to locally partition a graph. Zbl 1170.68302
Andersen, Reid; Chung, Fan; Lang, Kevin
2007
Detecting sharp drops in PageRank and a simplified local partitioning algorithm. Zbl 1198.68091
Andersen, Reid; Chung, Fan
2007
The spectral gap of a random subgraph of a graph. Zbl 1238.05243
Chung, Fan; Horn, Paul
2007
Universal juggling cycles. Zbl 1123.05005
Chung, Fan; Graham, Ron
2007
Complex graphs and networks. Zbl 1114.90071
Chung, Fan; Lu, Linyuan
2006
Concentration inequalities and martingale inequalities: a survey. Zbl 1111.60010
Chung, Fan; Lu, Linyuan
2006
The volume of the giant component of a random graph with given expected degrees. Zbl 1119.05098
Chung, Fan; Lu, Linyuan
2006
The diameter and Laplacian eigenvalues of directed graphs. Zbl 1084.05031
Chung, Fan
2006
Parallelism versus memory allocation in pipelined router forwarding engines. Zbl 1113.68036
Chung, Fan; Graham, Ronald; Mao, Jia; Varghese, George
2006
Optimal business policies for a supplier-transporter-buyer channel with a price-sensitive demand. Zbl 1089.90010
Lei, L.; Wang, Q.; Fan, C.
2006
Maximizing data locality in distributed systems. Zbl 1119.68035
Chung, Fan; Graham, Ronald; Bhagwan, Ranjita; Savage, Stefan; Voelker, Geoffrey M.
2006
Explicit construction of linear sized tolerant networks. (Reprint). Zbl 1095.68072
Alon, N.; Chung, F. R. K.
2006
Laplacians and the Cheeger inequality for directed graphs. Zbl 1059.05070
Chung, Fan
2005
Oblivious and adaptive strategies for the majority and plurality problems. Zbl 1124.68395
Chung, Fan; Graham, Ron; Mao, Jia; Yao, Andrew
2005
A spectral Turán theorem. Zbl 1163.05325
Chung, Fan
2005
Modeling the small-world phenomenon with local network flow. Zbl 1101.68308
Andersen, Reid; Chung, Fan; Lu, Linyuan
2005
The spectra of random graphs with given expected degrees. Zbl 1080.05021
Chung, Fan; Lu, Linyuan; Vu, Van
2004
Coupling online and offline analyses for random power law graphs. Zbl 1089.05021
Chung, Fan; Lu, Linyuan
2004
Discrete isoperimetric inequalities. Zbl 1067.53025
Chung, Fan
2004
The small world phenomenon in hybrid power law graphs. Zbl 1080.05085
Chung, Fan; Lu, Linyuan
2004
Analyzing the small world phenomenon using a hybrid model with local network flow (extended abstract). Zbl 1109.68321
Andersen, Reid; Chung, Fan; Lu, Lincoln
2004
Spectra of random graphs with given expected degrees. Zbl 1064.05138
Chung, Fan; Lu, Linyuan; Vu, Van
2003
The average distance in a random graph with given expected degrees. Zbl 1065.05084
Chung, Fan; Lu, Linyuan
2003
Eigenvalues of random power law graphs. Zbl 1017.05093
Chung, Fan; Lu, Linyuan; Vu, Van
2003
Generalizations of Polya’s urn problem. Zbl 1022.60005
Chung, Fan; Handjani, Shirin; Jungreis, Doug
2003
Connected components in random graphs with given expected degree sequences. Zbl 1009.05124
Chung, Fan; Lu, Linyuan
2002
The average distances in random graphs with given expected degrees. Zbl 1064.05137
Chung, Fan; Lu, Linyuan
2002
Random evolution in massive graphs. Zbl 1024.68073
Aiello, William; Chung, Fan; Lu, Linyuan
2002
Sparse quasi-random graphs. Zbl 0997.05090
Chung, Fan; Graham, Ronald
2002
Spectral partitioning with indefinite kernels using the Nyström extension. Zbl 1039.68599
Belongie, Serge; Fowlkes, Charless; Chung, Fan; Malik, Jitendra
2002
A chip-firing game and Dirichlet eigenvalues. Zbl 1026.91025
Chung, Fan; Ellis, Robert B.
2002
Guessing secrets with inner product questions. Zbl 1058.94006
Chung, Fan; Graham, Ronald; Lu, Linyuan
2002
On sparse sets hitting linear forms. Zbl 1101.11006
Chung, Fan; Erdős, Paul; Graham, Ronald
2002
A random graph model for power law graphs. Zbl 0971.05100
Aiello, William; Chung, Fan; Lu, Linyuan
2001
The diameter of sparse random graphs. Zbl 0977.05127
Chung, Fan; Lu, Linyuan
2001
Distance realization problems with applications to internet tomography. Zbl 1006.68102
Chung, Fan; Garrett, Mark; Graham, Ronald; Shallcross, David
2001
Combinatorics for the East model. Zbl 1006.82014
Chung, Fan; Diaconis, Persi; Graham, Ronald
2001
Guessing secrets. Zbl 0961.68100
Chung, Fan; Graham, Ronald; Leighton, Tom
2001
Dynamic location problems with limited look-ahead. Zbl 1015.68011
Chung, Fan; Graham, Ronald
2001
A random graph model for massive graphs. Zbl 1296.05172
Aiello, William; Chung, Fan; Lu, Linyuan
2000
Discrete Green’s functions. Zbl 0963.65120
Chung, Fan; Yau, S.-T.
2000
Higher eigenvalues and isoperimetric inequalities on Riemannian manifolds and graphs. Zbl 1001.58022
Chung, Fan; Grigor’yan, Alexander; Yau, Shing-Tung
2000
Weighted graph Laplacians and isoperimetric inequalities. Zbl 1009.05095
Chung, F. R. K.; Oden, Kevin
2000
A Harnack inequality for Dirichlet eigenvalues. Zbl 0953.05045
Chung, Fan; Yau, S.-T.
2000
On polynomials of spanning trees. Zbl 0947.05050
Chung, Fan; Yang, Chao
2000
An upper bound for the Turán number $$t_3(n,4)$$. Zbl 0946.05063
Chung, Fan; Lu, Linyuan
1999
Coverings, heat kernels and spanning trees. Zbl 0915.05084
Chung, Fan; Yau, S.-T.
1999
Erdős on graphs. His legacy of unsolved problems. Zbl 0921.05045
Chung, Fan; Graham, Ron
1999
Spanning trees in subgraphs of lattices. Zbl 0942.05045
Chung, Fan
1999
Multidiameters and multiplicities. Zbl 0937.05037
Chung, Fan; Delorme, Charles; Solé, Patrick
1999
Logarithmic Sobolev techniques for random walks on graphs. Zbl 0992.60072
Chung, Fan
1999
...and 145 more Documents
all top 5
Cited by 4,605 Authors
62 Chung Graham, Fan-Rong King 29 Graham, Ronald Lewis 28 Sudakov, Benny 26 Kohayakawa, Yoshiharu 26 Rodl, Vojtech 24 Alon, Noga M. 23 van der Hofstad, Remco W. 20 Fox, Jacob 19 Furedi, Zoltan 18 Conlon, David 17 Schacht, Mathias 16 Du, Ding-Zhu 16 Jost, Jürgen 15 Chang, Yanxun 15 Chung, Soon-Yeong 15 Hurlbert, Glenn H. 15 Hwang, Frank Kwangming 15 Li, Shuchao 14 Erdős, Pál 14 Hua, Bobo 14 Krivelevich, Michael 13 Mubayi, Dhruv 13 Prałat, Paweł 12 Hancock, Edwin Robert 12 Lu, Linyuan 12 Rinaldi, Simone 11 Balogh, József 11 Butler, Steven Kay 11 Carmona, Ángeles 11 Kahn, Jeff D. 11 Liu, Shiping 11 Wakabayashi, Yoshiko 10 Bhamidi, Shankar 10 Bollobás, Béla 10 Encinas, Andrés M. 10 Král’, Daniel 10 Tuza, Zsolt 9 Bolla, Marianna 9 Das, Kinkar Chandra 9 Diaconis, Persi Warren 9 Friedrich, Tobias 9 Hansen, Pierre 9 Hooghiemstra, Gerard 9 Li, Yusheng 9 Miyazawa, Flavio Keidi 9 Mota, Guilherme Oliveira 9 Peres, Yuval 9 Pinzani, Renzo 9 Sós, Vera Turán 9 Zhang, Xiaodong 8 Bendito, Enrique 8 Dankelmann, Peter 8 Fomin, Fedor V. 8 Gyárfás, András 8 Hàn, Hiệp 8 Horn, Paul S. 8 Janson, Svante 8 Liu, Yanpei 8 Nikiforov, Vladimir S. 8 Pergola, Elisa 8 Rautenbach, Dieter 8 Schelp, Richard Herbert 8 Shiu, Wai Chee 8 Wu, Dianhua 8 Yin, Jianxing 8 Zhang, Zhongzhi 7 Atay, Fatihcan M. 7 Axenovich, Maria A. 7 Cioabă, Sebastian M. 7 Deijfen, Maria 7 Faudree, Ralph Jasper jun. 7 Fiol, Miquel Angel 7 Godbole, Anant P. 7 Ji, Lijun 7 Klavžar, Sandi 7 Lonc, Zbigniew 7 Lovász, László 7 Lu, Mei 7 Magnant, Colton 7 Münch, Florentin 7 Pach, János 7 Panagiotou, Konstantinos D. 7 Pikhurko, Oleg 7 Samotij, Wojciech 7 Sauerwald, Thomas 7 Simonovits, Miklós 7 Skokan, Jozef 7 Thomason, Andrew G. 7 Xu, Junming 7 Yau, Shing-Tung 6 Aouchiche, Mustapha 6 Banerjee, Anirban 6 Bauer, Frank 6 Bertozzi, Andrea Louise 6 Bringmann, Karl 6 Chen, Kejun 6 Dudek, Andrzej 6 Ferber, Asaf 6 Fountoulakis, Nikolaos 6 Frieze, Alan Michael ...and 4,505 more Authors
all top 5
Cited in 424 Serials
283 Discrete Mathematics 196 Discrete Applied Mathematics 127 Linear Algebra and its Applications 97 Theoretical Computer Science 73 European Journal of Combinatorics 70 Journal of Combinatorial Theory. Series A 69 Random Structures & Algorithms 67 Journal of Combinatorial Theory. Series B 53 Graphs and Combinatorics 47 Algorithmica 46 Combinatorica 44 Pattern Recognition 44 Combinatorics, Probability and Computing 37 Information Processing Letters 29 Journal of Graph Theory 29 Advances in Applied Mathematics 29 SIAM Journal on Discrete Mathematics 28 Journal of Statistical Physics 27 The Annals of Applied Probability 27 Designs, Codes and Cryptography 27 Chaos 26 Israel Journal of Mathematics 26 Journal of Mathematical Analysis and Applications 25 Advances in Mathematics 25 Applied Mathematics and Computation 25 Journal of Computer and System Sciences 25 Applied and Computational Harmonic Analysis 22 Discrete & Computational Geometry 22 European Journal of Operational Research 20 Journal of Combinatorial Optimization 17 The Annals of Statistics 17 Transactions of the American Mathematical Society 17 The Electronic Journal of Combinatorics 16 Networks 15 Statistics & Probability Letters 15 Applied Mathematics Letters 14 Advances in Applied Probability 14 Linear and Multilinear Algebra 14 Journal of Algebraic Combinatorics 14 Finite Fields and their Applications 13 Information Sciences 13 Probability Theory and Related Fields 12 The Annals of Probability 12 Automatica 12 Journal of Functional Analysis 12 Proceedings of the American Mathematical Society 12 SIAM Journal on Computing 12 Stochastic Processes and their Applications 12 Journal of Statistical Mechanics: Theory and Experiment 11 Journal of Mathematical Physics 11 Journal of Applied Probability 11 SIAM Journal on Algebraic and Discrete Methods 11 Computers & Operations Research 11 Computational Geometry 11 Geometric and Functional Analysis. GAFA 10 Czechoslovak Mathematical Journal 10 Operations Research Letters 10 Annals of Operations Research 9 Computers & Mathematics with Applications 9 Communications in Mathematical Physics 9 Physica D 9 Information and Computation 9 Neural Networks 9 International Journal of Foundations of Computer Science 9 Bulletin of the American Mathematical Society. New Series 9 Calculus of Variations and Partial Differential Equations 9 Annals of Combinatorics 9 Discrete Mathematics, Algorithms and Applications 8 Physica A 8 Journal of Number Theory 8 Journal of Theoretical Probability 8 SIAM Review 8 Journal of Combinatorial Designs 8 Bernoulli 8 Theory of Computing Systems 8 Acta Mathematica Sinica. English Series 7 Journal of the Franklin Institute 7 Periodica Mathematica Hungarica 7 Journal of Statistical Planning and Inference 7 Neural Computation 7 International Journal of Computer Mathematics 7 Computational Complexity 7 Applied Mathematics. Series B (English Edition) 7 Complexity 7 RAIRO. Operations Research 6 Physics Reports 6 Chaos, Solitons and Fractals 6 Journal of Computational and Applied Mathematics 6 Journal of the American Mathematical Society 6 Machine Learning 6 Journal of Mathematical Imaging and Vision 6 Discussiones Mathematicae. Graph Theory 6 Mathematical Problems in Engineering 6 Journal of the European Mathematical Society (JEMS) 6 Communications in Nonlinear Science and Numerical Simulation 6 Discrete Optimization 6 Frontiers of Mathematics in China 6 The Annals of Applied Statistics 6 Computer Science Review 5 American Mathematical Monthly ...and 324 more Serials
all top 5
Cited in 62 Fields
2,083 Combinatorics (05-XX) 656 Computer science (68-XX) 314 Probability theory and stochastic processes (60-XX) 275 Operations research, mathematical programming (90-XX) 205 Information and communication theory, circuits (94-XX) 155 Linear and multilinear algebra; matrix theory (15-XX) 136 Statistics (62-XX) 131 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 99 Number theory (11-XX) 93 Partial differential equations (35-XX) 89 Statistical mechanics, structure of matter (82-XX) 88 Convex and discrete geometry (52-XX) 85 Biology and other natural sciences (92-XX) 81 Numerical analysis (65-XX) 60 Systems theory; control (93-XX) 51 Group theory and generalizations (20-XX) 48 Differential geometry (53-XX) 46 Ordinary differential equations (34-XX) 46 Operator theory (47-XX) 44 Global analysis, analysis on manifolds (58-XX) 36 Order, lattices, ordered algebraic structures (06-XX) 34 Difference and functional equations (39-XX) 32 Dynamical systems and ergodic theory (37-XX) 32 Geometry (51-XX) 28 Quantum theory (81-XX) 18 Harmonic analysis on Euclidean spaces (42-XX) 17 Potential theory (31-XX) 15 Real functions (26-XX) 15 Functional analysis (46-XX) 15 Algebraic topology (55-XX) 13 Manifolds and cell complexes (57-XX) 12 Mathematical logic and foundations (03-XX) 12 Measure and integration (28-XX) 10 General and overarching topics; collections (00-XX) 10 General topology (54-XX) 9 Algebraic geometry (14-XX) 9 Calculus of variations and optimal control; optimization (49-XX) 6 Field theory and polynomials (12-XX) 6 Commutative algebra (13-XX) 6 Associative rings and algebras (16-XX) 6 Abstract harmonic analysis (43-XX) 5 History and biography (01-XX) 5 Approximations and expansions (41-XX) 5 Mechanics of particles and systems (70-XX) 4 Special functions (33-XX) 3 Functions of a complex variable (30-XX) 3 Fluid mechanics (76-XX) 3 Classical thermodynamics, heat transfer (80-XX) 2 General algebraic systems (08-XX) 2 Topological groups, Lie groups (22-XX) 2 Several complex variables and analytic spaces (32-XX) 2 Sequences, series, summability (40-XX) 2 Integral transforms, operational calculus (44-XX) 2 Optics, electromagnetic theory (78-XX) 1 Nonassociative rings and algebras (17-XX) 1 Category theory; homological algebra (18-XX) 1 $$K$$-theory (19-XX) 1 Integral equations (45-XX) 1 Mechanics of deformable solids (74-XX) 1 Relativity and gravitational theory (83-XX) 1 Geophysics (86-XX) 1 Mathematics education (97-XX)
Wikidata Timeline
The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.
| 2021-01-21T12:43:05 |
{"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.4862017333507538, "perplexity": 9805.102159086533}, "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-2021-04/segments/1610703524743.61/warc/CC-MAIN-20210121101406-20210121131406-00485.warc.gz"}
|
http://dlmf.nist.gov/33.19
|
§33.19 Power-Series Expansions in $r$
33.19.1 $\mathop{f\/}\nolimits\!\left(\epsilon,\ell;r\right)=r^{\ell+1}\sum_{k=0}^{% \infty}\alpha_{k}r^{k},$
where
33.19.2 $\displaystyle\alpha_{0}$ $\displaystyle=2^{\ell+1}/(2\ell+1)!,$ $\displaystyle\alpha_{1}$ $\displaystyle=-\alpha_{0}/(\ell+1),$ $\displaystyle k(k+2\ell+1)\alpha_{k}+2\alpha_{k-1}+\epsilon\alpha_{k-2}$ $\displaystyle=0,$ $k=2,3,\dots$. Symbols: $!$: $n!$: factorial, $k$: nonnegative integer, $\ell$: nonnegative integer, $\epsilon$: real parameter and $\alpha_{k}$: term Permalink: http://dlmf.nist.gov/33.19.E2 Encodings: TeX, TeX, TeX, pMML, pMML, pMML, png, png, png
33.19.3 $2\pi\mathop{h\/}\nolimits\!\left(\epsilon,\ell;r\right)={\sum_{k=0}^{2\ell}% \frac{(2\ell-k)!\gamma_{k}}{k!}(2r)^{k-\ell}-\sum_{k=0}^{\infty}\delta_{k}r^{k% +\ell+1}}-A(\epsilon,\ell)\left(2\mathop{\ln\/}\nolimits|2r/\kappa|+\realpart{% \mathop{\psi\/}\nolimits\!\left(\ell+1+\kappa\right)}+\realpart{\mathop{\psi\/% }\nolimits\!\left(-\ell+\kappa\right)}\right){\mathop{f\/}\nolimits\!\left(% \epsilon,\ell;r\right),}$ $r\neq 0$.
Here $\kappa$ is defined by (33.14.6), $A(\epsilon,\ell)$ is defined by (33.14.11) or (33.14.12), $\gamma_{0}=1$, $\gamma_{1}=1$, and
33.19.4 $\gamma_{k}-\gamma_{k-1}+\tfrac{1}{4}(k-1)(k-2\ell-2)\epsilon\gamma_{k-2}=0,$ $k=2,3,\dots$.
Also,
33.19.5 $\displaystyle\delta_{0}$ $\displaystyle=\left(\beta_{2\ell+1}-2(\mathop{\psi\/}\nolimits\!\left(2\ell+2% \right)+\mathop{\psi\/}\nolimits\!\left(1\right))A(\epsilon,\ell)\right)\alpha% _{0},$ $\displaystyle\delta_{1}$ $\displaystyle=\left(\beta_{2\ell+2}-2(\mathop{\psi\/}\nolimits\!\left(2\ell+3% \right)+\mathop{\psi\/}\nolimits\!\left(2\right))A(\epsilon,\ell)\right)\alpha% _{1},$
33.19.6 $k(k+2\ell+1)\delta_{k}+2\delta_{k-1}+\epsilon\delta_{k-2}+2(2k+2\ell+1)A(% \epsilon,\ell)\alpha_{k}=0,$ $k=2,3,\dots$,
with $\beta_{0}=\beta_{1}=0$, and
33.19.7 $\beta_{k}-\beta_{k-1}+\tfrac{1}{4}(k-1)(k-2\ell-2)\epsilon\beta_{k-2}+\tfrac{1% }{2}(k-1)\epsilon\gamma_{k-2}=0,$ $k=2,3,\dots$.
The expansions (33.19.1) and (33.19.3) converge for all finite values of $r$, except $r=0$ in the case of (33.19.3).
| 2014-09-02T09:09:00 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 84, "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.9970831871032715, "perplexity": 8040.928562182353}, "config": {"markdown_headings": false, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2014-35/segments/1409535921872.11/warc/CC-MAIN-20140909033919-00179-ip-10-180-136-8.ec2.internal.warc.gz"}
|
https://www.usgs.gov/media/images/traces-hayward-fault-california
|
# Traces of the Hayward Fault, California
## Detailed Description
The purpose of this map is to show the location of and evidence for recent movement on active fault traces within the Hayward Fault Zone, California. The mapped traces represent the integration of the following three different types of data: (1) geomorphic expression, (2) creep (aseismic fault slip),and (3) trench exposures.
## Details
Image Dimensions: 859 x 1109
Location Taken: CA, US
Source:
| 2020-02-28T03:32: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.8908227682113647, "perplexity": 14069.584373275167}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2020-10/segments/1581875146940.95/warc/CC-MAIN-20200228012313-20200228042313-00325.warc.gz"}
|
http://xfhj.shoptelsrl.it/snowflake-math-functions.html
|
# Snowflake Math Functions
Snowflake currently supports two types of UDFs, SQL and JavaScript: A SQL UDF evaluates an arbitrary SQL expression and returns either scalar or tabular results. Here we cover the basics of Matillion ETL for new users while providing links for further reading on each topics. Lapidus 1 '*, Michael M. For example, the TRUE function lets you know whether an expression that you are evaluating returns a TRUE value. Math is Fun Curriculum for Grade 7. Since there are so many. in Home science, Mathematics. Can anyone do this? I have searched, but I am no math major by any strech and most of the stuff out there doesn't. Granulometry likens image objects to stones whose sizes can be determined by sifting them through screens of increasing size and collecting what remains after each pass. I have this actonscript code that i am developing in flash cs4 for a snow storm and I cannot seem to get it to work. To help Tableau rookies, we're starting from square one with the Tableau Essentials blog series. Algebra worksheets to improve student performance through fun riddles, activities and games. Suppose having a Koch snowflake. Here is a Snowflake graphing and symmetry activity freebie. Four Quadrant Graphing Characters Worksheets. snowflake 4 total contributions I have function [S , U ] = HOSVD ( A ) where U is a cell array of length 3 and I would like the function to return each cell. Experiment with reflections across any line, revolving around any line (which yields a 3-D image), rotations about any point, and translations in any direction. Note: When converting from a float or numeric to an integer, the CONVERT() function will truncate the result. Also a link to the pure js source. Or in other words, every time there is a line segment, divide it into thirds, make the middle third the base of an equilateral triangle, then erase the base. Soon I'll have to break out the shovel, but before then, I thought I'd put together a short tutorial on how to draw a snowflake using JavaScript and the HTML canvas element. ©w 92 t0P1 H2K aK urt DaL 2SpoFf 4tpw Racrte 1 nL ZLbCt. They are available free with Internet Explorer 4. These particular trajectories are generated by a system of IFS's (iterated function systems) each acting on a different collection of points. length = 1; % Original side length of triangle This is a no no. 2 also with a standard deviation of 3. Each time we add a triangle, one side of the Koch snowflake will turn into four. Topics include:- ALGEBRA BASICS- EQUATIONS- INEQUALITIES- FUNCTIONS- LINEAR FUNCTIONS/EQUATIONS-. com where the cup is half full! This is one of our more popular pages most likely because learning fractions is incredibly important in a person's life and it is a math topic that many approach with trepidation due to its bad rap over the years. Mathematics Grade 6. This forms part of one of Mike Lawler's blog post about the lecture, where he discuses how the radius of the Earth and the radius of the Moon's orbit were measured, and how Tao's lecture was an incredible. Grade 3 » Operations & Algebraic Thinking » Represent and solve problems involving multiplication and division. In general English it means to make larger. Reading and doing mathematics independently is a goal of this class. The interdisciplinary nature of the project showed me the endless potential of mathematics. we cut symmetrically when the snowflake is ready. F, called folders, and assigning each folder a diameter. This version of Gosper's flowsnake was first described by Martin Gardner in one of this Mathematical Games columns in Scientific American. Mostly modular origami. Operate cash register and scanner to itemize and total customer’s purchase, collect payment from customers and make change, bag merchandise, and assist customers with merchandise as necessary. A formula for the interior ε-neighbourhood of the classical von Koch snowflake curve is computed in detail. Clearly, in the real world, we do not observe identical snowflakes because each snow flake has different conditions as it falls from the sky to hit the Earth. As a second result we prove that functions that are intrinsically Lipschitz on the snowflake boundary admit Euclidean Lipschitz extensions to the closure of the entire domain. The result of this calculation proves the non-integer fractal dimension. Get free Java Script tutorials, references, code, menus, calendars, popup windows, games and help. In spite of many functions and options being available, new users can be running simple tasks in minutes. Sense definition, any of the faculties, as sight, hearing, smell, taste, or touch, by which humans and animals perceive stimuli originating from outside or inside the body: My sense of smell tells me that dinner is ready. Snowflake 2 Basic Some of the worksheets for this concept are Factoring trinomials a 1 date period, Snowflake life cycle, Let it snow, For chapter 7 kinds of sentence structure 130 3 the, Noun review, Test driving snowflake, Function operations date period, Kindergarten spanish curriculum content skills resources. Com where our gift to you is a page of Christmas math worksheets! On this page you will find a selection of Christmas math worksheets and regular math worksheets decorated with Christmas ornaments. SUMMARY SNOWFLAKE GEOMETRIC PROPERTIES SNOWFLAKE COMPUTER MODELING SNOWFLAKE PUZZLES ICOSAHEDRAL VIRUS On the Geometry and Mathematical Modelling of Snowflakes and. 1 with a standard deviation of 3 and ten samples around a mean of 18. A snowflake is a single ice crystal that has achieved a sufficient size, and may have amalgamated with others, then falls through the Earth's atmosphere as snow. inorganic) is the usual described nucleator but more recently studies have also shown >1% of snowflakes in an average snowfall have DNA containing material as the nucleators. Also a link to the pure js source. The review of arithmetic begins with integers, fractions, and decimals and progresses to the set of real numbers. Function A function is a rule which assigns to each member of a set of inputs, called the domain, a member of a set of outputs, called the range. Explore a wide range of recent research in mathematics. This single triangle is equivalent to the zeroth iteration of the Koch snowflake, and we are now ready to use the Application Builder to create more complex snowflakes. Hey hypnoman, I think you're actually experiencing the same issues I was, I just didn't know the exact problem at the time. 1 Worksheet by Kuta Software LLC. Through explorations of spatial. Or the closed, self-avoiding curves of 3649 and 3313. Develop data science projects using your favorite IDEs, including Jupyter, JupyterLab, Spyder, and RStudio. Finally, here's a fun little applet I found called Make-a-Flake. Check out our previous blog post on “Snowflake Math. ©w 92 t0P1 H2K aK urt DaL 2SpoFf 4tpw Racrte 1 nL ZLbCt. Calculates the 3D skeleton of an arbitrary binary volume using parallel medial axis thinning. challenge your students to apply linear equations and/or slope to the creation and analysis of snowflakes. This Geometry Worksheet may be printed, downloaded or saved and used in your classroom, home school, or other educational environment to help someone learn math. I recommend using the snowflakes (like and different shape) to create a curve. The Koch Snowflake was created by the Swedish mathematician Niels Fabian Helge von Koch. For a second variation, let K = {f 1, f 2, f 3, f 4} be the four functions in the Koch IFS. When you've entered you desired search terms use tab to navigate through the available results and hit enter to open the selected page or document. The app has a very simple user interface. com and was even more excited. For the boundary of the Koch snowflake, you can look at: THE SNOWFLAKE CURVE AS AN ATTRACTOR OF AN ITERATED FUNCTION SYSTEM Demir, B. If you want to use them, you'll either have to do your coding using Borland's Turbo C++ from twenty years ago, or use one of the modern remakes of that library. m defines a function to draw the Koch snowflake. 3, (2002) 427-437. Our methods combine the fractal membrane analysis, the vector analysis for local Dirichlet forms and PDE on fractals, coercive closed forms, and the analysis of Lipschitz. Share on Facebook Share on Twitter Submit to Reddit. A snowflake is the nastiest well-behaved curve we can think of. pathological function shocked the mathematical community and sparked debates around the question of whether continuous functions were necessarily nowhere differentiable. This single triangle is equivalent to the zeroth iteration of the Koch snowflake, and we are now ready to use the Application Builder to create more complex snowflakes. tv's chat using JavaScript and Scaledrone realtime messaging service. Best way to Learn Mathematics : The best way of learning math is depending on the topic or concept that we would like to learn in the subject mathematics. function [vectors, bbox] = snowflake(n, width, height) snowflake returns the n -th iteration of the outline as a series of two-dimensional vectors , scaled to fit within a rectangle of width by height units. A snowflake is the nastiest well-behaved curve we can think of. The Koch snowflake is a fractal curve which was first described by Helge von Koch in 1904. The JavaScript Source is your resource for thousands of free JavaScripts for cutting and pasting into your Web pages. The Owner/Director, Suzie Shride, takes a personal interest in seeing to it that each child succeeds in more ways than just learning Math. Often times in mathematics we use the rectangular or Cartesian coordinate system. It’s a very pretty thing. Let's Play (Russia) In this game, I started by building a single surface rail line along the coast, and I chose a "sparse" strategy, building track-only (no stations) on less populated tiles. The lungs and tree have similar shapes since that is the most ideal for each to serve their function: respiration. In mathematics, the Weierstrass function is an example of a pathological real-valued function on the real line. Math explained in easy language, plus puzzles, games, quizzes, worksheets and a forum. The Jonathan Coulton song "Mandelbrot Set" is a tribute to both the fractal itself and to its discoverer Benoit Mandelbrot. A formula for the interior $\varepsilon$-neighborhood of the classical von Koch snowflake curve is computed in detail. Everyone knows that the INTCK function returns the integer count of the number of interval boundaries between two dates, two times, or two datetime values. Snowflake Designer's Page Engineering the perfect snowflake If a long string, such as a piece of nylon fishing line, is hung down the center of the chamber, then ice crystals will grow all along the string. Powered by Create your own unique website with customizable templates. Patterns, Functions, & Algebra Rags to Riches Game for Inequalities. In my research about fractals, I have found that they are nowhere differentiable. Fractal geometry is one of the most exciting areas of math. The coolest thing I've discovered this semester are Desmos Activities. In this tutorial we will create a falling snow effect using Flash and ActionScript 3. You can even adjust the speed that the snowflakes move. function [vectors, bbox] = snowflake(n, width, height) snowflake returns the n -th iteration of the outline as a series of two-dimensional vectors , scaled to fit within a rectangle of width by height units. getElementById("imageView"); mcontext = main_canvas. The best way to store a reference to a function is to use a function handle. Let's Play (Russia) In this game, I started by building a single surface rail line along the coast, and I chose a "sparse" strategy, building track-only (no stations) on less populated tiles. Read "Computing eigenfunctions on the Koch Snowflake: A new grid and symmetry, Journal of Computational and Applied Mathematics" on DeepDyve, the largest online rental service for scholarly research with thousands of academic publications available at your fingertips. The official equation is: The only difference in its definition from the Mandelbrot set is that c is no longer a point in the complex plane, but rather a complex parameter, which is consistent whichever point you pick. Snowflake Designer's Page Engineering the perfect snowflake If a long string, such as a piece of nylon fishing line, is hung down the center of the chamber, then ice crystals will grow all along the string. Explore math with desmos. Discover Resources #4) The Altitudes of a triangle; test; Mathematiques 1; String Art : Dynamic 12X12A Vpre; Unit Circle Construction Activity. We're going to be building a real-time JavaScript chat room similar to Twitch. This function of ε is shown to match quite closely with earlier predictions from [La-vF1] of what it should be, but is also much more precise. Pang 2 '** 1 Department of Mathematics, Sproul Hall, The University of California, Riverside, CA 92521-. The Koch Snowflake. jalada Fractual is your gate to this fantastic world. To start a new discussion with a link back to this one, click here. B = ordfilt2(A,order,domain,S) filters A, where ordfilt2 uses the values of S corresponding to the nonzero values of domain as additive offsets. Linas' Mathematical Art Gallery has been running for over twenty years while being silent about the underlying math. To see how these 3D Snowflakes are done, just search for the keywords “DIY 3D Snowflakes” in YouTube Science Reviewer: Peripheral Nervous System September 3, 2014 Grade 4 , Grade 5 Lessons , Grade 6 , Homeschoolers No More , Science No Comments. The DB2, Oracle, MySQL and PostgreSQL provide a function named TO_CHAR() that has a similar feature to the CAST function. The Koch Snowflake after 5 iterations. Notes: Each Hour Quiz will be distributed at the beginning of the lab period and collected at the end of the lab period. Lambda is a tool for building functions, or more precisely, for building function objects. It addresses the content outlined in the ACARA Mathematical Methods Curriculum Units 1 and 2, as well as the SACE Stage 1 Mathematical Methods subject outline. This shape that we're describing right here is called a Koch snowflake. Regardless of your Snowflake use case or focus area, this post is your one-stop reference for understanding the Snowflake Cloud Data Warehouse (similar in format to the popular cheat sheet that I. How to make Snowflakes with Code (Xmas & Hour of Code Special) Python Programming Tutorial | Recursive Functions Part 1/2 - Duration: 5:07. To resize something. The series is intended to be an easy-to-read reference on the basics of using Tableau Software, particularly Tableau Desktop. If you have any questions about a particular seminar, please contact the speaker's host. A printable worksheet PDF is included. The procedures are illustrated with Sierpinski's triangle and an interesting bush-like fractal. Explore math with Desmos. AMS, American Mathematical Society, the tri-colored AMS logo, and Advancing research, Creating connections, are trademarks and services marks of the American Mathematical Society and registered in the U. If the curve is on plane, the rotation is done on the axis, around the center of the curve. join the two new fields (L_LINENUMBER1, L_QUANTITY1) to the original table (LINEITEM) how to use create function to do this. In the former case, the usual definition of the snowflake curve directly suggests a concrete continuous parameterization of if. In mathematics, certain basic concepts, such as symmetry and infinity, are so pervasive and adaptable that they can become elusive to the student. Who We Are. The snowy weather has snowflakes on our minds, though perhaps not the mathematical kind. Now, to derive an expression for the area of our construction at the iteration, let's start with the fifth iteration. Splat Square 0-100. Problem of the Unit created by students Jasmine, Gabby, Ricardo and Patricia More Math related stuff Miscellaneous SAT Practice Heart of. Calculate moment of inertia of Koch snowflake. A tube formula for the Koch snowflake curve, with Basic Survival Tools - a very brief student's guide to some basic principles of functions & sets, for any math. Follow our guide to find out more about the world’s top universities for mathematics, high-level mathematics topics and potential careers with a mathematics degree. This fractal involves taking a triangle and turning the central third of each segment into a triangular bump in a way that makes the fractal symmetric. Can someone explain this in simple terms? Especially if the Koch Snowflake was used as an example to explain. Nettling's Sixth Grade Math Study Table Practice Illinois 5th Grade State Test Interactive -30 questions - test questions change each time you visit the site. PEARSE To appear in the Proceedings of the London Mathematical Society. surely if you keep adding smaller and smaller sides to the snowflake they will become even smaller than the planck length and so how can the perimeter be infinite- or is the infinite perimeter only theorteically possible with maths, but not actaully acheivable? surely if you keep adding smaller and. Granulometry estimates the intensity surface area distribution of snowflakes as a function of size. JavaScript Falling Snowflakes with images 4/5 23 votes / 19,949 previews / 5 comment 30/01/2007 Decorate your webpage with this great animated document effect! Watch as snow fall gently trickles down the page, then dJavaScript Falling Snowflakes with images - Falling Snowflakes with images. As the value of a stock rises or falls, people are inclined to buy or sell that stock. function [] = koch_snowflake(iterations) % or and add an end at the bottom of your script. Can anyone do this? I have searched, but I am no math major by any strech and most of the stuff out there doesn't. Explore Jostens personalized college and high school class rings, customizable yearbooks, championship rings, graduation products, and more. Whether you live in an area that sees lots of snow or one that never feels a flake, you and your students can enjoy the fun and fascination of mathematical snowflake explorations. Best way to Learn Mathematics : The best way of learning math is depending on the topic or concept that we would like to learn in the subject mathematics. If you have followed the steps you should be able to delete the initial snowflake that you have on stage, it's not going to be controlled by the code anyway. Boomcoding, Its great to see you're interested in coding, and I see that you're new here. We advance significantly the observed range of behavior for such functions. Spectra of almost periodic matrices in 4K resolution. Our methods combine the fractal membrane analysis, the vector analysis for local Dirichlet forms and PDE on fractals, coercive closed forms, and the analysis of Lipschitz. Lambda is a tool for building functions, or more precisely, for building function objects. I love using snowflakes to teach math! The possibilities are endless, from art and science projects to teaching rotational symmetry. The snowflake schema is represented by centralized fact tables which are connected to multiple dimensions. In particular, we find that, for functions with a continuous Laplacian, the gradient must be defined almost everywhere, and specify a set of points for which it is defined. Nettling's Sixth Grade Math Study Table Practice Illinois 5th Grade State Test Interactive -30 questions - test questions change each time you visit the site. Mathematical origami, Helena Verrill. Free pdf on adding, subtracting, muliplying and dividing functions. All Rights Reserved. From falling snowflakes to our entire galaxy, we count fifteen incredible examples of mathematics in nature! 15 – Snowflakes, You can’t go past the tiny but miraculous snowflake as an example of symmetry in nature. Free, online math games and more at MathPlayground. Creates evaluable function handles for any function, possibly outside the MATLAB search path: A couple of my favorite new Image Processing Toolbox functions. One can see a sample snowflake here on the math forum. These functions (and date parts) disregard the session parameters (i. This results in a mathematically tractable growth form where, if cells reproduce at the same rate, the number of cells distance x from the basal cell follows Pascal’s triangle (Fig. Students then create their own snowflakes and find the slopes of those lines. a mathematics professor at UC Davis. Another method for describing the location of a point is with distance and direction from a fixed reference point. Coding, mathematics, and problem solving by Sahand Saba. These winter theme activities are fun and engaging for preschoolers. Reflect the wedge around the center of the image 12 times to generate the rest of the image. This set of printables includes 10 math quilts with a snowflake theme. Check back soon. I'm new to the Python world and would appreciate all feedback on how to make the code more Pythonic as I'm not used to these idioms, styles and modules. English: The Koch snowflake (or Koch star) is a mathematical curve and one of the earliest fractal curves to have been described. The example above has a base case (on line 13) which does not lead to a recursive call: the case where the element is not a (sub-) list. ity is the Dehn function δ(x) which bounds the number of defining relations that one must apply to a word w = G 1 to reduce it to the empty word; the bound is a function of word-length |w|. This is Which One Doesn't Belong?, a website dedicated to providing thought-provoking puzzles for math teachers and students alike. Tip: See also the CAST() function. Here is a graphic preview for all of the graphing worksheets. Powered by Create your own unique website with customizable templates. We had 2 fascinating discovery bottles. The statement inside the function definition in which the function calls itself is known as the recursive call. For a second variation, let K = {f 1, f 2, f 3, f 4} be the four functions in the Koch IFS. p v dMnaMdfev lw TiSt1h t HIbnZf difngikt le O sAOl1g fe Gb8r6a e Q1Y. For the boundary of the Koch snowflake, you can look at: THE SNOWFLAKE CURVE AS AN ATTRACTOR OF AN ITERATED FUNCTION SYSTEM Demir, B. The first iteration is blue, the second green, the third yellow, the fourth is red, and the fifth is black (Creative Commons, image from Wikimedia Commons). Polygons - Hexagons - Cool Math has free online cool math lessons, cool math games and fun math activities. The Koch snowflake is constructed by starting with an equilateral triangle, then adding to each side of that triangle another equilateral triangle pointing outwards, centered on the edges. There are many more gems in there, and you can help find them. Read each question carefully to make sure you understand the type of answer required. Math Classroom Math Teacher Teaching Math Teaching Geometry Geometry Angles Angles Maths Symmetry Math Math Activities Math Games Facebook Twitter Pinterest Did you know that snowflakes have many different types of angles?If you are working on angles and geometry in your home, here is a fun activity and worksheet for your kids to work on. It's been a cold winter all over the place, so let's recognize that fact with a nice wintery scene. Its images are stunning in their beauty and complexity, yet they are made from simple rules. ply file for instance. The Jonathan Coulton song "Mandelbrot Set" is a tribute to both the fractal itself and to its discoverer Benoit Mandelbrot. The Julia set is a series of equations that are mathematical fractals, and that is defined very similarly to the Mandelbrot set. Quite a big. DCU is recognised nationally and internationally as a centre of academic excellence with over 16,000 students READ MORE. Mathematical functions called Rohde snowflakes are different than your typical wintry precipitation. Without a base case, you’ll have infinite recursion, and your program will not work. The best way to store a reference to a function is to use a function handle. COMC 2019 competitions math camps math at work outreach math projects for science fairs for university students CUMC 2019 teachers' resources prizes and awards CMEF - math education forum external education links. The interdisciplinary nature of the project showed me the endless potential of mathematics. KOCH'S SNOWFLAKE. The Koch snowflake at stage 0 is an equilateral triangle with side length 1 unit. The dirt particles make the snowflake heavier and can cause cracks and breaks in the crystal and make it easier to melt. To construct the Koch Snowflake, we have to begin with an equilateral triangle with sides of length, for example, 1. Bonus: God's Handiwork in Snowflakes Math might not be the first thing you think of when you see snow, but believe it or not, math helps us describe God's handiwork in each tiny snowflake. The maturity date is the date when the security expires. @Cristina X: inline functions are totally outdated, very inefficient, and will be removed soon from MATLAB altogether. This Geometry Worksheet may be printed, downloaded or saved and used in your classroom, home school, or other educational environment to help someone learn math. Stored Procedures and Functions in PostgreSQL - Getting Started A stored procedure and user-defined function (UDF) is a set of SQL and procedural statements (declarations, assignments, loops, flow-of-control etc. The x, y dimensions of snowflakes get all the attention for obvious reasons, but the z dimension must be interesting too, in its own humble way. Welcome winter with these fun projects that combine math and art! Erin Bittman on November 30, 2015 Koch Snowflake Art. With the cloud in which flakes form usually one to two kilometers (0. Instead, snowflakes, like biological organisms, are formed as the product of a series of steps, acting under natural laws with some element of chance. This is given as a problem in one of the best books on Haskell – The Haskell School of Expression, by Proffessor Paul Hudak. Tie a short piece of string through the top loop and tie the other end of the string around the pencil. All other feedback is of course also greatly appreciated. Convert date to string using TO_CHAR() function. Next time you listen to a favorite tune or wonder at the beauty of a natural sound, you might also end up pondering the math behind the music. Science World shows students the interconnected nature of science by relating each exciting topic to biology, chemistry, physics, earth science and engineering. STEM Cases, Handbooks and the associated Realtime Reporting System are protected by US Patent No. we cut symmetrically when the snowflake is ready. DCU is a young, dynamic and ambitious university with a distinctive mission to transform lives and societies through education, research and innovation. Let’s Go Shopping!. Conceptually, the flux is the rate of flow of fluid through. Jacqueline Fleckinger, Michael Levitin, Dmitri Vassiliev; Heat Equation on the Triadic Von Koch Snowflake: Asymptotic and Numerical Analysis, Proceedings of th We use cookies to enhance your experience on our website. JavaScript Snowflake It's getting to be that time of the year again. Functions of Data warehouse: It works as a collection of data and here is organized by various communities that endures the features to recover the data functions. Solve the problem. THE VISION: Direct connector from Powerapps to Snowflake DW. I love using snowflakes to teach math! The possibilities are endless, from art and science projects to teaching rotational symmetry. Math can be incredibly beautiful. The Koch antisnowflake curve, also known as antistar curve, is constructed using the same principles as the regular Koch snowflake, except here every side of the starting equilateral triangle bends inwards at every iteration at 60 degrees rather than outwards. Number patterns—such as 3, 6, 9, 12—are familiar to us since they are among the patterns we first learn as young students. Let’s Go Shopping!. It's very interesting to see how they've done it, you can get some ideas for your next project. How to pass contents of cell array to a function?. Lapidus coordinates a weekly meeting between him and his PhD students and mentees. Group Members. Snowflake Math. Get free Java Script tutorials, references, code, menus, calendars, popup windows, games and help. Use multiplication and division within 100 to solve word problems in situations involving equal groups, arrays, and measurement quantities, e. The general procedure was pointed out (Begin with F. For other conversions, the CONVERT() function will round the result. After an infinit number of iterations the remaining area is 0. Free worksheet(pdf) and answer key on Operations with Functions--25 scaffolded questions that start easy and conclude with some real challenges Operations with Functions Worksheet and Answer Key. Comparing the gene expression between the unicellular Y55 ancestor and an early (7-day) snowflake yeast, we found that 1,035 genes were. The Mandelbrot set is considered by many the most popular fractal, and has been referenced several times in popular culture. I live in California and not the mountainous part of California, so I don't actually see snowflakes. Since there is no interval data type supported in Snowflake we are trying to implement the same using an UDF. Where relevant, Snowflake features include interactive geometry, graphing, and statistics software, demonstrations, games, spreadsheets, and a range of printable worksheets, tables, and diagrams. Entropy Jumps in the Presence of a Spectral Gap (with K. Carry this to its logical conclusion and you end up with an infinitely long coastline containing a finite space, the same paradox put forward by Helge von Koch in the Koch Snowflake. To resize something. The Koch Snowflake was created by the Swedish mathematician Niels Fabian Helge von Koch. In many cases, math is used to place limitations. This function of ε is shown to match quite closely with earlier predictions from [La-vF1] of what it should be, but is also much more precise. Recursive function. Examples are the middle third Cantor set, the von Koch snowflake curve and the graph of a nowhere differentiable continuous function. Replace each F with FLFRRFLF. Math can be incredibly beautiful. pop() - removes the last element from the array and. The Mathematicians at Work poster, which is part of this initiative grew out of an earlier poster produced by the Canadian Mathematical Society on Women in Mathematics. Mathematics Grade 6. Since there are so many. An image of a snowflake with the required diameter. It looks like you need to apply a function to parse the array. Summary: this tutorial introduces you to the SQL COALESCE function and shows you how to apply this function in real scenarios. The study of analytic structures on self-similar fractal sets was initiated by physicists who discovered that heat flow on such sets had sub-Gaussian rather than Gaussian scaling, indicating that the fundamental physics of these sets was very different than on manifolds. Replace each F with FLFRRFLF. SnowFlake Overload. Atmospheric dust (i. They make great window displays when cut out! There is an option to change the color of each snowflake. Just press a button and you'll automatically get a Koch snowflake. Snowflake Online Learning. A snowflake is the nastiest well-behaved curve we can think of. please [email protected]!! xx. In this activity, students create their own snowflakes by folding a square piece of paper and cutting out designs of their choice along the edges of the folded paper. To do this we will use the polar coordinate system. It has stocked facts about the tables which have high transaction levels which are observed so as to define the data warehousing techniques and major functions which are involved in. They were originally written in Java, but they've mostly been converted to Javascript, so you should be able to view them without a Java-capable browser. Barthe), Duke Mathematical Journal 119, No. Spooky Sequences: Count BACK by 10's Math Playground Function Machine. The prize at the end will be combining your newfound Algebra skills in trigonometry and using complex variables to gain a full understanding of Euler’s identity. Bing helps you turn information into action, making it faster and easier to go from searching to doing. Fractal geometry is one of the most exciting areas of math. This Koch Snowflake Lesson Plan is suitable for 9th - 10th Grade. by Emily Fung. It's been a cold winter all over the place, so let's recognize that fact with a nice wintery scene. That’s not all there is to the story, though: read more at the page on Fibonacci in nature. inorganic) is the usual described nucleator but more recently studies have also shown >1% of snowflakes in an average snowfall have DNA containing material as the nucleators. Play the best free games, deluxe downloads, puzzle games, word and trivia games, multiplayer card and board games, action and arcade games, poker and casino games, pop culture games and more. Granulometry likens image objects to stones whose sizes can be determined by sifting them through screens of increasing size and collecting what remains after each pass. Boomcoding, Its great to see you’re interested in coding, and I see that you’re new here. In my research about fractals, I have found that they are nowhere differentiable. The aim of this article is to illustrate how to draw a binary tree and a snowflake using WPF. We are converting the intervals into seconds and after getting the total seconds we are converting the total second into the required target interval type. Nettling's Sixth Grade Math Study Table Practice Illinois 5th Grade State Test Interactive -30 questions - test questions change each time you visit the site. But since the plane is infinitely large, the length and width cannot be measured. There are no answers provided as there are many different, correct ways of choosing which one doesn't belong. it is very. They thought that mathematics would no longer need nature. com, a free online graphing calculator. The study of statistics develops students’ ability to describe and analyse phenomena that involve uncertainty and variation. If you have any questions about a particular seminar, please contact the speaker's host. The 9 year old had a friend over and they spent most of the day inside - he asked what the pattern blocks were when he came out to eat but I decided to prioritize food over math play at that moment, and then he disappeared before I could invite him to play after dinner. For instance, a side of the Koch snowflake is both symmetrical and scale-invariant; it can be continually magnified 3x without changing shape. Here’s an example. The Mandelbrot set is considered by many the most popular fractal, and has been referenced several times in popular culture. January 21, 2008. learning for 2 year elegant fourth grade math worksheet kindergarten worksheets snowflake reading unique free. Patent and Trademark Office. The snowflake has the. No installation, real-time collaboration, version control, hundreds of LaTeX templates, and more. As you scroll down, you will see many worksheets for skip counting sequences, even and odd numbers, counting patterns - up to 100, numbers to 100, numbers to 1000, counting patterns - up to 1000, numbers in words - up to 1000, hundred chart, number lines, skip counting, and more. Calculate its moment of inertia. For other conversions, the CONVERT() function will round the result. Have her continue using this flipping and taping process to finish the fourth and fifth loop. The result of this calculation proves the non-integer fractal dimension. The first iteration is blue, the second green, the third yellow, the fourth is red, and the fifth is black (Creative Commons, image from Wikimedia Commons).
| 2019-12-14T15:53: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": 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.41029492020606995, "perplexity": 1544.0826975122532}, "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/1575541281438.51/warc/CC-MAIN-20191214150439-20191214174439-00237.warc.gz"}
|
https://agilescientific.com/blog/2015/1/8/it-goes-in-the-bin
|
# It goes in the bin
The cells of a digital image sensor. CC-BY-SA Natural Philo.
Inlines and crosslines of a 3D seismic volume are like the rows and columns of the cells in your digital camera's image sensor. Seismic bins are directly analogous to pixels — tile-like containers for digital information. The smaller the tiles, the higher the maximum realisable spatial resolution. A square survey with 4 million bins (or 4 megapixels) gives us 2000 inlines and 2000 crosslines to interpret, after processing the data of course. Small bins can mean high resolution, but just as with cameras, bin size is only one aspect of image quality.
Unlike your digital camera however, seismic surveys don't come with a preset number of megapixels. There aren't any bins until you form them. They are an abstraction.
### Making bins
This post picks up where Laying out a seismic survey left off. Follow the link to refresh your memory; I'll wait here.
At the end of that post, we had a network of sources and receivers, and the Notebook showed how I computed the midpoints of the source–receiver pairs. At the end, we had a plot of the midpoints. Next we'd like to collect those midpoints into bins. We'll use the so-called natural bins of this orthogonal survey — squares with sides half the source and receiver spacing.
Just as we represented the midpoints as a GeoSeries of Point objects, we will represent the bins with a GeoSeries of Polygons. GeoPandas provides the GeoSeries; Shapely provides the geometries; take a look at the IPython Notebook for the code. This green mesh is the result, and will hold the stacked traces after processing.
### Fetching the traces within each bin
To create a CMP gather like the one we modelled at the start, we need to grab all the traces that have midpoints within a particular bin. And we'll want to create gathers for every bin, so it is a huge number of comparisons to make, even for a small example such as this: 128 receivers and 120 sources make 15 320 midpoints. In a purely GIS environment, we could perform a spatial join operation between the midpoint and bin GeoDataFrames, but instead we can use Shapely's contains method inside nested loops. Because of the loops, this code block takes a long time to run.
# Make a copy because I'm going to drop points as I
# assign them to polys, to speed up subsequent search.
midpts = midpoints.copy()
offsets, azimuths = [], [] # To hold complete list.
# Loop over bin polygons with index i.
for i, bin_i in bins.iterrows():
o, a = [], [] # To hold list for this bin only.
# Now loop over all midpoints with index j.
for j, midpt_j in midpts.iterrows():
if bin_i.geometry.contains(midpt_j.geometry):
# Then it's a hit! Add it to the lists,
# and drop it so we have less hunting.
o.append(midpt_j.offset)
a.append(midpt_j.azimuth)
midpts = midpts.drop([j])
# Add the bin_i lists to the master list
# and go around the outer loop again.
offsets.append(o)
azimuths.append(a)
# Add everything to the dataframe.
bins['offsets'] = gpd.GeoSeries(offsets)
bins['azimuths'] = gpd.GeoSeries(azimuths)
After we've assigned traces to their respective bins, we can make displays of the bin statistics. Three common views we can look at are:
1. A spider plot to illustrate the offset and azimuth distribution.
2. A heat map of the number of traces contributing to each bin, usually called fold.
3. A heat map of the minimum offset that is servicing each bin.
The spider plot is easily achieved with Matplotlib's quiver plot:
And the arrays representing our data are also quite easy to display as heatmaps of fold (left) and minimum offset (right):
In the next and final post of this seismic survey mini-series, we'll analyze the impact of data quality when there are gaps and shifts in the source and receiver stations from these idealized locations.
Last thought: if the bins of a seismic survey are like a digital camera's image sensor, then what is the apparatus that acts like a lens?
| 2017-05-25T21:59:51 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 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.4310109317302704, "perplexity": 2438.8703882344694}, "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/1495463608617.6/warc/CC-MAIN-20170525214603-20170525234603-00024.warc.gz"}
|
https://par.nsf.gov/biblio/10175212-high-redshift-jwst-predictions-from-illustristng-ii-galaxy-line-continuum-spectral-indices-dust-attenuation-curves
|
High-redshift JWST predictions from IllustrisTNG: II. Galaxy line and continuum spectral indices and dust attenuation curves
ABSTRACT We present predictions for high redshift (z = 2−10) galaxy populations based on the IllustrisTNG simulation suite and a full Monte Carlo dust radiative transfer post-processing. Specifically, we discuss the H α and H β + $[\rm O \,{\small III}]$ luminosity functions up to z = 8. The predicted H β + $[\rm O \,{\small III}]$ luminosity functions are consistent with present observations at z ≲ 3 with ${\lesssim} 0.1\, {\rm dex}$ differences in luminosities. However, the predicted H α luminosity function is ${\sim }0.3\, {\rm dex}$ dimmer than the observed one at z ≃ 2. Furthermore, we explore continuum spectral indices, the Balmer break at 4000 Å; (D4000) and the UV continuum slope β. The median D4000 versus specific star formation rate relation predicted at z = 2 is in agreement with the local calibration despite a different distribution pattern of galaxies in this plane. In addition, we reproduce the observed AUV versus β relation and explore its dependence on galaxy stellar mass, providing an explanation for the observed complexity of this relation. We also find a deficiency in heavily attenuated, UV red galaxies in the simulations. Finally, we provide predictions for the dust attenuation curves of galaxies at z = 2−6 and investigate their dependence on galaxy colours and more »
Authors:
; ; ; ; ; ; ; ;
Award ID(s):
Publication Date:
NSF-PAR ID:
10175212
Journal Name:
Monthly Notices of the Royal Astronomical Society
Volume:
495
Issue:
4
Page Range or eLocation-ID:
4747 to 4768
ISSN:
0035-8711
National Science Foundation
##### More Like this
1. ABSTRACT The James Webb Space Telescope (JWST) promises to revolutionize our understanding of the early Universe, and contrasting its upcoming observations with predictions of the Λ cold dark matter model requires detailed theoretical forecasts. Here, we exploit the large dynamic range of the IllustrisTNG simulation suite, TNG50, TNG100, and TNG300, to derive multiband galaxy luminosity functions from z = 2 to z = 10. We put particular emphasis on the exploration of different dust attenuation models to determine galaxy luminosity functions for the rest-frame ultraviolet (UV), and apparent wide NIRCam bands. Our most detailed dust model is based on continuum Monte Carlo radiative transfer calculations employing observationally calibrated dust properties. This calibration results in constraints on the redshift evolution of the dust attenuation normalization and dust-to-metal ratios yielding a stronger redshift evolution of the attenuation normalization compared to most previous theoretical studies. Overall we find good agreement between the rest-frame UV luminosity functions and observational data for all redshifts, also beyond the regimes used for the dust model calibrations. Furthermore, we also recover the observed high-redshift (z = 4–6) UV luminosity versus stellar mass relation, the H α versus star formation rate relation, and the H α luminosity function at z = 2. The bright endmore »
2. ABSTRACT
We present an analysis of the dust attenuation of star-forming galaxies at z = 2.5–4.0 through the relationship between the UV spectral slope (β), stellar mass (M*), and the infrared excess (IRX = LIR/LUV) based on far-infrared continuum observations from the Atacama Large Millimeter/sub-millimeter Array (ALMA). Our study exploits the full ALMA archive over the COSMOS field processed by the A3COSMOS team, which includes an unprecedented sample of ∼1500 galaxies at z ∼ 3 as primary or secondary targets in ALMA band 6 or 7 observations with a median continuum sensitivity of 126 $\rm {\mu Jy\, beam}^{-1}$ (1σ). The detection rate is highly mass dependent, decreasing drastically below log (M*/M⊙) = 10.5. The detected galaxies show that the IRX–β relationship of massive (log M*/M⊙ > 10) main-sequence galaxies at z = 2.5–4.0 is consistent with that of local galaxies, while starbursts are generally offset by $\sim 0.5\, {\rm dex}$ to larger IRX values. At the low-mass end, we derive upper limits on the infrared luminosities through stacking of the ALMA data. The combined IRX–M* relation at $\rm {log\, ({\it M}_{\ast }/\mathrm{M}_{\odot })\gt 9}$ exhibits a significantly steeper slope than reported in previous studies at similar redshifts, implying little dust obscuration at log M*/M⊙ < 10.more »
3. Abstract
We investigate the relationship between dust attenuation and stellar mass (M*) in star-forming galaxies over cosmic time. For this analysis, we compare measurements from the MOSFIRE Deep Evolution Field survey atz∼ 2.3 and the Sloan Digital Sky Survey (SDSS) atz∼ 0, augmenting the latter optical data set with both UV Galaxy Evolution Explorer (GALEX) and mid-infrared Wide-field Infrared Survey Explorer (WISE) photometry from the GALEX-SDSS-WISE Catalog. We quantify dust attenuation using both spectroscopic measurements of Hαand Hβemission lines, and photometric measurements of the rest-UV stellar continuum. The Hα/Hβratio is used to determine the magnitude of attenuation at the wavelength of Hα,AHα. Rest-UV colors and spectral energy distribution fitting are used to estimateA1600, the magnitude of attenuation at a rest wavelength of 1600 Å. As in previous work, we find a lack of significant evolution in the relation between dust attenuation andM*over the redshift rangez∼ 0 toz∼ 2.3. Folding in the latest estimates of the evolution ofMdust, (Mdust/Mgas), and gas surface density at fixedM*, we find that the expectedMdustand dust mass surface density are both significantly higher atz∼ 2.3 than atz∼ 0. These differences appear at odds with the lack of evolution in dust attenuation. To explain the striking constancymore »
4. ABSTRACT
We post-process galaxies in the IllustrisTNG simulations with skirt radiative transfer calculations to make predictions for the rest-frame near-infrared (NIR) and far-infrared (FIR) properties of galaxies at z ≥ 4. The rest-frame K- and z-band galaxy luminosity functions from TNG are overall consistent with observations, despite ${\sim}0.5\, \mathrm{dex}$ underprediction at z = 4 for MK ≲ −25 and Mz ≲ −24. Predictions for the JWST MIRI observed galaxy luminosity functions and number counts are given. Based on theoretical estimations, we show that the next-generation survey conducted by JWST can detect 500 (30) galaxies in F1000W in a survey area of $500\, {\rm arcmin}^{2}$ at z = 6 (z = 8). As opposed to the consistency in the UV, optical, and NIR, we find that TNG, combined with our dust modelling choices, significantly underpredicts the abundance of most dust-obscured and thus most luminous FIR galaxies. As a result, the obscured cosmic star formation rate density (SFRD) and the SFRD contributed by optical/NIR dark objects are underpredicted. The discrepancies discovered here could provide new constraints on the sub-grid feedback models, or the dust contents, of simulations. Meanwhile, although the TNG predicted dust temperature and its relations with IR luminosity and redshiftmore »
5. ABSTRACT We report the identification of a low-mass active galactic nucleus (AGN), DES J0218−0430, in a redshift z = 0.823 galaxy in the Dark Energy Survey (DES) Supernova field. We select DES J0218−0430 as an AGN candidate by characterizing its long-term optical variability alone based on DES optical broad-band light curves spanning over 6 yr. An archival optical spectrum from the fourth phase of the Sloan Digital Sky Survey shows both broad Mg ii and broad H β lines, confirming its nature as a broad-line AGN. Archival XMM–Newton X-ray observations suggest an intrinsic hard X-ray luminosity of $L_{{\rm 2-12\, keV}}\approx 7.6\pm 0.4\times 10^{43}$ erg s−1, which exceeds those of the most X-ray luminous starburst galaxies, in support of an AGN driving the optical variability. Based on the broad H β from SDSS spectrum, we estimate a virial black hole (BH) mass of M• ≈ 106.43–106.72 M⊙ (with the error denoting the systematic uncertainty from different calibrations), consistent with the estimation from OzDES, making it the lowest mass AGN with redshift > 0.4 detected in optical. We estimate the host galaxy stellar mass to be M* ≈ 1010.5 ± 0.3 M⊙ based on modelling the multiwavelength spectral energy distribution. DES J0218−0430 extends the M•–M* relation observed in luminous AGNs at z ∼ 1 tomore »
| 2022-12-09T20:22: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.5788183808326721, "perplexity": 4437.725108440788}, "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/1669446711475.44/warc/CC-MAIN-20221209181231-20221209211231-00861.warc.gz"}
|
https://pavpanchekha.com/blog/top-down-lr.html
|
## By Pavel Panchekha
### 04 March 2023
Share under CC-BY-SA.
# Top-down LR parsing
This semester, I am teaching Compilers, and I'm quite happy with how I covered parsing this year. Specifically, I taught students to build a top-down LR parser and it seemed to go relatively well.
Update: Laurence asks me to note that he's not as much of a parser theorist as this post makes him out to be.
Update: There's an ongoing discussion on Hacker News about this post. I learned a lot from it!
Update: Gábor Lehel pointed me to Russell Johnston's post on recursive ascent parsing. It's not quite the same, but similar in spirit to what's described here.
## What I want out of parsing
I am not a big fan of the parsing portion of a compilers class, but I try to do a good job of it because I recognize that parsing is the part of my compilers class that students are most likely to reuse in their later programming. This means that I do want students to parse a real programming language with infix operators and precedence, not just S-expressions, and to use a general-enough parsing algorithm that they could re-use their skills on future parsing problems.
Additionally, the style of my Compilers class is that we write nearly everything from scratch, so I don't just want to teach them to use ANTLR or a similar tool. I also do not want to spend a lot of time on theory. While I find Laurence Tratt's argument for LR parsing persuasive, I find that most presentations of LR parsing are very theoretical, and building intuition for resolving conflicts takes longer than I want to spend on parsing (which is two weeks of lecture and three assignments).
Finally, what I did take away from Laurence Tratt's posts is that I do not want students to just write spaghetti code recursive descent parsers that just "do something". I want to teach a parsing methodology, not just get them to write enough code to get the parser working; I want students to derive their parser directly from their grammar. Especially because, in my experience, students are exceptionally clever when it comes to inventing bugs, and parser bugs are often quite hard to find.
## Top-down LL
I start by teaching students to write recursive descent parsers for what I call LL(1) languages. Specifically, I say that a grammar is LL(1) if every production for a non-terminal N starts with a different terminal T. I make sure the grammar we compile has plenty of productions like that:
expr : <integer>
| <float>
| <variable>
| [ <expr> , ... ]
| { <expr> , ... }
Because I am teaching them a methodology, I have a very specific way I want them to write this parser.
I ask them to write a function called parse_expr, and functions called parse_int_expr, parse_float_expr, and so on. The parse_expr functions only ever do one thing: they switch on the results of peek_token, and in each branch calls a parse_X_expr function:
Expr parse_expr() {
switch (peek_token()) {
case INT:
return parse_int_expr();
...
}
}
The parse_X_expr functions only ever do one thing: they call expect_token for each token and parse_N for each non-terminal N, one after another, before finally building and returning an AST node of the appropriate type.
IntExpr parse_int_expr() {
int n = expect_token(TokenType.INTVALUE);
return new IntExpr(n);
}
This year, I waited to introduce sequences and repetion until I had covered LR parsing, but in future years I might introduce the idea of a parse_exprs function that contains a while loop, and teach them to write a single specific while loop to parse sequences.
The goal is that students should be able to translate an LL(1) grammar to code mechanically. This part is pretty standard, it's how top-down parsing is normally taught. Most parsing classes that aren't using a parser generator are going to have a section somewhat like this.
## Top-down LR
I now explain that some grammars are not LL(1), because multiple productions can start with the same terminal. I stick to easy examples, like post-fix indexing operations, instead of doing tricky things like infix operations. So for example, we might add this to the grammar:1 [1 For those wondering, in the language I have them compile, square brackets are for N-dimensional tensors and curly braces are for tuples.]
expr : <expr> [ <expr> , ... ]
| <expr> { <integer> }
This grammar isn't LL(1) because both these productions and other productions can start with, say, a variable token. Note that this is implicitly introducing the FIRST set from LR table construction, but instead of defining it recursively, I just talk them through the concept of whether the first token of two productions can match. This is a natural follow-on from discussing LL(1) grammars.
Now, instead of introducing LR grammars and LR parsing, I introduce the idea of transforming this grammar into another one. Specifically, I ask students to transform the grammar into:
expr : <integer> <expr_cont>
| <float> <expr_cont>
| <variable> <expr_cont>
| [ <expr> , ... ] <expr_cont>
| { <expr> , ... } <expr_cont>
expr_cont : [ <expr> , ... ] <expr_cont>
| { <integer> } <expr_cont>
|
This grammar isn't quite LL(1), because expr_cont has an empty production, but the rule is just that all productions have to start with different tokens, except that there can be an empty production, and if there's a single production then it can start with a non-terminal.
Note that this grammar is equivalent to the original. Doing this transformation is not easy or intuitive for students, but we do lots of examples. I pick two different productions that can start with the same token and write out example programs that use those two productions. Then I ask: at what point do we know that they're using two different productions, because they correspond to two different tokens that can be seen at that point? That's the point where we want to add a _cont grammar class. Again, this is implicitly introducing the FOLLOWS set from LR parsing, but I introduce it intuitively instead of mathematically.
The parse_expr and parse_int_expr functions stay exactly the same; here, parse_int_expr calls parse_expr_cont at the end, just like a normal non-terminal. However, these continuation non-terminals are special (and I tell students to always name them x_cont to keep track): instead of taking no arguments, they take terminals or non-terminals as an argument. So, for example, the parse_int_expr parses an integer token, builds an IntExpr AST node from it, and then calls parse_expr_cont with that IntExpr as an argument:
Expr parse_int_expr() {
String n = expect_token(TokenType.INTVALUE);
IntExpr e = new IntExpr(n);
return parse_expr_cont(e);
}
These parsing functions for continuation non-terminals then use that argument to build larger AST nodes, based on further parses:
Expr parse_tupleindex_expr_cont(Expr base) {
expect_token(TokenType.LCURLY);
String n = expect_token(TokenType.INTVALUE);
expect_token(TokenType.RCURLY);
Expr e = new TupleIndexExpr(base, n);
return parse_expr_cont(e);
}
One big advantage of this approach is that it leverages the idea of grammar transformation / elaboration / equivalence. This makes talking about ambiguity easier, because my approach to grammar ambiguity also involves rewriting the grammar into an equivalent, non-ambiguous grammar. Moreover, I can ask students to turn in elaborated grammars before they start coding, which cuts down on bugs dramatically and also isn't that much work for me (because the grammars are short).
Now, if you think about this in terms of LR parsing, all of the _cont grammatical classes here correspond to different LR(0) states, and the fact that these _cont classes always come at the end of a production means that the recursive descent parser is using tail calls, that is, just iterating instead of recursing. So once you have the parser in this form, you can create invert the control flow to get a normal LR parser with a table, so I'm not straying far from the theory here.
But most presentations of an LR parser introduce it with enough formality to write a parser generator—because most LR parsers use a table, and writing a table by hand is difficult for any non-trivial language. Instead of doing that, my top-down LR parsing approach requires students to compute the state table and transitions mostly by hand—but they only need to do it once, for the specific language that we are compiling, which means much less formality is needed. Students don't need to learn how the FIRST and FOLLOW sets are defined, though they do use those concepts when doing the transformation themselves. (And, of course, I control the langauge grammar so I've built it in a way to require _cont tokens in a couple of places.) By framing that as a grammar transformation instead of table construction, I also get them to practice a skill they'll need later for grammar disambiguation.
## Disambiguation
My discussion of disambiguation is pretty standard, so I won't discuss it in too much detail. I introduce ambiguity, explain the idea of banning of banning certain patterns (like a AddExpr below a MultExpr), show how you do that by splitting the expr class into multiple classes, and so on. This is how most discussions of parsing cover it, and I do it too.
But one thing that has to do with parsing algorithms is associativity. LL parsers prefer to parenthesize to the right while LR parsers prefer to parenthesize to the left. However, in my top-down LR approach, the grammar is the same:
addexpr : <mulexpr> <addexpr_cont>
|
The main difference is how parse_addexpr_cont works. You can specify its input to be a MulExpr or an Expr. In the first case, you're guaranteeing that the left hand side of the addition is a multiply node, meaning that you get right associativity. In the second case, you allow it to be an addition node and get left associativity. In code, option one looks like this:
Expr parse_add_addexpr_cont(MulExpr lhs) {
expect_token(TokenType.PLUS);
MulExpr middle = parse_mulexpr();
}
Option two looks like this:
Expr parse_add_addexpr_cont(Expr first) {
expect_token(TokenType.PLUS);
MulExpr middle = parse_mulexpr();
Expr lhs = new AddExpr(first, middle);
}
Note that the first option, which left associates, looks a lot like an LL parser, where the last thing we do is build an AST node. And the second option, which right associates, looks a lot like an LR parser, at least in the sense that we tail recurse, which is kind of like iterating. Importantly, students figured this out without hints.
## Conclusion
I taught students to parse a reasonably complicated language this way, and didn't get too much complaining. Students did struggle with grammar transformations, but they would have struggled with them anyway when I talked about grammar ambiguity. And despite building a pretty complex parser, the parser could be almost entirely derived from the grammar, with the associativity decision being the only decision they have to make at the code level.
Now, one part of Laurence's pitch that I find compelling that I'm not making use of here is the idea that an LR parser generator is a kind of type checker for your grammar, making sure that it can be parsed unambiguously. It would be cool to build some grammar tooling for students to use, which could maybe use a standard LR parser generator under the hood to provably identify ambiguous grammars. But even in this case, I wouldn't need to actually teach the students what shift/reduce and reduce/reduce conflicts are, because those would just be translated into two productions starting with the same token. Also, I'd be interested to know what the standard name for this kind of parsing is; if you've seen it before, let me know.
## Footnotes:
1
For those wondering, in the language I have them compile, square brackets are for N-dimensional tensors and curly braces are for tuples.
| 2023-03-30T01:15: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": 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.6893562078475952, "perplexity": 1611.4374347249172}, "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/1679296949093.14/warc/CC-MAIN-20230330004340-20230330034340-00733.warc.gz"}
|
https://www.ecb.europa.eu/pub/economic-bulletin/articles/2020/html/ecb.ebart202006_02~2966618cfa.en.html
|
Search Options
Home Media Explainers Research & Publications Statistics Monetary Policy The €uro Payments & Markets Careers
Suggestions
Sort by
# The viral effects of foreign trade and supply networks in the euro area
Prepared by Virginia Di Nino and Bruno Veltri
Published as part of the ECB Economic Bulletin, Issue 6/2020.
Adverse shocks induced by containment measures introduced in response to the coronavirus (COVID-19) are not limited to the originating country; while not the sole propagation mechanism, foreign trade transmits these shocks across economies. In the euro area, the deep integration of firms within regional supply chains – as well as strong demand ties – acts as a magnifying mechanism. This article quantifies the propagation and impact of adverse shocks originating in the euro area on euro area GDP, foreign trade and trade balances. It concludes that the transmission to the rest of the euro area of a shock originating in one of the five largest Member States ranges between 15% and 28% of the original shock’s size. The negative spillover effects are most severe for open countries and those most intertwined in regional production networks.
## 1 Introduction
In their attempts to limit the spread of the COVID-19 pandemic, all euro area governments introduced lockdowns and containment measures, spurring a blend of supply and demand shocks which adversely affected their economies in addition to the economic consequences of the disease itself. As the pandemic unfolded across the globe, many other countries adopted similar measures, thus putting the euro area under further strain, as commercial and business activities were closed, movement permitted only for necessities, and travel limited to essential business or where force majeure made it necessary. The severe repercussions at national level on the spending capability, consumption and investment preferences of economic agents have spread across the globe, with their intensity depending on the degree of economic and industrial interconnectedness.
The remainder of this article is structured as follows. The methodological framework, scenarios and related assumptions are described in Section 2. Section 3 describes the channels of transmission and Section 4 discusses the effects on the euro area economy of lockdowns and containment measures implemented in its five largest economies. It also delves into the mitigation effects expected to result from the policies designed by governments to support citizens’ income and business activity in times of pandemic. Section 5 concludes by reviewing the main takeaways from our analysis and discusses the potential structural economic changes triggered by COVID-19.
## 2 Data and methodology
The article takes data from the Multi-Regional Input-Output (MRIO) database of the Asian Development Bank (ADB) that reconstructs national and international flows between country-sector pairs and sectoral final demand. The database encompasses all euro area economies and a broad set of other countries. Compared with alternative sources, it also provides more recent information up to 2018 (see Box 1 for a detailed description of the database and our methodology).[2]
The analysis uses a static representation of the economic linkages across sectors and countries to evaluate the economic effects on individual industries of virus-suppression policies. Different sectors are affected to varying degrees by supply disruptions and lockdown measures. The entire manufacturing industry, except for food, beverages, tobacco and pharmaceuticals, has been significantly affected by COVID-19 containment measures. Repercussions on agriculture and aquaculture have been less severe, as is the case for certain services that can be provided remotely, such as telecommunications (which may even have received a boost as a result of the changing behaviour of economic agents during the pandemic). We account for this through the careful differentiation of production shocks in Section 4. Conversely, other areas, namely transport, tourism and accommodation, are assumed to have experienced the severest adverse hits.
## Box 1 A working tool: the inter-country input-output tables
This box describes the structure of the inter-country input-output tables (ICIOTs) and how different types of shocks can be applied to them. An ICIOT (see Table A) is structured around two main matrices: the international market for intermediates, Z, and the international market for final goods, Y. The rows of Z are producing country-sectors and the columns are consuming country-sectors. The columns of Y are pairs of countries and final demand sectors (such as private consumption and investment), only one of which is depicted in the simplified illustration below. Both Y and Z consist of G times G submatrices that contain the bilateral sectoral supply linkages between all country pairs.
A number of aggregate and more granular descriptive statistics can be obtained from the ICIOTs. This is illustrated below by some examples. Let $z i j s t , y i j s , x i s , v a i s$ denote the elements of the respective matrices, where s, t ∈ {1,…,N} denote the exporting and the importing sector respectively. The sectoral value added for country 1 is then calculated for each sector as total output minus intermediate input,
(1) $v a 1 σ = x 1 σ - ∑ i = 1 G ∑ s = 1 N z i 1 s σ = ∑ j = 1 G ∑ t = 1 N z 1 j σ t + ∑ j = 1 G y 1 j σ - ∑ i = 1 G ∑ s = 1 N z i 1 s σ ∀ σ ∈ 1 , … , N$.
Sectoral exports of country 1 equal total sectoral output minus sectoral output consumed on the domestic intermediate and final market,
(2) ,
while sectoral imports equal total intermediate inputs plus final demand produced by the sector minus intermediate and final consumption originating from domestic sectoral production,
(3) .
The sum across sectors of (1), (2) and (3) yields, respectively, the GDP, total export values and total import values of country 1.
We apply sectoral supply shocks to rows and demand shocks to columns. Shocks are calibrated based on internal and external analyses of the repercussions of countries’ containment measures.[3] In Table A, the matrices affected by a single-country production shock are represented by a red solid line, an intermediate demand shock by a green dashed line and a final demand shock by a blue dotted line. Depending on the scenario, a shock ( $s )$ can be single-country or multi-country and model production disruptions or final demand shocks. The ICIOT (Z* Y*) including the production shock is obtained by multiplying the rows of the affected matrices by the Nx1 shock vector s ( $Z i j * = Z i j ⊗ s 1 '$, where ⊗ is the Hadamard product) and the ICIOT including the demand shock by multiplying the columns of the affected matrices by the transposed shock vector ( $Z i j * = Z i j ⊗ 1 s '$). The impact of each shock on euro area activity and foreign trade is the difference between the values obtained from the pre-shock ICIOT and the post-shock ICIOT.[4] In a second stage, indirect shocks are applied to model the supply chain adjustment to the shock in the first stage. Their calibration is a function of the initial shock, the WIOT structure and the assumption on the elasticity of output with respect to intermediates, which is discussed below. The economic mechanism is explained in Section 3.
There is, however, a caveat to this approach, which concerns the treatment of shock vector intersections. Take, for instance, a single-country shock to economy c affecting all sectors differently. The linkage , i.e. the intermediate inputs of country c sector 1 to country c sector 2, could be reduced either by the production shock in sector 1 or by the intermediate demand shock of sector 2. In these situations, we assume that equilibrium is determined by supply, which means that the production shocks are the initial triggers and do not account for further fallout on the activity of sector 1 due to lower intermediate demand from sector 2.[5]
An important simplifying assumption made in our approach is that a production shock in one country-sector pair triggers an equivalent intermediate demand shock and vice versa. Our strict proportionality assumption is akin to assuming that the base reproduction number (r0) is equal to unity and constant over time, hence each additional shock will always have a similar effect on the economy.[6] This is nevertheless a simplification since, in this rapidly changing reality, the dynamics of propagation of a shock through foreign trade are similar to those of the spread of a virus and the contagion rate in the economic “epidemic” process rises rapidly in the early stages when few sectors and economies are infected. In the very short run, key components and crucial services that suddenly cannot be delivered anymore can paralyse entire production chains, but contagion progressively flattens and abates as more and more economies are hit.
In our framework, as long as the relative magnitude of sectoral innovations is preserved, the final effects of a given shock are proportional to the original shock. Because of the linearity of our model, shock effects on macroeconomic variables can be scaled up or down if the sectoral distribution (in a single-country shock) or inter-country relative distribution (in a multi-country shock) remains the same. In this way, our assessments can be adapted to analyse the effects of milder or more severe trajectories that the pandemic might take. Sectoral shocks are reported as percentages of the largest shock. Thus, the industry experiencing the sharpest contraction in production takes the value of 100 and shocks in other sectors are indexed to it. We calibrate the shocks based on sectoral information available on the effects of suppression measures and on analyses from internal experts as well as external sources. For example, the shock to weighted aggregate activity in each country is set equal to the GDP contraction projected in the June 2020 Broad Macroeconomic Projection Exercise (BMPE).
The analyses rest on some key assumptions and have certain limitations, such as:
• they strip out the price effects of implemented policies;
• they provide no information on the implications of and interaction with significant monetary policy measures, although the effects of implemented fiscal and monetary policies indirectly influence the exercises to the extent that they modify the forecasts of aggregate output developments in 2020;
• moreover, since they are static, the assessments ignore potential permanent changes in the structure of economies that may ensue from reshoring or the diversification of essential production processes and changes in lifestyle, time allocation across activities, consumption preferences and daily needs.
Possible trade diversion effects are ignored as their appearance may be delayed and our analysis focuses on 2020. The assumption of non-substitutability of supply and demand (lower exports by a country will not be replaced by other countries’ exports) across origins and destinations is strong,[7] drawing on the idea that, as with viruses, immunisation from shocks disrupting global value chains (GVCs) requires time. It may entail, for instance, starting new lines of production or diverting demand to other suppliers, which may prove to be imperfect substitutes as a result of limited supply capacity or other factors.
## 3 Transmission channels
There are several contributions in the literature on GVCs showing that production networks propagate idiosyncratic shocks and can be a source of aggregate fluctuations.[8] In this section, we discuss the various channels that are at play when this occurs and how shocks originate in country-sectors and spill over to the rest of the world, amplified by foreign trade.
Domestic production shocks applied to the ICIOT are transmitted to upstream and downstream trading partners and further up and down the chain to partners of trading partners via export and import channels. Intuitively, by halting domestic production, lockdown measures are conducive to shortages of intermediate goods produced domestically that enter foreign production processes via trading partners (known as the export channel). These shortages generate negative supply shocks for companies located downstream in the chain. At the same time, they reduce the demand for foreign intermediates entering domestic production processes (known as the import channel). The closure of businesses also results in a negative demand shock for companies located upstream in the production process relative to the original locked-down businesses. To the extent that intermediates cannot be substituted, the entire foreign production line is hampered and, consequently, purchases of intermediates from any other country are reduced proportionately. The operation of the export channel propagates initial supply shocks further down the chain. Likewise, lower import demand for foreign intermediates has a negative effect not only on their production in partner economies, but also in other countries that supply inputs for the same processes. The import channel hence has an indirect impact on all companies upstream. Besides intermediate-production linkages, lockdown measures also reduce exports of final products, hence constraining consumption possibilities and potentially generating unintended and temporary extra savings.
Final demand shocks in the ICIOT are only transmitted up the value chain and therefore have a more limited direct impact on foreign countries. Negative demand shocks have a direct negative impact on imports, leading to a reduction in the production in other countries, unless firms replace them with exports to other destinations; this in turn leads to a decrease in their demand for intermediates. This process could be reiterated several times up the value chain. We, however, only model the first two steps, the reduction in imports and foreign production and the foreign intermediates demand shock. This is to account for the time lag that production adjustment needs, but also because the magnitude of indirect effects shrinks with each iteration.
To illustrate the transmission mechanism, let us consider shop closures and, more specifically, look at the case of a bar forced to lock down. Intuitively, if hypothetically the output of food and entertainment services goes down by 10% and these services account for 10% of GDP; such measures will have a direct negative effect on GDP of 1%. However, the bar will reduce its purchases of beer, which will have an impact on the revenues of beer producers which is equal to their share of the total costs of bars. If we assume this to be 20%, then an additional contraction of 0.2% in GDP will ensue. Looking further upstream in the beer production process, when beer sales wane, producers order and purchase fewer hops by an amount proportional to the share of hops in total costs. If this ingredient accounts for 25% of beer production costs, a further 0.05% is shaved off the GDP. The overall effect on the country GDP will be equal to -1.25% if the production chain is entirely domestic, while the negative impact is shared internationally if foreign companies are part of the supply chain. Our analysis of spillover effects stops at hops although it encompasses all the economic ties that the bar and the beer producers maintain with other sectors and economies.
## 4 Euro area-wide repercussions of containment measures in the five largest economies
COVID-19 migrated from China across the euro area before spreading to the rest of the western hemisphere, hence containment measures outside of China were first enforced in Europe.[9] Using the transmission channels explained above, we assess spillovers from the lockdowns, temporary closures, restrictions on movement and other containment measures adopted by the five largest euro area economies (Germany, France, Italy, Spain and the Netherlands) since early March 2020.
The sectoral distribution of production shocks reflects the expected differential impact of containment measures across industries. The distribution by major NACE[10] category is presented in Table 1. As expected, trade, transport, accommodation and food services are among the hardest hit in all countries, while for other sectors, particularly manufacturing, there are significant differences. The initial aggregate GDP shocks to the five largest euro area economies in 2020 correspond to the projections for euro area economies in the June 2020 BMPE.[11] However, as mentioned above, the overall magnitude of the shock does not matter for the computation of shock transmission in this framework, since the results can be scaled up.
There is very substantial transmission of domestic shocks in the five largest euro area economies to aggregate activity in the rest of the area. Aggregate results are reported in Chart 1. Based on the current structure of euro area countries and their interdependencies, our assumptions and the sectoral calibration above, the impact of a shock similar to the COVID-19 suppression measures applied to the five largest euro area economies would be amplified by 15-28%. This happens in two steps. First, in this scenario, a GDP loss of €100 in Germany causes a loss of €13.50 in the rest of the euro area through supply linkages (see blue bars in Chart 1). Lost output results in a reduction in income if the original shock is not countered through policy measures. The income shock then triggers an identical demand shock that is distributed homogeneously across expenditure components, domestic and foreign production, leading to a contraction in euro area GDP of a further €8.60 (see yellow bars in Chart 1). The main finding of this exercise is that the degree of interconnectedness influences the amplification of the initial shocks.
Euro area foreign trade contracts by more than aggregate activity and lockdown measures lead to GVC retrenchments. The box entitled “The fall in manufacturing and services activity in the euro area: foreign versus domestic shocks” in the April edition of the Economic Bulletin discusses the euro area regional production network, focusing on how it has changed since the global financial crisis (GFC).
COVID-19-induced shocks have caused a deterioration in the net trade positions of euro area Member States. Net trade has contracted in all of the five largest euro area economies, substantially contributing to the transmission of the initial domestic shock to GDP. We find that the deterioration is greatest for the most open countries, those running large trade surpluses and for economies (the Netherlands and Germany) that are most intertwined with those experiencing the shocks. Based on monthly trade data for April and May, partial indications on changes to the euro area trade balance in the second quarter of 2020 support our conclusion of a deterioration in the euro area’s external position.
## Box 2 The euro area regional production network
The euro area is a unique example of a regional production network. GVC linkages in the region reflect an intricate supply web with more than one hub, comprising production, shipping and financial centres. Intermediates travelling across several borders in such networks form the majority of euro area trade, while disruptions are transmitted across the region either because inputs from another euro area country become unavailable (forward linkages) or because as firms in the rest of the euro area reduce their output, foreign demand for domestic intermediates wanes (backward linkages). In this context, demand and supply shocks blend and reinforce each other as they propagate among member states.
The European production network remains the engine behind aggregate activity in the euro area. In 2018, three-quarters of the intermediates exported by euro area countries within the European Union were destined for further processing and re-exporting; two-thirds reached another euro area member. The share of GVC trade in intermediates exported at intermediate stages of production (of total intra-euro area trade) is three times as large as that with China (33% versus 11%, see blue bars in Chart A) and four times as great as that with the United States (8%). Indeed, the bulk of GVC trade with other regions occurs at the final stages of production, i.e. it concerns intermediates directly embedded in finished goods (see yellow bars in Chart A).
Supply chains in the euro area continued to develop amid a decline in GVCs’ share of total global exports since before the GFC. While the global trade slowdown did not spare euro area trade, the euro area actually strengthened its position as a leader in GVCs relative to other regions after the GFC. More than half of total exports consist of production that is processed across several borders, a share far greater than in China or the United States (both around 30%).
Since the GFC, the euro area has reorganised its internal production network, further deepening its regional core and expanding its influence on the rest of the EU.[13] Chart B breaks down the change in GVC exports that occurred between 2008 and 2018 within the euro area and with its main foreign trading partners (the United States, China and non-euro area economies in the EU), highlighting shallow GVC exports (green and yellow bars) and deep GVC exports (blue bars). From a euro area perspective, the global shortening of value chains was counterbalanced by further integration within the regional network in the euro area and with the rest of the EU (6 percentage points and almost 5 percentage points respectively, see red dots in Chart B). Such progress is in contrast to the decline with China and the significant slowdown with the United States. Moreover, the core of euro area supply chains deepened further (blue bars in Chart B) whereas GVC trade with other regions mainly concerned shallow linkages (green or yellow).
Integration within the euro area is clustered around a few economies (Germany and the Netherlands in particular). Based on the bilateral flows in intermediates crossing at least two borders, the five largest euro area economies are primarily integrated with the Netherlands, which acts as the euro area delivery and arrival point for exports and imports from the rest of the world. Germany is the manufacturing hub but Italy also appears to have a more central position compared with France and Spain. Other members of the European Union share a dense matrix of bilateral GVC trade with the euro area, especially with Germany, Austria and Italy.
Eastern enlargement of the euro area and improvements in stressed countries explain the success of its regional supply chains after the GFC. Our analysis indicates that, despite less favourable global conditions, rising protectionist measures and a globalisation reset in other regions, supply networks in the euro area were boosted by the greater integration of new members (Lithuania, Slovakia and Estonia) with the core.[14] These countries not only strengthened their position in the regional network as both an origin and destination for parts and components, but some of them attracted a growing share of production from other regions (the United States and China) that they embedded in their processes.[15] A significant contribution also comes from countries like Spain, Portugal and Greece that improved their participation in regional GVCs relative to their pre-GFC values.[16]
Since 2008, imports of intermediates from the rest of the world that are further processed in the euro area have expanded substantially as other emerging economies have gained traction in terms of participation in GVCs.[17] While too early to draw a conclusion, the role of the heterogeneous group of countries composing the “Rest of the World”, which encompasses commodities exporters as well as Vietnam, Turkey and the Philippines, is growing steadily in terms of GVC participation. A benign interpretation of this evidence from a global perspective is that GVCs may not be falling apart but rather changing to accommodate a diversified set of players, leading to a less concentrated global production network.
## 5 Conclusion
This article analyses how domestic adverse shocks generated by containment measures are transmitted and magnified within the euro area. International country-sector interconnectedness and openness determine the strength of the propagation of shocks via foreign trade, but our analysis has shown that the amplification effects and the transmission channels vary depending on the type of shock.
Shocks propagate strongly in the euro area because the region is a typical example of a regional production network in which final demand linkages are also very important. Transmission to the rest of the euro area of a shock originating in one of the five largest Member States ranges from 15% to 28% when supply and demand channels are taken into account. A common or coordinated response through targeted fiscal measures can help forestall such amplification effects. In addition, these effects need to be taken into account when assessing the impact on real GDP and inflation and when deciding on the appropriate monetary policy response.
The complex chain structure of the production model can be improved. International cooperation could be strengthened with a view to avoiding shortages of essential products, such as medicines or medical appliances, by reducing the excessive concentration of the production of key components in single factories and allowing for greater geographical diversification. While economies of scale will continue to work in favour of the concentration of production, the balance of costs and benefits goes beyond the purely short-term outlook and economic convenience. As highlighted by COVID-19, non-economic considerations regarding critical situations are also factors to be taken into account.
At the same time, production networks can represent a safety net for participating companies in times of crisis. During a crisis, the weakest links in the network may be rescued, merged or acquired and the financial holdings of large groups can provide liquidity to avoid credit crunches. Financing difficulties can also be eased by temporarily relying on more favourable payment conditions from suppliers in the network. Lastly, in cases of production curtailments, firms inside the network will receive preferential treatment over those outside it and will be the last to experience shortages of intermediate supplies. However, the safety net mainly helps overcome temporary setbacks but will not protect companies under strain in the medium term; it therefore remains the duty of governments to avoid long-term scarring effects from the pandemic.
The analysis presented abstracts from new trends in the way people and economies will interact in the future. COVID-19 accelerated transformations that were already underway. Remote working, teleconferencing, fewer meetings held in public or at the workplace, a reduction in the use of public transport, more controlled tourism and a reduction in movement and travel – all are likely to remain prominent for a considerable time. At the same time, significant changes are occurring in our lifestyles and how we spend our work and leisure time. This is likely to have lasting implications for how economies and their production systems are structured.
1. The literature on the macroeconomic effects of COVID-19 has been rapidly expanding, touching also upon the effects of lockdowns and containment measures on GDP and trade of partner economies. See Barrot, J.-N., Grassi, B. and Sauvagnat, J., “Sectoral Effects of Social Distancing”, HEC Paris Research Paper No FIN-2020-1371, 2 April 2020, Navaretti, G.B., Calzolari, G., Dossena, A., Lanza, A. and Pozzolo, A.F., “In and out of lockdowns: Identifying the centrality of economic activities”, Covid Economics, Vetted and Real-Time Papers, No 17, Centre for Economic Policy Research, 13 May 2020, Bonadio, B., Huo, Z., Levchenko, A.A. and Pandalai-Nayar, N., “Global Supply Chains in the Pandemic”, Working Paper, No 27224, National Bureau of Economic Research, Cambridge, Massachusetts, May 2020, Bodenstein, M., Corsetti, G. and Guerrieri, L., “Social Distancing and Supply Disruptions in a Pandemic”, Finance and Economics Discussion Series 2020-031, Board of Governors of the Federal Reserve System, Washington, 16 April 2020, and Baqaee, D. and Farhi, E., “Nonlinear Production Networks with an Application to the Covid-19 Crisis”, Working Paper, No 27281, National Bureau of Economic Research, Cambridge, Massachusetts, May 2020.
2. The conclusions of our empirical assessments have been cross-checked using the world input-output tables (WIOT) in the World Input-Output Database (WIOD), an alternative source of inter-country sector linkages that includes 45 countries and spans 56 sectors, but contains outdated information (the latest data are from 2014). The WIOD is a project covering the years 2000-2014 financed by the European Commission and developed by a consortium of universities and research institutes. The MRIO database expands on the WIOD along two main dimensions – it extends the tables to include more recent data (the latest are from 2018) and several additional Asian economies. However, it features a more limited number of sectors (35 versus 56 in the WIOD) as service activities are less finely defined. The MRIO database has been extensively used in the literature.
3. These assessments consider the effects of fiscal and monetary measures on sectors’ activity and countries’ GDP. Therefore, while we do not explicitly evaluate the effects of policy measures, we indirectly take their effects into account in the shock calibration.
4. Pre- and post-shock values of economic statistics were obtained through ICIO, a built-in tool in Stata; see Belotti, F., Borin, A. and Mancini, M., “icio: Economic Analysis with Inter-Country Input-Output Tables in Stata”, Policy Research Working Paper No 9156, World Bank, Washington DC, February 2020.
5. As a result, the production shock is not exactly equal to the value-added shock; according to our computations, such discrepancies are of a two-decimal order of magnitude. Moreover, this concerns sector spillover effects in the domestic market whereas the article focuses on the international transmission of idiosyncratic shocks, which is not affected.
6. In the extreme scenario, when no substitution across inputs, sources or final destinations is possible in the production process, the entire supply network is already disrupted by the first shock; in a situation of this kind, r0 goes to infinite but then falls rapidly to zero for any subsequent shock.
7. This is a reasonable assumption in the short to medium run for some highly specialised services and manufacturing, where alternative suppliers for specific parts and components are difficult to find, especially during global shocks.
8. See Acemoglu, D., Akcigit, U. and Kerr, W., “Networks and the Macroeconomy: An Empirical Exploration”, NBER Macroeconomics Annual 2015, Vol. 30, National Bureau of Economic Research, University of Chicago Press, June 2016, pp. 273-335, Acemoglu, D., Carvalho, V.M., Ozdaglar, A. and Tahbaz-Salehi, A., “The Network Origins of Aggregate Fluctuations”, Econometrica, Vol. 80, No 5, September 2012, pp. 1977-2016 and Gabaix, X., “The Granular Origins of Aggregate Fluctuations”, Econometrica, Vol. 79, No 3, May 2011, pp. 733-772.
9. COVID-19 initially concerned China before migrating to Europe and spreading globally to become a true pandemic. This article studies its effects in the euro area, i.e. focusing on the period in which contagion spread mainly across Europe. However, since suppression measures were adopted around the globe, additional analyses have been conducted to quantify their impact on the euro area economy. We find that the euro area would experience a 2% GDP contraction % when the GDP weighted aggregate demand in the rest of the world falls by 9.7%. The direct effects on euro area economies are a result of lower exports of final products to the rest of the world. Output in the euro area adjusts to lower exports and the demand for intermediates by euro area producers, both from within and outside the region, also contracts. Therefore, the proper supply chain transmission mechanism is triggered in a second stage and contributes about a quarter to the propagation of the foreign demand shock within the euro area (0.5 percentage points).
10. . The “Statistical classification of economic activities in the European Community” (derived from the French Nomenclature statistique des activités économiques dans la Communauté européenne).
11. See the box entitled “Alternative scenarios for the impact of the COVID-19 pandemic on economic activity in the euro area”, Economic Bulletin, Issue 3, ECB, 2020.
12. Borin A. and Mancini, M., “Measuring What Matters in Global Value Chains and Value-Added Trade”, World Bank Policy Research Working Paper No 8804, World Development Report 2020, 4 April 2019.
13. The rest of the EU is composed of Bulgaria, Czech Republic, Denmark, Croatia, Hungary, Poland, Romania, and Sweden.
14. For Latvia, empirical evidence is less strong; the country’s importance as a producer of intermediates has grown but it has not attracted more GVC exports into its borders.
15. Euro area integration with the United States was broadly stable after the GFC. However, the aggregate data conceals Germany’s decline as a destination, which was offset by an increase in the trade of parts and components from the United States to new Member States.
16. Euro area GVC integration with other regions remains shallow. 60% of exports to China and the United States consist of domestic production for direct final absorption; this compares with just 40% of domestic production exported by one Member State directly to another euro area absorbing Member State. Similarly, almost 50% of the intermediates exported to Asia and America are directly delivered to the final destination which deals only with the transformation into final goods and absorbs them domestically. When intermediates originating in the euro area are further traded by Asian and American firms, they are mostly re-exported within the region. See also Li, X., Meng, B. and Wang, Z., “Recent patterns of global production and GVC participation”, Global Value Chain Development Report 2019: Technological Innovation, Supply Chain Trade, and Workers in a Globalized World, World Trade Organization, 13 April 2017, pp. 9-43.
17. The expansion of intra-euro area supply chains did not entail a retrenchment of its trade integration with the rest of the world. Although they were initially set back, exports and imports from the rest of the world progressed at a pace comparable to global activity in the aftermath of the GFC. Trade integration with China has taken a new path as demand for euro area production has grown steadily, making China a top destination for European firms’ output. Indeed, the domestic production content of euro area exports to China expanded after the GFC; intermediates, parts and components delivered elsewhere, however, experienced a decline. A possible interpretation of this evidence is that euro area companies moved gradually to local production, i.e. trade has been replaced with foreign direct investments. Nonetheless, the Chinese production content of euro area imports did not decline but remained stable.
| 2023-02-04T22:19:47 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 5, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.35073426365852356, "perplexity": 3142.077784566697}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2023-06/segments/1674764500154.33/warc/CC-MAIN-20230204205328-20230204235328-00276.warc.gz"}
|
https://par.nsf.gov/biblio/10006132-search-new-phenomena-events-photon-missing-transverse-momentum-pp-collisions-atlas-detector
|
Search for new phenomena in events with a photon and missing transverse momentum in $pp$ collisions at $s=8 TeV$ with the ATLAS detector
| 2022-09-28T05:53:26 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 4, "mathjax_tag": 0, "mathjax_inline_tex": 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.9061890244483948, "perplexity": 380.30516557074117}, "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/1664030335124.77/warc/CC-MAIN-20220928051515-20220928081515-00703.warc.gz"}
|
https://tjyj.stats.gov.cn/CN/Y2016/V33/I12/3
|
• 论文 •
互联网统计研究
1. Zhao Yanyun
• 出版日期:2016-12-15 发布日期:2016-12-23
Study on Internet Statistics
Zhao Yanyun
• Online:2016-12-15 Published:2016-12-23
Abstract: The development of the Internet from IT to DT has become an inevitable trend, this paper studies the statistical thinking of DT era, Internet statistical concepts and Internet Statistical System. The research is on the Internet statistical theory system for the future development of the Internet Statistics, including Interconnection statistics, intercommunication statistics, interaction statistics. It analyses the effects of the International Telecommunication Union, China Internet Information Center Internet statistics system, together with the State Statistics Bureau Enterprise Informationization and e-commerce statistics, and points out the huge gap between the existing problems and the actual needs. It also studies the challenges of the Internet Statistics development and gives the policy of China's Internet statistics development.
| 2022-08-18T13:23: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.17807786166667938, "perplexity": 4836.156945791806}, "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/1659882573197.34/warc/CC-MAIN-20220818124424-20220818154424-00028.warc.gz"}
|
https://math.wikia.org/wiki/Normal_distribution
|
## FANDOM
1,168 Pages
The probability density of the normal distribution is:
$f(x \; | \; \mu, \sigma^2) = \frac{1}{\sqrt{2\pi\sigma^2} } \; e^{ -\frac{(x-\mu)^2}{2\sigma^2} }$
Where:
This page uses content from Wikipedia. The original article was at Normal distribution.The list of authors can be seen in the page history. As with the Math Wiki, the text of Wikipedia is available under the Creative Commons Licence.
Community content is available under CC-BY-SA unless otherwise noted.
| 2019-12-14T23:12: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.588570237159729, "perplexity": 1167.5463408873406}, "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/1575541297626.61/warc/CC-MAIN-20191214230830-20191215014830-00091.warc.gz"}
|
https://pos.sissa.it/402/188/
|
Volume 402 - The 22nd International Workshop on Neutrinos from Accelerators (NuFact2021) - All Sessions
Low emittance muon beam in the 2 to 40 GeV energy range for muon and neutrino experiments
O.R. Blanco Garcia
Full text: pdf
Supplementary files
Published on: March 31, 2022
Abstract
I present a scheme to obtain a 2 to 40 GeV low emittance muon beam, not requiring cooling and within today’s
technological resources, to be used for early commissioning of muon accelerator projects, or alternatively
dedicated muon and neutrino parameter measurements.
In particular, a muon rate of 5 × 10^4 𝜇/s in a normalized transverse emittance of 5 𝜋 𝜇m at 22 GeV, and
energy spread of 1 GeV obtained from 𝑂 (10^11 ) e+ /s on target at 44 GeV. This emittance is below the expected
results of advanced emittance cooling techniques for muons produced from protons-on-target, and represents
an alternative for the duration of complete muon cooling studies.
The scheme has beam designed to adjust the muon beam energy in the GeV energy range to the needs for
precise parameter measurements of muons and neutrinos.
Furthermore, the muon rate could be in principle increased proportionally to the availability of higher positron
rates, already foreseen for future collider projects.
DOI: https://doi.org/10.22323/1.402.0188
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-05-21T15:59: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.8290503621101379, "perplexity": 6240.6895203796175}, "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-21/segments/1652662539131.21/warc/CC-MAIN-20220521143241-20220521173241-00238.warc.gz"}
|
https://pure.royalholloway.ac.uk/portal/en/publications/proof-complexity-lower-bounds-from-algebraic-circuit-complexity(c3b6f372-4104-43e5-847c-b777cecf7c95).html
|
Proof complexity lower bounds from algebraic circuit complexity. / Forbes, Michael; Shpilka, Amir; Tzameret, Iddo; Wigderson, Avi.
31st Conference on Computational Complexity (CCC 2016). Vol. 50 Dagstuhl, Germany : Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2016. p. 1-17 (Leibniz International Proceedings in Informatics (LIPIcs); Vol. 50).
Research output: Chapter in Book/Report/Conference proceedingConference contribution
Published
### Abstract
We give upper and lower bounds on the power of subsystems of the Ideal Proof System (IPS), the algebraic proof system recently proposed by Grochow and Pitassi~\cite{GrochowPitassi14}, where the circuits comprising the proof come from various restricted algebraic circuit classes. This mimics an established research direction in the boolean setting for subsystems of Frege proofs whose lines are circuits from restricted boolean circuit classes. Essentially all of the subsystems considered in this paper can simulate the well-studied Nullstellensatz proof system, and prior to this work there were no known lower bounds when measuring proof size by the algebraic complexity of the polynomials (except with respect to degree, or to sparsity).
Our main contributions are two general methods of converting certain algebraic lower bounds into proof complexity ones. Both require stronger arithmetic lower bounds than common, which should hold not for a specific polynomial but for a whole family defined by it.
These may be likened to some of the methods by which Boolean circuit lower bounds are turned into related proof-complexity ones, especially the feasible interpolation'' technique. We establish algebraic lower bounds of these forms for several explicit polynomials, against a variety of classes, and infer the relevant proof complexity bounds. These yield separations between IPS subsystems, which we complement by simulations to create a partial structure theory for IPS systems.
Our first method is a \emph{functional lower bound}, a notion of Grigoriev and Razborov~\cite{GrigorievRazborov00}, which is a function $\hat{f}:\bits^n\to\F$ such that any polynomial $f$ agreeing with $\hat{f}$ on the boolean cube requires large algebraic circuit complexity. We develop functional lower bounds for a variety of circuit classes (sparse polynomials, depth-3 powering formulas, roABPs and multilinear formulas) where $\hat{f}(\vx)$ equals $\nicefrac{1}{p(\vx)}$ for a constant-degree polynomial $p$ depending on the relevant circuit class. We believe these lower bounds are of independent interest in algebraic complexity, and show that they also imply lower bounds for the size of the corresponding IPS refutations for proving that the relevant polynomial $p$ is non-zero over the boolean cube. In particular, we show super-polynomial lower bounds for refuting variants of the subset-sum axioms in these IPS subsystems.
Our second method is to give \emph{lower bounds for multiples}, that is, to give explicit polynomials whose all (non-zero) multiples require large algebraic circuit complexity. By extending known techniques, we give lower bounds for multiples for various restricted circuit classes such sparse polynomials, sums of powers of low-degree polynomials, and roABPs. These results are of independent interest, as we argue that lower bounds for multiples is the correct notion for instantiating the algebraic hardness versus randomness paradigm of Kabanets and Impagliazzo~\cite{KabanetsImpagliazzo04}. Further, we show how such lower bounds for multiples extend to lower bounds for refutations in the corresponding IPS subsystem.
Original language English 31st Conference on Computational Complexity (CCC 2016) Dagstuhl, Germany Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik 1-17 17 50 978-3-95977-008-8 https://doi.org/10.4230/LIPIcs.CCC.2016.32 Published - 19 May 2016 Computational Complexity Conference (CCC) - Japan, Koyto, JapanDuration: 29 May 2016 → 1 Jun 2016
### Publication series
Name Leibniz International Proceedings in Informatics (LIPIcs) Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik 50 1868-8969
### Conference
Conference Computational Complexity Conference (CCC) Japan Koyto 29/05/16 → 1/06/16
This open access research output is licenced under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.
ID: 26185869
| 2021-12-08T16:55: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.7661342024803162, "perplexity": 2081.265982259973}, "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/1637964363515.28/warc/CC-MAIN-20211208144647-20211208174647-00052.warc.gz"}
|
https://par.nsf.gov/biblio/10318276-erratum-search-squarks-gluinos-final-states-one-isolated-lepton-jets-missing-transverse-momentum-sqrt-tev-atlas-detector
|
Erratum to: Search for squarks and gluinos in final states with one isolated lepton, jets, and missing transverse momentum at $$\sqrt{s}=13$$ TeV with the ATLAS detector
| 2022-08-15T10: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": 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.7757922410964966, "perplexity": 6228.621284708651}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.3, "absolute_threshold": 20, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2022-33/segments/1659882572163.61/warc/CC-MAIN-20220815085006-20220815115006-00279.warc.gz"}
|
https://pdglive.lbl.gov/DataBlock.action?node=M142W3&home=MXXX005
|
# ${{\boldsymbol f}_{{2}}{(1910)}}$ ${{\boldsymbol \eta}}{{\boldsymbol \eta}^{\,'}}$ MODE INSPIRE search
VALUE (MeV) DOCUMENT ID TECN COMMENT
$141$ $\pm41$ 1
2000 A
450 ${{\mathit p}}$ ${{\mathit p}}$ $\rightarrow$ ${{\mathit p}_{{f}}}{{\mathit \eta}}{{\mathit \eta}^{\,'}}{{\mathit p}_{{s}}}$
• • • We do not use the following data for averages, fits, limits, etc. • • •
$271$ $\pm25$ 2
2000 J
SPEC
$90$ $\pm35$
1991 B
GAM2 38 ${{\mathit \pi}^{-}}$ ${{\mathit p}}$ $\rightarrow$ ${{\mathit \eta}}{{\mathit \eta}^{\,'}}{{\mathit n}}$
1 Also compatible with $\mathit J{}^{PC}={}^{}1{}^{-+}$.
2 Combined fit with ${{\mathit \eta}}{{\mathit \eta}}$ , ${{\mathit \pi}}{{\mathit \pi}}$ , and ${{\mathit \eta}}{{\mathit \pi}}{{\mathit \pi}}$ .
References:
ANISOVICH 2000J
PL B491 47 I = 0 C = +1 Mesons from 1920 to 2410 MeV
BARBERIS 2000A
PL B471 429 A Study of the ${{\mathit \eta}}{{\mathit \eta}^{\,'}}$ and ${{\mathit \eta}^{\,'}}{{\mathit \eta}^{\,'}}$ Channels Produced in Central ${{\mathit p}}{{\mathit p}}$ Interactions at 450 ${\mathrm {GeV/}}\mathit c$
ALDE 1991B
SJNP 54 455 Further Study of the ${{\mathit X}{(1910)}}$ Meson
| 2021-06-19T04:00: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.9058610200881958, "perplexity": 4777.141837230545}, "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-25/segments/1623487643380.40/warc/CC-MAIN-20210619020602-20210619050602-00351.warc.gz"}
|
https://www.khanacademy.org/computing/computer-programming/programming-natural-simulations/programming-vectors/a/intro-to-vectors
|
Advanced JS: Natural Simulations
# Vectors
This course is all about looking at the world around us and coming up with clever ways to simulate that world with code. We will start by looking at basic physics—how an apple falls from a tree, how a pendulum swings in the air, how the earth revolves around the sun, etc. Everything that we'll discuss here requires the use of the most basic building block for programming motion—the vector. And so this is where we begin our story.
Now, the word vector can mean a lot of different things. Vector is the name of a New Wave rock band formed in Sacramento, CA in the early 1980s. It’s the name of a breakfast cereal manufactured by Kellogg’s Canada. In the field of epidemiology, a vector is used to describe an organism that transmits infection from one host to another. In the C++ programming language, a vector (std::vector) is an implementation of a dynamically resizable array data structure. While all these definitions are interesting, they’re not what we’re looking for. What we want is called a Euclidean vector (named for the Greek mathematician Euclid and also known as a geometric vector). When you see the term “vector” in this course, you can assume it refers to a Euclidean vector, defined as an entity that has both magnitude and direction.
A vector is typically drawn as a arrow; the direction is indicated by where the arrow is pointing, and the magnitude by the length of the arrow itself.
Figure 1.1: A vector (drawn as an arrow) has magnitude (length of arrow) and direction (which way it is pointing).
In the above illustration, the vector is drawn as an arrow from point A to point B and serves as an instruction for how to travel from A to B.
### Why use vectors?
Before we dive into more of the details about vectors, let’s look at a basic program that demonstrates why we should care about vectors in the first place. If you went through the introductory JS course here on Khan Academy, you probably, at one point or another, learned how to write a simple bouncing ball program.
In the above example, we have a very simple world—a blank canvas with a circular shape (a “ball”) traveling around. This ball has some properties, which are represented in the code as variables.
Location x and y Velocity xspeed and yspeed
In a more advanced program, we could imagine having many more variables:
Acceleration xacceleration and yacceleration Target location xtarget and ytarget Wind xwind and ywind Friction xfriction and yfriction
It’s becoming clearer that for every concept in this world (wind, location, acceleration, etc.), we’ll need two variables. And this is only a two-dimensional world. In a 3D world, we’ll need x, y, z, xspeed, yspeed, zspeed, and so on.
Wouldn’t it be nice if we could simplify our code and use fewer variables?
var x = 5;
var y = 10;
var xspeed;
var yspeed;
We could simply have two variables, where each variable is a vector-like object with two dimensions of information:
var location;
var speed;
Taking this first step in using vectors won’t allow us to do anything new. Just using vector-like objects for your variables won’t magically make your program simulate physics. However, they will simplify your code and provide a set of functions for common mathematical operations that happen over and over and over again while programming motion.
As an introduction to vectors, we’re going to live in two dimensions. All of these examples can be fairly easily extended to three dimensions (and the object we will use—PVector—allows for three dimensions.) However, it’s easier to start with just two.
### Programming with PVector
One way to think of a vector is the difference between two points. Consider how you might go about providing instructions to walk from one point to another.
Here are some vectors and possible translations: Figure 1.2
(-15, 3) Walk fifteen steps west; turn and walk three steps north. (3, 4) Walk three steps east; turn and walk five steps north. (2, -1) Walk two steps east; turn and walk one step south.
You’ve probably done this before when programming motion. For every frame of animation (i.e. a single cycle through ProcessingJS’s draw() loop), you instruct each object on the screen to move a certain number of pixels horizontally and a certain number of pixels vertically.Figure 1.3
For every frame:
new location = velocity applied to current location
If velocity is a vector (the difference between two points), what is location? Is it a vector too? Technically, one might argue that location is not a vector, since it’s not describing how to move from one point to another—it’s simply describing a singular point in space.
Nevertheless, another way to describe a location is the path taken from the origin to reach that location. Hence, a location can be the vector representing the difference between location and origin.Figure 1.4
Let’s examine the underlying data for both location and velocity. In the bouncing ball example, we had the following:
Location x and y Velocity xspeed and yspeed
Notice how we are storing the same data for both—two floating point numbers, an x and a y. If we were to write a vector class ourselves, we’d start with something rather basic:
var Vector = function(x, y) {
this.x = x;
this.y = y;
};
At its core, a PVector is just a convenient way to store two values (or three, as we’ll see in 3D examples).
And so this …
var x = 100;
var y = 100;
var xspeed = 1;
var yspeed = 3.3;
becomes …
var location = new PVector(100,100);
var velocity = new PVector(1,3.3);
Now that we have two vector objects (location and velocity), we’re ready to implement the algorithm for motion—location = location + velocity. In Example 1.1, without vectors, we had:
x = x + xspeed;
y = y + yspeed;
In an ideal world, we would be able to rewrite the above as:
location = location + velocity;
However, in JavaScript, the addition operator + is reserved for primitive values (numbers, strings) only. In some programming languages, operators can be "overloaded", but not in JavaScript. Fortunately for us, the PVector object includes methods for common mathematical operations, like add().
Before we continue looking at the PVector object and its add() method, let’s examine vector addition using the notation found in math and physics textbooks.
Vectors are typically written either in boldface type or with an arrow on top. For the purposes of these lessons, to distinguish a vector from a scalar (scalar refers to a single value, such as an integer or a floating point number), we’ll use the arrow notation:
• Vector: \vec{u}
• Scalar: x
Let’s say I have the following two vectors:Figure 1.5
Each vector has two components, an x and a y. To add two vectors together, we simply add both x’s and both y’s. Figure 1.6
In other words:
\vec{w} = \vec{u} + \vec{v}
can be written as:
\text{w}_x = \text{u}_x + \text{v}_x\\ \text{w}_y = \text{u}_y + \text{v}_y
Then, replacing u and v with their values from Figure 1.6, we get:
\text{w}_x = 5 + 3\\ \text{w}_y = 2 + 4
which means that:
\text{w}_x = 8\\ \text{w}_y = 6
Finally, we write that as a vector:
\vec{w} = (8, 6)
Now that we understand how to add two vectors together, we can look at how addition is implemented in the PVector object itself. Let’s write a method called add() that takes another PVector object as its argument, and simply adds the x and y components together.
var Vector = function(x, y) {
this.x = x;
this.y = y;
};
Vector.prototype.add = function(v) {
this.y = this.y + v.y;
this.x = this.x + v.x;
};
Now that we see how add() is written inside of PVector, we can return to our bouncing ball example with its location + velocity algorithm and implement vector addition:
location.add(velocity);
And now we're ready to rewrite the bouncing ball example using the PVector object! Take a look through the code and note the differences from before.
We should note an important aspect of the above transition to programming with vectors. Even though we are using PVector objects to describe two values—the x and y of location and the x and y of velocity—we still often need to refer to the x and y components of each PVector individually. When we go to draw an object in ProcessingJS, there’s no means for us to say:
ellipse(location, 16, 16);
The ellipse() function does not allow for a PVector as an argument. An ellipse can only be drawn with two scalar values, an x-coordinate and a y-coordinate. And so we must dig into the PVector object and pull out the x and y components using object-oriented dot notation instead:
ellipse(location.x, location.y, 16, 16);
The same issue arises when testing if the circle has reached the edge of the window, and we need to access the individual components of both vectors: location and velocity.
if ((location.x > width) || (location.x < 0)) {
velocity.x = velocity.x * -1;
}
Now, you might feel somewhat disappointed. After all, this change to using vectors may initially appear to have made the code more complicated than the original version. While this is a perfectly reasonable and valid critique, it’s important to understand that we haven’t fully realized the power of programming with vectors just yet. Looking at a simple bouncing ball and only implementing vector addition is just the first step. As we move forward into a more complex world of multiple objects and multiple forces (which we’ll introduce soon), the benefits of PVector will become more apparent. Keep going!
This "Natural Simulations" course is a derivative of "The Nature of Code" by Daniel Shiffman, used under a Creative Commons Attribution-NonCommercial 3.0 Unported License.
| 2015-09-03T15:18:22 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 1, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.4703333377838135, "perplexity": 1006.8007558117005}, "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-2015-35/segments/1440645315643.73/warc/CC-MAIN-20150827031515-00076-ip-10-171-96-226.ec2.internal.warc.gz"}
|
https://par.nsf.gov/biblio/10197257
|
Prospects for observing and localizing gravitational-wave transients with Advanced LIGO, Advanced Virgo and KAGRA
Abstract We present our current best estimate of the plausible observing scenarios for the Advanced LIGO, Advanced Virgo and KAGRA gravitational-wave detectors over the next several years, with the intention of providing information to facilitate planning for multi-messenger astronomy with gravitational waves. We estimate the sensitivity of the network to transient gravitational-wave signals for the third (O3), fourth (O4) and fifth observing (O5) runs, including the planned upgrades of the Advanced LIGO and Advanced Virgo detectors. We study the capability of the network to determine the sky location of the source for gravitational-wave signals from the inspiral of binary systems of compact objects, that is binary neutron star, neutron star–black hole, and binary black hole systems. The ability to localize the sources is given as a sky-area probability, luminosity distance, and comoving volume. The median sky localization area (90% credible region) is expected to be a few hundreds of square degrees for all types of binary systems during O3 with the Advanced LIGO and Virgo (HLV) network. The median sky localization area will improve to a few tens of square degrees during O4 with the Advanced LIGO, Virgo, and KAGRA (HLVK) network. During O3, the median localization volume (90% credible more »
Authors:
; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; more »
Award ID(s):
Publication Date:
NSF-PAR ID:
10197257
Journal Name:
Living Reviews in Relativity
Volume:
23
Issue:
1
ISSN:
2367-3613
| 2022-07-03T16:56: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.8029941320419312, "perplexity": 2753.4621445084513}, "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/1656104248623.69/warc/CC-MAIN-20220703164826-20220703194826-00401.warc.gz"}
|
https://heasarc.gsfc.nasa.gov/docs/software/fitsio/CCfits/html/installation.html
|
CCfits 2.6
Installing the Package
# Platforms
CCfits is generally supported on the same platforms as HEASOFT, and on Windows with VC++ 7.0 or later. See the HEASOFT supported platforms page.
# Building
To build and install CCfits from source code on a UNIX-like (e.g. UNIX, Linux, or Cygwin) platform, take the following steps. For building on a Microsoft Windows platform with Visual Developer Studio, see below.
## UNIX-like platforms
1. Configure
The configure script will create the Makefile with the path to the compiler you choose (or GCC by default), and the path to the CFITSIO package. To see all options available with configure, type
> ./configure –help
1.a. Compiler Choice
By default, the GCC compiler and linker will be used. If you want to compile and link with a different compiler and linker, you can set some environment variables before running the configure script. For example, to use Sun's C++ compiler, do the following:
> setenv CXX CC (csh syntax)
or
> export CXX=CC (bash syntax)
You can set the absolute path to the compiler you want to use if necessary.
https://heasarc.gsfc.nasa.gov/docs/software/lheasoft/
1.b. CFITSIO Location
CCfits requires that the CFITSIO package is available on your system. See
http://heasarc.gsfc.nasa.gov/docs/software/fitsio/fitsio.html
for more information. The configure script that you will run takes an option to specify the location of the CFITSIO package.
If the CFITSIO package is installed in a directory consisting of a 'lib' subdirectory containing "libcfitsio.a" or "libcfitsio.so" and an 'include' subdirectory containing "fitsio.h", then you can run the configure script with a single option. For example, if the cfitsio package is installed in this fashion in /usr/local/cfitsio/, then the configure script option will be
–with-cfitsio=/usr/local/cfitsio
If the CFITSIO package is not installed in the above manner, then you need to run the configure script with two options, one to specify the include directory and the other to specify the library directory. For example, if the cfitsio package was built in /home/user/cfitsio/ then the two options will be
–with-cfitsio-include=/home/user/cfitsio –with-cfitsio-libdir=/home/user/cfitsio
For users of HEASoft (instead of stand-alone CFITSIO): You can configure CCfits, after initializing HEASoft, using
–with-cfitsio=$HEADAS 1.c. Build Location You have the option of carrying out the build in a separate directory from the source directory or in the same directory as the source. In either case, you need to run the configure script in the directory where the build will occur. For example, if building in the source directory, with the cfitsio directory in /usr/local/cfitsio/, then the configure command should be issued like this: > ./configure –with-cfitsio=/usr/local/cfitsio If you do the build in a separate directory from the source, you may need to issue the configure command something like this: > ../CCfits/configure –with-cfitsio=/usr/local/cfitsio 1.d. Install Location If you would like to install the CCfits files in a separate location, you can do that during the "make install" command (DESTDIR, described below), or you can specify the location during configure. For example, if you would like the CCfits files installed in /usr/local/CCfits, you would run the configure command like this: > ./configure –prefix=/usr/local/CCfits 2. Build Building the C++ shared library will be done automatically by running make (or gmake if you prefer the GNU make) without arguments like this: > gmake 3. Install To install, type: > make install The default install location will be /usr/local/lib for the library and /usr/local/include for the header files. If you do not have permission to write to these locations, you will need to specify another install location. You can change this with the –prefix option when you configure, or with the DESTDIR variable when installing. The DESTDIR option will create a /usr/local/ path in that specified location. Note that you will also need to update your LD_LIBRARY_PATH: > export LD_LIBRARY_PATH="/usr/local/CCfits/usr/local/lib/:$LD_LIBRARY_PATH"
> make DESTDIR=/usr/local/CCfits install
## Microsoft Windows
These instructions follow similar steps to the building of the CFITSIO library on Windows, described at
a) Microsoft Visual Studio b) The CMake build system available from http://www.cmake.org c) The CFITSIO library available from
http://heasarc.gsfc.nasa.gov/docs/software/fitsio/fitsio.html
1. After unzipping and untarring the CCfits source code tarball, the source code will appear in a new \CCfits subdirectory.
2. Open the Visual Studio Developer Command Prompt window and create a directory named "CCfits.build" parallel to this CCfits source code directory.
mkdir CCfits.build cd CCfits.build
This will be the directory from which CMake generate its files and performs the build.
3. Decide which CMake generator you will want to use. The full list is shown by doing
cmake.exe /?
We've done successful builds using Visual Studio's 'nmake' utility, and so recommend choosing "NMake Makefiles" as the generator option. However if you wish to perform the build inside a Visual Studio IDE, you should choose the appropriate "Visual Studio <version>" generator.
4. Now run cmake.exe to generate the necessary Makefiles. With this command you must specify the path to your CFITSIO library and header files by setting the '-DCMAKE_PREFIX_PATH' option. This path should be set to the root directory of your CFITSIO installation, from which it will look in \lib and \include subdirectories for the library and header files respectively. Your full cmake command may then look like:
CCfits.build>cmake.exe -G"NMake Makefiles" -DCMAKE_PREFIX_PATH=C:\path\to\your\CFITSIO ..\CCfits
If you wish to eventually install CCfits at any place other than the default location ("C:\Program Files"), you should pass an additional flag to the cmake command above:
-DCMAKE_INSTALL_PREFIX=C:\path\to\your\CCfits\installation
5. Build and install CCfits:
CCfits.build> nmake
If all goes well you should now have a CCfits.lib library and cookbook.exe executable in your CCfits.build directory. To test the build you can run cookbook.exe, which should generate 3 output FITS files: atestfil, btestfil, and ctestfil.fit.
Now install CCfits.lib and its header files into the default installation location, or the directory you specified in step 4:
CCfits.build> nmake install
| 2022-12-04T20:56:25 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 1, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.44064000248908997, "perplexity": 9071.215424065595}, "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/1669446710980.82/warc/CC-MAIN-20221204204504-20221204234504-00425.warc.gz"}
|
https://www.usgs.gov/center-news/volcano-watch-scientists-can-now-detect-changes-a-volcanos-shape-space
|
# Volcano Watch — Scientists can now detect changes in a volcano's shape from space
Release Date:
Volcano monitoring utilizes a wide range of methods, including the composition and emission rate of gases, earthquake activity, and ground deformation.
In the past decade, observations from orbiting satellites have also become important because of their ability to detect such important volcanic activity indicators as changes in surface temperature, the presence of ash in the atmosphere, and even rock composition from space. Among the most useful recent advances in space-based volcano surveillance is radar interferometry, also known as InSAR.
Radar is certainly not a new technology. Radar systems have been in use for over 100 years and are well known for their ability to track ships and aircraft (which has obvious military and navigation applications), as well as more recent civilian uses, like monitoring weather patterns. The principles behind radar operation are quite simple. A radar instrument emits an electromagnetic pulse and detects any reflections from, for example, rain clouds or airplanes. The time difference between pulse transmission and reception of reflected energy gives the range to the detected target. Further, the characteristics of the reflected signal can be used to determine certain properties of the target, for example, size or texture - rough, like aa, or smooth, like Pāhoehoe.
InSAR makes use of a pair of radar images of the same area on Earth taken from about the same location in space at different times. By differencing - or "interfering" - the distance information in the two images, changes in the shape of the ground surface can be detected. For example, if a volcano were inflating due to the underground accumulation of magma, the ground above the magma chamber would appear to move closer to the satellite over time as the surface is uplifted. This technology has some obvious advantages over traditional deformation monitoring techniques. A large area (usually more than 3,600 square miles) can be imaged at once, and people don't even have to be in the field when data are being collected by the satellite! This being the case, you might think that we could pack up all our gear and use InSAR to monitor a deforming volcano from an office thousands of miles away.
Unfortunately, InSAR has some substantial drawbacks. Most of the radar satellites currently orbiting the Earth use a wavelength that is unable to penetrate vegetation. As a result, InSAR doesn't work in heavily forested areas like the rainforests of Hawaii. Steep slopes and ice- or snow-covered regions are also difficult to monitor with InSAR. Atmospheric conditions, especially moisture, can produce unreliable results. Finally, satellites generally take repeat images of the same place on Earth only about once each month, so we might miss important deformation events if we relied solely on InSAR. That is why is it important to use InSAR in combination with other proven techniques, like GPS and tilt measurements, thus providing the most data possible to help scientists understand the cause of any volcanic activity.
InSAR has been applied with notable success at numerous volcanoes around the world. For example, the lack of earthquake activity and gas emissions in the Three Sisters region of central Oregon led volcanologists to believe that the area was currently inactive. However, InSAR results show that the ground just west of South Sister volcano has been inflating since 1997, probably due to magma accumulating in the subsurface. Now, South Sister is the site of intense earthquake, deformation, and gas-emission monitoring, and valuable new data regarding volcanic unrest are being collected.
Scientists are also using InSAR to monitor the volcanoes of Hawaii, which present several challenges. The recent inflation of Mauna Loa is readily apparent in InSAR data of the Big Island; however, dense vegetation and highly variable climatic conditions over parts of Kīlauea cause InSAR results from that volcano to be unreliable. For these reasons, the area is an ideal natural laboratory for researching ways to remove such problems. Efforts are currently underway at universities and laboratories around the world, including right here in Hawaii, to compensate for atmospheric conditions and extract signals hidden in vegetated areas. Stay tuned for new results, and, for more information on monitoring volcanoes with InSAR.
### Volcano Activity Update
Eruptive activity at Puu Oo continues. All vents inside Puu Oo crater were incandescent this past week, producing bright glow on clear nights. Some vents sporadically produced spatter.
The PKK flow continues to produce substantial breakouts from atop Pulama pali to the coastal plain. Open lava channels have been intermittently visible on Pulama pali, particularly on the east branch of the PKK flow. Two ocean entries are currently active at East Laeapuki and Kailiili. East Laeapuki and Kailiili entries are about 3.5 km (2 miles) and 7 km (4.5 miles) from the ranger shed. Expect a 2- to 3-hour walk each way and remember to bring lots of water. Stay well back from the sea cliff, regardless of whether there is an active ocean entry or not. Heed the National Park warning signs.
During the week ending March 17, only one earthquake was felt on Hawaii Island. The magnitude-2.9 quake occurred 14 km (9 miles) west of Kailua-Kona at a depth of 12 km (7 miles) at 8:06 a.m. on Monday, March 14. The earthquake was felt at Kailua and Kalaoa.
The accelerated inflation and earthquake swarm beneath Kīlauea summit that started in mid-January has ceased. The accelerated inflation stopped about February 21, and the earthquake swarm stopped a few days afterwards.
Mauna Loa is not erupting. Since July 2004, the rate of inflation and number of deep earthquakes beneath the summit increased until the early part of 2005. Weekly earthquake counts have varied from 5 to over 150 in the last half of 2004 - nearly all the quakes were of the long-period type and 30 km (18 mi) or more deep. Since the beginning of 2005, weekly counts have been less than 10. Most of the recent quakes are of the short-period type and shallower. During the week ending March 17, seven earthquakes were recorded beneath the summit area.
| 2020-08-09T08:34: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.41098761558532715, "perplexity": 2781.0653386144104}, "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-34/segments/1596439738523.63/warc/CC-MAIN-20200809073133-20200809103133-00547.warc.gz"}
|
https://www.anl.gov/article/argonnes-role-in-the-versatile-test-reactor-program-to-provide-platform-for-future-nuclear-reactor
|
# Argonne National Laboratory .st0{fill:none;} .st1{fill:#007934;} .st2{fill:#0082CA;} .st3{fill:#101E8E;} .st4{fill:#FFFFFF;} .st5{fill:#A22A2E;} .st6{fill:#D9272E;} .st7{fill:#82BC00;} Argonne National Laboratory
Press Release | Argonne National Laboratory
# Argonne’s role in the Versatile Test Reactor Program to provide platform for future nuclear reactor technologies
Pivotal technology will enable evaluation of many advanced reactor fuels and designs.
For the first time in several decades, construction of new nuclear reactors is underway in the United States. While this new generation of nuclear reactors is based on well-established water-cooled reactor technology, energy companies have expressed interest in new advanced reactor concepts that could soon become much closer to reality.
As a major player in a new collaboration that brings together U.S. Department of Energy (DOE) national laboratories, General Electric and other commercial organizations and universities, Argonne is working on the development of a conceptual design for an irradiation test reactor called the Versatile Test Reactor (VTR).
Although the VTR will not produce electricity, it will allow nuclear engineers to try out different fuels, coolants and other reactor components as they evaluate new technologies for future generations of advanced nuclear reactors.
What we are developing is an enabling stepping-stone to innovative reactor designs of the future.” — Florent Heidet, Argonne advanced nuclear energy systems group leader.
Within the VTR, scientists will perform irradiation experiments in several different test locations where they can evaluate innovative fuels or other experimental setups, said Robert Hill, Argonne’s advanced reactor program manager.
In those locations, you have a lot of flexibility for what you can put in,” Hill said. You could test not only a different type of fuel but a different environment that would model some other totally different reactor type.”
You can think of building the VTR like an automaker building the platform for a new car,” added Florent Heidet, who leads Argonne’s advanced nuclear energy systems group and is heavily involved in the planning of the VTR. You can change out the steering wheel, or the transmission or the tires and see how those components perform.”
While the VTR will not be completely modular or reconfigurable, because many parts of the reactor will need to remain unmodified, the variety of experimental configurations will provide key information to scientists as they work to develop ideas for possible future commercial nuclear reactors.
The reactor provides the testing environment to try new things, but the reactor is not in and of itself a test,” Hill said.
What we are developing is an enabling stepping-stone to innovative reactor designs of the future,” Heidet added. The VTR itself is founded on well-established technology, but we anticipate that the science it will make possible will underpin a new generation of nuclear reactors.”
The VTR will consist of a sodium-cooled fast reactor, a design that has been around for several decades; the reactor will be the first fast-neutron spectrum testing facility built in 20 years. Within that platform, scientists believe that the VTR can reveal the advantages of different reactor technologies.
Argonne is one of the leading institutions in the world for understanding the design and development of sodium-cooled fast reactors,” Hill said. Our expertise is recognized worldwide and sought by other countries looking to develop their own nuclear energy infrastructure.”
The fundamental purpose of the VTR is scientific discovery integral to a better understanding of how different fuels and reactor materials behave under real-world conditions, Heidet said. Experiments using the VTR could examine how materials change during and after irradiation.
The focus of this reactor is to provide irradiation testing of new fuels and new materials to support future innovations of fuels and materials,” Hill said.
By building the VTR, researchers and engineers will also pave the way for more test reactors that could use a similar model, Heidet said. Anyone who wants to build the same type of reactor will have an easier path. The experience will make it much easier for them,” he explained. On top of the science knowledge, we will be gaining the building and engineering experience.”
The site of the VTR has not been determined, although it will likely reside near or at a DOE national laboratory. According to Heidet, scientists project that the facility could be completed in 2026 — a relatively short time given the amount of work and investment that goes into building a new reactor.
The VTR program is led by Idaho National Laboratory, with Argonne leading the core design and safety analysis. Other national laboratories participating in the VTR program include Los Alamos, Oak Ridge, Pacific Northwest and Savannah River. Funding for the VTR program is provided through DOE’S Office of Nuclear Energy. On February 22, 2019, DOE determined the need for a fast neutron testing capability and estimated its costs between $3.0 to$6.0 billion with an estimated completion date between 2026 and 2030.
General Electric will design the structural components of the reactor. If you think of it like a car, GE is providing the car’s frame and body, and we’re providing everything within the engine bay,” Heidet said. The collaboration between industry and the national labs is essential for the future of nuclear energy in America.”
Argonne National Laboratory seeks solutions to pressing national problems in science and technology. The nation’s first national laboratory, Argonne conducts leading-edge basic and applied scientific research in virtually every scientific discipline. Argonne researchers work closely with researchers from hundreds of companies, universities, and federal, state and municipal agencies to help them solve their specific problems, advance America’s scientific leadership and prepare the nation for a better future. With employees from more than 60 nations, Argonne is managed by UChicago Argonne, LLC for the U.S. Department of Energy’s Office of Science.
The U.S. Department of Energy’s Office of Science is the single largest supporter of basic research in the physical sciences in the United States and is working to address some of the most pressing challenges of our time. For more information, visit https://energy.gov/science.
| 2019-07-22T13:43: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.42678001523017883, "perplexity": 2613.0623438962702}, "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-30/segments/1563195528037.92/warc/CC-MAIN-20190722133851-20190722155851-00479.warc.gz"}
|
https://www.zbmath.org/authors/?q=ai%3Aagol.ian
|
# zbMATH — the first resource for mathematics
## Agol, Ian
Compute Distance To:
Author ID: agol.ian Published as: Agol, Ian; Agol, I. Homepage: http://math.berkeley.edu/~ianagol/ External Links: MGP · ORCID · Wikidata · Google Scholar · MathOverflow · dblp Awards: Clay Research Award (2009) · Breakthrough Prize in Mathematics (2015)
Documents Indexed: 31 Publications since 2000 Biographic References: 2 Publications
all top 5
#### Co-Authors
11 single-authored 3 Thurston, William Paul 2 Culler, Marc 2 Dunfield, Nathan M. 2 Groves, Daniel P. 2 Hass, Joel 2 Krushkal, Vyacheslav S. 2 Manning, Jason Fox 2 Shalen, Peter B. 2 Storm, Peter A. 1 Arroja Neves, André 1 Belolipetsky, Mikhail V. 1 Boyer, Steven 1 Calegari, Danny Matthew Cornelius 1 Farb, Benson 1 Freedman, Michael Hartley 1 Gabai, David 1 Kerckhoff, Steve 1 Lei, Tan 1 Leininger, Christopher J. 1 Li, Tao 1 Lin, Francesco 1 Liu, Yi 1 Long, Darren D. 1 Margalit, Dan 1 Marques, Fernando Codá 1 McMullen, Curtis Tracy 1 Minsky, Yair N. 1 Mosher, Lee 1 Reid, Alan W. 1 Walsh, Genevieve S. 1 Weeks, Jeff 1 Whyte, Kevin 1 Wood, Carol 1 Zhang, Xingru
all top 5
#### Serials
5 Geometry & Topology 3 Journal of the American Mathematical Society 2 Transactions of the American Mathematical Society 2 Journal of Topology 1 Geometriae Dedicata 1 Illinois Journal of Mathematics 1 Journal of the London Mathematical Society. Second Series 1 Pacific Journal of Mathematics 1 Proceedings of the American Mathematical Society 1 Notices of the American Mathematical Society 1 Annales de la Faculté des Sciences de Toulouse. Mathématiques. Série VI 1 Documenta Mathematica 1 Annals of Mathematics. Second Series 1 Algebraic & Geometric Topology 1 Groups, Geometry, and Dynamics 1 Forum of Mathematics, Pi
all top 5
#### Fields
27 Manifolds and cell complexes (57-XX) 7 Group theory and generalizations (20-XX) 4 Functions of a complex variable (30-XX) 4 Differential geometry (53-XX) 3 Number theory (11-XX) 2 Combinatorics (05-XX) 2 Topological groups, Lie groups (22-XX) 2 Dynamical systems and ergodic theory (37-XX) 2 Algebraic topology (55-XX) 2 Computer science (68-XX) 1 History and biography (01-XX) 1 Calculus of variations and optimal control; optimization (49-XX) 1 Geometry (51-XX) 1 Global analysis, analysis on manifolds (58-XX)
#### Citations contained in zbMATH Open
27 Publications have been cited 506 times in 405 Documents Cited by Year
The virtual Haken conjecture (with an appendix by Ian Agol, Daniel Groves and Jason Manning). Zbl 1286.57019
Agol, Ian
2013
Criteria for virtual fibering. Zbl 1148.57023
Agol, Ian
2008
Bounds on exceptional Dehn filling. Zbl 0959.57009
Agol, Ian
2000
Lower bounds on volumes of hyperbolic Haken 3-manifolds. Zbl 1155.58016
Agol, Ian; Storm, Peter A.; Thurston, William P.; Dunfield, Nathan
2007
The Bianchi groups are separable on geometrically finite subgroups. Zbl 1067.20067
Agol, I.; Long, D. D.; Reid, A. W.
2001
Ideal triangulations of pseudo-Anosov mapping tori. Zbl 1335.57026
Agol, Ian
2011
The computational complexity of knot genus and spanning area. Zbl 1098.57003
Agol, Ian; Hass, Joel; Thurston, William
2006
Residual finiteness, QCERF and fillings of hyperbolic groups. Zbl 1229.20037
Agol, Ian; Groves, Daniel; Manning, Jason Fox
2009
Finiteness of arithmetic Kleinian reflection groups. Zbl 1102.30042
Agol, Ian
2006
The minimal volume orientable hyperbolic 2-cusped 3-manifolds. Zbl 1203.57006
Agol, Ian
2010
Pants immersed in hyperbolic 3-manifolds. Zbl 1178.57017
Agol, Ian
2009
Finiteness of arithmetic hyperbolic reflection groups. Zbl 1194.22011
Agol, Ian; Belolipetsky, Mikhail; Storm, Peter; Whyte, Kevin
2008
Singular surfaces, mod 2 homology, and hyperbolic volume, I. Zbl 1195.57037
Agol, Ian; Culler, Marc; Shalen, Peter B.
2010
Presentation length and Simon’s conjecture. Zbl 1237.57002
Agol, Ian; Liu, Yi
2012
Dehn surgery, homology and hyperbolic volume. Zbl 1129.57019
Agol, Ian; Culler, Marc; Shalen, Peter B.
2006
Bounds on exceptional Dehn filling. II. Zbl 1201.57011
Agol, Ian
2010
Virtual properties of 3-manifolds. Zbl 1379.57001
Agol, Ian
2014
3-manifold knot genus is NP-complete. Zbl 1192.68305
Agol, Ian; Hass, Joel; Thurston, William
2002
Min-max theory and the energy of links. Zbl 1335.57009
Agol, Ian; Marques, Fernando C.; Neves, André
2016
Volume change under drilling. Zbl 1031.57014
Agol, Ian
2002
Small 3-manifolds of large genus. Zbl 1039.57008
Agol, Ian
2003
An algorithm to detect laminar 3-manifolds. Zbl 1037.57008
Agol, Ian; Li, Tao
2003
Pseudo-Anosov stretch factors and homology of mapping tori. Zbl 1388.37033
Agol, Ian; Leininger, Christopher J.; Margalit, Dan
2016
An alternate proof of Wise’s malnormal special quotient theorem. Zbl 1380.20047
Agol, Ian; Groves, Daniel; Fox Manning, Jason
2016
Virtually fibered Montesinos links. Zbl 1168.57004
Agol, Ian; Boyer, Steven; Zhang, Xingru
2008
Tutte relations, TQFT, and planarity of cubic graphs. Zbl 1365.05137
Agol, Ian; Krushkal, Vyacheslav
2016
Certifying the Thurston norm via SL$$(2,\mathbb{C})$$-twisted homology. Zbl 1452.57011
Agol, Ian; Dunfield, Nathan M.
2020
Certifying the Thurston norm via SL$$(2,\mathbb{C})$$-twisted homology. Zbl 1452.57011
Agol, Ian; Dunfield, Nathan M.
2020
Min-max theory and the energy of links. Zbl 1335.57009
Agol, Ian; Marques, Fernando C.; Neves, André
2016
Pseudo-Anosov stretch factors and homology of mapping tori. Zbl 1388.37033
Agol, Ian; Leininger, Christopher J.; Margalit, Dan
2016
An alternate proof of Wise’s malnormal special quotient theorem. Zbl 1380.20047
Agol, Ian; Groves, Daniel; Fox Manning, Jason
2016
Tutte relations, TQFT, and planarity of cubic graphs. Zbl 1365.05137
Agol, Ian; Krushkal, Vyacheslav
2016
Virtual properties of 3-manifolds. Zbl 1379.57001
Agol, Ian
2014
The virtual Haken conjecture (with an appendix by Ian Agol, Daniel Groves and Jason Manning). Zbl 1286.57019
Agol, Ian
2013
Presentation length and Simon’s conjecture. Zbl 1237.57002
Agol, Ian; Liu, Yi
2012
Ideal triangulations of pseudo-Anosov mapping tori. Zbl 1335.57026
Agol, Ian
2011
The minimal volume orientable hyperbolic 2-cusped 3-manifolds. Zbl 1203.57006
Agol, Ian
2010
Singular surfaces, mod 2 homology, and hyperbolic volume, I. Zbl 1195.57037
Agol, Ian; Culler, Marc; Shalen, Peter B.
2010
Bounds on exceptional Dehn filling. II. Zbl 1201.57011
Agol, Ian
2010
Residual finiteness, QCERF and fillings of hyperbolic groups. Zbl 1229.20037
Agol, Ian; Groves, Daniel; Manning, Jason Fox
2009
Pants immersed in hyperbolic 3-manifolds. Zbl 1178.57017
Agol, Ian
2009
Criteria for virtual fibering. Zbl 1148.57023
Agol, Ian
2008
Finiteness of arithmetic hyperbolic reflection groups. Zbl 1194.22011
Agol, Ian; Belolipetsky, Mikhail; Storm, Peter; Whyte, Kevin
2008
Virtually fibered Montesinos links. Zbl 1168.57004
Agol, Ian; Boyer, Steven; Zhang, Xingru
2008
Lower bounds on volumes of hyperbolic Haken 3-manifolds. Zbl 1155.58016
Agol, Ian; Storm, Peter A.; Thurston, William P.; Dunfield, Nathan
2007
The computational complexity of knot genus and spanning area. Zbl 1098.57003
Agol, Ian; Hass, Joel; Thurston, William
2006
Finiteness of arithmetic Kleinian reflection groups. Zbl 1102.30042
Agol, Ian
2006
Dehn surgery, homology and hyperbolic volume. Zbl 1129.57019
Agol, Ian; Culler, Marc; Shalen, Peter B.
2006
Small 3-manifolds of large genus. Zbl 1039.57008
Agol, Ian
2003
An algorithm to detect laminar 3-manifolds. Zbl 1037.57008
Agol, Ian; Li, Tao
2003
3-manifold knot genus is NP-complete. Zbl 1192.68305
Agol, Ian; Hass, Joel; Thurston, William
2002
Volume change under drilling. Zbl 1031.57014
Agol, Ian
2002
The Bianchi groups are separable on geometrically finite subgroups. Zbl 1067.20067
Agol, I.; Long, D. D.; Reid, A. W.
2001
Bounds on exceptional Dehn filling. Zbl 0959.57009
Agol, Ian
2000
all top 5
#### Cited by 473 Authors
15 Friedl, Stefan 11 Agol, Ian 10 Reid, Alan W. 10 Shalen, Peter B. 9 Wise, Daniel T. 9 Zalesskii, Pavel 7 Culler, Marc 7 Groves, Daniel P. 7 Lackenby, Marc 7 Liu, Yi 7 Sisto, Alessandro 6 Dunfield, Nathan M. 6 Futer, David 6 Hagen, Mark F. 6 Koberda, Thomas 5 Atkinson, Christopher K. 5 Belolipetsky, Mikhail V. 5 Haglund, Frédéric 5 Leininger, Christopher J. 5 Li, Tao 5 Manning, Jason Fox 5 Rubinstein, J. Hyam 5 Sun, Hongbin 5 Tillmann, Stephan 5 Vidussi, Stefano 4 Baker, Mark D. 4 Bergeron, Nicolas 4 Boileau, Michel Charles 4 Boyer, Steven 4 Burton, Benjamin A. 4 Calegari, Danny Matthew Cornelius 4 Guéritaud, François 4 Huang, Jingyin 4 Ichihara, Kazuhiro 4 Long, Darren D. 4 Ma, Jiming 4 Zhang, Xingru 3 Bridson, Martin R. 3 Deblois, Jason 3 Derbez, Pierre 3 Jaikin-Zapirain, Andrei 3 Kitayama, Takahiro 3 Linowitz, Benjamin 3 Lück, Wolfgang 3 Margalit, Dan 3 Martínez-Pedroza, Eduardo 3 McReynolds, David Ben 3 Minasyan, Ashot 3 Minsky, Yair N. 3 Ni, Yi 3 Qiu, Ruifeng 3 Raimbault, Jean 3 Rieck, Yo’av 3 Sauer, Roman 3 Segerman, Henry 3 Storm, Peter A. 3 Suzuki, Masaaki 3 Taylor, Samuel Joseph 3 Tran, Anh Tuan 3 Wang, Shi Cheng 3 Wilkes, Gareth 3 Wilton, Henry John Rutley 2 Adams, Colin C. 2 Arroja Neves, André 2 Baldwin, John A. 2 Beeker, Benjamin 2 Behrstock, Jason A. 2 Bestvina, Mladen 2 Brock, Jeffrey F. 2 Chagas, Sheila C. 2 Champanerkar, Abhijit 2 Chepoi, Victor D. 2 Cooper, Daryl 2 Dahmani, François 2 De Mesmay, Arnaud 2 Delzant, Thomas 2 Frigerio, Roberto 2 Genevois, Anthony 2 Giambrone, Adam 2 Girão, Darlan 2 Görner, Matthias 2 Grunewald, Fritz J. 2 Guirardel, Vincent 2 Guo, Xiao 2 Guzman, Rosemary K. 2 Hodgson, Craig D. 2 Hoste, Jim 2 Hull, Michael B. 2 Ishikawa, Masaharu 2 Kalfagianni, Efstratia 2 Kang, Ensil 2 Kapovich, Michael 2 Kharlampovich, Olga G. 2 Kielak, Dawid 2 Kim, Sang-Hyun 2 Kin, Eiko 2 Kionke, Steffen 2 Kofman, Ilya 2 Kojima, Sadayoshi 2 Lakeland, Grant S. ...and 373 more Authors
all top 5
#### Cited in 94 Serials
37 Algebraic & Geometric Topology 26 Geometry & Topology 22 Geometriae Dedicata 22 Proceedings of the American Mathematical Society 19 Transactions of the American Mathematical Society 19 Topology and its Applications 15 Journal of Knot Theory and its Ramifications 14 Israel Journal of Mathematics 13 Groups, Geometry, and Dynamics 10 Advances in Mathematics 9 Journal of the American Mathematical Society 8 Journal of Topology 7 Duke Mathematical Journal 7 Journal of Algebra 7 Geometric and Functional Analysis. GAFA 6 Annales de l’Institut Fourier 6 Inventiones Mathematicae 6 Mathematische Annalen 6 Journal of Group Theory 5 Mathematische Zeitschrift 5 International Journal of Algebra and Computation 5 Annales de la Faculté des Sciences de Toulouse. Mathématiques. Série VI 5 Experimental Mathematics 5 Annals of Mathematics. Second Series 4 Mathematical Proceedings of the Cambridge Philosophical Society 4 Discrete & Computational Geometry 4 Bulletin of the American Mathematical Society. New Series 4 Journal of the European Mathematical Society (JEMS) 4 Proceedings of the Steklov Institute of Mathematics 4 Winter Braids Lecture Notes 3 Compositio Mathematica 3 Transformation Groups 3 Journal of Topology and Analysis 2 Communications in Mathematical Physics 2 Jahresbericht der Deutschen Mathematiker-Vereinigung (DMV) 2 Rocky Mountain Journal of Mathematics 2 Commentarii Mathematici Helvetici 2 Indiana University Mathematics Journal 2 Journal of the London Mathematical Society. Second Series 2 Journal of Pure and Applied Algebra 2 Nagoya Mathematical Journal 2 Tohoku Mathematical Journal. Second Series 2 Ergodic Theory and Dynamical Systems 2 International Journal of Mathematics 2 L’Enseignement Mathématique. 2e Série 2 Bulletin des Sciences Mathématiques 2 Boletín de la Sociedad Matemática Mexicana. Third Series 2 Journal of the Institute of Mathematics of Jussieu 2 Science China. Mathematics 1 American Mathematical Monthly 1 Bulletin of the Australian Mathematical Society 1 Computers & Mathematics with Applications 1 ACM Transactions on Mathematical Software 1 Acta Mathematica 1 Illinois Journal of Mathematics 1 Journal of Combinatorial Theory. Series A 1 Journal of Combinatorial Theory. Series B 1 Journal of Computer and System Sciences 1 Journal of Differential Geometry 1 Journal of Functional Analysis 1 Journal of the Mathematical Society of Japan 1 Journal für die Reine und Angewandte Mathematik 1 Mathematische Nachrichten 1 Osaka Journal of Mathematics 1 Pacific Journal of Mathematics 1 Proceedings of the Japan Academy. Series A 1 Chinese Annals of Mathematics. Series B 1 Acta Mathematica Hungarica 1 Algorithmica 1 Computational Geometry 1 The Journal of Geometric Analysis 1 Proceedings of the Royal Society of Edinburgh. Section A. Mathematics 1 New Zealand Journal of Mathematics 1 Calculus of Variations and Partial Differential Equations 1 Selecta Mathematica. New Series 1 Annales Academiae Scientiarum Fennicae. Mathematica 1 Doklady Mathematics 1 Theory of Computing Systems 1 Conformal Geometry and Dynamics 1 Communications in Contemporary Mathematics 1 Journal of High Energy Physics 1 Annales Henri Poincaré 1 Advances in Geometry 1 Comptes Rendus. Mathématique. Académie des Sciences, Paris 1 Bulletin of the Brazilian Mathematical Society. New Series 1 Groups, Complexity, Cryptology 1 Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales. Serie A: Matemáticas. RACSAM 1 Bulletin of Mathematical Sciences 1 Forum of Mathematics, Pi 1 Forum of Mathematics, Sigma 1 Research in the Mathematical Sciences 1 Annals of $$K$$-Theory 1 Transactions of the American Mathematical Society. Series B 1 Journal of Applied and Computational Topology
all top 5
#### Cited in 35 Fields
289 Manifolds and cell complexes (57-XX) 175 Group theory and generalizations (20-XX) 32 Differential geometry (53-XX) 27 Topological groups, Lie groups (22-XX) 25 Functions of a complex variable (30-XX) 21 Number theory (11-XX) 21 Dynamical systems and ergodic theory (37-XX) 18 Computer science (68-XX) 16 Combinatorics (05-XX) 15 Geometry (51-XX) 14 Global analysis, analysis on manifolds (58-XX) 10 Convex and discrete geometry (52-XX) 10 Algebraic topology (55-XX) 7 Associative rings and algebras (16-XX) 7 Several complex variables and analytic spaces (32-XX) 6 $$K$$-theory (19-XX) 4 Order, lattices, ordered algebraic structures (06-XX) 4 Functional analysis (46-XX) 4 Calculus of variations and optimal control; optimization (49-XX) 3 Mathematical logic and foundations (03-XX) 3 Algebraic geometry (14-XX) 2 General and overarching topics; collections (00-XX) 2 History and biography (01-XX) 2 Field theory and polynomials (12-XX) 2 Commutative algebra (13-XX) 2 Category theory; homological algebra (18-XX) 2 Measure and integration (28-XX) 2 General topology (54-XX) 2 Probability theory and stochastic processes (60-XX) 2 Information and communication theory, circuits (94-XX) 1 Abstract harmonic analysis (43-XX) 1 Numerical analysis (65-XX) 1 Quantum theory (81-XX) 1 Relativity and gravitational theory (83-XX) 1 Operations research, mathematical programming (90-XX)
#### Wikidata Timeline
The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.
| 2021-09-26T19:05:17 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 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.38391223549842834, "perplexity": 8130.370211986068}, "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/1631780057913.34/warc/CC-MAIN-20210926175051-20210926205051-00244.warc.gz"}
|
https://par.nsf.gov/biblio/10310518-understanding-polarized-dust-emission-from-ophiuchi-light-grain-alignment-disruption-radiative-torques
|
skip to main content
Understanding Polarized Dust Emission from ρ Ophiuchi A in Light of Grain Alignment and Disruption by Radiative Torques
Abstract The alignment of dust grains with the ambient magnetic field produces polarization of starlight as well as thermal dust emission. Using the archival SOFIA/HAWC+ polarimetric data observed toward the ρ Ophiuchus (Oph) A cloud hosted by a B star at 89 and 154 μ m, we find that the fractional polarization of thermal dust emission first increases with the grain temperature and then decreases once the grain temperature exceeds ≃25–32 K. The latter trend differs from the prediction of the popular RAdiative Torques (RATs) alignment theory, which implies a monotonic increase of the polarization fraction with the grain temperature. We perform numerical modeling of polarized dust emission for the ρ Oph-A cloud and calculate the degree of dust polarization by simultaneously considering the dust grain alignment and rotational disruption by RATs. Our modeling results could successfully reproduce both the rising and declining trends of the observational data. Moreover, we show that the alignment of only silicate grains or a mixture of silicate–carbon grains within a composite structure can reproduce the observational trends, assuming that all dust grains follow a power-law size distribution. Although there are a number of simplifications and limitations to our modeling, our results suggest grains in more »
Authors:
; ; ; ; ; ; ;
Award ID(s):
Publication Date:
NSF-PAR ID:
10310518
Journal Name:
The Astrophysical Journal
Volume:
906
Issue:
2
ISSN:
0004-637X
Sponsoring Org:
National Science Foundation
##### More Like this
1. Abstract Located in the Large Magellanic Cloud and mostly irradiated by the massive star cluster R136, 30 Doradus is an ideal target to test the leading theory of grain alignment and rotational disruption by RAdiative Torques (RATs). Here, we use publicly available polarized thermal dust emission observations of 30 Doradus at 89, 154, and 214 μ m using SOFIA/HAWC+. We analyze the variation of the dust polarization degree ( p ) with the total emission intensity ( I ), the dust temperature ( T d ), and the gas column density ( N H ) constructed from Herschel data. The 30 Doradus complex is divided into two main regions relative to R136, namely North and South. In the North, we find that the polarization degree first decreases and then increases before decreasing again when the dust temperature increases toward the irradiating cluster R136. The first depolarization likely arises from the decrease in grain alignment efficiency toward the dense medium due to the attenuation of the interstellar radiation field and the increase in the gas density. The second trend (the increase of p with T d ) is consistent with the RAT alignment theory. The final trend (the decrease of pmore »
2. ABSTRACT
Polarized dust emission is a key tracer in the study of interstellar medium and of star formation. The observed polarization, however, is a product of magnetic field structure, dust grain properties, and grain alignment efficiency, as well as their variations in the line of sight, making it difficult to interpret polarization unambiguously. The comparison of polarimetry at multiple wavelengths is a possible way of mitigating this problem. We use data from HAWC+ /SOFIA and from SCUBA-2/POL-2 (from the BISTRO survey) to analyse the NGC 2071 molecular cloud at 154, 214, and 850 $\mu$m. The polarization angle changes significantly with wavelength over part of NGC 2071, suggesting a change in magnetic field morphology on the line of sight as each wavelength best traces different dust populations. Other possible explanations are the existence of more than one polarization mechanism in the cloud or scattering from very large grains. The observed change of polarization fraction with wavelength, and the 214-to-154 $\mu$m polarization ratio in particular, are difficult to reproduce with current dust models under the assumption of uniform alignment efficiency. We also show that the standard procedure of using monochromatic intensity as a proxy for column density may produce spurious results at HAWC+wavelengths.more »
3. Abstract We present 870 μ m Atacama Large Millimeter/submillimeter Array polarization observations of thermal dust emission from the iconic, edge-on debris disk β Pic. While the spatially resolved map does not exhibit detectable polarized dust emission, we detect polarization at the ∼3 σ level when averaging the emission across the entire disk. The corresponding polarization fraction is P frac = 0.51% ± 0.19%. The polarization position angle χ is aligned with the minor axis of the disk, as expected from models of dust grains aligned via radiative alignment torques (RAT) with respect to a toroidal magnetic field ( B -RAT) or with respect to the anisotropy in the radiation field ( k -RAT). When averaging the polarized emission across the outer versus inner thirds of the disk, we find that the polarization arises primarily from the SW third. We perform synthetic observations assuming grain alignment via both k -RAT and B -RAT. Both models produce polarization fractions close to our observed value when the emission is averaged across the entire disk. When we average the models in the inner versus outer thirds of the disk, we find that k -RAT is the likely mechanism producing the polarized emission in βmore »
4. (Ed.)
ABSTRACT Polarized dust continuum emission has been observed with Atacama Large Millimeter/submillimeter Array in an increasing number of deeply embedded protostellar systems. It generally shows a sharp transition going from the protostellar envelope to the disc scale, with the polarization fraction typically dropping from ${\sim } 5{{\ \rm per\ cent}}$ to ${\sim } 1{{\ \rm per\ cent}}$ and the inferred magnetic field orientations becoming more aligned with the major axis of the system. We quantitatively investigate these observational trends using a sample of protostars in the Perseus molecular cloud and compare these features with a non-ideal magnetohydrodynamic disc formation simulation. We find that the gas density increases faster than the magnetic field strength in the transition from the envelope to the disc scale, which makes it more difficult to magnetically align the grains on the disc scale. Specifically, to produce the observed ${\sim } 1{{\ \rm per\ cent}}$ polarization at ${\sim } 100\, \mathrm{au}$ scale via grains aligned with the B-field, even relatively small grains of $1\, \mathrm{\mu m}$ in size need to have their magnetic susceptibilities significantly enhanced (by a factor of ∼20) over the standard value, potentially through superparamagnetic inclusions. This requirement is more stringent for larger grains,more »
5. Abstract
Dust-induced polarization in the interstellar medium (ISM) is due to asymmetric grains aligned with an external reference direction, usually the magnetic field. For both the leading alignment theories, the alignment of the grain’s angular momentum with one of its principal axes and the coupling with the magnetic field requires the grain to be paramagnetic. Of the two main components of interstellar dust, silicates are paramagnetic, while carbon dust is diamagnetic. Hence, carbon grains are not expected to align in the ISM. To probe the physics of carbon grain alignment, we have acquired Stratospheric Observatory for Infrared Astronomy/Higch-resolution Airborne Wideband Camera-plus far-infrared photometry and polarimetry of the carbon-rich circumstellar envelope (CSE) of the asymptotic giant branch star IRC+10° 216. The dust in such CSEs are fully carbonaceous and thus provide unique laboratories for probing carbon grain alignment. We find a centrosymmetric, radial, polarization pattern, where the polarization fraction is well correlated with the dust temperature. Together with estimates of a low fractional polarization from optical polarization of background stars, we interpret these results to be due to a second-order, direct radiative external alignment of grains without internal alignment. Our results indicate that (pure) carbon dust does not contribute significantly tomore »
| 2022-11-30T15: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.7683447599411011, "perplexity": 2079.8607206074785}, "config": {"markdown_headings": true, "markdown_code": false, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": false}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2022-49/segments/1669446710764.12/warc/CC-MAIN-20221130124353-20221130154353-00825.warc.gz"}
|
http://jde27.uk/blog/small-res.html
|
# Small resolutions
[2019-05-09 Thu]
Recall that if $$X$$ is a singular variety then a resolution of $$X$$ is a morphism $$\tilde{X}\to X$$ from a smooth variety to $$X$$ which is an isomorphism outside the singular locus. The exceptional locus of a resolution is the preimage (in $$\tilde{X}$$) of the singular locus in $$X$$. A resolution is "small" if the exceptional locus has codimension bigger than 1. The classic example of this (which I discussed years ago in another blog post) is the small resolution of the 3-fold ordinary double point, where the small resolution replaces the singular point with a copy of $$\mathbf{CP}^1$$ (which then has complex codimension 2 in the 3-fold).
I was discussing all of this with my collaborator Mirko Mauri and trying to understand when small resolutions exist in more complicated situations. He told me something which blew my mind. "Small resolutions often occur when you blow up a divisor." Don't be silly, I said, blowing up a divisor doesn't do anything. He pointed out that blowing up a Cartier divisor doesn't do anything, but blowing up a Weil (but non-Cartier) divisor can do something. At this point, I was trying to remember what the difference was and whether all Cartier divisors were Weil or vice versa or neither. By the end of our discussion, I had a much better understanding of what "blowing up a divisor" means from the viewpoint of a symplectic geometer. I try to explain this below.
A Weil divisor $$D$$ is the thing which corresponds to the idea of divisor in my head: a bunch of subschemes with weights attached. This is the thing that gives you a coherent sheaf $$\mathcal{O}(D)$$ whose sections are rational functions having poles of order at most (weight) along $$D$$ (or having zeros of order at least (-weight)).
A Weil divisor is Cartier if this sheaf is the sheaf of sections of a line bundle. If $$X$$ is not too singular (normal) then a Weil divisor is Cartier if it is everywhere locally cut out by a single equation.
Let's look at the example of the 3-fold ordinary double point. This is the affine variety $$X=\{(x,y,z,w)\in\mathbf{C}^4\ :\ xy=zw\}$$, which has an isolated singularity at the origin.
If we look at the divisor $$x=0$$ (which is cut out by one equation, hence Cartier) then we get a reducible subvariety (because $$x=0$$ implies $$zw=0$$, so either $$z=0$$ or $$w=0$$, hence we have two components). Similarly $$y=0$$ has two components. These four components are Weil but not Cartier: you need two equations (like $$x=z=0$$) to cut them out.
There is a nice picture of the 3-fold ODP because it's toric: the three circle actions $$(x,y,z,w)\mapsto (e^{i\theta} x,y,e^{i\theta}z,w)$$, $$(x,y,z,w)\mapsto (e^{-i\theta} x,e^{i\theta}y,z,w)$$, $$(x,y,z,w)\mapsto (e^{i\theta} x,y,z,e^{i\theta}w)$$ commute and preserve the variety. The moment maps for these circle actions are $$\mu_1=\frac{1}{2}(|x|^2+|z|^2)$$, $$\mu_2=\frac{1}{2}(|y|^2-|x|^2)$$ and $$\mu_3=\frac{1}{2}(|x|^2+|w|^2)$$. The image of the variety under $$(\mu_1,\mu_2,\mu_3)\colon X\to\mathbf{R}^3$$ is a cone spanned by the four rays in the positive $$(1,-1,1)$$-, $$(1,0,0)$$-, $$(0,1,0)$$- and $$(0,0,1)$$-directions (these rays are the projections of the curves $$y=z=w=0$$, $$x=y=w=0$$, $$x=z=w=0$$ and $$x=y=z=0$$ respectively).
The four Weil-but-not-Cartier divisors $$x=z=0$$, $$x=w=0$$, $$y=z=0$$, $$y=w=0$$ project to the four faces of this cone. Let's pick one of them, say $$x=w=0$$ (which projects to the horizontal face). What does it mean to "blow-up" this divisor? In symplectic geometry, blowing up a divisor means you cut out a neighbourhood of the divisor, observe that the boundary of the neighbourhood has a characteristic foliation whose leaves are closed circles, and collapse these circles down to points. In the toric picture, the neighbourhood of this divisor is just the set of points with $$\mu_3<\epsilon$$ for some $$\epsilon$$. When you cut it out and collapse the characteristic foliation ("symplectic cut") you get another toric variety whose moment polytope is obtained by discarding everything below $$\mu_3=\epsilon$$. If you look at this polytope, you get exactly the polytope for the small resolution.
Comments, corrections and contributions are very welcome; please drop me an email at j.d.evans at lancaster.ac.uk if you have something to share.
CC-BY-SA 4.0 Jonny Evans.
| 2020-09-24T07:04: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": 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.9044075012207031, "perplexity": 274.6636642479658}, "config": {"markdown_headings": true, "markdown_code": false, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 5, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2020-40/segments/1600400214347.17/warc/CC-MAIN-20200924065412-20200924095412-00130.warc.gz"}
|
https://math.wikia.org/wiki/Centered_polygonal_number
|
## FANDOM
1,168 Pages
The centered polygonal numbers are a class of series of figurate numbers, each formed by a central dot, surrounded by polygonal layers with a constant number of sides. Each side of a polygonal layer contains one dot more than a side in the previous layer, so starting from the second polygonal layer each layer of a centered k-gonal number contains k more points than the previous layer.
These series consist of the
and so on. The following diagrams show a few examples of centered polygonal numbers and their geometric construction. (Compare these diagrams with the diagrams in Polygonal number.)
Centered square numbers
1 5 13 25
Centered hexagonal numbers
1 7 19 37
As can be seen in the above diagrams, the nth centered k-gonal number can be obtained by placing k copies of the (n−1)th triangular number around a central point; therefore, the nth centered k-gonal number can be mathematically represented by
$C_{k,n} =[\frac{k}{2}](n^2-n)+1.$
Just as is the case with regular polygonal numbers, the first centered k-gonal number is 1. Thus, for any k, 1 is both k-gonal and centered k-gonal. The next number to be both k-gonal and centered k-gonal can be found using the formula
$\frac{k^3-k^2}{2}+1$
which tells us that 10 is both triangular and centered triangular, 25 is both square and centered square, etc.
Whereas a prime number p cannot be a polygonal number (except of course that each p is the second p-agonal number), many centered polygonal numbers are primes.
## References
Community content is available under CC-BY-SA unless otherwise noted.
| 2019-12-10T07:07:15 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.7985409498214722, "perplexity": 1006.6335833483988}, "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-00237.warc.gz"}
|
https://par.nsf.gov/biblio/10336756-search-anomalous-excess-charged-current-interactions-without-pions-final-state-microboone-experiment
|
This content will become publicly available on June 1, 2023
Search for an anomalous excess of charged-current $νe$ interactions without pions in the final state with the MicroBooNE experiment
Authors:
; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; more »
Award ID(s):
Publication Date:
NSF-PAR ID:
10336756
Journal Name:
Physical Review D
Volume:
105
Issue:
11
ISSN:
2470-0010
| 2022-08-09T10:45:04 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 34, "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.6049167513847351, "perplexity": 14233.828386563653}, "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/1659882570921.9/warc/CC-MAIN-20220809094531-20220809124531-00684.warc.gz"}
|
https://www.conicet.gov.ar/new_scp/detalle.php?keywords=rold&id=29232&articulos=yes&detalles=yes&art_id=2447977
|
DA ROLD Leandro
artículos
Título:
Vertex displacements for acausal particles: testing the Lee-Wick standard model at the LHC
Autor/es:
EZEQUIEL ÁLVAREZ, LEANDRO DA ROLD, CARLOS SCHAT, ALEJANDRO SZYNKMAN D
Revista:
JOURNAL OF HIGH ENERGY PHYSICS
Editorial:
SPRINGER
Referencias:
Lugar: Trieste; Año: 2009 vol. 10 p. 2301 - 23025
ISSN:
1126-6708
Resumen:
We propose to search for wrong displaced vertices, where decay products of the secondary vertex move towards the primary vertex instead of away from it, as a signature for microscopic violation of causality. We analyze in detail the leptonic sector of the recently proposed Lee-Wick Standard Model, which provides a well motivated framework to study acausal effects. We find that, assuming Minimal Flavor Violation, the Lee-Wick partners of the electron, $\tilde\ell^e$ and $\tilde e$, can produce measurable wrong vertices at the LHC, the most promising channel being $q\bar q \to \tilde \ell^e \bar{\tilde{\ell}^e\to e^+e^-jjjj$. A Monte-Carlo simulation using MadGraph/MadEvent suggests that for $M_{\ell}\lesssim 450$ GeV the measurement of these acausal vertex displacements should be accessible in the LHC era.
| 2022-10-05T04:41:44 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.6937420964241028, "perplexity": 3157.8305215214777}, "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/1664030337537.25/warc/CC-MAIN-20221005042446-20221005072446-00106.warc.gz"}
|
http://popflock.com/learn?s=Balance_of_payments
|
Balance of Payments
Get Balance of Payments essential facts below. View Videos or join the Balance of Payments discussion. Add Balance of Payments to your PopFlock.com topic list for future reference or share this resource on social media.
Balance of Payments
The balance of payments, also known as balance of international payments and abbreviated B.O.P. or BoP, of a country is the record of all economic transactions between the residents of the country and the rest of the world in a particular period of time (e.g., a quarter of a year). These transactions are made by individuals, firms and government bodies. Thus the balance of payments includes all external visible and non-visible transactions of a country. It is an important issue to be studied, especially in international financial management field, for a few reasons.
First, the balance of payment provides detailed information concerning the demand and supply of a country's currency. For example, if Sudan imports more than it exports, then this means that the quantity supplied of Sudanese pounds by the domestic market is likely to exceed the quantity demanded in the foreign exchanging market, ceteris paribus. One can thus infer that the Sudanese pound would be under pressure to depreciate against other currencies. On the other hand, if Sudan exports more than it imports, then the Sudanese pound would be likely to appreciate.
Second, a country's balance of payments data may signal its potential as a business partner for the rest of the world. If a country is grappling with a major balance of payments difficulty, it may not be able to expand imports from the outside world. Instead, the country may be tempted to impose measures to restrict imports and discourage capital outflows in order to improve the balance of payments situation. On the other hand, a country with a significant balance of payments surplus would be more likely to expand imports, offering marketing opportunities for foreign enterprises, and less likely to impose foreign exchange restrictions.
Third, balance of payments data can be used to evaluate the performance of the country in international economic competition. Suppose a country is experiencing trade deficits year after year. This trade data may then signal that the country's domestic industries lack international competitiveness.
To interpret balance of payments data properly, it is necessary to understand how the balance of payments account is constructed.[1][2] These transactions include payments for the country's exports and imports of goods, services, financial capital, and financial transfers. It is prepared in a single currency, typically the domestic currency for the country concerned. The balance of payments accounts keep systematic records of all the economic transactions (visible and non-visible) of a country with all other countries in the given time period. In the BoP accounts, all the receipts from abroad are recorded as credit and all the payments to abroad are debits. Since the accounts are maintained by double entry bookkeeping, they show the balance of payments accounts are always balanced. Sources of funds for a nation, such as exports or the receipts of loans and investments, are recorded as positive or surplus items. Uses of funds, such as for imports or to invest in foreign countries, are recorded as negative or deficit items.
When all components of the BoP accounts are included they must sum to zero with no overall surplus or deficit. For example, if a country is importing more than it exports, its trade balance will be in deficit, but the shortfall will have to be counterbalanced in other ways - such as by funds earned from its foreign investments, by running down currency reserves or by receiving loans from other countries.
While the overall BoP accounts will always balance when all types of payments are included, imbalances are possible on individual elements of the BoP, such as the current account, the capital account excluding the central bank's reserve account, or the sum of the two. Imbalances in the latter sum can result in surplus countries accumulating wealth, while deficit nations become increasingly indebted. The term "balance of payments" often refers to this sum: a country's balance of payments is said to be in surplus (equivalently, the balance of payments is positive) by a specific amount if sources of funds (such as export goods sold and bonds sold) exceed uses of funds (such as paying for imported goods and paying for foreign bonds purchased) by that amount. There is said to be a balance of payments deficit (the balance of payments is said to be negative) if the former are less than the latter. A BoP surplus (or deficit) is accompanied by an accumulation (or decumulation) of foreign exchange reserves by the central bank.
Under a fixed exchange rate system, the central bank accommodates those flows by buying up any net inflow of funds into the country or by providing foreign currency funds to the foreign exchange market to match any international outflow of funds, thus preventing the funds flows from affecting the exchange rate between the country's currency and other currencies. Then the net change per year in the central bank's foreign exchange reserves is sometimes called the balance of payments surplus or deficit. Alternatives to a fixed exchange rate system include a managed float where some changes of exchange rates are allowed, or at the other extreme a purely floating exchange rate (also known as a purely flexible exchange rate). With a pure float the central bank does not intervene at all to protect or devalue its currency, allowing the rate to be set by the market, the central bank's foreign exchange reserves do not change, and the balance of payments is always zero.
## Components
The current account shows the net amount of a country's income if it is in surplus, or spending if it is in deficit. It is the sum of the balance of trade (net earnings on exports minus payments for imports), factor income (earnings on foreign investments minus payments made to foreign investors) and unilateral transfers. These items include transfers of goods and services or financial assets between the home country and the rest of the world. Private transfer payments refer to gifts made by individuals and nongovernmental institutions to foreigners. Governmental transfers refer to gifts or grants made by one government to foreign residents or foreign governments. When investment income and unilateral transfers are combined with the balance on goods and services, we arrive at the current account balance.[3] It is called the current account as it covers transactions in the "here and now" - those that don't give rise to future claims.[4]
The capital account records the net change in ownership of foreign assets. It includes the reserve account (the foreign exchange market operations of a nation's central bank), along with loans and investments between the country and the rest of world (but not the future interest payments and dividends that the loans and investments yield; those are earnings and will be recorded in the current account). If a country purchases more foreign assets for cash than the assets it sells for cash to other countries, the capital account is said to be negative or in deficit.
The term "capital account" is also used in the narrower sense that excludes central bank foreign exchange market operations: Sometimes the reserve account is classified as "below the line" and so not reported as part of the capital account.[5]
Expressed with the broader meaning for the capital account, the BoP identity states that any current account surplus will be balanced by a capital account deficit of equal size - or alternatively a current account deficit will be balanced by a corresponding capital account surplus:
${\displaystyle {\text{current account}}+{\text{ broadly defined capital account}}+{\text{balancing item}}=0.\,}$
The balancing item, which may be positive or negative, is simply an amount that accounts for any statistical errors and assures that the current and capital accounts sum to zero. By the principles of double entry accounting, an entry in the current account gives rise to an entry in the capital account, and in aggregate the two accounts automatically balance. A balance isn't always reflected in reported figures for the current and capital accounts, which might, for example, report a surplus for both accounts, but when this happens it always means something has been missed - most commonly, the operations of the country's central bank - and what has been missed is recorded in the statistical discrepancy term (the balancing item).[5]
An actual balance sheet will typically have numerous sub headings under the principal divisions. For example, entries under Current account might include:
• Trade - buying and selling of goods and services
• Exports - a credit entry
• Imports - a debit entry
• Trade balance - the sum of Exports and Imports
• Factor income - repayments and dividends from loans and investments
• Factor earnings - a credit entry
• Factor payments - a debit entry
• Factor income balance - the sum of earnings and payments.
Especially in older balance sheets, a common division was between visible and invisible entries. Visible trade recorded imports and exports of physical goods (entries for trade in physical goods excluding services is now often called the merchandise balance). Invisible trade would record international buying and selling of services, and sometimes would be grouped with transfer and factor income as invisible earnings.[2]
The term "balance of payments surplus" (or deficit - a deficit is simply a negative surplus) refers to the sum of the surpluses in the current account and the narrowly defined capital account (excluding changes in central bank reserves). Denoting the balance of payments surplus as BoP surplus, the relevant identity is
${\displaystyle BOP\ surplus={\text{current account surplus}}+{\text{narrowly defined capital account surplus}}.\,}$
## Variations in the use of term "balance of payments"
Economics writer J. Orlin Grabbe warns the term balance of payments can be a source of misunderstanding due to divergent expectations about what the term denotes. Grabbe says the term is sometimes misused by people who aren't aware of the accepted meaning, not only in general conversation but in financial publications and the economic literature.[5]
A common source of confusion arises from whether or not the reserve account entry, part of the capital account, is included in the BoP accounts. The reserve account records the activity of the nation's central bank. If it is excluded, the BoP can be in surplus (which implies the central bank is building up foreign exchange reserves) or in deficit (which implies the central bank is running down its reserves or borrowing from abroad).[2][5]
The term "balance of payments" is sometimes misused by non-economists to mean just relatively narrow parts of the BoP such as the trade deficit,[5] which means excluding parts of the current account and the entire capital account.
Another cause of confusion is the different naming conventions in use.[6] Before 1973 there was no standard way to break down the BoP sheet, with the separation into invisible and visible payments sometimes being the principal divisions. The IMF have their own standards for BoP accounting which is equivalent to the standard definition but uses different nomenclature, in particular with respect to the meaning given to the term capital account.
### The IMF definition of the Balance of Payments
The International Monetary Fund (I.M.F.) use a particular set of definitions for the BoP accounts, which is also used by the Organisation for Economic Co-operation and Development (OECD), and the United Nations System of National Accounts (SNA).[7]
The main difference in the IMF's terminology is that it uses the term "financial account" to capture transactions that would under alternative definitions be recorded in the capital account. The IMF uses the term capital account to designate a subset of transactions that, according to other usage, previously formed a small part of the overall current account.[8] The IMF separates these transactions out to form an additional top level division of the BoP accounts. Expressed with the IMF definition, the BoP identity can be written:
${\displaystyle {\text{current account}}\,+\,{\text{financial account}}\,+\,{\text{capital account}}\,+\,{\text{balancing item}}\,=\,0.\,}$
The IMF uses the term current account with the same meaning as that used by other organizations, although it has its own names for its three leading sub-divisions, which are:
• The goods and services account (the overall trade balance)
• The primary income account (factor income such as from loans and investments)
• The secondary income account (transfer payments)
balance of payments are also known as "balance of international trade"
## Imbalances
While the BoP has to balance overall, surpluses or deficits on its individual elements can lead to imbalances between countries. In general there is concern over deficits in the current account.[9] Countries with deficits in their current accounts will build up increasing debt or see increased foreign ownership of their assets. The types of deficits that typically raise concern are[2]
• A visible trade deficit where a nation is importing more physical goods than it exports (even if this is balanced by the other components of the current account.)
• An overall current account deficit.
• A basic deficit which is the current account plus foreign direct investment (but excluding other elements of the capital account like short terms loans and the reserve account.)
As discussed in the history section below, the Washington Consensus period saw a swing of opinion towards the view that there is no need to worry about imbalances. Opinion swung back in the opposite direction in the wake of the financial crisis of 2007-2009. Mainstream opinion expressed by the leading financial press and economists, international bodies like the IMF - as well as leaders of surplus and deficit countries - has returned to the view that large current account imbalances do matter.[10] Some economists do, however, remain relatively unconcerned about imbalances[11] and there have been assertions, such as by Michael P. Dooley, David Folkerts-Landau and Peter Garber, that nations need to avoid the temptation to switch to protectionism as a means to correct imbalances.[12]
Current account surpluses coincide with current account deficits of other countries, the indebtedness of the latter therefore increasing. According to Balances Mechanics by Wolfgang Stützel this is described as surplus of expenses over revenues. Increasing imbalances in foreign trade are critically discussed as a possible cause of the financial crisis since 2007.[13] Many Keynesian economists consider the existing differences between the current accounts in the eurozone to be the root cause of the Euro crisis, for instance Heiner Flassbeck,[14]Paul Krugman[15] or Joseph Stiglitz.[16]
### Causes of BoP imbalances
There are conflicting views as to the primary cause of BoP imbalances, with much attention on the US which currently has by far the biggest deficit. The conventional view is that current account factors are the primary cause[17] - these include the exchange rate, the government's fiscal deficit, business competitiveness, and private behaviour such as the willingness of consumers to go into debt to finance extra consumption.[18] An alternative view, argued at length in a 2005 paper by Ben Bernanke, is that the primary driver is the capital account, where a global savings glut caused by savers in surplus countries, runs ahead of the available investment opportunities, and is pushed into the US resulting in excess consumption and asset price inflation.[19] .
### Reserve asset
The US dollar has been the leading reserve asset since the end of the gold standard.
In the context of BoP and international monetary systems, the reserve asset is the currency or other store of value that is primarily used by nations for their foreign reserves.[20] BoP imbalances tend to manifest as hoards of the reserve asset being amassed by surplus countries, with deficit countries building debts denominated in the reserve asset or at least depleting their supply. Under a gold standard, the reserve asset for all members of the standard is gold. In the Bretton Woods system, either gold or the U.S. dollar could serve as the reserve asset, though its smooth operation depended on countries apart from the US choosing to keep most of their holdings in dollars.
Following the ending of Bretton Woods, there has been no de jure reserve asset, but the US dollar has remained by far the principal de facto reserve. Global reserves rose sharply in the first decade of the 21st century, partly as a result of the 1997 Asian Financial Crisis, where several nations ran out of foreign currency needed for essential imports and thus had to accept deals on unfavourable terms. The International Monetary Fund (IMF) estimates that between 2000 and mid-2009, official reserves rose from $1,900bn to$6,800bn.[21] Global reserves had peaked at about $7,500bn in mid-2008, then declined by about$430bn as countries without their own reserve currency used them to shield themselves from the worst effects of the financial crisis. From Feb 2009 global reserves began increasing again to reach close to $9,200bn by the end of 2010.[22][23] As of 2009, approximately 65% of the world's$6,800bn total is held in U.S. dollars and approximately 25% in euros. The UK pound, Japanese yen, IMF special drawing rights (SDRs), and precious metals[24] also play a role. In 2009, Zhou Xiaochuan, governor of the People's Bank of China, proposed a gradual move towards increased use of SDRs, and also for the national currencies backing SDRs to be expanded to include the currencies of all major economies.[25][26] Dr Zhou's proposal has been described as one of the most significant ideas expressed in 2009.[27]
While the current central role of the dollar does give the US some advantages, such as lower cost of borrowings, it also contributes to the pressure causing the U.S. to run a current account deficit, due to the Triffin dilemma. In a November 2009 article published in Foreign Affairs magazine, economist C. Fred Bergsten argued that Dr Zhou's suggestion or a similar change to the international monetary system would be in the United States' best interests as well as the rest of the world's.[28] Since 2009 there has been a notable increase in the number of new bilateral agreements which enable international trades to be transacted using a currency that isn't a traditional reserve asset, such as the renminbi, as the Settlement currency. [29]
### Balance of payments crisis
A BoP crisis, also called a currency crisis, occurs when a nation is unable to pay for essential imports or service its external debt repayments. Typically, this is accompanied by a rapid decline in the value of the affected nation's currency. Crises are generally preceded by large capital inflows, which are associated at first with rapid economic growth.[30] However a point is reached where overseas investors become concerned about the level of debt their inbound capital is generating, and decide to pull out their funds.[31] The resulting outbound capital flows are associated with a rapid drop in the value of the affected nation's currency. This causes issues for firms of the affected nation who have received the inbound investments and loans, as the revenue of those firms is typically mostly derived domestically but their debts are often denominated in a reserve currency. Once the nation's government has exhausted its foreign reserves trying to support the value of the domestic currency, its policy options are very limited. It can raise its interest rates to try to prevent further declines in the value of its currency, but while this can help those with debts denominated in foreign currencies, it generally further depresses the local economy.[30][32][33]
## Balancing mechanisms
One of the three fundamental functions of an international monetary system is to provide mechanisms to correct imbalances.[34][35]
Broadly speaking, there are three possible methods to correct BoP imbalances, though in practice a mixture including some degree of at least the first two methods tends to be used. These methods are adjustments of exchange rates; adjustment of a nations internal prices along with its levels of demand; and rules based adjustment.[36] Improving productivity and hence competitiveness can also help, as can increasing the desirability of exports through other means, though it is generally assumed a nation is always trying to develop and sell its products to the best of its abilities.
### Rebalancing by changing the exchange rate
An upwards shift in the value of a nation's currency relative to others will make a nation's exports less competitive and make imports cheaper and so will tend to correct a current account surplus. It also tends to make investment flows into the capital account less attractive so will help with a surplus there too. Conversely a downward shift in the value of a nation's currency makes it more expensive for its citizens to buy imports and increases the competitiveness of their exports, thus helping to correct a deficit (though the solution often doesn't have a positive impact immediately due to the Marshall-Lerner condition).[37]
Exchange rates can be adjusted by government[38] in a rules based or managed currency regime, and when left to float freely in the market they also tend to change in the direction that will restore balance. When a country is selling more than it imports, the demand for its currency will tend to increase as other countries ultimately[39] need the selling country's currency to make payments for the exports. The extra demand tends to cause a rise of the currency's price relative to others. When a country is importing more than it exports, the supply of its own currency on the international market tends to increase as it tries to exchange it for foreign currency to pay for its imports, and this extra supply tends to cause the price to fall. BoP effects are not the only market influence on exchange rates however, they are also influenced by differences in national interest rates and by speculation.
### Rebalancing by adjusting internal prices and demand
When exchange rates are fixed by a rigid gold standard,[40] or when imbalances exist between members of a currency union such as the Eurozone, the standard approach to correct imbalances is by making changes to the domestic economy. To a large degree, the change is optional for the surplus country, but compulsory for the deficit country. In the case of a gold standard, the mechanism is largely automatic. When a country has a favourable trade balance, as a consequence of selling more than it buys it will experience a net inflow of gold. The natural effect of this will be to increase the money supply, which leads to inflation and an increase in prices, which then tends to make its goods less competitive and so will decrease its trade surplus. However the nation has the option of taking the gold out of economy (sterilising the inflationary effect) thus building up a hoard of gold and retaining its favourable balance of payments. On the other hand, if a country has an adverse BoP it will experience a net loss of gold, which will automatically have a deflationary effect, unless it chooses to leave the gold standard. Prices will be reduced, making its exports more competitive, and thus correcting the imbalance. While the gold standard is generally considered to have been successful[41] up until 1914, correction by deflation to the degree required by the large imbalances that arose after WWI proved painful, with deflationary policies contributing to prolonged unemployment but not re-establishing balance. Apart from the US most former members had left the gold standard by the mid-1930s.
A possible method for surplus countries such as Germany to contribute to re-balancing efforts when exchange rate adjustment is not suitable, is to increase its level of internal demand (i.e. its spending on goods). While a current account surplus is commonly understood as the excess of earnings over spending, an alternative expression is that it is the excess of savings over investment.[42] That is:
${\displaystyle {\text{CA}}={\text{NS}}-{\text{NI}}\,}$
where CA = current account, NS = national savings (private plus government sector), NI = national investment.
If a nation is earning more than it spends the net effect will be to build up savings, except to the extent that those savings are being used for investment. If consumers can be encouraged to spend more instead of saving; or if the government runs a fiscal deficit to offset private savings; or if the corporate sector divert more of their profits to investment, then any current account surplus will tend to be reduced. However, in 2009 Germany amended its constitution to prohibit running a deficit greater than 0.35% of its GDP[43] and calls to reduce its surplus by increasing demand have not been welcome by officials,[44] adding to fears that the 2010s would not be an easy decade for the eurozone.[45] In their April 2010 world economic outlook report, the IMF presented a study showing how with the right choice of policy options governments can shift away from a sustained current account surplus with no negative effect on growth and with a positive impact on unemployment.[46]
### Rules based rebalancing mechanisms
Nations can agree to fix their exchange rates against each other, and then correct any imbalances that arise by rules based and negotiated exchange rate changes and other methods. The Bretton Woods system of fixed but adjustable exchange rates was an example of a rules based system. John Maynard Keynes, one of the architects of the Bretton Woods system had wanted additional rules to encourage surplus countries to share the burden of rebalancing, as he argued that they were in a stronger position to do so and as he regarded their surpluses as negative externalities imposed on the global economy.[47] Keynes suggested that traditional balancing mechanisms should be supplemented by the threat of confiscation of a portion of excess revenue if the surplus country did not choose to spend it on additional imports. However his ideas were not accepted by the Americans at the time. In 2008 and 2009, American economist Paul Davidson had been promoting his revamped form of Keynes's plan as a possible solution to global imbalances which in his opinion would expand growth all round without the downside risk of other rebalancing methods.[37][48][49]
## History of issues
Historically, accurate balance of payments figures were not generally available. However, this did not prevent a number of switches in opinion on questions relating to whether or not a nation's government should use policy to encourage a favourable balance.
### Pre-1820: mercantilism
Up until the early 19th century, international trade was generally very small in comparison with national output, and was often heavily regulated. In the Middle Ages, European trade was typically regulated at municipal level in the interests of security for local industry and for established merchants.[50] From about the 16th century, mercantilism became the dominant economic theory influencing European rulers, which saw local regulation replaced by national rules aiming to harness the countries' economic output.[51] Measures to promote a trade surplus such as tariffs were generally favored. Power was associated with wealth, and with low levels of growth, nations were best able to accumulate funds either by running trade surpluses or by forcefully confiscating the wealth of others. Rulers sometimes strove to have their countries outsell competitors and so build up a "war chest" of gold.[52]
This era saw low levels of economic growth; average global per capita income is not considered to have significantly risen in the whole 800 years leading up to 1820, and is estimated to have increased on average by less than 0.1% per year between 1700 and 1820.[30] With very low levels of financial integration between nations and with international trade generally making up a low proportion of individual nations' GDP, BOP crises were very rare.[30]
### 1820-1914: free trade
Gold was the primary reserve asset during the gold standard era.
From the late 18th century, mercantilism was challenged by the ideas of Adam Smith and other economic thinkers favouring free trade. After victory in the Napoleonic wars Great Britain began promoting free trade, unilaterally reducing her trade tariffs. Hoarding of gold was no longer encouraged, and in fact Britain exported more capital as a percentage of her national income than any other creditor nation has since.[53] Great Britain's capital exports further helped to correct global imbalances as they tended to be counter cyclical, rising when Britain's economy went into recession, thus compensating other states for income lost from export of goods.[30]
According to historian Carroll Quigley, Great Britain could afford to act benevolently[54] in the 19th century due to the advantages of her geographical location, its naval power and economic ascendancy as the first nation to enjoy an industrial revolution.[55] A view advanced by economists such as Barry Eichengreen is that the first age of Globalization began with the laying of transatlantic telegraph cables in the 1860s, which facilitated a rapid increase in the already growing trade between Britain and America.[33]
Though Current Account controls were still widely used (in fact all industrial nations apart from Great Britain and the Netherlands actually increased their tariffs and quotas in the decades leading up to 1914, though this was motivated more by a desire to protect "infant industries" than to encourage a trade surplus[30]), capital controls were largely absent, and people were generally free to cross international borders without requiring passports.
A gold standard enjoyed wide international participation especially from 1870, further contributing to close economic integration between nations. The period saw substantial global growth, in particular for the volume of international trade which grew tenfold between 1820 and 1870 and then by about 4% annually from 1870 to 1914. BoP crises began to occur, though less frequently than was to be the case for the remainder of the 20th century. From 1880 to 1914, there were approximately[56] 8 BoP crises and 8 twin crises - a twin crises being a BoP crises that coincides with a banking crises.[30]
### 1914-1945: deglobalisation
The favorable economic conditions that had prevailed up until 1914 were shattered by the first world war, and efforts to re-establish them in the 1920s were not successful. Several countries rejoined the gold standard around 1925. But surplus countries didn't "play by the rules",[30][57]sterilising gold inflows to a much greater degree than had been the case in the pre-war period. Deficit nations such as Great Britain found it harder to adjust by deflation as workers were more enfranchised and unions in particular were able to resist downwards pressure on wages. During the Great Depression most countries abandoned the gold standard, but imbalances remained an issue and international trade declined sharply. There was a return to mercantilist type "beggar thy neighbour" policies, with countries competitively devaluing their exchange rates, thus effectively competing to export unemployment. There were approximately 16 BoP crises and 15 twin crises (and a comparatively very high level of banking crises.)[30]
### 1945-1971: Bretton Woods
Following World War II, the Bretton Woods institutions (the International Monetary Fund and World Bank) were set up to support an international monetary system designed to encourage free trade while also offering states options to correct imbalances without having to deflate their economies. Fixed but flexible exchange rates were established, with the system anchored by the dollar which alone remained convertible into gold. The Bretton Woods system ushered in a period of high global growth, known as the Golden Age of Capitalism, however it came under pressure due to the inability or unwillingness of governments to maintain effective capital controls[58] and due to instabilities related to the central role of the dollar.
Imbalances caused gold to flow out of the US and a loss of confidence in the United States ability to supply gold for all future claims by dollar holders resulted in escalating demands to convert dollars, ultimately causing the US to end the convertibility of the dollar into gold, thus ending the Bretton Woods system.[30] The 1945-71 era saw approximately 24 BoP crises and no twin crises for advanced economies, with emerging economies seeing 16 BoP crises and just one twin crises.[30]
### 1971-2009: transition, Washington Consensus, Bretton Woods II
Manmohan Singh, Former PM of India, showed that the challenges caused by imbalances can be an opportunity when he led his country's successful economic reform programme after the 1991 crisis.
The Bretton Woods system came to an end between 1971 and 1973. There were attempts to repair the system of fixed exchanged rates over the next few years, but these were soon abandoned, as were determined efforts for the U.S. to avoid BoP imbalances. Part of the reason was displacement of the previous dominant economic paradigm - Keynesianism - by the Washington Consensus, with economists and economics writers such as Murray Rothbard and Milton Friedman[59] arguing that there was no great need to be concerned about BoP issues.
In the immediate aftermath of the Bretton Woods collapse, countries generally tried to retain some control over their exchange rate by independently managing it, or by intervening in the foreign exchange market as part of a regional bloc, such as the Snake which formed in 1971.[34]The Snake was a group of European countries who tried to retain stable rates at least with each other; the group eventually evolved into the European Exchange Rate Mechanism (ERM) by 1979. From the mid-1970s however, and especially in the 1980s and early 1990s, many other countries followed the US in liberalizing controls on both their capital and current accounts, in adopting a somewhat relaxed attitude to their balance of payments and in allowing the value of their currency to float relatively freely with exchange rates determined mostly by the market.[30][34]
Developing countries who chose to allow the market to determine their exchange rates would often develop sizable current account deficits, financed by capital account inflows such as loans and investments,[60] though this often ended in crises when investors lost confidence.[30][61][62] The frequency of crises was especially high for developing economies in this era - from 1973 to 1997 emerging economies suffered 57 BoP crises and 21 twin crises. Typically but not always the panic among foreign creditors and investors that preceded the crises in this period was usually triggered by concerns over excess borrowing by the private sector, rather than by a government deficit. For advanced economies, there were 30 BoP crises and 6 banking crises.
A turning point was the 1997 Asian BoP Crisis, where unsympathetic responses by western powers caused policy makers in emerging economies to re-assess the wisdom of relying on the free market; by 1999 the developing world as a whole stopped running current account deficits[32] while the U.S. current account deficit began to rise sharply.[63][64] This new form of imbalance began to develop in part due to the increasing practice of emerging economies, principally China, in pegging their currency against the dollar, rather than allowing the value to freely float. The resulting state of affairs has been referred to as Bretton Woods II.[12] According to Alaistair Chan, "At the heart of the imbalance is China's desire to keep the value of the yuan stable against the dollar. Usually, a rising trade surplus leads to a rising value of the currency. A rising currency would make exports more expensive, imports less so, and push the trade surplus towards balance. China circumvents the process by intervening in exchange markets and keeping the value of the yuan depressed."[65] According to economics writer Martin Wolf, in the eight years leading up to 2007, "three-quarters of the foreign currency reserves accumulated since the beginning of time have been piled up".[66] In contrast to the changed approach within the emerging economies, US policy makers and economists remained relatively unconcerned about BOP imbalances. In the early to mid-1990s, many free market economists and policy makers such as U.S. Treasury secretary Paul O'Neill and Fed Chairman Alan Greenspan went on record suggesting the growing US deficit was not a major concern. While several emerging economies had intervening to boost their reserves and assist their exporters from the late 1980s, they only began running a net current account surplus after 1999. This was mirrored in the faster growth for the US current account deficit from the same year, with surpluses, deficits and the associated buildup of reserves by the surplus countries reaching record levels by the early 2000s and growing year by year. Some economists such as Kenneth Rogoff and Maurice Obstfeld began warning that the record imbalances would soon need to be addressed from as early as 2001, joined by Nouriel Roubini in 2004, but it was not until about 2007 that their concerns began to be accepted by the majority of economists.[67][68]
### 2009 and later: post Washington Consensus
Speaking after the 2009 G-20 London summit, Gordon Brown announced "the Washington Consensus is over".[69] There is now broad agreement that large imbalances between different countries do matter; for example mainstream U.S. economist C. Fred Bergsten has argued the U.S. deficit and the associated large inbound capital flows into the U.S. was one of the causes of the financial crisis of 2007-2010.[28] Since the crisis, government intervention in BOP areas such as the imposition of capital controls or foreign exchange market intervention has become more common and in general attracts less disapproval from economists, international institutions like the IMF and other governments.[70][71]
In 2007, when the crises began, the global total of yearly BoP imbalances was $1680 billion. On the credit side, the biggest current account surplus was China with approx.$362 billion, followed by Japan at $213 billion and Germany at £185 billion, with oil producing countries such as Saudi Arabia also having large surpluses. On the debit side, the US had the biggest current account deficit at over$1100 billion, with the UK, Spain and Australia together accounting for close to a further $300 billion.[66] While there have been warnings of future cuts in public spending, deficit countries on the whole did not make these in 2009, in fact the opposite happened with increased public spending contributing to recovery as part of global efforts to increase demand.[72] The emphases has instead been on the surplus countries, with the IMF, EU and nations such as the U.S., Brazil and Russia asking them to assist with the adjustments to correct the imbalances.[73][74] Economists such as Gregor Irwin and Philip R. Lane have suggested that increased use of pooled reserves could help emerging economies not to require such large reserves and thus have less need for current account surpluses.[75] Writing for the FT in Jan 2009, Gillian Tett says she expects to see policy makers becoming increasingly concerned about exchange rates over the coming year.[76] In June 2009, Olivier Blanchard the chief economist of the IMF wrote that rebalancing the world economy by reducing both sizeable surpluses and deficits will be a requirement for sustained recovery.[77] In 2008 and 2009, there was some reduction in imbalances, but early indications towards the end of 2009 were that major imbalances such as the U.S. current account deficit are set to begin increasing again.[11][78] Japan had allowed her currency to appreciate through 2009, but has only limited scope to contribute to the rebalancing efforts thanks in part to her aging population. The euro used by Germany is allowed to float fairly freely in value, however further appreciation would be problematic for other members of the currency union such as Spain, Greece and Ireland who run large deficits. Therefore, Germany has instead been asked to contribute by further promoting internal demand, but this hasn't been welcomed by German officials.[73] China has been requested to allow the renminbi to appreciate but until 2010 had refused, the position expressed by her premier Wen Jiabao being that by keeping the value of the renmimbi stable against the dollar China has been helping the global recovery, and that calls to let her currency rise in value have been motivated by a desire to hold back China's development.[74] After China reported favourable results for her December 2009 exports however, the Financial Times reported that analysts are optimistic that China will allow some appreciation of her currency around mid-2010.[79] In April 2010 a Chinese official signalled the government is considering allowing the renminbi to appreciate,[80] but by May analysts were widely reporting the appreciation would likely be delayed due to the falling value of the Euro following the 2010 European sovereign debt crisis.[81] China announced the end of the renminbi's peg to the dollar in June 2010; the move was widely welcomed by markets and helped defuse tension over imbalances prior to the 2010 G-20 Toronto summit. However the renminbi remains managed and the new flexibility means it can move down as well as up in value; two months after the peg ended the renminbi had only appreciated against the dollar by about 0.8%.[82] By January 2011, the renminbi had appreciated against the dollar by 3.7%, which means it's on track to appreciate in nominal terms by 6% per year. As this reflects a real appreciation of 10% when China's higher inflation is accounted for, the U.S. Treasury once again declined to label China a currency manipulator in their February 2011 report to Congress. However Treasury officials did advise the rate of appreciation was still too slow for the best interests of the global economy.[83][84] In February 2011, Moody's analyst Alaistair Chan has predicted that despite a strong case for an upward revaluation, an increased rate of appreciation against the dollar is unlikely in the short term.[85] And as of February 2012, China's currency had been continuing to appreciate for a year and a half, while drawing remarkably little notice.[86] While some leading surplus countries including China have been taking steps to boost domestic demand, these have not yet been sufficient to rebalance out of their current account surpluses. By June 2010, the U.S. monthly current account deficit had risen back to$50 billion, a level not seen since mid-2008. With the US currently suffering from high unemployment and concerned about taking on additional debt, fears are rising that the US may resort to protectionist measures.[87]
#### Competitive devaluation after 2009
By September 2010, international tensions relating to imbalances had further increased. Brazil's finance minister Guido Mantega declared that an "international currency war" has broken out, with countries competitively trying to devalue their currency so as to boost exports. Brazil has been one of the few major economies lacking a reserve currency to abstain from significant currency intervention, with the real rising by 25% against the dollar since January 2009. Some economists such as Barry Eichengreen have argued that competitive devaluation may be a good thing as the net result will effectively be equivalent to expansionary global monetary policy. Others such as Martin Wolf saw risks of tensions further escalating and advocated that coordinated action for addressing imbalances should be agreed on at the November G20 summit.[22][88][89]
Commentators largely agreed that little substantive progress was made on imbalances at the November 2010 G20. An IMF report released after the summit warned that without additional progress there is a risk of imbalances approximately doubling to reach pre-crises levels by 2014.[90]
## Notes and citations
1. ^ Cheol S. Eun, Bruce G. Resnick (2013). International Financial Management. China Machine.
2. ^ a b c d Sloman, John (2004). Economics. Penguin. pp. 516-17, 555-59.
3. ^ Carbaugh, Robert J. International Economics. p. 347.
4. ^ adam antiam. Exchange Rates and International Finance (4th ed.). Prentice Hall. pp. 10-35. ISBN 0-273-68306-3.
5. Orlin, Crabbe (1996). International Financial Markets (3rd ed.). Prentice Hall. pp. 430-52. ISBN 0-13-206988-1.
6. ^ Colin Danby. "Balance of Payments: Categories and Definitions". University of Washington. Retrieved 2009.
7. ^ IMF Balance of Payments Manual, Chapter 2 "Overview of the Framework", Paragraph 2.15 [1]
8. ^ The IMF Capital account records mainly capital transfers, the amounts involved are usually very small compared to other BoP transactions, except in rare cases where a country is the beneficiary of substantial debt forgiveness.
9. ^ "The Determinants & Excessiveness of Current Account Deficits in Eastern Europe & the Former Soviet Union," (PDF). Aleksander Aristovnik, William Davidson Institute at the University of Michigan. 19 July 2006. Archived from the original (PDF) on 20 July 2011. Retrieved 2010.
10. ^ Though there is difference of opinion on how to resolve the issue with the major surplus countries apart from Japan resisting pressure to lower their own surpluses.
11. ^ a b Krishna Guha (24 October 2009). "Recovery takes an unclear path". The Financial Times. Archived from the original on 31 January 2012. Retrieved 2010.
12. ^ a b Michael P. Dooley; David Folkerts-Landau; Peter Garber (February 2009). "Bretton Woods II Still Defines the International Monetary System". National Bureau of Economic Research.
13. ^ Wolfgang Münchau, "Kernschmelze im Finanzsystem", Carl Hanser Verlag, München, 2008, p. 155ff.; vgl. Benedikt Fehr: "'Bretton Woods II ist tot. Es lebe Bretton Woods III'" in FAZ 12 May 2009, p. 32. FAZ.Net, Stephanie Schoenwald: "Globale Ungleichgewichte. Sind sie für die Finanzmarktkrise (mit-) verantwortlich?" KfW (Kreditanstalt für Wiederaufbau) Research. MakroScope. No. 29, February 2009. p. 1.
Zu den außenwirtschaftlichen Ungleichgewichten als "makroökonomischer Nährboden" der Krise siehe auch Deutsche Bundesbank: Finanzstabilitätsbericht 2009, Frankfurt am Main, November 2009 Archived 7 March 2012 at the Wayback Machine (PDF)., Gustav Horn, Heike Joebges, Rudolf Zwiener: "Von der Finanzkrise zur Weltwirtschaftskrise (II), Globale Ungleichgewichte: Ursache der Krise und Auswegstrategien für Deutschland" IMK-Report Nr. 40, August 2009, pp. 6-7. (PDF; 260 kB)
14. ^ Heiner Flassbeck: Wege aus der Eurokrise. YouTube http://www.popflock.com/video?id=mfKuosvO6Ac
15. ^ Paul Krugman Blog: Germans and Aliens, Online verfügbar unter http://krugman.blogs.nytimes.com/2012/01/09/germans-and-aliens/
16. ^ Joseph Stiglitz: Is Mercantilism Doomed to Fail?, Online available at http://www.popflock.com/video?id=D207fSLnxHk
17. ^ Richard Duncan (31 January 2008). "Buyers, not savers, caused America's deficit". The Financial Times. Archived from the original on 27 November 2010. Retrieved 2010.
18. ^ Martin Wolf (4 November 2009). "Private behaviour will shape our path to fiscal stability". The Financial Times. Retrieved 2010.
19. ^ "Governor Ben S. Bernanke, The Global Saving Glut and the U.S. Current Account Deficit". Federalreserve.gov. March 2005. Retrieved 2010.
20. ^ However individual states may choose to keep some of their reserves in the form of whatever currency is used by nations they buy most of their imports from (providing mechanisms are available to settle trades in that currency, which isn't always the case).
21. ^ John Plender (11 November 2009). "Decline but no fall". The Financial Times. Retrieved 2010.
22. ^ a b Martin Wolf (29 September 2010). "Currencies clash in new age of beggar-my-neighbour". The Financial Times. Archived from the original on 30 September 2010. Retrieved 2010.
23. ^ Martin Wolf (5 April 2011). "Waiting for the great rebalancing". The Financial Times. Archived from the original on 9 May 2011. Retrieved 2011.
24. ^ Mainly gold, but also silver, platinum and palladium.
25. ^ Jamil Anderlini in Beijing (23 March 2009). "China calls for new reserve currency". Financial Times. Archived from the original on 15 April 2009. Retrieved 2009.
26. ^ Zhou Xiaochuan (23 March 2009). "Reform the International Monetary System". People's Bank of China. Retrieved .
27. ^ Geoff Dyer in Beijing (24 August 2009). "The dragon stirs". The Financial Times. Retrieved 2009.
28. ^ a b C. Fred Bergsten (November 2009). "The Dollar and the Deficits". Foreign Affairs. Archived from the original on 1 December 2009. Retrieved 2009.
29. ^ Gerard Lyons (27 April 2010). "China is undermining the dollar by the back-door". The Financial Times. Archived from the original on 30 April 2010. Retrieved 2010.
30. Eirc Helleiner; Louis W Pauly; et al. (2005). John Ravenhill (ed.). Global Political Economy. Oxford University Press. pp. 7-15, 154, 177-204.
31. ^ It sometimes takes only one or two big investors pulling out to trigger a mass panic due to herd effects.
32. ^ a b Wolf, Martin (2009). "3". Fixing Global Finance. Yale University Press. pp. 31-39.
33. ^ a b Barry Eichengreen and Michael D Bordo (11 November 2001). "Crises Now and Then" (PDF). Berkeley. Retrieved 2010.
34. ^ a b c Roberts, Richard (1999). Inside International Finance. Orion. pp. 1-27. ISBN 0-7528-2070-2.
35. ^ Scores of other text books old and new also give this definition, see for example International monetary relations: theory, history, and policy (1976), p. 611 by Leland B. Yeager. The other two basic functions are to provide liquidity and to impart confidence. While during the Washington Consensus period fewer emphasis was placed on the need for balance, in the main a requirement for correction was still accepted, though many argued that governments should leave such correction to the markets.
36. ^ Following the collapse of the Bretton Woods system, rules based adjustment is mostly theoretical.
37. ^ a b Paul Davidson (2009). The Keynes Solution: The Path to Global Economic Prosperity. Palgrave Macmillan. pp. 123-38. ISBN 978-0-230-61920-3.
38. ^ Though except in the early years of the Bretton Woods System when international markets were heavily constrained by capital controls, managing the exchange rate has often been problematic as the markets often want the currency to move in the opposite direction to governments. Developing countries in particular would often experience difficulties, though even advanced economies like Britain had issues, with Black Wednesday an example when she had insufficient reserves to counter the market.
39. ^ There are commonly used financial instruments that allow importers to pay with their domestic currency, and the reserve asset will often play an intermediary role, but ultimately exporters require paying in their own currency.
40. ^ In practice there is typically still a small degree of exchange rate flexibility due to the cost of shipping gold between nations.
41. ^ Though not problem free, see Paper from the Bank of Canada on current imbalances in context of international monetary system history
42. ^ Wolfgang Munchau (7 June 2009). "Down and out for the long term in Germany". The Financial Times. Retrieved 2010.
43. ^ Bertrand Benoit (29 May 2009). "Berlin vote heralds big spending cuts". The Financial Times. Archived from the original on 1 June 2009. Retrieved 2010.
44. ^ Ralph Atkins (30 September 2009). "The Bundesbank and global imbalances". The Financial Times. Retrieved 2010.
45. ^ Martin Wolf (5 January 2010). "The eurozones next decade will be tough". The Financial Times. Archived from the original on 1 April 2010. Retrieved 2010.
46. ^ "Getting the balance right" (PDF). International Monetary Fund. 18 April 2010. Retrieved 2010.
47. ^ Joseph Stiglitz (5 May 2010). "Can the Euro be Saved?". Project Syndicate. Archived from the original on 9 May 2010. Retrieved 2010.
48. ^ Reforming the worlds international money (pdf) (2008) by Paul Davidson
49. ^ "Rebalancing the global economy: A Primer for Policymaking (p.174 et seq.)" (PDF). Centre for Economic Policy Research (CEPR). 2010. Archived from the original (PDF) on 22 February 2011. Retrieved 2011.
50. ^ Annual fairs would sometimes allow exceptions to the standard regulations.
51. ^ Karl Polanyi (2002). The Great Transformation. Beacon Press. ISBN 978-0-8070-5643-1.
52. ^ Silver and other precious commodities were also important sometimes, acting along with gold as part of a nation's de facto reserve asset.
53. ^ Harold James (30 June 2009). The End of Globalization. Harvard University Press / google books. p. 12. ISBN 9780674039087. Retrieved 2009.
54. ^ However, some, like Otto von Bismarck, viewed Great Britain's promotion of free trade as a way to maintain its dominant position FT article
55. ^ Carroll Quigley (1995). Tragedy and Hope. GSG & Associates, Inc. pp. 243, 263. ISBN 0-945001-10-X.
56. ^ Different economic historians don't always classify the same events as a BoP or twin crises
57. ^ One of the informal rules during the gold standard era was that countries running a trade surplus ought to allow the net inflow of gold they receive to increase their domestic money supply. This would have an expansionary and possibly inflationary effect on their economies, helping to reverse the earlier trade surplus and thus correct the imbalance. However central banks of surplus countries could choice not to allow the extra gold to circulate in their domestic economies, hoarding it in their vaults, and thus the burden of rebalancing would fall entirely on the deficit countries which may need to deflate their economies in order to reduce prices and regain competitiveness.
58. ^ Dani Rodrik (11 May 2010). "Greek Lessons for the World Economy". Project Syndicate. Retrieved 2010.
59. ^ e.g., in his influential Free to Choose TV series
60. ^ In the 1970s and 1980s a significant part of the capital flowing into developing countries was re-cycled petro dollars, the oil producing countries were among the few to have large surpluses but at that time the US wasn't issuing many bonds so the capital tended to flow to developing countries via the intermediary of western investment banks.
61. ^ Heakal, Reem. "Understanding Capital And Financial Accounts In The Balance Of Payments". Investopedia. Retrieved 2009.
62. ^ Eswar S. Prasad; Raghuram G. Rajan & Arvind Subramanian (16 April 2007). "Foreign Capital and Economic Growth" (PDF). Peterson Institute. Archived (PDF) from the original on 14 December 2009. Retrieved 2009.
63. ^ U.S. Trade in Goods and Services - Balance of Payments 1960 thru 2008
64. ^ Data visualization from OECD Archived 14 May 2011 at the Wayback Machine, select 'Current account imbalances' or 'Reserve Accumalation' on the stories tab, then move the date slider to see how imbalances developed between 1990-2008.
65. ^ Chan, Alaistair. "The U.S. - China Balance of Payments Relationship". Moody's Analytics. Retrieved 2011.
66. ^ a b Martin Wolf (8 October 2008). "Asia's Revenge". The Financial Times. Retrieved 2010.
67. ^ Wolf, Martin (2009). Fixing Global Finance. Yale University Press. pp. 41, 82, 114-16. ISBN 0-300-14277-3.
68. ^ Carmen Reinhart and Kenneth Rogoff (2010). This Time Is Different: Eight Centuries of Financial Folly. Princeton University Press. pp. 208-12. ISBN 0-19-926584-4.
69. ^
70. ^ Dani Rodrik (11 March 2010). "The End of an Era in Finance". Project Syndicate. Retrieved 2010.
71. ^ Mansoor Mohi-Uddin (22 September 2010). "Towards a new era of currency intervention". The Financial Times. Retrieved 2010.
72. ^ The public spending did not however make the imbalances worse as they were offset by reduced private sector demand and debt in the deficit countries.
73. ^ a b Chris Giles (11 January 2009). "Surplus nations urged by IMF to take up baton". The Financial Times. Retrieved 2010.
74. ^ a b Geoff Dyer (29 December 2009). "Wen dismisses currency pressure". The Financial Times. Retrieved 2010.
75. ^ Philip R. Lane. "Global Imbalances and Global Governance" (PDF). CEPR. Retrieved 2009.
76. ^ Gillian Tett (28 January 2010). "Calls for a new Bretton Woods not so mad". Financial Times. Retrieved 2010.
77. ^ Olivier Blanchard (18 June 2009). "What is needed for a lasting recovery". The Financial Times. Retrieved 2010.
78. ^ Gideon Rachman (12 January 2010). "Bankruptcy could be good for America". The Financial Times. Archived from the original on 28 January 2010. Retrieved 2010.
79. ^ Patti Waldmeir (10 January 2010). "China's exports rise as economy picks up". The Financial Times. Archived from the original on 11 January 2010. Retrieved 2010.
80. ^ Jamil Anderlini in Beijing (6 April 2010). "Beijing lays ground for renminbi shift". Financial Times. Archived from the original on 6 April 2010. Retrieved 2010.
81. ^ Kevin Brown in Kuala Lumpur, Jamil Anderlini in Beijing and Robin Harding in Tokyo (20 May 2010). "Asian exporters rattled by eurozone turmoil". Financial Times. Archived from the original on 22 May 2010. Retrieved 2010.
82. ^ Geoff Dyer (10 August 2010). "China trade surplus widens". The Financial Times. Archived from the original on 16 August 2010. Retrieved 2010.
83. ^ Treasury staffers (4 February 2011). "Report to Congress on International Economic and Exchange Rate Policies" (PDF). United States Department of the Treasury. Retrieved 2011.
84. ^ Robin Harding (5 February 2011). "US retreats from attack on renminbi". The Financial Times. Retrieved 2011.
85. ^ Chan, Alaistair. "The U.S. - China Balance of Payments Relationship". Retrieved 2011.
86. ^ David Leonhardt (15 February 2012). "Appreciation in China's Currency Goes Largely Unnoted". The New York Times. Retrieved 2012.
87. ^ Michael Pettis (22 August 2010). "The last chance to avoid a global trade war". The Financial Times. Archived from the original on 8 August 2010. Retrieved 2010.
88. ^ Jonathan Wheatley in São Paulo and Peter Garnham in London (27 September 2010). "Brazil in 'currency war' alert". The Financial Times. Archived from the original on 29 September 2010. Retrieved 2010.
89. ^ Alan Beattie (27 September 2010). "Hostilities escalate to hidden currency war". The Financial Times. Archived from the original on 29 September 2010. Retrieved 2010.
90. ^ IMF staffers (12 November 2010). "G-20 Mutual Assessment Process - IMF Staff Assessment of G-20 Policies1" (PDF). International Monetary Fund. Retrieved 2010.
## Further reading
• Economics 8th Edition by David Begg, Stanley Fischer and Rudiger Dornbusch, McGraw-Hill
• Economics Third Edition by Alain Anderton, Causeway Press
This article uses material from the Wikipedia page available here. It is released under the Creative Commons Attribution-Share-Alike License 3.0.
| 2019-10-21T20:56:19 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 4, "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.4899309277534485, "perplexity": 5424.110176602926}, "config": {"markdown_headings": true, "markdown_code": true, "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-2019-43/segments/1570987787444.85/warc/CC-MAIN-20191021194506-20191021222006-00306.warc.gz"}
|
https://indico.fnal.gov/event/3506/other-view?view=standard
|
# SIST Final Talks 2010
Tuesday, August 3, 2010 from to (US/Central)
at 1WEST
Description Summer Internships in Science and Technology
Go to day
• Tuesday, August 3, 2010
• 08:30 - 08:40 Welcome 10' Speaker: Mr. Jamieson OLSEN (Fermi National Accelerator Laboratory) Material:
• 08:40 - 09:00 Mass Constraints on Fourth Generation of Standard Model Fermions 20'
Current experimental bounds on fourth-generation, standard model fermion masses are revisited. Assuming a fourth generation, we cast uniformly distributed masses for four fermions and determine a probability density function based on consistency with the electroweak oblique parameters, S, T, and U, convoluting over Higgs masses. Recent TeVatron combination limit on Mh in the fourth generation scenario is used and a probability density function for the four fermions is obtained.
Speaker: Enrique Ramirez-Homs (University of Texas at El Paso) Material:
• 09:00 - 09:20 Muon-to-Electron Conversion Experiment (Mu2e) Detector Solenoid Design 20'
This project will focus on the calculations, tests, and analysis that went into creating a feasible Detector Solenoid design for Mu2e. The project primarily involves a finite element analysis (FEM) program called COMSOL that can produce analysis of magnetic fields, axial stresses, force summations, and coil deformations. The Mu2e experiment aims to find the direct, neutrino-less conversion of a muon to an electron in the field of a nucleus. The Charged Lepton Flavor Violation (CLFV) is one example of a neutrino-less muon-to-electron conversion that is found in the Coulomb field of a nucleus. If this occurrence can be observed, there may be much more to specify in regards to the standard model of particle physics and the fundamental laws of high energy physics.
Speaker: Mr. Bryce Austell (SIST Intern) Material:
• 09:20 - 09:40 A Garnet Tuner for the NOvA Recycler 52.809 MHz RF Cavity 20'
This project describes the function of an yttrium-iron garnet tuner and a radio frequency cavity. This experiment focises on the subject of particle acceleration and the role the yttrium-iron garnet tuner and cavity play in such. The data received during the 2010 summer while working with RG 58 coaxial cable models and higher Q transmission line models of the RF cavity and tuner, as well as data from the prototype cavity and the tuner using an adjustable short is critical towards taking the next steps involving the NOvA Recycler.
Speaker: Minnae Chabwera (Hampton University/SIST Intern) Material:
• 09:40 - 09:50 break
• 09:50 - 10:10 Cryomodule Magnetic Field Measurements 20'
Superconducting Radio Frequency Cavities (SCRF) are being used in modern accelerators because of their high acceleration gradient and efficiency. Field emission threshold and quench however, limit the accelerating gradient thus degrading their performance. Quench is specific to superconductors and is dependent on temperature and magnetic field strength. In order to reduce the quench limitation and to support higher field gradients, the residual magnetic field in the SCRF has to be kept minimum. The cavities are magnetically shielded to prevent magnetic flux from being trapped in the cavities during cool down. The cryomodules vessel shields the cavities from the earth’s magnetic field. In addition, each cavity is shielded by an independent mu-metal shield. To ensure that the residual magnetic field inside the vessel is acceptable, we develop a LabVIEW measurement program to measure the residual magnetic field along the length of the inside of the vessel where the SCRF cavities will be mounted. The LabVIEW program reads Bartington’s Mag-03MC1000 Flux-Gate magnetometer using National Instrument’s Data Acquisition hardware to measure the magnetic field inside the cryomodule.
Speaker: Jackline Koech (Mount Holyoke College) Material:
• 10:10 - 10:30 Dark Energy Survey via the technique of Counts of Galaxy Clusters 20'
Recently it was discovered that the universe is expanding at accelerated rate. This acceleration could be explained with a concept of Dark Energy. Dark Energy Survey is an imaging survey to make precise measurement of dark energy. The first part of this paper describes in detail the simulation done to estimate the equation of state parameter, w and its error by comparing it with a simulation bias data. All of the calculations were done using a mathematica based tool created specifically for this project. Comparing the model bias with the simulation bias data given σD = 0.03 gave w = -0.716488±0.098.
The second part of this paper focuses on the method used to build a GUI that is used to analyze images from CCD. The GUI is mostly stable with some bugs still to be fixed.
Speaker: Mr. Salem Cherenet (University Of Illinois) Material:
• 10:30 - 10:50 Application of Cone beam CT Isocenter Adjustments in Image Reconstruction 20'
The Cone Beam Computed Tomography (CBCT) System at Fermilab is being developed to accurately locate tumors and characterize the surrounding anatomy prior to Neutron Therapy (NT). The aim of this project is to aid accurate prediction of the position of the CT isocenter. This is necessary to ensure spatial isotropy in the reconstructed CT images. A vertical CT scanner is currently used unaided for treatment planning at the Neutron Therapy Facility (NTF). The cone beam CT now being developed will be used alongside the vertical CT to characterize the tumor volume prior to irradiation. However, instead of utilizing a rotating "gantry", the NTF is constructed around a linear accelerator (LINAC), hence the neutron beam is applied in a fixed horizontal position on a lower level while the patient is sitting or standing on a rotating platform. An elevator carries the platform to an upper level to perform the CBCT scans. The elevator has been determined to have a pitch in the x-y plane (upstream of the beam and transverse to the movement of the elevator) resulting in pixel offsets in the reconstructed image. This project involves the various methods and experiments aimed at measuring the offsets as well as their application in the image reconstruction algorithm.
Speaker: Nnadozie Ezerioha (Benedict College) Material:
• 10:50 - 11:00 break
• 11:00 - 11:20 Position Errors in the Flying Wires Detector 20'
There currently exists mild error in the recorded position, as given by a resolver, of the wire used in the Flying Wire Beam Profiling Detectors. A program was created that would help find positioning error in the system by comparing the position readings from the resolver a more accurate optical encoder.
Speaker: Joshua Hooks (Fermilab) Material:
• 11:20 - 11:40 Characterization of the Picosecond Pulsed Fiber Laser 20'
The Picosecond Pulsed Fiber Laser is in the process of characterization for the New Muon Lab Test Area. It will replace the Nd:YLF laser currently in A0 once the New Muon Lab is completed. Fiber technology is supposed to be cutting edge in the low noise and stability frontier. This Yb-doped fiber seed laser will be A0PI's first step in the fiber arena for Photoinjector Application.
Speaker: Ms. Courtney Clarke (Fermilab SIST) Material:
• 11:40 - 12:00 Group photo in atrium
• 12:00 - 13:00 Summer Lecture Series 1h0'
Tom Kroc
• 13:00 - 14:00 break
• 14:00 - 14:20 A simulation Study of the Totally Active Dual Readout Calorimeter 20'
Electromagnetic calorimeters are capable of very precise energy measurements as the energy deposited by electromagnetic showers is almost entirely visible to electromagnetic calorimeters. Hadronic calorimeters, on the other hand, are much less precise. This is partly due to the fact that a significant portion of energy is lost to nuclear interactions during hadron showers. The prospects of high precision lepton colliders such as the ILC call for much more precise energy measurements than what current hadron calorimeters can afford. To meet this challenge, the idea of the dual readout calorimeter is proposed. This calorimeter will have the capability of reading out both scintillation and cerenkov light, using the latter to correct for the energy lost due to nuclear interactions in hadron showers. In this research project, the simulation and analytical processes of the totally active dual readout calorimeter were investigated. Simulations were done for electrons, pi- mesons and muons of various energies. The dual readout correction process was applied to the pions and the corrected energy responses with their energy resolution were obtained. The effect of energy threshold cuts on the final energy resolution was investigated using the 20GeV pion as an example.
Speaker: Earle Wilson (Columbia University) Material:
• 14:20 - 14:40 Developing SES Browser Utility GUI Applications 20'
The DZero detector requires active monitoring throughout the experiment for it gathers large sums of data pertinent to the collaboration’s experiment during the collisions. Monitoring the state of the detector and the data acquisition process is the task of the control room which relies on several application. One of these is aptly named the Significant Event System (SES). SES send alarm message concerning the status of the detector in real time and in log files. I developed two application to help Dzero member uses the SES browser to find certain alarm messages and view alarm messages without internal information.
Speaker: Llewellyn Barrett (North Carolina State University) Material:
• 14:40 - 15:00 MicroBooNE Detector: Digitization at Feed Through 20'
The MicroBooNE is a Liquid Argone Time Projection Chamber. During this summer, We worked on tentative modifications on the current digitization scheme of MicroBooNE. We have card designed to digize signals at feed throiugh. The card is compatible with the detectors; the card is designed to fit the slots available at feed through. The digitization scheme used is a TDC implemented on an FPGA. Dedicated carry lines of an FPGA are used as delay cells to perform time interpolation within the system clock period and to realize the fine time measurement. Two Gray-code counters, working on in-phase and out-of-phase system clocks respectively, are designed to get the stable value of the coarse time measurement. The fine time code and the coarse time counter value, along with the channel identifier, are then written into a first-in first-out (FIFO) buffer. Tests have been done to verify the performance of the TDC. This paper and presentation explains the TDC card design and the details the performance test carried on the card.
Speaker: Mr. john odeghe (SIST Fermi Lab, SC State University) Material:
• 15:00 - 15:20 Continuation of the Search for the Standard Model Higgs Boson 20'
During the summer of 2010, work began on developing intermediary stages of the analysis of the high-mass Standard Model Higgs boson in associated production with a W boson. This channel, WH -> WWW -> lv:jj:jj, is of particular interest since it has not yet been investigated by any other analysis group. At time of writing, several analysis frameworks have been updated and utilized to produce plots comparing the data samples and Monte Carlo simulations. Continued efforts are being made to develop
a customized framework for this analysis and locate candidate events in this channel.
Speaker: Mr. Anthony Podkowa (Summer Internships in Science and Technology) Material:
| 2019-02-24T03:55: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": 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.5312269330024719, "perplexity": 2408.457896015738}, "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-2019-09/segments/1550249578748.86/warc/CC-MAIN-20190224023850-20190224045850-00566.warc.gz"}
|
https://dlmf.nist.gov/LaTeXML/manual/customization/latexml/digestion.html
|
# § 4.1.2 Digestion & Primitives
(November 17, 2020)
Primitives are processed during the digestion phase in the Stomach, after macro expansion (in the Gullet), and before document construction (in the Document). Our primitives generalize TeX’s notion of primitive; they are used to implement TeX’s primitives, invoke other side effects and to convert Tokens into Boxes, in particular, Unicode strings in a particular font.
Here are a few primitives from TeX.pool:
DefPrimitive(’\begingroup’,sub {
$_[0]->begingroup; }); DefPrimitive(’\endgroup’, sub {$_[0]->endgroup; });
DefPrimitiveI(’\batchmode’, undef,undef);
DefPrimitiveI(’\OE’, undef, "\x{0152}");
DefPrimitiveI(’\tiny’, undef, undef,
font=>{size=>5});
Other than for implementing TeX’s own primitives, DefPrimitive is needed less often than DefMacro or DefConstructor. The main thing to keep in mind is that primitives are processed after macro expansion, by the Stomach. They are most useful for side-effects, changing the State.
## DefPrimitive($prototype,$replacement,%options)
The replacement is either a string which will be used to create a Box in the current font, or can be code taking the Stomach and the control sequence arguments as argument; like macros, these arguments are not expanded or digested by default, they must be explicitly digested if necessary. The replacement code must either return nothing (eg. ending with return;) or should return a list (ie. a Perl list (...)) of digested Boxes or Whatsits.
Options to DefPrimitive are:
• mode=>(’math’|’text’) switches to math or text mode, if needed;
• requireMath=>1, forbidMath=>1 requires, or forbids, this primitive to appear in math mode;
• bounded=>1 specifies that all digestion (of arguments and daemons) will take place within an implicit TeX group, so that any side-effects are localized, rather than affecting the global state;
• font=>{hash} switches the font used for any created text; recognized font keys are family, series, shape, size, color;
Note that if the font change should only affect the material digested within this command itself, then bounded=>1 should be used; otherwise, the font change will remain in effect after the command is processed.
• beforeDigest=>CODE($stomach), afterDigest=>CODE($stomach) provides code to be digested before and after processing the main part of the primitive.
## DefRegister(…)
Needs descrition!
## Other Utilities for Digestion
Other functions useful for dealing with digestion and state are important for writing before & after daemons in constructors, as well as in Primitives; we give an overview here:
• Digest($tokens) digests$tokens (a (LaTeXML::Core::)Tokens), returning a list of Boxes and Whatsits.
• Let($token1,$token2) gives $token1 the same meaning as$token2, like \let.
## Bindings
The following functions are useful for accessing and storing information in the current State. It maintains a stack-like structure that mimics TeX’s approach to binding; braces { and } open and close stack frames. (The Stomach methods bgroup and egroup can be used when explicitly needed.)
• LookupValue($symbol), AssignValue($string,$value,$scope) maintain arbitrary values in the current State, looking up or assigning the current value bound to $symbol (a string). For assignments, the$scope can be ’local’ (the default, if $scope is omitted), which changes the binding in the current stack frame. If$scope is ’global’, it assigns the value globally by undoing all bindings. The $scope can also be another string, which indicates a named scope — but that is a more advanced topic. • PushValue($symbol,$value,...), PopValue($symbol),
UnshiftValue($symbol,$value,...), ShiftValue($symbol) These maintain the value of$symbol as a list, with the operatations having the same sense as in Perl; modifications are always global.
• LookupCatcode($char), AssignCatcode($char,$catcode,$scope) maintain the catcodes associated with characters.
• LookupMeaning($token), LookupDefinition($token) looks up the current meaning of the token, being any executable definition bound for it. If there is no such defniition LookupMeaning returns the token itself, LookupDefinition returns undef.
## Counters
The following functions maintain LaTeX-like counters, and generally also associate an ID with them. A counter’s print form (ie. \theequation for equations) often ends up on the refnum attribute of elements; the associated ID is used for the xml:id attribute.
• NewCounter($name,$within,options), creates a LaTeX-style counters. When $within is used, the given counter will be reset whenever the counter$within is incremented. This also causes the associated ID to be prefixed with $within’s ID. The option idprefix=>$string causes the ID to be prefixed with that string. For example,
NewCounter(’section’, ’document’, idprefix=>’S’);
NewCounter(’equation’,’document’, idprefix=>’E’,
idwithin=>’section’);
would cause the third equation in the second section to have ID=’S2.E3’.
• CounterValue($name) returns the Number representing the current value. • ResetCounter($name) resets the counter to 0.
• StepCounter($name) steps the counter (and resets any others ‘within’ it), and returns the expansion of \the$name.
• RefStepCounter($name) steps the counter and any ID’s associated with it. It returns a hash containing refnum (expansion of \the$name) and id (expansion of \the$name@ID) • RefStepID($name) steps the ID associated with the counter, without actually stepping the counter; this is useful for unnumbered units that normally would have both a refnum and ID.
| 2021-07-29T03:16: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": 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.45258957147598267, "perplexity": 5461.6197151066}, "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-31/segments/1627046153814.37/warc/CC-MAIN-20210729011903-20210729041903-00612.warc.gz"}
|
https://www.aimsciences.org/article/doi/10.3934/dcds.2020050
|
Article Contents
Article Contents
# Asymptotic spreading of interacting species with multiple fronts Ⅰ: A geometric optics approach
• * Corresponding author: King-Yeung Lam
The last author is partially supported by NSF grant DMS-1853561
• We establish spreading properties of the Lotka-Volterra competition-diffusion system. When the initial data vanish on a right half-line, we derive the exact spreading speeds and prove the convergence to homogeneous equilibrium states between successive invasion fronts. Our method is inspired by the geometric optics approach for Fisher-KPP equation due to Freidlin, Evans and Souganidis. Our main result settles an open question raised by Shigesada et al. in 1997, and shows that one of the species spreads to the right with a nonlocally pulled front.
Mathematics Subject Classification: Primary: 35K58, 35B40; Secondary: 35D40.
Citation:
• Figure 1. Asymptotic behaviors of the solutions to (1) with $a = 0.6, \, b = 0.5, \, r = 1$, and $d = 1.5$ in $\rm(a)$, $d = 1$ in $\rm(b)$, $d = 0.5$ in $\rm(c)$, where the initial data are chosen as $u(0, x) = \chi_{[-1000, 0]}$ and $v(0, x) = \chi_{[-20, 0]}$
Figure 2. The graphs of $x_i(t)/t$ ($i = 1, 2, 3$) with $a = 0.6, \, b = 0.5, \, r = 1$ and $d = 1.5$ where the initial data are chosen as $u(0, x) = \chi_{[-1000, 0]}$ and $v(0, x) = \chi_{[-20, 0]}$
Open Access Under a Creative Commons license
Figures(2)
| 2023-03-27T20:02:33 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 1, "x-ck12": 0, "texerror": 0, "math_score": 0.487128347158432, "perplexity": 534.8096031344496}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2023-14/segments/1679296948684.19/warc/CC-MAIN-20230327185741-20230327215741-00286.warc.gz"}
|
https://pos.sissa.it/358/298/
|
Volume 358 - 36th International Cosmic Ray Conference (ICRC2019) - CRI - Cosmic Ray Indirect
Energy Spectrum Measured by the Telescope Array
D. Ivanov* and On behalf of the Telescope Array collaboration
Full text: pdf
Pre-published on: July 22, 2019
Published on: July 02, 2021
Abstract
The Telescope Array (TA) is a cosmic ray detector in the Northern hemisphere that is sensitive to cosmic rays of energies ranging from ~2 PeV to 100 EeV and higher. The main TA consists of two types of detectors: a ground array of 507 plastic scintillation counters, that covers an area of ~700 km$^{2}$ area on the ground, and a fluorescence detector (FD), distributed among 3 stations, that overlooks the ground array. The TA Low Energy Extension (TALE) consists of 10 additional fluorescence telescopes, at one of the TA FD stations, that are pointed to view higher elevation angles, and an infill array of 103 plastic scintillation counters in the field of view of the telescopes. The main TA measures cosmic rays of energies from 1 EeV and higher, and the TALE extends the sensitivity of TA to ~2 PeV. In this work, we summarize the latest TA and TALE spectrum measurements.
DOI: https://doi.org/10.22323/1.358.0298
How to cite
Metadata are provided both in "article" format (very similar to INSPIRE) as this helps creating very compact bibliographies which can be beneficial to authors and readers, and in "proceeding" format which is more detailed and complete.
Open Access
Copyright owned by the author(s) under the term of the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
| 2021-09-26T13:47: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.30444392561912537, "perplexity": 3471.782463842909}, "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-39/segments/1631780057861.0/warc/CC-MAIN-20210926114012-20210926144012-00078.warc.gz"}
|
https://pos.sissa.it/429/016/
|
Volume 429 - The 6th International Workshop on Deep Learning in Computational Physics (DLCP2022) - Track3. Machine Learning in Natural Sciences
Short-length peptides contact map prediction using Convolution Neural Networks
A.D. Maminov
Full text: pdf
Pre-published on: November 14, 2022
Published on:
Abstract
In this article, it is considered an approach for predicting the contact matrix (contact map) for short-length peptides. Contact matrix is two-dimensional representation of the protein. It can be used for tertiary structure reconstruction or for starting approximation in energy minimization models. For this work, peptides with a chain length from 15 up to 30 were chosen to test the model and simplify the calculations. Convolutional neural networks (CNNs) were used as a prediction tool according to the fact that the feature space of each peptide is presented as a two-dimensional matrix. SCRATCH tool was used to generate the secondary structure, solvent accessibility, and profile matrix (PSSM) for each peptide. CNN was implemented in the Python programming language using the Keras library. To work with the common PDB-format, which presents the structure information of proteins, the BioPython module was used. As a result, training, validation and test samples were generated, the multilayer multi-output convolutional neural network was constructed, which was trained and validated. The experiments were conducted on a test sample to predict the contact matrix and compare it with native one. To assess the quality of prediction, conjunction matrices for the threshold of 8 and 12 $\dot A$ were formed, the metrics F1-score, recall and precision were calculated. According to F1-score, we can observe, that even with small neural network we can acheve quite good results. At the final step FT-COMAR tool was used to reconstruct tertiary structure of the proteins from its contact matrix. The results shows, that for reconstructed structures from 12 threshhold contact matrix, RMSD metric is better.
DOI: https://doi.org/10.22323/1.429.0016
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-12-03T06:13: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.4691392183303833, "perplexity": 1472.3374316966417}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.3, "absolute_threshold": 10, "end_threshold": 15, "enable": false}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2022-49/segments/1669446710924.83/warc/CC-MAIN-20221203043643-20221203073643-00789.warc.gz"}
|
https://www.itl.nist.gov/div898/software/dataplot/refman1/auxillar/fishrand.htm
|
Dataplot Vol 1 Vol 2
# FISHER TWO SAMPLE RANDOMIZATION TEST
Name:
FISHER TWO SAMPLE RANDOMIZATION TEST
Type:
Analysis Command
Purpose:
Perform a Fisher two sample randomization test for the equality of the means of two independent samples.
Description:
The two sample t-test is the standard test for the equality of the means from two samples. This test is based on the following aassumptions
1. the samples are randomly selected from infinite populations (equivalently the observations are independent)
2. the samples come from normal populations
3. the two populations have equal variances
Randomization tests can be used when these assumptions are questionable. Fisher introduced randomization tests (also referred to as permutation tests) in 1935.
The randomization test for the equality of the means for two samples is computed as follows:
1. Given that sample one has n1 observations and sample two has n2 observations, randomly assign the n1 + n2 observations so that n1 observations are assigned to sample one and n2 observations and compute the difference of the means. This is a single permuation for the test.
2. Generate all possible permutations of the n1 + n2 observations and compute the difference of the means for each permutation. The number of permutations is $$\left( \begin{array}{c} n1 \\ n2 \end{array} \right) = \frac{n1!}{n2!(n1-n2)!}$$. Call this value NTOTAL for subsequent steps.
3. Let DFULL denote the difference of the means for the original samples. Let Di denote the difference of the means for the i-th sample. Then the following p-values can be computed
$$p(\mbox{upper tail}) = \frac{\mbox{number of } D_{i} \hspace{0.1 in} \ge \hspace{0.1 in} \mbox{DFULL}} {\mbox{NTOTAL}}$$
$$p(\mbox{lower tail}) = \frac{\mbox{number of } D_{i} \hspace{0.1 in} \le \hspace{0.1 in} \mbox{DFULL}} {\mbox{NTOTAL}}$$
$$p(\mbox{two tailed}) = \frac{\mbox{number of } |D_{i}| \hspace{0.1 in} \ge \hspace{0.1 in} \mbox{DFULL}} {\mbox{NTOTAL}}$$
The primary drawback to this test is that NTOTAL grows rapidly as n1 and n2 increase. A test based on the full set of permutations may be computationaly prohibitive except for relatively small samples. For larger n1 and n2, one approach is to generate a random subset of the complete set of permutations (typically on the order of 4,000 to 10,000 random subsets will be generated).
For this command, Dataplot is using the algorithm of Richards and Byrd. This algorithm generates the complete set of permutations. The advantage of this algorithm is that exact p-values are obtained for one-tailed tests and also for two-tailed tests when n1 = n2. If n1 is not equal n2, an approximate p-value is obtained for the two-tailed test. The primary drawback is that this test is limited to small sample sizes. Dataplot currently limits the maximum value of n1 and n2 to be 22. See the Note section below for some guidance to generating this test for larger samples based on randomly sampling the permutations.
If the two samples are not randomly drawn from larger populations, the inference will be valid for the observations under study but not necesarily for the populations from which the observations are drawn.
Syntax 1:
FISHER TWO SAMPLE RANDOMIZATION TEST <y1> <y2>
<SUBSET/EXCEPT/FOR qualification>
where <y1> is the first response variable;
<y2> is the second response variable;
and where the <SUBSET/EXCEPT/FOR qualification> is optional.
The <y1> and <y2> need not be the same length.
Either <y1> or <y2> (or both) may be matrix arguments. If a matrix argument is given, the response variable will consist of all observations in that matrix. Although matrix arguments are allowed, they are rarely used for this command due to limitation on the size of the response variable.
Syntax 2:
FISHER TWO SAMPLE RANDOMIZATION TEST <y1> ... <yk>
<SUBSET/EXCEPT/FOR qualification>
where <y1> ... <yk> is a list of 1 to 30 response variables;
and where the <SUBSET/EXCEPT/FOR qualification> is optional.
This syntax will implement all the pairwise Fisher two sample randomization tests for the listed response variables. For example,
FISHER TWO SAMPLE RANDOMIZATION TEST Y1 TO Y4
is equivalent to
FISHER TWO SAMPLE RANDOMIZATION TEST Y1 Y2
FISHER TWO SAMPLE RANDOMIZATION TEST Y1 Y3
FISHER TWO SAMPLE RANDOMIZATION TEST Y1 Y4
FISHER TWO SAMPLE RANDOMIZATION TEST Y2 Y3
FISHER TWO SAMPLE RANDOMIZATION TEST Y2 Y4
FISHER TWO SAMPLE RANDOMIZATION TEST Y3 Y4
The <y1>, ..., <yk> need not be the same length.
Any of the listed response variables may be matrix arguments. If a matrix argument is given, the response variable will consist of all observations in that matrix. Although matrix arguments are allowed, they are rarely used for this command due to limitation on the size of the response variable.
Examples:
FISHER TWO SAMPLE RANDOMIZATION TEST Y1 Y2
FISHER TWO SAMPLE RANDOMIZATION TEST Y1 TO Y4
Note:
According to Franks and Byrd, this test can also be used to obtained p-values for the Wilcoxon signed rank test and the Mann-Whitney rank sum test for small samples. These tests are essentially Fisher's test applied to the ranks of the original observations. So you can generate the ranks of the data (the ranks are based on the combined data) and apply the FISHER TWO SAMPLE RANDOMIZATION TEST to the ranked data.
Note:
Dataplot saves the following internal parameters after this test:
STATVALU = the value of the test statistic
PVALUE = the p-value for the two-sided test
PVALUELT = the p-value for the lower tailed test
Note:
The following statistics are also supported:
LET A = FISHER TWO SAMPLE RANDOMIZATION TEST Y1 Y2
LET A = FISHET TWO SAMPLE RANDOMIZATION TEST PVALUE Y1 Y2
In addition to the above LET command, built-in statistics are supported for about 20+ different commands (enter HELP STATISTICS for details).
Note:
This test is specific to the two sample location test and generates all possible permutations of the data. For that reason, it is restricted to small sample sizes (currently a maximum sample size of 22 is allowed).
The SAMPLE RANDOM PERMUTATION command can be used to implement other randomization tests (and to accomodate sample sizes greater than allowed here). The Program 2 and Program 3 examples demonstrate this. Although these examples demonstrate the difference of means statistic, other statistics can be easily substituted into these examples.
Default:
None
Synonyms:
None
Related Commands:
T-TEST = Compute a t-test. SIGN TEST = Compute a sign test. SIGNED RANK TEST = Compute the Wilcoxon signed rank test. RANK SUM TEST = Perform a Mann-Whitney rank sum test. CHI-SQUARED 2 SAMPLE TEST = Compute a two sample chi-square test. BIHISTOGRAM = Generates a bihistogram. QUANTILE-QUANTILE PLOT = Generate a quantile-quantile plot. BOX PLOT = Generates a box plot.
Reference:
Richards and Byrd (1996), "Fisher's Randomization Test for Two Small Independent Samples", Applied Statistics, Vol. 45, No. 3, pp. 394-398.
Fisher (1935), "Design of Experiments", Edinburgh: Oliver and Boyd.
Conover (1999), "Practical Non-Parametric Statistics", Third Edition, Wiley, p. 410.
Higgins (2004), "Introduction to Modern Nonparametric Statistics", Thomson/Brooks/Cole, Duxbury Advanced Series, Chapter 2.
Applications:
Nonparameteric statistics, two sample problem
Implementation Date:
2011/06
Program:
. Example from p. 410 of Convover (1999), "Practical Nonparametric
. Statistics", Third Edition, Wiley.
.
let y1 = data 0 1 1 0 -2
let y2 = data 6 7 7 4 -3 9 14
let y3 = data 9 2 3 5 7
let y4 = data 6 8 9 12 15
set write decimals 5
.
let t = fisher two sample rand test y1 y2
let pval = fisher two sample rand test pvalue y1 y2
.
print t pval
.
fisher two sample rand test y1 y2
fisher two sample rand test y1 y2 y3 y4
The following output is generated
PARAMETERS AND CONSTANTS--
T -- 0.00000
PVAL -- 0.02778
Two Sample Two-Sided Fisher Randomization Test
(Independent Samples)
First Response Variable: Y1
Second Response Variable: Y2
H0: E(X) = E(Y)
Ha: E(X) <> E(Y)
Summary Statistics:
Sample with Smaller Mean:
Number of Observations: 5
Mean: 0.00000
Sum of Observations: 0.00000
Sample with Larger Mean:
Number of Observations: 7
Mean: 6.28571
Sum of Observations: 44.00000
Difference of Means: -6.28571
Test Statistic: 0.00000
Approximate P-Value (two-tailed test): 0.02778
Exact P-Value (lower-tailed test): 0.01389
Two Sample Two-Sided Fisher Randomization Test
(Independent Samples)
First Response Variable: Y1
Second Response Variable: Y2
H0: E(X) = E(Y)
Ha: E(X) <> E(Y)
Summary Statistics:
Sample with Smaller Mean:
Number of Observations: 5
Mean: 0.00000
Sum of Observations: 0.00000
Sample with Larger Mean:
Number of Observations: 7
Mean: 6.28571
Sum of Observations: 44.00000
Difference of Means: -6.28571
Test Statistic: 0.00000
Approximate P-Value (two-tailed test): 0.02778
Exact P-Value (lower-tailed test): 0.01389
Two Sample Two-Sided Fisher Randomization Test
(Independent Samples)
First Response Variable: Y1
Second Response Variable: Y3
H0: E(X) = E(Y)
Ha: E(X) <> E(Y)
Summary Statistics:
Sample with Smaller Mean:
Number of Observations: 5
Mean: 0.00000
Sum of Observations: 0.00000
Sample with Larger Mean:
Number of Observations: 5
Mean: 5.20000
Sum of Observations: 26.00000
Difference of Means: -5.20000
Test Statistic: 0.00000
Approximate P-Value (two-tailed test): 0.00794
Exact P-Value (lower-tailed test): 0.00397
Two Sample Two-Sided Fisher Randomization Test
(Independent Samples)
First Response Variable: Y1
Second Response Variable: Y4
H0: E(X) = E(Y)
Ha: E(X) <> E(Y)
Summary Statistics:
Sample with Smaller Mean:
Number of Observations: 5
Mean: 0.00000
Sum of Observations: 0.00000
Sample with Larger Mean:
Number of Observations: 5
Mean: 10.00000
Sum of Observations: 50.00000
Difference of Means: -10.00000
Test Statistic: 0.00000
Approximate P-Value (two-tailed test): 0.00794
Exact P-Value (lower-tailed test): 0.00397
Two Sample Two-Sided Fisher Randomization Test
(Independent Samples)
First Response Variable: Y2
Second Response Variable: Y3
H0: E(X) = E(Y)
Ha: E(X) <> E(Y)
Summary Statistics:
Sample with Smaller Mean:
Number of Observations: 5
Mean: 6.28571
Sum of Observations: 26.00000
Sample with Larger Mean:
Number of Observations: 7
Mean: 5.20000
Sum of Observations: 44.00000
Difference of Means: 1.08571
Test Statistic: 26.00000
Approximate P-Value (two-tailed test): 0.72222
Exact P-Value (lower-tailed test): 0.36111
Two Sample Two-Sided Fisher Randomization Test
(Independent Samples)
First Response Variable: Y2
Second Response Variable: Y4
H0: E(X) = E(Y)
Ha: E(X) <> E(Y)
Summary Statistics:
Sample with Smaller Mean:
Number of Observations: 5
Mean: 5.20000
Sum of Observations: 26.00000
Sample with Larger Mean:
Number of Observations: 5
Mean: 10.00000
Sum of Observations: 50.00000
Difference of Means: -4.80000
Test Statistic: 26.00000
Approximate P-Value (two-tailed test): 0.06349
Exact P-Value (lower-tailed test): 0.03175
Two Sample Two-Sided Fisher Randomization Test
(Independent Samples)
First Response Variable: Y3
Second Response Variable: Y4
H0: E(X) = E(Y)
Ha: E(X) <> E(Y)
Summary Statistics:
Sample with Smaller Mean:
Number of Observations: 5
Mean: 5.20000
Sum of Observations: 26.00000
Sample with Larger Mean:
Number of Observations: 5
Mean: 10.00000
Sum of Observations: 50.00000
Difference of Means: -4.80000
Test Statistic: 26.00000
Approximate P-Value (two-tailed test): 0.06349
Exact P-Value (lower-tailed test): 0.03175
NIST is an agency of the U.S. Commerce Department.
Date created: 12/18/2017
Last updated: 12/18/2017
| 2022-07-04T22:08: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": 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.7204393744468689, "perplexity": 8748.75889546807}, "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/1656104496688.78/warc/CC-MAIN-20220704202455-20220704232455-00574.warc.gz"}
|
http://www.legisquebec.gouv.qc.ca/en/showversion/cs/E-2.2?code=se:383&pointInTime=20200407
|
### E-2.2 - Act respecting elections and referendums in municipalities
383. In no case may an official representative, his delegate, an official agent or his deputy be a person who
(1) is not an elector of the municipality;
(2) is a candidate for the office of member of the council of the municipality, except an authorized independent candidate who designates himself as official agent and representative;
(3) is the leader of a party carrying on its activities in the territory of the municipality;
(4) is an election officer of the municipality or an employee of such an election officer;
(5) is an officer or employee of the municipality or of a mandatary body of the municipality referred to in paragraph 1 or 2 of section 307;
(6) is the chief electoral officer or a member of his personnel;
(7) is convicted of an offence that is a corrupt electoral practice within the meaning of section 645, the Act respecting school elections (chapter E-2.3) or the Election Act (chapter E-3.3).
Disqualification under subparagraph 7 of the first paragraph shall continue for five years from the day on which the judgment convicting the person becomes a res judicata.
1987, c. 57, s. 383; 1989, c. 1, s. 600; 1990, c. 4, s. 408; 2002, c. 37, s. 180; 2005, c. 28, s. 89.
383. In no case may an official representative, his delegate, an official agent or his deputy be a person who
(1) is not an elector of the municipality;
(2) is a candidate for the office of member of the council of the municipality;
(3) is the leader of a party carrying on its activities in the territory of the municipality;
(4) is an election officer of the municipality or an employee of such an election officer;
(5) is an officer or employee of the municipality or of a mandatary body of the municipality referred to in paragraph 1 or 2 of section 307;
(6) is the chief electoral officer or a member of his personnel;
(7) is convicted of an offence that is a corrupt electoral practice within the meaning of section 645 or the Election Act (chapter E-3.3).
Disqualification under subparagraph 7 of the first paragraph shall continue for five years from the day on which the judgment convicting the person becomes a res judicata.
1987, c. 57, s. 383; 1989, c. 1, s. 600; 1990, c. 4, s. 408; 2002, c. 37, s. 180.
383. In no case may an official representative, his delegate, an official agent or his deputy be a person who
(1) is not an elector of the municipality;
(2) is a candidate for the office of member of the council of the municipality;
(3) is the leader of a party carrying on its activities in the territory of the municipality;
(4) is an election officer of the municipality or an employee of such an election officer;
(5) is an officer or employee of the municipality;
(6) is the chief electoral officer or a member of his personnel;
(7) is convicted of an offence that is a corrupt electoral practice within the meaning of section 645 or the Election Act (chapter E-3.3).
Disqualification under subparagraph 7 of the first paragraph shall continue for five years from the day on which the judgment convicting the person becomes a res judicata.
1987, c. 57, s. 383; 1989, c. 1, s. 600; 1990, c. 4, s. 408.
383. In no case may an official representative, his delegate, an official agent or his deputy be a person who
(1) is not an elector of the municipality;
(2) is a candidate for the office of member of the council of the municipality;
(3) is the leader of a party carrying on its activities in the territory of the municipality;
(4) is an election officer of the municipality or an employee of such an election officer;
(5) is an officer or employee of the municipality;
(6) is the chief electoral officer or a member of his personnel;
(7) pleads guilty to or is convicted of an offence that is a corrupt electoral practice within the meaning of section 645 or the Election Act (chapter E-3.3).
Disqualification under subparagraph 7 of the first paragraph shall continue for five years from the day on which the judgment convicting the person becomes a res judicata.
1987, c. 57, s. 383; 1989, c. 1, s. 600.
383. In no case may an official representative, his delegate, an official agent or his deputy be a person who
(1) is not an elector of the municipality;
(2) is a candidate for the office of member of the council of the municipality;
(3) is the leader of a party carrying on its activities in the territory of the municipality;
(4) is an election officer of the municipality or an employee of such an election officer;
(5) is an officer or employee of the municipality;
(6) is the chief electoral officer or a member of his personnel;
(7) pleads guilty to or is convicted of an offence that is a corrupt electoral practice within the meaning of section 645 or the Election Act (chapter E-3.2).
Disqualification under subparagraph 7 of the first paragraph shall continue for five years from the day on which the judgment convicting the person becomes a res judicata.
1987, c. 57, s. 383.
| 2020-05-28T22:22:16 |
{"extraction_info": {"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.8184728622436523, "perplexity": 6346.298528122385}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 20, "end_threshold": 5, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2020-24/segments/1590347400101.39/warc/CC-MAIN-20200528201823-20200528231823-00035.warc.gz"}
|
https://www.legisquebec.gouv.qc.ca/en/version/cs/d-15.1?code=se:5&history=20220622
|
### D-15.1 - Act respecting duties on transfers of immovables
5. The transferor shall be jointly and severally liable for payment of the transfer duties with the transferee in the following cases:
(a) if the amount of the consideration furnished by the transferee for the transfer of the immovable exceeds the amount mentioned in the application for registration in accordance with subparagraph e of the first paragraph of section 9 or in the notice of disclosure referred to in the second paragraph of section 6 or 6.1;
(a.1) if the amount of the consideration furnished by the transferee for the transfer of movables referred to in section 1.0.1 exceeds the amount mentioned in the declaration provided for in the second paragraph of any of sections 9, 10.1 and 10.2; or
(b) if the transferor is guilty of an offence under section 23.
1976, c. 30, s. 5; 1993, c. 78, s. 24; 2017, c. 1, s. 28.
5. The transferor shall be jointly and severally liable for payment of the transfer duties with the transferee in the following cases:
(a) if the amount of the consideration furnished by the transferee for the transfer of the immovable exceeds the amount mentioned in the application for registration in accordance with subparagraph e of the first paragraph of section 9;
(a.1) if the amount of the consideration furnished by the transferee for the transfer of movables referred to in section 1.0.1 exceeds the amount mentioned in the declaration provided for in the second paragraph of section 9;
(b) if the transferor is guilty of an offence under section 23.
1976, c. 30, s. 5; 1993, c. 78, s. 24.
5. The transferor shall be jointly and severally liable for payment of the transfer duties with the transferee in the following cases:
(a) if the consideration furnished by the transferee exceeds the amount of such consideration which is mentioned in the deed of transfer, but only for that portion of the transfer duties which is applicable to the amount in excess;
(b) if the transferor is guilty of an offence under section 23.
1976, c. 30, s. 5.
| 2022-08-15T06:48: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.8610270023345947, "perplexity": 2493.134732842081}, "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/1659882572161.46/warc/CC-MAIN-20220815054743-20220815084743-00231.warc.gz"}
|
http://gyrh.clicksmart.it/probability-marbles-in-a-bag-simulator.html
|
Press +1 to throw the coin. Given that the third is also red there now remain 17 marbles in the bag but only two red. Megan wants to know what her probability is of drawing a pink marble out of her bag. For example, if we pick 2 marbles from a bag there are different possibilities of what we could do: • Probability With Replacement We take a marble put it back into the bag and pick another one. What is the probability of drawing a gray marble? 4 out of 7 4. Yet another simulator is the O. In the tree diagram, does the probability of getting. A bag contains 6 red marbles, 3 blue marbles and 7 green marbles. i A red marble and then a blue marble probability of one red marble is 0. Use these marble bag probability worksheets to help your students develop their understanding of probability. A Bag of Marbles (French: Un sac de billes) is a Second World War autobiographical novel by the French Jewish author Joseph Joffo. Basic concept on drawing a card: In a pack or deck of 52 playing cards, they are divided into 4 suits of 13 cards each i. Probability and other junk I got from my teacher. A bag has 5 red marbles, 6 blue marbles and 4 black marbles. (Related resources available under the learner tab. Library of Congress Cataloging-in-Publication Data: Dworsky, Lawrence N. Free delivery on millions of items with Prime. Obviously you wouldn’t pay $2 for the bag without being certain that both marbles are blue. Thus, calculate the probability that the marbles are the same color, then subtract this probability from 1 to find the probability they are different colors. Example 2 The probability of simultaneous occurrence of at least one of two events A and B is p. Probability Spinners (Basic) FREE. You have a bag of 3 red marbles and 2 blue marbles. Remove a broken key from a lock. com Don’t Memorise brings learning to life through its captivating FREE educational videos. SEE MORE : 9. one-ninth D. From the conditional probability formula P(A|B) = P(A ∩ B) / P(B), this is the number of times we chose the bag with two white marbles and drew a white marble first (1/3) divided by the total number of times we drew a white marble first no matter which bag we chose (1/3+1/6), or 1/3 divided by 3/6, which is 2/3. If the bag contains 4 red marbles and 6 white marbles, how many blue marbles must it contain? d. First published 7th of August, 2012. Lewis Carroll's Pillow Problem. What is the probability that I get a red marble? Events: A = Marble is red B2 = Bag 2 was chosen in the first step. If I ever write a different non-frames version, I'll put a link to it here. Ask Now !. Probability Models A probability model is a mathematical representation of a random phenomenon. We want to find the probability of drawing a red one at random. The probability space. Simon used a probability simulator to pull 3 colored marbles from a bag and flip a coin 50 times. Yasmine returns the marble to the bag and adds five more red marbles to the bag. The bag represents a population of bacteria and the different colors the two types of bacteria in that population, which carry two different alleles of a gene. Say there are two bags of marbles. Golly, Mom is right!. So, I'm trying to simulate an arbitrary model of a bag of marbles (with replacement, if that makes a difference in how this works) and am running into issues displaying the results. The probability is 5 ÷ 20 = 1/4. What is the probability of pulling out a red or a green marble? 2. A bag contains 8 red marbles, 5 white marbles, and 10 blue marbles. In the example, 12 x 0. I'm homeschooling my granddaughter and we're stumped. [1/5] Ed Balls was clear, and Labour’s position is clear: we want fewer. This year’s Word of the Year, however, is extra special: 2019 is not only the end of the decade, but it also marks 10 years of doing Word of the. Given that the third is also red there now remain 17 marbles in the bag but only two red. Total number of red and green marbles = 3 + 2 = 5. Given in a bag contains five green marbles, three blue marbles, two red marbles and two yellow marbles (a)The four colour out comes not equally because the number of four colours balls are different. We are also labelling two variables (number of marbles and whole bag of marbles) using a linear model called a double-number line. 24 Air Hunter 1. The results are shown in the tables below:Color of Marble Number of Times RolledBlue 15Green 19Yellow 16Heads Tails26 24Using Simon's simulation, what is the probability of pulling a blue marble and. The bean bag toss is just one of the games that achieve this underlying development of mental and physical agility. Low prices across earth's biggest selection of books, music, DVDs, electronics, computers, software, apparel & accessories, shoes, jewelry, tools & hardware, housewares, furniture, sporting goods, beauty & personal care, groceries & just about anything else. This is an interactive adventure based on the works of Edgar Allan Poe featuring the voice of William S. Example 2 The probability of simultaneous occurrence of at least one of two events A and B is p. a) Find the probability of choosing C and then M. There is about 3% chance of grabbing a white and. The closer the probablity of an event is to 1, the less likely it is to happen. Two years in the making. And so this is sometimes the event in question, right over here, is picking the yellow marble. If this is done 3 times, the probability is (7/16)(7/16)(7/16) = 0. • Develop probability models for uniform and non-uniform probabilities. Remember: do NOT open the zipper-lock bags… ever! When you’re finished analyzing the cultures, dispose of the entire sealed bag in the trash. The probability of drawing a green marble is. Basic concept on drawing a card: In a pack or deck of 52 playing cards, they are divided into 4 suits of 13 cards each i. The Mane Six, Spike, and the two alicorn princesses are sucked into an alien world. 20 von Christel. It is defined by its sample space, events within the sample space, and probabilities associated with each event. A bag contains 18 red marbles, 16 purple marbles, 12 yellow marbles, 9 green marbles, and 13 blue marbles. possibility = 8/20 = 2/5 B. Once a marble is drawn, it is replaced. P(blue marble) 6. The multiplication rule also deals with two events, but in these problems the events occur as a result of more than one task (rolling one die then another, drawing two cards, spinning a spinner twice. A bag contains 5 red and 3 blue marbles. A "random" distribution in a deck would, in particular, have no more pattern in it than might be "expected". Pupils determine the number of four colors of marbles in a bag and how many marbles to draw. So we have a bag with 9 red marbles, 2 blue marbles, and 3 green marbles in it. Two seniors, one from each government class are randomly selected to travel to Washington, D. Probability = the number of wanted outcomes/the number of possible outcomes. 1> probability the car was behind one of the 2 doors = 2/3. For the bag of marbles below, there are 7 favor-able outcomes for the event of drawing a green marble because there are 7 green marbles in the bag. · Today I’ve brought mystery probability bags that you’re going to have to be able to describe the probability of the colored tiles that are in your bag. The actual number of red could be 1 in a total of 5, or 2 in a total of. For example, use random digits as a simulation tool to approximate the answer to the question: If 40% of donors have type A blood, what is the probability that it will take at least. Another bag with 9 blue marbles has the same ratio of blue to white marbles as the first bag. 24 Air Hunter 1. All four books are available on Amazon, and the two e-books are available in multiple formats on Amazon and IPG. Four red marbles represent winning and 1 blue marble represents losing. What is the probability that I get a red marble? Events: A = Marble is red B2 = Bag 2 was chosen in the first step. From the conditional probability formula P(A|B) = P(A ∩ B) / P(B), this is the number of times we chose the bag with two white marbles and drew a white marble first (1/3) divided by the total number of times we drew a white marble first no matter which bag we chose (1/3+1/6), or 1/3 divided by 3/6, which is 2/3. I'm homeschooling my granddaughter and we're stumped. advanced numerological code made easy with revised code keys[Because FBI online agents are inefficient at code, darpa. In one bag you have 5 blue marbles and 5 red marbles. Basic concept on drawing a card: In a pack or deck of 52 playing cards, they are divided into 4 suits of 13 cards each i. " The probability of this is: number of red marbles (the chances of our event) ----- total marbles in jar (the number of total chances) In our example, this is 4/10 which is 2/5, reduced. We need to also see how you came up with your answer, please. Directions: There are _____ red marbles and _____ blue marbles in Bag A. 1-2-3 Spyware Free 4. WILL MARK BRAINLIEST IF POSSIBLE Cathy used a probability simulator to pull 3 colored marbles from a bag and flip a coin 50 times. Suppose now we add a third color of marble to the mix. A bag contains 100 malbles, some red and some purple. The multiplication rule also deals with two events, but in these problems the events occur as a result of more than one task (rolling one die then another, drawing two cards, spinning a spinner twice. Free delivery on millions of items with Prime. So that's my bag, and we're going to assume that it's a transparent bag, so it looks like a vase. First set up your calculator: 2. When we flip a coin there is always a probability to get a head or a tail is 50 percent. Draw the boy-girl tree for a family of two children and write out the probability distribution table. 072811 ----- With these kinds of problems be very clear to define what you want, be aware of whether order will matter, and if you can, try to calculate the answer more than one way as a double-check. In a standard deck of 52 playing cards, what is the probability that you will draw a heart? Reduce you answer, if possible. A yellow marble and then a blue marble are. 1-2-3 Spyware Free 4. Marble Probability Simulation. Vidal does not replace marbles after each draw. What is the probability of pulling out a red or a green marble? 2. Normal Curve Demonstration; Binomial Distribution with Normal Approximation; Student-t vs. There are two green marbles and one purple marble. What is the theoretical probability of drawing a blue marble? Explain your reasoning. How many different combinations of 3 colors are possible? (note 4th grade math no. A bag contains 12 marbles. If one marble is chosen, what is the probability that it will be green? Solution Divide the number of ways to choose a green marble (68) by the total number of marbles (87) 68 ÷ 87 = 0. The student has recorded 9 red marbles and I I purple marbles. You get one attempt at each bag (2 total attempts). Find the probability. Could the bag contain 60 marbles? If so, how many of each color must it contain? c. Basic math trivias, solving problems rational algebraic exprssions, algebra simplifying tricks. It's a Turing-complete mechanical computer powered by marbles! Builds on many ideas from the 1960's toy, the Digi-Comp II. 1200-year-old problem 'easy' Schoolchildren from Caversham have become the first to learn a brand new theory that dividing by zero is possible using a new number - 'nullity'. This page lists every MSPAForums. 4 Independent and Dependent Events Work with a partner. The amount of marbles to be pulled out of the bag is sample. A red marble is chosen at random and replaced, and then the SAME red marble is chosen at random again. Mixer in Figure 1 is similar to a bag of marbles, where the balls are the same size and shape and sample space is altered by adding additional balls to the Mixer. These printable math worksheets will help students learn about probability of random events. 1-2-3 Spyware Free 4. The results are shown in the tables below:Color of Marble Number of Times RolledBlue 15Green 19Yellow 16Heads Tails26 24Using Simon's simulation, what is the probability of pulling a blue marble and. What is the probability that you will pick a pink marble? What is 10/23. A number cube has 6 sides. For example, use random digits as a simulation tool to approximate the answer to the question: If 40% of donors have type A blood, what is the probability that it will take at least. • Develop probability models for uniform and non-uniform probabilities. Lesson 2-H ~ Compound Probabilities Using Multiplication & Simulation 39 12. This problem is cited by M. pdf), Text File (. That means that each marble, regardless of color, has a chance of being picked, as shown in the images below. A bag contains 10 marbles: 5 yellow, 3 red and 2blue. From the conditional probability formula P(A|B) = P(A ∩ B) / P(B), this is the number of times we chose the bag with two white marbles and drew a white marble first (1/3) divided by the total number of times we drew a white marble first no matter which bag we chose (1/3+1/6), or 1/3 divided by 3/6, which is 2/3. Outcome 2: The probability is 5/36, and the frequency is 2. a marble is taken at random and replaced. What is the probability of choosing a brown marble? There are no brown marbles in the bag. !!unk !colon !comma !dash !double-quote !ellipsis !exclamation-point !hyphen !left-brace !left-paren !period !question-mark !right-brace !right-paren !semi-colon. The next stage of human development, which is the adolescent stage or in layman terms, the 'teenage' years, elevates to a more complicated type of development. TLF-IDL2378; Race two cars along a track. If marbles are drawn at random from the bag, what is the probability of drawing the following colored marbles in the order indicated: red, blue, blue, red. The amount of marbles to be pulled out of the bag is sample. So you ask if you can check. And so this is sometimes the event in question, right over here, is picking the yellow marble. Change the number of marbles of different colors in the boxes and guess the probability of drawing a red blue or yellow marble. P(black) P(blue) P(blue or black) P(not green). Answer: The probability is 30% or 0. Click Image to Enlarge : Use a tree diagram to display possible outcomes of who will come to the party. three-tenth 8. WILL MARK BRAINLIEST IF POSSIBLE Cathy used a probability simulator to pull 3 colored marbles from a bag and flip a coin 50 times. following probabilities based upon this scenario. 25 = 3, so Jimmy should get a blue marble three out of the 12 times he tries to grab marbles from his bag. You get one attempt at each bag (2 total attempts). It is an opportunity for us to reflect on the language and ideas that represented each year. A bag contains 3 red marbles, 2 blue marbles, and 1 green marble. Randomly pick one. Change the number of marbles of different colors in the boxes and guess the probability of drawing a red blue or yellow marble. Consider an opaque bag with 5 green marbles, 3 blue marbles, and 2 red marbles. Just a boy being himself and trying to make you laugh. A bag contains 10 red marbles, 3 green marbles and 2 white marbles. Example 2: A jar contains 4 blue marbles, 5 red marbles and 11 white marbles. When this occurs, the probability that that particular color will be landed on will change. Press +1 to throw the coin. It is a movie registered for one week until '. Complete the probability distribution table for drawing 1 marble out of the bag. Browse our listings to find jobs in Germany for expats, including jobs for English speakers or those in your native language. I am trying to calculate the probability of something. From the decade of big hair, excess, and pastel suits comes a story of one man's rise to the top of the criminal pile. The Mixer simulates randomness visually by bouncing the balls around the bag and releasing an outcome out of the bottom of the bag. How I have it set up is the code asks for how many marbles are in the bag, the how many you would like to pick, and then how many different colors there are. Extension: Change the problem such that the number of green marbles is a. Me Too Probability. So our event is "drawing a red marble. Marbles and Bags. at this point, you are allowed to redistribute the marbles however you wish (e. She did this 21 times. If they are simulation. This page lists every MSPAForums. Question 324522: In a bag of 10 marbles, there are 5 blue marbles, 3 red marbles, and 2 white marbles. (If you get too many/few you try again. The probability of one dice not being either of two numbers is 4/6, so the probability of both dice fitting this condition is 4/6 x 4/6 = 16/36. TLF-IDL2378; Race two cars along a track. For more information about Wiley products, visit our web site at www. In simulations a model is chosen marbles must be 1:5 since the probability of choosing a red is 1:5. The event that the marbles are different colors is the complement of the event that the marbles are the same color. What is the probability of randomly selecting a non-blue marble from of the bag? So let's draw this bag here. There are two green marbles and one purple marble. Given that it is a red, there now remain 18 marbles in the bag and 3 are red. the number of marbles in bag in the bag of marbles example; The "Desirables" are the number of desirable objects within the space, so, if you have a bag of marbles, and 30 of them are red and 60 of them are blue, and you want a red one, 30 would be your "desirables" number. Suppose a coin tossed then we get two possible outcomes either a ‘head’ ( H ) or a ‘tail’ ( T ), and it is impossible to predict whether the result of a toss will be a. A study in 2019 used CBD to treat people who have been battling anxiousness and sleep. For example, suppose there are 5 marbles in a bowl. I read that Isaac Hayes, also know as chef has quit south park because they did an episode mocking scientology; for which he is a member. Raj takes at random 3 marbles from the bag. net] has quit [Quit: Leaving] 2020-01-01T00:10:21 Steffanx> Why zyp. The man with the bag says that both marbles are indeed blue and asks for$2 for the bag. Bag B contains 9 black marbles and 6 orange marbles. Solution there are 5 in total 4 are Blue so 4/5 or80% Is it right? thanks. Probability Tools. It may be assumed that items are handed in to the office randomly. relatively easy: MARBLE JARS I: you are a prisoner in a foreign land. taking account of all sources of uncertainty including model and simulator imperfections. But we have 9 red marbles, so let me draw 9 red marbles. For more information about Wiley products, visit our web site at www. Marble Probability Simulation. There are two types of marbles, red and green (in the following implementations the marbles are represented as True and False). Step 3: Multiply the probabilities together to determine the probability of both events occurring. Then, after showing that the probability of. The problem asks for the probability of (RR) or (BB). Say there are two bags of marbles. Flipping the second coin, the theoretical probability of getting heads is again 1 2. A bag contains four red marbles, five green marbles and six blue marbles, all of which are indistinguishable except for their colour. Definition: Example: An experiment is a situation involving chance or probability that leads to results called outcomes. Probability tells us how often some event will happen after many repeated trials. Parameters: Number and color of marbles in the bag, replacement rule. How many different combinations of 3 colors are possible? (note 4th grade math no. Probability Examples A jar contains 30 red marbles, 12 yellow marbles, 8 green marbles and 5 blue marbles What is the probability that you draw and replace marbles 3 times and you get NO red marbles? There are 55 marbles, 25 of which are not red P(getting a color other than red) = P(25/55) ≈. The probability that the third is red = 3/18. Bag 1 contains $10$ blue marbles, while Bag 2 contains $15$ blue marbles. Image Transcriptionclose. The marble is blue. com Don’t Memorise brings learning to life through its captivating FREE educational videos. You have a bag of 3 red marbles and 2 blue marbles. CN 85 Fundamental Counting Principle. New videos EVERY OTHER DAY at 3pm PST / 6pm EST :) Reacting , funny family friendly videos , messed up. Example 2 - Probability with Marbles. P(yellow marble) 7. A white counter is put in, the bag is shaken, and a counter is drawn out, which proves to be white. Given in a bag contains five green marbles, three blue marbles, two red marbles and two yellow marbles (a)The four colour out comes not equally because the number of four colours balls are different. A growing bank of randomly generated GCSE exam style questions with full worked solutions. What is the probability that you will draw a red marble and then a blue marble? Challenge Problem. When we flip a coin there is always a probability to get a head or a tail is 50 percent. There is about 3% chance of grabbing a white and. Complete this Self Check by yourself. P(C, then M) = b) Suppose another 26 cards lettered A-Z are put in the bucket. Click Image to Enlarge : Use a tree diagram to display possible outcomes of who will come to the party. It would not be wrong to say that the journey of mastering statistics begins with probability. 1> probability the car was behind one of the 2 doors = 2/3. Describe the probability of picking a yellow marble. Free delivery on millions of items with Prime. there are two jars, one with 50 white marbles, and one with 50 black marbles. The probability of one dice not being either of two numbers is 4/6, so the probability of both dice fitting this condition is 4/6 x 4/6 = 16/36. Suppose a student, without looking. After you achieve the SR point, Alto angrily flies over to a random point in space and shoots at it. To simulate a drawing of 4 marbles, without replacement, from the bag, we could do the following: Suppose the probability of a boy being born is $0. Bag B contains 9 black marbles and 6 orange marbles. Then, after showing that the probability of. Probability tells us how often some event will happen after many repeated trials. You have three marbles in a bag. If the bag contains 4 red marbles and 6 white marbles, how many blue marbles must it contain? d. Get YouTube TV Best of YouTube Music Sports Gaming Movies & Shows News Live Fashion Learning Spotlight 360° Video Browse channels Sign in to like videos, comment, and subscribe. Example Question #1 : How To Find The Probability Of An Outcome Mike has a bag of marbles, 4 white, 8 blue, and 6 red. *d) Find the probability that a randomly chosen smoker died of heart disease. Trainz Simulator 12 - BR Class 14 DLC. It is an opportunity for us to reflect on the language and ideas that represented each year. After you achieve the SR point, Alto angrily flies over to a random point in space and shoots at it. What is the probability that all the marbles are red? Ans: 8C5/23C5 = 0. Outcome Probability C02_SP_M04_T01. The man says you can check one marble only, but you are allowed to manipulate the bag in any way that you wish. Bag 2 now contains 3 white marbles, 7 black marbles, and 5 gray marbles. Bag of Marbles; Coin Flip Simulation; Dice Roll Simulation; acertar en la diana - 3; Probability Distributions. Find the probability of pulling a yellow marble from a bag with 3 yellow, 2 red, 2 green, and 1 blue-- I'm assuming-- marbles. In the problem above, the experiment is spinning the spinner. 25 Therefore, the probability in that order is 0. Megan wants to know what her probability is of drawing a pink marble out of her bag. Change the number of marbles of different colors in the boxes and guess the probability of drawing a red blue or yellow marble. If the probability is equal to zero, that means it can never happen. The reason this is a combination is because you can clearly see the "set" of individual marbles, however they are lined up overtop of a "rectangle" which has area. Fill in the fraction of heads and tails you have got so far. The probability of picking a yellow marble. your fate will be determined by a little game. Victoria used a probability simulator to pull 3 colored marbles from a bag and flip a coin 50 times. The applet simulates drawing marbles from a bag. Now let's take a look at a probability situation that involves marbles. You draw 5 marbles out at random, without replacement. Each group of four will be given the role of experimenter, observer, calculator or recorder. Example 2 - Probability with Marbles. Problem Statement: there are 5 marbles in a bag: 4 are blue, and 1 is red. Determine the probability of choosing a blue and then a purple marble if the first marble is NOT replaced. The closer the probablity of an event is to 1, the less likely it is to happen. Wes is in a class of 18 students and Maureen is in a class of 20 students. Bag 1 contains$10$blue marbles, while Bag 2 contains$15$blue marbles. 1200-year-old problem 'easy' Schoolchildren from Caversham have become the first to learn a brand new theory that dividing by zero is possible using a new number - 'nullity'. If I ever write a different non-frames version, I'll put a link to it here. The reason this is a combination is because you can clearly see the "set" of individual marbles, however they are lined up overtop of a "rectangle" which has area. The results are shown in the tables below: Color of Number of Marble Times Rolled Blue 20 Green 18 Yellow 12 Heads Tails 28 22 Using Misha's simulation, what is the probability of pulling a blue marble and the coin landing tails up?. spades ♠ hearts ♥, diamonds ♦, clubs ♣. What is the probability of choosing any coloured marble? Since there are 25 coloured marbles in the bag, all the 25 marbles are favoured. If you still don't believe the math, you can carry out a simulation. The theoretical probability of drawing a blue marble from the bag is the ratio of the number of blue marbles to the total number of marbles. In this problem we have a total of marbles. Accel Math 6/7 -Probability Study Guide True/False Indicate whether the statement is true or false. In a simulation, you model a real situation using an experiment. P(2 green) = (3/13)(2/12) = 1/26 P(2 yellow) = (6/13)(5/12) = 5/26. So P (brown) = = 0. Ireland and others published IEJME2009 Ireland Watson E | Find, read and cite all the research you need on ResearchGate. The actual number of red could be 1 in a total of 5, or 2 in a total of. Probability Models A probability model is a mathematical representation of a random phenomenon. What is the probability of drawing 1 marble of each colour when 4 marbles are withdrawn with replacement?. What is the probability of P (blue)? Answer by Fombitz(32378) (Show Source): You can put this solution on YOUR website! 2 Red 3 Yellow 4 Green 6 Blue 15 total. Introduction 9 Assessment Authentic assessment and feedback are a driving force for the suggestions for assessment in this document. • Find probabilities of compound events using organized lists, tables, tree diagrams, and simulation. Two marbles are drawn simultaneously from the bag. Flipping the second coin, the theoretical probability of getting heads is again 1 2. You draw one marble at random. If the probability of choosing 2 red marbles without replacement from a bag of only red and blue marbles is $$\frac{3}{55}$$ and there are 3 red marbles in the bag, what is the total number of marbles in the bag? A) 10 B) 11 C) 55 D) 110 E) 165. Now I’ve been watching South Park for many years now and to my knowledge they and he have mocked Christianity, Jews, Hindus, Arabs and his hand still came out at the end of each month for his pay cheque; a point that the creators were also quick to make. (b) Total ball = 5 + 3 + 2 + 1 = 11 Then probability (green) = 511 Then probability (blue) = 311 Then probability (red) = 211 Then probability (yellow) = 113 (c) The sum of probabiilites = 511. The group whose numbers on the card most closely matches the drawn marbles will win a prize. Example: There are 87 marbles in a bag and 68 of them are green. Parameters: Number and color of marbles in the bag, replacement rule. What type of probability is the marble question above? Theoretical or Experimental. A bag contains 5 red and 3 blue marbles. P(J, then J)= There is 1 yellow marble, 2 green marbles, 4 red marbles, and 5 blue marbles in a bag. Given that it is a red, there now remain 18 marbles in the bag and 3 are red. Choose between single or split screen mode for 'my turn, your turn' worked examples. Outcome 2: The probability is 5/36, and the frequency is 2. Shop our extensive selection of DnD dice sets, 6-sided game dice, and polyhedral dice (d4, d6, d8, d10, d12, d20), dice in bulk, and a variety of tabletop gaming products!. A marble is drawn, its color is recorded, and then the marble is placed back in the bag. The probability of choosing a green marble in these 10 remaining marbles is 3/10. Bag 2 now contains 3 white marbles, 7 black marbles, and 5 gray marbles. Megan wants to know what her probability is of drawing a pink marble out of her bag. 6 of the marbles are red, 4 of the marbles are blue and 2 of the marbles are green. a marble is taken at random and replaced. 24 Air Hunter 1. Consider an opaque bag with 5 green marbles, 3 blue marbles, and 2 red marbles. 00 Advanced RSS2Web Personal 2. ) SEE MORE : 13. Yasmine returns the marble to the bag and adds five more red marbles to the bag. 20161231 : What Happened to Obamas Passion ( Aug 06, 2011 , nytimes. Solve The Problem. Get YouTube TV Best of YouTube Music Sports Gaming Movies & Shows News Live Fashion Learning Spotlight 360° Video Browse channels Sign in to like videos, comment, and subscribe. On a mission to transform learning through computational thinking, Shodor is dedicated to the reform and improvement of mathematics and science education through student enrichment, faculty enhancement, and interactive curriculum development at all levels. For the bag of marbles below, there are 7 favor-able outcomes for the event of drawing a green marble because there are 7 green marbles in the bag. Advanced Destroyer Simulator (1990) Advanced Destroyer Simulator (ADS) is a naval combat simulation set in World War 2. What is the probability of drawing a green marble? How many times would you expect to draw a blue marble in 200 trials, based on the theoretical probability? What is the likelihood that you would get this exact. · Today I’ve brought mystery probability bags that you’re going to have to be able to describe the probability of the colored tiles that are in your bag. Calculate the probability that there are still 3 black beads and 6 white beads in each of the three boxes. Could the bag contain 60 marbles? If so, how many of each color must it contain? c. Ireland and others published IEJME2009 Ireland Watson E | Find, read and cite all the research you need on ResearchGate. This was desgined to simulate a specific problem posed on the forum here. You draw 5 marbles out at random, without replacement. Using these results, what prediction can be made for the number of green marbles in the bag? 9. Megan wants to know what her probability is of drawing a pink marble out of her bag. hmm, LAN9512 is a pretty neat chip 2020-01-01T00:07:24 nn7> it's all relative 2020-01-01T00:07:28 -!- nn7 [[email protected] Me Too Probability. What is the probability that all the marbles are red? Ans: 8C5/23C5 = 0. It may be assumed that items are handed in to the office randomly. Question 324522: In a bag of 10 marbles, there are 5 blue marbles, 3 red marbles, and 2 white marbles. Probability Q&A Library Recall from Example 1 that whenever Suzan sees a bag of marbles, she grabs a handful at random. 2018-07-28. I have three bags that each contain 100 marbles: Bag 1 has 75 red and 25 blue marbles; Bag 2 has 60 red and 40 blue marbles; Bag 3 has 45 red and 55 blue marbles; I choose a bag at random, and then a marble at random from that bag. Thus, calculate the probability that the marbles are the same color, then subtract this probability from 1 to find the probability they are different colors. com)是 OSCHINA. Victoria used a probability simulator to pull 3 colored marbles from a bag and flip a coin 50 times. This year’s Word of the Year, however, is extra special: 2019 is not only the end of the decade, but it also marks 10 years of doing Word of the. You draw 1 marble without replacing it and then draw a second marble. The theoretical probability of getting heads on the first coin is 1 2. net] has quit [Quit: Leaving] 2020-01-01T00:10:21 Steffanx> Why zyp. Probability tells us how often some event will happen after many repeated trials. Bag 1 contains$10$blue marbles, while Bag 2 contains$15$blue marbles. First set up your calculator: 2. There are eight blue marbles, nine orange marbles, and six yellow marbles in a bag. You have 10 cards numbered 0-9, lying face down. And so this is sometimes the event in question, right over here, is picking the yellow marble. Find the probability. Randomly pick one. This skilltest was conducted to help you identify your skill level in probability. Example 2 - Probability with Marbles. The results are shown in the tables below: Color of Number of Marble Times Rolled Blue 20 Green 18 Yellow 12 Heads Tails 28 22 Using Misha's simulation, what is the probability of pulling a blue marble and the coin landing tails up?. So, I'm trying to simulate an arbitrary model of a bag of marbles (with replacement, if that makes a difference in how this works) and am running into issues displaying the results. Make a copy of this table in your exercise book. This helps children to identify the probability of chance and how it works in relation to a volume of marbles in a bag. Sample Space Probability Video. Draw a: Probability Blue marble Red marble White marble Total: 1. It's obvious that we have three times as many red marbles as blue marbles. Perfect for projecting in the classroom. Theoretical B. Joffo was refused by many publishers before being encouraged by the newly founded publishing house Éditions Jean-Claude Lattès to get. Click Image to Enlarge : Students learn about sampling with and without replacement by modeling drawing marbles from a bag. Thus the rst trial must come up a tails and the second comes up heads. Cathy used a probability simulator to pull 3 colored marbles from a bag and flip a coin 50 times. Answer each questions with True or False ____ 1. A "random" distribution in a deck would, in particular, have no more pattern in it than might be "expected". The Mane Six, Spike, and the two alicorn princesses are sucked into an alien world. 25 probability of another blue is the same therefore, the probability of two blues is 0. Definitely a lot going on here. ) 3 in your hand, 5 in the bag, so pretty clearly the chance of any one marble being in there is 3/8. " The probability of this is: number of red marbles (the chances of our event) ----- total marbles in jar (the number of total chances) In our example, this is 4/10 which is 2/5, reduced. The PMP®, or Project Management Professional, is an exam conducted by the Project Management Institute (PMI)®, is a globally recognized certification. We are also labelling two variables (number of marbles and whole bag of marbles) using a linear model called a double-number line. You simply make a grab, and now you have 3 marbles. The "Space" is the sample space, i. If the second marble drawn is red, what is the CONDITIONAL probability that the first marble drawn is NOT red? [Hint: think of the marbles as "red" or "not red". The trend is motivated by several factors, but the difficulties and expense of modelling is a major driving force. Describe the probability of picking a red marble. Really clear math lessons (pre-algebra, algebra, precalculus), cool math games, online graphing calculators, geometry art, fractals, polyhedra, parents and teachers areas too. Click Image to Enlarge : Use a tree diagram to display possible outcomes of who will come to the party. 2 The Classical View of a Probability. There are 7 red marbles. After you achieve the SR point, Alto angrily flies over to a random point in space and shoots at it. Once you have decided on your answers click the answers checkboxes to see if you are right. What is the probability of pulling out a red or a yellow marble? ____ out of ____ 6. Clicker Quiz Launch the Clicker Quiz, whole-class. swap a black marble with a white marble, etc. Consider an opaque bag with 5 green marbles, 3 blue marbles, and 2 red marbles. 1/5 and the theoretical probability of drawing a white marble is 3/10. Another bag with 9 blue marbles has the same ratio of blue to white marbles as the first bag. To lend support to the paradoxical conclusion, Dodgson prefaced his explanation by asking the reader to agree that if the bag contains three marbles, each either black or white, and if the probability of drawing a black is 2/3, then there must be two black marbles and one white marble in the bag. 41 1st Mail Server 1. I pick one of the bags at random, and throw$6$red marbles in it. Chaos Game. Suppose a student, without looking. Find the probability of pulling a yellow marble from a bag with 3 yellow, 2 red, 2 green, and 1 blue-- I'm assuming-- marbles. The "Space" is the sample space, i. *d) Find the probability that a randomly chosen smoker died of heart disease. Updating and testing beliefs: An open version of Bayes' rule. pdf), Text File (. The probability of one dice not being either of two numbers is 4/6, so the probability of both dice fitting this condition is 4/6 x 4/6 = 16/36. 3 Determining Probabilities Using Fractions • MHR 431 A bag contains three red marbles and two black marbles. org Thread Index. So, I'm trying to simulate an arbitrary model of a bag of marbles (with replacement, if that makes a difference in how this works) and am running into issues displaying the results. Example 2 - Probability with Marbles. The trend is motivated by several factors, but the difficulties and expense of modelling is a major driving force. Toma nota de los beneficios del entrenamiento con pesas El ejercicio con pesas, ya sea de tonificación o de hipertrofia tiene una serie de beneficios que muchas veces pasamos por alto y posiblemente no los conozcamos. Choose between single or split screen mode for 'my turn, your turn' worked examples. Coins, Marbles and Dice Use the calculator probability simulator to look at how probabilities in experiments change. The overall theoretical probability is 1 2 2 for 2 coins, or: P(2H)= 1 2 1 2 P(2H)= 1 2 2 P(2H)= 1 4 To determine the experimental probability, let’s go to the probability simulator. In the tree diagram, does the probability of getting. Victoria used a probability simulator to pull 3 colored marbles from a bag and flip a coin 50 times. A bag contains 6 marbles: 1 red marble, 3 yellow marbles, and 2 blue marbles. ) What is the probability of picking a blue marble if you put all these marbles in a bag and draw from the bag? (Answer: In ratio form, 4/9. Stick a bar of soap into jagged edges, use soap as handle. It's a Turing-complete mechanical computer powered by marbles! Builds on many ideas from the 1960's toy, the Digi-Comp II. Just a boy being himself and trying to make you laugh. com/app/app. There are 4 blue marbles, 5 red marbles, 1 green marble, and 2 black marbles in a bag. Approximate π as 3. What is the probability that I get a red marble? Events: A = Marble is red B2 = Bag 2 was chosen in the first step. Parameters: Number and color of marbles in the bag, replacement rule. Definition: Example: An experiment is a situation involving chance or probability that leads to results called outcomes. So P (brown) = = 0. Given that you can have 1, 2 , 3 or 4 marbles in the bag. Marbles and Bags. If you replace the marble each time, each time your chance of drawing green is 7/16. This interactive activity would work best as an enhancement to having students perform hands-on experiments where they either flip coins or pull marbles out of a bag a certain number of times and record their results. net] has quit [Quit: Leaving] 2020-01-01T00:10:21 Steffanx> Why zyp. When we flip a coin there is always a probability to get a head or a tail is 50 percent. Determine whether the model is a uniform probability model or a non-uniform probability model. Vice City is a huge urban sprawl ranging from the beach to the swamps and the glitz to the ghetto, and is the most varied and complete digital city ever created. So we have a bag with 9 red marbles, 2 blue marbles, and 3 green marbles in it. Really clear math lessons (pre-algebra, algebra, precalculus), cool math games, online graphing calculators, geometry art, fractals, polyhedra, parents and teachers areas too. The man with the bag says that both marbles are indeed blue and asks for$2 for the bag. There are eight blue marbles, nine orange marbles, and six yellow marbles in a bag. Anyway, the numbers come out similar to mathsy's formula. 5 Mins Response Time. PDF | On Apr 10, 2016, S. You have three marbles in a bag. You draw 1 marble without replacing it and then draw a second marble. Unpredictable D. How to Simulate Picking Marbles on the TI-84 Plus By C. com thread that has been archived by the wayback machine. The Rubik’s Cube has six sides and each side has nine squares, but this is not a good way to think about the cube when trying to count the number of positions. Megan wants to know what her probability is of drawing a pink marble out of her bag. If they are simulation. possibility = 8/20 = 2/5 B. The actual number of red could be 1 in a total of 5, or 2 in a total of. The setup: There is a bag filled with population many marbles. The probability of drawing a green marble is. They are placed in a bag and one is drawn at random. Find the probability of selecting one green marble from bag A and one black marble from bag B. Get 24/7 Assignment/Homework help on Transtutors. Low prices across earth's biggest selection of books, music, DVDs, electronics, computers, software, apparel & accessories, shoes, jewelry, tools & hardware, housewares, furniture, sporting goods, beauty & personal care, groceries & just about anything else. After you achieve the SR point, Alto angrily flies over to a random point in space and shoots at it. Given that the third is also red there now remain 17 marbles in the bag but only two red. solution: P(at least one red)=P(RR or RB or BR) Alternatively, P(at least one red)=1-P(no reds) {complementary events} =1-P(BB) and so on. one-ninth D. Put some super glue on broken off part, insert, hold a few seconds and pull. Almost eighty% of people’s nervousness improved, and virtually 70% reported improved sleep within the first month, however the outcomes for sleep various over time. com)是 OSCHINA. R Functions Related to Simulation. It is a movie registered for one week until '. [131262] cBVdpXAjwIQTNWweLL “ЉЌeЋТЃFKqtmexfu “ЉЌe“ъЃF2009/12/11(Fri) 03:33 comment3 4 sneakers. a) Find the probability of choosing C and then M. Another marble is taken from the bag. The group whose numbers on the card most closely matches the drawn marbles will win a prize. 1-2-3 Spyware Free 4. How I have it set up is the code asks for how many marbles are in the bag, the how many you would like to pick, and then how many different colors there are. The "Space" is the sample space, i. A bag contains 5 red, 6 white, 2 yellow, and 10 pink marbles. Part of the Cambridge maths 7 textbook. A marble and a coin are drawn from each bag at random. NET 推出的代码托管平台，支持 Git 和 SVN，提供免费的私有仓库托管。目前已有超过 500 万的开发者选择码云。. Mixer in Figure 1 is similar to a bag of marbles, where the balls are the same size and shape and sample space is altered by adding additional balls to the Mixer. Then, write the probability of drawing certain colored marbles from a bag. The possible outcomes are landing on yellow, blue, green or red. ' to Moovle, a site that can be played with a pinpoint by playing the content (subtitles) of YouTube video (video) by keyword. com/app/app. Example 2 - Probability with Marbles. Make a copy of this table in your exercise book. Adam pulls out 3 marbles w/o looking. New videos EVERY OTHER DAY at 3pm PST / 6pm EST :) Reacting , funny family friendly videos , messed up. This process is repeated until 30 marbles have been drawn. Self Check: Bags of Marbles. 6 of the marbles are red, 4 of the marbles are blue and 2 of the marbles are green. We need to also see how you came up with your answer, please. Low prices across earth's biggest selection of books, music, DVDs, electronics, computers, software, apparel & accessories, shoes, jewelry, tools & hardware, housewares, furniture, sporting goods, beauty & personal care, groceries & just about anything else. A bag contains 3 red marbles, 2 blue marbles, and 1 green marble. Math 3338: Probability Page | 2 Test #2 1. taking account of all sources of uncertainty including model and simulator imperfections. (If you get too many/few you try again. So they say the probability-- I'll just say p for probability. It's obvious that we have three times as many red marbles as blue marbles. Outcome 2: The probability is 5/36, and the frequency is 2. the number of marbles in bag in the bag of marbles example; The "Desirables" are the number of desirable objects within the space, so, if you have a bag of marbles, and 30 of them are red and 60 of them are blue, and you want a red one, 30 would be your "desirables" number. ii Two blue marbles probability of one blue is 0. If I ever write a different non-frames version, I'll put a link to it here. Probability that bag one yielded a black or yellow marble: 6/9; Probability that bag two yielded a black or yellow marble: 9/12; Probability that Angelita did not draw an orange marble: 6/9 × 9/12 = 1/2; Try this probability question type. It may be assumed that items are handed in to the office randomly. Question: A bag contains eight yellow marbles, nine green marbles, three purple marbles, and five red marbles. Two bags contain different numbers of red and blue marbles. Library of Congress Cataloging-in-Publication Data: Dworsky, Lawrence N. For which marble is the experimental probability of drawing the marble the same as the theoretical probability?. But we have 9 red marbles, so let me draw 9 red marbles. heads shows up, where the probability of heads is p. What is the probability of randomly selecting a non-blue marble from of the bag? So let's draw this bag here. Accel Math 6/7 -Probability Study Guide True/False Indicate whether the statement is true or false. The actual number of red could be 1 in a total of 5, or 2 in a total of. A bag contains only red and blue marbles. Get YouTube TV Best of YouTube Music Sports Gaming Movies & Shows News Live Fashion Learning Spotlight 360° Video Browse channels Sign in to like videos, comment, and subscribe. b) Find the probability that the second marble is red. 3 Determining Probabilities Using Fractions • MHR 431 A bag contains three red marbles and two black marbles. Edwards The Probability Simulation application on the TI-84 Plus can simulate picking one marble at a time from an urn that contains from two to five different types (colors) of marbles. A bag contains 5 red and 3 blue marbles. Given this information, what is the probability that the marble we moved from Bag A to Bag B is white?. Find the training resources you need for all your activities. Com stats: 2591 tutors, 704712 problems solved View all solved problems on Probability-and-statistics -- maybe yours has been solved already!. notebook 5 March 09, 2015 Mar 73:45 PM create a simulation to determine the probability that Sample answer: Place 5 marbles in a bag. If each of 5 girls and 5 boys randomly selects and keeps a marble, what is the probability that all of the girls select the same colored marble? a) 1/126 b) 1/120 c) 1/24 d) 4/25 e) 1/2. Ireland and others published IEJME2009 Ireland Watson E | Find, read and cite all the research you need on ResearchGate. What type of probability is the marble question above? Theoretical or Experimental. Bag A has $3$ white and $2$ black marbles. Bag of Marbles; Coin Flip Simulation; Dice Roll Simulation; acertar en la diana - 3; Probability Distributions. (2 points each) In each of the scenarios below, indicate whether the distribution of X is binomial, poisson, negative binomial (r >1), geometric, or neither. This skilltest was conducted to help you identify your skill level in probability. i A red marble and then a blue marble probability of one red marble is 0. Cambridge International AS & A Level Mathematics: Probability & Statistics 2 7 A Lost Property office is open 7 days a week. Probability The marbles pictured below are gray, white, and black. (If you get too many/few you try again. Golly, Mom is right!. Probability is a measure of how likely an event. there are 5 marbles in a bag: 4 are blue, and 1 is red. R Functions Related to Simulation. If the cube is thrown once, what is the probability of rolling an even number?. Problems on coin toss probability are explained here with different examples. A bag contains 4 red marbles, 16 yellow marbles, 5 purple marbles, 16 blue marbles, and 10 green marbles. You draw 1 marble without replacing it and then draw a second marble. The applet simulates drawing marbles from a bag. Change the number of marbles of different colors in the boxes and guess the probability of drawing a red blue or yellow marble. After you achieve the SR point, Alto angrily flies over to a random point in space and shoots at it. P(J, then J)= There is 1 yellow marble, 2 green marbles, 4 red marbles, and 5 blue marbles in a bag. What is Probability Without Replacement? As then name says, it is a probability where something is not replaced. person_outline Timur schedule 2018-01-04 16:57:13. ア・カペラ /(?) A cappella/ ア・クイック・ワン /(?) A Quick One/ ア・セクシャル /(?) Asexuality/ ア・セクシュアル /(?) Asexuality/ ア. There is about 3% chance of grabbing a white and. If I randomly pick 5 marbles out of the bag, what is the probability that 3 of those 5 marbles are red?. P(blue marble) 6. Email: [email protected] Playing Card Dealer; Create Random Integer Lists; Spinner; Non-transitive Spinners; Flipping 5 Coins; Other. The results are shown in the tables below: Color of Marble Number of Times Rolled Blue 12 Green 18 Yellow 20 Heads Tails 30 20 Using Cathy's simulation, what is the probability of pulling a blue marble and the coin landing tails up? 240 over 2500 220 over 2500 12 over 50 32 over 50. The student has recorded 6 blue marbles and 14 green marbles. This year’s Word of the Year, however, is extra special: 2019 is not only the end of the decade, but it also marks 10 years of doing Word of the. It's a direct connection between the two devices ok so it's a totally different protocol Bob Walton and she strong enough I'd like to see people getting her f***** weirdo will use the same that's the Catholics was looking at it but when you have a system at international bank saying the US government itself make sure that suppress wages and other nations it's not somewhere true organic of situ. Suppose a coin tossed then we get two possible outcomes either a ‘head’ ( H ) or a ‘tail’ ( T ), and it is impossible to predict whether the result of a toss will be a. For example, use random digits as a simulation tool to approximate the answer to the question: If 40% of donors have type A blood, what is the probability that it will take at least. R Functions Related to Simulation. It's revealed to be Mykage, and he's impressed that Alto noticed him (presumably through some kind of Nakamura radar). The closer the probablity of an event is to 1, the less likely it is to happen. I have two bags. What marble could you add or remove so that the probability of drawing a blue marble is 1 3? A box contains 12 slips of paper as shown. Playing cards probability problems based on a well-shuffled deck of 52 cards. com) 20161229 : The neoliberal MSM narrative that it is a well established fact that Russia influenced US election is nonsense. A bag contains 4 red marbles, 16 yellow marbles, 5 purple marbles, 16 blue marbles, and 10 green marbles. Given this information, what is the probability that the marble we moved from Bag A to Bag B is white?. Ideal. *d) Find the probability that a randomly chosen smoker died of heart disease. The man says you can check one marble only, but you are allowed to manipulate the bag in any way that you wish. Achievements • Artifacts • Equipment • Monsters • Quests • Skills • Towns — Omnibus List Notice: game texts are not subject to Creative Commons license (due to the way they were initially submitted to the ideabox).
| 2020-11-30T23:55: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": 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.5603737235069275, "perplexity": 881.7323567422789}, "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/1606141515751.74/warc/CC-MAIN-20201130222609-20201201012609-00083.warc.gz"}
|
https://indico.fnal.gov/event/19348/contributions/186472/
|
Indico search will be reestablished in the next version upgrade of the software: https://getindico.io/roadmap/
# Neutrino 2020
June 22, 2020 to July 2, 2020
US/Central timezone
## Implications of the Dark LMA solution and Fourth Sterile Neutrino for Neutrino-less Double Beta Decay
Not scheduled
10m
Poster
### Speaker
Tanmay Kumar Poddar (Physical Research Laboratory)
### Description
We analyze the effect of the Dark-large mixing angle (DLMA)
solution on the effective Majorana mass ($m_{\beta\beta}$) governing neutrino-less double beta decay ($0\nu\beta\beta$) in the presence of a sterile neutrino.
We consider the 3+1 picture, comprising of one additional sterile neutrino.
We have checked that the MSW resonance in the sun can take place in the DLMA parameter space in this scenario. Next we investigate how the values of the
solar mixing angle $\theta_{12}$ corresponding to the DLMA region alter the
predictions of $m_{\beta\beta}$ by including a sterile neutrino in the analysis.
We also compare our results with three generation cases for both standard large mixing angle (LMA) and DLMA. Additionally, we evaluate the discovery sensitivity of the future ${}^{136}Xe$ experiments in this context.
### Mini-abstract
Here we analyze the implication of DLMA solution for neutrino-less double beta decay in 3+1 scheme.
### Primary author
Tanmay Kumar Poddar (Physical Research Laboratory)
### Presentation Materials
conference_poster.pdf Tanmay-poster-video.mp4
| 2021-12-05T11:36: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.6862995624542236, "perplexity": 6045.83869422081}, "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/1637964363157.32/warc/CC-MAIN-20211205100135-20211205130135-00218.warc.gz"}
|
https://wiki.cosmos.esa.int/planck-legacy-archive/index.php?title=Map-making_LFI&oldid=12538
|
# Map-making LFI
## Mapmaking
The inputs to the mapmaking procedure consist of the calibrated timelines, along with the corresponding pointing information. The main output consists of temperature and polarization maps. An important part of the mapmaking step is the removal of correlated 1/f noise.
LFI maps were constructed with the MADAM mapmaking code, version 3.7.4. The code is based on a generalized destriping technique, where the correlated noise component is modelled as a sequence of constant offset "baselines". The baseline solution is constrained by a noise filter. As auxiliary information, the code produces a hit-count map and a white noise covariance matrix. No beam information is used, with the signal being simply assigned to the pixel where the centre of the beam falls.
The chosen baseline length was 1s for the 44GHz and 70GHz maps, 0.25s for the 30GHz map. This gives good noise removal, without being computationally burdensome. The noise filter was built according to the noise parameters listed in Table 1.
Flagged samples were excluded from the analysis. The Galaxy region was masked out in the destriping phase, to reduce errors arising from strong signal gradients. Radiometers were combined according to the horn-uniform weighting scheme to minimize systematics. The polarization component was included in the analysis, although only the temperature maps were released in 2013. A detailed description of the mapmaking procedure is given in Planck-2013-II[1]Planck-2015-A02[2]Planck-2015-A06[3]. See also the section on Frequency Maps.
The maps are in HEALPix format, at resolution Nside=1024 for all frequencies with an additional map at Nside=2048 for the LFI 70GHz channel, in the nested pixelization scheme. Unobserved pixels are marked by a special value.
The released maps are in Galactic coordinates. The conversion between ecliptic and Galactic coordinates is described by the rotation matrix
The conversion was applied to the input pointing data, prior to the construction of the map.
Table 1: Knee frequencies and slopes for the LFI radiometers.
## Low-resolution maps and noise covariance matrices
To fully exploit the information contained in the large-scale structure of the microwave sky, pixel-pixel covariances are needed in the maximum likelihood estimation of the CMB power spectrum. However, full covariance matrices are impossible to employ at the native map resolution due to resource limitations. A low-resolution data set is therefore required for the low-ℓ analysis. This data set has been packed into three different files, one per frequency, called "LFI_NoiseCovMat_0??_0016_R2.00.tgz", that can be downloaded from the Cosmology section of the Planck Legacy Archive. They consist of low-resolution maps, and descriptions of residual noise present in those maps given by pixel-pixel noise covariance matrices (NCVMs).
Contents of LFI_NoiseCovMat_0??_0016_R2.00.tgz
Filenames Comment
LFI_SkyMap_0??_0016_nobs_DX11D_full_regnoise.fits Low-resolution maps. Full mission coverage.
LFI_SkyMap_0??_0016_nobs_DX11D_s1-s3-s5-s6-s7-s8_regnoise.fits Low-resolution maps. Full mission coverage, excluding Surveys 2 and 4.
offset_covmat_toast_nside64T16_nobs_025sec_??GHz_DX11D_full_bin.dat Low-resolution noise covariance matrices. Regularization noise added. Format: C unformatted.
offset_covmat_toast_nside64T16_nobs_025sec_??GHz_DX11D_s1-s3-s5-s6-s7-s8_bin.dat Low-resolution noise covariance matrices. Regularization noise added. Format: C unformatted.
covmat_toast_nside64T16_nobs_025sec_??GHz_DX11D_full_bin.dat Low-resolution noise covariance matrices. No regularization noise added. Format: C unformatted.
covmat_toast_nside64T16_nobs_025sec_??GHz_DX11D_s1-s3-s5-s6-s7-s8_bin.dat Low-resolution noise covariance matrices. No regularization noise added. Format: C unformatted.
DX11D_0??_016_full_conv060_VarianceBPcorrection_v2.fits Variance of the BandPass correction.
DX11D_0??_016_full_conv060_BPcorrection_v2.fits BandPass Correction map to be SUBTRACTED to the corresponding Low Resolution.
The low-resolution data set can currently be utilized efficiently only at resolution Nside = 16, or lower. All the low-resolution data products are produced at this target resolution.
### Low-resolution maps
A number of different schemes to obtain the low-resolution maps are discussed in [4]. We chose to downgrade the maps using the inverse noise weighting. This is discussed further in Planck-2013-II[1]Planck-2015-A06[3].
#### Inputs
We took the high-resolution maps described in Map-making and Frequency Maps, and the corresponding 3×3 matrices as an input for this analysis step.
#### Production
The high-resolution maps were downgraded to Nside = 16 using inverse noise weights (given by the 3×3 matrices), and subsequently the temperature part was smoothed with a symmetric Gaussian beam with FWHM = 440arcmin.
### Noise covariance matrices
The statistical description of the residual noise in the maps is given in the form of a pixel-to-pixel noise covariance matrix (NCVM), as described in [4].
#### Inputs
The noise model was determined by three noise parameters: the white noise level σ; slope; and knee frequency fknee. We actually used three sets of noise parameters, one for the entire mission (noise parameters are listed in Table 1), and one for each sky survey (SS1 and SS2).
We used the same pointing as in the noise Monte Carlo simulations. See the description in Noise Monte Carlo Simulation Inputs.
We used the gap files produced during the making of the flight maps to leave out samples that were flagged as bad for various reasons.
#### Production
The output of the NCVM module of MADAM mapmaker are inverse NCVMs. Since the inverse matrices are additive, we divided the computations into a number of small chunks to save computational resources. We first calculated one inverse NCVM per radiometer per survey at resolution Nside=32, and then combined these individual inverse matrices to form the actual inverse matrices. The mapmaking parameters were almost identical to the standard mapmaking runs. The differing parameter values are listed below:
• baseline lengths were 0.25s (eight samples), 0.50s (24 samples), and 0.50s (39 samples) for 30GHz, 44GHz, and 70GHz, respectively;
• the calculations were performed at resolution Nside = 32;
• no destriping mask was applied;
• the horns were weighted optimally.
To obtain the noise covariance from its inverse, the matrices are inverted using the eigen decomposition of a matrix. The monopole of the temperature map cannot be resolved by the mapmaker, and thus the matrix becomes singular. This ill-determined mode is left out of the analysis.
Having calculated the eigen decomposition in the previous step, we can apply the same linear operators to modify the eigenvectors as were applied to the high-resolution maps while downgrading them. The eigenvectors are downgraded to Nside = 16 using inverse noise weights, and subsequently the temperature part is smoothed with a symmetric Gaussian beam with FWHM = 440arcmin.
The final matrices are then recomposed from the original eigenvalues and modified eigenvectors.
The low-resolution noise covariance matrices:
• are C binary format files;
• are organized in block form,
• are in the HEALPix nested pixelisation scheme (with resolution is Nside = 16, and thus there are Npix = 3072 pixels);
• are in Galactic coordinates;
• have KCMB units.
## Half-ring jackknife noise maps
### Overview
In order to estimate the noise directly at the map level and in the angular power spectra, we divided the time-ordered data into two halves and produced half-ring jackknife maps, as described in Planck-2015-A03[2].
Briefly, instead of using the full time-ordered data as described above, we produced two sets of maps using either only the first half of each pointing period (map named j1 below) or only the second half of each pointing period (map named j2). At each pixel p, these half-ring jackknife maps j1 and j2 contain the same sky signal, since they result from the same scanning pattern on the sky. However, because of instrumental noise, the maps j1 and j2 are not identical.
We estimated the noise level in each map m made using the full (ring) data, by constructing a half-ring difference map
with weights
.
Here hitfull(p) = hit1(p) + hit2(p) is the hit count at pixel p in the full map m, while hit1 and hit2 are the hit counts of j1 and j2, respectively. The weight factor whit(p) is equal to 2 only in those pixels where hit1(p) = hit2(p) . In a typical pixel, hit1(p) will differ slightly from hit2(p) and hence the weight factor is whit(p)>2.
The half-ring difference maps nm are the most direct measure of the noise in the actual maps. The other noise estimates (NCVM and noise Monte Carlo) rely on specific modelling of the noise and this modelling can be validated by comparing to the half-ring difference maps. However, the half-ring difference maps can only capture the noise that varies faster than half of the duration of the pointing period, i.e., the noise whose frequency is approximately f > 1/20min = 0.85mHz.
We calculated the noise maps nm, from half-ring "jackknife" maps for temperature (I) and polarization (Q and U) and as a first quality check of the maps (and as one of the tests of the whole data processing pipeline up to the map level) tested both numerically and visually that these noise maps divided pixel-by-pixel by the square root of the white noise covariance maps were approximately Gaussian with variance near to unity. Temperature noise maps for the nominal survey and for the first and second sky surveys are shown in the next subsection. Furthermore we calculated from the noise maps the temperature and polarization (E and B mode) auto-correlation and cross-correlation noise angular power spectra using HEALPix anafast and compared to these the results from the white noise covariance matrices and from the noise Monte Carlo simulations. A similar comparison was made between downgraded half-ring noise maps, downgraded noise Monte Carlo maps, and the low-resolution noise covariance maps. Detailed results are presented in Planck-2015-A03[5].
### Examples of half-ring difference maps and noise angular power spectra
#### Hit-count weighted half-ring difference maps
Here we show some hit-count weighted half-ring difference maps, i.e., noise maps for temperature. The columns are for different LFI frequencies, namely 30GHz, 44GHz, and 70GHz. The rows are for the nominal survey (a bit more than 1 year of observations), Survey 1 (the first sky survey, approximately the first half year of observations) and Survey 2 (the second sky survey, approximately the second half year of observations). Some features are visible, particularly in the Galactic plane; these are due to "gradient leakage." In regions where the gradient in the sky signal is very large, even a tiny difference in the pointing of the first and second half of each pointing period causes the signal to "leak" into the half-ring difference map. In practice this is not a problem for noise estimation, since these regions (i.e., the Galaxy, Orion, Crab Nebula, etc.) will be masked in the cosmology analysis.
Half-ring difference maps. These are calculated at the native Nside=1024 resolution (note for the LFI 70GHz channel maps are also generated at Nside=2048). The columns are frequency (30, 44, and 70GHz), while the rows are sky surveys (Nominal, Survey 1, and Survey 2).
Half-ring difference maps (the same as above, but) smoothed with a 60 arcmin FWHM Gaussian. The columns are frequency (30, 44, and 70GHz), while the rows are sky surveys (Nominal, Survey 1, and Survey 2).
#### Normalized hit-count weighted half-ring difference maps
Now we show the same as above, but divided by the square root of the estimate of the white noise variance in each pixel. These normalized noise maps should be approximately Gaussian with unit variance (at the native resolution), apart from some stripes that are due to correlated (non-Gaussian) 1/f noise. The large-scale 1/f noise is more apparent in the smoothed version of the figure, which follows after the native resolution version.
Normalized half-ring difference maps calculated at the native Nside=1024 resolution (note for the LFI 70GHz channel maps are also generated at Nside=2048). Columns are frequency (30, 44, and 70GHz), while rows are sky surveys (Nominal, Survey 1, and Survey 2).
Normalized half-ring difference maps (the same as above, but) smoothed with a 60 arcmin FWHM Gaussian. Columns are frequency (30, 44, and 70GHz), while rows are sky surveys (Nominal, Survey 1, and Survey 2).
#### Noise angular power spectra from half-ring difference maps
The noise angular power spectra are shown below. These were calculated using HEALPix routine anafast from half-ring difference temperature maps and normalized by the sky coverage to estimate the noise level if there was a full sky coverage. This enables us more easily to compare different surveys.
Columns are frequency (30, 44, and 70GHz). The Nominal mission map is black, Survey 1 is red, and Survey 2 is blue.
### Comparison of noise estimates
Here we compare noise angular power spectra estimated from half-ring difference maps (red) to the estimate from white noise covariance maps (blue), and the full noise Monte Carlo simulations (BLACK, top curve 16th percentile, middle curve 50th percentile, i.e., median, and bottom curve 84th percentile). See the next section for the details of noise Monte Carlos.
Nominal Survey.
Survey 1.
Survey 2.
#### High-ell average noise relative to white noise estimate
The figure below is the same as the previous figures, but here the noise comparison is made from the high ℓ tails of the angular power spectra, where the white noise dominates. We have taken the average of C from multipoles between 1150 and 1800, and subtracted the white noise estimate. The half-ring difference noise estimate is shown in red, the full noise Monte Carlo estimate in black, and the white noise estimate from noise Monte Carlos in green. The white noise estimate from the white noise covariance map (WNC), in blue, has been subtracted from all the results.
Nominal survey.
Survey 1.
Survey 2.
## Noise Monte Carlo simulations
### Overview
Calculating and handling full pixel-to-pixel noise covariance matrices for Planck maps if feasible only at low resolution. To support the analysis of high-resolution maps, a Monte Carlo set of noise maps were produced. These maps were produced from noise timelines using the same map-making procedure as for the flight data. In the noise Monte Carlo it was possible to follow exactly the mapmaking procedure used for the flight maps, whereas for the calculation of noise covariance matrices some approximations had to be made. Such noise Monte Carlos were produced at two levels of the analysis: (1) LFI Monte Carlo (MC) as part of the LFI data processing procedure; and (2) Full Focal Plane (FFP) Monte Carlos as part of the joint HFI/LFI data processing. This page describes the LFI noise MCs. For the FFP MC, see HL-sims and Simulation data.
### Inputs
The noise MC uses a three-parameter noise model, consisting of white noise level (σ), slope, and knee frequency (fknee)). Here the noise consists of white noise and correlated 1/f noise, with a power spectrum
,
where fsample is the sampling frequency of the instrument. The noise parameters were determined separately for each radiometer, as described in the section Noise above, assuming they stayed constant over the mission.
The detector pointing was reconstructed from satellite pointing information, focal-plane geometry, pointing correction (tilt angle), and sample timing, using Level-S simulation software. The same pointing solution (two focal planes) was used as for the LFI flight maps. Due to numerical accuracy, the detector pointing in the noise MC was not exactly the same as for the flight maps, so some data samples (of the order of one in a thousand) whose pointing was near the pixel boundary ended up assigned to the neighbouring pixel. During mapmaking from the flight data, a "gap file" was produced to represent the samples that were omitted from mapmaking due to various flags. This gap file was used in the noise MC instead of the full set of flags. The flight mapmaking procedure used destriping masks to prevent regions of strong signal gradients from contributing to the noise baseline solution. These same destriping masks (one for each frequency channel) were used for the noise MC.
### Production
The noise was generated internally in the Madam mapmaking code using a stochastic differential equation (SDE) method, to avoid time-consuming writing and reading of noise timelines to and from disk. Noise for each pointing period was generated separately, using a double-precision random number seed constructed from the realization number, radiometer number, and the pointing period number; this allowed for regeneration of the same noise realization when needed. White noise and 1/f noise were generated separately.
The same mapmaking code (Madam) with the same parameter settings was used for the noise MC as for the flight maps. In addition to the destriped maps from the full noise (output maps), binned maps from just the white noise (binned white noise maps) were produced; they represent the white noise part of the output maps. The difference between these two maps represents the residual correlated noise in the output map. The maps were made at HEALPix resolution Nside = 1024 for all LFI frequency channels and also at HEALPix resolution Nside = 2048 for the 70 GHz channel. For low-resolution analysis, these maps were downgraded (and the temperature part was smoothed) to Nside = 32 and Nside = 16.
In addition to frequency maps for the nominal survey, also single-survey and 70 GHz horn-pair maps were produced in the noise MC. For each case 102-1026 realizations were produced.
### Usage
These noise Monte Carlo maps were used for a number of purposes in LFI data analysis. They were compared to the low-resolution noise covariance matrices, generated for the same noise model, in order to reveal the impact of the approximations in the noise covariance matrix calculation. They were compared to the half-ring noise maps to see how well the noise model matches the noise in the flight maps (noting, however, that the half-ring noise maps misrepresent the lowest noise frequencies in the flight maps, and contain some effects from the sky signal). They were also used in power spectrum estimation and non-Gaussianity estimation.
### Examples
As an example, we show below images of the first realization of the 70GHz frequency map noise for the nominal survey. The images are in the order: destriped full noise; binned white noise; and residual correlated noise. Note that it is difficult to see any difference between the first two images, since the residual correlated noise is more than an order of magnitude below the white noise level. The units here are KCMB.
Destriped full noise.
Binned white noise.
Residual correlated noise.
The following two images show the statistics of the angular power spectra of 101 realizations of the 70 GHz frequency map noise for the nominal survey. The thick black line shows the median C, while the green line the mean C. Thin black lines show the minimum, 16th percentile, 84th percentile, and the maximum C. The red line is the 102nd realization. The first plot is for the full noise in the output map, while the second plot is for the residual correlated noise.
Full noise.
Residual correlated noise.
## References
1. Planck 2013 results. II. Low Frequency Instrument data processing, Planck Collaboration, 2014, A&A, 571, A2.
2. Planck 2015 results. II. LFI processing, Planck Collaboration, 2016, A&A, 594, A2.
3. Planck 2015 results. VI. LFI mapmaking, Planck Collaboration, 2016, A&A, 594, A6.
4. Residual noise covariance for Planck low-resolution data analysis, R. Keskitalo, M. A. J. Ashdown, P. Cabella, T. Kisner, T. Poutanen, R. Stompor, ArXiv e-prints, (2013).
5. Planck 2015 results. III. LFI systematics, Planck Collaboration, 2016, A&A, 594, A3.
(Planck) Low Frequency Instrument
(Hierarchical Equal Area isoLatitude Pixelation of a sphere, <ref name="Template:Gorski2005">HEALPix: A Framework for High-Resolution Discretization and Fast Analysis of Data Distributed on the Sphere, K. M. Górski, E. Hivon, A. J. Banday, B. D. Wandelt, F. K. Hansen, M. Reinecke, M. Bartelmann, ApJ, 622, 759-771, (2005).
Cosmic Microwave background
Full-Width-at-Half-Maximum
(Planck) High Frequency Instrument
| 2022-12-08T10:56:05 |
{"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": 2, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.839041531085968, "perplexity": 2728.1887253257228}, "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-49/segments/1669446711286.17/warc/CC-MAIN-20221208082315-20221208112315-00562.warc.gz"}
|
https://pos.sissa.it/344/039/
|
Volume 344 - 14th European VLBI Network Symposium & Users Meeting (EVN2018) - Stellar Evolution Session 2
Measuring Magnetic Fields from Water Masers Associated with the Synchrotron Protostellar Jet in W3(H2O)
C. Goddi,* G. Surcis, L. Moscadelli
*corresponding author
Full text: Not available
Abstract
The Turner-Welch Object in the W3(OH) high-mass star forming complex drives a synchrotron jet,
which is quite exceptional for a high-mass protostar, and is associated with a strongly polarized water maser source, W3(H$_2$O),
making it an optimal target to investigate the role of magnetic fields on the innermost scales of protostellar disk-jet systems.
We report here full polarimetric VLBA observations of water masers. The linearly polarized emission from water masers provides clues on the orientation
of the local magnetic field, while the measurement of the Zeeman
splitting from circular polarization provides its strength.
By combining the information on the measured orientation and strength of the magnetic field with
the knowledge of the maser velocities,
we infer that the magnetic field evolves from having a dominant component parallel to the outflow velocity in the pre-shock gas (with field strengths of the order of a few tens of mG), to being mainly dominated by the perpendicular component (of order of a few hundred of mG) in the post-shock gas where the water masers are excited.
The general implication is that in the undisturbed (i.e. not-shocked) circumstellar gas, the flow velocities would follow closely the magnetic field lines, while in the shocked gas the magnetic field would be re-configured to be parallel to the shock front as a consequence of gas compression.
Open Access
Copyright owned by the author(s) under the term of the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
| 2019-04-19T10:22: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.3764514625072479, "perplexity": 2669.622551812297}, "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-18/segments/1555578527566.44/warc/CC-MAIN-20190419101239-20190419123239-00236.warc.gz"}
|
https://pdglive.lbl.gov/DataBlock.action?node=S043KC
|
AVERAGE PARTICLE MULTIPLICITIES IN HADRONIC ${{\mathit W}}$ DECAY
Summed over particle and antiparticle, when appropriate.
$\langle{}\mathit N_{{{\mathit K}^{\pm}} }\rangle{}$
VALUE DOCUMENT ID TECN COMMENT
$2.20$ $\pm0.19$ 1
2000 F
DLPH ${\it{}E}^{\it{}ee}_{\rm{}cm}$= 189 GeV
1 ABREU,P 2000F measure $\langle{}\mathit N_{{{\mathit K}^{\pm}} }\rangle{}$ = $4.38$ $\pm0.42$ $\pm0.12$ and $2.23$ $\pm0.32$ $\pm0.17$ in the fully hadronic and semileptonic final states respectively. The value quoted is a weighted average without assuming any correlations.
References:
ABREU,P 2000F
EPJ C18 203 Charged and Identified Particles in the Hadronic Decay of ${{\mathit W}}$ Bosons and in ${{\mathit e}^{+}}$ ${{\mathit e}^{-}}$ $\rightarrow$ ${\mathit {\mathit q}}$ ${\mathit {\overline{\mathit q}}}$ from 130 to 200 GeV
Also
EPJ C25 493 (errat.) Erratum: ABREU,P 2000F Charged and Identified Particles in the Hadronic Decay of ${{\mathit W}}$ Bosons and in ${{\mathit e}^{+}}$ ${{\mathit e}^{-}}$ $\rightarrow$ ${\mathit {\mathit q}}$ ${\mathit {\overline{\mathit q}}}$ from 130 to 200 Gev
| 2023-03-29T21:48: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.9455391764640808, "perplexity": 2497.2145187032597}, "config": {"markdown_headings": false, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2023-14/segments/1679296949035.66/warc/CC-MAIN-20230329213541-20230330003541-00201.warc.gz"}
|
https://www.usgs.gov/media/images/k-lauea-volcano-halemaumau-crater-collapse-june-23-2018
|
Kīlauea Volcano — Halemaumau Crater Collapse (June 23, 2018)
Detailed Description
On June 23, 2018 at 4:32 p.m. HST after approximately 17 hours of elevated seismicity, a collapse explosion occurred at the summit if Kīlauea. The energy released by the event was equivalent to a magnitude 5.3 earthquake. During the intense shaking, rockfalls cascaded down the northern margin of the caldera wall just below Uwēkahuna Bluff sending rock dust into the air.
Details
Image Dimensions: 4254 x 2304
Date Taken:
Location Taken: Kīlauea Volcano, HI, US
| 2021-09-28T20: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": 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.4381246268749237, "perplexity": 13312.533439183502}, "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-39/segments/1631780060882.17/warc/CC-MAIN-20210928184203-20210928214203-00519.warc.gz"}
|
https://docs.dea.ga.gov.au/notebooks/Frequently_used_code/Exporting_NetCDFs.html
|
# Exporting data to NetCDF files¶
• Compatability: Notebook currently compatible with both the NCI and DEA Sandbox environments
• Products used: ls8_nbart_geomedian_annual
## Background¶
NetCDF is a file format for storing multidimensional scientific data. This file format supports datasets containing multiple observation dates, as well as multiple bands. It is a native format for storing the xarray datasets that are produced by Open Data Cube, i.e. by dc.load commands.
NetCDF files should follow Climate and Forecast (CF) metadata conventions for the description of Earth sciences data. By providing metadata such as geospatial coordinates and sensor information in the same file as the data, CF conventions allow NetCDF files to be “self-describing”. This makes CF-compliant NetCDFs a useful way to save multidimensional data loaded from Digital Earth Australia, as the data can later be loaded with all the information required for further analysis.
The xarray library which underlies the Open Data Cube (and hence Digital Earth Australia) was specifically designed for re
| 2020-02-27T07:57:35 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 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.19222323596477509, "perplexity": 5495.240613618111}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2020-10/segments/1581875146665.7/warc/CC-MAIN-20200227063824-20200227093824-00228.warc.gz"}
|
https://oceancolor.gsfc.nasa.gov/atbd/kd/
|
# Diffuse attenuation coefficient for downwelling irradiance at 490 nm (Kd)
## 1 - Product Summary
This algorithm returns the diffuse attenuation coefficient for downwelling irradiance at 490 nm ($Kd\_490$) in m-1, calculated using an empirical relationship derived from in situ measurements of $Kd\_490$ and blue-to-green band ratios of remote sensing reflectances (Rrs).
Implementation of this algorithm is contingent on the availability of Rrs in the blue-green spectral region (e.g., 490 - 565 nm). CZCS, OCTS, MODIS-Aqua and -Terra, MERIS, SeaWiFS, VIIRS, and others are all supported.
Algorithm Point of Contact: P. Jeremy Werdell, NASA Goddard Space Flight Center
## 2 - Algorithm Description
##### Inputs:
$R_{rs}$ near 490 nm and between 547 and 565 nm
##### Output:
$Kd\_490$, diffuse attenuation coefficient of downwelling irradiance at 490 nm in m-1
##### General Algorithm:
The algorithm is a fourth-order polynomial relationship between a ratio of $R_{rs}$ and $Kd\_490$:
$$log_{10}\left(K_{bio}\left(490 \right ) \right )=a_0 + \sum_{i=1}^{4}a_i\left(log_{10}\left(\frac{R_{rs}\lambda_{blue}}{R_{rs}\lambda_{green}}\right) \right )^{i}$$
$$Kd\_490=K_{bio}\left(490\right) + 0.0166$$
the coefficients for which are sensor-specific:
sensor blue green a0 a1 a2 a3 a4
KD2S SeaWiFS 490 555 -0.8515 -1.8263 1.8714 -2.4414 -1.0690
KD2M MODIS 488 547 -0.8813 -2.0584 2.5878 -3.4885 -1.5061
KD2E MERIS 490 560 -0.8641 -1.6549 2.0112 -2.5174 -1.1035
KD2V VIIRS 490 550 -0.8730 -1.8912 1.8021 -2.3865 -1.0453
KD2O OCTS 490 565 -0.8878 -1.5135 2.1459 -2.4943 -1.1043
KD2C CZCS 443 520 -1.1358 -2.1146 1.6474 -1.1428 -0.6190
KD2L OLI/Landsat 8 482 561 -0.9054 -1.5245 2.2392 -2.4777 -1.1099
The coefficients were derived using version 2 of the NASA bio-Optical Marine Algorithm Data set (NOMAD).
## 3 - Implementation
Click get_Kd.c to view source code.
##### Calling in L2GEN
l2prod = Kd_490 each satellite will use its sensor-specific coefficients and wavelengths (e.g., SeaWiFS defaults to KD2S) to override the coefficients: kd2_coef = [a0,a1,a2,a3,a4] to override the wavelengths: kd2_wave = [numerator wavelength, denominator wavelength]
## 4 - Assessment
Satellite-to-in-situ validation results are available from the SeaWiFS Bio-Optical Archive and Storage System (SeaBASS):
KD2S KD2M KD2E
KD2V KD2O KD2C
#### Algorithm verification: comparison with alternate models
KD2S is compared with (Morel et al. 2007) (both Rrs- and Chl-driven) and (Lee 2005)
## 5 - References
Austin, R. W., & Petzold, T. J. (1981). The determination of the diffuse attenuation coefficient of sea water using the Coastal Zone Color Scanner. In: J.F.R. Gower, Ed., Oceanography from Space, Plenum Press, New York, 239-256, http://dx.doi.org/10.1007/978-1-4613-3315-9_29
Lee, Z.-P. (2005). A model for the diffuse attenuation coefficient of downwelling irradiance. Journal of Geophysical Research, 110(C2). http://dx.doi.org/10.1029/2004jc002275
O'Reilly, J.E. & 24 co-authors (2000). SeaWiFS Postlaunch Calibration and Validation Analyses, Part 3. NASA Tech. Memo. 2000-206892, Vol. 11, S.B. Hooker and E.R. Firestone, Eds., NASA Goddard Space Flight Center, 49 pp.
Yeh, E-N. & 7 co-authors (1997). Case Studies for SeaWiFS Calibration and Validation, Part 4. NASA Tech. Memo. 104566, Vol. 41, S.B. Hooker and E.R. Firestone, Eds., NASA Goddard Space Flight Center, 35 pp.
Werdell, P. J. & Bailey, S. W. (2005). An improved bio-optical data set for ocean color algorithm development and satellite data product validation. Remote Sensing of Environment 98, 122-140, http://dx.doi.org/10.1016/j.rse.2005.07.001.
| 2022-05-16T22:53:42 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 1, "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.45879194140434265, "perplexity": 10115.622078355083}, "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/1652662512249.16/warc/CC-MAIN-20220516204516-20220516234516-00478.warc.gz"}
|
https://www.itl.nist.gov/div898/software/dataplot/refman1/auxillar/arma.htm
|
Dataplot Vol 1 Vol 2
# ARMA
Name:
ARMA
Type:
Analysis Command
Purpose:
The ARMA command is used to fit an autoregressive/moving average (ARMA) model to a univariate time series.
Description:
ARMA models are a method for modeling univariate time series.
Autoregressive models are defined by:
$$X_t = \bar{X} + \phi_{1} X_{t-1} + \phi_{2} X_{t-2} + ... + \phi{p} X_{t-p} + A_t$$
where Xt is the series and $$\bar{X}$$ is the mean of the series, At represent normally distributed random errors, and the $$\phi_1, ..., \phi_p$$ are the parameters of the model. Autoregressive models are simply a linear regression of the current value of the series against one or more prior values of the series. The value of p is called the order of the model.
Moving average models are defined by:
$$X_t = \bar{X} + A_{t} - \theta_{1} A_{t-1} - \theta_{2} A_{t-2} - ... - \theta{q} A_{t-q}$$
where Xt is the series and $$\bar{X}$$ is the mean of the series, At-i represent random shocks of one or more prior points of the series, and the $$\theta_1, ..., \theta_q$$ are the parameters of the model. The random shocks are assumed to come from a common (typically normal) distribution with common location and scale. The primary idea behind the moving average model is that the random shocks are propogated to future values of the series. Fitting moving average models require iterative, non-linear fitting techniques.
The power of ARMA models is that they can incorporate both autoregressive terms and moving average terms. The use of ARMA models was popularized by Box and Jenkins. Although both AR and MA models were previously known and used, Box and Jenkins provided a systematic approach for modeling both AR and MA terms in the model. ARMA models are also commonly known as Box-Jenkins models or ARIMA models.
ARMA models assume that the data are stationary, i.e. the data have constant location and scale. Trend can often be removed from a nonstationary series to achieve stationarity. Differencing is a common approach for removing trend. The first difference is defined as Xt - Xt-1. In most cases, a single differencing is sufficient. However, more than one differencing can be applied if necessary. You can also fit a linear or non-linear model to remove trend.
ARMA models can also incorporate seasonal terms (and seasonal differencing). See Box and Jenkins for the complete mathematical description of this model.
ARMA models typically require fairly long series (at least 50 points is recommended by some authors). Also, if the series is dominated by trend and seasonal components, a trend/seasonality/residual decomposition method may be preferred. Dataplot supports a SEASONAL LOWESS command for this type of decomposition.
The typical components for fitting ARMA models is:
1. Model Identification
2. Model Fitting
3. Model Validation
The ARMA command addresses (2), model fitting. Model identification for ARMA models can be difficult and require a fair amount of experience. See the various time series texts that describe ARMA modeling for more guidance on ARMA model identification. Model validation is similar to the nonlinear fitting case (i.e., various residual plots). Again, see texts that describe nonlinear model fitting.
Syntax:
ARMA <y> <diff> <ma> <sar> <sdiff> <sma> <speriod>
<SUBSET/EXCEPT/FOR qualification>
where <y> is the response variable;
<ar> is the order of the auto-regressive terms;
<diff> is the number of differences to apply (typically 0, 1, or 2);
<ma> is the order ot the moving average terms;
<sar> is the order of seasonal auto-regressive terms;
<sdiff> is the number of seasonal differences to apply (typically 0, 1, or 2);
<sma> is the order of seasonal moving average terms;
<speriod> is the period for seasonal terms (defaults to 12);
and where the <SUBSET/EXCEPT/FOR qualification> is optional.
If there is no seasonal component, the <sar>, <sdiff>, <sma>, and <speriod> terms can be omitted.
Examples:
ARMA Y 2 0 1
ARMA Y 2 0 1 1 0 1 12
Note:
To minimize the amount of screen output, but to also to keep the maximum amount of information, Dataplot writes most of the output to files. Speficially,
• dpst1f.dat - the parameters and the standard deviations of the parameters from the ARMA fit. The order is:
1. Autoregressive terms
2. Seasonal autoregressive terms
3. Mean term
4. Moving average terms
5. Seasonal moving average terms
• dpst2f.dat - this file contains:
1. Row number
2. Original series (i.e., Y)
3. Predicted values
4. Standard deviation of predicted values
5. Residuals
6. Standardized residuals
• dpst3f.dat - Intermediate outut from iterations before convergence. This is generally useful if the ARMA fit does not converge.
• dpst4f.dat - The parameter variance-covariance matrix.
• dpst5f.dat - The forecast values for (N/10)+1 observations ahead. Specifically,
1. The forecasted values
2. The standard deviation of the forecasted values.
3. The lower 95% confidence band for the forecast.
4. The upper 95% confidence band for the forecast.
Note:
Dataplot allows you to define the starting values by defining the variable ARPAR. The order of the parameters is as given for the file dpst1f.dat above. By default, all parameters are set to 0.5 except for the mean term which is set to 0.
In addition, you can define the variable ARFIXED to fix certain parameters to their start values. That is, you define ARPAR to specify the start values. If the corresponding element of ARFIXED is zero, the parameter is estimated as usual. If ARFIXED is one, then the parameter is fixed at the start value. The most common use of this is to set certain parameters to zero. For example, if you fit an AR(2) model and you want the AR(1) term to be zero, you could enter the following:
LET ARPAR = DATA 0 1
LET ARFIXED = DATA 1 0
Note:
Dataplot uses the STARPAC library (developed by Janet Rogers and Peter Tyrone of NIST) to compute the ARIMA estimates.
Default:
None
Synonyms:
None
Related Commands:
AUTOCORRELATION PLOT = Generate an autocorrelation plot. PARTIAL AUTOCORRELATION PLOT = Generate a partial autocorrelation plot. SPECTRAL PLOT = Generate a spectral plot. SEASONAL LOWESS = Perform a seasonal lowess. FIT = Carries out a least squares fit.
Reference:
Box and Jenkins (1976), "Time Series Analysis: Forecasting and Control," Holden-Day,
Chatfield (1989), "The Analysis of Time Series: An Introduction," Fourth Edition, Chapman & Hall.
Applications:
Time Series Analysis
Implementation Date:
2000/1
Program:
skip 0
delete junk1 junk2
let arpar = data 0.1 0.1 0.1
arma y 3 0 0
This program generates the following output.
************************************
** let arpar = data 0.1 0.1 0.1 **
************************************
THE NUMBER OF VALUES GENERATED FOR THE VARIABLE ARPAR = 3
THE FIRST COMPUTED VALUE OF ARPAR = 0.1000000E+00 (ROW 1)
THE LAST ( 3-TH) COMPUTED VALUE OF ARPAR = 0.1000000E+00 (ROW 3)
THE CURRENT COLUMN FOR THE VARIABLE ARPAR = 2
THE CURRENT LENGTH OF THE VARIABLE ARPAR = 3
********************
** arma y 3 0 0 **
********************
#############################################################
# NONLINEAR LEAST SQUARES ESTIMATION FOR THE PARAMETERS OF #
# AN ARIMA MODEL USING BACKFORECASTS #
#############################################################
SUMMARY OF INITIAL CONDITIONS
------------------------------
MODEL SPECIFICATION
FACTOR (P D Q) S
1 3 0 0 1
DEFAULT SCALING USED FOR ALL PARAMETERS.
##STEP SIZE FOR
######PARAMETER ##APPROXIMATING
#################PARAMETER DESCRIPTION STARTING VALUES #####DERIVATIVE
INDEX #########TYPE ##ORDER ##FIXED ##########(PAR) ##########(STP)
1 AR (FACTOR 1) 1 NO 0.10000000E+00 0.22896898E-05
2 AR (FACTOR 1) 2 NO 0.10000000E+00 0.22688602E-05
3 AR (FACTOR 1) 3 NO 0.10000000E+00 0.22438846E-05
4 MU ### NO 0.10000000E+01 0.25174593E-05
NUMBER OF OBSERVATIONS (N) 559
MAXIMUM NUMBER OF ITERATIONS ALLOWED (MIT) 500
MAXIMUM NUMBER OF MODEL SUBROUTINE CALLS ALLOWED 1000
CONVERGENCE CRITERION FOR TEST BASED ON THE
FORECASTED RELATIVE CHANGE IN RESIDUAL SUM OF SQUARES (STOPSS) 0.1000E-09
MAXIMUM SCALED RELATIVE CHANGE IN THE PARAMETERS (STOPP) 0.1489E-07
MAXIMUM CHANGE ALLOWED IN THE PARAMETERS AT FIRST ITERATION (DELTA) 100.0
RESIDUAL SUM OF SQUARES FOR INPUT PARAMETER VALUES 0.3537E+07
(BACKFORECASTS INCLUDED)
RESIDUAL STANDARD DEVIATION FOR INPUT PARAMETER VALUES (RSD) 79.84
BASED ON DEGREES OF FREEDOM 559 - 0 - 4 = 555
NONDEFAULT VALUES....
AFCTOL.... V(31) = 0.2225074-307
##### RESIDUAL SUM OF SQUARES CONVERGENCE #####
ESTIMATES FROM LEAST SQUARES FIT (* FOR FIXED PARAMETER)
########################################################
PARAMETER STD DEV OF ###PAR/ ##################APPROXIMATE
ESTIMATES ####PARAMETER ####(SD 95 PERCENT CONFIDENCE LIMITS
TYPE ORD ###(OF PAR) ####ESTIMATES ##(PAR) #######LOWER ######UPPER
FACTOR 1
AR 1 0.58969407E+00 0.41925732E-01 14.07 0.52061708E+00 0.65877107E+00
AR 2 0.23795137E+00 0.47746327E-01 4.98 0.15928434E+00 0.31661840E+00
AR 3 0.15884704E+00 0.41922036E-01 3.79 0.89776135E-01 0.22791795E+00
MU ## 0.11472145E+03 0.78615948E+00 145.93 0.11342617E+03 0.11601673E+03
NUMBER OF OBSERVATIONS (N) 559
RESIDUAL SUM OF SQUARES 108.9505
(BACKFORECASTS INCLUDED)
RESIDUAL STANDARD DEVIATION 0.4430657
BASED ON DEGREES OF FREEDOM 559 - 0 - 4 = 555
APPROXIMATE CONDITION NUMBER 89.28687
PARAMETERS, SD(PARAMETERS), 1/SD(PAR), LOWER AND UPPER
95% CONFIDENCE INTERVAL WRITTEN OUT TO FILE DPST1F.DAT
ORDER IS:
1. AUTO_REGRESSIVE TERMS
2. SEASONAL AUTO_REGRESSIVE TERMS
3. MU (MEAN TERM)
4. MOVING AVERAGE TERMS
5. SEASONAL MOVING AVERAGE TERMS
FOLLOWING WRITTEN OUT TO FILE DPST2F.DAT
1. ROW NUMBER
2. PREDICTED VALUES
3. STANDARD DEVIATION OF PREDICTED VALUES
4. RESIDUALS
5. STANDARDIZED RESIDUALS
RESULTS OF ITERATIONS WRITTEN OUT TO FILE DPST3F.DAT
PARAMETER VARIANCE-COVARIANCE MATRIX WRITTEN OUT TO FILE DPST4F.DAT
FORECAST, STANDARD DEVIATION OF FORECASTS, AND
95% CONFIDENCE INTERVAL FOR FORECAST WRITTEN TO FILE DPST5F.DAT
NIST is an agency of the U.S. Commerce Department.
Date created: 6/5/2001
Last updated: 12/15/2013
| 2018-05-27T15:08: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": 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.7465269565582275, "perplexity": 4471.693261505571}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2018-22/segments/1526794868316.29/warc/CC-MAIN-20180527131037-20180527151037-00230.warc.gz"}
|
https://pos.sissa.it/332/041/
|
Volume 332 - XIV International Conference on Heavy Quarks and Leptons (HQL2018) - Spectroscopy
Analysis of $\gamma \gamma$ to $J/\psi \gamma$
Y. Seino,* H. Miyata, K. Hayasaka On behalf of the BELLE Collaboration
*corresponding author
Full text: pdf
Pre-published on: 2018 December 05
Published on: 2018 December 11
Abstract
The production of charmonium states from two-photon collisions has been measured and searched for by the Belle Collaboration at the KEKB $e^{+}e^{-}$ collider. In this analysis, the process $\gamma \gamma \rightarrow X \rightarrow J/\psi\gamma$, $J/\psi \rightarrow \ell^{+} \ell^{-} (\ell = e \: {\rm or} \: \mu)$ is analyzed by using a 971.1 fb$^{-1}$ Belle data sample, where $X$ is a charmonium state. Previously, Belle and CLEO collaborations have reported measurements of $\gamma \gamma \rightarrow \chi_{c2}(1P) \rightarrow J/\psi\gamma$, $J/\psi \rightarrow \ell^{+} \ell^{-}$ using 32.6 fb$^{-1}$ and 14.4 fb$^{-1}$ data samples, respectively. By analyzing an about 30 times larger data sample, we perform a more precise measurement of the $\chi_{c2}(1P)$ and search for other charmonium(-like) states. From the Monte Carlo samples the detection efficiency is estimated to be 7-15% under some conditions. Also shown are the results of a feasibility study using a signal MC sample from which the expected accuracy for a measurement of the $\chi_{c2}(1P)$ is evaluated.
We obtain $\Gamma_{\gamma\gamma}(\chi_{c2}(1P))$$\mathcal{B}(\chi_{c2}(1P)$$\rightarrow$$J/\psi\gamma)$$\mathcal{B}(J/\psi$$\rightarrow$$\ell^{+} \ell^{-})$=13.5$\pm$0.2 (stat.)$\pm$0.5(syst.) eV. It turns out that the statistical error will be 1.5%. This result is 6.5 times more precise than the previous one.
DOI: https://doi.org/10.22323/1.332.0041
Open Access
Copyright owned by the author(s) under the term of the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
| 2019-01-16T10:10: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": 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.6777476668357849, "perplexity": 2367.9593735674616}, "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-04/segments/1547583657151.48/warc/CC-MAIN-20190116093643-20190116115643-00566.warc.gz"}
|
https://lammps.sandia.gov/doc/fix_nve_spin.html
|
# fix nve/spin command
## Syntax
fix ID group-ID nve/spin keyword values
• ID, group-ID are documented in fix command
• nve/spin = style name of this fix command
• keyword = lattice
lattice value = moving or frozen
moving = integrate both spin and atomic degress of freedom
frozen = integrate spins on a fixed lattice
## Examples
fix 3 all nve/spin lattice moving
fix 1 all nve/spin lattice frozen
## Description
Perform a symplectic integration for the spin or spin-lattice system.
The lattice keyword defines if the spins are integrated on a lattice of fixed atoms (lattice = frozen), or if atoms are moving (lattice = moving). The first case corresponds to a spin dynamics calculation, and the second to a spin-lattice calculation. By default a spin-lattice integration is performed (lattice = moving).
The nve/spin fix applies a Suzuki-Trotter decomposition to the equations of motion of the spin lattice system, following the scheme:
according to the implementation reported in (Omelyan).
A sectoring method enables this scheme for parallel calculations. The implementation of this sectoring algorithm is reported in (Tranchida).
## Restrictions
This fix style can only be used if LAMMPS was built with the SPIN package. See the Build package doc page for more info.
To use the spin algorithm, it is necessary to define a map with the atom_modify command. Typically, by adding the command:
atom_modify map array
before you create the simulation box. Note that the keyword “hash” instead of “array” is also valid.
## Default
The option default is lattice = moving.
(Omelyan) Omelyan, Mryglod, and Folk. Phys. Rev. Lett. 86(5), 898. (2001).
(Tranchida) Tranchida, Plimpton, Thibaudeau and Thompson, Journal of Computational Physics, 372, 406-425, (2018).
| 2020-10-21T13:36:13 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 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.5039361119270325, "perplexity": 7353.686361036534}, "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/1603107876500.43/warc/CC-MAIN-20201021122208-20201021152208-00135.warc.gz"}
|
https://pdglive.lbl.gov/DataBlock.action?desig=&node=S031TV0&init=0&parCode=S031TV0&cl=T
|
#### $\mathit A_{\mathit Tviol}$( ${{\mathit K}_S^0}$ ${{\mathit K}^{\pm}}{{\mathit \pi}^{+}}{{\mathit \pi}^{-}}$ ) in ${{\mathit D}^{\pm}}$ $\rightarrow$ ${{\mathit K}_S^0}$ ${{\mathit K}^{\pm}}{{\mathit \pi}^{+}}{{\mathit \pi}^{-}}$
C$_{T}{}\equiv$ $\vec {{\mathit p}}_{{{\mathit K}^{+}} }\cdot{}$ ($\vec {{\mathit p}}_{{{\mathit \pi}^{+}} }{\times }\vec {{\mathit p}}_{{{\mathit \pi}^{-}} }$) is a parity-odd correlation of the ${{\mathit K}^{+}}$ , ${{\mathit \pi}^{+}}$ , and ${{\mathit \pi}^{-}}$ momenta for the ${{\mathit D}^{+}}$ . $\bar C_{T}{}\equiv$ $\vec {{\mathit p}}_{{{\mathit K}^{-}} }\cdot{}$ ($\vec {{\mathit p}}_{{{\mathit \pi}^{-}} }{\times }\vec {{\mathit p}}_{{{\mathit \pi}^{+}} }$) is the corresponding quantity for the ${{\mathit D}^{-}}$ . Then A$_{T}{}\equiv$ [$\Gamma (C_{T}>$ 0)$−$ $\Gamma (C_{T}<$ 0)] $/$ [$\Gamma (C_{T}>$ 0)$+$ $\Gamma (C_{T}<$ 0)], and $\bar A_{T}{}\equiv$ [$\Gamma (−\bar C_{T}>$ 0)$−$ $\Gamma (−\bar C_{T}<$ 0)] $/$ [$\Gamma (−\bar C_{T}>$ 0)$+$ $\Gamma (−\bar C_{T}<$ 0)], and A$_{Tviol}{}\equiv$ ${1\over 2}(A_{T}$ $−$ $\bar A_{T}$). C$_{T}$ and $\bar C_{T}$ are commonly referred to as $\mathit T$-odd moments, because they are odd under $\mathit T$ reversal. However, the $\mathit T$-conjugate process ${{\mathit K}_S^0}$ ${{\mathit K}^{\pm}}$ ${{\mathit \pi}^{+}}$ ${{\mathit \pi}^{-}}$ $\rightarrow$ ${{\mathit D}^{\pm}}$ is not accessible, while the $\mathit P$-conjugate process is.
VALUE ($10^{-3}$) EVTS DOCUMENT ID TECN COMMENT
$-12.0$ $\pm10.0$ $\pm4.6$ $21.2$ $\pm0.4$k
2011 E
BABR ${{\mathit e}^{+}}{{\mathit e}^{-}}$ $\approx{}{{\mathit \Upsilon}{(4S)}}$
• • We do not use the following data for averages, fits, limits, etc. • •
$+23$ $\pm62$ $\pm22$ $523$ $\pm32$
2005 E
FOCS ${{\mathit \gamma}}$ A, ${{\overline{\mathit E}}}_{\gamma }{}\approx{}$180 GeV
Conservation Laws:
TIME REVERSAL ($\mathit T$) INVARIANCE
References:
LEES 2011E
PR D84 031103 Search for $\mathit CP$ Violation using $\mathit T$-odd Correlations in ${{\mathit D}^{+}}$ $\rightarrow$ ${{\mathit K}^{+}}{{\mathit K}_S^0}$ ${{\mathit \pi}^{+}}{{\mathit \pi}^{-}}$ and ${{\mathit D}_{{s}}^{+}}$ $\rightarrow$ ${{\mathit K}^{+}}{{\mathit K}_S^0}$ ${{\mathit \pi}^{+}}{{\mathit \pi}^{-}}$ Decays
PL B622 239 Search for $\mathit T$ Violation in Charm Meson Decays
| 2022-12-07T19:15:35 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.9819287061691284, "perplexity": 2752.4864960946556}, "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/1669446711218.21/warc/CC-MAIN-20221207185519-20221207215519-00666.warc.gz"}
|
https://www.usgs.gov/media/files/germanium-2017-tables-only-release
|
# Germanium in 2017, tables-only release
Germanium in 2017, tables-only release
## Detailed Description
Advance data tables (XLSX format) for the germanium chapter of the Minerals Yearbook 2017. A version with an embedded text document and also a PDF of text and tables will follow.
| 2021-01-24T13:55: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.9173538684844971, "perplexity": 10787.708270287985}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2021-04/segments/1610703548716.53/warc/CC-MAIN-20210124111006-20210124141006-00088.warc.gz"}
|
https://www.usgs.gov/publications/rank-score-and-permutation-testing-alternatives-regression-quantile-estimates
|
# Rank score and permutation testing alternatives for regression quantile estimates
January 1, 2006
Performance of quantile rank score tests used for hypothesis testing and constructing confidence intervals for linear quantile regression estimates (0 ≤ τ ≤ 1) were evaluated by simulation for models with p = 2 and 6 predictors, moderate collinearity among predictors, homogeneous and hetero-geneous errors, small to moderate samples (n = 20–300), and central to upper quantiles (0.50–0.99). Test statistics evaluated were the conventional quantile rank score T statistic distributed as χ2 random variable with q degrees of freedom (where q parameters are constrained by H 0:) and an F statistic with its sampling distribution approximated by permutation. The permutation F-test maintained better Type I errors than the T-test for homogeneous error models with smaller n and more extreme quantiles τ. An F distributional approximation of the F statistic provided some improvements in Type I errors over the T-test for models with > 2 parameters, smaller n, and more extreme quantiles but not as much improvement as the permutation approximation. Both rank score tests required weighting to maintain correct Type I errors when heterogeneity under the alternative model increased to 5 standard deviations across the domain of X. A double permutation procedure was developed to provide valid Type I errors for the permutation F-test when null models were forced through the origin. Power was similar for conditions where both T- and F-tests maintained correct Type I errors but the F-test provided some power at smaller n and extreme quantiles when the T-test had no power because of excessively conservative Type I errors. When the double permutation scheme was required for the permutation F-test to maintain valid Type I errors, power was less than for the T-test with decreasing sample size and increasing quantiles. Confidence intervals on parameters and tolerance intervals for future predictions were constructed based on test inversion for an example application relating trout densities to stream channel width:depth.
## Citation Information
Publication Year 2006 Rank score and permutation testing alternatives for regression quantile estimates 10.1080/10629360500109168 B.S. Cade, J.D. Richards, P.W. Mielke Article Journal Article Journal of Statistical Computation and Simulation 1015123 USGS Publications Warehouse Fort Collins Science Center
| 2023-03-27T10:45:29 |
{"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.8094168305397034, "perplexity": 2644.6551224683412}, "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-2023-14/segments/1679296948620.60/warc/CC-MAIN-20230327092225-20230327122225-00270.warc.gz"}
|
https://www.zbmath.org/authors/?q=douglas.jesse
|
## Douglas, Jesse
Compute Distance To:
Author ID: douglas.jesse Published as: Douglas, J.; Douglas, Jesse External Links: MacTutor · MGP · Wikidata · GND · IdRef Awards: Fields Medal (1936)
Documents Indexed: 148 Publications since 1917, including 1 Book Biographic References: 7 Publications Co-Authors: 1 Co-Author with 3 Joint Publications 4 Co-Co-Authors
### Co-Authors
145 single-authored 3 Franklin, Philip
all top 5
### Serials
64 Bulletin of the American Mathematical Society 39 Proceedings of the National Academy of Sciences of the United States of America 14 Transactions of the American Mathematical Society 9 Journal of Mathematics and Physics 6 Annals of Mathematics. Second Series 4 American Journal of Mathematics 4 Duke Mathematical Journal 2 Mathematische Annalen 2 Scripta Mathematica 2 Annali della Scuola Normale Superiore di Pisa. II. Ser 1 American Mathematical Monthly
### Fields
7 Differential geometry (53-XX) 6 Calculus of variations and optimal control; optimization (49-XX) 1 Group theory and generalizations (20-XX) 1 Functions of a complex variable (30-XX)
### Citations contained in zbMATH Open
49 Publications have been cited 454 times in 378 Documents Cited by Year
Solution of the inverse problem of the calculus of variations. JFM 67.1038.01
Douglas, J.
1941
Solution of the problem of Plateau. Zbl 0001.14102
Douglas, Jesse
1931
Solution of the problem of Plateau. JFM 57.1542.03
Douglas, J.
1931
The general geometry of paths. JFM 54.0757.06
Douglas, J.
1928
Solution of the inverse problem of the calculus of variations. Zbl 0025.18102
Douglas, Jesse
1941
Solution of the problem of Plateau. JFM 57.0601.01
Douglas, J.
1931
Minimal surfaces of higher topological structure. JFM 65.0454.01
Douglas, J.
1939
Minimal surfaces of higher topological structure. Zbl 0020.37402
Douglas, Jesse
1939
The problem of Plateau for two contours. Zbl 0004.15403
Douglas, Jesse
1931
A method of numerical solution of the problem of Plateau. JFM 54.0509.02
Douglas, J.
1928
On the supersolvability of bicyclic groups. Zbl 0099.01403
Douglas, Jesse
1961
Systems of $$K$$-dimensional manifolds in an $$N$$-dimensional space. Zbl 0003.16902
Douglas, Jesse
1931
On finite groups with two independent generators. I. Zbl 0043.02403
Douglas, Jesse
1951
Geometry of polygons in the complex plane. JFM 66.0728.03
Douglas, J.
1940
Some new results in the problem of Plateau. Zbl 0013.41703
Douglas, Jesse
1936
One-sided minimal surfaces with a given boundary. JFM 58.1245.03
Douglas, J.
1932
One-sided minimal surfaces with a given boundary. Zbl 0005.37603
Douglas, Jesse
1932
Minimal surfaces of general topological structure with any finite number of assigned boundaries. Zbl 0015.02803
Douglas, Jesse
1936
The most general form of the problem of Plateau. Zbl 0021.32801
Douglas, Jesse
1939
Solution of the inverse problem of the calculus of variations. Zbl 0023.13702
Douglas, Jesse
1939
On linear polygon transformations. JFM 66.0045.01
Douglas, J.
1940
Green’s function and the problem of Plateau. JFM 65.0454.02
Douglas, J.
1939
Some new results in the problem of Plateau. JFM 62.1462.02
Douglas, J.
1936
Theorems in the inverse problem in the calculus of variations. Zbl 0027.07001
Douglas, Jesse
1940
On linear polygon transformations. Zbl 0060.34111
Douglas, Jesse
1940
Green’s function and the problem of Plateau. JFM 64.0718.03
Douglas, J.
1938
The problem of Plateau for two contours. Correction. JFM 57.0600.02
Douglas, J.
1931
The mapping theorem of Koebe and the problem of Plateau. JFM 57.1543.01
Douglas, J.
1931
A criterion for the conformal equivalence of a Riemann space to a euclidean space. JFM 51.0568.02
Douglas, J.
1925
Minimal surfaces of higher topological structure. Zbl 0019.26802
Douglas, Jesse
1938
Green’s function and the problem of Plateuau. Zbl 0019.26901
Douglas, Jesse
1938
The most general form of the problem of Plateau. Zbl 0019.26902
Douglas, Jesse
1938
Theorems in the inverse problem of the calculus of variations. JFM 66.1272.02
Douglas, J.
1940
The most general form of the problem of Plateau. JFM 65.0456.02
Douglas, J.
1939
Solution of the inverse problem of the calculus of variations. JFM 65.1293.03
Douglas, J.
1939
The most general form of the problem of Plateau. JFM 64.0718.04
Douglas, J.
1938
Remarks on Riemann’s doctoral dissertation. JFM 64.1186.02
Douglas, J.
1938
Minimal surfaces of general topological structure with any finite number of assigned boundaries. JFM 62.1462.03
Douglas, J.
1936
The problem of Plateau. JFM 59.0669.02
Douglas, J.
1933
Reduction of the problem of Plateau to an integral equation. JFM 53.0385.08
Douglas, J.
1927
Reduction to integral equations of the problem of Plateau for the case of two contours. JFM 53.0385.09
Douglas, J.
1927
Extremals and transversality of the general calculus of variations problem of the first order in space. JFM 53.0483.02
Douglas, J.
1927
The mapping theorem of Koebe and the problem of Plateau. Zbl 0002.26901
Douglas, Jesse
1931
Seven theorems in the problem of Plateau. Zbl 0003.32801
Douglas, Jesse
1932
A Jordan space curve no arc of which can form part of a contour which bounds a finite area. Zbl 0009.02402
Douglas, Jesse
1934
Remarks on Riemann’s doctoral dissertation. Zbl 0019.21805
Douglas, Jesse
1938
The analytic prolongation of a minimal surface over a rectilinear segment of its boundary. Zbl 0020.37401
Douglas, Jesse
1939
On finite groups with two independent generators. II. Zbl 0044.01401
Douglas, Jesse
1951
On the basis theorem for finite abelian groups. IV. Zbl 0053.01302
Douglas, Jesse
1953
On the supersolvability of bicyclic groups. Zbl 0099.01403
Douglas, Jesse
1961
On the basis theorem for finite abelian groups. IV. Zbl 0053.01302
Douglas, Jesse
1953
On finite groups with two independent generators. I. Zbl 0043.02403
Douglas, Jesse
1951
On finite groups with two independent generators. II. Zbl 0044.01401
Douglas, Jesse
1951
Solution of the inverse problem of the calculus of variations. JFM 67.1038.01
Douglas, J.
1941
Solution of the inverse problem of the calculus of variations. Zbl 0025.18102
Douglas, Jesse
1941
Geometry of polygons in the complex plane. JFM 66.0728.03
Douglas, J.
1940
On linear polygon transformations. JFM 66.0045.01
Douglas, J.
1940
Theorems in the inverse problem in the calculus of variations. Zbl 0027.07001
Douglas, Jesse
1940
On linear polygon transformations. Zbl 0060.34111
Douglas, Jesse
1940
Theorems in the inverse problem of the calculus of variations. JFM 66.1272.02
Douglas, J.
1940
Minimal surfaces of higher topological structure. JFM 65.0454.01
Douglas, J.
1939
Minimal surfaces of higher topological structure. Zbl 0020.37402
Douglas, Jesse
1939
The most general form of the problem of Plateau. Zbl 0021.32801
Douglas, Jesse
1939
Solution of the inverse problem of the calculus of variations. Zbl 0023.13702
Douglas, Jesse
1939
Green’s function and the problem of Plateau. JFM 65.0454.02
Douglas, J.
1939
The most general form of the problem of Plateau. JFM 65.0456.02
Douglas, J.
1939
Solution of the inverse problem of the calculus of variations. JFM 65.1293.03
Douglas, J.
1939
The analytic prolongation of a minimal surface over a rectilinear segment of its boundary. Zbl 0020.37401
Douglas, Jesse
1939
Green’s function and the problem of Plateau. JFM 64.0718.03
Douglas, J.
1938
Minimal surfaces of higher topological structure. Zbl 0019.26802
Douglas, Jesse
1938
Green’s function and the problem of Plateuau. Zbl 0019.26901
Douglas, Jesse
1938
The most general form of the problem of Plateau. Zbl 0019.26902
Douglas, Jesse
1938
The most general form of the problem of Plateau. JFM 64.0718.04
Douglas, J.
1938
Remarks on Riemann’s doctoral dissertation. JFM 64.1186.02
Douglas, J.
1938
Remarks on Riemann’s doctoral dissertation. Zbl 0019.21805
Douglas, Jesse
1938
Some new results in the problem of Plateau. Zbl 0013.41703
Douglas, Jesse
1936
Minimal surfaces of general topological structure with any finite number of assigned boundaries. Zbl 0015.02803
Douglas, Jesse
1936
Some new results in the problem of Plateau. JFM 62.1462.02
Douglas, J.
1936
Minimal surfaces of general topological structure with any finite number of assigned boundaries. JFM 62.1462.03
Douglas, J.
1936
A Jordan space curve no arc of which can form part of a contour which bounds a finite area. Zbl 0009.02402
Douglas, Jesse
1934
The problem of Plateau. JFM 59.0669.02
Douglas, J.
1933
One-sided minimal surfaces with a given boundary. JFM 58.1245.03
Douglas, J.
1932
One-sided minimal surfaces with a given boundary. Zbl 0005.37603
Douglas, Jesse
1932
Seven theorems in the problem of Plateau. Zbl 0003.32801
Douglas, Jesse
1932
Solution of the problem of Plateau. Zbl 0001.14102
Douglas, Jesse
1931
Solution of the problem of Plateau. JFM 57.1542.03
Douglas, J.
1931
Solution of the problem of Plateau. JFM 57.0601.01
Douglas, J.
1931
The problem of Plateau for two contours. Zbl 0004.15403
Douglas, Jesse
1931
Systems of $$K$$-dimensional manifolds in an $$N$$-dimensional space. Zbl 0003.16902
Douglas, Jesse
1931
The problem of Plateau for two contours. Correction. JFM 57.0600.02
Douglas, J.
1931
The mapping theorem of Koebe and the problem of Plateau. JFM 57.1543.01
Douglas, J.
1931
The mapping theorem of Koebe and the problem of Plateau. Zbl 0002.26901
Douglas, Jesse
1931
The general geometry of paths. JFM 54.0757.06
Douglas, J.
1928
A method of numerical solution of the problem of Plateau. JFM 54.0509.02
Douglas, J.
1928
Reduction of the problem of Plateau to an integral equation. JFM 53.0385.08
Douglas, J.
1927
Reduction to integral equations of the problem of Plateau for the case of two contours. JFM 53.0385.09
Douglas, J.
1927
Extremals and transversality of the general calculus of variations problem of the first order in space. JFM 53.0483.02
Douglas, J.
1927
A criterion for the conformal equivalence of a Riemann space to a euclidean space. JFM 51.0568.02
Douglas, J.
1925
all top 5
all top 5
### Cited in 150 Serials
20 Journal of Mathematical Physics 18 Mathematische Zeitschrift 18 Differential Geometry and its Applications 15 Transactions of the American Mathematical Society 13 Archive for Rational Mechanics and Analysis 10 Mathematische Annalen 8 Journal of Geometry and Physics 8 Annali di Matematica Pura ed Applicata. Serie Quarta 8 Calculus of Variations and Partial Differential Equations 7 Journal of Nonlinear Mathematical Physics 7 Bulletin of the American Mathematical Society 6 International Journal of Theoretical Physics 6 Proceedings of the American Mathematical Society 6 The Journal of Geometric Analysis 6 International Journal of Geometric Methods in Modern Physics 5 Journal of Mathematical Analysis and Applications 4 Acta Mathematica 4 Annales de l’Institut Fourier 4 Applied Mathematics and Computation 4 Inventiones Mathematicae 4 Manuscripta Mathematica 4 Results in Mathematics 4 Nonlinear Dynamics 4 Algebras and Representation Theory 3 General Relativity and Gravitation 3 Mathematical Proceedings of the Cambridge Philosophical Society 3 Reports on Mathematical Physics 3 Advances in Mathematics 3 Archiv der Mathematik 3 Numerische Mathematik 3 Proceedings of the Japan Academy. Series A 3 Journal de Mathématiques Pures et Appliquées. Neuvième Série 3 Linear Algebra and its Applications 3 Bulletin of the American Mathematical Society. New Series 3 International Journal of Bifurcation and Chaos in Applied Sciences and Engineering 3 Geometry & Topology 3 Journal of High Energy Physics 3 Advances in Calculus of Variations 2 Modern Physics Letters A 2 Acta Mathematica Academiae Scientiarum Hungaricae 2 Acta Mechanica 2 Jahresbericht der Deutschen Mathematiker-Vereinigung (DMV) 2 Journal d’Analyse Mathématique 2 Nuclear Physics. B 2 Beiträge zur Algebra und Geometrie 2 Duke Mathematical Journal 2 Indiana University Mathematics Journal 2 Journal of Pure and Applied Algebra 2 Journal of Soviet Mathematics 2 European Journal of Combinatorics 2 Annals of Global Analysis and Geometry 2 International Journal of Mathematics 2 Annales de l’Institut Henri Poincaré. Physique Théorique 2 Journal of Nonlinear Science 2 Journal of Mathematical Sciences (New York) 2 Mathematics and Mechanics of Solids 2 Journal of the European Mathematical Society (JEMS) 2 Communications in Nonlinear Science and Numerical Simulation 2 Communications in Contemporary Mathematics 2 Journal of the Australian Mathematical Society 2 Monatshefte für Mathematik und Physik 2 Annali della Scuola Normale Superiore di Pisa. II. Ser 2 Ars Mathematica Contemporanea 2 International Journal of Applied and Computational Mathematics 1 International Journal of Modern Physics A 1 Communications in Mathematical Physics 1 Computer Methods in Applied Mechanics and Engineering 1 Computer Physics Communications 1 Israel Journal of Mathematics 1 Journal of Computational Physics 1 Journal of Fluid Mechanics 1 Journal of the Mechanics and Physics of Solids 1 Mathematische Semesterberichte 1 Physics Letters. A 1 Physics Reports 1 Rocky Mountain Journal of Mathematics 1 Theoretical and Mathematical Physics 1 Mathematics of Computation 1 Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg 1 Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica 1 The Annals of Probability 1 Annali della Scuola Normale Superiore di Pisa. Classe di Scienze. Serie IV 1 BIT 1 Bulletin de la Société Mathématique de France 1 Canadian Mathematical Bulletin 1 Compositio Mathematica 1 Computing 1 Czechoslovak Mathematical Journal 1 Journal of Algebra 1 Journal of Combinatorial Theory. Series B 1 Journal of Computational and Applied Mathematics 1 Journal of Differential Equations 1 Journal of Functional Analysis 1 Journal für die Reine und Angewandte Mathematik 1 The Journal of Symbolic Logic 1 Matematički Vesnik 1 Memoirs of the American Mathematical Society 1 Monatshefte für Mathematik 1 Nonlinear Analysis. Theory, Methods & Applications. Series A: Theory and Methods 1 Rendiconti del Circolo Matemàtico di Palermo. Serie II ...and 50 more Serials
all top 5
### Cited in 51 Fields
140 Differential geometry (53-XX) 111 Calculus of variations and optimal control; optimization (49-XX) 74 Global analysis, analysis on manifolds (58-XX) 55 Mechanics of particles and systems (70-XX) 33 Partial differential equations (35-XX) 31 Ordinary differential equations (34-XX) 24 Dynamical systems and ergodic theory (37-XX) 22 Quantum theory (81-XX) 17 Functions of a complex variable (30-XX) 17 Numerical analysis (65-XX) 11 Group theory and generalizations (20-XX) 11 Functional analysis (46-XX) 11 Manifolds and cell complexes (57-XX) 10 Relativity and gravitational theory (83-XX) 9 Potential theory (31-XX) 8 Combinatorics (05-XX) 8 Geometry (51-XX) 8 Mechanics of deformable solids (74-XX) 7 History and biography (01-XX) 6 Associative rings and algebras (16-XX) 6 Nonassociative rings and algebras (17-XX) 5 Several complex variables and analytic spaces (32-XX) 5 Convex and discrete geometry (52-XX) 5 Systems theory; control (93-XX) 4 Topological groups, Lie groups (22-XX) 4 Measure and integration (28-XX) 4 Operator theory (47-XX) 4 Probability theory and stochastic processes (60-XX) 3 Fluid mechanics (76-XX) 3 Operations research, mathematical programming (90-XX) 3 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 2 General and overarching topics; collections (00-XX) 2 Field theory and polynomials (12-XX) 2 Category theory; homological algebra (18-XX) 2 Difference and functional equations (39-XX) 2 Algebraic topology (55-XX) 2 Statistics (62-XX) 2 Computer science (68-XX) 2 Statistical mechanics, structure of matter (82-XX) 2 Biology and other natural sciences (92-XX) 1 Mathematical logic and foundations (03-XX) 1 General algebraic systems (08-XX) 1 Commutative algebra (13-XX) 1 Algebraic geometry (14-XX) 1 Linear and multilinear algebra; matrix theory (15-XX) 1 Harmonic analysis on Euclidean spaces (42-XX) 1 Abstract harmonic analysis (43-XX) 1 Integral transforms, operational calculus (44-XX) 1 Integral equations (45-XX) 1 Optics, electromagnetic theory (78-XX) 1 Geophysics (86-XX)
### Wikidata Timeline
The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.
| 2022-07-05T06:56: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": 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.41170740127563477, "perplexity": 999.6812405956808}, "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-00539.warc.gz"}
|
http://dergipark.gov.tr/ijot/issue/35770/339904
|
| | | |
## Ternary Diagram of Bithermal Systems
#### Julien Ramousse [1]
##### 83 105
This paper proposes an original and synthetic graphical representation of bithermal systems operation on a normed ternary diagram (qh, qc, w). Thanks to the normed axes, an intuitive graphical interpretation of the operating conditions is derived by using polar coordinates. The energy flow intensity involved in the system is directly linked to its distance rM to the origin and its efficiency is only related to the angle \alpha defined in this work. Thus, the potential operating modes depending on the energy flow directions, are distributed into sectors of angle \pi/3. In addition to the potentially reversible operating modes (heat engine and heat pump modes), the two dissipative operating modes (forced heat transfer and thermal dissipation modes) are also described. Moreover, the characterization of the operating mode interfaces validates the physical continuity of the proposed description. According to the second law of thermodynamics, the operation of bithermal systems is restricted to the top half-plane bounded by the Carnot boundary (function of the reservoirs temperature ratio). Furthermore, the introduction of an unconventional definition of the energy efficiency when the hot reservoir is used as a heat sink leads to positive and below unity efficiencies in both reversible modes and negative efficiencies in both dissipative modes. In order to illustrate the use of the proposed representation, two examples are introduced: (i) operation of the classical thermodynamics cycles of Carnot, Stirling and Erricson is plotted for graphical interpretation, (ii) endoreversible (exo-irreversible) system representation helps to rediscover graphically the Chambadal/Novikov/Curzon-Ahlborn efficiency (constant energy efficiency at maximum work in heat engine mode).
ternary diagram, polar coordinates, bithermal systems operating modes, energy conversion efficiency
• [1] S. Carnot, Réflexions sur la puissance motrice du feu et sur les machines propres à développer cette puissance. Paris: Bachelier, 1824. (transl. Carnot NLS, Thurston RH, Reflections on the motive power of heat, and on machines fitted to develop that power. New York: John Wiley & Sons, 1897).
• [2] R. Clausius, “Ueber die bewegende Kraft der Wärme und die Gesetze, welche sich daraus für die Wärmelehre selbst ableiten lassen”, Annalen der Physik, 79: 368–397, 500–524, 1850. (transl. “On the moving force of heat, and the laws regarding the nature of heat itself which are deducible therefrom”, Phil. Mag. 2, 102–119, 1851).
• [3] JP. Joule, “On the mechanical equivalent of heat”, Phil. Trans. R. Soc. 140, 61–82, 1850.
• [4] E. Clapeyron. “Mémoire sur la puissance motrice de la chaleur”, Journal de l’École Royale Polytechnique, 14: 23, 153–190, 1834. (transl. E. Clapeyron and R. Clausius, Memoir on the motive power of heat, in Reflections on the motive power of fire by S. Carnot and other papers on the second law of thermodynamics, Mineola: NY Dover Publications, 1960).
• [5] R. Mollier, Neue Diagramme zur Technischen Wärmelehre, Berlin, 1904. (transl. New Graphs for Technical Thermodynamics).
• [6] A. Bejan, Advanced Engineering Thermodynamics, 4th Ed. Hoboken: Wiley, 2016.
• [7] M. Moran, H. Shapiro. Fundamentals of engineering thermodynamics, 6th Ed. USA: John Wiley & Sons, Inc., 2008.
• [8] L. Borel, D. Favrat. Thermodynamics and Energy Systems Analysis: From Energy to Exergy, Vol. 1. Lausanne: EPFL Press, 2010.
• [9] J.-P. Pérez. Thermodynamique : Fondements et applications, Vol. 1, 3rd Ed. Paris: Dunod, 2001. [in French]
• [10] C. Lhuillier, J. Rous. Introduction à la thermodynamique. Paris: Dunod, 1992. [in French]
• [11] Wikipedia Diagramme de Raveau [Online]. Available: https://fr.wikipedia.org/wiki/Diagramme_de_Raveau (accessed Sep. 25, 2017) [in French].
• [12] G. Alefeld, R. Radermacher. Heat Conversion Systems. Boca Raton: CRC Press, 1993.
• [13] J. Ramousse. “Représentation graphique des modes opératoires des systèmes dithermes”. in SFT 2016, Proceedings of congrès annuel de la Société Française de Thermique, Toulouse, 31 May – 3 June 2016. [in French]
• [14] P. Chambadal. Les centrales nucléaires. Paris : Armand Colin, 1957. [in French]
• [15] I.I. Novikov. “The efficiency of atomic power stations (a review)”. J. Nucl. Energy II, 7, 125-128, 1958.
• [16] F. L. Curzon, B. Ahlborn. “Efficiency of a Carnot engine at maximum power output”. Am. J. Phys., 43, 22-24, 1975.
Birincil Dil en Mühendislik Regular Original Research Article Orcid: 0000-0001-7367-7440Yazar: Julien RamousseÜlke: France
Bibtex @araştırma makalesi { ijot339904, journal = {International Journal of Thermodynamics}, issn = {1301-9724}, eissn = {2146-1511}, address = {Yaşar DEMİREL}, year = {2018}, volume = {21}, pages = {27 - 36}, doi = {10.5541/ijot.339904}, title = {Ternary Diagram of Bithermal Systems}, key = {cite}, author = {Ramousse, Julien} } APA Ramousse, J . (2018). Ternary Diagram of Bithermal Systems. International Journal of Thermodynamics, 21 (1), 27-36. DOI: 10.5541/ijot.339904 MLA Ramousse, J . "Ternary Diagram of Bithermal Systems". International Journal of Thermodynamics 21 (2018): 27-36 Chicago Ramousse, J . "Ternary Diagram of Bithermal Systems". International Journal of Thermodynamics 21 (2018): 27-36 RIS TY - JOUR T1 - Ternary Diagram of Bithermal Systems AU - Julien Ramousse Y1 - 2018 PY - 2018 N1 - doi: 10.5541/ijot.339904 DO - 10.5541/ijot.339904 T2 - International Journal of Thermodynamics JF - Journal JO - JOR SP - 27 EP - 36 VL - 21 IS - 1 SN - 1301-9724-2146-1511 M3 - doi: 10.5541/ijot.339904 UR - http://dx.doi.org/10.5541/ijot.339904 Y2 - 2018 ER - EndNote %0 International Journal of Thermodynamics Ternary Diagram of Bithermal Systems %A Julien Ramousse %T Ternary Diagram of Bithermal Systems %D 2018 %J International Journal of Thermodynamics %P 1301-9724-2146-1511 %V 21 %N 1 %R doi: 10.5541/ijot.339904 %U 10.5541/ijot.339904 ISNAD Ramousse, Julien . "Ternary Diagram of Bithermal Systems". International Journal of Thermodynamics 21 / 1 (Mart 2018): 27-36. http://dx.doi.org/10.5541/ijot.339904
| 2019-03-21T18:33:45 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 1, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.4343498647212982, "perplexity": 12411.770269197175}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2019-13/segments/1552912202530.49/warc/CC-MAIN-20190321172751-20190321194751-00037.warc.gz"}
|
https://par.nsf.gov/biblio/10381516-transverse-mode-entangled-photon-pair-generation-optical-fiber
|
Transverse-Mode-Entangled Photon-Pair Generation in Optical Fiber
We present our experimental results on generating photon pairs entangled in a transverse-mode Bell state in few-mode optical fiber by controlling the transverse mode of the pump to selectively excite spontaneous four-wave mixing processes.
Authors:
; ; ; ; ; ;
Award ID(s):
Publication Date:
NSF-PAR ID:
10381516
Journal Name:
Conference on Lasers and Electro-Optics
Page Range or eLocation-ID:
FF2J.2
1. Silicon carbide has recently emerged as a promising photonics material due to its unique properties, including possessing strong second- and third-order nonlinear coefficients and hosting various color centers that can be utilized for a wealth of quantum applications. Here, we report the design and demonstration of octave-spanning microcombs in a 4H-silicon-carbide-on-insulator platform for the first time, to our knowledge. Such broadband operation is enabled by optimized nanofabrication achieving$>1$million intrinsic quality factors in a 36-μm-radius microring resonator, and careful dispersion engineering by investigating the dispersion properties of different mode families. For example, for the fundamental transverse-electric mode whose dispersion can be tailored by simply varying the microring waveguide width, we realized a microcomb spectrum covering the wavelength range from 1100 nm to 2400 nm with an on-chip power near 120 mW. While the observed comb state is verified to be chaotic and not soliton, attaining such a large bandwidth is a crucial step towards realizing$f−2f$self-referencing. In addition, we also observed a coherent soliton-crystal state for the fundamental transverse-magnetic mode, which exhibits stronger dispersion than the fundamental transverse-electric mode and hence a narrower bandwidth.
2. We present an ultra-broadband silicon photonic polarization beam splitter (PBS) using adiabatically tapered extreme skin-depth (eskid) waveguides. Highly anisotropic metamaterial claddings of the eskid waveguides suppress the crosstalk of transverse-electric (TE) mode, while the large birefringence of the eskid waveguide efficiently cross-couples the transverse-magnetic (TM) mode. Two eskid waveguides are adiabatically tapered to smoothly translate TM mode to the coupled port via mode evolution while keeping the TE mode in the through port. The tapered cross-section of the eskid PBS was designed numerically, achieving a large bandwidth at 1400–1650 nm with extinction ratios$><#comment/>20dB$. We experimentally demonstrated the tapered-eskid PBS and confirmed its broad bandwidth at 1490–1640 nm, limited by laser bandwidth. With its mode evolution, the tapered-eskid PBS is tolerant to fabrication imperfections and should be crucial for controlling polarizations in photonic circuits.
| 2023-03-29T06:42:58 |
{"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.36615920066833496, "perplexity": 5915.064156311464}, "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/1679296948951.4/warc/CC-MAIN-20230329054547-20230329084547-00338.warc.gz"}
|
https://par.nsf.gov/biblio/10325302-stepwise-reduction-corannulene-based-helical-molecular-nanographene-na-metal
|
This content will become publicly available on May 5, 2023
Stepwise reduction of a corannulene-based helical molecular nanographene with Na metal
The chemical reduction of a corannulene-based molecular nanographene, C 76 H 64 (1), with Na metal in the presence of 18-crown-6 afforded the doubly-reduced state of 1. This reduction provokes a distortion of the helicene core and has a significant impact on the aromaticity of the system.
Authors:
; ; ; ; ; ;
Award ID(s):
Publication Date:
NSF-PAR ID:
10325302
Journal Name:
Chemical Communications
Volume:
58
Issue:
37
Page Range or eLocation-ID:
5574 to 5577
ISSN:
1359-7345
1. In this paper, we make partial progress on a function field version of the dynamical uniform boundedness conjecture for certain one-dimensional families ${\mathcal{F}}$ of polynomial maps, such as the family $f_{c}(x)=x^{m}+c$ , where $m\geq 2$ . We do this by making use of the dynatomic modular curves $Y_{1}(n)$ (respectively $Y_{0}(n)$ ) which parametrize maps $f$ in ${\mathcal{F}}$ together with a point (respectively orbit) of period $n$ for $f$ . The key point in our strategy is to study the set of primes $p$ for which the reduction of $Y_{1}(n)$ modulo $p$ fails to be smooth or irreducible. Morton gave an algorithm to construct, for each $n$ , a discriminant $D_{n}$ whose list of prime factors contains all the primes of bad reduction for $Y_{1}(n)$ . In this paper, we refine and strengthen Morton’s results. Specifically, we exhibit two criteria on a prime $p$ dividing $D_{n}$ : one guarantees that $p$ is in fact a prime of bad reduction for $Y_{1}(n)$ , yet this same criterion implies that $Y_{0}(n)$ is geometrically irreducible. The other guarantees that the reduction of $Y_{1}(n)$ modulo $p$ is actually smooth. As an application of the second criterion, we extend results of Morton, Flynn, Poonen, Schaefer, andmore »
| 2023-03-21T19:49: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.7472735047340393, "perplexity": 531.157357801182}, "config": {"markdown_headings": true, "markdown_code": false, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 20, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2023-14/segments/1679296943746.73/warc/CC-MAIN-20230321193811-20230321223811-00688.warc.gz"}
|
https://deemo.fandom.com/wiki/Light_Orb
|
## FANDOM
433 Pages
The Light Orb system was introduced in the 2.0 update. Its purpose is to accelerate playthroughs by quickening the process of Tree growth to assist players in reaching the ending of the game quicker than previously. The system was greatly improved in the 3.0 update to include Staircase progression.
## Version 2.0 Edit
• Clearing a song has a chance to produce a light orb in any of the following locations: Piano Room, Second Floor or Balcony.
• A maximum of three orbs may be produced in each location.
• Selecting a light orb increases Tree Height by 0.100m.
## Version 3.0 Edit
• System still applies on Main Story playthrough onwards.
• Clearing a song produces a light orb in each of the following locations: Piano Room, Basement, Second Floor, Balcony and Top Floor.
• A maximum of three orbs may be produced in each location.
• Orbs are produced in inaccessible locations as well. They may be selected after the location becomes accessible.
• Having access to multiple locations allows you to select multiple orbs for each song cleared.
• Selecting a light orb increases Tree Height by 0.650m or Staircase Height by 10%.
• The system is active throughout all playthroughs.
## Notes Edit
• The Light Orb system is only available in Deemo and is not available in Deemo: The Last Recital.
• In version 2.0, the maximum tree growth attainable at any instant from Light Orbs alone is 0.900 m: $\text{0.100 m/orb}\times\text{3 orbs/room}\times\text{3 rooms}$.
• In version 3.0:
• The maximum tree growth is 9.750 m.
• The maximum staircase progression is 150% (completes it immediately with enough light orbs).
• If the Tree Height does not increase after a Light Orb is selected, it indicates that a Memory is scheduled to play. Selecting more orbs at this time does not make a difference. Clearing a song plays the Memory and resumes tree growth.
Community content is available under CC-BY-SA unless otherwise noted.
| 2020-04-03T17:28:19 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.3726825416088104, "perplexity": 3995.4681139083254}, "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/1585370515113.54/warc/CC-MAIN-20200403154746-20200403184746-00492.warc.gz"}
|
http://www.scstatehouse.gov/sess118_2009-2010/sj10/20100112.htm
|
South Carolina General Assembly
118th Session, 2009-2010
Journal of the Senate
Tuesday, January 12, 2010
(Statewide Session)
Indicates Matter Stricken
Indicates New Matter
The Senate assembled at 12:00 Noon, 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:
In Ezekiel the Lord says to his people,
" 'A new heart I will give you, and a new spirit I will put within you. ...' " (Ezekiel 36:26)
Friends, let us together bow in prayer:
Holy God, as the second regular session of the 118th South Carolina General Assembly commences today, we call upon You to touch the heart and mind and spirit of each Senator serving in this place. May these leaders be spiritually energized by the hope and promise which You alone can give to them, dear Lord. Encourage the Senators--and their staff members--to think and speak and act in ways that give glory to You, as well as clear encouragement to the people of this State during these challenging and difficult days. Be ever with this nation we love and with those who serve the causes of freedom at home and around the globe. May we all give bold witness to Your new spirit within us throughout this New Year. In Your blessed and holy name we pray, dear Lord.
Amen.
The PRESIDENT called for Petitions, Memorials, Presentments of Grand Juries and such like papers.
MESSAGE FROM THE GOVERNOR
The following appointments were transmitted by the Honorable Mark C. Sanford:
Statewide Appointments
Initial Appointment, South Carolina Board of Real Estate Appraisers, with the term to commence May 31, 2009, and to expire May 31, 2012
Appraiser - General:
Joel W. Norwood, P. O. Box 5956, Greenville, SC 29606 VICE Charles B. Stone
Referred to the Committee on Labor, Commerce and Industry.
Reappointment, South Carolina State Ports Authority, with the term to commence February 13, 2010, and to expire February 13, 2015
At-Large:
John Fleming Hassell III, The Maritime Association, P. O. Box 494, Charleston, SC 29402
Referred to the Committee on Transportation.
Local Appointment
Initial Appointment, Spartanburg County Magistrate, with term to commence April 30, 2007, and to expire April 30, 2011
Tina G. McMillan, 171 Tucapau Road, Wellford, SC 29385 VICE John Marshall Rollins, Jr.
The following were received and referred to the appropriate committees for consideration:
Document No. 4063
Agency: Public Service Commission
Chapter: 103
Statutory Authority: 1976 Code Section 58-3-140
SUBJECT: Workers' Compensation Insurance and Use of Leased Vehicles
Received by Lieutenant Governor January 12, 2010
Referred to Judiciary Committee
Legislative Review Expiration May 12, 2010
Document No. 4066
Agency: Department of Insurance
Chapter: 69
Statutory Authority: 1976 Code Sections 1-23-110 et seq., 38-3-110, 38-72-60 and 38-72-70
SUBJECT: Long Term Care Insurance
Received by Lieutenant Governor May 27, 2009
Referred to Banking and Insurance Committee
Legislative Review Expiration May 3, 2010
Document No. 4067
Agency: South Carolina Criminal Justice Academy
Chapter: 37
Statutory Authority: 1976 Code Sections 23-23-20 et seq., and 23-47-20
SUBJECT: Law Enforcement Officer and E-911 Officer Training & Certification
Received by Lieutenant Governor June 3, 2009
Referred to Judiciary Committee
Legislative Review Expiration May 10, 2010
Document No. 4069
Agency: Department of Natural Resources
Chapter: 123
Statutory Authority: 1976 Code Section 50-15-65
SUBJECT: Regulations for Species or Subspecies of Non-game Wildlife
Received by Lieutenant Governor January 12, 2010
Referred to Fish, Game and Forestry Committee
Legislative Review Expiration May 12, 2010
Document No. 4070
Agency: Department of Health and Environmental Control
Chapter: 61
Statutory Authority: 1976 Code Sections 48-1-10 et seq.
SUBJECT: Air Pollution Control Regulations and Standards
Received by Lieutenant Governor January 12, 2010
Referred to Medical Affairs Committee
Legislative Review Expiration May 12, 2010
Document No. 4072
Agency: Board of Pharmacy
Chapter: 99
Statutory Authority: 1976 Code Sections 40-1-70 and 40-43-60
SUBJECT: Central Fill Pharmacies
Received by Lieutenant Governor June 9, 2009
Referred to Medical Affairs Committee
Legislative Review Expiration May 4, 2010
Document No. 4073
Agency: Public Service Commission
Chapter: 103
Statutory Authority: 1976 Code Section 58-3-140
SUBJECT: Definitions for Charter Bus, Equipped to Carry and Passenger
Received by Lieutenant Governor January 12, 2010
Referred to Judiciary Committee
Legislative Review Expiration May 12, 2010
Document No. 4075
Agency: Board of Cosmetology
Chapter: 35
Statutory Authority: 1976 Code Sections 40-1-70 and 40-13-60
SUBJECT: Requirements of Licensure in the Field of Cosmetology
Received by Lieutenant Governor January 12, 2010
Referred to Labor, Commerce and Industry Committee
Legislative Review Expiration May 12, 2010
Document No. 4078
Agency: Secretary of State
Chapter: 113
Statutory Authority: 1976 Code Sections 30-6-10 to 30-6-70
SUBJECT: Uniform Real Property Recording Act
Received by Lieutenant Governor January 12, 2010
Referred to Judiciary Committee
Legislative Review Expiration May 12, 2010
Document No. 4080
Agency: Department of Health and Environmental Control
Chapter: 61
Statutory Authority: 1976 Code Sections 44-56-10 et seq.
SUBJECT: Hazardous Waste Management
Received by Lieutenant Governor January 12, 2010
Referred to Medical Affairs Committee
Legislative Review Expiration May 12, 2010
Document No. 4081
Agency: Department of Health and Environmental Control
Chapter: 61
Statutory Authority: 1976 Code Sections 44-75-10 et seq.
SUBJECT: Athletic Trainers
Received by Lieutenant Governor January 12, 2010
Referred to Medical Affairs Committee
Legislative Review Expiration May 12, 2010
Document No. 4083
Agency: Department of Insurance
Chapter: 69
Statutory Authority: 1976 Code Sections 1-23-110 et seq., 38-3-110 and 38-57-10 et seq.
SUBJECT: Use of Senior-Specific Certifications and Professional Designations in the Sale of Life Insurance and Annuities
Received by Lieutenant Governor January 12, 2010
Referred to Banking and Insurance Committee
Legislative Review Expiration May 12, 2010
Document No. 4085
Agency: Department of Health and Environmental Control
Chapter: 61
Statutory Authority: 1976 Code Sections 48-1-10 et seq.
SUBJECT: Air Pollution Control Regulations and Standards; Definitions and General Requirements
Received by Lieutenant Governor January 12, 2010
Referred to Medical Affairs Committee
Legislative Review Expiration May 12, 2010
Document No. 4088
Agency: Department of Insurance
Chapter: 69
Statutory Authority: 1976 Code Sections 1-23-110 et seq., 38-3-110, 38-9-180, 38-63-510 et seq., and 38-69-330
SUBJECT: Annuity and Deposit Fund Disclosure
Received by Lieutenant Governor January 12, 2010
Referred to Banking and Insurance Committee
Legislative Review Expiration May 12, 2010
Document No. 4090
Agency: Department of Natural Resources
Chapter: 123
Statutory Authority: 1976 Code Sections 50-1-200, 50-1-220, 50-11-10, 50-11-96, 50-11-105, 50-11-310, 50-11-335, 50-11-390, 50-11-350, 50-11-520, 50-11-530, 50-11-854, 50-11-2200 and 50-11-2210
SUBJECT: Seasons, Limits, Methods of Take and Special Use Restrictions on Wildlife Management Areas; Turkey Hunting Rules and Seasons
Received by Lieutenant Governor January 12, 2010
Referred to Fish, Game and Forestry Committee
Legislative Review Expiration May 12, 2010
Document No. 4091
Agency: Department of Agriculture
Chapter: 5
Statutory Authority: 1976 Code Section 46-21-20
SUBJECT: Seeds
Received by Lieutenant Governor January 12, 2010
Referred to Agriculture and Natural Resources Committee
Legislative Review Expiration May 12, 2010
Document No. 4105
Agency: Clemson University - State Crop Pest Commission
Chapter: 27
Statutory Authority: 1976 Code Section 46-9-40
SUBJECT: Citrus Greening (Candidatus Liberibacter Asisticus) Quarantine
Received by Lieutenant Governor January 12, 2010
Referred to Agriculture and Natural Resources Committee
Legislative Review Expiration May 12, 2010
Document No. 4106
Agency: Clemson University - State Crop Pest Commission
SUBJECT: Phytophthora ramorum Quarantine
Chapter: 27
Statutory Authority: 1976 Code Section 46-9-40
Received by Lieutenant Governor January 12, 2010
Referred to Agriculture and Natural Resources Committee
Legislative Review Expiration May 12, 2010
Document No. 4109
Agency: Department of Social Services
Chapter: 114
Statutory Authority: 1976 Code Sections 43-5-580(b), 63-17-470(d) and 45 CFR 302.56
SUBJECT: Child Support Guidelines
Received by Lieutenant Governor January 12, 2010
Referred to Judiciary Committee
Legislative Review Expiration May 12, 2010
REGULATION WITHDRAWN
Document No. 4016
Agency: Department of Health and Environmental Control
Chapter: 61
Statutory Authority: 1976 Code Section 44-1-180
SUBJECT: Environmental Health Inspections and Fees
Received by Lieutenant Governor January 16, 2009
Referred to Medical Affairs Committee
Legislative Review Expiration Permanently Withdrawn
Permanently Withdrawn July 8, 2009
Doctor of the Day
Senator KNOTTS introduced Dr. John Black of Lexington, S.C., Doctor of the Day.
Leave of Absence
On motion of Senator SHOOPMAN, at 12:15 P.M., Senator THOMAS was granted a leave of absence for today.
Expression of Personal Interest
Senator ELLIOTT rose for an Expression of Personal Interest.
ACTING PRESIDENT PRESIDES
At 1:25 P.M., Senator L. MARTIN assumed the Chair.
Senator COURSON asked unanimous consent to make a motion that he be granted leave, if the issue presents itself, to vote from the balcony as a result of his anticipated shoulder surgery and recovery.
S. 10 (Word version) Sen. Davis
S. 220 (Word version) Sen. Davis
S. 282 (Word version) Sen. Davis
S. 384 (Word version) Sen. Davis
S. 517 (Word version) Sen. S. Martin
S. 629 (Word version) Sens. Lourie, S. Martin
S. 794 (Word version) Sen. Rose
S. 802 (Word version) Sen. Rose
S. 812 (Word version) Sen. Rose
S. 846 (Word version) Sen. Bryant
S. 869 (Word version) Sens. Mulvaney, Nicholson, Reese, Coleman, Scott, Knotts, Cleary, Sheheen, Ford, Massey, Courson, Williams, Peeler, Malloy, Elliott, Land, Jackson, Hayes, Cromer, Setzler, Pinckney, Anderson, McGill, Leatherman, Hutto and Matthews
Prefiled Bills
S. 897 (Word version) Sens. Setzler, Rose, Elliott, Courson, Sheheen
S. 898 (Word version) Sens. Rose, Bryant, Elliott
S. 899 (Word version) Sens. Rose, Elliott
S. 900 (Word version) Sen. Elliott
S. 901 (Word version) Sens. Elliott, Courson
S. 902 (Word version) Sens. Rose, Elliott, Davis
S. 903 (Word version) Sens. Land, Setzler, Sheheen, Scott, Elliott, S. Martin
S. 904 (Word version) Sen. Rose
S. 905 (Word version) Sen. Elliott
S. 906 (Word version) Sens. Coleman, Elliott
S. 908 (Word version) Sen. S. Martin
S. 911 (Word version) Sens. Rose, Elliott
S. 913 (Word version) Sen. Elliott
S. 918 (Word version) Sen. Sheheen
S. 919 (Word version) Sens. Rose, Elliott
S. 920 (Word version) Sen. Elliott
S. 925 (Word version) Sen. Elliott
S. 926 (Word version) Sen. Elliott
S. 927 (Word version) Sen. Elliott
S. 929 (Word version) Sen. Elliott
S. 930 (Word version) Sen. Elliott
S. 933 (Word version) Sens. Hayes, Rose, Cromer, Peeler, Shoopman, L. Martin, S. Martin, Mulvaney, Davis, Campsen, Fair, Campbell, McConnell, Alexander, O'Dell, Bryant
S. 934 (Word version) Sen. Elliott
S. 935 (Word version) Sen. S. Martin
S. 942 (Word version) Sen. Bryant
S. 943 (Word version) Sen. Elliott
S. 944 (Word version) Sen. Bryant
S. 945 (Word version) Sen. Elliott
S. 946 (Word version) Sen. Bryant
S. 947 (Word version) Sen. Rose
S. 949 (Word version) Sen. Elliott
S. 954 (Word version) Sen. Elliott
S. 956 (Word version) Sen. Elliott
S. 957 (Word version) Sen. Elliott
S. 959 (Word version) Sens. Rose, Elliott
S. 961 (Word version) Sen. Elliott
S. 965 (Word version) Sen. Elliott
S. 966 (Word version) Sens. Rose, Elliott
S. 968 (Word version) Sen. Ryberg
S. 972 (Word version) Sen. Rose
S. 973 (Word version) Sens. Rose, Elliott
S. 976 (Word version) Sen. Rose
S. 977 (Word version) Sen. Rose
S. 978 (Word version) Sens. Rose, Bryant
S. 980 (Word version) Sens. S. Martin, Bryant
S. 985 (Word version) Sen. S. Martin
S. 986 (Word version) Sens. Elliott, S. Martin
S. 987 (Word version) Sens. S. Martin, Bryant
S. 993 (Word version) Sen. Elliott
S. 997 (Word version) Sen. S. Martin
S. 998 (Word version) Sen. S. Martin
S. 1010 (Word version) Sens. Bryant, S. Martin
S. 1014 (Word version) Sen. Rose
Senator McCONNELL asked unanimous consent to make a motion that the list of prefiled Bills and Resolutions be entered in the Journal as having been read and referred, as noted, unless any member shall make a motion to refer a Bill to a different committee.
There was no objection and the motion was adopted.
INTRODUCTION OF BILLS AND RESOLUTIONS
The following were introduced:
S. 897 (Word version) -- Senators McConnell, Leatherman, Peeler, Setzler, Rose, Elliott, Courson and Sheheen: A JOINT RESOLUTION TO CREATE THE COMMISSION ON STREAMLINING GOVERNMENT AND REDUCTION OF WASTE AND PROVIDE FOR THE MEMBERSHIP, POWERS, DUTIES, AND FUNCTIONS OF THE COMMISSION; TO PROVIDE A PROCEDURE FOR THE SUBMISSION, CONSIDERATION, APPROVAL, AND IMPLEMENTATION OF RECOMMENDATIONS OF THE COMMISSION; TO PROVIDE FOR STAFF SUPPORT AND FINANCES FOR THE COMMISSION; TO PROVIDE FOR COOPERATION WITH AND SUPPORT FOR THE COMMISSION; TO PROVIDE FOR THE APPLICABILITY OF OTHER LAWS; AND TO PROVIDE FOR ITS TERMINATION.
l:\council\bills\dka\3801dw10.docx
Prefiled and referred to the Committee on Judiciary.
Read the first time and referred to the Committee on Judiciary.
S. 898 (Word version) -- Senators McConnell, Peeler, Rose, Bryant and Elliott: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING SECTION 11-11-85 SO AS TO PROVIDE FOR A ZERO BASE BUDGET PROCESS BEGINNING WITH FISCAL YEAR 2010-2011.
l:\council\bills\nbd\11574sd10.docx
Prefiled and referred to the Committee on Finance.
Read the first time and referred to the Committee on Finance.
S. 899 (Word version) -- Senators McConnell, Rose and Elliott: A JOINT RESOLUTION PROPOSING AN AMENDMENT TO ARTICLE III OF THE CONSTITUTION OF SOUTH CAROLINA, 1895, BY ADDING SECTION 37, SO AS TO PROVIDE THAT THE SENATE MUST ELECT FROM AMONG ITS MEMBERS A PRESIDENT OF THE SENATE TO PRESIDE OVER THE SENATE AND TO PERFORM OTHER DUTIES AS PROVIDED BY LAW; PROPOSING AN AMENDMENT TO SECTION 8, ARTICLE IV, RELATING TO THE ELECTION, QUALIFICATIONS, AND TERM OF THE LIEUTENANT GOVERNOR, SO AS TO PROVIDE FOR THE JOINT ELECTION OF THE GOVERNOR AND LIEUTENANT GOVERNOR; PROPOSING AN AMENDMENT TO ARTICLE IV, RELATING TO THE PRESIDENT PRO TEMPORE OF THE SENATE, SO AS TO DELETE SECTION 9, WHICH PROVIDES THAT THE SENATE MUST CHOOSE A PRESIDENT PRO TEMPORE AND WHICH ALSO PROVIDES THAT A MEMBER OF THE SENATE ACTING AS LIEUTENANT GOVERNOR VACATES HIS SEAT AND ANOTHER PERSON IS ELECTED IN HIS STEAD; PROPOSING AN AMENDMENT TO ARTICLE IV, RELATING TO THE LIEUTENANT GOVERNOR AS PRESIDENT OF THE SENATE, BY DELETING SECTION 10, WHICH PROVIDES THAT THE LIEUTENANT GOVERNOR IS THE PRESIDENT OF THE SENATE; PROPOSING AN AMENDMENT TO SECTION 12, ARTICLE IV, RELATING TO THE DISABILITY OF THE GOVERNOR, SO AS TO PROVIDE THAT IF BOTH THE ATTORNEY GENERAL AND THE STATE TREASURER TRANSMIT TO THE PRESIDENT OF THE SENATE AND THE SPEAKER OF THE HOUSE OF REPRESENTATIVES A WRITTEN DECLARATION THAT THE GOVERNOR IS UNABLE TO DISCHARGE THE POWERS AND DUTIES OF HIS OFFICE, THE LIEUTENANT GOVERNOR MUST ASSUME THE POWERS AND DUTIES OF THE OFFICE AS ACTING GOVERNOR.
l:\s-jud\bills\mcconnell\jud0010.pb.docx
Prefiled and referred to the Committee on Judiciary.
Read the first time and referred to the Committee on Judiciary.
S. 900 (Word version) -- Senators McConnell, Knotts and Elliott: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING SECTION 23-3-16, SO AS TO MANDATE THAT THE SOUTH CAROLINA LAW ENFORCEMENT DIVISION PROVIDE SECURITY AND PROTECTION FOR THE GOVERNOR AND LIEUTENANT GOVERNOR, WHICH MUST NOT BE DECLINED.
l:\s-jud\bills\mcconnell\jud0013.pb.docx
Prefiled and referred to the Committee on Judiciary.
Read the first time and referred to the Committee on Judiciary.
S. 901 (Word version) -- Senators McConnell, Elliott and Courson: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING SECTION 1-3-630, SO AS TO DEFINE "EMERGENCY", "FULL AUTHORITY", AND "TEMPORARY ABSENCE" IN ORDER TO CLARIFY WHEN A LIEUTENANT GOVERNOR HAS THE FULL AUTHORITY TO ACT IN AN EMERGENCY IN THE EVENT OF THE TEMPORARY ABSENCE OF THE GOVERNOR FROM THE STATE.
l:\s-jud\bills\mcconnell\jud0011.pb.docx
Prefiled and referred to the Committee on Judiciary.
Read the first time and referred to the Committee on Judiciary.
S. 902 (Word version) -- Senators McConnell, Rose, Elliott and Davis: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING CHAPTER 34 IN TITLE 12 SO AS TO ENACT THE "SOUTH CAROLINA FAIR TAX ACT", EFFECTIVE JANUARY 1, 2011, AND TO REPEAL, EFFECTIVE AT THE SAME TIME, CHAPTERS 6, 8, 11, 13, 16, AND 36, ALL OF TITLE 12, RELATING RESPECTIVELY TO THE SOUTH CAROLINA INCOME TAX ACT, INCOME TAX WITHHOLDING, THE INCOME TAX ON BANKS AND SAVINGS AND LOAN ASSOCIATIONS, THE SOUTH CAROLINA ESTATE TAX ACT, AND THE SOUTH CAROLINA SALES TAX ACT.
l:\council\bills\bbm\9457htc10.docx
Prefiled and referred to the Committee on Finance.
Read the first time and referred to the Committee on Finance.
S. 903 (Word version) -- Senators McConnell, Land, Setzler, Sheheen, Scott, Elliott and S. Martin: A BILL TO AMEND ACT 200 OF 2002, RELATING TO THE SOUTH CAROLINA CONSERVATION BANK ACT, SO AS TO DELETE A PROVISION WHICH PROVIDES THAT NO FURTHER DEED RECORDING FEES OR OTHER FUNDS MAY BE CREDITED TO THE CONSERVATION BANK TRUST FUND IN ANY YEAR WHEN A MAJORITY OF STATE AGENCY APPROPRIATIONS ARE REDUCED IN THE ANNUAL GENERAL APPROPRIATIONS ACT OR WHEN THE STATE BUDGET AND CONTROL BOARD IMPOSES ACROSS THE BOARD CUTS AND INSTEAD PROVIDE FOR A REDUCTION ON A PERCENTAGE BASIS IN THE AMOUNT OF DEED RECORDING FEES WHICH MAY BE TRANSFERRED TO THE TRUST FUND, AND TO EXTEND THE EXPIRATION DATE OF THE PROVISIONS OF LAW RELATING TO THE CONSERVATION BANK ACT AND OTHER RELATED DATES PERTAINING TO THE CLOSURE OF THE CONSERVATION BANK ACT AND CONSERVATION BANK FUND.
l:\council\bills\nbd\11592sd10.docx
Prefiled and referred to the Committee on Agriculture and Natural Resources.
Read the first time and referred to the Committee on Agriculture and Natural Resources.
S. 904 (Word version) -- Senators McConnell and Rose: A BILL TO AMEND SECTION 24-21-410, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATED TO THE PLACEMENT OF A DEFENDANT ON PROBATION, SO AS TO PROVIDE THAT IF THE DEFENDANT IS CONVICTED OF OR PLEADS GUILTY TO AN OFFENSE INVOLVING A VIOLENT ACT AGAINST A PERSON OR THE TAKING OF PROPERTY FROM A PERSON, AND THE DEFENDANT IS PLACED ON PROBATION, THE DEFENDANT MAY NOT BE PLACED ON PROBATION FOR ANY SUBSEQUENT OFFENSE.
l:\s-jud\bills\mcconnell\jud0005.jjg.docx
Prefiled and referred to the Committee on Judiciary.
Read the first time and referred to the Committee on Judiciary.
S. 905 (Word version) -- Senators Leatherman and Elliott: A BILL TO AMEND SECTION 2-7-71 OF THE 1976 CODE, RELATING TO TAX BILLS AND REVENUE IMPACT STATEMENTS, TO PROVIDE THAT THE REVENUE IMPACT STATEMENT MUST BE SIGNED BY THE CHIEF ECONOMIST OF THE OFFICE OF RESEARCH AND STATISTICS; AND TO AMEND SECTION 2-7-78, RELATING TO THE CERTIFICATION OF A REVENUE ESTIMATE, TO PROVIDE THAT THE REVENUE IMPACT MUST BE CERTIFIED BY THE CHIEF ECONOMIST OF THE OFFICE OF RESEARCH AND STATISTICS.
l:\s-financ\drafting\hkl\014revi.dag.hkl.docx
Prefiled and referred to the Committee on Finance.
Read the first time and referred to the Committee on Finance.
S. 906 (Word version) -- Senators Leatherman, Land, Coleman and Elliott: A BILL TO AMEND SECTION 9-8-50 OF THE 1976 CODE, RELATING TO SERVICE CREDIT IN THE RETIREMENT SYSTEM FOR JUDGES AND SOLICITORS, TO PROVIDE THAT A MEMBER UPON TERMINATION WHO DOES NOT QUALIFY FOR A MONTHLY BENEFIT MAY TRANSFER HIS SERVICE CREDIT TO THE SOUTH CAROLINA RETIREMENT SYSTEM, AND TO CLARIFY PROVISIONS RELATED TO THE TRANSFER OF EARNED SERVICE CREDIT IN RETIREMENT PLANS ADMINISTERED BY THE SOUTH CAROLINA RETIREMENT SYSTEMS.
l:\s-financ\drafting\hkl\015retj.dag.hkl.docx
Prefiled and referred to the Committee on Finance.
Read the first time and referred to the Committee on Finance.
S. 907 (Word version) -- Senator Peeler: A BILL TO REPEAL ARTICLE 1, CHAPTER 61, TITLE 44 OF THE 1976 CODE, RELATING TO EMERGENCY MEDICAL SERVICES.
l:\s-res\hsp\008emer.mrh.hsp.docx
Prefiled and referred to the Committee on Medical Affairs.
Read the first time and referred to the Committee on Medical Affairs.
S. 908 (Word version) -- Senators Peeler and S. Martin: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING SECTION 59-53-110 SO AS TO CHANGE THE NAMES OF ALL TECHNICAL EDUCATION INSTITUTIONS UNDER THE CONTROL OF THE STATE BOARD FOR TECHNICAL AND COMPREHENSIVE EDUCATION TO "TECHNICAL AND COMMUNITY COLLEGE".
l:\council\bills\agm\19541bh10.docx
Prefiled and referred to the Committee on Education.
Read the first time and referred to the Committee on Education.
S. 909 (Word version) -- Senator Lourie: A BILL TO AMEND SECTION 56-1-50 OF THE 1976 CODE, RELATING TO BEGINNER PERMITS, BY ADDING A NEW SUBSECTION REQUIRING A PERSON WHO IS ISSUED A BEGINNER'S PERMIT WHILE UNDER SIXTEEN YEARS OF AGE TO HOLD THE PERMIT FOR AT LEAST THREE HUNDRED SIXTY-FIVE DAYS BEFORE BEING ELIGIBLE FOR A SPECIAL RESTRICTED DRIVER'S LICENSE, AND TO PROVIDE THAT BEGINNER PERMITS ARE VALID FOR EIGHTEEN MONTHS; TO REMOVE ANY REFERENCE TO A CONDITIONAL DRIVER'S LICENSE FROM SECTIONS 56-1-40, 56-1-176, 56-1-187, 56-1-130, AND 56-1-185; AND TO REPEAL SECTION 56-1-175.
l:\s-resmin\drafting\jl\014perm.tcm.jl.docx
Prefiled and referred to the Committee on Transportation.
Read the first time and referred to the Committee on Transportation.
S. 910 (Word version) -- Senator Land: A BILL TO AMEND SECTION 6-21-185 OF THE 1976 CODE, RELATING TO A SPECIAL PURPOSE DISTRICT MORTGAGE TO SECURE CERTAIN BONDS OR LOANS, TO REMOVE LIMITATIONS FROM THE AUTHORITY OF SUCH DISTRICT TO MORTGAGE ITS PROPERTY UNDER THE REVENUE BOND ACT FOR UTILITIES; TO ADD SECTION 6-17-95 TO AUTHORIZE A SPECIAL PURPOSE DISTRICT PROVIDING HOSPITAL, NURSING HOME, OR CARE FACILITIES TO BORROW MONEY IN A MANNER THAT IS CONSISTENT WITH SECTION 44-7-60; TO ADD SECTION 6-11-101 TO CLARIFY THE POWERS OF HOSPITAL DISTRICTS.
l:\s-resmin\drafting\jcl\011clar.tcm.jcl.docx
Prefiled and referred to the Committee on Finance.
Read the first time and referred to the Committee on Finance.
S. 911 (Word version) -- Senators Land, Rose and Elliott: A BILL TO AMEND SECTION 16-3-20 OF THE 1976 CODE, RELATING TO STATUTORY AGGRAVATING CIRCUMSTANCES IN MURDER CASES, TO ADD TO THE LIST OF AGGRAVATING CIRCUMSTANCES THE KILLING OF AN EMERGENCY MEDICAL SERVICE PROVIDER.
l:\s-resmin\drafting\jcl\010ems..tcm.jcl.docx
Prefiled and referred to the Committee on Judiciary.
Read the first time and referred to the Committee on Judiciary.
S. 912 (Word version) -- Senator Land: A BILL TO AMEND SECTION 17-22-950 OF THE 1976 CODE, AS ADDED BY ACT 36 OF 2009, RELATING TO PROCEDURES FOR EXPUNGEMENT OF CRIMINAL CHARGES WHICH HAVE BROUGHT IN SUMMARY COURT, TO REMOVE THE REQUIREMENT THAT THE COMPLETED EXPUNGEMENT ORDER BE FILED WITH THE CLERK OF COURT.
l:\s-resmin\drafting\jcl\005summ.tcm.jcl.docx
Prefiled and referred to the Committee on Judiciary.
Read the first time and referred to the Committee on Judiciary.
S. 913 (Word version) -- Senators Land and Elliott: A BILL TO AMEND SECTION 47-5-60 OF THE 1976 CODE, RELATING TO PET INOCULATION AGAINST RABIES, TO RAISE THE MAXIMUM FEE ALLOWED TO BE CHARGED FROM THREE TO SIX DOLLARS.
l:\s-resmin\drafting\jcl\008rabi.tcm.jcl.docx
Prefiled and referred to the Committee on Agriculture and Natural Resources.
Read the first time and referred to the Committee on Agriculture and Natural Resources.
S. 914 (Word version) -- Senator Land: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING SECTION 50-13-120, TO SET THE SIZE LIMITS AT FOURTEEN INCHES TOTAL LENGTH AND THE CATCH LIMIT AT FIVE PER DAY FOR BLACK BASS IN LAKES MARION AND MOULTRIE AND THE UPPER SANTEE RIVER.
l:\s-resmin\drafting\jcl\007bass.tcm.jcl.docx
Prefiled and referred to the Committee on Fish, Game and Forestry.
Read the first time and referred to the Committee on Fish, Game and Forestry.
S. 915 (Word version) -- Senators Land, Anderson, Nicholson, Leventis, Elliott, Williams, Sheheen and Setzler: A BILL TO AMEND ACT 314 OF 2000, TO TERMINATE THE PROVISIONS OF THE SOUTH CAROLINA COMMUNITY ECONOMIC DEVELOPMENT ACT ON JUNE 30, 2015.
l:\s-resmin\drafting\jcl\006cdc..tcm.jcl.docx
Prefiled and referred to the Committee on Finance.
Read the first time and referred to the Committee on Finance.
S. 916 (Word version) -- Senator Leventis: A BILL TO AMEND SECTION 16-25-10, AS AMENDED, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO THE DEFINITION OF "HOUSEHOLD MEMBER" IN CONNECTION WITH CRIMINAL DOMESTIC VIOLENCE OFFENSES, SO AS TO INCLUDE PERSONS IN A DATING RELATIONSHIP AND TO DEFINE "DATING RELATIONSHIP"; TO AMEND SECTION 20-4-20, AS AMENDED, RELATING TO DEFINITIONS IN THE "PROTECTION FROM DOMESTIC ABUSE ACT", SO AS TO REVISE THE DEFINITION OF "HOUSEHOLD MEMBER" TO INCLUDE PERSONS IN A DATING RELATIONSHIP AND TO DEFINE "DATING RELATIONSHIP"; TO AMEND SECTION 20-4-40, AS AMENDED, RELATING TO THE PETITION FOR AN ORDER OF PROTECTION, SO AS TO PROVIDE THAT A PARENT OR GUARDIAN MAY PETITION THE COURT FOR AN ORDER ON BEHALF OF A MINOR WHO IS IN A DATING RELATIONSHIP; AND TO AMEND SECTION 20-4-60, AS AMENDED, RELATING TO THE CONTENTS OF AN ORDER OF PROTECTION, SO AS TO AUTHORIZE A RESPONDENT IN A PROCEEDING TO COMPLETE A BATTERER TREATMENT PROGRAM AND TO ORDER OTHER PROHIBITIONS OR REQUIREMENTS NECESSARY TO PROTECT THE ABUSED PERSON.
l:\council\bills\nbd\11609ac10.docx
Prefiled and referred to the Committee on Judiciary.
Read the first time and referred to the Committee on Judiciary.
S. 917 (Word version) -- Senators Leventis, Land and McGill: A BILL TO AMEND SECTION 50-5-15 OF THE 1976 CODE, RELATING TO THE DEFINITION OF PUBLIC FISHING PIERS, TO INCLUDE ANY PIER EXTENDING INTO THE ATLANTIC OCEAN FROM WHICH OWNERS OF THE PIER AND THEIR GUEST ARE ALLOWED TO FISH.
l:\s-resmin\drafting\jcl\009pier.tcm.jcl.docx
Prefiled and referred to the Committee on Fish, Game and Forestry.
Read the first time and referred to the Committee on Fish, Game and Forestry.
S. 918 (Word version) -- Senators Leventis and Sheheen: A BILL TO AMEND CHAPTER 6, TITLE 12 OF THE 1976 CODE, BY ADDING SECTION 12-6-3592 TO PROVIDE A TAX CREDIT OF TWENTY-FIVE PERCENT OF THE PURCHASE COST OF A GEOTHERMAL HEAT PUMP SYSTEM AND TO DEFINE A GEOTHERMAL HEAT PUMP SYSTEM.
l:\s-resmin\drafting\pl\008geot.tcm.pl.docx
Prefiled and referred to the Committee on Finance.
Read the first time and referred to the Committee on Finance.
S. 919 (Word version) -- Senators Thomas, Rose and Elliott: A BILL TO AMEND SECTIONS 56-1-50, AS AMENDED, AND 56-1-100, CODE OF LAWS OF SOUTH CAROLINA, 1976, BOTH RELATING TO REQUIREMENTS TO OBTAIN A BEGINNER'S PERMIT TO DRIVE, SO AS TO PROVIDE THAT THE DEPARTMENT OF SOCIAL SERVICES MAY CONSENT TO A SEVENTEEN YEAR OLD, IN THE DEPARTMENT'S CUSTODY, TO OBTAIN A BEGINNER'S PERMIT; TO AMEND SECTION 56-1-110, RELATING TO IMPUTING NEGLIGENCE AND WILFUL MISCONDUCT OF A MINOR DRIVING A MOTOR VEHICLE TO THE PERSON WHO SIGNED THE APPLICATION FOR THE MINOR TO OBTAIN THE PERMIT OR LICENSE, SO AS TO EXEMPT THE DEPARTMENT OF SOCIAL SERVICES IF THE DEPARTMENT SIGNED THE APPLICATION FOR THE MINOR TO OBTAIN THE PERMIT OR LICENSE; AND TO AMEND SECTION 59-39-320, RELATING TO THE STATE BOARD OF EDUCATION PROMULGATING REGULATIONS FOR LOCAL SCHOOL DISTRICTS TO ESTABLISH DRIVER EDUCATION AND TRAINING COURSES, SO AS TO REQUIRE LOCAL SCHOOL DISTRICTS TO ALLOW STUDENTS IN THE CUSTODY OF THE DEPARTMENT OF SOCIAL SERVICES TO TAKE SUCH COURSES IF A STUDENT IS ELIGIBLE AND THE DEPARTMENT VERIFIES THAT THE STUDENT HAS BEEN APPROVED TO PARTICIPATE IN THE COURSE.
l:\council\bills\nbd\11535ac09.docx
Prefiled and referred to the Committee on Transportation.
Read the first time and referred to the Committee on Transportation.
S. 920 (Word version) -- Senators Thomas and Elliott: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING SECTION 41-35-112 SO AS TO REQUIRE A PERSON RECEIVING AN UNEMPLOYMENT BENEFIT SHALL SUBMIT TO DRUG SCREENING AND TO PROVIDE PENALTIES IF HE FAILS THIS DRUG TEST; AND BY ADDING SECTION 43-5-300 SO AS TO REQUIRE A PERSON RECEIVING CERTAIN PUBLIC AID OR ASSISTANCE SHALL SUBMIT TO DRUG SCREENING AND TO PROVIDE PENALTIES IF HE FAILS THIS DRUG TEST.
l:\council\bills\agm\19543ab10.docx
Prefiled and referred to the Committee on Judiciary.
Read the first time and referred to the Committee on Judiciary.
S. 921 (Word version) -- Senator Thomas: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING SECTION 23-23-75 SO AS TO PROVIDE THAT THE DIVISION OF TRAINING AND CONTINUING EDUCATION SHALL OFFER A MANDATORY TRAINING COURSE ON RESPONDING TO AND TREATING INDIVIDUALS WHO ARE EPILEPTIC; BY ADDING SECTION 16-3-1070 SO AS TO PROVIDE THAT LAW ENFORCEMENT OFFICERS, EMERGENCY MEDICAL SERVICES WORKERS, AND FIRST RESPONDERS MUST PROVIDE A CERTAIN LEVEL OF RESPECT FOR A PERSON AND HIS PROPERTY WHEN THEY COME INTO CONTACT WITH A PERSON, AND TO PROVIDE A PENALTY FOR A VIOLATION OF THIS SECTION.
l:\council\bills\swb\5974cm10.docx
Prefiled and referred to the Committee on Judiciary.
Read the first time and referred to the Committee on Judiciary.
S. 922 (Word version) -- Senator Thomas: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING SECTION 56-1-1715 SO AS TO REQUIRE THE OWNERS OF A MOPED TO OBTAIN LIABILITY INSURANCE AS IS REQUIRED OF MOTOR VEHICLES; AND TO AMEND SECTION 38-77-30, RELATING TO DEFINITIONS USED IN THE REGULATION OF AUTOMOBILE INSURANCE, SO AS TO DELETE THE EXCEPTION OF A MOPED FROM THE DEFINITION OF "MOTOR VEHICLES".
l:\council\bills\dka\3773dw09.docx
Prefiled and referred to the Committee on Transportation.
Read the first time and referred to the Committee on Transportation.
S. 923 (Word version) -- Senator Thomas: A BILL TO AMEND SECTION 7-5-110, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO THE REQUIREMENT OF REGISTRATION IN ORDER TO VOTE, SO AS TO PROVIDE THAT A PERSON IS NOT ALLOWED TO VOTE IN A PARTISAN PRIMARY ELECTION OR PARTISAN ADVISORY REFERENDUM UNLESS THE PERSON HAS REGISTERED AS BEING A MEMBER OF THAT PARTY; TO AMEND SECTION 7-5-170, AS AMENDED, RELATING TO THE REQUIREMENTS FOR VOTER REGISTRATION, SO AS TO PROVIDE THE REQUIREMENT OF STATING POLITICAL PARTY AFFILIATION, IF ANY, ON THE FORM AND INCLUDING IT IN THE OATH; AND REQUIRE THE STATE ELECTION COMMISSION TO ASSIST IN CAPTURING THIS DATA; AND TO AMEND SECTION 7-9-20, RELATING TO THE QUALIFICATIONS FOR VOTING IN PRIMARY ELECTIONS, SO AS TO INCLUDE, AS A REQUIREMENT, REGISTERING AS A MEMBER OF THE PARTY AND TO PROVIDE A PROCEDURE FOR CHANGING POLITICAL PARTY AFFILIATION OR NONAFFILIATION AFTER A SELECTION HAS BEEN MADE.
l:\council\bills\dka\3798dw10.docx
Prefiled and referred to the Committee on Judiciary.
Read the first time and referred to the Committee on Judiciary.
S. 924 (Word version) -- Senator Thomas: A BILL TO AMEND SECTION 12-56-62, AS AMENDED, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO THE NOTICE OF INTENTION TO SET OFF DEBT BY A CLAIMANT, SO AS TO REQUIRE THE FIRST NOTICE TO BE SENT BY MAILING IT BY MEANS OF CERTIFIED MAIL, RETURN RECEIPT REQUESTED POSTAL SERVICE, AND PROVIDE IF IT IS RETURNED TO THE CLAIMANT UNSIGNED, IT MAY BE SENT TO THE DEBTOR BY REGULAR MAIL.
l:\council\bills\dka\3799dw10.docx
Prefiled and referred to the Committee on Finance.
Read the first time and referred to the Committee on Finance.
S. 925 (Word version) -- Senators Thomas and Elliott: A BILL TO AMEND SECTIONS 9-1-1140 AND 9-11-50, BOTH AS AMENDED, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO SERVICE CREDIT FOR PURPOSES OF THE SOUTH CAROLINA RETIREMENT SYSTEM AND SOUTH CAROLINA POLICE OFFICERS RETIREMENT SYSTEM, SO AS PROSPECTIVELY TO INCREASE FROM NINETY TO ONE HUNDRED TWENTY DAYS THE AMOUNT OF UNUSED SICK LEAVE FOR WHICH A MEMBER OTHERWISE ELIGIBLE TO RETIRE RECEIVES SERVICE CREDIT.
l:\council\bills\bbm\9470htc10.docx
Prefiled and referred to the Committee on Finance.
Read the first time and referred to the Committee on Finance.
S. 926 (Word version) -- Senators L. Martin and Elliott: A BILL TO AMEND SECTION 56-1-30, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO PERSONS WHO ARE EXEMPT FROM OBTAINING A DRIVER'S LICENSE, SO AS TO PROVIDE PENALTIES FOR A NONRESIDENT WHO OPERATES A VEHICLE WHEN HIS LICENSE IS SUSPENDED, REVOKED, OR CANCELLED BY HIS HOME JURISDICTION; TO AMEND SECTION 56-1-440, RELATING TO PENALTIES FOR DRIVING WITHOUT A LICENSE, SO AS TO PROVIDE ADDITIONAL PENALTIES FOR A PERSON WHO VIOLATES THIS SECTION WHO IS CONVICTED OF A VIOLATION FOR WHICH SUSPENSION OR REVOCATION OF THE PRIVILEGE TO OPERATE A VEHICLE IS MANDATORY; TO AMEND SECTIONS 56-1-745 AND 56-1-746, AS AMENDED, BOTH RELATING TO THE SUSPENSION OF THE DRIVER'S LICENSE OF A PERSON CONVICTED OF VARIOUS VIOLATIONS, SO AS TO PROVIDE ADDITIONAL PENALTIES FOR A VIOLATION; AND TO AMEND SECTION 56-1-1020, RELATING TO PENALTIES IMPOSED UPON AN HABITUAL OFFENDER, SO AS TO REVISE THE OFFENSES UPON WHICH A CONVICTION CAUSES A PERSON TO BE LABELED AN HABITUAL OFFENDER.
l:\council\bills\swb\5979cm10.docx
Prefiled and referred to the Committee on Judiciary.
Read the first time and referred to the Committee on Judiciary.
S. 927 (Word version) -- Senators L. Martin and Elliott: A BILL TO AMEND SECTION 16-27-30, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO THE OFFENSE OF ANIMAL FIGHTING AND BAITING AND ITS PENALTIES, SO AS TO ADD THAT IT IS UNLAWFUL TO SELL AN ANIMAL WITH THE INTENT THAT THE ANIMAL BE ENGAGED IN ANIMAL FIGHTING AND BAITING.
l:\council\bills\nbd\11544ahb10.docx
Prefiled and referred to the Committee on Judiciary.
Read the first time and referred to the Committee on Judiciary.
S. 928 (Word version) -- Senator L. Martin: A BILL TO AMEND SECTION 12-65-30 OF THE 1976 CODE, RELATING TO THE TAX CREDITS ALLOWED PURSUANT TO THE SOUTH CAROLINA TEXTILES COMMUNITIES REVITALIZATION ACT, TO ALLOW UNUSED CREDIT AGAINST STATE-IMPOSED TAXES TO BE TRANSFERRED, DEVISED, OR DISTRIBUTED, WITH OR WITHOUT CONSIDERATION AND REQUIRE WRITTEN NOTICE OF THE TRANSFER TO THE SOUTH CAROLINA DEPARTMENT OF REVENUE.
l:\s-rules\drafting\lam\012text.ec.lam.docx
Prefiled and referred to the Committee on Finance.
Read the first time and referred to the Committee on Finance.
S. 929 (Word version) -- Senators L. Martin and Elliott: A BILL TO AMEND SECTION 41-1-10 OF THE 1976 CODE, RELATING TO POSTING NOTICES CONCERNING THE EMPLOYMENT OF ADULTS AND CHILDREN IN PLACES OF EMPLOYMENT, TO DELETE THE PROVISION REQUIRING NOTICE TO BE POSTED IN EVERY ROOM WHERE FIVE OR MORE PERSONS ARE EMPLOYED; TO AMEND SECTION 41-3-10, RELATING TO THE DIVISION OF LABOR WITHIN THE DEPARTMENT OF LABOR, LICENSING AND REGULATION AND TO THE APPOINTMENT AND DUTIES OF THE DIRECTOR OF THE DEPARTMENT, TO DELETE THE PROVISION ESTABLISHING THE DIVISION OF LABOR; TO AMEND SECTION 41-3-40, RELATING TO THE DIRECTOR OF THE DEPARTMENT OF LABOR, LICENSING AND REGULATION, TO DELETE THE REFERENCE TO REGULATIONS PERTAINING TO THE DIVISION OF LABOR; TO AMEND SECTIONS 41-3-50, 41-3-60, 41-3-100, AND 41-3-120, ALL RELATING TO VARIOUS DUTIES OF THE DIRECTOR OF THE DEPARTMENT OF LABOR, LICENSING AND REGULATION, TO MAKE TECHNICAL CORRECTIONS; AND TO REPEAL SECTIONS 41-1-40, 41-1-50, 41-3-80, 41-15-10, AND 41-15-50; ARTICLE 5, CHAPTER 3, TITLE 41; CHAPTER 21, TITLE 41; AND CHAPTER 23, TITLE 41 ALL RELATING TO VARIOUS OBSOLETE PROVISIONS PERTAINING TO THE DEPARTMENT OF LABOR, LICENSING AND REGULATION.
l:\s-rules\drafting\lam\011llr .ec.lam.docx
Prefiled and referred to the Committee on Labor, Commerce and Industry.
Read the first time and referred to the Committee on Labor, Commerce and Industry.
S. 930 (Word version) -- Senators L. Martin and Elliott: A BILL TO AMEND SECTION 56-3-115 OF THE 1976 CODE, RELATING TO GOLF CARTS, TO REQUIRE PERMITTED GOLF CARTS TO OPERATE ONLY WITHIN TWO MILES OF THE ADDRESS ON THE REGISTRATION AND TO REQUIRE PERMITS BE REPLACED EVERY FIVE YEARS OR AT TIME OF ADDRESS CHANGE.
l:\s-rules\drafting\lam\010golf.ec.lam.docx
Prefiled and referred to the Committee on Transportation.
Read the first time and referred to the Committee on Transportation.
S. 931 (Word version) -- Senator L. Martin: A BILL TO AMEND SECTION 44-48-40 OF THE 1976 CODE, RELATING TO THE EFFECTIVE DATE OF PAROLE OR CONDITIONAL RELEASE OF SEXUALLY VIOLENT PREDATORS, TO PROVIDE THAT WRITTEN NOTICE MUST BE GIVEN TWO HUNDRED SEVENTY DAYS RATHER THAN ONE HUNDRED DAYS, AND TO PROVIDE THAT THE PAROLE OR CONDITIONAL RELEASE ORDER DOES NOT TAKE EFFECT FOR ONE HUNDRED EIGHTY DAYS, RATHER THAN NINETY DAYS, AFTER ISSUANCE OF THE ORDER; TO AMEND SECTION 44-48-80, RELATING TO THE FACILITY IN WHICH A PERSON MUST BE HELD AFTER PROBABLE CAUSE IS FOUND TO EXIST THAT THE PERSON IS A SEXUALLY VIOLENT PREDATOR, TO REQUIRE THAT THE PERSON ONLY BE HELD IN A LOCAL OR REGIONAL DETENTION FACILITY PENDING CONCLUSION OF THE PROCEEDINGS IN THIS CHAPTER AND THAT THE COURT MUST DIRECT THE PERSON TO BE TRANSPORTED TO AN APPROPRIATE FACILITY OF THE SOUTH CAROLINA DEPARTMENT OF MENTAL HEALTH; TO AMEND SECTION 44-48-90, RELATING TO THE TIME WITHIN WHICH A JURY TRIAL MUST BE REQUESTED AND HELD TO DETERMINE IF A PERSON IS A SEXUALLY VIOLENT PREDATOR, TO PROVIDE THAT A JURY TRIAL MUST BE REQUESTED WITHIN THIRTY DAYS AFTER THE DETERMINATION OF PROBABLE CAUSE UNDER SECTION 44-48-80, TO PROVIDE THAT THE TRIAL MUST BE HELD WITHIN NINETY DAYS OF ISSUANCE OF THE COURT APPOINTED EVALUATOR'S OPINION, AND TO PROVIDE THAT UPON RECEIPT OF THE ISSUANCE OF THE OPINION, EITHER PARTY MAY RETAIN HIS OWN EXPERT TO CONDUCT A SUBSEQUENT EVALUATION; TO AMEND SECTION 44-48-100, RELATING TO THE FACILITY IN WHICH A PERSON MUST BE HELD UPON A MISTRIAL IN DETERMINING IF THE PERSON IS A SEXUALLY VIOLENT PREDATOR, TO REQUIRE THAT THE PERSON ONLY BE HELD IN A LOCAL OR REGIONAL DETENTION FACILITY; AND TO AMEND SECTION 44-48-120, RELATING TO PROCEDURES REQUIRED WHEN THE DIRECTOR OF THE DEPARTMENT OF MENTAL HEALTH DETERMINES A PERSON COMMITTED TO THE DEPARTMENT AS A SEXUALLY VIOLENT PREDATOR IS NO LONGER LIKELY TO COMMIT ACTS OF SEXUAL VIOLENCE, TO REQUIRE THE DIRECTOR TO CERTIFY THIS DETERMINATION IN WRITING AND TO NOTIFY THE ATTORNEY GENERAL OF THIS CERTIFICATION AND OF THE PATIENT'S AUTHORIZATION TO PETITION THE COURT FOR RELEASE, TO PROVIDE THAT THE ATTORNEY GENERAL MAY REQUEST AN EXAMINATION BEFORE A HEARING ON THE RELEASE IS HELD, AND TO PROVIDE THAT EITHER PARTY MAY REQUEST THAT THE HEARING BE HELD BEFORE A JURY.
l:\s-rules\drafting\lam\009svp .ec.lam.docx
Prefiled and referred to the Committee on Judiciary.
Read the first time and referred to the Committee on Judiciary.
S. 932 (Word version) -- Senator L. Martin: A BILL TO AMEND SECTION 50-16-25 OF THE 1976 CODE, RELATING TO THE RELEASE OF PIGS FOR HUNTING PURPOSES, TO PROVIDE THAT IT IS UNLAWFUL TO POSSESS, BUY, SELL, OFFER FOR SALE, TRANSFER, RELEASE, OR TRANSPORT FOR THE PURPOSE OF RELEASE A MEMBER OF THE SUIDAE FAMILY FOR HUNTING OR TO SUPPLEMENT A FREE ROAMING POPULATION, TO PROVIDE THAT IT IS UNLAWFUL TO REMOVE A LIVE HOG FROM A TRAP OR FROM THE WOODS, FIELDS, OR MARSHES OF THIS STATE, AND TO CLARIFY THAT THIS SECTION DOES NOT APPLY TO ACCEPTED FARMING PRACTICES RELATED TO MEMBERS OF THE SUIDAE FAMILY.
l:\s-res\lam\011hogg.kmm.lam.docx
Prefiled and referred to the Committee on Fish, Game and Forestry.
Read the first time and referred to the Committee on Fish, Game and Forestry.
S. 933 (Word version) -- Senators Courson, Knotts, Hayes, Rose, Cromer, Peeler, Shoopman, L. Martin, S. Martin, Mulvaney, Davis, Campsen, Fair, Campbell, McConnell, Alexander, O'Dell and Bryant: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING SECTION 53-5-40 SO AS TO PROVIDE THAT VETERAN'S DAY MUST BE RECOGNIZED AS A HOLIDAY FOR ALL LOCAL SCHOOL DISTRICTS AND PUBLIC SCHOOLS OF THE STATE; AND TO AMEND SECTION 59-29-120, RELATING TO ATTENDANCE AT VETERAN'S ACTIVITIES, SO AS TO CHANGE DATES FOR POSSIBLE SCHOOL ACTIVITIES HONORING VETERANS.
l:\council\bills\agm\19528bh10.docx
Prefiled and referred to the Committee on Education.
Read the first time and referred to the Committee on Education.
S. 934 (Word version) -- Senators Reese and Elliott: A BILL TO AMEND SECTION 63-3-530, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO FAMILY COURT JURISDICTION IN DOMESTIC MATTERS, SO AS TO REVISE GRANDPARENT VISITATION PROVISIONS BY PROVIDING THAT, AT A MINIMUM, GRANDPARENTS MUST BE ALLOWED SEVENTY-TWO HOURS OF VISITATION EACH SIX MONTHS WITH A GRANDCHILD UP TO AGE SIXTEEN UNLESS THE COURT FINDS IT IS NOT IN THE BEST INTEREST OF THE CHILD.
l:\council\bills\nbd\11528ac09.docx
Prefiled and referred to the Committee on Judiciary.
Read the first time and referred to the Committee on Judiciary.
S. 935 (Word version) -- Senators Reese and S. Martin: A BILL TO AMEND SECTION 23-3-115, AS AMENDED, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO FEES FOR CRIMINAL RECORD SEARCHES CONDUCTED BY THE STATE LAW ENFORCEMENT DIVISION, SO AS TO PROVIDE THAT A FEE OF EIGHT DOLLARS SHALL BE CHARGED FOR EACH CRIMINAL RECORD SEARCH CONDUCTED ON A SCHOOL DISTRICT VOLUNTEER.
l:\council\bills\swb\5980cm10.docx
Prefiled and referred to the Committee on Judiciary.
Read the first time and referred to the Committee on Judiciary.
S. 936 (Word version) -- Senator Reese: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING SECTION 6-15-65 SO AS TO PROVIDE THAT A GOVERNMENTAL ENTITY MAY NOT ASSESS A REAL PROPERTY OWNER A SEWER SERVICE FEE OR SEWER CONNECTION FEE IN CONJUNCTION WITH OR WITHOUT A BILL FOR THE PROVISION OF WATER WHEN THE PROPERTY OWNER DOES NOT USE THE SEWER COLLECTION SERVICE AND HAS HIS OWN SEPTIC OR SEWER SYSTEM.
l:\council\bills\dka\3796dw10.docx
Prefiled and referred to the Committee on Finance.
Read the first time and referred to the Committee on Finance.
S. 937 (Word version) -- Senator Reese: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING SECTION 44-7-295 SO AS TO REQUIRE HOSPITALS LICENSED IN THIS STATE TO INCLUDE PHYSICIANS WITH PRACTICE PRIVILEGES IN THE HOSPITAL IN REFERRAL ROTATIONS FOR UNASSIGNED PATIENTS AND SERVICES OR PROCEDURES, APPLICABLE TO THE PHYSICIANS AREA OF PRACTICE, UNLESS THE PHYSICIAN OPTS OUT OF THE ROTATION.
l:\council\bills\nbd\11515ac09.docx
Prefiled and referred to the Committee on Medical Affairs.
Read the first time and referred to the Committee on Medical Affairs.
S. 938 (Word version) -- Senator Fair: A BILL TO AMEND SECTION 7-5-110 OF THE 1976 CODE, RELATING TO THE REQUIREMENT OF REGISTRATION IN ORDER TO VOTE, TO PROVIDE THAT A PERSON IS NOT ALLOWED TO VOTE IN A PARTISAN PRIMARY ELECTION OR PARTISAN ADVISORY REFERENDUM UNLESS THE PERSON HAS REGISTERED AS BEING A MEMBER OF THAT PARTY; TO AMEND SECTION 7-5-170, RELATING TO THE REQUIREMENTS FOR VOTER REGISTRATION, TO PROVIDE THE REQUIREMENT OF STATING POLITICAL PARTY AFFILIATION, IF ANY, ON THE FORM AND INCLUDING IT IN THE OATH AND TO REQUIRE THE STATE ELECTION COMMISSION TO ASSIST IN MAINTAINING A LIST OF ALL ELECTORS REGISTERED BY PARTY AFFILIATION; AND TO AMEND SECTION 7-9-20, RELATING TO THE QUALIFICATIONS FOR VOTING IN PRIMARY ELECTIONS, TO INCLUDE, AS A REQUIREMENT, REGISTERING AS A MEMBER OF THE PARTY AND TO PROVIDE A PROCEDURE FOR CHANGING POLITICAL PARTY AFFILIATION OR NONAFFILIATION AFTER A SELECTION HAS BEEN MADE.
l:\s-res\mlf\009prim.kmm.mlf.docx
Prefiled and referred to the Committee on Judiciary.
Read the first time and referred to the Committee on Judiciary.
S. 939 (Word version) -- Senator Fair: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING SECTION 59-101-435 SO AS TO PROVIDE A HIGH SCHOOL, CAREER CENTER, OR SCHOOL DISTRICT IN WHICH THEY ARE LOCATED AND A STATE-SUPPORTED INSTITUTION OF HIGHER LEARNING MAY ENTER INTO ARTICULATION AGREEMENTS WITHOUT THE REQUIREMENT OF PARTICIPATION IN OR ADMINISTRATION OF THE ARTICULATION AGREEMENT BY THE GOVERNING BODY OR COMMISSION OF AN INSTITUTION OF HIGHER LEARNING INCLUDING A LOCAL TECHNICAL COLLEGE OR ITS AREA COMMISSION LOCATED IN THE SAME COUNTY OR AREA WHERE THE HIGH SCHOOL OR CAREER CENTER IS LOCATED, AND TO DEFINE ARTICULATION AGREEMENTS FOR PURPOSES OF THIS PROVISION.
l:\council\bills\gjk\20393sd10.docx
Prefiled and referred to the Committee on Education.
Read the first time and referred to the Committee on Education.
S. 940 (Word version) -- Senator Hayes: A BILL TO AMEND SECTION 62-7-201, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO THE EXCLUSIVE JURISDICTION OF THE PROBATE COURT REGULATING PROCEEDINGS CONCERNING THE INTERNAL AFFAIRS OF TRUSTS AND EXCEPTIONS TO THIS EXCLUSIVE JURISDICTION, SO AS TO CORRECT A REFERENCE REGARDING MATTERS WHICH MAY BE REMOVED TO THE CIRCUIT COURT.
l:\council\bills\gjk\20391sd10.docx
Prefiled and referred to the Committee on Judiciary.
Read the first time and referred to the Committee on Judiciary.
S. 941 (Word version) -- Senator Alexander: A BILL TO AMEND SECTION 56-5-3720 OF THE 1976 CODE, RELATING TO REQUIRED EQUIPMENT FOR MOPED USE UPON STATE ROADS, TO REQUIRE THAT MOPEDS BE EQUIPPED WITH A STROBE LIGHT FOR INCREASED VISIBILITY.
l:\s-gen\drafting\tca\011mope.jd.tca.docx
Prefiled and referred to the Committee on Transportation.
Read the first time and referred to the Committee on Transportation.
S. 942 (Word version) -- Senators Grooms and Bryant: A BILL TO AMEND TITLE 12 OF THE 1976 CODE, RELATING TO TAXATION, BY ENACTING THE PALMETTO FAIR TAX ACT; TO REPEAL CHAPTER 6, TITLE 12, RELATING TO THE SOUTH CAROLINA INCOME TAX ACT; TO REPEAL CHAPTER 8, TITLE 12, RELATING TO INCOME TAX WITHHOLDING; TO REPEAL CHAPTER 11, TITLE 12, RELATING TO INCOME TAX ON BANKS; TO REPEAL CHAPTER 13, TITLE 12, RELATING TO INCOME TAX ON BUILDING AND LOAN ASSOCIATIONS; TO REPEAL CHAPTER 16, TITLE 12, RELATING TO THE ESTATE TAX; TO REPEAL CHAPTER 36, TITLE 12, RELATING TO THE SOUTH CAROLINA SALES AND USE TAX; TO ADD CHAPTER 1 TO TITLE 12, BY ADDING ARTICLE 1 TO PROVIDE NECESSARY DEFINITIONS AND BY ADDING ARTICLE 2 TO PROVIDE FOR A ___ PERCENT TAX ON THE GROSS RETAIL SALES AND USE OF GOODS AND SERVICES, BY ADDING ARTICLE 3 TO ESTABLISH THE FAMILY CONSUMPTION ALLOWANCE, THE QUALIFYING CRITERIA FOR THE ALLOWANCE, THE MANNER IN WHICH THE ALLOWANCE IS CALCULATED, AND THE MANNER IN WHICH THE ALLOWANCE IS DISTRIBUTED, BY ADDING ARTICLE 4 TO PROVIDE FOR CREDITS, REFUNDS, AND EXEMPTIONS FROM THE TAX IMPOSED BY CHAPTER 1, BY ADDING ARTICLE 5 TO REQUIRE A RETAILER TO OBTAIN A LICENSE, TO PROVIDE FOR THE REQUIREMENTS FOR LICENSURE, AND TO PROVIDE FOR THE OBLIGATIONS OF LICENSEES, AND BY ADDING ARTICLE 6 TO PROVIDE FOR GENERAL PROVISIONS RELATING TO THE COLLECTION OF TAXES IMPOSED BY THIS CHAPTER, REPORTING REQUIREMENTS, AND OTHERWISE PROVIDE FOR THE EFFICIENT ADMINISTRATION OF THE PROVISIONS OF THIS CHAPTER BY THE DEPARTMENT OF REVENUE; AND TO REPEAL SECTIONS 11-11-155 AND 11-11-156.
l:\s-res\lkg\018palm.kmm.lkg.docx
Prefiled and referred to the Committee on Finance.
Read the first time and referred to the Committee on Finance.
S. 943 (Word version) -- Senators Grooms and Elliott: A BILL TO AMEND CHAPTER 3, TITLE 56 OF THE 1976 CODE, BY ADDING ARTICLE 109, TO PROVIDE THAT THE DEPARTMENT OF MOTOR VEHICLES MAY ISSUE STATE FLAG SPECIAL LICENSE PLATES.
l:\s-res\lkg\017flag.kmm.lkg.docx
Prefiled and referred to the Committee on Transportation.
Read the first time and referred to the Committee on Transportation.
S. 944 (Word version) -- Senators Grooms and Bryant: A CONCURRENT RESOLUTION TO REQUEST THE SOUTH CAROLINA CONGRESSIONAL DELEGATION TO OPPOSE CAP AND TRADE LEGISLATION AND SUPPORT LEGISLATION THAT ENCOURAGES STATES TO ESTABLISH AND DEVELOP THEIR OWN RENEWABLE ENERGY PORTFOLIO STANDARDS.
l:\s-res\lkg\016capn.kmm.lkg.docx
Prefiled and referred to the Committee on Judiciary.
The Concurrent Resolution was introduced and referred to the Committee on Judiciary.
S. 945 (Word version) -- Senators Grooms and Elliott: A BILL TO AMEND SECTION 56-1-360 OF THE 1976 CODE, RELATING TO THE FORM AND PROOF OF NOTICE PROVIDED BY THE DEPARTMENT OF MOTOR VEHICLES UPON THE CANCELLATION, SUSPENSION, OR REVOCATION OF A DRIVER'S LICENSE, TO PROVIDE THAT NOTICE MUST BE GIVEN BY REGISTERED OR CERTIFIED MAIL, RETURN RECEIPT REQUESTED.
l:\s-res\lkg\015dmvn.kmm.lkg.docx
Prefiled and referred to the Committee on Transportation.
Read the first time and referred to the Committee on Transportation.
S. 946 (Word version) -- Senators Grooms and Bryant: A CONCURRENT RESOLUTION TO REQUEST THE SOUTH CAROLINA CONGRESSIONAL DELEGATION TO VOTE ONLY FOR BALANCED FEDERAL BUDGETS THAT PROVIDE FOR MEANINGFUL DEBT REDUCTION, APPROPRIATIONS BILLS THAT ARE CONSISTENT WITH A BALANCED BUDGET AND DEBT REDUCTION, TO REPEAL THE AMERICAN RECOVERY AND REINVESTMENT ACT, END THE TROUBLED ASSETS RELIEF FUND, AND RENEW AND BUILD UPON THE UNFUNDED MANDATES REFORM ACT OF 1995.
l:\s-res\lkg\014fede.kmm.lkg.docx
Prefiled and referred to the Committee on Finance.
The Concurrent Resolution was introduced and referred to the Committee on Finance.
S. 947 (Word version) -- Senators Grooms, Bryant and Rose: A JOINT RESOLUTION PROPOSING AN AMENDMENT TO ARTICLE XV OF THE CONSTITUTION OF SOUTH CAROLINA, 1895, RELATING TO IMPEACHMENT OF CERTAIN EXECUTIVE AND JUDICIAL OFFICERS OF THIS STATE, BY ADDING SECTION 4 SO AS TO PROVIDE PROCEDURES FOR RECALLING AND REMOVING FROM PUBLIC OFFICE PERSONS HOLDING PUBLIC OFFICES OF THE STATE OR ITS POLITICAL SUBDIVISIONS IN THE EXECUTIVE AND LEGISLATIVE BRANCHES OF STATE OR LOCAL GOVERNMENTS; AND PROPOSING AN AMENDMENT TO ARTICLE XVII, BY ADDING SECTION 15 SO AS TO ESTABLISH A SPECIFIED PROCEDURE FOR THE ENACTMENT OR REPEAL OF LAWS AND CONSTITUTIONAL AMENDMENTS BY INITIATIVE PETITION AND REFERENDUM AND TO PROVIDE EXCEPTIONS.
l:\s-res\lkg\013reca.kmm.lkg.docx
Prefiled and referred to the Committee on Judiciary.
Read the first time and referred to the Committee on Judiciary.
S. 948 (Word version) -- Senator Verdin: A BILL TO REPEAL SECTION 47-9-65 OF THE 1976 CODE, AS ADDED BY ACT 75 OF 2009, RELATING TO POLO HORSE DRUG COMPOUNDS.
l:\s-res\dbv\012nopo.kmm.dbv.docx
Prefiled and referred to the Committee on Agriculture and Natural Resources.
Read the first time and referred to the Committee on Agriculture and Natural Resources.
S. 949 (Word version) -- Senators Verdin and Elliott: A BILL TO AMEND SECTION 16-11-700 OF THE 1976 CODE, RELATING TO THE PROHIBITION AGAINST DUMPING LITTER ON PUBLIC OR PRIVATE PROPERTY, TO PROVIDE FOR INCREASED PENALTIES AND TO DEFINE "LITTER"; TO AMEND SECTION 16-11-720, RELATING TO THE PROHIBITION AGAINST DUMPING TRASH IN LAKE GREENWOOD OR ALONG ITS SHORELINE, TO PROVIDE FOR INCREASED PENALTIES; AND BY ADDING SECTION 44-67-140 TO ESTABLISH A LITTER OFFENDER DATABASE TO BE MAINTAINED AND OPERATED BY THE DEPARTMENT OF HEALTH AND ENVIRONMENTAL CONTROL, TO PROVIDE FOR THE CONTENTS OF THE DATABASE, AND TO PROVIDE FOR THE LENGTH OF TIME THAT AN OFFENDER'S NAME AND OTHER REQUIRED INFORMATION MUST BE MAINTAINED ON THE DATABASE.
l:\s-res\dbv\011litt.kmm.dbv.docx
Prefiled and referred to the Committee on Judiciary.
Read the first time and referred to the Committee on Judiciary.
S. 950 (Word version) -- Senator Elliott: A BILL TO AMEND SECTIONS 5-37-20, 5-37-35, 5-37-40, AS AMENDED, 5-37-50, AS AMENDED, AND 5-37-100, CODE OF LAWS OF SOUTH CAROLINA, 1976, ALL RELATING TO THE MUNICIPAL IMPROVEMENT DISTRICT ACT, SO AS TO CLARIFY THAT AN EASEMENT FOR MAINTENANCE IN CHANNELS, CANALS, OR WATERWAYS IS SUFFICIENT PROPERTY INTEREST TO PROCEED WITH AN ASSESSED DISTRICT; TO AUTHORIZE SOME PORTION OF THE BONDS ISSUED TO FUND ASSESSMENTS MAY BE BACKED BY THE TAXING POWER OF A MUNICIPALITY; AND TO PROVIDE AN EXCEPTION OF AN OWNER OF RESIDENTIAL PROPERTY TO BE REQUIRED TO CONSENT TO INCLUSION IN AN IMPROVEMENT DISTRICT WHEN THE SOLE IMPROVEMENTS ARE THE WIDENING AND DREDGING OF CANALS.
l:\council\bills\dka\3792dw10.docx
Prefiled and referred to the Committee on Finance.
Read the first time and referred to the Committee on Finance.
S. 951 (Word version) -- Senator Elliott: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING SECTION 38-73-522 SO AS TO REQUIRE WORKER'S COMPENSATION INSURERS TO USE THE MOST RECENTLY APPROVED LOSS COST DATA WHEN CALCULATING RATES.
l:\council\bills\dka\3776dw10.docx
Prefiled and referred to the Committee on Judiciary.
Read the first time and referred to the Committee on Judiciary.
S. 952 (Word version) -- Senator Jackson: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING SECTION 1-11-790 SO AS TO ENACT THE "SOUTH CAROLINA OBESITY TREATMENT AND MANAGEMENT ACT" TO CREATE A PROGRAM DESIGNED TO ADDRESS THE PROBLEM OF THE HIGH RATE OF OBESITY IN SOUTH CAROLINA THROUGH THE USE OF BARIATRIC SURGERY, AMONG OTHER METHODS AND TREATMENT OPTIONS, TO PROVIDE THE PROGRAM MUST BE DEVELOPED THROUGH THE STATE HEALTH PLAN BY THE STATE BUDGET AND CONTROL BOARD, TO CREATE THE BARIATRIC ADVISORY BOARD AND TO PROVIDE THE COMPOSITION AND RESPONSIBILITIES OF THE BOARD, TO PROVIDE WHEN A PERSON MAY BE ELIGIBLE FOR PARTICIPATION IN THE PROGRAM AND WHEN A MEDICAL CENTER OR HOSPITAL MAY PROVIDE A SERVICE UNDER THE PROGRAM, TO PROVIDE LIMITS ON THE NUMBER OF PEOPLE THE PROGRAM MAY ACCEPT DURING ITS FIRST TWO YEARS OF OPERATION, TO PROVIDE A REPORTING REQUIREMENT AT THE END OF THE PROGRAM'S FIRST TWO-YEAR PERIOD OF OPERATION, TO ENSURE THE LEAST INITIAL COST TO THE STATE IN THE FIRST TWO YEARS OF THE PROGRAM'S IMPLEMENTATION, EIGHTY-FIVE PERCENT OF PARTICIPANTS MUST BE ELIGIBLE FOR GASTRIC BANDING SUCH AS LAP BANDS, AND TO PROVIDE ON A FUTURE DATE A BENEFIT PROVIDED UNDER THIS PROGRAM IS AVAILABLE TO A PARTICIPANT IN THE STATE HEALTH PLAN WHO IS ELIGIBLE FOR THE PROGRAM UNDER CRITERIA ESTABLISHED IN THIS SECTION.
l:\council\bills\agm\19546ab10.docx
Prefiled and referred to the Committee on Finance.
Read the first time and referred to the Committee on Finance.
S. 953 (Word version) -- Senator Jackson: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING SECTION 59-19-117 SO AS TO REQUIRE AN INDIVIDUAL HIRED BY A SCHOOL DISTRICT TO SERVE IN ANY CAPACITY IN A PUBLIC SCHOOL WHICH REQUIRES DIRECT INTERACTION WITH STUDENTS TO UNDERGO A CRIMINAL RECORD SEARCH, TO REQUIRE EACH SCHOOL DISTRICT TO DEVELOP A WRITTEN POLICY ON THE CRIMINAL RECORD SEARCH, TO PROVIDE WHAT THE POLICY MUST INCLUDE, AND TO REQUIRE THE SOUTH CAROLINA LAW ENFORCEMENT DIVISION TO PROVIDE TRAINING TO APPROPRIATE SCHOOL DISTRICT PERSONNEL; AND TO AMEND SECTION 23-3-115, RELATING TO FEES FOR CRIMINAL RECORD SEARCHES, SO AS TO FIX THE FEE AT EIGHT DOLLARS FOR CERTAIN SCHOOL DISTRICT EMPLOYEES.
l:\council\bills\agm\19536bh10.docx
Prefiled and referred to the Committee on Education.
Read the first time and referred to the Committee on Education.
S. 954 (Word version) -- Senators Rankin and Elliott: A BILL TO AMEND CHAPTER 5, TITLE 56 OF THE 1976 CODE, BY ADDING ARTICLE 49, TO PROVIDE THAT IT IS UNLAWFUL FOR A DRIVER OVER THE AGE OF EIGHTEEN TO USE A WIRELESS TELEPHONE OR WIRELESS COMMUNICATIONS DEVICE WITHOUT A HANDS-FREE DEVICE, TO PROVIDE THAT IT IS UNLAWFUL FOR A DRIVER AGE EIGHTEEN OR YOUNGER TO USE A WIRELESS TELEPHONE OR WIRELESS COMMUNICATIONS DEVICE, TO PROVIDE THAT A VIOLATION OF THIS SECTION MAY NOT BE THE SOLE OR PRIMARY BASIS FOR A LAW ENFORCEMENT OFFICER TO STOP A VEHICLE, TO PROVIDE FOR CERTAIN EXCEPTIONS, TO PROVIDE APPROPRIATE PENALTIES AND DEFINITIONS, AND TO PROVIDE FOR AN EDUCATION PROGRAM.
l:\s-res\lar\003hand.ebd.lar.docx
Prefiled and referred to the Committee on Transportation.
Read the first time and referred to the Committee on Transportation.
S. 955 (Word version) -- Senator Cromer: A BILL TO AMEND SECTION 40-11-240 OF THE 1976 CODE, RELATING TO QUALIFICATIONS THAT A CONTRACTOR MUST MEET FOR LICENSURE, TO REQUIRE A CERTIFICATE OF WORKERS' COMPENSATION INSURANCE COVERAGE; AND TO AMEND SECTION 40-11-350, RELATING TO EVIDENCE OF LICENSE AS A PREREQUISITE TO A BUILDING PERMIT, TO PROHIBIT BUILDING PERMITS FROM BEING ISSUED TO CONTRACTORS THAT DO NOT HAVE WORKERS' COMPENSATION COVERAGE.
l:\s-res\rwc\010cont.kmm.rwc.docx
Prefiled and referred to the Committee on Labor, Commerce and Industry.
Read the first time and referred to the Committee on Labor, Commerce and Industry.
S. 956 (Word version) -- Senators Cromer and Elliott: A BILL TO AMEND SECTION 27-37-60 OF THE 1976 CODE, RELATING TO A TRIAL FOR THE EJECTMENT OF A TENANT, TO PROVIDE THAT A TENANT MUST POST A BOND AS A CONDITION OF REQUESTING A TRIAL, AND TO PROVIDE FOR THE AMOUNT OF THE BOND.
l:\s-res\rwc\011tena.kmm.rwc.docx
Prefiled and referred to the Committee on Judiciary.
Read the first time and referred to the Committee on Judiciary.
S. 957 (Word version) -- Senators Knotts and Elliott: A BILL TO AMEND SECTION 63-7-20, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO THE DEFINITION OF TERMS PERTAINING TO CHILD PROTECTION AND PERMANENCY, INCLUDING THE DEFINITION OF CHILD ABUSE OR NEGLECT, SO AS TO PROVIDE THAT ABUSE OR NEGLECT MAY OCCUR WHEN A PERSON RESPONSIBLE FOR A CHILD'S WELFARE HAS ENGAGED IN INTERMITTENT BUT ONGOING ABUSE AND NEGLECT PRESENTING A SUBSTANTIAL RISK OF ABUSE OR NEGLECT AND WARRANTING PREVENTIVE INTERVENTION SERVICES AND SUCH OTHER SERVICES AS MAY BE IN THE BEST INTEREST OF THE CHILD.
l:\council\bills\nbd\11606ac10.docx
Prefiled and referred to the Committee on Judiciary.
Read the first time and referred to the Committee on Judiciary.
S. 958 (Word version) -- Senators Knotts and Davis: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING SECTION 47-1-45 SO AS TO MAKE IT UNLAWFUL TO KNOWINGLY OR INTENTIONALLY CONFINE OR RESTRAIN AN ANIMAL IN A CRUEL MANNER OR KNOWINGLY OR INTENTIONALLY CAUSE SUCH CRUEL CONFINEMENT OR RESTRAINING OF AN ANIMAL, TO DEFINE CERTAIN TERMS IN REGARD TO THE ABOVE, TO PROVIDE PENALTIES FOR VIOLATION, AND TO PROVIDE THAT LOCAL GOVERNMENTS MAY ADOPT MORE STRINGENT LOCAL ORDINANCES GOVERNING THE CONFINEMENT OR RESTRAINING OF AN ANIMAL WITH CIVIL PENALTIES FOR VIOLATIONS.
l:\council\bills\nbd\11573sd10.docx
Prefiled and referred to the Committee on Agriculture and Natural Resources.
Read the first time and referred to the Committee on Agriculture and Natural Resources.
S. 959 (Word version) -- Senators Knotts, Rose and Elliott: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING SECTION 12-37-226 SO AS TO PROVIDE THAT THE ASSESSMENT RATIO ON A HOMEOWNER'S PRINCIPAL RESIDENCE SHALL REMAIN AT FOUR PERCENT UNTIL THE END OF THE CALENDAR YEAR FOLLOWING THE YEAR IN WHICH THE HOMEOWNER VACATES THE PROPERTY IF THE HOMEOWNER IS ATTEMPTING TO SELL THE PROPERTY THROUGH A REAL ESTATE BROKER OR BY OWNER AND IT REMAINS UNSOLD AND NOT RENTED; TO PROVIDE THAT THE PROVISIONS OF THIS SECTION SHALL BE CONSTRUED AS PROVIDING A PROPERTY TAX EXEMPTION FROM THE AMOUNT OF ANY PROPERTY TAX INCREASE RESULTING FROM THE ASSESSMENT RATIO INCREASING FROM FOUR PERCENT TO SIX PERCENT AND NOT AS PROVIDING A CHANGE IN ASSESSMENT RATIO; AND TO PROVIDE THAT IF THE PRINCIPAL RESIDENCE IS SOLD, RENTED, OR OTHERWISE UNDERGOES AN ASSESSABLE TRANSFER OF INTEREST, THE APPLICABLE ASSESSMENT RATIO SHALL BE DETERMINED IN THE MANNER PROVIDED BY LAW.
l:\council\bills\gjk\20397sd10.docx
Prefiled and referred to the Committee on Finance.
Read the first time and referred to the Committee on Finance.
S. 960 (Word version) -- Senator Knotts: A JOINT RESOLUTION TO PROVIDE THAT THE PROVISIONS OF PARAGRAPH 1.77, SECTION 1, PART IB OF ACT 23 OF 2009, RELATING TO EDUCATIONAL SERVICES TO SOUTH CAROLINA RESIDENTS OF LAWFUL SCHOOL AGE RESIDING IN LICENSED RESIDENTIAL TREATMENT FACILITIES ARE SUSPENDED UNTIL REAUTHORIZED BY THE GENERAL ASSEMBLY BY ACT OR JOINT RESOLUTION.
l:\council\bills\nbd\20776sd10.docx
Prefiled and referred to the Committee on Education.
Read the first time and referred to the Committee on Education.
S. 961 (Word version) -- Senators Knotts and Elliott: A BILL TO PROVIDE THAT THE STATE DEPARTMENT OF EDUCATION SHALL HAVE OVERSIGHT RESPONSIBILITIES IN REGARD TO THE IMPLEMENTATION OF THE EDUCATIONAL PROGRAMS PROVIDED BY THE PROVISIONS OF PARAGRAPH 1.8, SECTION 1, PART IB OF ACT 23 OF 2009, RELATING TO EDUCATION PROGRAMS FOR CHILDREN OF LAWFUL SCHOOL AGE RESIDING IN A FOSTER HOME, GROUP HOME, ORPHANAGE, OR STATE-OPERATED HEALTH CARE FACILITY.
l:\council\bills\nbd\20777sd10.docx
Prefiled and referred to the Committee on Education.
Read the first time and referred to the Committee on Education.
S. 962 (Word version) -- Senator Knotts: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING SECTION 17-5-115 SO AS TO PROVIDE THE CONDITIONS UPON WHICH A DEPUTY CORONER MAY ENFORCE THE LAWS AND ORDINANCES OF THIS STATE AND ITS POLITICAL SUBDIVISIONS.
l:\council\bills\agm\19495cm09.docx
Prefiled and referred to the Committee on Judiciary.
Read the first time and referred to the Committee on Judiciary.
S. 963 (Word version) -- Senators Knotts, Cromer, Courson and Setzler: A BILL TO AMEND SECTION 7-7-380, AS AMENDED, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO THE DESIGNATION OF VOTING PRECINCTS IN LEXINGTON COUNTY, SO AS TO REVISE AND RENAME CERTAIN VOTING PRECINCTS OF LEXINGTON COUNTY AND REDESIGNATE A MAP NUMBER FOR THE MAP ON WHICH LINES OF THESE PRECINCTS ARE DELINEATED AND MAINTAINED BY THE OFFICE OF RESEARCH AND STATISTICS OF THE STATE BUDGET AND CONTROL BOARD.
l:\council\bills\dka\3782dw09.docx
Prefiled and referred to the Committee on Judiciary.
Read the first time and referred to the Committee on Judiciary.
S. 964 (Word version) -- Senator Pinckney: A BILL TO AMEND SECTION 59-53-2410, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO TECHNICAL COLLEGE ENTERPRISE CAMPUS AUTHORITIES, SO AS TO CREATE THE TECHNICAL COLLEGE OF THE LOWCOUNTRY ENTERPRISE CAMPUS AUTHORITY.
l:\council\bills\agm\19545bh10.docx
Prefiled and referred to the Committee on Education.
Read the first time and referred to the Committee on Education.
S. 965 (Word version) -- Senators Sheheen and Elliott: A BILL TO AMEND SECTION 40-47-760 OF THE 1976 CODE, RELATING TO EXEMPTIONS FROM THE ACUPUNCTURE ACT OF SOUTH CAROLINA, TO ADD PHYSICIANS TRAINED TO PERFORM ACUPUNCTURE TO THE LIST OF EXEMPTIONS.
l:\s-res\vas\010acup.kmm.vas.docx
Prefiled and referred to the Committee on Labor, Commerce and Industry.
Read the first time and referred to the Committee on Labor, Commerce and Industry.
S. 966 (Word version) -- Senators Sheheen, Rose and Elliott: A BILL TO AMEND SECTION 56-3-1910 OF THE 1976 CODE, AS AMENDED, RELATING TO LICENSE PLATES FOR HANDICAPPED PERSONS, TO PROVIDE SUMMARY COURT WITH JURISDICTION OVER OFFENSES IN VIOLATION OF THIS SECTION; TO AMEND SECTION 56-3-1960, AS AMENDED, RELATING TO TEMPORARY AND PERMANENT PARKING PLACARDS, TO PROVIDE SUMMARY COURT WITH JURISDICTION OVER OFFENSES IN VIOLATION OF THIS SECTION; AND TO AMEND SECTION 56-3-1970, AS AMENDED, RELATING TO PARKING PLACES DESIGNATED FOR HANDICAPPED PERSONS, TO PROVIDE SUMMARY COURT WITH JURISDICTION OVER OFFENSES IN VIOLATION OF THIS SECTION.
l:\s-res\vas\009sumc.kmm.vas.docx
Prefiled and referred to the Committee on Judiciary.
Read the first time and referred to the Committee on Judiciary.
S. 967 (Word version) -- Senator Bryant: A BILL TO AMEND SECTION 56-1-80, AS AMENDED, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO INFORMATION THAT A PERSON MUST SUBMIT TO THE DEPARTMENT OF MOTOR VEHICLES TO OBTAIN A DRIVER'S LICENSE OR PERMIT, SO AS TO PROVIDE A LIST OF DOCUMENTS THAT MAY BE SUBMITTED TO PROVE THE DATE AND PLACE OF BIRTH OF A PERSON WHO IS AT LEAST SIXTY-FIVE YEARS OLD.
l:\council\bills\swb\5992cm10.docx
Prefiled and referred to the Committee on Transportation.
Read the first time and referred to the Committee on Transportation.
S. 968 (Word version) -- Senators Bryant and Ryberg: A BILL TO AMEND CHAPTER 6, TITLE 12 OF THE 1976 CODE, RELATING TO THE SOUTH CAROLINA INCOME TAX, BY ADDING SECTION 12-6-5062, TO PROVIDE THAT TAXPAYERS MAY MAKE VOLUNTARY CONTRIBUTIONS TO THE GENERAL FUND OF THE STATE, TO PROVIDE THAT INCOME TAX FORMS MUST CONTAIN A DESIGNATION FOR THE CONTRIBUTION, TO PROVIDE THAT THE INSTRUCTIONS ACCOMPANYING THE INCOME TAX FORM MUST CONTAIN AN EXPLANATION OF HOW THE ADDITIONAL PAYMENT WILL BE USED, AND TO REQUIRE THE DEPARTMENT TO REPORT THE AMOUNT COLLECTED PURSUANT TO THIS SECTION.
l:\s-res\klb\019volu.kmm.klb.docx
Prefiled and referred to the Committee on Finance.
Read the first time and referred to the Committee on Finance.
S. 969 (Word version) -- Senator Bryant: A BILL TO AMEND SECTION 16-3-1750 OF THE 1976 CODE, RELATING TO THE DURATION OF A RESTRAINING ORDER AGAINST A PERSON ENGAGED IN HARASSMENT OR STALKING, TO PROVIDE THAT THE ORDER MAY NOT BE LIFTED WITHOUT THE CONSENT OF THE VICTIM; TO AMEND SECTION 16-3-1780, RELATING TO THE MODIFICATION OF RESTRAINING ORDERS, TO PROVIDE THAT THE COURT MAY NOT TERMINATE THE FIXED PERIOD OR TERMINATE A RESTRAINING ORDER WITHOUT THE PRIOR CONSENT OF THE PLAINTIFF; TO AMEND SECTION 16-25-120, RELATING TO THE ISSUANCE OF A RESTRAINING ORDER, TO PROVIDE THAT THE COURT MAY NOT SHORTEN THE FIXED PERIOD OR TERMINATE A RESTRAINING ORDER OR PROTECTIVE ORDER WITHOUT PRIOR CONSENT OF THE VICTIM; AND TO AMEND SECTION 20-4-70, RELATING TO THE DURATION OF THE TERM OF A PROTECTIVE ORDER AND THE MODIFICATION OF ITS TERMS, TO PROVIDE THAT EITHER PARTY MAY EXTEND THE LENGTH OF AN ORDER, AND TO PROVIDE THAT THE LENGTH OF THE ORDER MAY NOT BE SHORTENED OR TERMINATED WITHOUT THE CONSENT OF THE PETITIONER.
l:\s-res\klb\017rest.kmm.klb.docx
Prefiled and referred to the Committee on Judiciary.
Read the first time and referred to the Committee on Judiciary.
S. 970 (Word version) -- Senator Bryant: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING ARTICLE 50 TO CHAPTER 5, TITLE 56, TO PROVIDE THAT IT IS UNLAWFUL FOR DRIVERS TO SEND OR READ TEXT MESSAGES OR EMAILS, TO PROVIDE THAT A VIOLATION OF THIS SECTION MAY NOT BE THE SOLE OR PRIMARY BASIS FOR A LAW ENFORCEMENT OFFICER TO STOP A VEHICLE, TO PROVIDE FOR CERTAIN EXCEPTIONS, TO PROVIDE APPROPRIATE PENALTIES AND DEFINITIONS, AND TO PROVIDE FOR AN EDUCATION PROGRAM.
l:\s-res\klb\018text.kmm.klb.docx
Prefiled and referred to the Committee on Transportation.
Read the first time and referred to the Committee on Transportation.
S. 971 (Word version) -- Senator Bryant: A BILL TO AMEND SECTION 7-5-110 OF THE 1976 CODE, RELATING TO THE REQUIREMENT OF REGISTRATION IN ORDER TO VOTE, TO PROVIDE THAT A PERSON IS NOT ALLOWED TO VOTE IN A PARTISAN PRIMARY ELECTION OR PARTISAN ADVISORY REFERENDUM UNLESS THE PERSON HAS REGISTERED AS BEING A MEMBER OF THAT PARTY; TO AMEND SECTION 7-5-170, RELATING TO THE REQUIREMENTS FOR VOTER REGISTRATION, TO PROVIDE THE REQUIREMENT OF STATING POLITICAL PARTY AFFILIATION, IF ANY, ON THE FORM AND INCLUDING IT IN THE OATH, AND TO REQUIRE THE STATE ELECTION COMMISSION TO ASSIST IN MAINTAINING A LIST OF ALL ELECTORS REGISTERED BY PARTY AFFILIATION; AND TO AMEND SECTION 7-9-20, RELATING TO THE QUALIFICATIONS FOR VOTING IN PRIMARY ELECTIONS, TO INCLUDE, AS A REQUIREMENT, REGISTERING AS A MEMBER OF THE PARTY, AND TO PROVIDE A PROCEDURE FOR CHANGING POLITICAL PARTY AFFILIATION OR NONAFFILIATION AFTER A SELECTION HAS BEEN MADE.
l:\s-res\klb\016part.kmm.klb.docx
Prefiled and referred to the Committee on Judiciary.
Read the first time and referred to the Committee on Judiciary.
S. 972 (Word version) -- Senators Campsen and Rose: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING SECTION 24-21-705, SO AS TO PROVIDE THAT, UPON RECEIPT OF THE NOTICE OF A PAROLE HEARING, THE VICTIM AND MEMBERS OF THE VICTIM'S IMMEDIATE FAMILY, MAY SUBMIT WRITTEN STATEMENTS TO THE BOARD OF PROBATION, PAROLE AND PARDON SERVICES, AND TO PROVIDE THAT THE STATEMENTS MUST BE CONSIDERED BY THE BOARD IN MAKING ITS DETERMINATION OF PAROLE, AND TO PROVIDE THAT THE STATEMENTS MUST BE RETAINED BY THE BOARD AND MUST BE SUBMITTED AT SUBSEQUENT PAROLE HEARINGS.
l:\s-jud\bills\campsen\jud0016.jjg.docx
Prefiled and referred to the Committee on Judiciary.
Read the first time and referred to the Committee on Judiciary.
S. 973 (Word version) -- Senators Campsen, Rose and Elliott: A BILL TO AMEND TITLE 23, CHAPTER 3, ARTICLE 7 OF THE CODE OF LAWS OF SOUTH CAROLINA, 1976, TO ENACT THE "ELECTRONIC SECURING AND TARGETING OF ONLINE PREDATORS ACT (E-STOP)", BY ADDING SECTION 23-3-555, SO AS TO PROVIDE THAT A SEX OFFENDER WHO IS REQUIRED TO REGISTER WITH THE SEX OFFENDER REGISTRY MUST PROVIDE INFORMATION REGARDING THE OFFENDER'S INTERNET ACCOUNTS WITH INTERNET ACCESS PROVIDERS AND THE OFFENDER'S INTERNET IDENTIFIERS, AND TO PROVIDE THAT AN AUTHORIZED INTERNET ENTITY MAY REQUEST CERTAIN SEX OFFENDER REGISTRY INFORMATION FROM SLED, AND TO PROVIDE THAT SLED MUST PROVIDE CERTAIN SEX OFFENDER REGISTRY INFORMATION TO AN AUTHORIZED INTERNET ENTITY, AND TO PROVIDE THAT CERTAIN SEX OFFENDERS MUST, AS A CONDITION OF PROBATION OR PAROLE, BE PROHIBITED FROM USING THE INTERNET TO ACCESS SOCIAL NETWORKING WEBSITES, COMMUNICATE WITH OTHER PERSONS OR GROUPS FOR THE PURPOSE OF PROMOTING SEXUAL RELATIONS WITH PERSONS UNDER THE AGE OF EIGHTEEN, AND COMMUNICATE WITH PERSONS UNDER THE AGE OF EIGHTEEN.
l:\s-jud\bills\campsen\jud0015.jjg.docx
Prefiled and referred to the Committee on Judiciary.
Read the first time and referred to the Committee on Judiciary.
l:\s-res\gec\049annu.kmm.gec.docx
Prefiled and referred to the Committee on Fish, Game and Forestry.
Read the first time and referred to the Committee on Fish, Game and Forestry.
S. 975 (Word version) -- Senator Campsen: A BILL TO AMEND SECTION 50-11-65 OF THE 1976 CODE, RELATING TO THE TRAINING OF BIRD DOGS, TO DEFINE "TRAINING BIRDS", TO PROVIDE FOR THE USE OF TRAINING BIRDS DURING THE CLOSED SEASON, AND TO PROVIDE THAT TRAINING MUST HAVE MINIMAL DISTURBANCE ON WILD BIRDS.
l:\s-res\gec\048bird.kmm.gec.docx
Prefiled and referred to the Committee on Fish, Game and Forestry.
Read the first time and referred to the Committee on Fish, Game and Forestry.
S. 976 (Word version) -- Senators Cleary and Rose: A BILL TO AMEND SECTION 4-9-30, AS AMENDED, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO POWERS OF A COUNTY GOVERNMENT, SO AS TO AUTHORIZE THE GOVERNING BODY OF A COUNTY TO ADOPT BY ORDINANCE THE REQUIREMENT THAT A PROPERTY OWNER SHALL KEEP A LOT OR OTHER PROPERTY CLEAN AND FREE OF RUBBISH SO AS NOT TO CONSTITUTE A PUBLIC NUISANCE AND PROVIDE A PROCEDURE FOR ENFORCEMENT OF THE ORDINANCE.
l:\council\bills\dka\3779dw10.docx
Prefiled and referred to the Committee on Judiciary.
Read the first time and referred to the Committee on Judiciary.
S. 977 (Word version) -- Senators Lourie and Rose: A BILL TO AMEND SECTION 56-1-225, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO THE REEXAMINATION OF A DRIVER INVOLVED IN FOUR ACCIDENTS WITHIN A TWENTY-FOUR MONTH PERIOD, SO AS TO REQUIRE REEXAMINATION OF A DRIVER WHO HAS HAD AT LEAST THREE ACCIDENTS DURING A TWENTY-FOUR MONTH PERIOD; TO AMEND SECTION 56-3-180, RELATING TO THE ISSUANCE OF SPECIAL PERMITS BY THE DEPARTMENT OF MOTOR VEHICLES TO MOVE VEHICLES DURING AN EMERGENCY, SO AS TO REVISE THE NUMBER OF PERMITS THAT MAY BE ISSUED TO A VEHICLE DURING A YEAR, AND THE INFORMATION CONTAINED ON A SPECIAL PERMIT; AND TO AMEND SECTION 56-5-2941, AS AMENDED, RELATING TO THE INSTALLATION OF AN IGNITION INTERLOCK DEVICE ON THE VEHICLE OF A PERSON WHO HAS VIOLATED A PROVISION THAT MAKES IT UNLAWFUL TO OPERATE A VEHICLE WHILE UNDER THE INFLUENCE OF ALCOHOL OR DRUGS, OR WITH AN UNLAWFUL ALCOHOL CONCENTRATION, SO AS TO REVISE THE PENALTY IMPOSED UPON A PERSON WHO IS ISSUED A DRIVER'S LICENSE WITH AN IGNITION INTERLOCK RESTRICTION AND DRIVES A MOTOR VEHICLE THAT IS NOT EQUIPPED WITH A PROPERLY OPERATING CERTIFIED IGNITION INTERLOCK DEVICE.
l:\council\bills\swb\5978cm10.docx
Prefiled and referred to the Committee on Transportation.
Read the first time and referred to the Committee on Transportation.
S. 978 (Word version) -- Senators Campbell, Rose and Bryant: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING SECTION 59-19-115 SO AS TO REQUIRE A SUBSTITUTE TEACHER HIRED BY A LOCAL SCHOOL DISTRICT TO UNDERGO A CRIMINAL RECORD SEARCH, TO REQUIRE EACH SCHOOL DISTRICT TO DEVELOP A WRITTEN POLICY ON THE CRIMINAL RECORD SEARCH, TO PROVIDE WHAT THE POLICY MUST INCLUDE, AND TO REQUIRE THE SOUTH CAROLINA LAW ENFORCEMENT DIVISION TO PROVIDE TRAINING TO APPROPRIATE SCHOOL DISTRICT PERSONNEL; AND TO AMEND SECTION 23-3-115, RELATING TO FEES FOR CRIMINAL RECORD SEARCHES, SO AS TO FIX THE FEE AT EIGHT DOLLARS FOR CERTAIN SCHOOL DISTRICT EMPLOYEES.
l:\council\bills\agm\19534bh10.docx
Prefiled and referred to the Committee on Education.
Read the first time and referred to the Committee on Education.
S. 979 (Word version) -- Senator Davis: A BILL TO AMEND TITLE 48 OF THE 1976 CODE, BY ADDING CHAPTER 61, TO ENACT THE "SEA TURTLE PROTECTION ACT", TO PROHIBIT LEAVING PERSONAL ITEMS OR TEMPORARY STRUCTURES THAT INTERFERE WITH, OBSTRUCT, OR PREVENT CLEAR ACCESS TO THE OCEAN BY SEA TURTLES FROM BEING LEFT ON PUBLIC BEACHES OVERNIGHT, TO PROVIDE FOR A TEMPORARY PERMIT, AND TO ESTABLISH APPROPRIATE PENALTIES.
l:\s-res\td\005seat.kmm.td.docx
Prefiled and referred to the Committee on Fish, Game and Forestry.
Read the first time and referred to the Committee on Fish, Game and Forestry.
S. 980 (Word version) -- Senators Bright, S. Martin and Bryant: A JOINT RESOLUTION PROPOSING AN AMENDMENT TO ARTICLE I OF THE CONSTITUTION OF SOUTH CAROLINA, 1895, RELATING TO THE DECLARATION OF RIGHTS, BY ADDING SECTION 25 TO PREEMPT ANY FEDERAL LAW OR RULE THAT RESTRICTS A PERSON'S CHOICE OF PRIVATE HEALTH CARE PROVIDERS OR THE RIGHT TO PAY FOR MEDICAL SERVICES.
l:\s-res\lb\036heal.kmm.lb.docx
Prefiled and referred to the Committee on Judiciary.
Read the first time and referred to the Committee on Judiciary.
S. 981 (Word version) -- Senator Rose: A BILL TO AMEND SECTION 63-3-530, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO THE JURISDICTION OF THE FAMILY COURT, INCLUDING JURISDICTION TO ORDER VISITATION FOR GRANDPARENTS, SO AS TO PROVIDE THAT THE COURT MAY ORDER GRANDPARENT VISITATION IF THE COURT FINDS THAT THE CHILD'S PARENTS ARE DEPRIVING THE GRANDPARENT VISITATION WITH THE CHILD AND THAT THE PARENTS ARE UNFIT OR THAT THERE ARE COMPELLING CIRCUMSTANCES TO OVERCOME THE PRESUMPTION THAT THE PARENTAL DECISION IS IN THE CHILD'S BEST INTEREST.
l:\council\bills\nbd\11608ac10.docx
Prefiled and referred to the Committee on Judiciary.
Read the first time and referred to the Committee on Judiciary.
S. 982 (Word version) -- Senator Rose: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING SECTION 5-3-145 SO AS TO REQUIRE A "PLAN OF SERVICES" BEFORE APPROVAL OF ALL ANNEXATION PROPOSALS; BY ADDING SECTION 5-3-160 SO AS TO REQUIRE A NEW ANNEXATION BE CONSISTENT WITH LOCAL COMPREHENSIVE LAND USE PLANS; TO AMEND SECTION 5-3-150, RELATING TO ALTERNATE METHODS WHERE A PETITION IS SIGNED BY ALL OR SEVENTY-FIVE PERCENT OF LANDOWNERS, SO AS TO GIVE STANDING TO OTHER PERSONS OR ENTITIES TO BRING SUIT TO CHALLENGE A PROPOSED OR COMPLETED ANNEXATION, REQUIRE PUBLIC NOTICE OF A PUBLIC HEARING WHICH IS REQUIRED BEFORE ACTING ON AN ANNEXATION PETITION; AND TO AMEND SECTION 5-3-305, RELATING TO DEFINITIONS USED IN ANNEXATION PROCEDURE, SO AS TO DEFINE "URBAN AREA" AND CHANGE THE DEFINITION OF "CONTIGUOUS".
l:\council\bills\dka\3797dw10.docx
Prefiled and referred to the Committee on Judiciary.
Read the first time and referred to the Committee on Judiciary.
S. 983 (Word version) -- Senator Rose: A BILL TO AMEND SECTION 12-37-220, AS AMENDED, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO PROPERTY TAX EXEMPTIONS, SO AS TO EXEMPT AN AMOUNT OF FAIR MARKET VALUE OF A NEWLY ACQUIRED OWNER-OCCUPIED RESIDENCE SUFFICIENT TO EQUAL THE ASSESSED VALUE OF THE TAXPAYER'S PREVIOUS RESIDENCE IF THE TAXPAYER IS AT LEAST FIFTY-FIVE YEARS OF AGE, THE NEW RESIDENCE QUALIFIES AS THE TAXPAYER'S OWNER-OCCUPIED RESIDENCE WITHIN TWENTY-FOUR MONTHS OF THE TRANSFER OF THE PREVIOUS RESIDENCE, AND IF THE FAIR MARKET VALUE OF THE NEWLY ACQUIRED RESIDENCE IS EQUAL TO OR LESS THAN THE FAIR MARKET VALUE OF THE PREVIOUS RESIDENCE.
l:\council\bills\nbd\11576sd10.docx
Prefiled and referred to the Committee on Finance.
Read the first time and referred to the Committee on Finance.
S. 984 (Word version) -- Senator Rose: A BILL TO AMEND TITLE 11 OF THE 1976 CODE, BY ADDING CHAPTER 54, TO CREATE THE COUNCIL ON EFFICIENT GOVERNMENT, TO PROVIDE THE POWERS AND DUTIES OF THE COUNCIL, TO PROVIDE THE REQUIREMENTS OF A STATE AGENCY PROPOSAL TO OUTSOURCE GOODS OR SERVICES, TO PROVIDE FOR AN ACCOUNTING METHOD TO BE USED BY THE COUNCIL, AND TO PROVIDE EXCEPTIONS.
l:\s-res\mtr\053effi.ebd.mtr.docx
Prefiled and referred to the Committee on Finance.
Read the first time and referred to the Committee on Finance.
S. 985 (Word version) -- Senators Rose and S. Martin: A BILL TO AMEND CHAPTER 71, TITLE 38 OF THE 1976 CODE, RELATING TO HEALTH INSURANCE COVERAGE, BY ADDING SECTION 38-71-45, TO PROVIDE THAT A WOMAN CANNOT BE DENIED HEALTH INSURANCE COVERAGE BECAUSE SHE HAS UNDERGONE A CESAREAN SECTION, AND TO PROVIDE THAT AN INJURY OR CONDITION RESULTING FROM A CESAREAN SECTION SHALL NOT BE CONSIDERED A PREEXISTING CONDITION; AND BY ADDING SECTION 38-71-48 TO PROVIDE THAT A PERSON MAY NOT BE DENIED COVERAGE BASED UPON THE APPLICANT'S OR INSURED'S STATUS AS A VICTIM OF DOMESTIC VIOLENCE OR ABUSE, AND TO PROVIDE THAT AN INJURY OR CONDITION RESULTING FROM DOMESTIC VIOLENCE OR ABUSE SHALL NOT BE CONSIDERED A PREEXISTING CONDITION.
l:\s-res\mtr\054dome.mrh.mtr.docx
Prefiled and referred to the Committee on Banking and Insurance.
Read the first time and referred to the Committee on Banking and Insurance.
S. 986 (Word version) -- Senators Rose, Elliott and S. Martin: A BILL TO AMEND CHAPTER 5, TITLE 38 OF THE 1976 CODE, RELATING TO TRANSACTING INSURANCE BUSINESS, BY ADDING SECTION 38-5-15, TO PROVIDE THAT THE DEPARTMENT OF INSURANCE SHALL AUTHORIZE OUT-OF-STATE INSURERS TO OFFER HEALTH INSURANCE POLICIES IN THIS STATE, TO AUTHORIZE THE DIRECTOR OF THE DEPARTMENT OF INSURANCE TO CONDUCT MARKET AND SOLVENCY EXAMINATIONS OF OUT-OF-STATE INSURERS SEEKING TO OFFER PLANS IN THIS STATE, AND TO PROVIDE LANGUAGE THAT MUST BE PRESENT IN AN OUT-OF-STATE HEALTH INSURANCE PLAN OFFERED TO SOUTH CAROLINA RESIDENTS.
l:\s-res\mtr\052heal.ebd.mtr.docx
Prefiled and referred to the Committee on Banking and Insurance.
Read the first time and referred to the Committee on Banking and Insurance.
S. 987 (Word version) -- Senators Rose, S. Martin and Bryant: A BILL TO AMEND CHAPTER 1, TITLE 38 OF THE 1976 CODE, BY ADDING SECTION 38-1-40 TO ENACT THE "FREEDOM OF CHOICE IN HEALTH CARE ACT", TO PROVIDE THAT CITIZENS OF THIS STATE HAVE THE RIGHT TO PURCHASE PRIVATE HEALTH INSURANCE, TO PROVIDE THAT THE GENERAL ASSEMBLY MAY NOT REQUIRE ANY PERSON TO PURCHASE HEALTH CARE INSURANCE, AND TO REQUIRE THE ATTORNEY GENERAL TO CHALLENGE THE CONSTITUTIONALITY OF ANY HEALTH CARE PLAN MANDATED BY CONGRESS.
l:\s-res\mtr\050heal.ebd.mtr.docx
Prefiled and referred to the Committee on Banking and Insurance.
Read the first time and referred to the Committee on Banking and Insurance.
S. 988 (Word version) -- Senator Rose: A BILL TO AMEND TITLE 38 OF THE 1976 CODE, BY ADDING CHAPTER 105, TO ENACT THE "MANDATED BENEFITS REVIEW ACT", TO PROVIDE DEFINITIONS, TO PROVIDE THAT PROPOSED AND EXISTING MANDATED HEALTH BENEFITS MUST BE REVIEWED BY THE DEPARTMENT OF INSURANCE, TO PROVIDE THE METHOD OF REVIEW, AND TO PROVIDE FOR THE EXPIRATION OF MANDATED HEALTH BENEFITS AFTER REVIEW UNLESS THE BENEFITS ARE REAUTHORIZED BY THE GENERAL ASSEMBLY.
l:\s-res\mtr\051heal.ebd.mtr.docx
Prefiled and referred to the Committee on Banking and Insurance.
Read the first time and referred to the Committee on Banking and Insurance.
S. 989 (Word version) -- Senator Rose: A BILL TO AMEND CHAPTER 35, TITLE 11 OF THE 1976 CODE, BY ADDING SECTION 11-35-1600, TO PROVIDE THAT ANY STATE AGENCY ENTERING INTO A CONTRACT FOR LEGAL SERVICES IN EXCESS OF ONE MILLION DOLLARS MUST AWARD THE CONTRACT BY COMPETITIVE SEALED BIDDING, TO CREATE THE PRIVATE ATTORNEY RETENTION COMMITTEE AND TO PROVIDE FOR THE COMMITTEE'S DUTIES AND POWERS, TO PROVIDE THE CONTRACT REVIEW PROCESS FOR LEGAL SERVICE CONTRACTS IN EXCESS OF ONE MILLION DOLLARS, AND TO PROVIDE EXCEPTIONS.
l:\s-res\mtr\049pars.mrh.mtr.docx
Prefiled and referred to the Committee on Finance.
Read the first time and referred to the Committee on Finance.
S. 990 (Word version) -- Senator Rose: A BILL TO AMEND SECTION 44-7-260 OF THE 1976 CODE, RELATING TO REQUIREMENTS FOR LICENSURE, TO PROVIDE THAT NURSING HOMES MUST CARRY AT LEAST ONE MILLION DOLLARS IN COMPREHENSIVE GENERAL LIABILITY INSURANCE TO OBTAIN A LICENSE, TO PROVIDE THAT A NURSING HOME MUST NOTIFY THE DEPARTMENT OF HEALTH AND ENVIRONMENTAL CONTROL UPON CANCELLATION OF A GENERAL LIABILITY POLICY, AND TO PROVIDE THAT A NURSING HOME LICENSE SHALL BE REVOKED UPON FAILURE TO MAINTAIN GENERAL LIABILITY INSURANCE.
l:\s-res\mtr\045nurs.ebd.mtr.docx
Prefiled and referred to the Committee on Medical Affairs.
Read the first time and referred to the Committee on Medical Affairs.
S. 991 (Word version) -- Senator Rose: A BILL TO AMEND CHAPTER 5, TITLE 56 OF THE 1976 CODE, BY ADDING SECTION 56-5-3895, TO PROVIDE THAT A PERSON MAY NOT OPERATE A MOTOR VEHICLE WHILE TEXT MESSAGING WITH A CELL PHONE OR OTHER WIRELESS COMMUNICATION DEVICE, AND TO PROVIDE FOR PENALTIES AND EXCEPTIONS.
l:\s-res\mtr\046text.mrh.mtr.docx
Prefiled and referred to the Committee on Transportation.
Read the first time and referred to the Committee on Transportation.
S. 992 (Word version) -- Senator Rose: A BILL TO AMEND SECTION 41-35-110 OF THE 1976 CODE, RELATING TO CONDITIONS OF ELIGIBILITY FOR UNEMPLOYMENT BENEFITS, TO PROVIDE THAT A CLAIMANT FOR UNEMPLOYMENT BENEFITS IS NOT ELIGIBLE FOR BENEFITS OR WAITING PERIOD CREDIT FOLLOWING A TEMPORARY WORK ASSIGNMENT UNLESS HE CAN SHOW THE TEMPORARY WORK AGENCY HAS BEEN NOTIFIED OF THE AVAILABILITY OF THE CLAIMANT FOR A NEW JOB ASSIGNMENT FROM THE AGENCY BUT HAS NOT PROVIDED A SUBSEQUENT ASSIGNMENT FOR WHICH THE CLAIMANT IS QUALIFIED.
l:\s-res\mtr\047temp.mrh.mtr.docx
Prefiled and referred to the Committee on Labor, Commerce and Industry.
Read the first time and referred to the Committee on Labor, Commerce and Industry.
S. 993 (Word version) -- Senators Rose and Elliott: A BILL TO AMEND SECTION 38-72-60 OF THE 1976 CODE, RELATING TO LONG TERM CARE INSURANCE TERMS AND CONDITIONS, TO PROVIDE THAT A LONG TERM CARE INSURANCE POLICY MUST PROVIDE AN OPTION TO NAME A THIRD PARTY TO CONTACT IF PREMIUMS GO UNPAID.
l:\s-res\mtr\048long.ebd.mtr.docx
Prefiled and referred to the Committee on Banking and Insurance.
Read the first time and referred to the Committee on Banking and Insurance.
S. 994 (Word version) -- Senator Rose: A BILL TO AMEND CHAPTER 3, TITLE 11 OF THE 1976 CODE, RELATING TO THE COMPTROLLER GENERAL, BY ADDING SECTION 11-3-250, TO PROVIDE THAT THE COMPTROLLER GENERAL SHALL CONTRACT WITH CONSULTANTS TO CONDUCT RECOVERY AUDITS OF PAYMENTS MADE ON BEHALF OF STATE AGENCIES TO VENDORS, TO PROVIDE WHEN AN AUDIT IS NECESSARY, AND TO PROVIDE THE PROCESS IN WHICH THE RESULTS OF THE AUDIT ARE ADMINISTERED.
l:\s-financ\drafting\mtr\003over.dag.mtr.docx
Prefiled and referred to the Committee on Finance.
Read the first time and referred to the Committee on Finance.
S. 995 (Word version) -- Senator Rose: A JOINT RESOLUTION PROPOSING AN AMENDMENT TO ARTICLE XV OF THE CONSTITUTION OF SOUTH CAROLINA, 1895, RELATING TO IMPEACHMENT OF CERTAIN EXECUTIVE AND JUDICIAL OFFICERS OF THIS STATE, BY ADDING SECTION 4 TO PROVIDE PROCEDURES FOR RECALLING AND REMOVING FROM PUBLIC OFFICE PERSONS HOLDING PUBLIC OFFICES OF THE STATE OR ITS POLITICAL SUBDIVISIONS IN THE EXECUTIVE AND LEGISLATIVE BRANCHES OF STATE OR LOCAL GOVERNMENTS.
l:\s-res\mtr\044remo.mrh.mtr.docx
Prefiled and referred to the Committee on Judiciary.
Read the first time and referred to the Committee on Judiciary.
S. 996 (Word version) -- Senator Rose: A BILL TO AMEND SECTION 1-13-80 OF THE 1976 CODE, RELATING TO UNLAWFUL EMPLOYMENT PRACTICES, TO PROVIDE THAT IT IS AN UNLAWFUL EMPLOYMENT PRACTICE FOR AN EMPLOYER TO USE AN INDIVIDUAL'S CREDIT REPORT OR CREDIT HISTORY AS THE BASIS TO FAIL OR REFUSE TO HIRE, BAR, DISCHARGE FROM EMPLOYMENT OR OTHERWISE DISCRIMINATE AGAINST AN INDIVIDUAL WITH RESPECT TO THE INDIVIDUAL'S COMPENSATION OR TERMS, CONDITIONS, OR PRIVILEGES OF EMPLOYMENT, AND PROVIDE THAT IT IS NOT AN UNLAWFUL EMPLOYMENT PRACTICE FOR AN EMPLOYER TO CONSIDER AN INDIVIDUAL'S CREDIT HISTORY UNDER CERTAIN CIRCUMSTANCES.
l:\s-res\mtr\042cred.kmm.mtr.docx
Prefiled and referred to the Committee on Judiciary.
Read the first time and referred to the Committee on Judiciary.
S. 997 (Word version) -- Senators Rose and S. Martin: A BILL TO AMEND CHAPTER 57, TITLE 38 OF THE 1976 CODE, RELATING TO TRADE PRACTICES IN THE INSURANCE INDUSTRY, BY ADDING SECTION 38-57-125 TO PROVIDE THAT A PERSON'S CREDIT HISTORY OR CREDIT REPORT CANNOT BE A FACTOR CONSIDERED WHEN DETERMINING WHETHER TO ISSUE A POLICY OR CONTRACT OR WHEN SETTING PREMIUMS, POLICY FEES, OR OTHER CHARGES FOR AN INSURANCE POLICY OR CONTRACT.
l:\s-res\mtr\041insu.kmm.mtr.docx
Prefiled and referred to the Committee on Banking and Insurance.
Read the first time and referred to the Committee on Banking and Insurance.
S. 998 (Word version) -- Senators Rose and S. Martin: A BILL TO AMEND TITLE 38 OF THE 1976 CODE, BY ADDING CHAPTER 110, TO CREATE THE "AFFORDABLE HEALTH INSURANCE ACT", TO PROVIDE THAT HEALTH INSURERS MAY OPERATE CERTAIN PROGRAMS WITHOUT VIOLATING UNFAIR TRADE PRACTICE LAWS, TO PROVIDE THAT NO RELATIONSHIP MUST EXIST BETWEEN PREFERRED PROVIDER AND NON-PREFERRED PROVIDER PLAN REIMBURSEMENTS, TO PROVIDE THAT THE DEPARTMENT OF INSURANCE SHALL ALLOW HEALTH REIMBURSEMENT ARRANGEMENT PLANS, TO PROVIDE EXCEPTIONS TO THE ALLOWANCE OF HEALTH REIMBURSEMENT ARRANGEMENT PLANS, AND TO PROVIDE FOR INCOME TAX EXEMPTIONS FOR PREMIUMS PAID TO A HIGH DEDUCTIBLE HEALTH PLAN.
l:\s-res\mtr\040affo.ebd.mtr.docx
Prefiled and referred to the Committee on Banking and Insurance.
Read the first time and referred to the Committee on Banking and Insurance.
S. 999 (Word version) -- Senator Rose: A BILL TO AMEND SECTION 12-6-1120 OF THE 1976 CODE, RELATING TO THE COMPUTATION OF SOUTH CAROLINA GROSS INCOME, TO PROVIDE THAT SOUTH CAROLINA GROSS INCOME DOES NOT INCLUDE AMOUNTS RECEIVED AS UNEMPLOYMENT BENEFITS.
l:\s-financ\drafting\mtr\002unem.dag.mtr.docx
Prefiled and referred to the Committee on Finance.
Read the first time and referred to the Committee on Finance.
S. 1000 (Word version) -- Senator Rose: A BILL TO AMEND CHAPTER 6, TITLE 12 OF THE 1976 CODE, RELATING TO INCOME TAXATION, BY ADDING SECTION 12-6-1205 TO PROVIDE THAT RETIREMENT COMPENSATION RECEIVED FOR MILITARY SERVICE TO THE UNITED STATES OF AMERICA IS EXEMPT FROM INCOME TAXATION.
l:\s-res\mtr\037mili.ebd.mtr.docx
Prefiled and referred to the Committee on Finance.
Read the first time and referred to the Committee on Finance.
S. 1001 (Word version) -- Senator Rose: A BILL TO AMEND CHAPTER 1, TITLE 15 OF THE 1976 CODE, RELATING TO CIVIL REMEDIES, BY ADDING SECTION 15-1-315 TO PROVIDE THAT A LICENSED DRIVER WHO VOLUNTARILY TRANSPORTS SENIORS OR PERSONS WITH DISABILITIES IN AN INSURED VEHICLE IS NOT LIABLE BEYOND THE LIMITS OF HIS AUTOMOBILE LIABILITY INSURANCE COVERAGE FOR ACTS OR OMISSIONS RESULTING FROM THE RENDERING OF THE TRANSPORTATION SERVICES IN THE ABSENSE OF GROSS NEGLIGENCE OR WILFUL MISCONDUCT.
l:\s-res\mtr\038volu.ebd.mtr.docx
Prefiled and referred to the Committee on Judiciary.
Read the first time and referred to the Committee on Judiciary.
S. 1002 (Word version) -- Senator Rose: A JOINT RESOLUTION PROPOSING AN AMENDMENT TO ARTICLE XVII OF THE CONSTITUTION OF SOUTH CAROLINA, 1895, BY ADDING SECTION 15 TO PERMIT THE ENACTMENT OF LAWS AND CONSTITUTIONAL AMENDMENTS BY INITIATIVE PETITION.
l:\s-res\mtr\039init.kmm.mtr.docx
Prefiled and referred to the Committee on Judiciary.
Read the first time and referred to the Committee on Judiciary.
S. 1003 (Word version) -- Senator Rose: A JOINT RESOLUTION TO PROPOSE AN AMENDMENT TO SECTION 9, ARTICLE III OF THE SOUTH CAROLINA CONSTITUTION, 1895, RELATING TO SESSIONS OF THE GENERAL ASSEMBLY, TO PROVIDE FOR THE BIENNIAL SESSION OF THE GENERAL ASSEMBLY, TO PROVIDE FOR A SINE DIE ADJOURNMENT DATE, TO PROVIDE THE MEANS AND THE LIMIT TO WHICH THE SINE DIE ADJOURNMENT DATE MAY BE EXTENDED, AND TO PROVIDE FOR THE CONVENING OF THE FIRST BIENNIAL SESSION.
Prefiled and referred to the Committee on Judiciary.
Read the first time and referred to the Committee on Judiciary.
S. 1004 (Word version) -- Senator Rose: A BILL TO AMEND ARTICLE 1, CHAPTER 111, TITLE 59 OF THE 1976 CODE, RELATING TO SCHOLARSHIPS, BY ADDING SECTION 59-111-90 TO AUTHORIZE THE COMMISSION ON HIGHER EDUCATION, IN CONSULTATION WITH THE SOUTH CAROLINA STUDENT LOAN CORPORATION, TO DEVELOP A LOAN REPAYMENT PROGRAM FOR TALENTED AND QUALIFIED STATE RESIDENTS WHO ATTEND STATE PUBLIC OR PRIVATE COLLEGES AND UNIVERSITIES FOR THE PURPOSE OF WORKING IN THE FIELD OF GERIATRIC NURSING, AND TO PROVIDE FOR THE PROCEDURES, CONDITIONS, AND REQUIREMENTS OF THE PROGRAM.
l:\s-res\mtr\030geri.ebd.mtr.docx
Prefiled and referred to the Committee on Education.
Read the first time and referred to the Committee on Education.
S. 1005 (Word version) -- Senator L. Martin: A BILL TO AMEND SECTION 11-11-156 OF THE 1976 CODE, RELATING TO THE HOMESTEAD EXEMPTION FUND, TO DEFINE SCHOOL OPERATING PURPOSES; AND TO AMEND SECTION 12-37-220, RELATING TO THE PROPERTY TAX EXEMPTION ON TAXES IMPOSED FOR SCHOOL OPERATING PURPOSES FOR OWNER-OCCUPIED RESIDENTIAL PROPERTY, TO DEFINE SCHOOL OPERATING PURPOSES AND TO SPECIFY THAT THE EXEMPTION DOES NOT EXTEND TO PAYMENTS MADE PURSUANT TO A FINANCING AGREEMENT.
l:\s-financ\drafting\lam\001lppr.dag.lam.docx
Prefiled and referred to the Committee on Finance.
Read the first time and referred to the Committee on Finance.
S. 1006 (Word version) -- Senator Rose: A BILL TO AMEND SECTION 12-37-250, AS AMENDED, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO THE HOMESTEAD PROPERTY TAX EXEMPTION ALLOWED PERSONS OVER THE AGE OF SIXTY-FIVE YEARS, OR DISABLED, OR LEGALLY BLIND, SO AS TO INCREASE THE EXEMPTION AMOUNT FROM THE FIRST FIFTY THOUSAND DOLLARS TO THE FIRST ONE HUNDRED THOUSAND DOLLARS OF THE FAIR MARKET VALUE OF THE HOMESTEAD; AND TO AMEND JOINT RESOLUTION 406 OF 2000, RELATING TO SUPPLEMENTAL APPROPRIATIONS, SO AS TO DELETE AN OBSOLETE REFERENCE OF THE HOMESTEAD EXEMPTION.
l:\s-res\mtr\024home.mrh.mtr.docx
Prefiled and referred to the Committee on Finance.
Read the first time and referred to the Committee on Finance.
S. 1007 (Word version) -- Senator Rose: A BILL TO AMEND ARTICLE 9, CHAPTER 6, TITLE 12 OF THE 1976 CODE, BY ADDING SECTION 12-6-1165 TO EXEMPT FROM STATE INCOME TAX THE TAXABLE INCOME OF A RESIDENT INDIVIDUAL WHO HAS ATTAINED THE AGE OF SIXTY-FIVE AND TO ALLOW A MARRIED INDIVIDUAL WHO IS ELIGIBLE FOR THE EXEMPTION AND FILING A JOINT FEDERAL TAX RETURN WITH A SPOUSE WHO HAS NOT ATTAINED THE AGE OF SIXTY-FIVE TO APPLY THE EXEMPTION TO ALL TAXABLE INCOME REPORTED ON THE JOINT RETURN; AND TO AMEND SECTION 12-6-1170, RELATING TO RETIREMENT INCOME DEDUCTIONS FROM TAXABLE INCOME OF INDIVIDUALS, TO DELETE LANGUAGE ALLOWING AN INCOME TAX DEDUCTION FOR INDIVIDUALS SIXTY-FIVE AND OLDER.
l:\s-financ\drafting\mtr\00265in.dag.mtr.docx
Prefiled and referred to the Committee on Finance.
Read the first time and referred to the Committee on Finance.
S. 1008 (Word version) -- Senator Rose: A BILL TO AMEND SECTION 22-1-15 OF THE 1976 CODE, RELATING TO THE EFFECT OF INCREASED EDUCATIONAL REQUIREMENTS FOR MAGISTRATES CURRENTLY SERVING, TO PROVIDE THAT THE INCREASED EDUCATION REQUIREMENTS OF AN ASSOCIATE'S AND A BACHELOR'S DEGREE NOT ONLY DO NOT APPLY TO A MAGISTRATE SERVING ON THE EFFECTIVE DATE OF THOSE INCREASED REQUIREMENTS DURING HIS TENURE IN OFFICE, BUT ALSO TO ANY SUBSEQUENT TERM OF OFFICE FOLLOWING A BREAK IN SERVICE.
l:\s-res\mtr\023magi.mrh.mtr.docx
Prefiled and referred to the Committee on Judiciary.
Read the first time and referred to the Committee on Judiciary.
S. 1009 (Word version) -- Senator Rose: A BILL TO AMEND SECTION 17-5-530 OF THE 1976 CODE, RELATING TO CORONER NOTIFICATION, TO PROVIDE THAT COUNTY CORONERS MUST BE NOTIFIED OF DEATHS IN NURSING HOMES.
l:\s-res\mtr\025noti.kmm.mtr.docx
Prefiled and referred to the Committee on Judiciary.
Read the first time and referred to the Committee on Judiciary.
S. 1010 (Word version) -- Senators Rose, Bryant and S. Martin: A JOINT RESOLUTION PROPOSING AN AMENDMENT TO ARTICLE I OF THE CONSTITUTION OF SOUTH CAROLINA, 1895, RELATING TO THE DECLARATION OF RIGHTS, BY ADDING SECTION 25 TO PREEMPT ANY FEDERAL LAW OR RULE THAT RESTRICTS A PERSON'S CHOICE OF PRIVATE HEALTH CARE PROVIDERS OR THE RIGHT TO PAY FOR MEDICAL SERVICES.
l:\s-res\mtr\026heal.ebd.mtr.docx
Prefiled and referred to the Committee on Judiciary.
Read the first time and referred to the Committee on Judiciary.
S. 1011 (Word version) -- Senator Rose: A BILL TO AMEND SECTION 56-1-180 OF THE 1976 CODE, RELATING TO DRIVER'S LICENSES, TO PROVIDE THAT A PERSON WITH A SPECIAL RESTRICTED DRIVER'S LICENSE MAY DRIVE UNACCOMPANIED BETWEEN HIS HOME AND HIS PLACE OF WORSHIP.
l:\s-res\mtr\028driv.ebd.mtr.docx
Prefiled and referred to the Committee on Transportation.
Read the first time and referred to the Committee on Transportation.
S. 1012 (Word version) -- Senator Rose: A BILL TO AMEND SECTION 48-59-30 OF THE 1976 CODE, RELATING TO DEFINITIONS OF TERMS USED IN THE CONSERVATION BANK ACT, TO PROVIDE THAT A COUNTY IS AN ELIGIBLE TRUST FUND RECIPIENT.
l:\s-res\mtr\029coun.ebd.mtr.docx
Prefiled and referred to the Committee on Agriculture and Natural Resources.
Read the first time and referred to the Committee on Agriculture and Natural Resources.
S. 1013 (Word version) -- Senator Rose: A BILL TO AMEND SECTION 23-23-10 OF THE 1976 CODE, RELATING TO THE SOUTH CAROLINA CRIMINAL JUSTICE ACADEMY, BY ADDING AN APPROPRIATELY NUMBERED NEW SUBSECTION TO PROVIDE THAT CORONERS MUST BE ALLOWED TO ATTEND THE CRIMINAL JUSTICE ACADEMY TO RECEIVE BASIC AND ANY APPLICABLE ADVANCED TRAINING AVAILABLE TO LAW ENFORCEMENT OFFICERS.
l:\s-res\mtr\035coro.mrh.mtr.docx
Prefiled and referred to the Committee on Judiciary.
Read the first time and referred to the Committee on Judiciary.
S. 1014 (Word version) -- Senators Jackson and Rose: A BILL TO AMEND SECTION 33-31-1402, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO DISSOLUTION OF NONPROFIT CORPORATIONS BY DIRECTORS, MEMBERS, AND THIRD PERSONS, SO AS TO PROVIDE THAT BEFORE THE SECRETARY OF STATE MAY ACCEPT FOR FILING ARTICLES OF DISSOLUTION OF AN EXISTING NONPROFIT RELIGIOUS OR CHARITABLE ORGANIZATION EXECUTED BY A PERSON AUTHORIZED BY THIS SECTION TO TAKE SUCH ACTION, THE SECRETARY OF STATE SHALL REQUIRE THIS PERSON TO ATTACH AN AFFIDAVIT TO THE FILING WHERE THE PERSON UNDER OATH SUBJECT TO A PENALTY OF PERJURY CERTIFIES THAT HE HOLDS THE REQUISITE AUTHORITY TO TAKE SUCH ACTION.
l:\council\bills\nbd\11572sd10.docx
Prefiled and referred to the Committee on Judiciary.
Read the first time and referred to the Committee on Judiciary.
S. 1015 (Word version) -- Senators Campbell, Campsen and Grooms: A CONCURRENT RESOLUTION CONGRATULATING THE WASSAMASAW TRIBE OF VARNERTOWN INDIANS OF SOUTH CAROLINA ON THE HIGHEST HONOR OF ITS RECOGNITION AS A "TRIBE" BY THE SOUTH CAROLINA COMMISSION FOR MINORITY AFFAIRS ON OCTOBER 9, 2009.
l:\council\bills\agm\19517htc09.docx
The Concurrent Resolution was adopted, ordered sent to the House.
S. 1016 (Word version) -- Senator Knotts: A CONCURRENT RESOLUTION TO RECOGNIZE AND COMMEND THE LEXINGTON COUNTY GIRLS CLASSIC SOCCER TEAM, THE LCSC UNITED 92G WHITE, FOR ITS OUTSTANDING SEASON AND FOR CAPTURING THE PRESIDENTS MEDAL SOCCER LEAGUE STATE CUP FOR THE U17 GIRLS CLASSIC DIVISION, AND TO HONOR THE TEAM'S EXCEPTIONAL PLAYERS AND COACHES.
l:\council\bills\ms\7449ahb10.docx
The Concurrent Resolution was adopted, ordered sent to the House.
S. 1017 (Word version) -- Senators Campsen, Leatherman, McConnell, Grooms, Campbell and Bryant: A CONCURRENT RESOLUTION TO CONGRATULATE THE SOUTH CAROLINA DEPARTMENT OF COMMERCE UPON RECEIVING THE ECONOMIC DEAL OF THE YEAR AWARD BY "BUSINESS FACILITIES" MAGAZINE.
l:\s-res\gec\050boei.kmm.gec.docx
The Concurrent Resolution was adopted, ordered sent to the House.
S. 1018 (Word version) -- Senators Jackson, Lourie and Courson: A CONCURRENT RESOLUTION TO REQUEST THE GOVERNING BODY OF THE CITY OF COLUMBIA TO SET A DATE FOR AN ELECTION SO THAT THE ELECTORS OF THE CITY MAY VOTE TO CHANGE THE FORM OF GOVERNMENT FROM THE COUNCIL-MANAGER FORM PRESENTLY USED BY THE CITY TO THE MAYOR-COUNCIL FORM OF GOVERNMENT.
l:\council\bills\agm\19512dw10.docx
On motion of Senator JACKSON, with unanimous consent, the Concurrent Resolution was introduced and ordered placed on the Calendar without reference.
S. 1019 (Word version) -- Senators Courson and Lourie: A CONCURRENT RESOLUTION TO CONGRATULATE DR. KAPPY D. CANNON, PRINCIPAL OF FOREST LAKE ELEMENTARY TECHNOLOGY MAGNET SCHOOL IN RICHLAND SCHOOL DISTRICT TWO, ON BEING NAMED 2010 SOUTH CAROLINA ELEMENTARY SCHOOL PRINCIPAL OF THE YEAR BY THE SOUTH CAROLINA ASSOCIATION OF SCHOOL ADMINISTRATORS.
l:\council\bills\rm\1009htc10.docx
The Concurrent Resolution was adopted, ordered sent to the House.
S. 1020 (Word version) -- Senators Courson, Fair and Verdin: A CONCURRENT RESOLUTION TO CONGRATULATE MR. LANCE C. RADFORD OF GREENVILLE COUNTY ON BEING NAMED 2010 SOUTH CAROLINA HIGH SCHOOL PRINCIPAL OF THE YEAR, TO COMMEND HIM FOR HIS MANY YEARS OF DEDICATED SERVICE AND OUTSTANDING CONTRIBUTIONS TO EDUCATION IN SOUTH CAROLINA, AND TO WISH HIM MUCH SUCCESS IN ALL HIS FUTURE ENDEAVORS.
l:\council\bills\rm\1006sd10.docx
The Concurrent Resolution was adopted, ordered sent to the House.
S. 1021 (Word version) -- Senator Massey: A BILL TO AMEND ACT 476 OF 1969, AS AMENDED, RELATING TO THE VALLEY PUBLIC SERVICE AUTHORITY IN AIKEN COUNTY, SO AS TO ADD TWO MEMBERS TO THE GOVERNING BOARD OF THE AUTHORITY AND TO PROVIDE FOR THEIR TERMS AND MANNER OF APPOINTMENT.
l:\council\bills\nbd\11594sd10.docx
Read the first time and ordered placed on the Local and Uncontested Calendar.
S. 1022 (Word version) -- Senators Hayes and Mulvaney: A BILL TO AMEND ACT 959 OF 1954, AS AMENDED, RELATING TO THE CREATION OF THE YORK COUNTY NATURAL GAS AUTHORITY, SO AS TO ALLOW IT TO CONNECT TO ANY SOURCE OF NATURAL GAS AND TO INCREASE ITS POWERS TO ALLOW, AMONG OTHER THINGS, THE PURCHASE AND SALE OF THE TOWN OF BLACKSBURG'S NATURAL GAS SYSTEM.
l:\council\bills\dka\3802dw10.docx
Read the first time and ordered placed on the Local and Uncontested Calendar.
S. 1023 (Word version) -- Senator McConnell: A BILL TO AMEND CHAPTER 27, TITLE 46 OF THE 1976 CODE OF LAWS, BY ADDING SECTION 46-27-55 TO PERMIT A VENISON PROCESSOR THAT IS AN OFFICIAL ESTABLISHMENT CERTIFIED BY THE STATE LIVESTOCK-POULTRY HEALTH COMMISSION OR THE UNITED STATES DEPARTMENT OF AGRICULTURE TO SELL OR UTILIZE CERTAIN DEER PARTS FOR PET FOOD; AND TO AMEND SECTION 50-11-1910(A) TO PERMIT A VENISON PROCESSOR TO SELL CERTAIN DEER PARTS TO BE UTILIZED AS PET FOOD.
l:\s-jud\bills\mcconnell\jud0022.hla.docx
Read the first time and referred to the Committee on Agriculture and Natural Resources.
S. 1024 (Word version) -- Senator O'Dell: A BILL TO AMEND SECTION 12-37-220, AS AMENDED, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO PROPERTY TAX EXEMPTIONS, SO AS TO ALLOW THE SURVIVING SPOUSE OF A DECEDENT WHO WAS ELIGIBLE FOR THE EXEMPTION OF THE DWELLING OWNED BY A PERSON WITH CERTAIN SPECIFIC ILLNESSES CAUSING THE SAME AMBULATORY DIFFICULTIES AS PERSONS WITH PARAPARESIS OR HEMIPARESIS.
l:\council\bills\bbm\9495htc10.docx
Read the first time and referred to the Committee on Finance.
S. 1025 (Word version) -- Senator Cromer: A BILL TO AMEND SECTION 38-73-737 OF THE 1976 CODE, RELATING TO DRIVER TRAINING COURSE CREDIT TOWARD LIABILITY AND COLLISION INSURANCE COVERAGE, TO REDUCE THE INITIAL COURSE FROM EIGHT TO SIX HOURS, TO ALLOW FOR A FOUR HOUR REFRESHER COURSE EVERY THREE YEARS, AND TO ALLOW THE DEPARTMENT OF INSURANCE TO PROMULGATE REGULATIONS FOR FIFTY-FIVE YEARS AND OLDER DRIVER SAFETY INTERNET COURSES.
l:\s-res\rwc\012driv.ebd.rwc.docx
Read the first time and referred to the Committee on Banking and Insurance.
S. 1026 (Word version) -- Senator Verdin: A BILL TO AMEND SECTION 50-13-1630 OF THE 1976 CODE, RELATING TO THE UNLAWFUL ACT OF IMPORTING, POSSESSING, AND SELLING OF CERTAIN FISH, TO PROVIDE THAT THE DEPARTMENT OF NATURAL RESOURCES MAY NOT PERFORM SUBSEQUENT STERILITY TESTS ON WHITE AMUR OR GRASS CARP HYBRIDS THAT HAVE BEEN DETERMINED TO BE STERILE, TO PROVIDE THAT THE CERTIFIED RESULTS OF STERILITY TESTS PERFORMED BY THE UNITED STATES FISH AND WILDLIFE SERVICE ON WHITE AMUR OR GRASS CARP HYBRIDS ARE CONCLUSIVE.
l:\s-res\dbv\013whit.kmm.dbv.docx
Read the first time and referred to the Committee on Fish, Game and Forestry.
S. 1027 (Word version) -- Senator McGill: A BILL TO AMEND CHAPTER 11, TITLE 50 OF THE 1976 CODE, BY ADDING SECTION 50-11-770 TO ENACT THE "RENEGADE HUNTER ACT", TO PROHIBIT USING DOGS TO HUNT ON PROPERTY WITHOUT PERMISSION OF THE LANDOWNER, AND TO PROVIDE APPROPRIATE PENALTIES.
l:\s-res\jym\005dogh.kmm.jym.docx
Read the first time and referred to the Committee on Fish, Game and Forestry.
S. 1028 (Word version) -- Senator Leventis: A BILL TO AMEND SECTION 32-8-320, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO PERSONS WHO MAY SERVE AS A DECEDENT'S AGENT TO AUTHORIZE CREMATION, SO AS TO ALSO PERMIT A PERSON NAMED IN THE DECEDENT'S DD FORM 93 TO AUTHORIZE CREMATION IF THE DECEDENT SERVED IN THE MILITARY SERVICES IF THERE IS NO SUCH DESIGNATION IN THE WILL OR OTHER VERIFIED AND ATTESTED DOCUMENT OF THE DECEDENT.
l:\council\bills\bbm\9474sd10.docx
Read the first time and referred to the Committee on Judiciary.
S. 1029 (Word version) -- Senator Massey: A BILL TO AMEND SECTION 61-4-520, AS AMENDED, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO REQUIREMENTS FOR PERMITS FOR THE SALE OF BEER OR WINE, AND SECTION 61-6-110, RELATING TO REQUIREMENTS FOR LICENSES FOR THE SALE OF ALCOHOLIC LIQUORS; BOTH SO AS TO REQUIRE THAT NO PERMIT OR LICENSE MAY BE ISSUED UNLESS THE APPLICANT PROVIDES WRITTEN VERIFICATION OF LIABILITY INSURANCE COVERAGE.
l:\s-jud\bills\massey\jud0024.pl.docx
Read the first time and referred to the Committee on Judiciary.
S. 1030 (Word version) -- Senators Hayes, Mulvaney and Coleman: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING SECTION 1-1-714 SO AS TO DESIGNATE THE MARSH TACKY AS THE OFFICIAL STATE HERITAGE HORSE OF SOUTH CAROLINA.
l:\council\bills\nbd\20798sd10.docx
Read the first time and referred to the Committee on Judiciary.
S. 1031 (Word version) -- Senators Hayes, Reese, O'Dell, Anderson, Jackson, Rose, Coleman, Nicholson, Ford, McGill, Elliott, Bright, Campbell, Massey and Matthews: A BILL TO AMEND SECTION 40-45-110, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING, AMONG OTHER THINGS, TO LICENSURE OF PHYSICAL THERAPISTS AND GROUNDS FOR SANCTIONS AGAINST LICENSEES, SO AS TO REVISE THE PROHIBITION AGAINST A LICENSEE WHO IS INVOLVED IN THE DIVIDING, TRANSFERRING, ASSIGNING, REBATING, OR REFUNDING OF FEES RECEIVED FOR PROFESSIONAL SERVICES BY CERTAIN MEANS BY DELETING THE REFERENCE TO "WAGES", AS A MEANS OF ENGAGING IN THE PROHIBITED CONDUCT, AND TO FURTHER SPECIFY ARRANGEMENTS THAT MAY EXIST BETWEEN A PHYSICAL THERAPIST AND A PHYSICIAN WHICH MAY NOT BE CONSIDERED CONDUCT SUBJECT TO SANCTIONS BY THE BOARD OF PHYSICAL THERAPY EXAMINERS.
l:\council\bills\nbd\11226ac09.docx
Read the first time and referred to the Committee on Medical Affairs.
S. 1032 (Word version) -- Senator Cromer: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING ARTICLE 108 TO CHAPTER 3, TITLE 56, SO AS TO PROVIDE THAT THE DEPARTMENT OF MOTOR VEHICLES MAY ISSUE SOUTH CAROLINA HIGHWAY PATROL-RETIRED LICENSE PLATES.
l:\s-res\rwc\013patr.ebd.rwc.docx
Read the first time and referred to the Committee on Transportation.
S. 1033 (Word version) -- Senators Campsen, Mulvaney, Hutto, Grooms, Bryant, Campbell, Hayes, Setzler, Rose, Courson, Verdin and Land: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING ARTICLE 108 TO CHAPTER 3, TITLE 56, SO AS TO PROVIDE THAT THE DEPARTMENT OF MOTOR VEHICLES MAY ISSUE A SPECIAL LICENSE PLATE FOR PERSONS WHO HAVE BEEN AWARDED THE EAGLE SCOUT AWARD BY THE BOY SCOUTS OF AMERICA, TO PROVIDE FOR PROOF OF ELIGIBILITY, AND TO PROVIDE FOR DISTRIBUTION OF FEES COLLECTED.
l:\s-res\gec\051eagl.ebd.gec.docx
Read the first time and referred to the Committee on Transportation.
S. 1034 (Word version) -- Senator Leatherman: A JOINT RESOLUTION TO EXTEND THE DATE BY WHICH THE TAXATION REALIGNMENT COMMISSION MUST PREPARE AND DELIVER ITS REPORT AND RECOMMENDATION UNTIL NOVEMBER 15, 2010.
l:\s-financ\drafting\hkl\016trac.dag.hkl.docx
Senators LEATHERMAN and SETZLER spoke on the Resolution.
Read the first time and referred to the Committee on Finance.
S. 1035 (Word version) -- Senator Elliott: A JOINT RESOLUTION PROPOSING AN AMENDMENT TO SECTION 12, ARTICLE IV OF THE CONSTITUTION OF SOUTH CAROLINA, 1895, RELATING TO DISABILITY OF THE GOVERNOR, SO AS TO PROVIDE THAT IF THE GOVERNOR IS PHYSICALLY ABSENT FROM THE STATE FOR A PERIOD OF TWENTY-FOUR HOURS OR MORE, HE SHALL NOTIFY THE LIEUTENANT GOVERNOR OF HIS ABSENCE AS SOON AS POSSIBLE BUT NOT LATER THAN TWENTY-FOUR HOURS AFTER THE ABSENCE HAS BEGUN, AND THE LIEUTENANT GOVERNOR SHALL AT THAT TIME BECOME ACTING GOVERNOR FOR THE DURATION OF THE ABSENCE, AND TO PROVIDE THAT IF THE ABSENCE OCCURS FOR A PERIOD OF THIRTY DAYS OR MORE, THE GENERAL ASSEMBLY SHALL DETERMINE WHETHER OR NOT THE GOVERNOR SHALL RESUME THE POWERS AND DUTIES OF HIS OFFICE OR WHETHER THE LIEUTENANT GOVERNOR SHALL CONTINUE TO DISCHARGE THESE POWERS AND DUTIES AS ACTING GOVERNOR.
l:\council\bills\nbd\20793sd10.docx
Read the first time and referred to the Committee on Judiciary.
S. 1036 (Word version) -- Senators Hayes, Coleman and Mulvaney: A CONCURRENT RESOLUTION TO REQUEST THAT THE DEPARTMENT OF TRANSPORTATION NAME THE PORTION OF SOUTH CAROLINA HIGHWAY 121 IN YORK COUNTY FROM ITS INTERSECTION WITH SOUTH CAROLINA HIGHWAY 901 TO ITS INTERSECTION WITH SOUTH CAROLINA HIGHWAY 5 "FRANK BOBO MEMORIAL HIGHWAY" AND ERECT APPROPRIATE MARKERS OR SIGNS ALONG THIS PORTION OF HIGHWAY THAT CONTAIN THE WORDS "FRANK BOBO MEMORIAL HIGHWAY".
l:\council\bills\swb\5973cm10.docx
The Concurrent Resolution was introduced and referred to the Committee on Transportation.
S. 1037 (Word version) -- Senators McConnell, Knotts and Nicholson: A CONCURRENT RESOLUTION TO FIX NOON ON WEDNESDAY, FEBRUARY 3, 2010, AS THE TIME TO ELECT A SUCCESSOR TO A CERTAIN JUSTICE OF THE SUPREME COURT, SEAT 5, WHOSE TERM EXPIRES JULY 31, 2010; TO ELECT A SUCCESSOR TO A CERTAIN CHIEF JUDGE OF THE COURT OF APPEALS, SEAT 5, TO FILL THE UNEXPIRED TERM THAT EXPIRES JUNE 30, 2015; TO ELECT A SUCCESSOR TO A CERTAIN JUDGE OF THE CIRCUIT COURT FOR THE FIRST JUDICIAL CIRCUIT, SEAT 2, WHOSE TERM EXPIRES JUNE 30, 2010; TO ELECT A SUCCESSOR TO A CERTAIN JUDGE OF THE CIRCUIT COURT FOR THE SECOND JUDICIAL CIRCUIT, SEAT 1, WHOSE TERM EXPIRES JUNE 30, 2010; TO ELECT A SUCCESSOR TO A CERTAIN JUDGE OF THE CIRCUIT COURT FOR THE THIRD JUDICIAL CIRCUIT, SEAT 1, WHOSE TERM EXPIRES JUNE 30, 2010; TO ELECT A SUCCESSOR TO A CERTAIN JUDGE OF THE CIRCUIT COURT FOR THE FOURTH JUDICIAL CIRCUIT, SEAT 1, WHOSE TERM EXPIRES JUNE 30, 2010; TO ELECT A SUCCESSOR TO A CERTAIN JUDGE OF THE CIRCUIT COURT FOR THE SIXTH JUDICIAL CIRCUIT, SEAT 1, WHOSE TERM EXPIRES JUNE 30, 2010; TO ELECT A SUCCESSOR TO A CERTAIN JUDGE OF THE CIRCUIT COURT FOR THE EIGHTH JUDICIAL CIRCUIT, SEAT 1, WHOSE TERM EXPIRES JUNE 30, 2010, TO FILL THE SUBSEQUENT FULL TERM THAT EXPIRES JUNE 30, 2016; TO ELECT A SUCCESSOR TO A CERTAIN JUDGE OF THE CIRCUIT COURT FOR THE THIRTEENTH JUDICIAL CIRCUIT, SEAT 1, WHOSE TERM EXPIRES JUNE 30, 2010; TO ELECT A SUCCESSOR TO A CERTAIN JUDGE OF THE CIRCUIT COURT FOR THE THIRTEENTH JUDICIAL CIRCUIT, SEAT 4, WHOSE TERM EXPIRES JUNE 30, 2010; TO ELECT A SUCCESSOR TO A CERTAIN JUDGE OF THE CIRCUIT COURT FOR THE FIFTEENTH JUDICIAL CIRCUIT, SEAT 1, WHOSE TERM EXPIRES JUNE 30, 2010; TO ELECT A SUCCESSOR TO A CERTAIN JUDGE OF THE CIRCUIT COURT FOR THE SIXTEENTH JUDICIAL CIRCUIT, SEAT 1, WHOSE TERM EXPIRES JUNE 30, 2010; TO ELECT A SUCCESSOR TO A CERTAIN JUDGE OF THE CIRCUIT COURT FOR THE SIXTEENTH JUDICIAL CIRCUIT, SEAT 2, WHOSE TERM EXPIRES JUNE 30, 2010; TO ELECT A SUCCESSOR TO A CERTAIN JUDGE OF THE CIRCUIT COURT, AT-LARGE, SEAT 8, TO FILL THE SUBSEQUENT FULL TERM THAT EXPIRES JUNE 30, 2015; TO ELECT A SUCCESSOR TO A CERTAIN JUDGE OF THE FAMILY COURT FOR THE FIRST JUDICIAL CIRCUIT, SEAT 2, WHOSE TERM EXPIRES JUNE 30, 2010; TO ELECT A SUCCESSOR TO A CERTAIN JUDGE OF THE FAMILY COURT FOR THE FIRST JUDICIAL CIRCUIT, SEAT 3, WHOSE TERM EXPIRES JUNE 30, 2010; TO ELECT A SUCCESSOR TO A CERTAIN JUDGE OF THE FAMILY COURT FOR THE SECOND JUDICIAL CIRCUIT, SEAT 1, TO FILL THE SUBSEQUENT FULL TERM THAT EXPIRES JUNE 30, 2016; TO ELECT A SUCCESSOR TO A CERTAIN JUDGE OF THE FAMILY COURT FOR THE THIRD JUDICIAL CIRCUIT, SEAT 1, WHOSE TERM EXPIRES JUNE 30, 2010; TO ELECT A SUCCESSOR TO A CERTAIN JUDGE OF THE FAMILY COURT FOR THE FOURTH JUDICIAL CIRCUIT, SEAT 1, WHOSE TERM EXPIRES JUNE 30, 2010; TO ELECT A SUCCESSOR TO A CERTAIN JUDGE OF THE FAMILY COURT FOR THE FIFTH JUDICIAL CIRCUIT, SEAT 1, WHOSE TERM EXPIRES JUNE 30, 2010; TO ELECT A SUCCESSOR TO A CERTAIN JUDGE OF THE FAMILY COURT FOR THE FIFTH JUDICIAL CIRCUIT, SEAT 4, TO FILL THIS SUBSEQUENT FULL TERM THAT EXPIRES JUNE 30, 2016; TO ELECT A SUCCESSOR TO A CERTAIN JUDGE OF THE FAMILY COURT FOR THE SEVENTH JUDICIAL CIRCUIT, SEAT 1, TO FILL THE SUBSEQUENT FULL TERM THAT EXPIRES JUNE 30, 2013; TO ELECT A SUCCESSOR TO A CERTAIN JUDGE OF THE FAMILY COURT FOR THE SEVENTH JUDICIAL CIRCUIT, SEAT 3, TO FILL THE SUBSEQUENT FULL TERM THAT EXPIRES JUNE 30, 2016; TO ELECT A SUCCESSOR TO A CERTAIN JUDGE OF THE FAMILY COURT FOR THE EIGHTH JUDICIAL CIRCUIT, SEAT 2, WHOSE TERM EXPIRES JUNE 30, 2010; TO ELECT A SUCCESSOR TO A CERTAIN JUDGE OF THE FAMILY COURT FOR THE NINTH JUDICIAL CIRCUIT, SEAT 3, WHOSE TERM EXPIRES JUNE 30, 2010; TO ELECT A SUCCESSOR TO A CERTAIN JUDGE OF THE FAMILY COURT FOR THE NINTH JUDICIAL CIRCUIT, SEAT 6, WHOSE TERM EXPIRES JUNE 30, 2010; TO ELECT A SUCCESSOR TO A CERTAIN JUDGE OF THE FAMILY COURT FOR THE TENTH JUDICIAL CIRCUIT SEAT 2, WHOSE TERM EXPIRES JUNE 30, 2010; TO ELECT A SUCCESSOR TO A CERTAIN JUDGE OF THE FAMILY COURT FOR THE ELEVENTH JUDICIAL CIRCUIT, SEAT 1, WHOSE TERM EXPIRES JUNE 30, 2010; TO ELECT A SUCCESSOR TO A CERTAIN JUDGE OF THE FAMILY COURT FOR THE TWELFTH JUDICIAL CIRCUIT, SEAT 3, WHOSE TERM EXPIRES JUNE 30, 2010; TO ELECT A SUCCESSOR OF A CERTAIN JUDGE OF THE FAMILY COURT FOR THE THIRTEENTH JUDICIAL CIRCUIT, SEAT 2, TO FILL THE UNEXPIRED TERM THAT EXPIRES JUNE 30, 2013; TO ELECT A SUCCESSOR TO A CERTAIN JUDGE OF THE FAMILY COURT FOR THE THIRTEENTH JUDICIAL CIRCUIT, SEAT 4, WHOSE TERM EXPIRES JUNE 30, 2010; TO ELECT A SUCCESSOR TO A CERTAIN JUDGE OF THE FAMILY COURT FOR THE FOURTEENTH JUDICIAL CIRCUIT, SEAT 2, WHOSE TERM EXPIRES JUNE 30, 2010; TO ELECT A SUCCESSOR TO A CERTAIN JUDGE OF THE FAMILY COURT FOR THE FIFTEENTH JUDICIAL CIRCUIT, SEAT 2, WHOSE TERM EXPIRES JUNE 30, 2010; TO ELECT A SUCCESSOR TO A CERTAIN JUDGE OF THE FAMILY COURT FOR THE SIXTEENTH JUDICIAL CIRCUIT, SEAT 1, WHOSE TERM EXPIRES JUNE 30, 2010; TO ELECT A SUCCESSOR TO THE FAMILY COURT FOR THE SIXTEENTH JUDICIAL CIRCUIT, SEAT 2, TO FILL THE UNEXPIRED TERM THAT EXPIRES JUNE 30, 2013; TO ELECT A SUCCESSOR TO A CERTAIN JUDGE OF THE ADMINISTRATIVE LAW COURT, SEAT 3, WHOSE TERM EXPIRES JUNE 30, 2010; TO ELECT A SUCCESSOR TO A CERTAIN JUDGE OF THE ADMINISTRATIVE LAW COURT, SEAT 6, TO FILL THE UNEXPIRED TERM WHICH EXPIRES JUNE 30, 2011, AND THE SUBSEQUENT FULL TERM THAT EXPIRES JUNE 30, 2016.
l:\s-jud\bills\mcconnell\jud0021.js.docx
Senators McCONNELL and CAMPSEN spoke on the Resolution.
On motion of Senator McCONNELL, with unanimous consent, the Concurrent Resolution was introduced and ordered placed on the Calendar without reference.
S. 1038 (Word version) -- Senator Knotts: A CONCURRENT RESOLUTION TO INVITE THE NATIONAL COMMANDER OF THE AMERICAN LEGION, THE HONORABLE CLARENCE HILL, TO ADDRESS THE GENERAL ASSEMBLY IN JOINT SESSION IN THE CHAMBER OF THE SOUTH CAROLINA HOUSE OF REPRESENTATIVES AT 12:30 P.M. ON TUESDAY, FEBRUARY 23, 2010.
l:\council\bills\bbm\9476sd10.docx
The Concurrent Resolution was introduced and referred to the Committee on Invitations.
S. 1039 (Word version) -- Senator Knotts: A CONCURRENT RESOLUTION TO PROVIDE THAT THE PORTION OF INTERSTATE HIGHWAY 20 BEGINNING AT ITS INTERSECTION WITH INTERSTATE HIGHWAY 95 IN FLORENCE COUNTY AND EXTENDING WESTWARD TO THE SOUTH CAROLINA-GEORGIA BORDER IS DESIGNATED AS THE "HIGHWAY OF HEROES" AS A MEANS OF HONORING VETERANS OF THE WAR ON TERRORISM WHO HAVE DIED IN COMBAT ACTIONS, TO REQUEST THE DEPARTMENT OF TRANSPORTATION TO ERECT APPROPRIATE MARKERS OR SIGNS TO INDICATE THIS DESIGNATION, AND TO REQUEST THE GOVERNOR OF THIS STATE TO ISSUE A PROCLAMATION COMMEMORATING THE "HIGHWAY OF HEROES" AND DIRECTING THE ASSISTANCE OF THE DEPARTMENT OF VETERANS AFFAIRS, THE DEPARTMENT OF TRANSPORTATION, AND OTHER STATE AGENCIES AS MAY BE IN ORDER TO PROVIDE ASSISTANCE IN THE ESTABLISHMENT OF THE HIGHWAY.
l:\council\bills\bbm\9475sd10.docx
The Concurrent Resolution was introduced and referred to the Committee on Transportation.
S. 1040 (Word version) -- Senator Rose: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING SECTION 16-19-45 SO AS TO PROVIDE THAT "TEXAS HOLD 'EM" OR ANOTHER POKER CARD GAME OF SKILL AND JUDGMENT MAY BE PLAYED WITH PLAYING CARDS WITHIN ANY FACILITY LOCATED ON A FEDERAL MILITARY INSTALLATION IN THIS STATE AS PERMITTED BY THE BASE COMMANDER CONSISTENT WITH APPLICABLE MILITARY REGULATIONS IF NOT PROHIBITED BY FEDERAL LAW.
l:\council\bills\bbm\9484sd10.docx
Senator ROSE spoke on the Bill.
Read the first time and referred to the Committee on Judiciary.
S. 1041 (Word version) -- Senators Knotts, Alexander, Anderson, Bright, Bryant, Campbell, Campsen, Cleary, Coleman, Courson, Cromer, Davis, Elliott, Fair, Ford, Grooms, Hayes, Hutto, Jackson, Land, Leatherman, Leventis, Lourie, Malloy, L. Martin, S. Martin, Massey, Matthews, McConnell, McGill, Mulvaney, Nicholson, O'Dell, Peeler, Pinckney, Rankin, Reese, Rose, Ryberg, Scott, Setzler, Sheheen, Shoopman, Thomas, Verdin and Williams: A SENATE RESOLUTION TO COMMEND THE LEXINGTON COUNTY SHERIFF'S DEPARTMENT TRAFFIC DIVISION AND K-9 UNIT; THE SOUTH CAROLINA HIGHWAY PATROL, TROOP 1-POST C, LEXINGTON COUNTY; SOUTH CAROLINA LAW ENFORCEMENT NETWORK 11TH CIRCUIT-2009; AND ALL THE OTHER LAW ENFORCEMENT AGENCIES UNDER THE COORDINATED OVERSIGHT OF DIRECTOR MARK KEEL OF THE SOUTH CAROLINA DEPARTMENT OF PUBLIC SAFETY FOR THEIR SUCCESSFUL EFFORT TO DECREASE THE NUMBER OF ALCOHOL-RELATED TRAFFIC FATALITIES IN LEXINGTON COUNTY FOR 2009.
l:\council\bills\ms\7480ahb10.docx
Senators KNOTTS and SETZLER spoke on the Resolution and commended and thanked the members of the Lexington County Sheriff's Department of Traffic Division and K-9 unit, as well as, the S. C. Law Enforcement community for their dedicated service in helping to reduce the number of alcohol related traffic injuries and fatalities.
H. 3603 (Word version) -- Reps. Gullick and M. A. Pitts: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING SECTION 48-1-65 SO AS TO PROVIDE A PERSON WHO POLLUTES THE WATERS OF THIS STATE AS DEFINED BY THE DEPARTMENT OF HEALTH AND ENVIRONMENTAL CONTROL SHALL GIVE PUBLIC-NOTICE OF THE POLLUTION IN A MANNER PRESCRIBED BY THE DEPARTMENT; TO PROVIDE THE BOARD OF THE DEPARTMENT SHALL PRESCRIBE THIS PUBLIC-NOTICE PROCEDURE; TO PROVIDE CERTAIN SPECIFICATIONS THE BOARD MUST INCLUDE IN THIS PUBLIC NOTICE PROCEDURE; AND TO PROVIDE A VIOLATION IS A MISDEMEANOR SUBJECT TO A FINE, IMPRISONMENT, OR BOTH.
Read the first time and referred to the Committee on Medical Affairs.
H. 4005 (Word version) -- Reps. Sellers, Bingham, Ott, A. D. Young and Bales: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING SECTION 8-13-1335 SO AS TO MAKE IT UNLAWFUL FOR AN INDIVIDUAL SEEKING ELECTION TO MEMBERSHIP ON THE GOVERNING BOARD OF A PUBLIC INSTITUTION OF HIGHER LEARNING FILLED BY A VOTE OF THE GENERAL ASSEMBLY TO MAKE OR OFFER TO MAKE A CONTRIBUTION TO A CANDIDATE FOR THE GENERAL ASSEMBLY OR HOST OR SPONSOR ANY FUNDRAISING EVENT FOR SUCH A CANDIDATE FROM THE TIME THE INDIVIDUAL FILES THE NOTICE OF INTENTION TO SEEK MEMBERSHIP ON THE BOARD THROUGH THE DATE THE OFFICE IS FILLED.
Read the first time and referred to the Committee on Judiciary.
H. 4022 (Word version) -- Reps. E. H. Pitts, G. M. Smith, G. R. Smith, Millwood, Hamilton, Nanney, Bedingfield, Duncan, M. A. Pitts, Simrill, V. S. Moss, Gambrell, Rice, Owens, Vick and Viers: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING ARTICLE 9 TO CHAPTER 31, TITLE 23 SO AS TO ENACT THE "SOUTH CAROLINA FIREARMS FREEDOM ACT", TO PROVIDE THAT A FIREARM, FIREARM ACCESSORY, OR AMMUNITION MANUFACTURED AND RETAINED IN SOUTH CAROLINA IS EXEMPT FROM FEDERAL REGULATION UNDER THE COMMERCE CLAUSE OF THE CONSTITUTION OF THE UNITED STATES.
Read the first time and referred to the Committee on Judiciary.
H. 4053 (Word version) -- Reps. Edge, Hardwick, Hearn and Barfield: A CONCURRENT RESOLUTION TO DESIGNATE AND PROVIDE THAT COASTAL CAROLINA UNIVERSITY SHALL BE THE HOME OF THE BEACH MUSIC HALL OF FAME.
The Concurrent Resolution was introduced and referred to the Committee on Education.
H. 4054 (Word version) -- Rep. Edge: A CONCURRENT RESOLUTION TO URGE THE UNITED STATES DEPARTMENT OF HEALTH AND HUMAN SERVICES TO EDUCATE PARENTS ON THE IMPORTANCE OF ADOLESCENT WELL PHYSICALS TO PREVENT CHRONIC DISEASES, APPROPRIATELY INTERVENE TO BETTER TREAT CHRONIC DISEASE, AND UPDATE IMMUNIZATIONS FOR ADOLESCENTS OF THIS STATE AND NATION.
The Concurrent Resolution was introduced and referred to the Committee on Medical Affairs.
H. 4078 (Word version) -- Reps. Clyburn, T. R. Young and J. R. Smith: A CONCURRENT RESOLUTION TO REQUEST THAT THE DEPARTMENT OF TRANSPORTATION NAME A PORTION OF UNITED STATES HIGHWAY 19 THAT RUNS THROUGH THE CITY OF AIKEN "DR. MARTIN LUTHER KING, JR. MEMORIAL HIGHWAY" AND ERECT APPROPRIATE MARKERS OR SIGNS ALONG THIS PORTION OF HIGHWAY THAT CONTAIN THE WORDS "DR. MARTIN LUTHER KING, JR. MEMORIAL HIGHWAY".
On motion of Senator MASSEY, with unanimous consent, the Concurrent Resolution was introduced and ordered placed on the Calendar without reference.
H. 4082 (Word version) -- Reps. Bales, J. H. Neal, Ballentine, Brady, Gunn, Harrison, Hart, Howard, McEachern, Rutherford and J. E. Smith: A CONCURRENT RESOLUTION TO ENCOURAGE THE RICHLAND COUNTY COUNCIL BY ORDINANCE TO POSTPONE FOR ONE ADDITIONAL YEAR A COUNTYWIDE PROPERTY TAX EQUALIZATION AND REASSESSMENT PROGRAM OTHERWISE SCHEDULED FOR IMPLEMENTATION BEGINNING FOR PROPERTY TAX YEAR 2009.
The Concurrent Resolution was introduced and referred to the Richland Delegation.
REPORTS OF STANDING COMMITTEES
On motion of Senator KNOTTS with unanimous consent, the following invitation was unanimously polled from the Committee on Invitations with a favorable report and ordered placed on the Calendar:
The following polling sheet represents each invitation that was polled from the Committee:
Poll of the Invitations Committee
Polled 11; Ayes 11; Nays 0; Not Voting 0
AYES
Knotts Alexander McGill Reese O'Dell Elliott Ford Verdin Campsen Cromer Malloy
Total-- 11
NAYS
Total-- 0
Tuesday, January 12, 2010 - 6:00 p.m. -7:30 p.m.
Members of the Senate, Reception, Columbia Marriott Hotel, by the SC BANKERS ASSOCIATION
Wednesday, January 13, 2010 - 8:00 a.m. - 10:00 a.m.
Members of the Senate and Staff, Breakfast, Room 112 of the Blatt Building, by the SC CHILDREN'S HOSPITAL COLLABORATIVE
Wednesday, January 13, 2010 - 12:00 p.m. - 2:00 p.m.
Members of the Senate and Staff, Luncheon, Room 112 of the Blatt Building, by the SC REALTORS ASSOCIATION
Thursday, January 14, 2010 - 8:00 a.m. - 10:00 a.m.
Members of the Senate, Breakfast, Room 112 of the Blatt Building, by the SC BROADCASTERS ASSOCIATION
Tuesday, January 19, 2010 - 6:00 p.m. - 8:00 p.m.
Members of the Senate and Staff, Reception, Columbia Museum of Art, by the SC TELECOMMUNICATIONS ASSOCIATION
Tuesday, January 19, 2010 - 6:00 p.m. - 8:00 p.m.
Members of the Senate, Reception, Clarion Town House Hotel, by the AMERICAN COUNCIL OF ENGINEERING COMPANIES OF SC, SC SOCIETY OF PROFESSIONAL ENGINEERS AND AMERICAN SOCIETY OF CIVIL ENGINEERING, SC SECTION
Wednesday, January 20, 2010 - 8:00 a.m. - 10:00 a.m.
Members of the Senate and Staff, Breakfast, Room 112 of the Blatt Building, by the SC HIGH SCHOOL LEAGUE
Wednesday, January 20, 2010 - 12:00 p.m. - 2:00 p.m.
Members of the Senate, Luncheon, Room 112 of the Blatt Building, by the SC CONSORTIUM FOR GIFTED EDUCATION
Thursday, January 21, 2010 - 8:00 a.m. - 10:00 a.m.
Members of the Senate and Staff, Breakfast, Room 112 of the Blatt Building, by the FOUNDATION FOR THE SC COMMISSION FOR THE BLIND
Tuesday, January 26, 2010 - 6:00 p.m. - 8:00 p.m.
Members of the Senate and Staff, Reception, Clarion Town House Hotel, by the SC ASSOCIATION OF TECHNICAL COLLEGE COMMISSIONERS
Tuesday, January 26, 2010 - 6:00 p.m. - 8:00 p.m.
Members of the Senate and Staff, Reception, Palmetto Club, by the SC ECONOMIC DEVELOPERS' ASSOCIATION
Wednesday, January 27, 2010 - 8:00 a.m. - 10:00 a.m.
Members of the Senate and Staff, Breakfast, Room 112 of the Blatt Building, by the SC ASSOCIATION OF NURSE ANESTHETISTS
Wednesday, January 27, 2010 - 12:00 - 2:00 p.m.
Members of the Senate, Luncheon, State House Grounds, by the SC BAPTIST ASSOCIATION
Wednesday, January 27, 2010 - 6:00 p.m. - 8:00 p.m.
Members of the Senate and Staff, Oyster Roast and Frogmore Stew, Clarion Hotel, by the CLARION HOTEL
Wednesday, January 27, 2010 - 6:00 p.m. - 8:00 p.m.
Members of the Senate, Reception, Columbia Marriott Hotel, by the SC CHAMBER OF COMMERCE
Thursday - January 28, 2010 - 8:00 a.m. - 9:00 a.m.
Members of the Senate, Breakfast, Room 112 of the Blatt Building, by the SC ASSOCIATION OF CHRISTIAN SCHOOLS FOR EXCELLENCE, INC.
Message from the House
Columbia, S.C., October 27, 2009
Mr. President and Senators:
The House respectfully informs your Honorable Body that it has appointed Reps. Ott and Cooper in lieu of Reps. Kirsh and White to the Committee of Conference on the part of the House on:
Very respectfully,
Speaker of the House
THE SENATE PROCEEDED TO A CALL OF THE UNCONTESTED LOCAL AND STATEWIDE CALENDAR.
There were no Bills on the Calendar that were uncontested.
THE SENATE PROCEEDED TO THE MOTION PERIOD.
Senator McCONNELL asked unanimous consent to make a motion that, when the Senate adjourns today, it stand adjourned to meet tomorrow at 1:00 P.M.
There was no objection.
On motion of Senator McCONNELL, the Senate agreed to dispense with the Motion Period.
HAVING DISPENSED WITH THE MOTION PERIOD, THE SENATE PROCEEDED TO A CONSIDERATION OF BILLS AND RESOLUTIONS RETURNED FROM THE HOUSE.
CARRIED OVER
S. 202 (Word version) -- Senator Thomas: A BILL TO AMEND SECTION 38-1-20, AS AMENDED, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO DEFINITIONS USED IN TITLE 38 RELATING TO THE DEPARTMENT OF INSURANCE, SO AS TO AMEND THE DEFINITION OF "ADMITTED ASSETS" TO INCLUDE THOSE ON THE INSURER'S MOST RECENT STATUTORY FINANCIAL STATEMENT FILED WITH THE DEPARTMENT OF INSURANCE PURSUANT TO THE PROVISIONS OF SECTION 38-13-80 INSTEAD OF THOSE ADMITTED UNDER THE PROVISIONS OF SECTION 38-11-100; TO AMEND SECTION 38-9-10, RELATING TO CAPITAL AND SURPLUS REQUIRED OF STOCK INSURERS, SO AS TO CHANGE THE MARKETABLE SECURITIES THAT MAY BE REQUIRED BY THE DIRECTOR OF INSURANCE; TO AMEND SECTION 38-9-20, RELATING TO THE SURPLUS REQUIRED OF MUTUAL INSURERS, SO AS TO CHANGE THE MARKETABLE SECURITIES WHICH MAY BE REQUIRED BY THE DIRECTOR OF INSURANCE; TO AMEND SECTION 38-9-210, RELATING TO THE REDUCTION FROM LIABILITY FOR THE REINSURANCE CEDED BY A DOMESTIC INSURER, SO AS TO CHANGE THE SECURITIES LISTED THAT QUALIFY AS SECURITY; TO AMEND SECTION 38-10-40, RELATING TO THE PROTECTED CELL ASSETS OF A PROTECTED CELL, SO AS TO CHANGE A CODE REFERENCE; TO AMEND SECTION 38-33-130, RELATING TO THE SECURITY DEPOSIT OF A HEALTH MAINTENANCE ORGANIZATION, SO AS TO DELETE THE REQUIREMENT THAT A HEALTH MAINTENANCE ORGANIZATION SHALL ISSUE A CONVERSION POLICY TO AN ENROLLEE UPON THE TERMINATION OF THE ORGANIZATION; AND TO AMEND SECTION 38-55-80, RELATING TO LOANS TO DIRECTORS OR OFFICERS BY AN INSURER, SO AS TO CHANGE A CODE REFERENCE.
On motion of Senator HAYES, the Bill was carried over.
THE SENATE PROCEEDED TO THE SPECIAL ORDERS.
AMENDMENT PROPOSED, DEBATE INTERRUPTED
S. 424 (Word version) -- Senators Bright, S. Martin, Alexander, Campbell, Fair, Knotts, Cromer, Mulvaney, Verdin, L. Martin, Shoopman, Rose, McConnell, Thomas, Cleary, Courson, Coleman, Davis, Reese, Campsen, Grooms, Ryberg, Peeler, O'Dell, Bryant and Massey: A CONCURRENT RESOLUTION TO AFFIRM SOUTH CAROLINA'S SOVEREIGNTY UNDER THE TENTH AMENDMENT TO THE UNITED STATES CONSTITUTION OVER ALL POWERS NOT ENUMERATED AND GRANTED TO THE FEDERAL GOVERNMENT BY THE UNITED STATES CONSTITUTION.
The Senate proceeded to a consideration of the Concurrent Resolution, the question being the adoption of the Concurrent Resolution.
Amendment No. 11A
Senators BRIGHT, ROSE, MULVANEY, McCONNELL, SHOOPMAN, L. MARTIN, COURSON, CAMPBELL, O'DELL, GROOMS, DAVIS, FAIR, S. MARTIN, PEELER, CROMER, ALEXANDER, MASSEY, VERDIN, BRYANT, HAYES, RYBERG, CLEARY, RANKIN AND CAMPSEN proposed the following Amendment No. 11A (424R018.MTR):
Amend the concurrent resolution, as and if amended, by striking the Concurrent Resolution in its entirety and inserting:
/ A CONCURRENT RESOLUTION
TO AFFIRM THE RIGHTS OF SOUTH CAROLINA
BASED ON THE PROVISIONS OF THE NINTH AND TENTH AMENDMENTS
TO THE UNITED STATES CONSTITUTION
Whereas, the United States Constitution and the Bill of Rights established a federal government limited in scope and guarantee of personal liberty so that our citizens will be free to pursue their inalienable rights of life, liberty, and the pursuit of happiness as recognized in the Declaration of Independence; and
Whereas, the Ninth Amendment to the United States Constitution provides that "The enumeration in the Constitution, of certain rights, shall not be construed to deny or disparage others retained by the people"; and
Whereas, pursuant to the Ninth Amendment, the people are guaranteed the right to privacy as a basic human right; and
Whereas, the delivery, administration and receipt of medical care affects personal privacy and involves the most intimate and personal of choices; and
Whereas, the Tenth Amendment to the United States Constitution provides that "The powers not delegated to the United States by the Constitution, nor prohibited by it to the States, are reserved to the States respectively, or to the people"; and
Whereas, the Tenth Amendment defines the limited scope of federal power as being that specifically granted by the United States Constitution; and
Whereas, pursuant to the Tenth Amendment, by limiting the scope of federal power to only those specifically enumerated in the United States Constitution, the states retain plenary power to govern; and
Whereas, despite the clear limitations placed upon it by the United States Constitution, the federal government has steadily expanded its reach into the lives of our citizens and, in so doing, violates the very principles upon which this nation was founded; and
Whereas, the United States Supreme Court has said that states have great latitude in regulating medical care and standards, which have historically and constitutionally been primary state responsibilities and affect areas of core state responsibility, yet Congress and the President are reaching agreement over legislation that will result in the federal government absorbing the regulation of medical care, stripping the states of most responsibility, and taking away the free choice of the citizens of the states; and
Whereas, the federal government has spent trillions of dollars of borrowed money to run deficits, to bail out financial institutions, to prop-up auto makers, and to keep afloat other private enterprises that were mismanaged, took unnecessary risks, or were unresponsive to market demands, thus amassing a debt that will loom over and burden our country for generations to come; and
Whereas, the federal government habitually responds to its annual budget shortfalls by burdening the states with unfunded mandates, shifting costs for programs to the states, limiting state flexibility, and interfering with state revenue systems, undermining the constitutionally created balance between federal and state government; and
Whereas, the United States Supreme Court has ruled that Congress may not simply commandeer the legislative and regulatory processes of the states, and that states may provide their citizens with protections that exceed the protections by the federal government; and
Whereas, the United States Supreme Court has ruled that the United States Constitution allows states to grant rights to their citizens in their state constitutions, beyond rights granted in the federal Constitution; and
Whereas, the United States Supreme Court has recognized that federal law restricting certain rights may be ineffective in denying those rights protected in state Constitutions; and
Whereas, the federal government is considering legislation that may, among other things, obligate residents in South Carolina and other states to purchase health insurance; and
Whereas, the federal government is considering legislation that may, among other things, mandate that this State and other states increase its spending for Medicaid; and
Whereas, it is vitally important for the future of our nation that the states stand against the relentless expansion of the federal government and restore the proper balance to our federal system. Now, therefore,
Be it resolved by the Senate, the House of Representatives concurring:
That the General Assembly of the State of South Carolina, by this resolution, claims for the State of South Carolina sovereignty under the Tenth Amendment to the Constitution of the United States over all powers not otherwise enumerated and granted to the federal government by the United States Constitution.
Be it further resolved that it is the policy of the State of South Carolina that:
No law shall interfere with the right of a person to be treated by or receive services from a health care provider of that person's choice;
No law shall restrict a person's freedom of choice of private health care systems or private health care plans of any type;
No law shall interfere with a person's or an entity's right to pay directly for lawful medical services; and
No law shall impose a tax, penalty, or fine, of any type, for choosing a health care provider, to obtain or decline health care coverage or for participation in any particular health care system or plan.
Be it further resolved that it is the policy of the State of South Carolina that the Attorney General will challenge the constitutionality of any provision enacted by the United States Congress that would violate any of the policies established by this resolution and join with other states that are like-minded to make such a challenge.
Be it further resolved that no state agency, agent, department, instrumentality, or subdivision shall cooperate or participate in any way with any mandate passed by Congress upon notification by the Attorney General that the mandate has been successfully challenged in a court of competent jurisdiction, and further provided that there is not an order to the contrary by a court of competent jurisdiction.
Be it further resolved that copies of this resolution be forwarded to the President of the United States, the Speaker of the United States House of Representatives, the President of the United States Senate, and each member of South Carolina's Congressional Delegation, all at Washington, D.C., and to the Speaker of the House of Representatives and the President of the Senate of the legislatures of the other forty-nine states. /
Renumber sections to conform.
Amend title to conform.
Senator BRIGHT explained the amendment.
Senator ROSE argued in favor of the adoption of the amendment.
Senator LEVENTIS argued contra to the adoption of the amendment.
PRESIDENT Pro Tempore PRESIDES
At 3:13 P.M., Senator McCONNELL assumed the Chair.
Senator LEVENTIS argued contra to the adoption of the amendment.
Senator McGILL asked unanimous consent to make a motion that Senators LAND, L. MARTIN, CAMPSEN, KNOTTS and McGILL be granted leave to attend a Fish, Game and Forestry subcommittee meeting and be granted leave to vote from the balcony.
There was no objection.
Senator LEVENTIS argued contra to the adoption of the amendment.
ACTING PRESIDENT PRESIDES
At 3:43 P.M., Senator L. MARTIN assumed the Chair.
Senator LEVENTIS resumed arguing contra to the adoption of the amendment.
Senator LEVENTIS moved that the Senate stand adjourned.
Recorded Vote
Senator BRIGHT desired to be recorded as voting against the motion to adjourn.
LOCAL APPOINTMENT
Confirmation
Having received a favorable report from the Senate, the following appointment was confirmed in open session:
Initial Appointment, Spartanburg County Magistrate, with term to commence April 30, 2007, and to expire April 30, 2011
Tina G. McMillan, 171 Tucapau Road, Wellford, SC 29385 VICE John Marshall Rollins, Jr.
On motion of Senator PEELER, with unanimous consent, the Senate stood adjourned out of respect to the memory of Marine Lance Cpl. Christopher S. Fowlkes of Gaffney, S.C. Lance Cpl. Fowlkes, 20, assigned to 2nd Light Armored Reconnaissance Battalion, 2nd Marine Division, II Marine Expeditionary Force, Marine Corps Base Camp Lejeune, N.C., died Sept. 10, 2009, from wounds sustained Sept. 3rd while supporting combat operations in Helmand province, Afghanistan.
and
| 2014-04-24T11:25: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": 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.4008428454399109, "perplexity": 6931.527673341401}, "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-15/segments/1398223206120.9/warc/CC-MAIN-20140423032006-00350-ip-10-147-4-33.ec2.internal.warc.gz"}
|
https://www.usgs.gov/publications/national-enhanced-elevation-assessment-glance
|
# National Enhanced Elevation Assessment at a glance
June 27, 2012
Elevation data are essential for hazards mitigation, conservation, infrastructure development, national security, and many other applications. Under the leadership of the U.S. Geological Survey and the member States of the National Digital Elevation Program (NDEP), Federal agencies, State agencies, and others work together to acquire high-quality elevation data for the United States and its territories. New elevation data are acquired using modern technology to replace elevation data that are, on average, more than 30 years old. Through the efforts of the NDEP, a project-by-project data acquisition approach resulted in improved, publicly available data for 28 percent of the conterminous United States and 15 percent of Alaska over the past 15 years. Although the program operates efficiently, the rate of data collection and the typical project specifications are currently insufficient to address the needs of government, the private sector, and other organizations. The National Enhanced Elevation Assessment was conducted to (1) document national-level requirements for improved elevation data, (2) estimate the benefits and costs of meeting those requirements, and (3) evaluate multiple national-level program-implementation scenarios. The assessment was sponsored by the NDEP's member agencies. The study participants came from 34 Federal agencies, agencies from all 50 States, selected local government and Tribal offices, and private and not-for-profit organizations. A total of 602 mission-critical activities were identified that need significantly more accurate data than are currently available. The results of the assessment indicate that a national-level enhanced-elevation-data program has the potential to generate from $1.2 billion to$13 billion in new benefits annually.
## Citation Information
Publication Year 2012 National Enhanced Elevation Assessment at a glance 10.3133/fs20123088 Gregory I. Snyder Report USGS Numbered Series Fact Sheet 2012-3088 fs20123088 USGS Publications Warehouse National Center
| 2023-03-30T12:00: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.19799606502056122, "perplexity": 4507.794120547727}, "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/1679296949181.44/warc/CC-MAIN-20230330101355-20230330131355-00713.warc.gz"}
|
https://zbmath.org/authors/?q=ai%3Asuli.endre-e
|
## Süli, Endre E.
Compute Distance To:
Author ID: suli.endre-e Published as: Süli, Endre; Süli, E.; Süli, Endre E.; Süli, E. E.; Sueli, Endre E.; Süli, Eh. Eh.; Suli, Endre; Endre Süli more...less Homepage: http://people.maths.ox.ac.uk/suli/ External Links: MGP · ORCID · Wikidata · dblp · GND · IdRef · theses.fr
Documents Indexed: 190 Publications since 1979, including 3 Books 9 Contributions as Editor Co-Authors: 136 Co-Authors with 186 Joint Publications 3,833 Co-Co-Authors
all top 5
### Co-Authors
13 single-authored 21 Houston, Paul 17 Barrett, John William 12 Ivanović, Lav D. 12 Jovanović, Boško S. 12 Morton, Keith William 9 Ortner, Christoph 8 Bulíček, Miroslav 7 Málek, Josef 7 Schwab, Christoph 6 Brezzi, Franco 5 Marini, Luisa Donatella 5 Mozolevsky, Igor E. 4 Hill, Adrian T. 4 Knezevic, David J. 4 Mackenzie, John A. 4 Sonar, Thomas 4 Ware, Antony F. 3 Bösing, Paulo Rafael 3 Burke, Siobhan 3 Cangiani, Andrea 3 Cockburn, Bernardo 3 DeVore, Ronald A. 3 Lin, Peixiong 3 Rannacher, Rolf 3 Schonbek, Maria Elena 3 Senior, Bill 3 Smears, Iain 2 Antonietti, Paola Francesca 2 Baird, Graham 2 Bonito, Andrea 2 Borzì, Alfio 2 Diening, Lars 2 Gallistl, Dietmar 2 Giles, Michael B. 2 Girault, Vivette 2 Heid, Pascal 2 Hughes, Thomas J. R. 2 Ko, Seungchan 2 Kreuzer, Christian 2 Langwallner, Bernhard 2 Lu, Yong 2 Luskin, Mitchell 2 Makridakis, Charalambos G. 2 Melcher, Christof 2 Monk, Peter B. 2 Münch, Andreas 2 Pogány, Tibor K. 2 Průša, Vít 2 Rajagopal, Kumbakonam Ramamani 2 Schonbek, Tomas P. 2 Shu, Chi-Wang 2 Sloan, David M. 2 Sprekeler, Timo 2 Vandewalle, Stefan G. 2 Vanmaele, Michèle 2 Warnecke, Gerald G. 2 Wihler, Thomas Pascal 1 Balland, Philippe 1 Beck, Lisa 1 Benešová, Barbora 1 Bernardi, Christine 1 Berrone, Stefano 1 Caddick, Miles 1 Cano, Begoña 1 Capdeboscq, Yves 1 Cheng, Bin 1 Condette, Nicolas 1 Congreve, Scott 1 Cucker, Felipe 1 Dahlke, Stephan 1 Dahmen, Wolfgang A. 1 Du, Qiang 1 Feireisl, Eduard 1 Figueroa, Leonardo E. 1 Gazca-Orozco, P. A. 1 Gelmetti, Nicolò 1 Georgoulis, Emmanuil H. 1 Grasedyck, Lars 1 Guignard, Diane 1 Gwiazda, Piotr 1 Harriman, Kathryn 1 Hintermüller, Michael 1 Iserles, Arieh 1 Jankov, Dragana 1 Jensen, Max 1 Ketcheson, David I. 1 Korzec, Maciek D. 1 Kutyniok, Gitta 1 Larsen, Christopher J. 1 Lasis, Andris 1 Lee, Alpha Albert 1 Mayers, David F. 1 Mitsotakis, Dimitrios E. 1 Müller, Stefan 1 Murdoch, Timothy A. 1 Norton, Richard A. 1 Olver, Peter John 1 Oparnica, Ljubica 1 Orozco, Pablo Alexei Gazca 1 Papadopoulos, Ioannis P. A. ...and 36 more Co-Authors
all top 5
### Serials
23 SIAM Journal on Numerical Analysis 16 IMA Journal of Numerical Analysis 13 M$$^3$$AS. Mathematical Models & Methods in Applied Sciences 11 European Series in Applied and Industrial Mathematics (ESAIM): Mathematical Modelling and Numerical Analysis 10 Mathematics of Computation 10 Numerische Mathematik 5 Computer Methods in Applied Mechanics and Engineering 5 Matematički Vesnik 3 Journal of Mathematical Analysis and Applications 3 Zeitschrift für Angewandte Mathematik und Mechanik (ZAMM) 3 Journal of Differential Equations 3 Publications de l’Institut Mathématique. Nouvelle Série 3 SIAM Journal on Scientific Computing 3 Foundations of Computational Mathematics 3 Multiscale Modeling & Simulation 3 Oberwolfach Reports 3 London Mathematical Society Lecture Note Series 2 Archive for Rational Mechanics and Analysis 2 International Journal for Numerical Methods in Fluids 2 Journal of Computational and Applied Mathematics 2 RAIRO. Modélisation Mathématique et Analyse Numérique 2 Journal of Scientific Computing 1 Calcolo 1 Computing 1 International Journal for Numerical Methods in Engineering 1 Mathematische Annalen 1 Nonlinear Analysis. Theory, Methods & Applications. Series A: Theory and Methods 1 Proceedings of the American Mathematical Society 1 Proceedings of the London Mathematical Society. Third Series 1 Applied Numerical Mathematics 1 Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Serie IX. Rendiconti Lincei. Matematica e Applicazioni 1 Alkalmazott Matematikai Lapok. A Magyar Tudomanyos Akademia. Matematikai es Fizikai Tudomanyok Osztalyanak Közlemenyei 1 Communications in Partial Differential Equations 1 Proceedings of the Royal Society of Edinburgh. Section A. Mathematics 1 SIAM Journal on Applied Mathematics 1 SIAM Journal on Mathematical Analysis 1 U.S.S.R. Computational Mathematics and Mathematical Physics 1 Communications in Numerical Methods in Engineering 1 Applied and Computational Harmonic Analysis 1 Mathematics and Mechanics of Solids 1 Mathematical Communications 1 Computing and Visualization in Science 1 Novi Sad Journal of Mathematics 1 Fractional Calculus & Applied Analysis 1 RIMS Kokyuroku 1 Nonlinear Analysis. Real World Applications 1 Discrete and Continuous Dynamical Systems. Series B 1 Kragujevac Journal of Mathematics 1 Computational Methods in Applied Mathematics 1 Communications on Pure and Applied Analysis 1 Communications in Mathematical Sciences 1 Acta Numerica 1 DLR Forschungsbericht 1 Springer Series in Computational Mathematics 1 Applicable Analysis and Discrete Mathematics 1 Discrete and Continuous Dynamical Systems. Series S 1 Stochastic and Partial Differential Equations. Analysis and Computations 1 EMS Surveys in Mathematical Sciences 1 Nečas Center Series
all top 5
### Fields
144 Numerical analysis (65-XX) 139 Partial differential equations (35-XX) 69 Fluid mechanics (76-XX) 22 Statistical mechanics, structure of matter (82-XX) 20 Mechanics of deformable solids (74-XX) 9 General and overarching topics; collections (00-XX) 7 Calculus of variations and optimal control; optimization (49-XX) 4 Potential theory (31-XX) 4 Functional analysis (46-XX) 3 Ordinary differential equations (34-XX) 3 Approximations and expansions (41-XX) 3 Operator theory (47-XX) 3 Probability theory and stochastic processes (60-XX) 2 Special functions (33-XX) 2 Dynamical systems and ergodic theory (37-XX) 2 Sequences, series, summability (40-XX) 2 Harmonic analysis on Euclidean spaces (42-XX) 2 Optics, electromagnetic theory (78-XX) 2 Biology and other natural sciences (92-XX) 1 History and biography (01-XX) 1 Integral transforms, operational calculus (44-XX) 1 Integral equations (45-XX) 1 Computer science (68-XX) 1 Mechanics of particles and systems (70-XX) 1 Classical thermodynamics, heat transfer (80-XX) 1 Quantum theory (81-XX)
### Citations contained in zbMATH Open
155 Publications have been cited 3,204 times in 2,264 Documents Cited by Year
Discontinuous $$hp$$-finite element methods for advection-diffusion-reaction problems. Zbl 1015.65067
Houston, Paul; Schwab, Christoph; Süli, Endre
2002
Adjoint methods for PDEs: a posteriori error analysis and postprocessing by duality. Zbl 1105.65350
Giles, Michael B.; Süli, Endre
2002
An introduction to numerical analysis. Zbl 1033.65001
Süli, Endre; Mayers, David F.
2003
Convergence and nonlinear stability of the Lagrange-Galerkin method for the Navier-Stokes equations. Zbl 0637.76024
Süli, Endre
1988
Enhanced accuracy by post-processing for finite element methods for hyperbolic equations. Zbl 1015.65049
Cockburn, Bernardo; Luskin, Mitchell; Shu, Chi-Wang; Süli, Endre
2003
Approximation of the global attractor for the incompressible Navier-Stokes equations. Zbl 0982.76022
2000
A note on the design of $$hp$$-adaptive finite element methods for elliptic partial differential equations. Zbl 1074.65131
Houston, Paul; Süli, Endre
2005
Convergence of finite volume schemes for Poisson’s equation on nonuniform meshes. Zbl 0802.65104
Süli, Endre
1991
Discontinuous Galerkin methods for first-order hyperbolic problems. Zbl 1070.65117
Brezzi, F.; Marini, L. D.; Süli, E.
2004
Large-time behaviour of solutions to the magneto-hydrodynamics equations. Zbl 0846.35018
Schonbek, M. E.; Schonbek, T. P.; Süli, Endre
1996
Stabilization mechanisms in discontinuous Galerkin finite element methods. Zbl 1125.65102
Brezzi, F.; Cockburn, B.; Marini, L. D.; Süli, E.
2006
$$hp$$-version a priori error analysis of interior penalty discontinuous Galerkin finite element approximations to the biharmonic equation. Zbl 1116.65117
Mozolevski, Igor; Süli, Endre; Bösing, Paulo R.
2007
Stability of the Lagrange-Galerkin method with non-exact integration. Zbl 0661.65114
Morton, K. W.; Priestley, A.; Süli, E.
1988
Stabilized $$hp$$-finite element methods for first-order hyperbolic problems. Zbl 0957.65103
Houston, Paul; Schwab, Christoph; Süli, Endre
2000
An adaptive finite element approximation of a variational model of brittle fracture. Zbl 1305.74080
Burke, Siobhan; Ortner, Christoph; Süli, Endre
2010
A priori error analysis of residual-free bubbles for advection-diffusion problems. Zbl 0947.65115
Brezzi, F.; Hughes, T. J. R.; Marini, L. D.; Russo, A.; Süli, Endre
1999
A convergence analysis of Yee’s scheme on nonuniform grids. Zbl 0805.65121
Monk, Peter; Süli, Endre
1994
Existence of solutions to a regularized model of dynamic fracture. Zbl 1425.74418
Larsen, Christopher J.; Ortner, Christoph; Süli, Endre
2010
Discontinuous Galerkin finite element approximation of quasilinear elliptic boundary value problems I: The scalar case. Zbl 1084.65116
Houston, Paul; Robson, Janice; Süli, Endre
2005
$$hp$$-version interior penalty DGFEMs for the biharmonic equation. Zbl 1173.65360
Süli, Endre; Mozolevski, Igor
2007
Discontinuous Galerkin finite element approximation of Hamilton-Jacobi-Bellman equations with Cordes coefficients. Zbl 1304.65252
Smears, Iain; Süli, Endre
2014
Existence and equilibration of global weak solutions to kinetic models for dilute polymers. I: Finitely extensible nonlinear bead-spring chains. Zbl 1244.35101
Barrett, John W.; Süli, Endre
2011
Discontinuous Galerkin finite element approximation of nondivergence form elliptic equations with Cordès coefficients. Zbl 1278.65182
Smears, Iain; Süli, Endre
2013
$$hp$$-adaptive discontinuous Galerkin finite element methods for first-order hyperbolic problems. Zbl 1029.65130
Houston, Paul; Endre Süli
2001
A priori error analysis for the hp-version of the discontinuous Galerkin finite element method for the biharmonic equation. Zbl 1048.65100
Mozolevski, Igor; Süli, Endre
2003
Existence of global weak solutions for some polymeric flow models. Zbl 1161.76453
Barrett, John W.; Schwab, Christoph; Süli, Endre
2005
Residual-free bubbles for advection-diffusion problems: The general error analysis. Zbl 0963.65109
Brezzi, F.; Marini, D.; Süli, E.
2000
A posteriori error analysis for numerical approximations of Friedrichs systems. Zbl 0935.65096
Houston, Paul; Mackenzie, J. A.; Süli, Endre; Warnecke, Gerald
1999
An adaptive finite element approximation of a generalized Ambrosio-Tortorelli functional. Zbl 1266.74044
Burke, Siobhan; Ortner, Christoph; Süli, Endre
2013
Spectral approximation of pattern-forming nonlinear evolution equations with double-well potentials of quadratic growth. Zbl 1209.65066
Condette, Nicolas; Melcher, Christof; Süli, Endre
2011
The accuracy of cell vertex finite volume methods on quadrilateral meshes. Zbl 0767.65072
Süli, Endre
1992
The adaptive computation of far-field patterns by a posteriori error estimation of linear functionals. Zbl 0932.65115
Monk, Peter; Süli, Endre
1998
Discontinuous Galerkin finite element approximation of the Cahn-Hilliard equation with convection. Zbl 1197.65136
Kay, David; Styles, Vanessa; Süli, Endre
2009
Discontinuous Galerkin finite element approximation of nonlinear second-order elliptic and hyperbolic systems. Zbl 1146.65070
Ortner, Christoph; Süli, Endre
2007
Houston, Paul; Süli, Endre
2001
A posteriori error analysis of $$hp$$-version discontinuous Galerkin finite-element methods for second-order quasi-linear elliptic PDEs. Zbl 1144.65070
Houston, Paul; Süli, Endre; Wihler, Thomas P.
2008
Existence of global weak solutions to some regularized kinetic models for dilute polymers. Zbl 1228.76004
Barrett, John W.; Süli, Endre
2007
Analysis of finite difference schemes. For linear partial differential equations with generalized solutions. Zbl 1335.65071
Jovanović, Boško S.; Süli, Endre
2014
A posteriori error analysis for stabilised finite element approximations of transport problems. Zbl 0970.65115
Houston, Paul; Rannacher, Rolf; Süli, Endre
2000
Existence and equilibration of global weak solutions to kinetic models for dilute polymers II: Hookean-type models. Zbl 1237.35127
Barrett, John W.; Süli, Endre
2012
$$hp$$-discontinuous Galerkin finite element methods for hyperbolic problems: Error analysis and adaptivity. Zbl 1021.76027
Houston, Paul; Senior, Bill; Süli, Endre
2002
Finite element approximation of steady flows of incompressible fluids with implicit power-law-like rheology. Zbl 1268.76030
Diening, Lars; Kreuzer, Christian; Süli, Endre
2013
Discontinuous Galerkin finite element methods for time-dependent Hamilton-Jacobi-Bellman equations with Cordes coefficients. Zbl 1338.65229
Smears, Iain; Süli, Endre
2016
Stabilised $$hp$$-finite element approximation of partial differential equations with nonnegative characteristic form. Zbl 0985.65136
Houston, P.; Süli, E.
2001
Finite volume methods and their analysis. Zbl 0729.65087
Morton, K. W.; Süli, E.
1991
Integral representation for Neumann series of Bessel functions. Zbl 1171.33003
Pogány, Tibor K.; Süli, Endre
2009
On elastic solids with limiting small strain: modelling and analysis. Zbl 1314.35184
Bulíček, Miroslav; Málek, Josef; Rajagopal, K. R.; Süli, Endre
2014
Existence of global weak solutions to dumbbell models for dilute polymers with microscopic cut-off. Zbl 1158.35070
Barrett, John W.; Süli, Endre
2008
Sparse finite element approximation of high-dimensional transport-dominated diffusion problems. Zbl 1159.65094
Schwab, Christoph; Süli, Endre; Todor, Radu Alexandru
2008
Existence of large-data finite-energy global weak solutions to a compressible Oldroyd-B model. Zbl 1390.35007
Barrett, John W.; Lu, Yong; Süli, Endre
2017
Adaptive finite element approximation of hyperbolic problems. Zbl 1141.76428
Süli, Endre; Houston, Paul
2003
$$hp$$-version discontinuous Galerkin methods with interior penalty for partial differential equations with nonnegative characteristic form. Zbl 1037.65117
Harriman, Kathryn; Houston, Paul; Senior, Bill; Süli, Endre
2003
Sobolev regularity estimation for $$hp$$-adaptive finite element methods. Zbl 1043.65114
Houston, P.; Senior, B.; Süli, E.
2003
Existence of global weak solutions to finitely extensible nonlinear bead-spring chain models for dilute polymers with variable density and viscosity. Zbl 1364.35254
Barrett, John W.; Süli, Endre
2012
$$hp$$-DGFEM for partial differential equations with nonnegative characteristic form. Zbl 0946.65102
Süli, Endre; Schwab, Christoph; Houston, Paul
2000
Modeling subgrid viscosity for advection-diffusion problems. Zbl 0980.76042
Brezzi, F.; Houston, P.; Marini, D.; Süli, E.
2000
Time and space adaptivity for the second-order wave equation. Zbl 1070.65083
Bernardi, Christine; Süli, Endre
2005
Analysis of a quasicontinuum method in one dimension. Zbl 1139.74004
Ortner, Christoph; Süli, Endre
2008
Tensor-sparsity of solutions to high-dimensional elliptic partial differential equations. Zbl 1365.65243
Dahmen, Wolfgang; DeVore, Ronald; Grasedyck, Lars; Süli, Endre
2016
Analysis of a cell-vertex finite volume method for convection-diffusion problems. Zbl 0885.65121
Morton, K. W.; Stynes, Martin; Süli, Endre
1997
Progress in adjoint error correction for integral functionals. Zbl 1061.65091
Giles, Michael B.; Pierce, Niles; Süli, Endre
2004
Optimal error estimates for the $$hp$$-version interior penalty discontinuous Galerkin finite element method. Zbl 1069.65118
Georgoulis, Emmanuil H.; Süli, Endre
2005
Greedy approximation of high-dimensional Ornstein-Uhlenbeck operators. Zbl 1269.76084
Figueroa, Leonardo E.; Süli, Endre
2012
Post-processing of Galerkin methods for hyperbolic problems. Zbl 0946.65085
Cockburn, Bernardo; Luskin, Mitchell; Shu, Chi-Wang; Süli, Endre
2000
Finite element methods for hyperbolic problems: A posteriori error analysis and adaptivity. Zbl 0886.65104
Süli, Endre; Houston, Paul
1997
$$hp$$-version discontinuous Galerkin finite element method for semilinear parabolic problems. Zbl 1155.65073
Lasis, Andris; Süli, Endre
2007
A spectral method of characteristics for hyperbolic problems. Zbl 0743.65080
Süli, Endre; Ware, Antony
1991
Existence of global weak solutions to compressible isentropic finitely extensible bead-spring chain models for dilute polymers. Zbl 1336.35273
Barrett, John W.; Süli, Endre
2016
Finite element approximation of finitely extensible nonlinear elastic dumbbell models for dilute polymers. Zbl 1314.82005
Barrett, John W.; Süli, Endre
2012
Sharp-interface limits of the Cahn-Hilliard equation with degenerate mobility. Zbl 1343.35129
Lee, Alpha Albert; Münch, Andreas; Süli, Endre
2016
Reflections on Dubinskiĭ’s nonlinear compact embedding theorem. Zbl 1265.46037
Barrett, John W.; Süli, Endre
2012
Discontinuous Galerkin finite element approximation of quasilinear elliptic boundary value problems. II: Strongly monotone quasi-Newtonian flows. Zbl 1457.65192
Congreve, Scott; Houston, Paul; Süli, Endre; Wihler, Thomas P.
2013
Mixed finite element approximation of the Hamilton-Jacobi-Bellman equation with Cordes coefficients. Zbl 1412.65186
Gallistl, Dietmar; Süli, Endre
2019
An implicit midpoint spectral approximation of nonlocal Cahn-Hilliard equations. Zbl 1328.65213
Benešová, Barbora; Melcher, Christof; Süli, Endre
2014
Analysis and approximation of a strain-limiting nonlinear elastic model. Zbl 1327.74032
Bulíček, M.; Málek, J.; Süli, E.
2015
$$hp$$-finite element methods for hyperbolic problems. Zbl 0959.65127
Süli, Endre; Houston, Paul; Schwab, Christoph
2000
$$hp$$-discontinuous Galerkin finite element methods with least-squares stabilization. Zbl 1053.76040
Houston, Paul; Jensen, Max; Süli, Endre
2002
A dual graph-norm refinement indicator for finite volume approximations of the Euler equations. Zbl 0902.76083
Sonar, Thomas; Süli, Endre
1998
Existence of global weak solutions to compressible isentropic finitely extensible nonlinear bead-spring chain models for dilute polymers: the two-dimensional case. Zbl 1343.35183
Barrett, John W.; Süli, Endre
2016
On the existence of integrable solutions to nonlinear elliptic systems and variational problems with linear growth. Zbl 1375.35164
Beck, Lisa; Bulíček, Miroslav; Málek, Josef; Süli, Endre
2017
A posteriori error analysis and adaptivity for finite element approximations of hyperbolic problems. Zbl 0927.65117
Süli, Endre
1999
Fully discrete finite element approximation of unsteady flows of implicitly constituted incompressible fluids. Zbl 1464.65131
Süli, Endre; Tscherpel, Tabea
2020
An agglomeration-based massively parallel non-overlapping additive Schwarz preconditioner for high-order discontinuous Galerkin methods on polytopic grids. Zbl 1442.65422
Antonietti, Paola F.; Houston, Paul; Pennesi, Giorgio; Süli, Endre
2020
PDE analysis of a class of thermodynamically compatible viscoelastic rate-type fluids with stress-diffusion. Zbl 1404.35346
Bulíček, Miroslav; Málek, Josef; Průša, Vít; Süli, Endre
2018
A heterogeneous alternating-direction method for a micro-macro dilute polymeric fluid model. Zbl 1180.82137
Knezevic, David J.; Süli, Endre
2009
Existence of global weak solutions to the kinetic Hookean dumbbell model for incompressible dilute polymeric fluids. Zbl 1379.35232
Barrett, John W.; Süli, Endre
2018
Two-sided a posteriori error bounds for incompressible quasi-Newtonian flows. Zbl 1136.76030
Berrone, Stefano; Süli, Endre
2008
Evolution-Galerkin methods and their supraconvergence. Zbl 0839.65101
Morton, K. W.; Süli, Endre
1995
Adaptive finite element approximation of steady flows of incompressible fluids with implicit power-law-like rheology. Zbl 1457.65201
Kreuzer, Christian; Süli, Endre
2016
Spectral Galerkin approximation of Fokker-Planck equations with unbounded drift. Zbl 1180.82136
Knezevic, David J.; Süli, Endre
2009
Upper semicontinuity of attractors for linear multistep methods approximating sectorial evolution equations. Zbl 0830.65049
1995
Finite element approximation of an incompressible chemically reacting non-Newtonian fluid. Zbl 1404.65270
Ko, Seungchan; Pustějovská, Petra; Süli, Endre
2018
Existence and convergence results for the Galerkin approximation of an electronic density functional. Zbl 1208.82063
Langwallner, Bernhard; Ortner, Christoph; Süli, Endre
2010
Characteristic Galerkin schemes for scalar conservation laws in two and three space dimensions. Zbl 0880.65079
Lin, Peixiong; Morton, K. W.; Süli, Endre
1997
Convergence of a finite-difference scheme for second-order hyperbolic equations with variable coefficients. Zbl 0624.65095
Jovanović, Boško S.; Ivanović, Lav D.; Süli, Endre E.
1987
Discontinuous Galerkin finite element approximation of the two-dimensional Navier-Stokes equations in stream-function formulation. Zbl 1262.76053
Mozolevski, Igor; Süli, Endre; Bösing, Paulo Rafael
2007
Numerical analysis of unsteady implicitly constituted incompressible fluids: 3-field formulation. Zbl 1434.76065
Farrell, Patrick E.; Gazca-Orozco, P. A.; Süli, Endre
2020
Well-posedness of the fractional Zener wave equation for heterogeneous viscoelastic materials. Zbl 1439.35544
Oparnica, Ljubica; Süli, Endre
2020
Dynamics of a nonlinear convection-diffusion equation in multidimensional bounded domains. Zbl 0828.35062
1995
Dissipative weak solutions to compressible Navier-Stokes-Fokker-Planck systems with variable viscosity coefficients. Zbl 1433.35270
Feireisl, Eduard; Lu, Yong; Süli, Endre
2016
On the convergence rate of the Kačanov scheme for shear-thinning fluids. Zbl 1483.65186
Heid, Pascal; Süli, Endre
2022
Numerical analysis of a topology optimization problem for Stokes flow. Zbl 07531726
Papadopoulos, I. P. A.; Süli, E.
2022
Finite element approximation and preconditioning for anisothermal flow of implicitly-constituted non-Newtonian fluids. Zbl 1490.65271
Farrell, Patrick; Orozco, Pablo Alexei Gazca; Süli, Endre
2022
Mixed finite element approximation of periodic Hamilton-Jacobi-Bellman problems with application to numerical homogenization. Zbl 07382143
Gallistl, Dietmar; Sprekeler, Timo; Süli, Endre
2021
A conservative fully discrete numerical method for the regularized shallow water wave equations. Zbl 1468.65146
Mitsotakis, Dimitrios; Ranocha, Hendrik; Ketcheson, David I.; Süli, Endre
2021
Existence of large-data global weak solutions to a model of a strain-limiting viscoelastic body. Zbl 1472.35092
Bulíček, Miroslav; Patel, Victoria; Şengül, Yasemin; Süli, Endre
2021
A finite volume scheme for the solution of a mixed discrete-continuous fragmentation model. Zbl 07405592
Baird, Graham; Süli, Endre
2021
Fully discrete finite element approximation of unsteady flows of implicitly constituted incompressible fluids. Zbl 1464.65131
Süli, Endre; Tscherpel, Tabea
2020
An agglomeration-based massively parallel non-overlapping additive Schwarz preconditioner for high-order discontinuous Galerkin methods on polytopic grids. Zbl 1442.65422
Antonietti, Paola F.; Houston, Paul; Pennesi, Giorgio; Süli, Endre
2020
Numerical analysis of unsteady implicitly constituted incompressible fluids: 3-field formulation. Zbl 1434.76065
Farrell, Patrick E.; Gazca-Orozco, P. A.; Süli, Endre
2020
Well-posedness of the fractional Zener wave equation for heterogeneous viscoelastic materials. Zbl 1439.35544
Oparnica, Ljubica; Süli, Endre
2020
Finite element approximation of elliptic homogenization problems in nondivergence-form. Zbl 1445.35028
Capdeboscq, Yves; Sprekeler, Timo; Süli, Endre
2020
Optimal-order finite difference approximation of generalized solutions to the biharmonic equation in a cube. Zbl 1471.65172
Müller, Stefan; Schweiger, Florian; Süli, Endre
2020
Finite element approximation of a strain-limiting elastic model. Zbl 1465.74156
Bonito, Andrea; Girault, Vivette; Süli, Endre
2020
Mixed finite element approximation of the Hamilton-Jacobi-Bellman equation with Cordes coefficients. Zbl 1412.65186
Gallistl, Dietmar; Süli, Endre
2019
Finite element approximation of steady flows of generalized Newtonian fluids with concentration-dependent power-law index. Zbl 1414.65034
Ko, Seungchan; Süli, Endre
2019
A mixed discrete-continuous fragmentation model. Zbl 1460.47021
Baird, Graham; Süli, Endre
2019
Spectral approximation of a strain-limiting nonlinear elastic model. Zbl 1474.65456
Gelmetti, Nicolò; Süli, Endre
2019
Numerical approximation of Young-measure solutions to parabolic systems of forward-backward type. Zbl 07472212
2019
PDE analysis of a class of thermodynamically compatible viscoelastic rate-type fluids with stress-diffusion. Zbl 1404.35346
Bulíček, Miroslav; Málek, Josef; Průša, Vít; Süli, Endre
2018
Existence of global weak solutions to the kinetic Hookean dumbbell model for incompressible dilute polymeric fluids. Zbl 1379.35232
Barrett, John W.; Süli, Endre
2018
Finite element approximation of an incompressible chemically reacting non-Newtonian fluid. Zbl 1404.65270
Ko, Seungchan; Pustějovská, Petra; Süli, Endre
2018
Existence of large-data global-in-time finite-energy weak solutions to a compressible FENE-P model. Zbl 1414.35162
Barrett, John W.; Süli, Endre
2018
Existence of large-data finite-energy global weak solutions to a compressible Oldroyd-B model. Zbl 1390.35007
Barrett, John W.; Lu, Yong; Süli, Endre
2017
On the existence of integrable solutions to nonlinear elliptic systems and variational problems with linear growth. Zbl 1375.35164
Beck, Lisa; Bulíček, Miroslav; Málek, Josef; Süli, Endre
2017
Regularity and approximation of strong solutions to rate-independent systems. Zbl 1379.49036
Rindler, Filip; Schwarzacher, Sebastian; Süli, Endre
2017
A partial Fourier transform method for a class of hypoelliptic Kolmogorov equations. Zbl 1369.65102
Reisinger, Christoph; Süli, Endre; Whitley, Alan
2017
Discontinuous Galerkin finite element methods for time-dependent Hamilton-Jacobi-Bellman equations with Cordes coefficients. Zbl 1338.65229
Smears, Iain; Süli, Endre
2016
Tensor-sparsity of solutions to high-dimensional elliptic partial differential equations. Zbl 1365.65243
Dahmen, Wolfgang; DeVore, Ronald; Grasedyck, Lars; Süli, Endre
2016
Existence of global weak solutions to compressible isentropic finitely extensible bead-spring chain models for dilute polymers. Zbl 1336.35273
Barrett, John W.; Süli, Endre
2016
Sharp-interface limits of the Cahn-Hilliard equation with degenerate mobility. Zbl 1343.35129
Lee, Alpha Albert; Münch, Andreas; Süli, Endre
2016
Existence of global weak solutions to compressible isentropic finitely extensible nonlinear bead-spring chain models for dilute polymers: the two-dimensional case. Zbl 1343.35183
Barrett, John W.; Süli, Endre
2016
Adaptive finite element approximation of steady flows of incompressible fluids with implicit power-law-like rheology. Zbl 1457.65201
Kreuzer, Christian; Süli, Endre
2016
Dissipative weak solutions to compressible Navier-Stokes-Fokker-Planck systems with variable viscosity coefficients. Zbl 1433.35270
Feireisl, Eduard; Lu, Yong; Süli, Endre
2016
Analysis of a viscosity model for concentrated polymers. Zbl 1344.35090
Bulíček, Miroslav; Gwiazda, Piotr; Süli, Endre; Świerczewska-Gwiazda, Agnieszka
2016
Analysis and approximation of a strain-limiting nonlinear elastic model. Zbl 1327.74032
Bulíček, M.; Málek, J.; Süli, E.
2015
Discontinuous Galerkin finite element approximation of Hamilton-Jacobi-Bellman equations with Cordes coefficients. Zbl 1304.65252
Smears, Iain; Süli, Endre
2014
Analysis of finite difference schemes. For linear partial differential equations with generalized solutions. Zbl 1335.65071
Jovanović, Boško S.; Süli, Endre
2014
On elastic solids with limiting small strain: modelling and analysis. Zbl 1314.35184
Bulíček, Miroslav; Málek, Josef; Rajagopal, K. R.; Süli, Endre
2014
An implicit midpoint spectral approximation of nonlocal Cahn-Hilliard equations. Zbl 1328.65213
Benešová, Barbora; Melcher, Christof; Süli, Endre
2014
Discontinuous Galerkin finite element approximation of nondivergence form elliptic equations with Cordès coefficients. Zbl 1278.65182
Smears, Iain; Süli, Endre
2013
An adaptive finite element approximation of a generalized Ambrosio-Tortorelli functional. Zbl 1266.74044
Burke, Siobhan; Ortner, Christoph; Süli, Endre
2013
Finite element approximation of steady flows of incompressible fluids with implicit power-law-like rheology. Zbl 1268.76030
Diening, Lars; Kreuzer, Christian; Süli, Endre
2013
Discontinuous Galerkin finite element approximation of quasilinear elliptic boundary value problems. II: Strongly monotone quasi-Newtonian flows. Zbl 1457.65192
Congreve, Scott; Houston, Paul; Süli, Endre; Wihler, Thomas P.
2013
Adaptive Galerkin approximation algorithms for Kolmogorov equations in infinite dimensions. Zbl 1286.35257
Schwab, Christoph; Süli, Endre
2013
Finite element analysis of Cauchy-Born approximations to atomistic models. Zbl 1275.82002
Makridakis, Charalambos; Süli, Endre
2013
Existence of global weak solutions to implicitly constituted kinetic models of incompressible homogeneous dilute polymers. Zbl 1277.35118
Bulíček, Miroslav; Málek, Josef; Süli, Endre
2013
Existence and equilibration of global weak solutions to kinetic models for dilute polymers II: Hookean-type models. Zbl 1237.35127
Barrett, John W.; Süli, Endre
2012
Existence of global weak solutions to finitely extensible nonlinear bead-spring chain models for dilute polymers with variable density and viscosity. Zbl 1364.35254
Barrett, John W.; Süli, Endre
2012
Greedy approximation of high-dimensional Ornstein-Uhlenbeck operators. Zbl 1269.76084
Figueroa, Leonardo E.; Süli, Endre
2012
Finite element approximation of finitely extensible nonlinear elastic dumbbell models for dilute polymers. Zbl 1314.82005
Barrett, John W.; Süli, Endre
2012
Reflections on Dubinskiĭ’s nonlinear compact embedding theorem. Zbl 1265.46037
Barrett, John W.; Süli, Endre
2012
Finite element approximation of an $$H^{1}$$ gradient flow of a double-well potential with bending energy. Zbl 1257.82062
Norton, Richard A.; Süli, Endre
2012
Existence and equilibration of global weak solutions to kinetic models for dilute polymers. I: Finitely extensible nonlinear bead-spring chains. Zbl 1244.35101
Barrett, John W.; Süli, Endre
2011
Spectral approximation of pattern-forming nonlinear evolution equations with double-well potentials of quadratic growth. Zbl 1209.65066
Condette, Nicolas; Melcher, Christof; Süli, Endre
2011
On the coefficients of Neumann series of Bessel functions. Zbl 1220.33003
Jankov, Dragana; Pogány, Tibor K.; Süli, Endre
2011
Finite element approximation of kinetic dilute polymer models with microscopic cut-off. Zbl 1291.35170
Barrett, John W.; Süli, Endre
2011
Adaptive finite element approximation of the Francfort-Marigo model of brittle fracture. Zbl 1429.74080
Burke, Siobhan; Ortner, Christoph; Süli, Endre
2011
A priori error analysis of two force-based atomistic/continuum models of a periodic chain. Zbl 1225.82070
Makridakis, Charalambos; Ortner, Christoph; Süli, Endre
2011
An adaptive finite element approximation of a variational model of brittle fracture. Zbl 1305.74080
Burke, Siobhan; Ortner, Christoph; Süli, Endre
2010
Existence of solutions to a regularized model of dynamic fracture. Zbl 1425.74418
Larsen, Christopher J.; Ortner, Christoph; Süli, Endre
2010
Existence and convergence results for the Galerkin approximation of an electronic density functional. Zbl 1208.82063
Langwallner, Bernhard; Ortner, Christoph; Süli, Endre
2010
Existence of global weak solutions to Fokker-Planck and Navier-Stokes-Fokker-Planck equations in kinetic models of dilute polymers. Zbl 1220.35178
Barrett, John W.; Süli, Endre
2010
Discontinuous Galerkin finite element approximation of the Cahn-Hilliard equation with convection. Zbl 1197.65136
Kay, David; Styles, Vanessa; Süli, Endre
2009
Integral representation for Neumann series of Bessel functions. Zbl 1171.33003
Pogány, Tibor K.; Süli, Endre
2009
A heterogeneous alternating-direction method for a micro-macro dilute polymeric fluid model. Zbl 1180.82137
Knezevic, David J.; Süli, Endre
2009
Spectral Galerkin approximation of Fokker-Planck equations with unbounded drift. Zbl 1180.82136
Knezevic, David J.; Süli, Endre
2009
Numerical approximation of corotational dumbbell models for dilute polymers. Zbl 1180.82232
Barrett, John W.; Süli, Endre
2009
Domain decomposition preconditioning for discontinuous Galerkin approximations of convection-diffusion problems. Zbl 1183.65028
Antonietti, Paola F.; Süli, Endre
2009
A posteriori error analysis of $$hp$$-version discontinuous Galerkin finite-element methods for second-order quasi-linear elliptic PDEs. Zbl 1144.65070
Houston, Paul; Süli, Endre; Wihler, Thomas P.
2008
Existence of global weak solutions to dumbbell models for dilute polymers with microscopic cut-off. Zbl 1158.35070
Barrett, John W.; Süli, Endre
2008
Sparse finite element approximation of high-dimensional transport-dominated diffusion problems. Zbl 1159.65094
Schwab, Christoph; Süli, Endre; Todor, Radu Alexandru
2008
Analysis of a quasicontinuum method in one dimension. Zbl 1139.74004
Ortner, Christoph; Süli, Endre
2008
Two-sided a posteriori error bounds for incompressible quasi-Newtonian flows. Zbl 1136.76030
Berrone, Stefano; Süli, Endre
2008
Existence of global weak solutions to coupled Navier-Stokes-Fokker-Planck systems: a brief survey. Zbl 1274.35001
Barrett, John W.; Süli, Endre
2008
$$hp$$-version a priori error analysis of interior penalty discontinuous Galerkin finite element approximations to the biharmonic equation. Zbl 1116.65117
Mozolevski, Igor; Süli, Endre; Bösing, Paulo R.
2007
$$hp$$-version interior penalty DGFEMs for the biharmonic equation. Zbl 1173.65360
Süli, Endre; Mozolevski, Igor
2007
Discontinuous Galerkin finite element approximation of nonlinear second-order elliptic and hyperbolic systems. Zbl 1146.65070
Ortner, Christoph; Süli, Endre
2007
Existence of global weak solutions to some regularized kinetic models for dilute polymers. Zbl 1228.76004
Barrett, John W.; Süli, Endre
2007
$$hp$$-version discontinuous Galerkin finite element method for semilinear parabolic problems. Zbl 1155.65073
Lasis, Andris; Süli, Endre
2007
Discontinuous Galerkin finite element approximation of the two-dimensional Navier-Stokes equations in stream-function formulation. Zbl 1262.76053
Mozolevski, Igor; Süli, Endre; Bösing, Paulo Rafael
2007
The residual-free-bubble finite element method on anisotropic partitions. Zbl 1155.65098
Cangiani, Andrea; Süli, Endre
2007
Stabilization mechanisms in discontinuous Galerkin finite element methods. Zbl 1125.65102
Brezzi, F.; Cockburn, B.; Marini, L. D.; Süli, E.
2006
Discontinuous Galerkin finite element method for a fourth-order nonlinear elliptic equation related to the two-dimensional Navier-Stokes equations. Zbl 1118.76041
Mozolevski, Igor; Süli, Endre; Bösing, Paulo Rafael
2006
Finite element algorithms for transport-diffusion problems: stability, adaptivity, tractability. Zbl 1100.65103
Süli, Endre
2006
Finite element approximation of high-dimensional transport-dominated diffusion problems. Zbl 1106.65331
Süli, Endre
2006
A note on the design of $$hp$$-adaptive finite element methods for elliptic partial differential equations. Zbl 1074.65131
Houston, Paul; Süli, Endre
2005
Discontinuous Galerkin finite element approximation of quasilinear elliptic boundary value problems I: The scalar case. Zbl 1084.65116
Houston, Paul; Robson, Janice; Süli, Endre
2005
Existence of global weak solutions for some polymeric flow models. Zbl 1161.76453
Barrett, John W.; Schwab, Christoph; Süli, Endre
2005
Time and space adaptivity for the second-order wave equation. Zbl 1070.65083
Bernardi, Christine; Süli, Endre
2005
Optimal error estimates for the $$hp$$-version interior penalty discontinuous Galerkin finite element method. Zbl 1069.65118
Georgoulis, Emmanuil H.; Süli, Endre
2005
Enhanced residual-free bubble method for convection-diffusion problems. Zbl 1066.65121
Cangiani, A.; Süli, E.
2005
Enhanced RFB method. Zbl 1085.65108
Cangiani, Andrea; Süli, Endre
2005
Discontinuous Galerkin methods for first-order hyperbolic problems. Zbl 1070.65117
Brezzi, F.; Marini, L. D.; Süli, E.
2004
Progress in adjoint error correction for integral functionals. Zbl 1061.65091
Giles, Michael B.; Pierce, Niles; Süli, Endre
2004
An introduction to numerical analysis. Zbl 1033.65001
Süli, Endre; Mayers, David F.
2003
Enhanced accuracy by post-processing for finite element methods for hyperbolic equations. Zbl 1015.65049
Cockburn, Bernardo; Luskin, Mitchell; Shu, Chi-Wang; Süli, Endre
2003
A priori error analysis for the hp-version of the discontinuous Galerkin finite element method for the biharmonic equation. Zbl 1048.65100
Mozolevski, Igor; Süli, Endre
2003
Adaptive finite element approximation of hyperbolic problems. Zbl 1141.76428
Süli, Endre; Houston, Paul
2003
$$hp$$-version discontinuous Galerkin methods with interior penalty for partial differential equations with nonnegative characteristic form. Zbl 1037.65117
Harriman, Kathryn; Houston, Paul; Senior, Bill; Süli, Endre
2003
...and 55 more Documents
all top 5
### Cited by 2,960 Authors
60 Süli, Endre E. 36 He, Yinnian 30 Houston, Paul 25 Ryan, Jennifer K. 23 Antonietti, Paola Francesca 23 Wick, Thomas 22 Giani, Stefano 19 Dolejší, Vít 16 Cockburn, Bernardo 16 Georgoulis, Emmanuil H. 16 Wheeler, Mary Fanett 16 Zhang, Zhimin 15 Bulíček, Miroslav 15 Luo, Zhendong 15 Tavener, Simon J. 14 Bermejo, Rodolfo 14 Hughes, Thomas J. R. 14 Kirby, Robert M. II 14 Rui, Hongxing 14 Schötzau, Dominik 14 Wihler, Thomas Pascal 13 Burman, Erik 12 Di Pietro, Daniele Antonio 12 Estep, Donald J. 12 Feng, Xiaobing 12 Málek, Josef 12 Ortner, Christoph 12 Perotto, Simona 12 Pogány, Tibor K. 12 Schwab, Christoph 12 Si, Zhiyong 12 Verani, Marco 12 Zou, Qingsong 11 Ern, Alexandre 11 Feistauer, Miloslav 11 Marini, Luisa Donatella 11 Pani, Amiya Kumar 11 Rivière, Beatrice M. 11 Wang, Cheng 10 Brezzi, Franco 10 Cangiani, Andrea 10 Gudi, Thirupathi 10 Li, Jian 10 Lukáčová-Medvid’ová, Mária 10 Shu, Chi-Wang 10 Xu, Jinchao 10 Yang, Xiaofeng 9 Adjerid, Slimane 9 Baccouch, Mahboub 9 Banz, Lothar 9 Barrett, John William 9 Bi, Chunjia 9 Chaudhry, Jehanzeb Hameed 9 Chen, Chuanjun 9 Dong, Zhaonan 9 Feng, Xinlong 9 Huang, Jianguo 9 Huang, Xuehai 9 Li, Jichun 9 Li, Xiaoli 9 Nataraj, Neela 9 Neilan, Michael 9 Rajagopal, Kumbakonam Ramamani 9 Zhang, Shangyou 8 Chen, Yanping 8 Cheng, Yingda 8 Darmofal, David L. 8 Fidkowski, Krzysztof J. 8 Ginting, Victor 8 Lube, Gert 8 Makridakis, Charalambos G. 8 Micheletti, Stefano 8 Notsu, Hirofumi 8 Perugia, Ilaria 8 Schroder, Andreas 8 Tabata, Masahisa 8 Van Brummelen, Harald 8 Wang, Chunmei 8 Wang, Junping 8 Wang, Xiaoming 8 Whiteley, Jonathan P. 8 Ye, Xiu 8 Zhang, Tie 8 Zhang, Yunong 7 Abdulle, Assyr 7 Baricz, Árpád 7 Calo, Victor Manuel 7 Carstensen, Carsten 7 Chen, Zhangxin 7 Chung, Tsz Shun Eric 7 de Lorenzis, Laura 7 Ferreira, José Augusto 7 Hall, Edward J. C. 7 Hiptmair, Ralf 7 Li, Xiaozhou 7 Li, Yonghai 7 Lin, Yanping 7 Luskin, Mitchell 7 Masud, Arif 7 Morton, Keith William ...and 2,860 more Authors
all top 5
### Cited in 275 Serials
199 Computer Methods in Applied Mechanics and Engineering 165 Journal of Computational Physics 156 Journal of Scientific Computing 111 Journal of Computational and Applied Mathematics 91 Computers & Mathematics with Applications 83 Applied Numerical Mathematics 78 Mathematics of Computation 68 Numerische Mathematik 60 SIAM Journal on Numerical Analysis 58 Applied Mathematics and Computation 54 M$$^3$$AS. Mathematical Models & Methods in Applied Sciences 53 Numerical Methods for Partial Differential Equations 52 SIAM Journal on Scientific Computing 52 European Series in Applied and Industrial Mathematics (ESAIM): Mathematical Modelling and Numerical Analysis 37 Computers and Fluids 27 Journal of Differential Equations 23 Journal of Mathematical Analysis and Applications 23 Computational Mechanics 22 International Journal for Numerical Methods in Engineering 22 Advances in Computational Mathematics 19 Numerical Algorithms 19 Communications in Computational Physics 16 International Journal for Numerical Methods in Fluids 16 Communications on Applied Mathematics and Computation 15 International Journal of Numerical Analysis and Modeling 14 Archive for Rational Mechanics and Analysis 13 Calcolo 13 Applied Mathematical Modelling 13 Journal of Numerical Mathematics 13 Multiscale Modeling & Simulation 12 International Journal of Computer Mathematics 12 Computational Methods in Applied Mathematics 11 Advances in Applied Mathematics and Mechanics 11 Science China. Mathematics 10 Numerical Functional Analysis and Optimization 10 M2AN. Mathematical Modelling and Numerical Analysis. ESAIM, European Series in Applied and Industrial Mathematics 10 Nonlinear Analysis. Real World Applications 10 Comptes Rendus. Mathématique. Académie des Sciences, Paris 9 BIT 9 Applied Mathematics Letters 8 ZAMP. Zeitschrift für angewandte Mathematik und Physik 8 Nonlinear Analysis. Theory, Methods & Applications. Series A: Theory and Methods 8 Calculus of Variations and Partial Differential Equations 8 Foundations of Computational Mathematics 7 Applicable Analysis 7 Mathematical Methods in the Applied Sciences 7 Nonlinearity 7 Acta Applicandae Mathematicae 7 Journal of Elasticity 7 Journal of Nonlinear Science 7 Computing and Visualization in Science 7 Communications in Nonlinear Science and Numerical Simulation 7 Computational Geosciences 7 Discrete and Continuous Dynamical Systems. Series S 6 Journal of Fluid Mechanics 6 Applications of Mathematics 6 SIAM Journal on Mathematical Analysis 6 Computational Optimization and Applications 6 Discrete and Continuous Dynamical Systems. Series B 6 International Journal of Computational Methods 5 Journal of Mathematical Physics 5 Mathematical Biosciences 5 Chinese Annals of Mathematics. Series B 5 Communications in Partial Differential Equations 5 Communications in Numerical Methods in Engineering 5 Mathematical Modelling and Analysis 5 Archives of Computational Methods in Engineering 5 Acta Mathematica Scientia. Series B. (English Edition) 5 S$$\vec{\text{e}}$$MA Journal 5 SIAM/ASA Journal on Uncertainty Quantification 4 Journal of Functional Analysis 4 Mathematics and Computers in Simulation 4 Annales de l’Institut Henri Poincaré. Analyse Non Linéaire 4 European Journal of Applied Mathematics 4 Journal of Mathematical Sciences (New York) 4 Computational and Applied Mathematics 4 Integral Transforms and Special Functions 4 Mathematical Problems in Engineering 4 International Journal of Computational Fluid Dynamics 4 Abstract and Applied Analysis 4 Journal of Evolution Equations 4 Advances in Difference Equations 4 International Journal of Applied and Computational Mathematics 4 AMM. Applied Mathematics and Mechanics. (English Edition) 4 SN Partial Differential Equations and Applications 4 Results in Applied Mathematics 4 Journal of Computational and Theoretical Transport 3 Acta Mechanica 3 Communications on Pure and Applied Mathematics 3 Inverse Problems 3 Journal of the Mechanics and Physics of Solids 3 Computing 3 Meccanica 3 Results in Mathematics 3 RAIRO. Modélisation Mathématique et Analyse Numérique 3 Acta Mathematicae Applicatae Sinica. English Series 3 Journal of Complexity 3 Mathematical and Computer Modelling 3 Journal de Mathématiques Pures et Appliquées. Neuvième Série 3 Linear Algebra and its Applications ...and 175 more Serials
all top 5
### Cited in 46 Fields
1,667 Numerical analysis (65-XX) 1,022 Partial differential equations (35-XX) 728 Fluid mechanics (76-XX) 289 Mechanics of deformable solids (74-XX) 102 Calculus of variations and optimal control; optimization (49-XX) 97 Statistical mechanics, structure of matter (82-XX) 80 Optics, electromagnetic theory (78-XX) 56 Ordinary differential equations (34-XX) 46 Biology and other natural sciences (92-XX) 40 Probability theory and stochastic processes (60-XX) 34 Classical thermodynamics, heat transfer (80-XX) 32 Approximations and expansions (41-XX) 28 Dynamical systems and ergodic theory (37-XX) 28 Geophysics (86-XX) 27 Functional analysis (46-XX) 27 Computer science (68-XX) 22 Special functions (33-XX) 22 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 22 Systems theory; control (93-XX) 20 Real functions (26-XX) 20 Integral equations (45-XX) 19 Operator theory (47-XX) 19 Quantum theory (81-XX) 17 Linear and multilinear algebra; matrix theory (15-XX) 15 Potential theory (31-XX) 15 Mechanics of particles and systems (70-XX) 14 Operations research, mathematical programming (90-XX) 13 Statistics (62-XX) 12 Sequences, series, summability (40-XX) 9 Harmonic analysis on Euclidean spaces (42-XX) 8 Difference and functional equations (39-XX) 6 Number theory (11-XX) 5 Information and communication theory, circuits (94-XX) 4 Global analysis, analysis on manifolds (58-XX) 3 General and overarching topics; collections (00-XX) 3 Functions of a complex variable (30-XX) 3 Astronomy and astrophysics (85-XX) 2 History and biography (01-XX) 2 Combinatorics (05-XX) 2 Differential geometry (53-XX) 2 Mathematics education (97-XX) 1 Field theory and polynomials (12-XX) 1 Topological groups, Lie groups (22-XX) 1 Geometry (51-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.
| 2022-09-25T17:22: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.6072773933410645, "perplexity": 9533.72714238458}, "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/1664030334591.19/warc/CC-MAIN-20220925162915-20220925192915-00119.warc.gz"}
|
http://dlmf.nist.gov/23.5
|
# §23.5(i) Real-Valued Functions
The Weierstrass functions take real values on the real axis iff the lattice is fixed under complex conjugation: $\mathbb{L}=\overline{\mathbb{L}}$; equivalently, when $g_{2},g_{3}\in\Real$. This happens in the cases treated in the following four subsections.
# §23.5(ii) Rectangular Lattice
This occurs when both $\omega_{1}$ and $\omega_{3}/i$ are real and positive. Then $\Delta>0$ and the parallelogram with vertices at $0$, $2\omega_{1}$, $2\omega_{1}+2\omega_{3}$, $2\omega_{3}$ is a rectangle.
In this case the lattice roots $e_{1}$, $e_{2}$, and $e_{3}$ are real and distinct. When they are identified as in (23.3.9)
23.5.1 $\displaystyle e_{1}$ $\displaystyle>e_{2}>e_{3},$ $\displaystyle e_{1}$ $\displaystyle>0>e_{3}.$ Symbols: $e_{j}$: zeros Referenced by: (a) Permalink: http://dlmf.nist.gov/23.5.E1 Encodings: TeX, TeX, pMML, pMML, png, png
Also, $e_{2}$ and $g_{3}$ have opposite signs unless $\omega_{3}=i\omega_{1}$, in which event both are zero.
As functions of $\imagpart{\omega_{3}}$, $e_{1}$ and $e_{2}$ are decreasing and $e_{3}$ is increasing.
# §23.5(iii) Lemniscatic Lattice
This occurs when $\omega_{1}$ is real and positive and $\omega_{3}=i\omega_{1}$. The parallelogram $0$, $2\omega_{1}$, $2\omega_{1}+2\omega_{3}$, $2\omega_{3}$ is a square, and
23.5.2 $\eta_{1}=i\eta_{3}=\pi/(4\omega_{1}),$
23.5.3 $\displaystyle e_{1}$ $\displaystyle=-e_{3}=\left(\mathop{\Gamma\/}\nolimits\!\left(\tfrac{1}{4}% \right)\right)^{4}/(32\pi\omega_{1}^{2}),$ $\displaystyle e_{2}$ $\displaystyle=0,$
23.5.4 $\displaystyle g_{2}$ $\displaystyle=\left(\mathop{\Gamma\/}\nolimits\!\left(\tfrac{1}{4}\right)% \right)^{8}/(256\pi^{2}\omega_{1}^{4}),$ $\displaystyle g_{3}$ $\displaystyle=0.$
Note also that in this case $\tau=i$. In consequence,
23.5.5 $\displaystyle k^{2}$ $\displaystyle=\tfrac{1}{2},$ $\displaystyle\mathop{K\/}\nolimits\!\left(k\right)$ $\displaystyle={\mathop{K\/}\nolimits^{\prime}}\!\left(k\right)$ $\displaystyle=\ifrac{\left(\mathop{\Gamma\/}\nolimits\!\left(\tfrac{1}{4}% \right)\right)^{2}}{\left(4\sqrt{\pi}\right)}.$
# §23.5(iv) Rhombic Lattice
This occurs when $\omega_{1}$ is real and positive, $\imagpart{\omega_{3}}>0$, $\realpart{\omega_{3}}=\tfrac{1}{2}\omega_{1}$, and $\Delta<0$. The parallelogram $0$, $2\omega_{1}-2\omega_{3}$, $2\omega_{1}$, $2\omega_{3}$, is a rhombus: see Figure 23.5.1.
The lattice root $e_{1}$ is real, and $e_{3}=\bar{e}_{2}$, with $\imagpart{e_{2}}>0$. $e_{1}$ and $g_{3}$ have the same sign unless $2\omega_{3}=(1+i)\omega_{1}$ when both are zero: the pseudo-lemniscatic case. As a function of $\imagpart{e_{3}}$ the root $e_{1}$ is increasing. For the case $\omega_{3}=e^{\pi i/3}\omega_{1}$ see §23.5(v).
# §23.5(v) Equianharmonic Lattice
This occurs when $\omega_{1}$ is real and positive and $\omega_{3}=e^{\pi i/3}\omega_{1}$. The rhombus $0$, $2\omega_{1}-2\omega_{3}$, $2\omega_{1}$, $2\omega_{3}$ can be regarded as the union of two equilateral triangles: see Figure 23.5.2.
23.5.6 $\eta_{1}=e^{\pi i/3}\eta_{3}=\frac{\pi}{2\sqrt{3}\omega_{1}},$
and the lattice roots and invariants are given by
23.5.7 $e_{1}=e^{2\pi i/3}e_{3}=e^{-2\pi i/3}e_{2}=\frac{\left(\mathop{\Gamma\/}% \nolimits\!\left(\tfrac{1}{3}\right)\right)^{6}}{2^{14/3}\pi^{2}\omega_{1}^{2}},$
23.5.8 $\displaystyle g_{2}$ $\displaystyle=0,$ $\displaystyle g_{3}$ $\displaystyle=\frac{\left(\mathop{\Gamma\/}\nolimits\!\left(\tfrac{1}{3}\right% )\right)^{18}}{(4\pi\omega_{1})^{6}}.$
Note also that in this case $\tau=e^{i\pi/3}$. In consequence,
23.5.9 $\displaystyle k^{2}$ $\displaystyle=e^{i\pi/3},$ $\displaystyle\mathop{K\/}\nolimits\!\left(k\right)$ $\displaystyle=e^{i\pi/6}{\mathop{K\/}\nolimits^{\prime}}\!\left(k\right)$ $\displaystyle=e^{i\pi/12}\frac{3^{1/4}\left(\mathop{\Gamma\/}\nolimits\!\left(% \frac{1}{3}\right)\right)^{3}}{2^{7/3}\pi}.$
| 2015-04-19T19:08:55 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 130, "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.9672724604606628, "perplexity": 397.0819391684691}, "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-18/segments/1429246639414.6/warc/CC-MAIN-20150417045719-00303-ip-10-235-10-82.ec2.internal.warc.gz"}
|
http://dlmf.nist.gov/8.11
|
# §8.11 Asymptotic Approximations and Expansions
## §8.11(i) Large , Fixed
If is real and () is positive, then is bounded in absolute value by the first neglected term and has the same sign provided that . For bounds on when is real and is complex see Olver (1997b, pp. 109–112). For an exponentially-improved asymptotic expansion (§2.11(iii)) see Olver (1991a).
## §8.11(ii) Large , Fixed
This expansion is absolutely convergent for all finite , and it can also be regarded as a generalized asymptotic expansion (§2.1(v)) of as in .
## §8.11(iii) Large , Fixed
The expansion (8.11.7) also applies when with , and in this case Gautschi (1959a) supplies numerical bounds for the remainders in the truncated expansion (8.11.7). For extensions to complex variables see Temme (1994b, §4), and also Mahler (1930), Tricomi (1950b), and Paris (2002b).
## §8.11(iv) Large , Bounded
in both cases uniformly with respect to bounded real values of . For Dawson’s integral see §7.2(ii). See Tricomi (1950b) for these approximations, together with higher terms and extensions to complex variables. For related expansions involving Hermite polynomials see Pagurova (1965).
## §8.11(v) Other Approximations
For the function defined by (8.4.11),
8.11.13
With , an asymptotic expansion of follows from (8.11.14) and (8.11.16).
For (8.11.18) and extensions to complex values of see Buckholtz (1963). For a uniformly valid expansion for and , see Wong (1973b).
| 2013-06-20T04:11:55 |
{"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.9095508456230164, "perplexity": 3543.3454486196583}, "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-2013-20/segments/1368710274484/warc/CC-MAIN-20130516131754-00077-ip-10-60-113-184.ec2.internal.warc.gz"}
|
https://lammps.sandia.gov/doc/fix_heat.html
|
# fix heat command
## Syntax
fix ID group-ID heat N eflux
• ID, group-ID are documented in fix command
• heat = style name of this fix command
• N = add/subtract heat every this many timesteps
• eflux = rate of heat addition or subtraction (energy/time units)
• eflux can be a variable (see below)
• zero or more keyword/value pairs may be appended to args
• keyword = region
region value = region-ID
region-ID = ID of region atoms must be in to have added force
## Examples
fix 3 qin heat 1 1.0
fix 3 qin heat 10 v_flux
fix 4 qout heat 1 -1.0 region top
## Description
Add non-translational kinetic energy (heat) to a group of atoms in a manner that conserves their aggregate momentum. Two of these fixes can be used to establish a temperature gradient across a simulation domain by adding heat (energy) to one group of atoms (hot reservoir) and subtracting heat from another (cold reservoir). E.g. a simulation sampling from the McDLT ensemble.
If the region keyword is used, the atom must be in both the group and the specified geometric region in order to have energy added or subtracted to it. If not specified, then the atoms in the group are affected wherever they may move to.
Heat addition/subtraction is performed every N timesteps. The eflux parameter can be specified as a numeric constant or as a variable (see below). If it is a numeric constant or equal-style variable which evaluates to a scalar value, then the eflux determines the change in aggregate energy of the entire group of atoms per unit time, e.g. in eV/psec for metal units. In this case it is an “extensive” quantity, meaning its magnitude should be scaled with the number of atoms in the group. Note that since eflux has per-time units (i.e. it is a flux), this means that a larger value of N will add/subtract a larger amount of energy each time the fix is invoked.
Note
The heat-exchange (HEX) algorithm implemented by this fix is known to exhibit a pronounced energy drift. An improved algorithm (eHEX) is available as a fix ehex command and might be preferable if energy conservation is important.
If eflux is specified as an atom-style variable (see below), then the variable computes one value per atom. In this case, each value is the energy flux for a single atom, again in units of energy per unit time. In this case, each value is an “intensive” quantity, which need not be scaled with the number of atoms in the group.
As mentioned above, the eflux parameter can be specified as an equal-style or atom_style variable. If the value is a variable, it should be specified as v_name, where name is the variable name. In this case, the variable will be evaluated each timestep, and its value(s) used to determine the flux.
Equal-style variables can specify formulas with various mathematical functions, and include thermo_style command keywords for the simulation box parameters and timestep and elapsed time. Thus it is easy to specify a time-dependent flux.
Atom-style variables can specify the same formulas as equal-style variables but can also include per-atom values, such as atom coordinates. Thus it is easy to specify a spatially-dependent flux with optional time-dependence as well.
Note
If heat is subtracted from the system too aggressively so that the group’s kinetic energy would go to zero, or any individual atom’s kinetic energy would go to zero for the case where eflux is an atom-style variable, then LAMMPS will halt with an error message.
Fix heat is different from a thermostat such as fix nvt or fix temp/rescale in that energy is added/subtracted continually. Thus if there isn’t another mechanism in place to counterbalance this effect, the entire system will heat or cool continuously. You can use multiple heat fixes so that the net energy change is 0.0 or use fix viscous to drain energy from the system.
This fix does not change the coordinates of its atoms; it only scales their velocities. Thus you must still use an integration fix (e.g. fix nve) on the affected atoms. This fix should not normally be used on atoms that have their temperature controlled by another fix - e.g. fix nvt or fix langevin fix.
Restart, fix_modify, output, run start/stop, minimize info:
No information about this fix is written to binary restart files. None of the fix_modify options are relevant to this fix.
This fix computes a global scalar which can be accessed by various output commands. This scalar is the most recent value by which velocities were scaled. The scalar value calculated by this fix is “intensive”. If eflux is specified as an atom-style variable, this fix computes the average value by which the velocities were scaled for all of the atoms that had their velocities scaled.
No parameter of this fix can be used with the start/stop keywords of the run command. This fix is not invoked during energy minimization.
none
| 2019-08-18T00:49: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": 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.8465248346328735, "perplexity": 1542.344968909067}, "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-2019-35/segments/1566027313536.31/warc/CC-MAIN-20190818002820-20190818024820-00555.warc.gz"}
|
https://pdglive.lbl.gov/DataBlock.action?node=B145A1&home=sumtabB
|
#### ${{\mathit \Delta}{(1750)}}$ BREIT-WIGNER PHOTON DECAY AMPLITUDES
Papers on ${{\mathit \gamma}}{{\mathit N}}$ amplitudes predating 1981 may be found in our 2006 edition, Journal of Physics G33 1 (2006).
#### ${{\mathit \Delta}{(1750)}}$ $\rightarrow$ ${{\mathit N}}{{\mathit \gamma}}$ , helicity-1/2 amplitude A$_{1/2}$
VALUE (GeV${}^{−1/2}$) DOCUMENT ID TECN COMMENT
• • We do not use the following data for averages, fits, limits, etc. • •
$0.053$
2002 D
DPWA Multichannel
References:
PENNER 2002D
PR C66 055212 Vector Meson Production and Nucleon Resonance Analysis in a Coupled Channel Approach for Energies ${\mathit m}_{{{\mathit N}}}$ $<$ $\sqrt {s }$ $<$ 2 GeV. 2. Photon Induced Results
| 2022-09-29T20:25:20 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 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.5218197703361511, "perplexity": 11992.679405119818}, "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/1664030335365.63/warc/CC-MAIN-20220929194230-20220929224230-00011.warc.gz"}
|
https://zbmath.org/authors/?q=ai%3Aohtsuki.tomotada
|
Compute Distance To:
Documents Indexed: 43 Publications since 1992, including 2 Books 1 Contribution as Editor Co-Authors: 16 Co-Authors with 21 Joint Publications 242 Co-Co-Authors
all top 5
### Co-Authors
23 single-authored 8 Murakami, Hitoshi 6 Le, Thang Tu Quoc 6 Murakami, Jun 3 Garoufalidis, Stavros 2 Takata, Toshie 2 Yamada, Shuji 1 Akutsu, Yasuhiro 1 Deguchi, Tetsuo 1 Kohno, Toshitake 1 Kuriya, Takahito 1 Moskovich, Daniel 1 Okada, Masae 1 Riley, Robert F. 1 Sakuma, Makoto 1 Turaev, Vladimir Georgievich 1 Yokota, Yoshiyuki
all top 5
### Serials
4 Journal of Knot Theory and its Ramifications 3 Mathematical Proceedings of the Cambridge Philosophical Society 3 Topology 3 Geometry & Topology 2 Communications in Mathematical Physics 2 Osaka Journal of Mathematics 2 International Journal of Mathematics 1 Inventiones Mathematicae 1 Journal of Combinatorial Theory. Series A 1 Journal of the Mathematical Society of Japan 1 Proceedings of the Japan Academy. Series A 1 Publications of the Research Institute for Mathematical Sciences, Kyoto University 1 Topology and its Applications 1 Kobe Journal of Mathematics 1 Sūgaku 1 Sugaku Expositions 1 L’Enseignement Mathématique. 2e Série 1 Documenta Mathematica 1 The Asian Journal of Mathematics 1 Algebraic & Geometric Topology 1 Series on Knots and Everything 1 Geometry and Topology Monographs 1 MSJ Memoirs 1 Journal of Topology 1 Quantum Topology
all top 5
### Fields
44 Manifolds and cell complexes (57-XX) 5 Quantum theory (81-XX) 2 General and overarching topics; collections (00-XX) 1 Combinatorics (05-XX) 1 Nonassociative rings and algebras (17-XX) 1 Group theory and generalizations (20-XX) 1 Statistical mechanics, structure of matter (82-XX)
### Citations contained in zbMATH Open
40 Publications have been cited 577 times in 404 Documents Cited by Year
On a universal perturbative invariant of 3-manifolds. Zbl 0897.57017
Le, Thang T. Q.; Murakami, Jun; Ohtsuki, Tomotada
1998
Problems on invariants of knots and 3-manifolds. Zbl 1163.57302
Ohtsuki, T.
2002
Homfly polynomial via an invariant of colored plane graphs. Zbl 0958.57014
1998
Quantum invariants. A study of knots, 3-manifolds, and their sets. Zbl 0991.57001
2002
Invariants of colored links. Zbl 0758.57004
Akutsu, Yasuhiro; Deguchi, Tetsuo; Ohtsuki, Tomotada
1992
Epimorphisms between 2-bridge link groups. Zbl 1146.57011
Ohtsuki, Tomotada; Riley, Robert; Sakuma, Makoto
2008
Finite type invariants of integral homology 3-spheres. Zbl 0942.57009
1996
A polynomial invariant of rational homology $$3$$-spheres. Zbl 0855.57016
1996
A polynomial invariant of integral homology 3-spheres. Zbl 0843.57019
1995
Colored ribbon Hopf algebras and universal invariants of framed links. Zbl 0798.57006
1993
Invariants of three-manifolds derived from linking matrices of framed links. Zbl 0776.57009
1992
Topological quantum field theory for the universal quantum invariant. Zbl 0938.57022
Murakami, J.; Ohtsuki, T.
1997
Ideal points and incompressible surfaces in two-bridge knot complements. Zbl 0837.57006
1994
Quantum $$\mathrm{SU}(3)$$ invariant of 3-manifolds via linear skein theory. Zbl 0949.57011
1997
On the Kashaev invariant and the twisted Reidemeister torsion of two-bridge knots. Zbl 1332.57013
2015
On the asymptotic expansion of the Kashaev invariant of the $$5_2$$ knot. Zbl 1393.57014
2016
Invariants of 3-manifolds derived from universal invariants of framed links. Zbl 0859.57018
1995
On the asymptotic expansions of the Kashaev invariant of the knots with 6 crossings. Zbl 1412.57008
2018
On finite type 3-manifold invariants. III: Manifold weight systems. Zbl 0889.57017
1998
On the asymptotic expansions of the Kashaev invariant of hyperbolic knots with seven crossings. Zbl 1388.57014
2017
A cabling formula for the 2-loop polynomial of knots. Zbl 1097.57016
2004
The perturbative $$SO(3)$$ invariant of rational homology 3-spheres recovers from the universal perturbative invariant. Zbl 1006.57006
2000
On the 2-loop polynomial of knots. Zbl 1154.57012
2007
Finite type invariants of knots via their Seifert matrices. Zbl 1015.57004
2001
A three-manifold invariant derived from the universal Vassiliev-Kontsevich invariant. Zbl 0863.57011
Le, Thang Q. T.; Murakami, Hitoshi; Murakami, Jun; Ohtsuki, Tomotada
1995
A three-manifold invariant via the Kontsevich integral. Zbl 0959.57007
Thang Tu Quoc Le; Murakami, Hitoshi; Murakami, Jun; Ohtsuki, Tomotada
1999
On the asymptotic expansion of the quantum SU(2) invariant at $$q =exp(4{\pi}\sqrt{-1}/N$$) for closed hyperbolic 3-manifolds obtained by integral surgery along the figure-eight knot. Zbl 07006390
2018
How to construct ideal points of $$\text{SL}_2({\mathbb{C}})$$ representation spaces of knot groups. Zbl 0924.57004
1999
Vanishing of 3-loop Jacobi diagrams of odd degree. Zbl 1118.57015
2007
Equivariant quantum invariants of the infinite cyclic covers of knot complements. Zbl 1161.57006
2007
Invariants of knots and 3-manifolds. Zbl 1198.57009
2007
Perturbative invariants of 3-manifolds with the first Betti number 1. Zbl 1221.57026
2010
Invariants of knots derived from equivariant linking matrices of their surgery presentations. Zbl 1176.57017
2009
On finite type 3-manifold invariants. V: Rational homology 3-spheres. Zbl 0889.57019
1997
Quantum $$Sp(n)$$ invariant of links via an invariant of colored planar graphs. Zbl 0881.57005
1996
A filtration of the set of integral homological 3-spheres. Zbl 0907.57012
1998
Combinatorial quantum method in 3-dimensional topology. Zbl 0946.57015
1999
Invariants of knots and 3-manifolds. Proceedings of the workshop, Kyoto, Japan, September 17–21, 2001. Zbl 0996.00037
2002
The perturbative invariants of rational homology 3-spheres can be recovered from the LMO invariant. Zbl 1259.57005
Kuriya, Takahito; Le, Thang T. Q.; Ohtsuki, Tomotada
2012
On the quantum $$\mathrm{SU}(2)$$ invariant at $$q= \exp (4\pi \sqrt{-1}/N)$$ and the twisted Reidemeister torsion for some closed 3-manifolds. Zbl 1441.57011
2019
On the quantum $$\mathrm{SU}(2)$$ invariant at $$q= \exp (4\pi \sqrt{-1}/N)$$ and the twisted Reidemeister torsion for some closed 3-manifolds. Zbl 1441.57011
2019
On the asymptotic expansions of the Kashaev invariant of the knots with 6 crossings. Zbl 1412.57008
2018
On the asymptotic expansion of the quantum SU(2) invariant at $$q =exp(4{\pi}\sqrt{-1}/N$$) for closed hyperbolic 3-manifolds obtained by integral surgery along the figure-eight knot. Zbl 07006390
2018
On the asymptotic expansions of the Kashaev invariant of hyperbolic knots with seven crossings. Zbl 1388.57014
2017
On the asymptotic expansion of the Kashaev invariant of the $$5_2$$ knot. Zbl 1393.57014
2016
On the Kashaev invariant and the twisted Reidemeister torsion of two-bridge knots. Zbl 1332.57013
2015
The perturbative invariants of rational homology 3-spheres can be recovered from the LMO invariant. Zbl 1259.57005
Kuriya, Takahito; Le, Thang T. Q.; Ohtsuki, Tomotada
2012
Perturbative invariants of 3-manifolds with the first Betti number 1. Zbl 1221.57026
2010
Invariants of knots derived from equivariant linking matrices of their surgery presentations. Zbl 1176.57017
2009
Epimorphisms between 2-bridge link groups. Zbl 1146.57011
Ohtsuki, Tomotada; Riley, Robert; Sakuma, Makoto
2008
On the 2-loop polynomial of knots. Zbl 1154.57012
2007
Vanishing of 3-loop Jacobi diagrams of odd degree. Zbl 1118.57015
2007
Equivariant quantum invariants of the infinite cyclic covers of knot complements. Zbl 1161.57006
2007
Invariants of knots and 3-manifolds. Zbl 1198.57009
2007
A cabling formula for the 2-loop polynomial of knots. Zbl 1097.57016
2004
Problems on invariants of knots and 3-manifolds. Zbl 1163.57302
Ohtsuki, T.
2002
Quantum invariants. A study of knots, 3-manifolds, and their sets. Zbl 0991.57001
2002
Invariants of knots and 3-manifolds. Proceedings of the workshop, Kyoto, Japan, September 17–21, 2001. Zbl 0996.00037
2002
Finite type invariants of knots via their Seifert matrices. Zbl 1015.57004
2001
The perturbative $$SO(3)$$ invariant of rational homology 3-spheres recovers from the universal perturbative invariant. Zbl 1006.57006
2000
A three-manifold invariant via the Kontsevich integral. Zbl 0959.57007
Thang Tu Quoc Le; Murakami, Hitoshi; Murakami, Jun; Ohtsuki, Tomotada
1999
How to construct ideal points of $$\text{SL}_2({\mathbb{C}})$$ representation spaces of knot groups. Zbl 0924.57004
1999
Combinatorial quantum method in 3-dimensional topology. Zbl 0946.57015
1999
On a universal perturbative invariant of 3-manifolds. Zbl 0897.57017
Le, Thang T. Q.; Murakami, Jun; Ohtsuki, Tomotada
1998
Homfly polynomial via an invariant of colored plane graphs. Zbl 0958.57014
1998
On finite type 3-manifold invariants. III: Manifold weight systems. Zbl 0889.57017
1998
A filtration of the set of integral homological 3-spheres. Zbl 0907.57012
1998
Topological quantum field theory for the universal quantum invariant. Zbl 0938.57022
Murakami, J.; Ohtsuki, T.
1997
Quantum $$\mathrm{SU}(3)$$ invariant of 3-manifolds via linear skein theory. Zbl 0949.57011
1997
On finite type 3-manifold invariants. V: Rational homology 3-spheres. Zbl 0889.57019
1997
Finite type invariants of integral homology 3-spheres. Zbl 0942.57009
1996
A polynomial invariant of rational homology $$3$$-spheres. Zbl 0855.57016
1996
Quantum $$Sp(n)$$ invariant of links via an invariant of colored planar graphs. Zbl 0881.57005
1996
A polynomial invariant of integral homology 3-spheres. Zbl 0843.57019
1995
Invariants of 3-manifolds derived from universal invariants of framed links. Zbl 0859.57018
1995
A three-manifold invariant derived from the universal Vassiliev-Kontsevich invariant. Zbl 0863.57011
Le, Thang Q. T.; Murakami, Hitoshi; Murakami, Jun; Ohtsuki, Tomotada
1995
Ideal points and incompressible surfaces in two-bridge knot complements. Zbl 0837.57006
1994
Colored ribbon Hopf algebras and universal invariants of framed links. Zbl 0798.57006
1993
Invariants of colored links. Zbl 0758.57004
Akutsu, Yasuhiro; Deguchi, Tetsuo; Ohtsuki, Tomotada
1992
Invariants of three-manifolds derived from linking matrices of framed links. Zbl 0776.57009
1992
all top 5
### Cited by 391 Authors
22 Geer, Nathan 20 Patureau-Mirand, Bertrand 15 Garoufalidis, Stavros 13 Ohtsuki, Tomotada 12 Le, Thang Tu Quoc 10 Habiro, Kazuo 9 Massuyeau, Gwénaël 9 Sakuma, Makoto 8 Bar-Natan, Dror 8 Lee, Donghi 8 Meilhan, Jean-Baptiste 7 Gukov, Sergei 7 Murakami, Jun 7 Rozansky, Lev 7 Takata, Toshie 6 Costantino, Francesco 6 Hoste, Jim 6 Ishii, Atsushi 6 Ito, Tetsuya 6 Manturov, Vassiliĭ Olegovich 6 Shanahan, Patrick D. 6 Suzuki, Sakie 5 Blanchet, Christian 5 Lawrence, Ruth J. 5 Murakami, Hitoshi 5 Stošić, Marko 5 Suzuki, Masaaki 4 Kauffman, Louis Hirsch 4 Levine, Jerome P. 4 Robert, Louis-Hadrien 4 Thuillier, Frank 4 Tran, Anh Tuan 3 Andersen, Jørgen Ellegaard 3 Chen, Qi 3 Curtis, Cynthia L. 3 Dancso, Zsuzsanna 3 De Renzi, Marco 3 De Wit, David 3 Frohman, Charles D. 3 Hikami, Kazuhiro 3 Hsieh, Chun-Chung 3 Lescop, Christine 3 Lin, Xiao-Song 3 Marché, Julien 3 Moussard, Delphine 3 Nagasato, Fumikazu 3 Nawata, Satoshi 3 Nosaka, Takefumi 3 Rose, David E. V. 3 Sikora, Adam S. 3 van der Veen, Roland 3 Wagner, Emmanuel 3 Wu, Hao 3 Yuasa, Wataru 2 Abe, Sukuse 2 Anghel, Cristina Ana-Maria 2 Beliakova, Anna 2 Boden, Hans U. 2 Bryden, John M. 2 Cautis, Sabin 2 Chbili, Nafaa 2 Cheptea, Dorin 2 Conant, James 2 Creutzig, Thomas 2 Elhamdadi, Mohamed 2 Funar, Louis 2 Gainutdinov, Azat M. 2 Gilmer, Patrick M. 2 Ha, Ngoc Phu 2 Himpel, Benjamin 2 Hirasawa, Mikami 2 Il’yutko, Denis Petrovich 2 Ishikawa, Masaharu 2 Jackson, David M. 2 Kamnitzer, Joel 2 Kanenobu, Taizo 2 Karuo, Hiroaki 2 Kim, Dongseok 2 Kim, Taehee 2 Kitano, Teruaki 2 Krasner, Daniel 2 Kricker, Andrew 2 Kuppum, Srikanth 2 Lauda, Aaron D. 2 Mackaay, Marco 2 Mariño, Marcos 2 Mathieu, Philippe 2 Mattman, Thomas W. 2 Morifuji, Takayuki 2 Morrison, Scott 2 Murasugi, Kunio 2 Oblomkov, Alexei A. 2 Ochiai, Tomoshiro 2 Park, Sunghyuk 2 Porti, Joan 2 Przytycki, Józef H. 2 Queffelec, Hoel 2 Quesne, Christiane 2 Reshetikhin, Nikolai Yu. 2 Rupert, Matthew ...and 291 more Authors
all top 5
### Cited in 84 Serials
75 Journal of Knot Theory and its Ramifications 46 Algebraic & Geometric Topology 24 Topology and its Applications 17 Geometry & Topology 16 International Journal of Mathematics 15 Communications in Mathematical Physics 14 Quantum Topology 12 Transactions of the American Mathematical Society 11 Journal of Pure and Applied Algebra 10 Journal of Mathematical Physics 9 Advances in Mathematics 8 Mathematical Proceedings of the Cambridge Philosophical Society 6 Journal of Geometry and Physics 6 Mathematische Annalen 6 Selecta Mathematica. New Series 6 Journal of High Energy Physics 5 Acta Mathematica Vietnamica 5 Geometriae Dedicata 4 Duke Mathematical Journal 4 Journal of Algebra 4 Mathematische Zeitschrift 4 Proceedings of the American Mathematical Society 4 Journal of Algebraic Combinatorics 4 Communications in Contemporary Mathematics 4 Journal of Topology 3 Letters in Mathematical Physics 3 Inventiones Mathematicae 3 Osaka Journal of Mathematics 3 Tokyo Journal of Mathematics 2 Israel Journal of Mathematics 2 Annales de l’Institut Fourier 2 Canadian Journal of Mathematics 2 Hiroshima Mathematical Journal 2 International Journal of Mathematics and Mathematical Sciences 2 Journal of Combinatorial Theory. Series A 2 Journal of the Mathematical Society of Japan 2 Proceedings of the Japan Academy. Series A 2 Publications of the Research Institute for Mathematical Sciences, Kyoto University 2 Experimental Mathematics 2 Journal of Mathematical Sciences (New York) 2 Winter Braids Lecture Notes 1 Communications in Algebra 1 Mathematical Notes 1 Physica A 1 Arkiv för Matematik 1 Mathematics of Computation 1 Fortschritte der Physik 1 Acta Mathematica 1 Annales Scientifiques de l’École Normale Supérieure. Quatrième Série 1 Bulletin de la Société Mathématique de France 1 Canadian Mathematical Bulletin 1 Compositio Mathematica 1 Fundamenta Mathematicae 1 Publications Mathématiques 1 Journal of Combinatorial Theory. Series B 1 Journal of Functional Analysis 1 Journal für die Reine und Angewandte Mathematik 1 Memoirs of the American Mathematical Society 1 Nagoya Mathematical Journal 1 Quaestiones Mathematicae 1 Rendiconti dell’Istituto di Matematica dell’Università di Trieste 1 Transactions of the Moscow Mathematical Society 1 European Journal of Combinatorics 1 Combinatorica 1 Journal of the American Mathematical Society 1 Sugaku Expositions 1 Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Serie IX. Rendiconti Lincei. Matematica e Applicazioni 1 Expositiones Mathematicae 1 Chinese Science Bulletin 1 Annales Mathématiques Blaise Pascal 1 Kyushu Journal of Mathematics 1 Representation Theory 1 Annals of Combinatorics 1 Acta Mathematica Sinica. English Series 1 Lobachevskii Journal of Mathematics 1 Annales Henri Poincaré 1 Journal of Statistical Mechanics: Theory and Experiment 1 Oberwolfach Reports 1 SIGMA. Symmetry, Integrability and Geometry: Methods and Applications 1 Complex Analysis and Operator Theory 1 Advances in Mathematical Physics 1 Research in the Mathematical Sciences 1 Journal de l’École Polytechnique – Mathématiques 1 Journal of Applied and Computational Topology
all top 5
### Cited in 33 Fields
362 Manifolds and cell complexes (57-XX) 65 Nonassociative rings and algebras (17-XX) 55 Quantum theory (81-XX) 34 Group theory and generalizations (20-XX) 25 Category theory; homological algebra (18-XX) 21 Associative rings and algebras (16-XX) 20 Global analysis, analysis on manifolds (58-XX) 17 Algebraic geometry (14-XX) 15 Combinatorics (05-XX) 15 Number theory (11-XX) 12 Differential geometry (53-XX) 10 Algebraic topology (55-XX) 6 Functional analysis (46-XX) 4 Statistical mechanics, structure of matter (82-XX) 3 Special functions (33-XX) 3 Dynamical systems and ergodic theory (37-XX) 3 Geometry (51-XX) 3 Probability theory and stochastic processes (60-XX) 2 History and biography (01-XX) 2 $$K$$-theory (19-XX) 2 Difference and functional equations (39-XX) 2 Relativity and gravitational theory (83-XX) 1 General and overarching topics; collections (00-XX) 1 Order, lattices, ordered algebraic structures (06-XX) 1 Commutative algebra (13-XX) 1 Topological groups, Lie groups (22-XX) 1 Functions of a complex variable (30-XX) 1 Several complex variables and analytic spaces (32-XX) 1 Partial differential equations (35-XX) 1 Sequences, series, summability (40-XX) 1 Approximations and expansions (41-XX) 1 Abstract harmonic analysis (43-XX) 1 Computer science (68-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-01T00:11:37 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 1, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.5320053100585938, "perplexity": 3530.3145163950426}, "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/1656103915196.47/warc/CC-MAIN-20220630213820-20220701003820-00250.warc.gz"}
|
https://par.nsf.gov/biblio/10292629-singlet-portal-dark-matter
|
2HDM singlet portal to dark matter
A bstract Higgs portal models are the most minimal way to explain the relic abundance of the Universe. They add just a singlet that only couples to the Higgs through a single parameter that controls both the dark matter relic abundance and the direct detection cross-section. Unfortunately this scenario, either with scalar or fermionic dark matter, is almost ruled out by the latter. In this paper we analyze the Higgs-portal idea with fermionic dark matter in the context of a 2HDM. By disentangling the couplings responsible for the correct relic density from those that control the direct detection cross section we are able to open the parameter space and find wide regions consistent with both the observed relic density and all the current bounds.
Authors:
; ; ;
Award ID(s):
Publication Date:
NSF-PAR ID:
10292629
Journal Name:
Journal of High Energy Physics
Volume:
2021
Issue:
1
ISSN:
1029-8479
ABSTRACT We present the first set of cosmological baryonic zoom-in simulations of galaxies including dissipative self-interacting dark matter (dSIDM). These simulations utilize the Feedback In Realistic Environments galaxy formation physics, but allow the dark matter to have dissipative self-interactions analogous to standard model forces, parametrized by the self-interaction cross-section per unit mass, (σ/m), and the dimensionless degree of dissipation, 0 < fdiss < 1. We survey this parameter space, including constant and velocity-dependent cross-sections, and focus on structural and kinematic properties of dwarf galaxies with $M_{\rm halo} \sim 10^{10-11}{\, \rm M_\odot }$ and $M_{\ast } \sim 10^{5-8}{\, \rm M_\odot }$.more »
3. ABSTRACT Core formation and runaway core collapse in models with self-interacting dark matter (SIDM) significantly alter the central density profiles of collapsed haloes. Using a forward modelling inference framework with simulated data-sets, we demonstrate that flux ratios in quadruple image strong gravitational lenses can detect the unique structural properties of SIDM haloes, and statistically constrain the amplitude and velocity dependence of the interaction cross-section in haloes with masses between 106 and 1010 M⊙. Measurements on these scales probe self-interactions at velocities below $30 \ \rm {km} \ \rm {s^{-1}}$, a relatively unexplored regime of parameter space, complimenting constraints at highermore »
4. Abstract A search for dark matter particles is performed using events with a Z boson candidate and large missing transverse momentum. The analysis is based on proton–proton collision data at a center-of-mass energy of 13 $$\,\text {Te}\text {V}$$ Te , collected by the CMS experiment at the LHC in 2016–2018, corresponding to an integrated luminosity of 137 $$\,\text {fb}^{-1}$$ fb - 1 . The search uses the decay channels $${\mathrm{Z}} \rightarrow {\mathrm{e}} {\mathrm{e}}$$ Z → e e and $${\mathrm{Z}} \rightarrow {{\upmu }{}{}} {{\upmu }{}{}}$$ Z → μ μ . No significant excess of events is observed over themore »
5. A bstract We consider a class of unified models based on the gauge group SO(10) which with appropriate choice of Higgs representations generate in a natural way a pair of light Higgs doublets needed to accomplish electroweak symmetry breaking. In this class of models higher dimensional operators of the form matter-matter-Higgs-Higgs in the superpotential after spontaneous breaking of the GUT symmetry generate contributions to Yukawa couplings which are comparable to the ones from cubic interactions. Specifically we consider an SO(10) model with a sector consisting of 126 + $$\overline{126}$$ 126 ¯ + 210 of heavy Higgs which breaksmore »
| 2022-06-25T15:02: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": 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.6327379941940308, "perplexity": 1196.4677709056912}, "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/1656103035636.10/warc/CC-MAIN-20220625125944-20220625155944-00647.warc.gz"}
|
https://lammps.sandia.gov/doc/pair_dsmc.html
|
pair_style dsmc command
Syntax
pair_style dsmc max_cell_size seed weighting Tref Nrecompute Nsample
• max_cell_size = global maximum cell size for DSMC interactions (distance units)
• seed = random # seed (positive integer)
• weighting = macroparticle weighting
• Tref = reference temperature (temperature units)
• Nrecompute = re-compute v*sigma_max every this many timesteps (timesteps)
• Nsample = sample this many times in recomputing v*sigma_max
Examples
pair_style dsmc 2.5 34387 10 1.0 100 20
pair_coeff * * 1.0
pair_coeff 1 1 1.0
Description
Style dsmc computes collisions between pairs of particles for a direct simulation Monte Carlo (DSMC) model following the exposition in (Bird). Each collision resets the velocities of the two particles involved. The number of pairwise collisions for each pair or particle types and the length scale within which they occur are determined by the parameters of the pair_style and pair_coeff commands.
Stochastic collisions are performed using the variable hard sphere (VHS) approach, with the user-defined max_cell_size value used as the maximum DSMC cell size, and reference cross-sections for collisions given using the pair_coeff command.
There is no pairwise energy or virial contributions associated with this pair style.
The following coefficient must be defined for each pair of atoms types via the pair_coeff command as in the examples above, or in the data file or restart files read by the read_data or read_restart commands:
• sigma (area units, i.e. distance-squared)
The global DSMC max_cell_size determines the maximum cell length used in the DSMC calculation. A structured mesh is overlayed on the simulation box such that an integer number of cells are created in each direction for each processor’s sub-domain. Cell lengths are adjusted up to the user-specified maximum cell size.
To perform a DSMC simulation with LAMMPS, several additional options should be set in your input script, though LAMMPS does not check for these settings.
Since this pair style does not compute particle forces, you should use the “fix nve/noforce” time integration fix for the DSMC particles, e.g.
fix 1 all nve/noforce
This pair style assumes that all particles will communicated to neighboring processors every timestep as they move. This makes it possible to perform all collisions between pairs of particles that are on the same processor. To ensure this occurs, you should use these commands:
neighbor 0.0 bin
neigh_modify every 1 delay 0 check no
atom_modify sort 0 0.0
communicate single cutoff 0.0
These commands ensure that LAMMPS communicates particles to neighboring processors every timestep and that no ghost atoms are created. The output statistics for a simulation run should indicate there are no ghost particles or neighbors.
In order to get correct DSMC collision statistics, users should specify a Gaussian velocity distribution when populating the simulation domain. Note that the default velocity distribution is uniform, which will not give good DSMC collision rates. Specify “dist gaussian” when using the velocity command as in the following:
velocity all create 594.6 87287 loop geom dist gaussian
Mixing, shift, table, tail correction, restart, rRESPA info:
This pair style does not support mixing. Thus, coefficients for all I,J pairs must be specified explicitly.
This pair style does not support the pair_modify shift option for the energy of the pair interaction.
The pair_modify table option is not relevant for this pair style.
This pair style does not support the pair_modify tail option for adding long-range tail corrections to energy and pressure.
This pair style writes its information to binary restart files, so pair_style and pair_coeff commands do not need to be specified in an input script that reads a restart file. Note that the user-specified random number seed is stored in the restart file, so when a simulation is restarted, each processor will re-initialize its random number generator the same way it did initially. This means the random forces will be random, but will not be the same as they would have been if the original simulation had continued past the restart time.
This pair style can only be used via the pair keyword of the run_style respa command. It does not support the inner, middle, outer keywords.
Restrictions
This style is part of the MC package. It is only enabled if LAMMPS was built with that package. See the Build package doc page for more info.
| 2020-01-25T18:43:45 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 1, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.7083970904350281, "perplexity": 3386.228336807044}, "config": {"markdown_headings": false, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2020-05/segments/1579251678287.60/warc/CC-MAIN-20200125161753-20200125190753-00451.warc.gz"}
|
https://pos.sissa.it/367/186/
|
Search for squarks and gluinos in final states with jets and missing transverse momentum at $\sqrt{s}$ = 13 TeV using 139 fb$^{-1}$ data with the ATLAS detector
K. Uno* on behalf of the ATLAS Collaboration
Full text: pdf
Pre-published on: November 08, 2019
Published on: December 17, 2019
Abstract
A search for squarks and gluinos is one of the primary targets among the supersymmetry particles at the Large Hadron Collider experiments because their cross sections are relatively large. Multi-bin and multivariate techniques are newly introduced in the searches for squarks and gluinos in final states with jets and missing transverse momentum in an event. This analysis uses data corrected in 2015-2018 with the ATLAS detector at $\sqrt{s}=13$ TeV, corresponding to the integrated luminosity of 139 fb$^{-1}$.
No significant excess over the Standard Model predictions is observed and the exclusion limits for the squark and gluino pair production in simplified models are set. In case of massless neutralino, squark (gluino) masses are excluded up to 1940 (2350) GeV at the 95 % confidence level.
DOI: https://doi.org/10.22323/1.367.0186
How to cite
Metadata are provided both in "article" format (very similar to INSPIRE) as this helps creating very compact bibliographies which can be beneficial to authors and readers, and in "proceeding" format which is more detailed and complete.
Open Access
Copyright owned by the author(s) under the term of the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
| 2023-03-23T05:51: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.5818887948989868, "perplexity": 2429.1322550329264}, "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-00786.warc.gz"}
|
https://ogame.fandom.com/wiki/Nanite_Factory
|
## FANDOM
331 Pages
Base Cost
Metal: 1,000,000
Crystal: 500,000
Deuterium: 100,000
Energy: 0
Nanite Factory produces nano-sized robots, which are considered the ultimate achievement in Robotic technology. These are capable of greatly increasing construction speed of buildings, defenses and ships.
In game terms, the Nanite Factory halves the construction time for all buildings, ships, and defense cumulatively for every level that is upgraded. Thus it is the only building which, assuming you don't change your Robotics level past the level 10 requirement, always takes the same time to upgrade (~55h).
Leveling up the factory is useful at the lower levels for drastically cutting down production times. However, keep in mind that defenses and ships never take any longer to build and so the production time decrease is less each subsequent level. For example: A ship that would take 1 hour to build would be decreased 30 minutes after one level, 15 the next, and only 7 and a half after that. Meanwhile, the cost of the factory itself is doubling every level. However, as the building time of a mine doubles every level, it may be a good idea to level up the factory every so often if you want to build high level mines.
While upgrading the Nanite Factory, you cannot build ships or defenses.
Requirements:
Is Required For:
## Level Table Edit
Metal Crystal Deuterium
1 1,000,000 500,000 100,000
2 2,000,000 1,000,000 200,000
3 4,000,000 2,000,000 400,000
4 8,000,000 4,000,000 800,000
5 16,000,000 8,000,000 1,600,000
6 32.000.000 16.000.000 3.200.000
7 64.000.000 32.000.000 6.400.000
8 128.000.000 64.000.000 12.800.000
9 256.000.000 128.000.000 25.600.000
10 512.000.000 256.000.000 51.200.000
11 1.024.000.000 512.000.000 102.400.000
12 2.048.000.000 1.024.000.000 204.800.000
13 4.096.000.000 2.048.000.000 409.600.000
14 8.192.000.000 4.096.000.000 819.200.000
15 16.384.000.000 8.192.000.000 1.638.400.000
## Formula to calculate timeEdit
### Resulting construction timeEdit
$t = \frac{\text{Metal}+\text{Crystal}}{2500\cdot(1 + \text{Robotics Factory Level})\cdot 2^{\text{Nanite Factory Level}}\cdot \text{Universe Speed}}$.
or shorter
$t = \frac{1}{2500\cdot(1 + \text{Robotics Factory Level})\cdot \text{Universe Speed}}$
NOTE : It seems that at least in some universes this value needs to be multiplied by 2/(7 - Current level of the building constructed), until the said building is level 5 (Nanites factories excepted). Can someone confirm this for all universes ?
This formula also works for calculating building times of ships and defences, except that the shipyard level should be filled in for Robotic Factory Level
So the Equation for ship and defense build times would be:
$t = \frac{Metal + Crystal}{2500*(1 + Shipyard Level)*2^{Nanite Factory Level}* Universe Speed}$
Since most players once having reached the Nanite Factory stop building Robotic Factory at level 10, to calculate your building time you can use this simplified formula.
### Simplified Construction TimeEdit
This will only work if the level of your Robotic Factory remains unchanged:
$T = \mbox{Displayed Time}\times 0.5^{\mbox{Increase In Nanite Factory}}$
T is the final time in hours
Displayed Time is the actual time you see in your buildings or shipyard's page
Increase In Nanite Factory is the difference between the Nanite Factory level you have now and the number you'll have as this construction time is attained. For instance, If you have level 5 Nanite Factory and you calculate with 3 as Increase, the time given will be attained with level 8 Nanite Factory.
Examples - 2h(displayed time) x 0.5(fixed rate) ^ 1(lvl1 Nanite Factory) = 1h Construction time,
2h(displayed time) x 0.5(fixed rate) ^ 2(lvl2 Nanite Factory) = 30m Construction time,
2h(displayed time) x 0.5(fixed rate) ^ 3(lvl3 Nanite Factory) = 15m Construction time.
### Number of Nanite Factories for a desired resulting timeEdit
This formula calculates the Nanite Factory level you'll need to construct something in a certain time. As with the preceding formula, your number of Robotic Factory must remain unchanged.
$\mbox{Increase In Nanite Factory}=\log_2 \left (\frac {\text{Displayed Time}} {\text{Desired Time}}\right )$
Increase In Nanite Factory is the number of Nanite Factories you'll need to attain the time you want. This number will most likely be a decimal; you will have to round up to achieve at least your desired time. For instance, if the increase is 2.1, building 2 Nanite Factories will get you almost but not quite to your desired time, while building 3 will do even better than your desired time.
Displayed Time is the time you see in the buildings or shipyard page.
Desired Time is the time you want to attain.
Times can be in any unit you like (including seconds, minutes, hours, or days), as long as you use the same unit for both desired and displayed time. To calculate a log in base 2, you can use this online scientific calculator or use the relation:
$\log_{2}x=\frac{\ln x}{\ln 2}$
where $\ln$ is the natural logarithm, $\log_{e}$
### Time conversion - H:M:S to SEdit
To calculate time in H:M:S display, use this formula:
$T = (\text{Days}\times 86400) + (\text{Hours}\times 3600) + (\text{Minutes} \times 60) + \text{Seconds}$
Buildings in OGame
Resources
Facilities
Community content is available under CC-BY-SA unless otherwise noted.
| 2020-07-02T22:33: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.6129858493804932, "perplexity": 4272.39806238563}, "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/1593655880243.25/warc/CC-MAIN-20200702205206-20200702235206-00305.warc.gz"}
|
https://mooseframework.inl.gov/source/materials/ComputeLinearElasticPFFractureStress.html
|
# Compute Quasi-birttle Linear Elastic Phase Field Fracture Stress
## Description
This material implements the unified phase-field model for mechanics of damage and quasi-brittle failure from Jian-Ying Wu Wu (2017).
## Crack Surface Energy
The regularized functional is given as
(1)
The crack surface density function is expressed in terms of the crack phase-field and its spatial gradient as (2) where the geometric function characterizes homogeneous evolution of the crack phase-field. is an internal length scale regularizing the sharp crack. is a scaling parameter such that the regularized functional represents the crack surface.
The crack geometric function generally satisfies the following properties, (3)
In the classical phase-field models the modeling crack geometric function have been widely adopted for brittle fracture_energy (4)
## Elastic Energy
The elastic energy is defined as (5)
The monotonically decreasing energetic function describes degradation of the initial strain energy as the crack phase-field evolves, satisfying the following properties Miehe et al. (2015) (6)
The variation of the elastic energy gives constitutive relations (7) where the thermodynamic force drives evolution of the crack phase-field with the reference energy related to the strain field .
A genetic expression for degradation function is given as (8) for and continuous function Q(d) > 0. Jian-Ying Wu considers following polynomials (9) where the coefficients are calibrated from standard material properties.
The energetic function recovers some particular examples used in the literature, such as when and .
### Decomposition Approaches
The elastic energy is usually decomposed additively to distinguish between tensile and compressive contributions. Three decomposition approaches are implemented.
#### Strain Spectral Decomposition
The total strain energy density is defined as (10) where is the strain energy due to tensile stress, is the strain energy due to compressive stress. (11) where is the th eigenvalue of the strain tensor and is an operator that provides the positive or negative part.
To be thermodynamically consistent, the stress is related to the deformation energy density according to (12) Thus, (13) where is the th eigenvector. The stress becomes (14)
#### Strain Volumetric and Deviatoric Decomposition
The approach is based on the orthogonal decomposition of the linearized strain tensor in its spherical and deviatoric components: (15) werhe deontes the n-dimensional identity tensor.
and is defined as (16) (17)
The stress is defined as (18) and (19)
#### Stress Spectral Decomposition
and is defined as (20) (21)
The compressive and tensile parts of the stress are computed from postive and negative projection tensors (computed from the spectral decomposition) according to (22) (23)
To be thermodynamically consistent, the stress is related to the deformation energy density according to (24) Since (25) (26) then, (27)
The Jacobian matrix for the stress is (28) where is the elasticity tensor.
Note that stress spectral decomposition approach can be used for anisotropic elasticity tensor.
## Evolution Equation (Allen-Cahn)
To avoid crack healing, a history variable is defined that is the maximum energy density over the time interval , where is the current time step, i.e. (29)
Now, the total free energy is redefined as: (30) with (31) and (32)
Its derivatives are (33)
To further avoid crack phase-field going to negative, should overcome a barrier energy. The barrier energy is determined by (34) and the is modified as (35)
The evolution equation for the damage parameter follows the Allen-Cahn equation (36) where and .The is scaled by the which is consistent with the definition given by Miehe at.al Miehe et al. (2015).
This equation follows the standard Allen-Cahn and thus can be implemented in MOOSE using the standard Allen-Cahn kernels, TimeDerivative, AllenCahn, and ACInterface. There is now an action that automatically generates these kernels: NonconservedAction. See the PhaseField module documentation for more information.
## Example Input File Syntax
[./damage_stress]
type = ComputeLinearElasticPFFractureStress
c = c
E_name = 'elastic_energy'
F_name = 'local_fracture_energy'
decomposition_type = strain_spectral
[../]
(modules/combined/test/tests/phase_field_fracture/crack2d_iso.i)
## Input Parameters
• cName of damage variable
C++ Type:std::vector
Options:
Description:Name of damage variable
### Required Parameters
C++ Type:MaterialPropertyName
Options:
Description:Name of material property for energetic degradation function.
• 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.
• 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
Options:
Description:Optional parameter that allows the user to define multiple mechanics material systems on the same block, i.e. for multiple phases
• F_namelocal_fracture_energyName of material property for local fracture energy function.
Default:local_fracture_energy
C++ Type:MaterialPropertyName
Options:
Description:Name of material property for local fracture energy function.
• decomposition_typenoneDecomposition approaches. Choices are: strain_spectral strain_vol_dev stress_spectral none
Default:none
C++ Type:MooseEnum
Options:strain_spectral strain_vol_dev stress_spectral none
Description:Decomposition approaches. Choices are: strain_spectral strain_vol_dev stress_spectral none
• barrier_energyName of material property for fracture energy barrier.
C++ Type:MaterialPropertyName
Options:
Description:Name of material property for fracture energy barrier.
• E_nameelastic_energyName of material property for elastic energy
Default:elastic_energy
C++ Type:MaterialPropertyName
Options:
Description:Name of material property for elastic energy
• 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
• use_current_history_variableFalseUse the current value of the history variable.
Default:False
C++ Type:bool
Options:
Description:Use the current value of the history variable.
• 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
• 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
### Outputs Parameters
• 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.
• enableTrueSet the enabled status of the MooseObject.
Default:True
C++ Type:bool
Options:
Description:Set the enabled status of the MooseObject.
• 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
| 2019-02-21T03:22:18 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 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.6378910541534424, "perplexity": 3918.1304655948466}, "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/1550247499009.48/warc/CC-MAIN-20190221031117-20190221053117-00196.warc.gz"}
|
https://mooseframework.inl.gov/python/MooseDocs/extensions/command.html
|
# Command Extension
The command extension does not add any functionality directly; however, it provides the mechanism for which a majority of the existing extensions are built upon. Therefore, all custom commands follow the same basic structure and automatically have two forms and inline and block form.
## Inline Command Format
!command subcommand key=value key2=value with spaces
key3=value3
Some content that is optional, but if used continues
until the first empty line.
## Block Command Format
!command! subcommand key=value key2=value with space
key3=value3
Content that is optional, but if used
can include empty lines.
The content ends with the "end" version
of the command.
!command-end!
| 2019-04-23T06:34:37 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 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.6415062546730042, "perplexity": 8950.69329946346}, "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/1555578593360.66/warc/CC-MAIN-20190423054942-20190423080942-00360.warc.gz"}
|
https://linkeddata.tern.org.au/viewer/tern/id/http://linked.data.gov.au/def/tern-cv/6cb72e53fa60e47eef9e9c23e1849668c4b155a0a3864fd88ce076cf86d16b1b
|
# surface net downward radiative flux
URI: http://linked.data.gov.au/def/tern-cv/6cb72e53fa60e47eef9e9c23e1849668c4b155a0a3864fd88ce076cf86d16b1b
Also known as surface_net_downward_radiative_flux
Date created: 2007-07-17
Date modified: 2022-06-10
Parameter Type
##### Definition
The surface called "surface" means the lower boundary of the atmosphere. "Downward" indicates a vector component which is positive when directed downward (negative upward). Net downward radiation is the difference between radiation from above (downwelling) and radiation from below (upwelling). Radiative flux is the sum of shortwave and longwave radiative fluxes. In accordance with common usage in geophysical disciplines, "flux" implies per unit area, called "flux density" in physics.
##### source
http://vocab.nerc.ac.uk/collection/P07/current/
##### notation
surface_net_downward_radiative_flux
##### note
This concept was harvested from the controlled vocabulary at http://vocab.nerc.ac.uk/collection/P07/current/ on 2022-06-10. Information was pulled as-is for the following properties: dcterms:created, skos:definition, skos:exactMatch, skos:related and skos:notation. The URI of the concept is generated using SHA256 on the CF standard name (in the skos:notation) and concatenated with the TERN controlled vocabularies' base URI (http://linked.data.gov.au/def/tern-cv/).
##### related
http://vocab.nerc.ac.uk/collection/P06/current/UFAA/
TERN is supported by the Australian Government through the National Collaborative Research Infrastructure Strategy, NCRIS.
| 2022-08-15T22:51: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": 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.6192346811294556, "perplexity": 10180.049260278409}, "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-2022-33/segments/1659882572212.96/warc/CC-MAIN-20220815205848-20220815235848-00653.warc.gz"}
|
https://docs.dea.ga.gov.au/notebooks/DEA_datasets/DEA_Waterbodies.html
|
# Introduction to DEA Waterbodies ¶
• **Sign up to the DEA Sandbox** to run this notebook interactively from a browser
• Compatibility: Notebook currently compatible with both the NCI and DEA Sandbox environments
• Products used: DEA Waterbodies
## Background¶
It is important to have up-to-date information about the extent and location of surface water in Australia. It provides us with a common understanding of this valuable and increasingly scarce resource.
### What this product offers¶
DEA Waterbodies uses Geoscience Australia’s archive of over 30 years of Landsat satellite imagery to identify where almost 300,000 waterbodies are in the Australian landscape and tells us the wet surface area within those waterbodies.
The tool uses a water classification for every available Landsat satellite image and maps the locations of waterbodies across Australia. It provides a time series of wet surface area for waterbodies that are present more than 10% of the time and are larger than 3125 m$$^2$$ (5 Landsat pixels).
The tool indicates changes in the wet surface area of waterbodies. This can be used to identify when waterbodies are increasing or decreasing in wet surface area.
Disclaimer: DEA Waterbody graphs show the wet surface area of waterbodies as estimated from satellites. They do not show depth, volume, purpose of the waterbody, nor the source of the water.
The product contains polygons of maximum extent and surface area time series for each waterbody. These waterbodies have been derived from Water Observations from Space, a classifier which detects open water in Landsat pixels.
### Applications¶
• Understand and manage water across Australia
• Gain insights into the severity and spatial distribution of drought
• Identify potential water sources for aerial firefighting during bushfires
### Publications¶
• Krause, C. et al. (in preparation)
• Mueller, N., Lewis, A., Roberts, D., Ring, S., Melrose, R., Sixsmith, J., Lymburner, L., McIntyre, A., Tan, P., Curnow, S., & Ip, A. (2016). Water observations from space: Mapping surface water from 25 years of Landsat imagery across Australia. Remote Sensing of Environment, 174, 341–352. https://doi.org/10.1016/j.rse.2015.11.003
Note: For more technical information about DEA Waterbodies, visit the official Geoscience Australia DEA Waterbodies product description.
## Description¶
This notebook will demonstrate how to load data from DEA Waterbodies using the scripts in this repository. Topics covered include:
1. Getting a list of available polygons in an area
2. Accessing a polygon
3. Plotting the surface area of the polygon over time
## Getting started¶
To run this analysis, run all the cells in the notebook, starting with the “Load packages” cell.
Import Python packages that are used for the analysis.
[1]:
import sys
import matplotlib.pyplot as plt
sys.path.append("../Scripts")
from dea_plotting import display_map
import dea_waterbodies
## Analysis parameters¶
Choose an area to analyse:
[2]:
xlim = (149.05, 149.19)
ylim = (-35.21, -35.33)
# Preview area on a map
display_map(xlim, ylim)
[2]:
## Getting data¶
Every waterbody in DEA Waterbodies has a unique identifier called a *geohash*. The geohash of a waterbody is derived from their position, and this process can be reversed to obtain the location from the geohash. You can also get the geohash for a waterbody from DEA Maps by clicking on a waterbody. It’s the “waterbody identifier” in this screenshot:
| 2020-12-03T09:49:58 |
{"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": 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.2519221007823944, "perplexity": 8080.455183595176}, "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/1606141727627.70/warc/CC-MAIN-20201203094119-20201203124119-00583.warc.gz"}
|
https://pos.sissa.it/307/008/
|
Volume 307 - XVII International Workshop on Neutrino Telescopes (NEUTEL2017) - Session ii - convener: chiara sirignano – neutrino oscillations (1)
New Results from the Daya Bay Reactor Neutrino Experiment
D. Naumov* on behalf of the Daya Bay collaboration
*corresponding author
Full text: pdf
Pre-published on: 2018 March 28
Published on: 2018 April 05
Abstract
Some recent results obtained by Daya Bay Collaboration and presented at Neutrino Telescopes 2017 are briefly reviewed.
The most precise measurement of neutrino mixing $\sin^2 2 \theta_{13} =0.0841\pm0.0027\textrm{ (stat.) }\pm0.0019\textrm{ (syst.) }$ and mass squared difference
$\left|{\Delta}m^2_{\mathrm{ee}}\right| =\left[2.50\pm0.06\textrm{ (stat.) }\pm0.06\textrm{ (syst.) }\right]\times 10^{-3}\,\mathrm{eV}^2$ was obtained using nGd data set. These results agree with an independent analysis of nH data sample.
The data was analized also within the model of neutrino wave packet. For the first time an upper limit on the intrinsic relative dispersion of neutrino momentum \UpperLimit{} at a 95\% C.L. was obtained. The allowed decoherence effect due to the wave packet nature of neutrino oscillation is found to be insignificant for reactor antineutrinos detected by the Daya Bay experiment thus ensuring an unbiased measurement of the oscillation parameters $\sin^22\theta_{13}$ and $\Delta m^2_{32}$ within the plane wave model.
The flux of reactor $\overline{\nu}_e$ was measured and found to be in agreement with old reactor experiments observing $\overline{\nu}_e$ flux smaller than expectation in Huber+Muller model. Comparing observed and predicted energy spectra we find an almost flat deficit of measured events for $E_\nu<5$ MeV and an agreement with the Huber+Muller model for $5.5 \textrm{ MeV}\lesssim E_\nu\lesssim 6.5$ MeV.
A possible hypothesis of the observed flux deficit invokes $\overline{\nu}_e$ oscillation into a sterile state. This hypothesis was excluded for a large range of $\Delta m^2_{41}$. A combined analysis of Daya Bay, Bugey-3 and MINOS data excludes most of the allowed by LSND and MiniBooNE experiments sterile-neutrino phase space for $\Delta m^2_{41}<0.8$ eV${}^2$ at 90\% C.L.
DOI: https://doi.org/10.22323/1.307.0008
Open Access
Copyright owned by the author(s) under the term of the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
| 2020-06-01T19:50: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": 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.5575685501098633, "perplexity": 3004.0352741516417}, "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-2020-24/segments/1590347419593.76/warc/CC-MAIN-20200601180335-20200601210335-00227.warc.gz"}
|
http://w3.pppl.gov/~hammett/comp/tex/latex-tips.html
|
## LaTeX Tips
Other Assorted LaTeX Tips:
%%%%%%%%%%%%%
{\huge \bf
\begin{center}
Here is the\\
Title
\end{center}
}
%%%%%%%%%%%%%
The above does what you want. The following doesn't (the center command
doesn't know to set the line spacing larger for a \huge font, and the \bf
gets ignored because it is before the font size command).
%%%%%%%%%%%%%
\begin{center}
{\bf \huge
Here is the\\
Title
}
\end{center}
%%%%%%%%%%%%%
Spacing after macros can sometimes get confusing. "%" at the end of a line
will suppress any white space at the beginning of the next line. Following
a macro name with {} will suppress white space after it, i.e., \latex{}2.0
to eliminate any space between \latex and 2.0. The xspace.sty utility is
supposed to automate this?
%%%%%%%%%%%%%%%%%%%
To make pdf files that use good quality outline fonts for display on web
pages (and avoid previous problems with grainy bitmap fonts), do:
latex paper
dvips -Pwww paper
ps2pdf paper.ps
The key is the "-Pwww" switch above.
In most TeX distributions (like tetex), the default paper size for dvips is the European a4 size. To change the default paper size to US Letter (8.5in x 11in), download the file dvipsrc, rename it to .dvipsrc and put it your home directory (if you are using a unix/linux machine).
You can also use the texconfig command to set the default paper size for all users on your computer, but that requires you to have root privileges.
| 2018-01-21T22:18: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": 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.924369215965271, "perplexity": 6510.497714703517}, "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-05/segments/1516084890893.58/warc/CC-MAIN-20180121214857-20180121234857-00109.warc.gz"}
|
https://wiki.bnl.gov/eic/index.php/IntrinsicKtDetails
|
# IntrinsicKtDetails
This is a more complete version of Detector_Design_Requirements#Measuring_Intrinsic_kT.
Contact person: Mark Baker and Elke Aschenauer
## The Physics Idea
The intrinsic kT parameter in programs like LEPTO and PYTHIA was originally intended to "take into account the motion of the quarks inside the original hadron". Consider an ep collision in the hadronic center-of-mass system (HCMS) with the positive z-axis as the γ* direction and the negative z-axis as the proton direction. To leading order, the struck parton will have a pT equal to the intrinsic kT and the target remnant jet will have an equal and opposite (2-vector) recoil kT. Effectively, there will be a two jet system rotated by an angle arctan(2kT/W). After fragmentation, the impact of the intrinsic kT is to increase the pT for high |xF| compared to xF near 0. This can be seen in the next plot which shows the "seagull plot", <p2T> vs. xF, for three different values of intrinsic kT for two different programs all for 15x100 GeV ep and for 30x250 GeV ep. The biggest pT and biggest difference is at high |xF| and especially at negative xF. The other advantages to negative xF compared to positive are that the model dependence is much smaller for negative xF and the beam energy dependence is much smaller as well. Essentially, the negative xF region is just significantly less sensitive to the effects of QCD and is more reflective of the initial parton intrinsic kT.
15 GeV x 100 GeV Seagull Overlay 30 GeV x 250 GeV Seagull Overlay
Of course we don't just have to rely on seagull plots (moments of pT); we have more information if we look at the spectra themselves. The plots below contain the spectra for positively charged particles for ep 15x100 GeV for 3 different intrinsic kT values: 0.44, 0.88, 1.3 GeV and for two models: LEPTO-PHI and PYTHIA (EIC-modified version) for an ideal detector given in bins of x-Feynman.
-1.0 < xf < -0.95 -0.95 < xf < -0.90 -0.90 < xf < -0.85 -0.85 < xf < -0.80 -0.80 < xf < -0.75 -0.75 < xf < -0.70 -0.70 < xf < -0.65 -0.65 < xf < -0.60 -0.60 < xf < -0.55 -0.55 < xf < -0.50 -0.50 < xf < -0.45 -0.45 < xf < -0.40 -0.40 < xf < -0.35 -0.35 < xf < -0.30 -0.30 < xf < -0.25 -0.25 < xf < -0.20 -0.20 < xf < -0.15 -0.15 < xf < -0.10 -0.10 < xf < -0.05 -0.05 < xf < 0.0 0.0 < xf < +0.05 +0.05 < xf < +0.10 +0.10 < xf < +0.15 +0.15 < xf < +0.20 +0.20 < xf < +0.25 +0.25 < xf < +0.30 +0.30 < xf < +0.35 +0.35 < xf < +0.40 +0.40 < xf < +0.55 +0.45 < xf < +0.60 +0.50 < xf < +0.55 +0.55 < xf < +0.60 +0.60 < xf < +0.65 +0.65 < xf < +0.70 +0.70 < xf < +0.75 +0.75 < xf < +0.80 +0.80 < xf < +0.85 +0.85 < xf < +0.90 +0.90 < xf < +0.95
In order to focus the discussion, let's choose a few representative xF bins (counting from 1). Bin 5 (-0.80<xF<-0.75) has the largest model-independent discrimination between the 3 values of intrinsic kT. Bin 11 (-0.50<xF<-0.45) still has a good discrimination but tends to have better acceptance for non-ideal detectors. Bin 8 (-0.65<xF<-0.60) was chosen because it's intermediate between bins 5 & 11. Finally, bin 30 (+0.45<xF<+0.50) was chosen because it's the mirror image of bin 11 and because it has among the best discrimination for the positive x-Feynman bins, so it's the fairest comparison.
The plots below compare LEPTOPHI & PYTHIA for 3 intrinsic kT values for ep, but as spectra in the four regions: -0.80<xF<-0.75, -0.65<xF<-0.60, -0.50<xF<-0.45 and 0.45<xF<0.50 for two different sets of beam energies (15x100 GeV and 30x250 GeV). Note that all of the negative-xF bins show a clean distinction between different values of intrinsic kT with minimal model dependence. In contrast the positive xF bin is much more difficult to disentangle.
15 GeV x 100 GeV ep -0.80 < xf < -0.75 15 GeV x 100 GeV ep -0.65 < xf < -0.60 15 GeV x 100 GeV ep -0.50 < xf < -0.45 15 GeV x 100 GeV ep +0.45 < xf < +0.50
30 GeV x 250 GeV ep -0.80 < xf < -0.75 30 GeV x 250 GeV ep -0.65 < xf < -0.60 30 GeV x 250 GeV ep -0.50 < xf < -0.45 30 GeV x 250 GeV ep +0.45 < xf < +0.50
The reason for this has to do with basic physics of QCD. The impact of higher order (hard) QCD diagrams and of final state parton showering (soft QCD) is to add extra sources of pT for xF>0 and near 0, with very little impact for xF<-0.3. This is because it is the struck quark or gluon which radiates. The impact of initial state parton showering is less obvious, but kinematically, it turns out that it also primarily adds pT for non-negative xF. This means that the target remnant jet recoil may have the better "memory" of the original intrinsic kT. This is illustrated in the figure below which shows LEPTO-PHI for the standard intrinsic kT value of 0.44 GeV (rms) and 4 different modes of QCD: QCD on (standard), pQCD but no Parton Shower, Parton Shower but now hard pQCD, no QCD at all (just LO no parton shower). Clearly the impact of QCD (including the strong beam energy dependence) is all in the current jet hemisphere of the HCMS (xF>0). Intrinsic kT shows up and is cleanest for xF<-0.3.
15 GeV x 100 GeV QCD Overlay 30 GeV x 250 GeV QCD Overlay
The plots below compare the three different intrinsic kT values for ep, for the same four modes of QCD shown above, but as spectra in the four xF regions for two different sets of beam energies (15x100 GeV and 30x250 GeV). Looking at the plots we see that all of the negative-xF bins are nearly independent of QCD effects and show a clean distinction between different values of intrinsic kT. And, again, the positive xF bin is much more difficult to disentangle.
15 GeV x 100 GeV ep -0.80 < xf < -0.75 15 GeV x 100 GeV ep -0.65 < xf < -0.60 15 GeV x 100 GeV ep -0.50 < xf < -0.45 15 GeV x 100 GeV ep +0.45 < xf < +0.50
30 GeV x 250 GeV ep -0.80 < xf < -0.75 30 GeV x 250 GeV ep -0.65 < xf < -0.60 30 GeV x 250 GeV ep -0.50 < xf < -0.45 30 GeV x 250 GeV ep +0.45 < xf < +0.50
In practice, the target remnant jet in ep and the target remnants (high ${\displaystyle |x_{F}|}$ particles) in pp are often not measured, and rarely correlated with the particles more directly involved in the hard scattering. This means that you can crank up the intrinsic kT parameter in PYTHIA, say, and increase the intrinsic pT of most particles while ignoring the presumably non-physical effect of very high target remnant recoil. If you only compare PYTHIA to mid-rapidity in pp and the current jet region in ep, you cannot easily distinguish between the effects of higher order QCD (or parton showers) vs. intrinsic kT. So, as the PYTHIA manual says "any shortfall in shower activity ... has to be compensated by the primordial kT source, which thereby largely loses its original meaning."
Turning this around, if we have substantial acceptance of the target jet in the hadronic center-of-mass frame (negative x-Feynman particles, especially xF<-0.3), we CAN distinguish intrinsic kT from collision QCD effects - and we can keep the model-builders honest. More details about this idea can be found at http://skipper.physics.sunysb.edu/~abhay/2014/EICUM/Talks/06262014-PM//3_Baker.pdf.
## Defining the Fiducial Acceptance
There are two fundamentally different kind of acceptance gaps to consider in the lab frame: azimuthal gaps and polar angle (θ or equivalently η). The easiest one is the case of partial azimuthal acceptance in the lab frame. If we are considering unpolarized (or polarization averaged) ep collisions, and simple single-particle measurements (not two-particle correlations), then all observables should, on average, be azimuthally symmetric and this type of acceptance gap only affects the statistics, not the overall result. It is much easier to correct for than the gaps in η.
The Roman Pot stations themselves are nearly azimuthally symmetric, but they will be located after the DX beam-bending magnet in the forward going (proton beam) direction and that introduces a significant asymmetry. In order to hit the Roman Pots, the forward-going (p-direction) particles from the collision must first pass through the DX bending magnet. In order to make it, they have to be positively charged and have a momentum of at least about 30% of the beam momentum (technically beam momentum/charge) and a polar angle θ<14mr. If they have a non-zero θ angle (but still less than about 14 mr) then they will have a better chance of making it if the lab angle φ is such that it opposes the DX magnet kick. In this case, the DX magnet will kick it back into the acceptance. This introduces a significant, but completely predictable, azimuthal asymmetry. J.H. Lee simulated this effect. See for example some of his talks: [1] or [2]. His result (rescaled for a 100 GeV beam) is shown below on the left. This plot shows the fractional acceptance ranging from 0 to 1 for bins of θ and p in the lab, where θ=0 is the proton beam direction. For use in our simulations, we interpolated to fill in some 0/0 gaps in the histogram and cleaned up the edges. The result is shown on the right.
Roman Pot Acceptance 100 GeV beam (J.H. Lee) Smoothed Roman Pot Acceptance 100 GeV beam
In most of cases in the above plot where the acceptance is neither 0 or 1, the acceptance is really a fractional azimuthal acceptance - for certain φ angles, the acceptance is near 1 while for others it is near 0. For particles with momentum greater than about 84% of the beam momentum and θ<3.5 mr, there is an additional hole in the acceptance. The proton beam itself is at p=100 GeV and θ=0. Particles which are too close to the beam in momentum space don't reach the inner edge of the Roman Pot detector which is placed far enough from the beam to avoid direct contact.
The following set of plots shows, as an example, the stages that we progress through to determine the fiducial acceptance mask for positively charged particles in the region -5.0 < η < +5.0 or in the Roman Pots for 15x100 GeV ep. We first consider the Roman Pots and apply an azimuthal acceptance correction for those regions of lab p, θ that have a φ acceptance of at least 40 mr. Then we mapped the azimuthally-corrected Roman Pot and the main detector acceptances to (xF,pT). The first (leftmost) plot below shows the fractional acceptance (ranging from 0-1) in (xF,pT) before the azimuthal correction, while the second plot shows the acceptance after the correction. Note: we removed the region for xF>0.95 to avoid low statistics. Any part of the azimuthally-corrected acceptance with a coverage of at least 25% was considered measurable. The third plot is the Fiducial Mask plot, which flags as 1 (red) any bin which is measurable and 0 (white) any bin which is not. Note: we tightened the xF cut to xF<0.9, some 0/0 bins have been interpolated. The last (rightmost) plot shows the fiducially masked acceptance. It is the product of the first and third plots and represents the actual (not azimuthally corrected) acceptance for those regions which are considered measurable.
Fractional Acceptance 5<η<+5 + Roman Pots ep 15x100 GeV Fractional Acceptance 5<η<+5 w/ Azimuthally Corrected Roman Pots ep 15x100 GeV Fiducial Mask plot 5<η<+5 + Roman Pots ep 15x100 GeV Fiducial Masked Acceptance plot 5<η<+5 + Roman Pots ep 15x100 GeV
## The Impact of Imperfect Detector Acceptance
Let's consider a variety of detector acceptances and a variety of xF bins and compare the spectra for positively charged particles for the three intrinsic kT values for the two models for 15x100 GeV ep.
ep 15x100 GeV -0.80 < xF < -0.75 -0.65 < xF < -0.60 -0.50 < xF < -0.45 +0.45 < xF < +0.50
-5.4 < eta < +5.4 w/ RP
15 GeV x 100 GeV ep, -0.80 < xf < -0.75, -5.4 < eta < +5.4 w/ RP
15 GeV x 100 GeV ep, -0.65 < xf < -0.60, -5.4 < eta < +5.4 w/ RP
15 GeV x 100 GeV ep, -0.50 < xf < -0.45, -5.4 < eta < +5.4 w/ RP
15 GeV x 100 GeV ep, +0.45 < xf < +0.50, -5.4 < eta < +5.4 w/ RP
-5.0 < eta < +5.0 w/ RP
15 GeV x 100 GeV ep, -0.80 < xf < -0.75, -5.0 < eta < +5.0 w/ RP
15 GeV x 100 GeV ep, -0.65 < xf < -0.60, -5.0 < eta < +5.0 w/ RP
15 GeV x 100 GeV ep, -0.50 < xf < -0.45, -5.0 < eta < +5.0 w/ RP
15 GeV x 100 GeV ep, +0.45 < xf < +0.50, -5.0 < eta < +5.0 w/ RP
-4.75 < eta < +4.75 w/ RP
15 GeV x 100 GeV ep, -0.80 < xf < -0.75, -4.75 < eta < +4.75 w/ RP
15 GeV x 100 GeV ep, -0.65 < xf < -0.60, -4.75 < eta < +4.75 w/ RP
15 GeV x 100 GeV ep, -0.50 < xf < -0.45, -4.75 < eta < +4.75 w/ RP
15 GeV x 100 GeV ep, +0.45 < xf < +0.50, -4.75 < eta < +4.75 w/ RP
-4.5 < eta < +4.5 w/ RP
15 GeV x 100 GeV ep, -0.80 < xf < -0.75, -4.5 < eta < +4.5 w/ RP
15 GeV x 100 GeV ep, -0.65 < xf < -0.60, -4.5 < eta < +4.5 w/ RP
15 GeV x 100 GeV ep, -0.50 < xf < -0.45, -4.5 < eta < +4.5 w/ RP
15 GeV x 100 GeV ep, +0.45 < xf < +0.50, -4.5 < eta < +4.5 w/ RP
-3.0 < eta < +4.0 w/ RP
15 GeV x 100 GeV ep, -0.80 < xf < -0.75, -3.0 < eta < +4.0 w/ RP
15 GeV x 100 GeV ep, -0.65 < xf < -0.60, -3.0 < eta < +4.0 w/ RP
15 GeV x 100 GeV ep, -0.50 < xf < -0.45, -3.0 < eta < +4.0 w/ RP
15 GeV x 100 GeV ep, +0.45 < xf < +0.50, -3.0 < eta < +4.0 w/ RP
-3.0 < eta < +4.0 NO RP
15 GeV x 100 GeV ep, -0.80 < xf < -0.75, -3.0 < eta < +4.0 no RP
15 GeV x 100 GeV ep, -0.65 < xf < -0.60, -3.0 < eta < +4.0 no RP
15 GeV x 100 GeV ep, -0.50 < xf < -0.45, -3.0 < eta < +4.0 no RP
15 GeV x 100 GeV ep, +0.45 < xf < +0.50, -3.0 < eta < +4.0 no RP
-3.0 < eta < +5.0 NO RP
15 GeV x 100 GeV ep, -0.80 < xf < -0.75, -3.0 < eta < +5.0 no RP
15 GeV x 100 GeV ep, -0.65 < xf < -0.60, -3.0 < eta < +5.0 no RP
15 GeV x 100 GeV ep, -0.50 < xf < -0.45, -3.0 < eta < +5.0 no RP
15 GeV x 100 GeV ep, +0.45 < xf < +0.50, -3.0 < eta < +5.0 no RP
Looking at the above plots, we can see:
• An excellent measurement with the first two cases: |η|<5.4 w/ RP and |η|<5.0 w/ RP. Note: the optimized ePHENIX (-3.0<η<5.0 w/ RP) would look identical to the |η|<5.0 w/ RP case.
• A solid measurement with the next two cases: |η|<4.75 w/ RP and |η|<4.5 w/ RP
• A poor measurement with the next case: -3.0<η<4.0 w/ RP (default ePHENIX + RP). Note BeAST with |η|<4.0 w/ RP would look identical.
• No measurement at all with default ePHENIX: -3.0<η<4.0 w/o RP
• A tail-only measurement with an improved ePHENIX, but no RP: -3.0<η<5.0 w/o RP.
If at all possible, we should avoid tail-only measurements since the tail of the pT distribution will be much more model dependent than one which includes the peak for two reasons: 1. If the kT distribution itself isn't Gaussian, it can be difficult to interpret the overall intrinsic kT distribution just from the tail. 2. If there are any residual higher order QCD effects in the target jet, they very well may show up as tails in the pT distribution for negative xF.
The message is that a measurement with Roman Pots and with charged particle measurement out to at least η of 4.5 is important to make this measurement.
From a physics point of view, any plot in terms of HCMS variables like xF and pT should be the same for 15x100 or 30x50 GeV ep because they have the same ${\displaystyle {\sqrt {s}}}$. However, the acceptance could be quite different, and in particular, in the 30x50 GeV case, the target jet is not quite as far forward in the laboratory. So below, we repeat the set of detector acceptances and the set of xF bins and compare the spectra for positively charged particles for the three intrinsic kT values for the two models for 30x50 GeV ep.
ep 30x50 GeV -0.80 < xF < -0.75 -0.65 < xF < -0.60 -0.50 < xF < -0.45 +0.45 < xF < +0.50
-5.4 < eta < +5.4 w/ RP
30 GeV x 50 GeV ep, -0.80 < xf < -0.75, -5.4 < eta < +5.4 w/ RP
30 GeV x 50 GeV ep, -0.65 < xf < -0.60, -5.4 < eta < +5.4 w/ RP
30 GeV x 50 GeV ep, -0.50 < xf < -0.45, -5.4 < eta < +5.4 w/ RP
30 GeV x 50 GeV ep, +0.45 < xf < +0.50, -5.4 < eta < +5.4 w/ RP
-5.0 < eta < +5.0 w/ RP
30 GeV x 50 GeV ep, -0.80 < xf < -0.75, -5.0 < eta < +5.0 w/ RP
30 GeV x 50 GeV ep, -0.65 < xf < -0.60, -5.0 < eta < +5.0 w/ RP
30 GeV x 50 GeV ep, -0.50 < xf < -0.45, -5.0 < eta < +5.0 w/ RP
30 GeV x 50 GeV ep, +0.45 < xf < +0.50, -5.0 < eta < +5.0 w/ RP
-4.75 < eta < +4.75 w/ RP
30 GeV x 50 GeV ep, -0.80 < xf < -0.75, -4.75 < eta < +4.75 w/ RP
30 GeV x 50 GeV ep, -0.65 < xf < -0.60, -4.75 < eta < +4.75 w/ RP
30 GeV x 50 GeV ep, -0.50 < xf < -0.45, -4.75 < eta < +4.75 w/ RP
30 GeV x 50 GeV ep, +0.45 < xf < +0.50, -4.75 < eta < +4.75 w/ RP
-4.5 < eta < +4.5 w/ RP
30 GeV x 50 GeV ep, -0.80 < xf < -0.75, -4.5 < eta < +4.5 w/ RP
30 GeV x 50 GeV ep, -0.65 < xf < -0.60, -4.5 < eta < +4.5 w/ RP
30 GeV x 50 GeV ep, -0.50 < xf < -0.45, -4.5 < eta < +4.5 w/ RP
30 GeV x 50 GeV ep, +0.45 < xf < +0.50, -4.5 < eta < +4.5 w/ RP
-3.0 < eta < +4.0 w/ RP
30 GeV x 50 GeV ep, -0.80 < xf < -0.75, -3.0 < eta < +4.0 w/ RP
30 GeV x 50 GeV ep, -0.65 < xf < -0.60, -3.0 < eta < +4.0 w/ RP
30 GeV x 50 GeV ep, -0.50 < xf < -0.45, -3.0 < eta < +4.0 w/ RP
30 GeV x 50 GeV ep, +0.45 < xf < +0.50, -3.0 < eta < +4.0 w/ RP
-3.0 < eta < +4.0 NO RP
30 GeV x 50 GeV ep, -0.80 < xf < -0.75, -3.0 < eta < +4.0 no RP
30 GeV x 50 GeV ep, -0.65 < xf < -0.60, -3.0 < eta < +4.0 no RP
30 GeV x 50 GeV ep, -0.50 < xf < -0.45, -3.0 < eta < +4.0 no RP
30 GeV x 50 GeV ep, +0.45 < xf < +0.50, -3.0 < eta < +4.0 no RP
-3.0 < eta < +5.0 NO RP
30 GeV x 50 GeV ep, -0.80 < xf < -0.75, -3.0 < eta < +5.0 no RP
30 GeV x 50 GeV ep, -0.65 < xf < -0.60, -3.0 < eta < +5.0 no RP
30 GeV x 50 GeV ep, -0.50 < xf < -0.45, -3.0 < eta < +5.0 no RP
30 GeV x 50 GeV ep, +0.45 < xf < +0.50, -3.0 < eta < +5.0 no RP
Looking at the above plots for 30x50 GeV, we see that this energy setting is more forgiving than the 15x100 setting, primarily because the target jet is not quite as far forward (along the proton beam direction) in the lab frame.
• An excellent measurement with the first three cases: |η|<5.4 w/ RP, |η|<5.0 w/ RP and |η|<4.75 w/ RP.
• A solid measurement with |η|<4.5 w/ RP.
• A borderline measurement with the next case: -3.0<η<4.0 w/ RP (default ePHENIX + RP). This measurement is missing the peak of the distribution, but is a significant improvement over the 15x100 version.
• A tail-only measurement with default ePHENIX: -3.0<η<4.0 w/o RP. This is a significant improvement over the 15x100 version.
• A good measurement with an improved ePHENIX, but no RP: -3.0<η<5.0 w/o RP. Again a very big improvement over the 15x100 version.
Finally, let's look at the set of detector acceptances and xF bins and compare the spectra for positively charged particles for the three intrinsic kT values for the two models for 30x250 GeV ep. In this case, the target jet is focused even more far forward and the Roman Pot acceptance becomes even more important.
ep 30x250 GeV -0.80 < xF < -0.75 -0.65 < xF < -0.60 -0.50 < xF < -0.45 +0.45 < xF < +0.50
-5.4 < eta < +5.4 w/ RP
30 GeV x 250 GeV ep, -0.80 < xf < -0.75, -5.4 < eta < +5.4 w/ RP
30 GeV x 250 GeV ep, -0.65 < xf < -0.60, -5.4 < eta < +5.4 w/ RP
30 GeV x 250 GeV ep, -0.50 < xf < -0.45, -5.4 < eta < +5.4 w/ RP
30 GeV x 250 GeV ep, +0.45 < xf < +0.50, -5.4 < eta < +5.4 w/ RP
-5.0 < eta < +5.0 w/ RP
30 GeV x 250 GeV ep, -0.80 < xf < -0.75, -5.0 < eta < +5.0 w/ RP
30 GeV x 250 GeV ep, -0.65 < xf < -0.60, -5.0 < eta < +5.0 w/ RP
30 GeV x 250 GeV ep, -0.50 < xf < -0.45, -5.0 < eta < +5.0 w/ RP
30 GeV x 250 GeV ep, +0.45 < xf < +0.50, -5.0 < eta < +5.0 w/ RP
-4.75 < eta < +4.75 w/ RP
30 GeV x 250 GeV ep, -0.80 < xf < -0.75, -4.75 < eta < +4.75 w/ RP
30 GeV x 250 GeV ep, -0.65 < xf < -0.60, -4.75 < eta < +4.75 w/ RP
30 GeV x 250 GeV ep, -0.50 < xf < -0.45, -4.75 < eta < +4.75 w/ RP
30 GeV x 250 GeV ep, +0.45 < xf < +0.50, -4.75 < eta < +4.75 w/ RP
-4.5 < eta < +4.5 w/ RP
30 GeV x 250 GeV ep, -0.80 < xf < -0.75, -4.5 < eta < +4.5 w/ RP
30 GeV x 250 GeV ep, -0.65 < xf < -0.60, -4.5 < eta < +4.5 w/ RP
30 GeV x 250 GeV ep, -0.50 < xf < -0.45, -4.5 < eta < +4.5 w/ RP
30 GeV x 250 GeV ep, +0.45 < xf < +0.50, -4.5 < eta < +4.5 w/ RP
-3.0 < eta < +4.0 w/ RP
30 GeV x 250 GeV ep, -0.80 < xf < -0.75, -3.0 < eta < +4.0 w/ RP
30 GeV x 250 GeV ep, -0.65 < xf < -0.60, -3.0 < eta < +4.0 w/ RP
30 GeV x 250 GeV ep, -0.50 < xf < -0.45, -3.0 < eta < +4.0 w/ RP
30 GeV x 250 GeV ep, +0.45 < xf < +0.50, -3.0 < eta < +4.0 w/ RP
-3.0 < eta < +4.0 NO RP
30 GeV x 250 GeV ep, -0.80 < xf < -0.75, -3.0 < eta < +4.0 no RP
30 GeV x 250 GeV ep, -0.65 < xf < -0.60, -3.0 < eta < +4.0 no RP
30 GeV x 250 GeV ep, -0.50 < xf < -0.45, -3.0 < eta < +4.0 no RP
30 GeV x 250 GeV ep, +0.45 < xf < +0.50, -3.0 < eta < +4.0 no RP
-3.0 < eta < +5.0 NO RP
30 GeV x 250 GeV ep, -0.80 < xf < -0.75, -3.0 < eta < +5.0 no RP
30 GeV x 250 GeV ep, -0.65 < xf < -0.60, -3.0 < eta < +5.0 no RP
30 GeV x 250 GeV ep, -0.50 < xf < -0.45, -3.0 < eta < +5.0 no RP
30 GeV x 250 GeV ep, +0.45 < xf < +0.50, -3.0 < eta < +5.0 no RP
Looking at the above plots for 30x250 GeV, we see that this energy setting puts the target jet even more forward in the lab frame, making the Roman Pots necessary and to a large extent sufficient for this measurement. We have:
• Again an excellent measurement with the first two cases: |η|<5.4 w/ RP and |η|<5.0 w/ RP.
• A solid, but tailless measurement for any other case including the Roman Pots.
• No measurement with default ePHENIX: -3.0<η<4.0 w/o RP.
• A very poor tail-only measurement with an improved ePHENIX, but no RP: -3.0<η<5.0 w/o RP.
The tailless (Roman Pot only) measurement is a very solid measurement of the bulk of the intrinsic kT distribution, and a big improvement over a tail-only measurement. It is better to have a more complete measurement so that we can see possible effects of non-Gaussian tails to the kT and/or residual higher order QCD effects as well as the basic kT.
| 2022-07-06T17:13:39 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 2, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.9322524070739746, "perplexity": 11731.68003725771}, "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/1656104675818.94/warc/CC-MAIN-20220706151618-20220706181618-00532.warc.gz"}
|
http://pdglive.lbl.gov/Reviews.action;jsessionid=6816A4319733E87C7AA3D0F7F88E1C88?section=GXXX005
|
# Gauge & Higgs Bosons Reviews
Mass and Width of the ${{\mathit W}}$ Boson Extraction of Triple Gauge Couplings (TGC's) Anomalous ${{\mathit W}}/{{\mathit Z}}$ Quartic Couplings (QGCs) ${{\mathit Z}}$ Boson Anomalous ${{\mathit Z}}{{\mathit Z}}{{\mathit \gamma}}$ , ${{\mathit Z}}{{\mathit \gamma}}{{\mathit \gamma}}$ , and ${{\mathit Z}}{{\mathit Z}}{{\mathit V}}$ Couplings ${{\mathit W}^{\,'}}$-Boson Searches ${{\mathit Z}^{\,'}}$-Boson Searches Leptoquarks Axions and Other Similar Particles
| 2018-08-16T02:13:34 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.9020435810089111, "perplexity": 7273.717194328911}, "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-34/segments/1534221210408.15/warc/CC-MAIN-20180816015316-20180816035316-00393.warc.gz"}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.