text stringlengths 1 1.11k | source dict |
|---|---|
kinematics
Nooooo...
or phasing through the surface
This, and only this.
If not, then is the normal reaction always bound to the center of the circle?
No. Normal reaction force should only ever prevent penetration into the surface.
In this case, the guide book is saying that the normal reaction is pushing alongside gravity. Then, shouldn't it fall down?
It seems like you have not yet understood what Newton's Laws of Motion are meaning. The book is correct. You need to understand what forces are really doing, then you can understand what is happening here. | {
"domain": "physics.stackexchange",
"id": 95252,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "kinematics",
"url": null
} |
function is calculated multiplying. 1/Λ, and the scale parameter the table below than or equal to zero, then is... Duration, having already successfully accumulated [ math ] t\, \ step 4: Finally, the Probability function! Exponential conditional reliability equation gives the reliability for a mission of [ math ] t\, \ hazard ( )! Constant failure rate the location parameter is … Definitions Probability density function is rate ( λ ) for this are. Functions for this distribution are shown in the table below, and, for repairable equipment MTBF. Model events with a constant failure rate θ = 1/λ, and the most widely applicable often used to events! Of this new mission used to model the reliability for a mission of [ math ] t\ \. Greater than or equal to zero, then X is an exponential distribution mean life θ... Functions for this distribution, we write X ~ Exp ( λ..! Applications the distribution has one parameter: the failure rate the exponential function and the scale parameter | {
"domain": "ferriterscobbo.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9719924769600771,
"lm_q1q2_score": 0.8444930935863401,
"lm_q2_score": 0.8688267796346598,
"openwebmath_perplexity": 1278.3672240253325,
"openwebmath_score": 0.7518762350082397,
"tags": null,
"url": "http://www.ferriterscobbo.com/misc/6o7rm4/f9476f-exponential-reliability-function"
} |
c++, c++17, optional, reference
operator T&() { return data.value().get(); }
operator const T&() const { return data.value().get(); }
operator std::reference_wrapper<T>() { return data.value(); }
operator const std::reference_wrapper<T>() const { return data.value(); }
As I said before: are you sure you want this (especially the implicit conversions to reference_wrapper)?
Other functionalities
Consider:
operator* and operator->;
explicit operator bool;
has_value;
... | {
"domain": "codereview.stackexchange",
"id": 37724,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "c++, c++17, optional, reference",
"url": null
} |
4l+1. The concept behind this method is that the prime factorization of a number determines all of its factors. The number is divided by i and if the remainder is 0, then i is a factor of “num” and is printed. 2 Integer factorization and related notions actoringF integers is an old and well-known problem; we recall it here for completeness. a prime is an integer greater than one that has no positive factors other than one and itself. Write a Java program to accepts an integer and count the factors of the number. The Factorization class provides a structure for holding quite general lists of objects with integer multiplicities. Theorem I1. Do not confuse the GCF with the Least Common Denominator (LCD) which is the smallest expression that all terms go into, rather than the greatest number the terms have in common. It is called from the main() function with one parameter i. Our activities touch on operations, service provision, concept development, research, Europe-wide project | {
"domain": "chiryo.it",
"id": null,
"lm_label": "1. YES\n2. YES\n\n",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.988312744413962,
"lm_q1q2_score": 0.8380573500512755,
"lm_q2_score": 0.8479677660619633,
"openwebmath_perplexity": 1211.8268799317816,
"openwebmath_score": 0.33224034309387207,
"tags": null,
"url": "http://chiryo.it/dwam/integer-factorization.html"
} |
photons, everyday-life, vision
Title: How can we see a beam of light? A beam of light is made of photons, which simply travel in a line from point $\text{A}$ to point $\text{B}$. But we can only see things when photons hit our retina, so doesn't this mean that the photons of the beam ought to travel to our eyes? How is it possible to see the beam? You're not seeing the photons in the beam that are traveling from A to B (beam starting point to beam destination), you are seeing photons that are scattering off of dust particles that are in the path of the beam.
This is the reason why you see lasers in a night club more clearly when there is a smoke machine, and why cat burglars blow dust onto security beams, to expose them ;-) | {
"domain": "physics.stackexchange",
"id": 50657,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "photons, everyday-life, vision",
"url": null
} |
star, black-hole, supernova
The minimum mass for the progenitor of a failed supernova is unknown (and as Rob Jeffries pointed out, this is metallicity-dependent). Some early models (e.g. Fryer (1999)) found that stars above $40M_{\odot}$ could produced failed supernovae, while newer ones suggest that this could be as low as $25M_{\odot}$. This lower limit would include a sizable portion of red supergiants - which could be a possible solution to the red supergiant problem.
A number of searches, largely targeting supergiants, have been carried out. Just a few are | {
"domain": "astronomy.stackexchange",
"id": 2231,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "star, black-hole, supernova",
"url": null
} |
c, embedded
} else if (key == sk_Apps) {
UNARY_OP(radDegAsin);
} else if (key == sk_Prgm) {
UNARY_OP(radDegAcos);
} else if (key == sk_Vars) {
UNARY_OP(radDegAtan);
} else if (key == sk_Square) {
UNARY_OP(realSquare);
} else if (key == sk_Recip) {
UNARY_OP(os_RealInv);
} else if (key == sk_2nd) {
constantsmode = true;
} else if (key == sk_Yequ) {
os_ClrHome();
os_SetCursorPos(0, 0);
os_PutStrFull("Arjun's RPN Calculator");
os_SetCursorPos(1, 0);
os_PutStrFull("v2.0 (ASM)");
os_SetCursorPos(3, 0);
os_PutStrFull("git.io/ti84rpn");
while (os_GetCSC() == 0);
os_ClrHome();
draw_full_stack();
draw_line_clear(true);
}
}
}
} | {
"domain": "codereview.stackexchange",
"id": 40999,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "c, embedded",
"url": null
} |
electric-circuits, electric-fields, charge, capacitance
Thank you for your feedback. Assuming you mean you have a full electrical circuit and you're wondering what an external field does to it:
The external electrical field would change the voltage, and thus the charge on the capacitor. This is not changing the capacitance.
Generally, though, capacitors are very small, and so the potential difference across the capacitor would be very small for reasonable electrical field magnitudes anyway. | {
"domain": "physics.stackexchange",
"id": 28470,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "electric-circuits, electric-fields, charge, capacitance",
"url": null
} |
masterofthewave124 said:
but then the end result would be (x,y,z) = a number; how would i rationalize the equality there?
Just take the modulus(magnitude) of (x,y,z) as I have shown in my earlier post .
Arun
#### masterofthewave124
yeah i noticed HallsOfIvy's mistake when reading it, i figured it was a typo. but even with the corrected values, i can't get it to work.
these are the values im getting:
AB • BC
= 10
AB • CA
= -27
BC • CA
= -14
i think it has something to do with the vectors im forming; i formed AB, BC and CA but HallsofIvy formed AB, BC and AC. im getting confused because dot product is taken from tip to tip anyways.
#### Hootenanny
Staff Emeritus
Gold Member
Are you sure you are calculating the dot product correctly? Here's my working for the first one;
$$\vec{AB}= (2-1)\vec{i}+ (5-6)\vec{j}+ (2+3)\vec{k}$$
$$\vec{BC}= (5-2)\vec{i}+ (3-5)\vec{j}+ (2-3)\vec{k}$$
$$\vec{AB}{\mathbf\centerdot}\vec{BC} = 1\times 3 + -1 \times -2 + 5\times -1$$ | {
"domain": "physicsforums.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9833429624315188,
"lm_q1q2_score": 0.8377617958356824,
"lm_q2_score": 0.8519528057272543,
"openwebmath_perplexity": 1199.5571614778676,
"openwebmath_score": 0.8592232465744019,
"tags": null,
"url": "https://www.physicsforums.com/threads/vector-operations.123007/"
} |
forward-kinematics, machine-learning
The problem is, that a dedicated physics engine which can predict the trajectory of a robot is hard to realize by hand. But there are some general techniques available for example genetic algorithm, rule based systems or reinforcement learning which can simplify the programming. These general systems are working with parameters who have to be adapted to a certain domain, which is called machine learning.
Question: Can a neural network be used for predicting future states of a robot? And which kind of dataset is needed for doing so? I think there are some confusing statements or inaccuracies in this question regarding fundamental concepts in robotics, control engineerging and AI/ML. I am not sure if it helps to list these or not, so I will not I just wanted to draw attention to this fact if somebody tries to used the question as a reference.
However, to answer the final question: | {
"domain": "robotics.stackexchange",
"id": 1847,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "forward-kinematics, machine-learning",
"url": null
} |
bash, shell, user-interface
cat<<EOF>>$file_log
----------------------------------------------------------------------
OLDEST AVAILABLE LOGS
$(printf "%-16s %s\n" "Cisco info: " "$oldest_CiscoInfo ($count_CiscoInfo days ago)")
$(printf "%-16s %s\n" "Cisco critical: " "$oldest_CiscoCrit ($count_CiscoCrit days ago)")
$(printf "%-16s %s\n" "Rmessages: " "$oldest_Rmessages ($count_Rmessages days ago)")
$(printf "%-16s %s\n" "NetScaler: " "$oldest_Netscaler ($count_NetScaler days ago)")
----------------------------------------------------------------------
EOF
cat<<EOF
Note that this script can produce enormous amount of output. Use filtering carefully.
Moreover, it can take quite some time due to sheer amount of syslog data (especially with the NetScaler logs).
Caveat emptor.
Be patient. You can always interrupt execution with a SIGINT (by pressing Ctrl-C) and the script would handle this correctly. | {
"domain": "codereview.stackexchange",
"id": 31681,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "bash, shell, user-interface",
"url": null
} |
quantum-algorithms, grovers-algorithm, amplitude-amplification
$$
U_f = (\mathbb{1}-2|m\rangle\langle m|)
$$
followed by the diffusion operator that projects back onto $|\psi_0\rangle$ and reads
$$
V = (2|\psi_0\rangle \langle \psi_0|-\mathbb{1}).
$$
The resulting state after $d$ iterations is $(VU_f)^d|\psi_0\rangle$ and it has achieved to amplify the amplitude of the state essentially by projecting it onto $|m\rangle$.
(B) With ancilla
However, in a very similar construction (see this paper for example) I read that one can directly start with the state in $n+1$ qubits (before we only had $n$)
\begin{align}
|\psi_0\rangle &= \mathcal{A}|0\rangle^n|0\rangle \\
&=\cos(\phi)|k\rangle\otimes|0\rangle + \sin(\phi)|m\rangle \otimes|1\rangle \\
&=\cos(\phi)|k\rangle |0\rangle + \sin(\phi)|m\rangle |1\rangle
\end{align}
(not sure why the angle discrepancy!) for some operator $\mathcal{A}$ that does the job of projecting into the $\{|k\rangle, |m\rangle \}$ space, and then apply
$$
Q = \mathcal{A}S_0 \mathcal{A}^{-1}S_\chi
$$ | {
"domain": "quantumcomputing.stackexchange",
"id": 3486,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "quantum-algorithms, grovers-algorithm, amplitude-amplification",
"url": null
} |
Question 9 (warning: extremely tedious): From Question 8, if we are again further given that $$\zeta(8) = \frac{\pi^8}{9450}$$, using the approaches we had before, prove that the equation below has a positive real root $$B$$ such that $$B - \pi^2$$ is a significantly small positive number.
$\large 3x^4 + 550x^3 + 45045x^2 + 3378375x - 38288250 = 0$
Note by Pi Han Goh
1 year, 8 months ago
Comments
Sort by:
Top Newest
If we continue to use this trick, will it eventually converge to pi ( or pi^2,pi^4 etc), or will it always be really close, but not pi itself?I doubt it, because every time we have an algebraic number as an approximation and pi is transcendental. · 1 year, 8 months ago
Log in to reply
Just asking, is the polynomial in question $$8$$ wrong? I'm not sure about it but I graphed it out and there was no root near $$\pi^{2}$$. It may be possible that Desmos screwed up because the numbers are too big. · 1 year, 8 months ago
Log in to reply
LINK? · 1 year, 8 months ago | {
"domain": "brilliant.org",
"id": null,
"lm_label": "1. YES\n2. YES\n\n",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9859363713038173,
"lm_q1q2_score": 0.8014354469958493,
"lm_q2_score": 0.8128673110375458,
"openwebmath_perplexity": 536.9941980520126,
"openwebmath_score": 0.9429739117622375,
"tags": null,
"url": "https://brilliant.org/discussions/thread/fun-ways-to-find-the-upper-bounds-of-pi2-using/"
} |
quantum-field-theory, general-relativity, mathematics
The chief purpose of these formalisms are in making mathematical proofs. Theories of physics are applications of differentials, integrals, limits and other things, and physicists are not typically concerned with proofs. The extent to which you will find $\epsilon$-$\delta$ proofs in a physics paper is thus, also, roughly (with of course due mindfulness of the possibility to be surprised!) the extent to which you could expect NSA to be useful in physics, i.e. outside of studying it from a mathematician's pov as mathematical constructs. Most physicists care so little about what $dx$ "really" is in many cases (perhaps too little, imo), that they use it in ways that are "said to make a mathematician cringe". Though for me, with fair interest and study of both perspectives I find them each to have advantages and disadvantages and no problem in using either when suitable.
That said, and to note my Math.SE answer here: | {
"domain": "physics.stackexchange",
"id": 59832,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "quantum-field-theory, general-relativity, mathematics",
"url": null
} |
# Are $\{(x,y)\in \mathbb{R}^2 : (x,y)\neq(0,0)\}$ and $\{(x,y)\in \mathbb{R}^2 : (x,y)\notin [0,1]\times\{0\}\}$ homeomorphic?
Let $X_1$ and $X_2$ be the spaces \begin{align*} X_1&=\{(x,y)\in \mathbb{R}^2 : (x,y)\neq(0,0)\}, \\ X_2&=\{(x,y)\in \mathbb{R}^2 : (x,y)\notin [0,1]\times\{0\}\}. \end{align*} Are these spaces homeomorphic? If these spaces are homeomorphic, what is the homeomorphism map? If these spaces are not homeomorphic, why?
I suspect these spaces are homeomorphic, but I can't construct homeomorphism.
• What have you tried so far? What do you suspect is the correct answer? Please edit your question and elaborate on these two points. Feb 10, 2015 at 15:09
You are right with your conjecture; but there is no such thing as "the" homeomorphism between these two spaces. In fact you have to put one together from your geometrical and analytical toolkit. | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9861513905984457,
"lm_q1q2_score": 0.8477585994668098,
"lm_q2_score": 0.8596637469145054,
"openwebmath_perplexity": 167.45165244136115,
"openwebmath_score": 0.9680501818656921,
"tags": null,
"url": "https://math.stackexchange.com/questions/1142135/are-x-y-in-mathbbr2-x-y-neq0-0-and-x-y-in-mathbbr2"
} |
dynamic-reconfigure
Originally posted by joq with karma: 25443 on 2012-06-24
This answer was ACCEPTED on the original site
Post score: 1
Original comments
Comment by brice rebsamen on 2012-06-25:
Thanks for the tip: https://kforge.ros.org/dynamicreconfig/trac/ticket/4 | {
"domain": "robotics.stackexchange",
"id": 9795,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "dynamic-reconfigure",
"url": null
} |
• Pigeonhole principle the following general principle was formulated by the famous german mathematician dirichlet (1805-1859): pigeonhole principle: suppose you have kpigeonholes and npigeons to be placed in them.
• Tion for the ith level of polynomial hierarchy this is because s3 2 can do the necessary minimization and paris et al [21], as presented in kraj cek [15], have shown that s3 2 proves the weak pigeonhole principle for p-time functions.
• One of the famous (although often neglected in the instructional program) problem- solving techniques is to consider the pigeonhole principle which is a powerful tool used in combinatorial mathin its simplest form, t he pigeonhole principle states that if more than n pigeons are placed into n pigeonholes, some pigeonhole must contain more than one pigeon. | {
"domain": "blogdasilvana.info",
"id": null,
"lm_label": "1. YES\n2. YES\n\n",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.982823294006359,
"lm_q1q2_score": 0.8503623880153929,
"lm_q2_score": 0.8652240877899775,
"openwebmath_perplexity": 530.7672998149491,
"openwebmath_score": 0.602908730506897,
"tags": null,
"url": "http://mhessayjicu.blogdasilvana.info/the-pigeonhole-principle-forms.html"
} |
quantum-field-theory, fourier-transform, feynman-diagrams, interactions, propagator
Here Tong is referring to the Virasoro-Shapiro amplitude in String Theory, but the claim is valid here as well: resummation of power/asymptotic series leads to a completely different behaviour than that of the truncated series. Your $n$th order amplitude may seem to have a singularity at $t=\infty$, while the actual amplitude is in fact finite at that point. Consider as an example the series $\frac{1}{1-x}=1+x+x^2+x^3+\cdots$, which is finite at $x=\infty$ but the truncated series has a pole there. | {
"domain": "physics.stackexchange",
"id": 46550,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "quantum-field-theory, fourier-transform, feynman-diagrams, interactions, propagator",
"url": null
} |
quantum-mechanics, soft-question, mathematics
Title: Why do authors write mathematical expressions in their books? I'm currently interested in and new to QM and I'm reading a book, that teaches QM in an easy way. But there are many mathematical expressions about various things, like the quantum state of a spin when an apparatus is rotated along the x-, y- or z-Axis.
I can think of what the purpose of these expressions might be, but I want to know it more clearly.
What's the purpose of writing these mathematical expressions and do I really have to know/understand every single detail of these expressions or just generally know what they are?
Thank you !
PS: I'm currently not studying physics, but I'm thinking of studying physics in the future. ^^ Mathematics has some very useful properties that make it superior to natural language in describing physical theories: | {
"domain": "physics.stackexchange",
"id": 81323,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "quantum-mechanics, soft-question, mathematics",
"url": null
} |
waves, acoustics, propulsion
$$ \vec S = u\vec v $$
Following $E=mc^2$, we can turn that energy flux into a momentum:
$$ \vec p = \frac{\vec S}{c^2} = \frac{uv}{c^2} $$
which is tiny. It is in fact a relativistic effect, and is so tiny, that the author writes:
"It appears that the fluid-dynamics community generally considers that the laws of relativity are not relevant to this branch of physics, and that the momentum density can and should be ignored"
So the answer is "yes" if you're pedantic, and "no" if you are practical. | {
"domain": "physics.stackexchange",
"id": 75090,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "waves, acoustics, propulsion",
"url": null
} |
human-biology, bacteriology, antibiotics, pathology
The second approach is obviously more effective but has one big disadvantage: massive death of bacteria leads to the massive release of their toxins that are normally trapped within they bodies (so-called endotoxins). The symptoms you describe as "impossible fatigue" match exactly the symptoms of bacterial intoxication -- and this can increase upon the antibiotics intake.
Depending upon the bioavailability and pharmacokinetics some antibiotics might not kill all bacteria "on the first run" and the symptoms of intoxication recur several times with decreasing severity of manifestations. | {
"domain": "biology.stackexchange",
"id": 2790,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "human-biology, bacteriology, antibiotics, pathology",
"url": null
} |
c++, io
int main() {
int i = get<int>(std::cin);
std::cout << i << std::endl;
std::string s = get<std::string>(std::cin , std::setw(5));
std::cout << s << std::endl;
}
I'd like to know if
I can improve something on the design
There are serious performance implications
There are corner cases where this will not work or even worse produce silent errors.
I've overlooked any standard functions/classes that already implement that functionality.
There are corner cases where this will not work or even worse produce silent errors.
The function as it is, depends on the client to check for errors on the stream (either by calling std::cin.exceptions(std::ifstream::failbit); or by checking the stream state, after the call to get).
Ideally, I would want to write:
if(auto a = get<int>(std::cin))
// use a here | {
"domain": "codereview.stackexchange",
"id": 12963,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "c++, io",
"url": null
} |
dna, proteins, sequence-analysis, sequence-alignment, data
There are many many many tools for aligning sequences, both protein and DNA (DNA is a "nucleotide"; RNA is also a "nucleotide" sequence, but DNA is much more common to align in most applications).
Some of the common tools for generating multiple sequence alignments are ClustalO and MAFFT. Notably, you are not as interested (I think) in tools such as BLAST which are mostly about searching single sequences against databases using local alignment, rather than for generating multiple sequence alignments for input to other programs.
I believe that with some searching you can find existing multiple sequence alignment databases. People do not usually save them and put them in databases or repositories because usually which data you use is very specific to the problem that you are interested in, and they are quite simple to generate. Most of the databases are likely to be quite old for this reason; I found one such old database (described here) with a bit of googling. | {
"domain": "biology.stackexchange",
"id": 10583,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "dna, proteins, sequence-analysis, sequence-alignment, data",
"url": null
} |
plate-tectonics, mountains, tectonics
Title: What is the impact of divergent tectonic plates on old mountain ranges? I found this question, which is similar to what I'm wondering, but my question is slightly different:
What happens if a new divergent boundary forms in a way that bisects a mountain range, especially one formed by converging plates -- and is that even possible?
Purely for the sake of example, if a divergent rift somehow formed on the North American plate, dividing the Appalachians [ETA: apparently I circled a valley, please pretend I'm not a geography-illiterate dork and that it's actually some old mountains.]: | {
"domain": "earthscience.stackexchange",
"id": 1875,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "plate-tectonics, mountains, tectonics",
"url": null
} |
pressure, fluid-statics, volume
Title: A filled bottle with a hole — how does atmospheric pressure keep water from flowing out? I understand that when you make a hole on a bottle filled with water and put the cap on tight the water will not flow out due to the atmospheric pressure acting on the hole.
My confusion is that, lets say there's some space remaining on top of the water, when you close the tap, there's still air inside it, so there is pressure from the atmosphere acting on the surface of water inside the bottle. And the hole is at a height $h$ below the surface of the water, so there's also pressure from the depth $h$ of water due to gravity. | {
"domain": "physics.stackexchange",
"id": 43247,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "pressure, fluid-statics, volume",
"url": null
} |
java, game, swing, pong
Ball class:
In this class the update method looks rather confusing with all the if-statements and the math in their conditions. I'd create methods of the conditions: instead of writing else if (y < 0 || y > game.getHeight() - HEIGHT - 29), I'd write else if (hasHitTopOrBottom()) and then define method like this:
private boolean hasHitTopOrBottom() {
return y < 0 || y > game.getHeight() - HEIGHT - 29;
} | {
"domain": "codereview.stackexchange",
"id": 3923,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "java, game, swing, pong",
"url": null
} |
aerospace-engineering, simulation, aerodynamics
The problem with a fully automatic approach is that the initial model may be completely unrealistic (for example because some important feature was left out altogether, either by mistake, or because nobody thought it was important enough to be worth including!) but the software managed to make the answers line up with the test data by using unrealistic values for the parameters, and getting to a situation where several "large errors" cancelled out but the final results "looked about right".
It is fairly routine to use "automatic model generation" in a more limited way. For example in finite element analysis, you might define the geometry of the component, and the software automatically generates the finite element mesh, and then refines it by subdividing some of the elements in regions where the numerical solution hasn't converged, according to some predefined measure of "converged". This is usually much quicker (and more accurate) than generating the complete mesh by hand. | {
"domain": "engineering.stackexchange",
"id": 2447,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "aerospace-engineering, simulation, aerodynamics",
"url": null
} |
classical-mechanics, newtonian-gravity
Title: Why is the gravitational field potential scalar? On page 48 of Carroll's Spacetime and Geometry he, before introducing "gravity as geometry", discusses the classical Newtonian equation:
$F_{g}=-m_{g} \nabla \Phi$
This equation is very straight forward and intuitive but Carroll goes on to state:
"...is proportional to the gradient of a scalar field $\Phi$, known as the gravitational potential."
My question is, why is the gravitational potential a scalar field? Is it because the potential energy of a particle in a gravitational field is only dependent on its position? Is me thinking about the field as being scalar in this way just the expression of $\textbf{a} = \nabla \Phi$ ? You are on the right track thinking of how potential energy is dependent only on position. you have to be careful, though, to avoid circular reasoning in defining potential energy -- i.e., you can't just assume it is the function whose negative gradient gives the force. | {
"domain": "physics.stackexchange",
"id": 16542,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "classical-mechanics, newtonian-gravity",
"url": null
} |
}
parameters{
real<lower=-1, upper=1> rho;
real<lower=0, upper=1> q;
}
transformed parameters{
real<lower=0, upper=1> prob_1_1 = q + rho*(1-q);
real<lower=0, upper=1> prob_0_1 = (1-q)*(1-rho);
real<lower=0, upper=1> prob_1_0 = q*(1-rho);
real<lower=0, upper=1> prob_0_0 = 1 - q + rho*q;
}
model{
q ~ beta(1, 1);
target += y_1_1 * bernoulli_lpmf(1| prob_1_1);
target += y_0_1 * bernoulli_lpmf(1| prob_0_1);
target += y_1_0 * bernoulli_lpmf(1| prob_1_0);
target += y_0_0 * bernoulli_lpmf(1| prob_0_0);
}
Here, I've placed a uniform prior on the autocorrelation
$$\rho \sim \mbox{Uniform}(-1, 1)$$
and on the probability of a head
$$q \sim \operatorname{Beta}(1, 1)$$ | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9736446456243805,
"lm_q1q2_score": 0.8607401087317024,
"lm_q2_score": 0.8840392771633079,
"openwebmath_perplexity": 1067.4501979938352,
"openwebmath_score": 0.7305430769920349,
"tags": null,
"url": "https://stats.stackexchange.com/questions/574333/how-can-i-determine-which-of-two-sequences-of-coin-flips-is-real-and-which-is-fa/574425"
} |
shors-algorithm
think there is a simple answer to the question: All quantum algorithms that is believed to be exponentially faster than all classical counterparts are equivalent to "finding a hidden subgroup" in some Abelian group. In other words, the quantum algorithm is finding the non trivial period in some discrete structure, if there is any. | {
"domain": "quantumcomputing.stackexchange",
"id": 5356,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "shors-algorithm",
"url": null
} |
algorithms, time-complexity, computational-geometry
Title: Finding "entrance" points in a set of d-dimensional points. Can I do better than O(N^2)? I am given a set of d-dimensional points, and need to find the set of entrance points in them.
Definitions:
A point p1 captures p2 if 1) All dimensions of p1 is smaller or equal to p2; and 2) At least one dimension of p1 is strictly less than its corresponding dimension of p2. (e.g. p1 = <1.0, 2.0, 3.0>, p2 = <1.0, 3.0, 3.0>, since 1.0 == 1.0, 2.0 < 3.0, 3.0 == 3.0, we say p1 captures p2.
An entrance point is a point which it is not captured by any other points in the dataset.
For example, in the following dataset:
n = 4, d = 2
=============
p1 = <0.3, 1.5>
p2 = <0.2, 1.4>
p3 = <0.1, 1.7>
p4 = <0.8, 0.9>
The entrance points are {p2, p3, p4} because:
p1 is captured by p2 because all dimensions of p2 is less than p1.
p2, p3, p4 cannot capture each other. | {
"domain": "cs.stackexchange",
"id": 17621,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "algorithms, time-complexity, computational-geometry",
"url": null
} |
electrostatics, electric-current, charge
Title: Current as the time derivative of the charge I have been told that the current $i$ can be defined as
$ i = \displaystyle\frac{dq}{dt} $,
where $q$ is the charge and $t$ is the time.
I do not understand this definition because, if the charges are moving so that the net charge remains constant in an infinitesimally thin cross-section of a wire, $q$ is constant with time and hence $dq/dt = 0$. That result would mean that no constant current can exist unless the charge change has a linear dependence with time (i.e. $q = q(t) \propto t$).
As I assume my reasoning is wrong, where is my mistake?
Thank you. Electric current can be understood through the analogy of water flow.
Just as the 'water current' in a river is the amount of water which passes a point in a given time interval, similarly, the electric current can be understood as the amount of electric charge passing through an area in a given time interval. | {
"domain": "physics.stackexchange",
"id": 37976,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "electrostatics, electric-current, charge",
"url": null
} |
machine-learning, classification, decision-trees
Title: Cross Entropy vs Entropy (Decision Tree) Several papers/books I have read say that cross-entropy is used when looking for the best split in a classification tree, e.g. The Elements of Statistical Learning (Hastie, Tibshirani, Friedman) without even mentioning entropy in the context of classification trees.
Yet, other sources mention entropy and not cross-entropy as a measure of finding the best splits. Are both measures usable? Is only cross-entropy used? Since the two concepts significantly differ from each other as far as my understanding goes. The use of cross-entropy here is not incorrect; it is the cross entropy of some quantity.
Given data $(x_1,y_1), ..., (x_N, y_N)$, with $y_N$ a categorial variable over $K$ classes, we can model the conditional probability $p_k(x)$ for class $k$, where it satisfies $\sum_{k=1}^K p_k(x) = 1$ for each $x$. Then the sum | {
"domain": "datascience.stackexchange",
"id": 5104,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "machine-learning, classification, decision-trees",
"url": null
} |
ros-melodic, rosbag
Originally posted by Abraham on ROS Answers with karma: 7 on 2019-09-12
Post score: 0
Sure, that's a measurement of frames dropped to some extent. Depending on what you're trying to measure that could be a useful measure or not. If you're that close it's likely you got all the messages during the recording but had some missed at startup and shutdown of the recording.
Depending on your setup the messages arriving from different sources might start and end at different times as it takes some time to establish connections at startup, and exactly how the system shutdown there might also be extra time at the end from other topics too.
I'll note that you're using a rounded length of the bag file, the more precise length of your bag listed is 699.81s which is several more frames equivalent. You could also look at the actual timestamps of the first and last logged camera images to detect losses in the stream. | {
"domain": "robotics.stackexchange",
"id": 33754,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "ros-melodic, rosbag",
"url": null
} |
1. Which of the following numbers is an example of an integer?
10. ### math
Which statements are true for irrational numbers written in decimal form?
More Similar Questions | {
"domain": "jiskha.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9609517072737737,
"lm_q1q2_score": 0.8399460066926067,
"lm_q2_score": 0.874077230244524,
"openwebmath_perplexity": 1142.8662794617562,
"openwebmath_score": 0.8192746043205261,
"tags": null,
"url": "https://www.jiskha.com/display.cgi?id=1245121807"
} |
electromagnetism, magnetic-fields, classical-electrodynamics, electromagnetic-induction
Title: Where does the Magnetic Field Energy come from, in case of a charged particle moving with constant velocity? A charged particle moving with constant velocity creates Magnetic Field around it. If there is Magnetic Field, then there must be Magnetic Field Energy. The question is, where does the Magnetic Field Energy come from, in case of a charged particle moving with constant velocity? The electric and magnetic fields are components of the electromagnetic field described by the electromagnetic tensor. Components of this tensor change under the Lorentz transformation while obeying the energy conservation law. This means that the energy of the magnetic field increases with the speed in the same proportion as the energy of the electric field simultaneously decreases. The total electromagnetic energy remains the same.
In the contravariant matrix form, the electromagnetic tensor is given by
$$
F^{\mu\nu} = \begin{bmatrix}
0 & -E_x/c & -E_y/c & -E_z/c \\ | {
"domain": "physics.stackexchange",
"id": 51392,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "electromagnetism, magnetic-fields, classical-electrodynamics, electromagnetic-induction",
"url": null
} |
ros
| ^~~~~
/usr/include/pcl-1.10/pcl/common/point_tests.h:127:43: error: expected ‘>’ before ‘<’ token
127 | template <typename PointT, traits::HasXY<PointT> = true> inline bool
| ^
/usr/include/pcl-1.10/pcl/common/point_tests.h:128:3: error: redefinition of ‘template<class PointT, <typeprefixerror><anonymous> > bool pcl::isXYFinite(const PointT&)’
128 | isXYFinite (const PointT& pt) noexcept
| ^~~~~~~~~~
/usr/include/pcl-1.10/pcl/common/point_tests.h:109:3: note: ‘template<class PointT, <typeprefixerror><anonymous> > constexpr bool pcl::isXYFinite(const PointT&)’ previously declared here
109 | isXYFinite (const PointT&) noexcept
| ^~~~~~~~~~
/usr/include/pcl-1.10/pcl/common/point_tests.h:133:38: error: ‘pcl::traits::HasXYZ’ has not been declared
133 | template <typename PointT, traits::HasXYZ<PointT> = true> inline bool | {
"domain": "robotics.stackexchange",
"id": 36141,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "ros",
"url": null
} |
nlp
Title: What is this called by gathering the meaning from a sentence? What would this process of gathering the meaning of a sentence be called? What would the segments derived from the sentence be called?
"John and Derrek both love cake"
-> John loves cake
-> Derrek loves cake
"John was mad that the weather was rainy today"
-> John was mad
-> weather was rainy today It is called relation extraction, it is a subdomain of Natural Language Processing. Often, you first have to apply Named Entity recognition or Concept extraction to extract the entity or concept. You can then extract the relations betweens the entities with several approaches. | {
"domain": "datascience.stackexchange",
"id": 5280,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "nlp",
"url": null
} |
cosmology, space-expansion, thermal-radiation, cosmic-microwave-background
$$r = \frac{2 G d V}{c^2}$$
$$r = \frac{2 G d}{c^2}*\frac{4 \pi r^3}{3}$$
$$r = \frac{2 G}{c^2}*\frac{4 \pi r^3}{3}*\frac{\sigma T^4}{c^3}$$
$$r = \sqrt \frac {3c^5}{8 \pi G \sigma T^4}$$
I substituted the constants, and the result is around $3.72\times10^{28}$ meters, or $3.93\times10^{12}$ light-years, nearly four trillion light-years, if I didn't get anthing wrong.
Would even a matterless universe with this size really collapse, by sheer weight of the microwave background, forming a blackhole made of light?
Does the cosmic microwave background (CMB) put a upper bound on Universe radius and size? | {
"domain": "physics.stackexchange",
"id": 68193,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "cosmology, space-expansion, thermal-radiation, cosmic-microwave-background",
"url": null
} |
python, statistics, visualization, simulation
Title: How to find out if two datasets are close to each other? I have the following three datasets.
data_a=[0.21,0.24,0.36,0.56,0.67,0.72,0.74,0.83,0.84,0.87,0.91,0.94,0.97]
data_b=[0.13,0.21,0.27,0.34,0.36,0.45,0.49,0.65,0.66,0.90]
data_c=[0.14,0.18,0.19,0.33,0.45,0.47,0.55,0.75,0.78,0.82]
data_a is real data and the other two are the simulated ones. Here I am trying to check which one (data_b or data_c) is closest or closely resembles to data_a.
Currently I am doing it visually and with ks_2samp test (python).
Visually
I graphed the cdf of real data vs cdf of simulated data and try to see visually that which one is the closest.
Above is the cdf of data_a vs cdf of data_b | {
"domain": "datascience.stackexchange",
"id": 5453,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "python, statistics, visualization, simulation",
"url": null
} |
Gu† Sakti Pramanik† †Department of Computer Science and Engineering ‡School of Information Technology Michigan State University Indian Institute of Technology East Lansing, MI 48824, USA Kharagpur 721302, India Euclidean distance can be used if the input variables are similar in type or if we want to find the distance between two points. What we do know, however, is how much we need to rotate in order to look straight at each of them if we start from a reference axis: We can at this point make a list containing the rotations from the reference axis associated with each point. The K-Means algorithm tries to find the cluster centroids whose position minimizes the Euclidean distance with the most points. As can be seen from the above output, the Cosine similarity measure is better than the Euclidean distance. The decision as to which metric to use depends on the particular task that we have to perform: As is often the case in machine learning, the trick consists in knowing all techniques | {
"domain": "vietanfoods.vn",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9805806546550656,
"lm_q1q2_score": 0.8213539319975087,
"lm_q2_score": 0.8376199633332891,
"openwebmath_perplexity": 513.9708041025052,
"openwebmath_score": 0.744763195514679,
"tags": null,
"url": "https://vietanfoods.vn/y84vt4e8/893c0c-cosine-similarity-vs-euclidean-distance"
} |
quantum-field-theory, topological-field-theory, chern-simons-theory
To put it all from a more abstract perspective, there are no known unitary 3+1D TQFTs which are not some kind of twisted gauge theory. We know some non-abelian ones, but there are no-go results for realizing them in familiar systems of SU(n) gauge fields interacting with fermions ( https://arxiv.org/abs/1106.0004 ). Thus, all of the questions of topological order in the Standard Model are equivalent to questions about the strong CP problem and about the center of the gauge group.
But still we haven't seen a magnetic monopole... | {
"domain": "physics.stackexchange",
"id": 48383,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "quantum-field-theory, topological-field-theory, chern-simons-theory",
"url": null
} |
complexity-theory, time-complexity, queues
cin>>k;
vpairs[k].push_back(pii(i,j));
}
vis.push_back(newvecbool);
}
queue<pii> queue;
queue.push(pii(A,B));
while(!queue.empty())
{
pii curpair = queue.front();
queue.pop();
if(curpair.first==1 && curpair.second==1){
cout<<"yes";
return 0;
}
vis[curpair.first-1][curpair.second-1] = true;
int value = curpair.first*curpair.second;
// cout<<curpair.first<<' '<<curpair.second<<endl;
for(int i=0; i<vpairs[value].size();i++)
{
pii pair = vpairs[value][i];
if(!vis[pair.first][pair.second]){
//vis[pair.first][pair.second] = true;
queue.push(pii(pair.first+1,pair.second+1));
}
}
}
cout<<"no";
} | {
"domain": "cs.stackexchange",
"id": 17675,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "complexity-theory, time-complexity, queues",
"url": null
} |
c#, beginner, console
}
void WriteCities(List<string> _cities, int _index)
{
Console.Clear();
foreach (var city in _cities)
{
string selectOptionSymbol = " ";
if (city == _cities[_index])
{
selectOptionSymbol = "> ";
Console.BackgroundColor = ConsoleColor.White;
Console.ForegroundColor = ConsoleColor.Black;
}
Console.WriteLine($"{selectOptionSymbol}{city}");
Console.BackgroundColor = ConsoleColor.Black;
Console.ForegroundColor = ConsoleColor.White;
}
}
}
}
} | {
"domain": "codereview.stackexchange",
"id": 44169,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "c#, beginner, console",
"url": null
} |
velocity, wavelength, doppler-effect
perspective, because of his relative motion to the police officer, the frequency of the wave hitting the car has been Doppler shifted to a new frequency, $f_1$. This new frequency is given by the Doppler equation | {
"domain": "astronomy.stackexchange",
"id": 2188,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "velocity, wavelength, doppler-effect",
"url": null
} |
linux, shell
echo 'Installing pkgconf ..'>&2
apt install pkgconf
...
echo 'Installing libvte-2.91-dev ..'>&2
apt install libvte-2.91-dev
...
It just goes on and on in this vein, it makes my eyes water.
DRY.
Write a loop already:
for PKG in pkgconf libvte-2.91-dev ...
Or put the package names in an env var,
one-per-line for convenient git diff'ing,
and loop over that.
apt install ...
I wonder if you maybe want apt install -y ...,
to prevent user prompting?
It is possible to ask apt to install
a bunch of packages all at once in a single command.
But that would alter the apt output and
your progress reporting, so maybe you prefer not to.
Total time spent waiting for downloads will
often be reduced if you batch requests together,
as some downloads will happen in parallel
and the bottleneck router might have lots
of bandwidth available.
You didn't show us where you're already cd'd to,
so it's unclear where the git clone will write to,
but I imagine you've got that worked out already. | {
"domain": "codereview.stackexchange",
"id": 44516,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "linux, shell",
"url": null
} |
elisp
Lisp (actually, Elisp and Common Lisp; Scheme does its own thing) convention is to end predicate functions with -p or p rather than begin them with is-.
(defun unique-name-for-buffer-p (new-name)
(let ((file-name (buffer-file-name))
(dir-name (file-name-directory buffer-file-name)))
(let ((new-complete-name (concat dir-name new-name)))
(progn (not (string-equal file-name new-complete-name))))))
Your predicate seems to be nesting lets only because you need new-complete-name to refer to dir-name. When you're in a situation like that, you can instead use let*. It's the same as let except that its clauses are guaranteed to be evaluated in order (it's still good style to use let when you can, but one let* is better than many nested lets).
(let* ((file-name (buffer-file-name))
(dir-name (file-name-directory buffer-file-name))
(new-complete-name (concat dir-name new-name)))
(progn (not (string-equal file-name new-complete-name)))) | {
"domain": "codereview.stackexchange",
"id": 1168,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "elisp",
"url": null
} |
c#, entity-framework, asp.net-mvc, asp.net-web-api
Title: Run stored procedure from repository using EF I need to dynamically call a stored procedures from my repository, and here is a my implementation:
public void ExecProcedure(string name, Dictionary<string, string> param = null)
{
List<object> sqlParametesList = new List<object>();
try
{
if (param != null)
{
name = NormalizeProcedureName(name, param);
foreach (var item in param)
{
sqlParametesList.Add(new SqlParameter(item.Key, item.Value));
}
}
context.Database.ExecuteSqlCommand(name, sqlParametesList.ToArray());
}
catch (Exception e)
{
throw new Exception(string.Format("Error in ExecProcedure: {0}", e.Message));
}
}
There is 3 case of call ExecProcedure(): | {
"domain": "codereview.stackexchange",
"id": 15638,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "c#, entity-framework, asp.net-mvc, asp.net-web-api",
"url": null
} |
The 3rd quartile (Q3) is positioned at .675 SD (std deviation, sigma) for a normal distribution. The IQR (Q3 - Q1) represents 2 x .675 SD = 1.35 SD. The outlier fence is determined by adding Q3 to 1.5 x IQR, i.e., .675 SD + 1.5 x 1.35 SD = 2.7 SD. This level would declare .7% of the measurements to be outliers.
We certainly CAN use whatever outlier bound we wish to use, but we will have to justify it eventually. In the not-so-recent past, it was typical to expect distributions to be Gaussian. With that assumption, ±1IQR is too exclusive, resulting in too MANY outliers, ±2IQR is too inclusive, resulting in too FEW outliers. ±1.5IQR is easy to remember, and is a reasonable compromise, under assumptions of Gaussianity. | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.974042642048694,
"lm_q1q2_score": 0.8373491455670425,
"lm_q2_score": 0.8596637451167997,
"openwebmath_perplexity": 1176.2159237878795,
"openwebmath_score": 0.6037857532501221,
"tags": null,
"url": "https://math.stackexchange.com/questions/966331/why-john-tukey-set-1-5-iqr-to-detect-outliers-instead-of-1-or-2/3576656#3576656"
} |
javascript, optimization, jquery
Title: Web page based on a sample from a book I've created a web page based on a sample from a book. It works fine, but seems to have become too complicated.
'use strict';
function toggle (triggers, elements, per_trigger, events) {
function toggle(index, per, elem, func) {
for (var i = 0; i < per; i++)
func(elem[index+i]);
} | {
"domain": "codereview.stackexchange",
"id": 8971,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "javascript, optimization, jquery",
"url": null
} |
equations. Finite Element Solution fem2d_poisson_rectangle, a MATLAB program which solves the 2D Poisson equation using the finite element method, and quadratic basis functions. Either approach requires O(N2 logN) ops for a 2D Poisson equation, and is easily generalized to Poisson-like equations in rectangular boxes in three or dimensions. A useful approach to the calculation of electric potentials is to relate that potential to the charge density which gives rise to it. Yet another "byproduct" of my course CSE 6644 / MATH 6644. The discrete Poisson equation is frequently used in numerical analysis as a stand-in for the continuous Poisson equation, although it is also studied in its own right as a topic in discrete mathematics. Different source functions are considered. Poisson’s and Laplace’s Equations Poisson equation 1D, 2D, and 3D Laplacian Matrices dimension grid n bands w memory complexity 1D N N 3 1 2N 5N 2D N ×N N2 5. The electric field is related to the charge density by the | {
"domain": "arcivasto.it",
"id": null,
"lm_label": "1. YES\n2. YES\n\n",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9923043521388583,
"lm_q1q2_score": 0.8225595892508525,
"lm_q2_score": 0.8289388104343892,
"openwebmath_perplexity": 603.9435741108301,
"openwebmath_score": 0.814243495464325,
"tags": null,
"url": "http://arcivasto.it/lpmo/2d-poisson-equation.html"
} |
c#, linq, mvc
The problem with exposing IQueryable<T> to your client code, is that you allow that code to modify the SQL being generated, and potentially to break your query with calls that Linq-to-Entities cannot translate to SQL. The grid in your UI doesn't need an IQueryable<T>. | {
"domain": "codereview.stackexchange",
"id": 7953,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "c#, linq, mvc",
"url": null
} |
mfcc, clustering, k-means
Recall: $r = \frac{TP}{TP + FN}$, the percentage of true positives that were correctly identified.
Quality (AKA accuracy) = $q = \frac{TP + TN}{TP + TN + FP + FN}$, the percentage of correctly classified items from all classified items.
Here $TP$ is the number of true positives, $TN$ the number of true negatives, $FP$ the number of false positives, $FN$ is the number of false negatives.
If you have many clusters and need to evaluate their interaction, then a confusion matrix may be more useful. | {
"domain": "dsp.stackexchange",
"id": 1147,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "mfcc, clustering, k-means",
"url": null
} |
potential, magnetostatics
In your notation, $dl_x$ and $dl_y$ are the components of $\hat{e}'$, so
$$
\hat{e}'_y = R_y \frac{ \cos( \theta ) }{ \sqrt{R_x^2 \sin^2( \theta) + R_y^2 \cos^2( \theta) } }.
$$
You have also correctly deduced that $\mathscr{r} = \sqrt{(R_x \cos(\theta) - x)^2 + (R_y \sin(\theta) - y)^2 }$. But the differential line element should be
$$
dl' = \sqrt{\left(\frac{dx}{d\theta}\right)^2 + \left(\frac{dy}{d\theta}\right)^2} d\theta = \sqrt{R_x^2 \sin^2 \theta + R_y^2 \cos^2\theta} \, d\theta
$$
rather than just $d\theta$. So the proper integral for the ellipse is
$$
A_y^{HE}(x,y) = R_y \int_{\theta=\frac{\pi}{2}}^{\theta=\frac{3\pi}{2}} { d \theta \frac{ \cos( \theta ) }{ \sqrt{(R_x \cos(\theta) - x)^2 + (R_y \sin(\theta) - y)^2 } } }
$$
(note the cancellation of one of the square root factors.)
Note that if we set $R_x = 0$ in this new integral and perform the substitution $1 - 2 \lambda = \sin \theta$, we obtain
$$ | {
"domain": "physics.stackexchange",
"id": 95683,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "potential, magnetostatics",
"url": null
} |
electromagnetism, magnetic-fields, electromagnetic-induction, dipole-moment, ferromagnetism
Title: What is the difference between paramagnetic and ferromagnetic? What is the difference between paramagnetism and ferromagnetism?
Before answering, I want to note my difference between the rest of the similar questions on this website: from what I think I know, ferromagnetism are the materials that can be magnetised (if being put under a magnetic field) perfectly such that each small magnetic dipole of the material points in the same dirección, while paramagnetic materials can also be magnetised but with les strength. | {
"domain": "physics.stackexchange",
"id": 93606,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "electromagnetism, magnetic-fields, electromagnetic-induction, dipole-moment, ferromagnetism",
"url": null
} |
programming, cirq
The list-of-moments structure seems to be a nice sweet spot in terms of flexibility, ease of production, and ease of consumption. You can certainly put the abstraction boundary in other places, but that's where we've found ourselves pulled towards. | {
"domain": "quantumcomputing.stackexchange",
"id": 1093,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "programming, cirq",
"url": null
} |
4 2 22 e) 1 ( ) 1 1 3 f x x Honors Algebra 2 Notes: Graphs of Quadratic Functions Transformations/Intro to Vertex Form Name The base parabola has a step pattern of 1,2,5,7 (the step pattern can never be negative). We can see this by expanding out the general form and setting it equal to the standard form. The equation for a basic parabola with a vertex at (0, 0) is y = x 2. Vertex Form and Transformations A. Vertex form is the form of the quadratic equation that will allow us to use transformations to graph. With the vertex form of a quadratic relation, determining things like the vertex of the parabola, the axis of symmetry, whether the parabola will open upwards or downwards, and whether the vertex will be maximum or minimum value is very simple, and can done by simply looking at the equation. Below you can see the graph and table of this function rule. The vertex form of a parabola contains the vital information about the transformations that a quadratic functions undergoes. The | {
"domain": "mediakommunikation.se",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9748211582993982,
"lm_q1q2_score": 0.8343018100026284,
"lm_q2_score": 0.8558511506439708,
"openwebmath_perplexity": 731.1402702819819,
"openwebmath_score": 0.5322927832603455,
"tags": null,
"url": "https://mediakommunikation.se/equidae-family-epchc/01359c-transformations-of-quadratic-functions-in-vertex-form"
} |
If you're not seeing the utility of the binomial theorem, then I think you're missing an important observation:
The coefficients of every term can be calculated extremely efficiently (your example of $(x-4)^6$ is easy to expand by hand with the binomial theorem, without, it's doable but very tedious).
A useful shorthand for lower powers of the exponent is to remember the first few rows of Pascal's Triangle along with the rule for adding more if you need them. Example of first few rows:
$$1$$ $$1\qquad 1$$ $$1\qquad 2\qquad 1$$ $$1\qquad 3\qquad 3\qquad 1$$ $$1\qquad 4\qquad 6\qquad 4\qquad 1$$ $$1\qquad 5\qquad 10\qquad 10\qquad 5\qquad 1$$ $$1\qquad 6\qquad 15\qquad 20\qquad 15\qquad 6\qquad 1$$
The last row gives the coefficients of $x^k\cdot(-4)^{(6-k)}$ for $k$ running from $0$ to $6$. Computing $(-4)^{(6-k)}$ is easy enough by hand, and multiplying it by the relevant entry in the last row above is also fairly easy (give it a try). | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9890130563978902,
"lm_q1q2_score": 0.8774569298320326,
"lm_q2_score": 0.8872045966995027,
"openwebmath_perplexity": 465.86158679560197,
"openwebmath_score": 0.8282362222671509,
"tags": null,
"url": "https://math.stackexchange.com/questions/2087099/is-the-binomial-theorem-actually-more-efficient-than-just-distributing/2087103"
} |
graph of any quadratic equation y = a x 2 + b x + c, where a, b, and c are real numbers and a ≠ 0, is called a parabola. We introduce the vertex and axis of symmetry for a parabola and give a process for graphing parabolas. The presence of such cusps is a common characteristic of evolutes. Pluto does not have a perfectly round orbit, and that means that its orbit is elliptical in. Power functions. Are rainbows parabolas? Parabolas in the Real World: Mathematically speaking, a parabola is a graph of a quadratic equation. _____Which best describes the graph of a quadratic function with a discriminant of -3. Parabolas have important applications in physics, engineering, and nature. ; Lesson 2: Find the vertex, focus, and directrix, and draw a graph of a parabola, given its equation. When light falls on a parabolic mirror parallel to its axis of symmetry, it is reflected by a mirror in such a way that all individual rays are intersecting in the focal point of a parabola. Finding the | {
"domain": "clubita.it",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.977022625406662,
"lm_q1q2_score": 0.828483681796717,
"lm_q2_score": 0.8479677545357569,
"openwebmath_perplexity": 1010.6001698445668,
"openwebmath_score": 0.3985465466976166,
"tags": null,
"url": "http://qhgo.clubita.it/parabolas-in-nature.html"
} |
rule in financial theory, one would expect a higher premium, or return, for a riskier investment. Use a specific formula to figure out the discount yield on your Treasury Bill. By taking the time to learn and master these functions, you’ll significantly speed up your financial modeling. In materials science and engineering, the yield point is the point on a stress-strain curve that indicates the limit of elastic behavior and the beginning of plastic behavior. This has been a guide to YIELD function in Excel. Definition of First Time Yield (FTY): The number of good units produced divided by the number of total units going into the process. Rental yield calculator. To help them calculate the yield rate for multiple job posts easily, we have created a very simple Yield Rate Calculator with predefined formulas. YTM is used in the calculation of bond price wherein all probable future cash flows (periodic coupon payments and par value on maturity) are discounted to present value on the basis | {
"domain": "cig-beauty.com",
"id": null,
"lm_label": "1. YES\n2. YES\n\n",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.967899295134923,
"lm_q1q2_score": 0.8460187398095578,
"lm_q2_score": 0.8740772351648677,
"openwebmath_perplexity": 1506.9982128632864,
"openwebmath_score": 0.41934362053871155,
"tags": null,
"url": "http://www.cig-beauty.com/3zk0oib/icuity.php?id=6797f7-yield-rate-formula"
} |
beginner, c
double th_dt = aerial_throttle_accel * simulation_dt;
double ms_th_dt = ms - th_dt;
// this is basically the same as above, but it's for after the car jumps (if it does at all)
while (d > min_simulation_distance && t <= *max_time)
{
// yes, this IS max_speed, NOT max_speed_no_boost!
if (v <= ms_th_dt)
v += th_dt;
if (b > bc_dt && v < ms_ba_dt)
{
v += ba_dt;
if (b <= max_boost)
b -= bc_dt;
}
d -= v * simulation_dt;
t += simulation_dt;
}
return d <= min_simulation_distance;
} | {
"domain": "codereview.stackexchange",
"id": 40161,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "beginner, c",
"url": null
} |
slam, navigation, odometry, robot-localization, rtabmap
My question is: since rtabmap performs localization upon loop closure, is there a way to propagate this information to the robot_localization process of the input such that the covariance of the "input" odometry stays bounded? Is this even necessary, and if not, does it mean it's okay for the odometry input to rtabmap to stay unbounded? | {
"domain": "robotics.stackexchange",
"id": 36551,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "slam, navigation, odometry, robot-localization, rtabmap",
"url": null
} |
java
Enum with some logic:
@RequiredArgsConstructor
public enum LabelStyle {
DECIMAL("Decimal"),
ROMAN_LOWER("Roman lower"),
ROMAN_UPPER("Roman upper"),
LETTER_UPPPER("Letters upper"),
LETTER_LOWER("Letters lower"),
NONE("None");
private final String style;
static LabelStyle fromPdfBoxString(final String style) {
if (style == null) {
return NONE;
}
return switch (style) {
case "D" -> DECIMAL;
case "r" -> ROMAN_LOWER;
case "R" -> ROMAN_UPPER;
case "a" -> LETTER_LOWER;
case "A" -> LETTER_UPPPER;
default -> NONE;
};
}
}
Simple record:
public record Label(
int startPage,
String label,
LabelStyle style) {
} | {
"domain": "codereview.stackexchange",
"id": 44855,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "java",
"url": null
} |
fft, fourier-transform, python, normalization
Title: How to normalize the FFT? I want to normalize my FFT signal. From this page it says that we can normalize it by dividing the FFT result by the lenght of the signal in time domain.
On the other hand, my supervisor told me that to normalize it, I need to divide the FFT by the sampling frequency. Both methods don't deliver the same results, as you can see in my plots.
EDIT:
now I plotted the signal in time domain, in frequency domain and the Power spectrum of my signal to show my point
Which one is the right method ? And what is the physical meaning of those methods for normalizing?
Here is my code in python:
def PS_normfreq(time_signal, f_sampling):
''' Calculate the Power spectrum of a signal in time domain'''
fft = np.fft.fft(time_signal) / f_sampling
PS = np.real(fft * np.conjugate(fft))
return PS | {
"domain": "dsp.stackexchange",
"id": 12403,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "fft, fourier-transform, python, normalization",
"url": null
} |
javascript, beginner, html, sorting
BARS_DATA[i - 1].style.background = 'red';
BARS_DATA[i].style.background = 'red';
setTimeout(function() {
//Highlight the bars that are about to be compared
var left_val = parseInt(BARS_DATA[i - 1].innerHTML);
var right_val = parseInt(BARS_DATA[i].innerHTML);
if (left_val > right_val) {
switched = true;
switch_bars(BARS_DATA[i - 1], BARS_DATA[i])
}
bubble_sort(i + 1, switched)
}, 50);
}
function switch_bars(bar1, bar2) {
bar1_value = bar1.innerHTML
bar1_width = bar1.style.width
bar2_value = bar2.innerHTML
bar2_width = bar2.style.width
//Perform switch
bar1.innerHTML = bar2_value
bar1.style.width = bar2_width
bar2.innerHTML = bar1_value
bar2.style.width = bar1_width
}
</script>
</body>
</html> | {
"domain": "codereview.stackexchange",
"id": 38174,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "javascript, beginner, html, sorting",
"url": null
} |
ros, rviz, pcl, pcl-1.7, publisher
it works O_O
EDIT4:
I took over almost the complete code of the pcd_to_cloud tool (removed the waiting interval and replaced it with ros::Rate:
#include <ros/ros.h>
#include <pcl/io/io.h>
#include <pcl/io/pcd_io.h>
#include <pcl/point_types.h>
#include <pcl_ros/publisher.h>
#include <pcl_conversions/pcl_conversions.h>
#include <ros/publisher.h>
#include <string>
class PMDCloudPublisher
{
protected:
std::string tf_frame;
ros::NodeHandle nh;
ros::NodeHandle private_nh;
public:
sensor_msgs::PointCloud2 cloud;
std::string file_name, cloud_topic;
pcl_ros::Publisher<sensor_msgs::PointCloud2> pub;
PMDCloudPublisher()
: tf_frame("/base_link"),
private_nh("~")
{
cloud_topic = "cloud";
pub.advertise(nh, cloud_topic.c_str(), 1);
private_nh.param("frame_id", tf_frame, std::string("/base_link"));
ROS_INFO_STREAM("Publishing data on topic \"" << nh.resolveName(cloud_topic) << "\" with frame_id \"" << tf_frame << "\"");
} | {
"domain": "robotics.stackexchange",
"id": 22380,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "ros, rviz, pcl, pcl-1.7, publisher",
"url": null
} |
c++, c++11, memory-management, networking
Again, I didn't check conformance to the specs. I also already mentioned to you how most of the explicit instantiations aren't needed.
I'd also write sizeof field0 + sizeof field1 + ... for computing the various sizes that you need rather than subtracting from the total size. I'd do that for clarity and I don't think it's a correctness issue however. | {
"domain": "codereview.stackexchange",
"id": 535,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "c++, c++11, memory-management, networking",
"url": null
} |
electrical-engineering, power-electronics, power-engineering
Power everything up and have fun with your project :)
EDIT:
To answer the question in the title.
The level shifter will not convert power in the sense that you can input 3.3v and output 5v to power something with the 5v.
It will "translate"/change the voltages of the signals you connect to A and B.
It has a low voltage side (A) and a high voltage side (B).
If you send a signal to A1 at the A side voltage the same signal will be output at B1 but at the B side voltage.
This shifter is bidirectional so inputting B level signals at the B pins will output the same signals at A level on the A pins.
The A level is set by what you input on the LV-pin and the B level on the HV-pin. The LV and HV voltages can come from anywhere, but you need to supply both. Since the pi has both it's probably easiest to take them both from the pi. | {
"domain": "engineering.stackexchange",
"id": 3830,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "electrical-engineering, power-electronics, power-engineering",
"url": null
} |
quantum-field-theory, quantum-information, fermions, bosons, grassmann-numbers
In a slight generalization, one calls any collection of creation/annihilation operators bosonic or fermionic modes according to their commutation relations, regardless of whether they arose from a quantum field or were just given in some other way. | {
"domain": "physics.stackexchange",
"id": 26228,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "quantum-field-theory, quantum-information, fermions, bosons, grassmann-numbers",
"url": null
} |
c++, beginner, simulation, sdl
if (ops_entry == ops.end())
{
std::cout << "op not found!" << "\n";
return EXIT_SUCCESS;
}
ops_entry->second(opcode);
return EXIT_SUCCESS;
}
Member functions that don't change any internal state should be declared const, e.g.:
bool get_draw_flag() const;
std::uint8_t get_pixel_data(int i) const;
std::uint8_t get_sound_timer() const;
(I'll try to come back to this later if I have some more time). | {
"domain": "codereview.stackexchange",
"id": 35571,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "c++, beginner, simulation, sdl",
"url": null
} |
java, algorithm, unit-testing, trie
Of course, any other suggestion is also welcome.
What I already know could be improved:
I intentionally left out the isLeaf part for now. (Which tells, for each node, if it is the end of a complete word. E.g., if we had a "path" for hello, then both the o at the end, as well as the last l could have the isLeaf flag set to true.)
string2Coll method could be written in a more elegant way, using Java 8 (but for some reason my Eclipse can not set Java 8 code generation, although I have JDK for Java 8 installed -- and at this point, I'm not too interested in that aspect)
For the record, I checked in this code into my github repository, and probably I'll improve it based on the answers from here.
Trie.java
package trie;
import java.util.Collection;
import java.util.HashMap;
import java.util.Map;
public class Trie<E> {
private static class Node<E> {
private Map<E, Node<E>> children = new HashMap<>(); | {
"domain": "codereview.stackexchange",
"id": 28483,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "java, algorithm, unit-testing, trie",
"url": null
} |
python
for folder, subfolders, filenames in os.walk(basedir):
can be
for folder, _, filenames in os.walk(basedir):
since you never use subfolders, there is no need to load the reader with yet another name.
if not os.path.exists(basedir):
print("This path does not exist.")
continue
else:
else is redundant and adds an extra level of nesting.
if not deletedir:
break
elif not os.path.exists(deletedir):
Again no need to write elif, just if will fit.
continue
else:
Same story. Try adding blank lines after control statements like break and continue to see where the execution can end preemptively.
Function get_size() doesn't get any size, it gets dicts of large files and folders and should be named accordingly, e.g. get_large_files().
find_size again, doesn't tell what the name is for, could be min_size.
Overall pretty clean code, keep it up! | {
"domain": "codereview.stackexchange",
"id": 43936,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "python",
"url": null
} |
structural-biology, definitions
The only way we really know that the molecular structure model is correct is that it generates as accurately as possible the intensities that were experimentally measured.
R, which I believe stands for residual, is a fractional difference between the measured intensities and what any proposed molecular model gives.
The residual is calculated as the absolute value of F(model)-F(measured). This means that 0.0 is a perfect match while 1.0 is a perfectly awful fit that shows the model is perfectly awful.
In practice 0.60 is usually as bad as random model will give you (there's a statistical argument as to why it doesn't go higher). Also the measurements are usually not perfect - they contain errors in measurements or artifacts from imperfect crystals or the detector, so an R value of < 0.20 (20%) is typically what you see in a reasonable paper. I think its commonly less than 0.15 for most structures now in fact. | {
"domain": "biology.stackexchange",
"id": 447,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "structural-biology, definitions",
"url": null
} |
quantum-chemistry, electrons, terminology
The textbook says that electrons can exist in two states simultaneously. As I went further, I saw that an electron could exist as both a particle and a wave. So I thought that this must be the states that I was introduced to earlier, until I was learning about quantum mechanics.
In the text above, the writer was talking about electron states with well defined energy. From what I know the electron state that has well defined energy would be one with well defined velocity. And the velocity of an electron is associated with it's wave nature.
So, aren't we supposed to be dealing with electron as waves only? Or what exactly does the writer mean by the electron states?
Reference | {
"domain": "chemistry.stackexchange",
"id": 14350,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "quantum-chemistry, electrons, terminology",
"url": null
} |
pcl, ros-indigo
//usr/lib/libpq.so.5: undefined reference to `ERR_get_error@OPENSSL_1.0.0'
//usr/lib/libpq.so.5: undefined reference to `CRYPTO_set_locking_callback@OPENSSL_1.0.0'
//usr/lib/libpq.so.5: undefined reference to `SSL_load_error_strings@OPENSSL_1.0.0'
//usr/lib/libpq.so.5: undefined reference to `SSL_new@OPENSSL_1.0.0'
//usr/lib/libpq.so.5: undefined reference to `X509_NAME_get_text_by_NID@OPENSSL_1.0.0'
//usr/lib/libpq.so.5: undefined reference to `SSL_write@OPENSSL_1.0.0'
//usr/lib/libpq.so.5: undefined reference to `X509_free@OPENSSL_1.0.0'
//usr/lib/libpq.so.5: undefined reference to `SSL_CTX_load_verify_locations@OPENSSL_1.0.0'
//usr/lib/libpq.so.5: undefined reference to `SSL_free@OPENSSL_1.0.0'
//usr/lib/libpq.so.5: undefined reference to `SSL_ctrl@OPENSSL_1.0.0'
//usr/lib/libpq.so.5: undefined reference to `SSL_set_verify@OPENSSL_1.0.0'
//usr/lib/libpq.so.5: undefined reference to `ENGINE_init@OPENSSL_1.0.0'
//usr/lib/libpq.so.5: undefined reference to `SSL_set_fd@OPENSSL_1.0.0' | {
"domain": "robotics.stackexchange",
"id": 21986,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "pcl, ros-indigo",
"url": null
} |
python, python-3.x, console, linux, installer
Title: Systemd service configuration helper script I've written a script that semi-automates the process of configuring/creating a new systemd service.
The script is working perfectly well, however, I've had some trouble with the styling and readability, as well as with the argparse logic (argument parsing works well, but there is just too much to handle manually and not automatically with argparse, because I have many arguments and they have different requirements) - I don't know if what I've done is best practice, because to me right now, it looks like a very poor idea.
The script right now loads a default schema (template) and allows the user to interactively configure a service using the options that are present in that template.
Notes: Version of Python used is 3.5. | {
"domain": "codereview.stackexchange",
"id": 32027,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "python, python-3.x, console, linux, installer",
"url": null
} |
lo.logic, proof-theory
and the informal proposition: $P \equiv \text{ M doesn't halt in less than 90 steps}$
$P$ can be converted to a formula $\varphi$ in PA; and this $\varphi$ must "embed" a symbolic representation of M and some kind of operational semantic. But can the conversion be done efficiently (polynomial time and space)?
Furthermore there is a trivial "informal" short proof of $P$, but does the corresponding formal proof in PA ($\mathcal F \vdash \varphi$) have a polynomial length size with respect to $|\varphi|$?
Edit: as noted by Kaveh the "informal" term above is confusing.
I could restate the two questions above in this way: if $P$ is a true mathematical statement that is expressible both in ZFC (as $\varphi'$) and PA (as $\varphi$). Is it always true that $| \varphi | \in O(|\varphi'|^k)$ for some fixed $k$ independent of $P$? What about the size of the corresponding proofs in the two axiomatizations (assuming that $\varphi'$ is provable in ZFC and $\varphi$ is provable in PA)? | {
"domain": "cstheory.stackexchange",
"id": 4218,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "lo.logic, proof-theory",
"url": null
} |
swift, ios
private func random() -> Theme {
let max = Theme.weather.rawValue
let randomIndex = arc4random_uniform(max + UInt32(1))
return Theme(rawValue: randomIndex) ?? Theme.halloween
}
/**
get a random array of themed icons
- Author:
Anna
*/
func getRandomThemeIcons() ->[String] {
return getThemeIcons(by: random())
}
}
import UIKit
class ViewController: UIViewController {
private lazy var game = Concentration(numberOfPairsOfCards: numberOfPairsOfCards)
var numberOfPairsOfCards: Int {
return (cardButtons.count + 1) / 2
}
@IBOutlet weak var finishedLabel: UILabel!
@IBOutlet weak var scoreCountLabel: UILabel!
@IBOutlet weak var flipCountLabel: UILabel!
private var flipCount = 0 {
didSet {
flipCountLabel.text = "Flip Count: \(flipCount)"
}
}
private var scoreCount = 0 { didSet { scoreCountLabel.text = "Score: \(scoreCount)"} } | {
"domain": "codereview.stackexchange",
"id": 30770,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "swift, ios",
"url": null
} |
condensed-matter, definition
Title: Relative Change of Volume Simple question, in materials publications I often see the relative change of volume in a system reported as
$$ \Delta \left (V \right )/V $$
is the denominator volume supposed to be initial or the final volume? I would assume it is the final volume as it likely parallels the relative error calculation, but I'd like to make sure.
-- It occurs to me that this is actually very likely dependent on the situation, still input would be appreciated. Usually, as for example in the formula that estimates volumetric thermal expansion
$$\frac{\Delta V}{V} = \beta \Delta T$$
$V$ represents initial volume.
Actually, the real definition of volumetric thermal expansion coefficient $\beta$ is stated in the differential form
$$\frac{\text{d} V}{V} = \beta \text{d} T,$$ | {
"domain": "physics.stackexchange",
"id": 2858,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "condensed-matter, definition",
"url": null
} |
• If the first term is $$a_1$$ and the common difference of successive members is $$d$$, then the $$n_{th}$$ term of the sequence is given by:
$$a_ n=a_1+d(n-1)$$
• In any evenly spaced set the arithmetic mean (average) is equal to the median and can be calculated by the formula $$mean=median=\frac{a_1+a_n}{2}$$, where $$a_1$$ is the first term and $$a_n$$ is the last term. Given the set $$\{7,11,15,19\}$$, $$mean=median=\frac{7+19}{2}=13$$.
• The sum of the elements in any evenly spaced set is given by:
$$Sum=\frac{a_1+a_n}{2}*n$$, the mean multiplied by the number of terms. OR, $$Sum=\frac{2a_1+d(n-1)}{2}*n$$
• Special cases:
Sum of n first integers: $$1+2+...+n=\frac{1+n}{2}*n$$
Sum of n first odd numbers: $$a_1+a_2+...+a_n=1+3+...+a_n=n^2$$, where $$a_n$$ is the last, $$n_{th}$$ term and given by: $$a_n=2n-1$$. Given $$n=5$$ first odd integers, then their sum equals to $$1+3+5+7+9=5^2=25$$. | {
"domain": "gmatclub.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9770226314280634,
"lm_q1q2_score": 0.8668189653116194,
"lm_q2_score": 0.8872045922259088,
"openwebmath_perplexity": 711.1701522916192,
"openwebmath_score": 0.8090343475341797,
"tags": null,
"url": "https://gmatclub.com/forum/math-number-theory-broken-into-smaller-topics-91274.html"
} |
ros, ros-melodic, ik, cartesian, ur10
Comment by hopestartswithu on 2021-05-06:
I worded it extremely bad I guess. Sorry. I was working with quaternions for normal planning but couldn't use it for cartesian (I had another post where fvd helped me out alot with orientation and went with his solution). So I was testing random stuff because I didn't know any more and that seemed to work really well so I didn't dug deeper into quaternions. Once I got into IK problems I switched solvers. I really don't know if it's that part being problematic because, as I said, KDL didn't have any problems. I actually do use everything that's posted on top of the post and that's my current situation. Sorry again for writing that so bad.
I will write a small script and post it later (got too many uni lectures, sorry)
Comment by hopestartswithu on 2021-05-06:
While writing the python script I realised something very dumb of me: | {
"domain": "robotics.stackexchange",
"id": 36407,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "ros, ros-melodic, ik, cartesian, ur10",
"url": null
} |
ros, ros2, apt
Clearly, I'm missing something, but I have no idea what. Any help would be welcome!
Originally posted by Andy Blight on ROS Answers with karma: 33 on 2020-04-24
Post score: 1
Ubuntu 19.10 is not a supported platform for Eloquent Supported platforms are listed in REP 2000 That's why there are no packages available. The first line of the tutorial you linked to is, "Debian packages for ROS 2 Eloquent Elusor are available for Ubuntu Bionic."
When you tried to switch to a non-distro based version you were starting to try to install UpstreamPackages directly from the Ubuntu source repositories. Please see the discussion on that wiki page about mixing the sources which is giving you your conflicts.
Originally posted by tfoote with karma: 58457 on 2020-04-24
This answer was ACCEPTED on the original site
Post score: 1 | {
"domain": "robotics.stackexchange",
"id": 34826,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "ros, ros2, apt",
"url": null
} |
java, sql, authentication, jdbc
private void createAccountForUser(String username) {
try {
Connection conn = DriverManager.getConnection(DB_URL);
PreparedStatement prepStmt = conn.prepareStatement("INSERT INTO PaymentAccount (cash,userId) VALUES (?,?)");
prepStmt.setDouble(1, 0.00);
prepStmt.setInt(2, getUserID(username));
} catch (SQLException e) {
e.printStackTrace();
}
} | {
"domain": "codereview.stackexchange",
"id": 31367,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "java, sql, authentication, jdbc",
"url": null
} |
ignition-citadel
Title: what unit does joint controller use?
I sent joint controllers using radian to move the robot. See the video example
So this made me realized, what does the uni it use? Is it just rad only? The wheels are using joint_controllers btw.
Unfortunately, there is nothing mention on the doc. I doubt it's m/s or velocity. It's mostly working with rad to degree.
When I move the robot, it doesn't seem like a second to me. So that makes me wonder what unit is it using? So that way, i can figure the better and properly formula rather than throw sticks at it and hope for the best
Originally posted by kakcalu13 on Gazebo Answers with karma: 87 on 2022-06-17
Post score: 0
Oh, it's actually velocity
Interesting. If it's velocity then why did rad (degree * π/180) made the calculation working properly? Maybe its the formula that I was confused with.
If you know why, please comment because I'd love to know why! | {
"domain": "robotics.stackexchange",
"id": 4661,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "ignition-citadel",
"url": null
} |
algorithms, comparison, recommendation-systems
EDIT
D.W. has suggested a solution, but how do I implement it? Can you provide more detail? One approach is to use low-rank matrix factorization to approximate the ratings matrix, then use a nearest neighbors data structure.
In particular, let $M$ be the $m \times n$ ratings matrix, where $M_{ij}$ is the rating that user $i$ has provided to user $j$. Look for a $m\times r$ matrix $U$ and a $r \times n$ matrix $V$ such that $M$ is well-approximated by $UV$ (e.g., $||M-UV||$ is minimized, except that missing entries of $M$ are ignored). | {
"domain": "cs.stackexchange",
"id": 6951,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "algorithms, comparison, recommendation-systems",
"url": null
} |
roboearth
Originally posted by DontPanic on ROS Answers with karma: 15 on 2012-09-11
Post score: 0
Original comments
Comment by dornhege on 2012-09-11:
Do you have pcl installed?
Comment by DontPanic on 2012-09-11:
Definitely
Please always provide information such as the ros version you are using and have a look at the support guidelines.
Assuming that you are using Fuerte, I guess that the package you are trying to compile hasn't been updated yet. I cannot find a file transform.h in pcl so I think that it has been renamed. Try editing the file ar_kinect_extraobject.cpp and change the include line to include transforms.h. Since the package doesn't seem to be ported yet, I would expect further problems, not just this include line.
Originally posted by Lorenz with karma: 22731 on 2012-09-11
This answer was ACCEPTED on the original site
Post score: 0 | {
"domain": "robotics.stackexchange",
"id": 10975,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "roboearth",
"url": null
} |
nlp, data-cleaning, nltk, google-prediction-api
Title: Creating training data My task is to classify free text originated from customer complaints about our product.
I have created a Taxonomy and have around 10 different categories. I've realized that these categories include keywords.
Example:
"Customer doesn't understand how to use the product".
Keywords: understand, knowledge, know, aware.
Record:
Training, Customer doesn't understand how to use the product
I'm using Google Prediction API. When training the model, I would categorize previous text as: "Customer doesn't understand how to use the product" - Training.
How can I add keywords to free text/training data to help the model perform better and provide a better confidence level?
Data in training set:
Training, understand knowledge know aware
Training, Customer doesn't understand how to use the product | {
"domain": "datascience.stackexchange",
"id": 702,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "nlp, data-cleaning, nltk, google-prediction-api",
"url": null
} |
c++, performance, parsing
This is much easier to read and understand and avoids the various goto calls that made the other version difficult to understand. | {
"domain": "codereview.stackexchange",
"id": 29716,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "c++, performance, parsing",
"url": null
} |
beginner, c
MAXLINE is not necessarily the same as LINECOUNT_N
Better as:
// char minCharsLine[MAXLINE][MAXLINE];
#define LINECOUNT_N 1024
char minCharsLine[LINECOUNT_N][MAXLINE];
MAXLINE versus alternates
Many off-by-one errors stem from not being clear.
MAXLINE sounds like the maximum returned strlen(line). To achieve that length, the array size needed is MAXLINE + 1.
Perhaps:
#define MAXLINE 80
#define LINE_SIZE (MAXLINE + 1)
char line[LINE_SIZE];
// or
#define MAXLINE 80
char line[MAXLINE + 1]; | {
"domain": "codereview.stackexchange",
"id": 44238,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "beginner, c",
"url": null
} |
• by u-substitution? last one? – RE60K Apr 12 '15 at 5:26
• @ADG. The integral of $\csc(x)$ is a common trig integral and the OP has probably seen it before and the integral of $\Big(\frac{\cos(x)}{\sin(x)} - \frac{\cos(x)}{(1 + \sin(x))}\Big)$ can be solved with a u-substitution. – user222031 Apr 12 '15 at 17:25
• why don't we use u at the beginning, what do we acheive with this manipulation? was my question actually. – RE60K Apr 13 '15 at 10:38
• @ADG. Based on the OP's comment they probably have not seen that substitution before, so it might have seemed unintuitive. I guess it's basically the same thing except the $t = \tan(\frac{x}{2})$ substitution is more versatile. – user222031 Apr 13 '15 at 15:03
Notice $\sin{x}+\cos{x}=\sqrt{2}\sin(x+\frac{\pi}{4})$
Setting $x+\frac{\pi}{4}=v$ it remains to evaluate
$\int \frac{1}{1+\sqrt{2}\sin{v}}dv$
Now we use Weierstrauss and it remains to compute
$\int \frac{2}{t^2+2\sqrt{2}t+1}dt=\int \frac{2}{(t+\sqrt{2})^2-1}dt$ | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9664104924150546,
"lm_q1q2_score": 0.8115277133196765,
"lm_q2_score": 0.839733963661418,
"openwebmath_perplexity": 646.9641302313153,
"openwebmath_score": 0.9608663320541382,
"tags": null,
"url": "https://math.stackexchange.com/questions/1230164/evaluate-int-fracdx1-sin-x-cos-x/1230167"
} |
ocean, environmental-protection
China claims almost the whole of the South China Sea, resulting in
overlapping claims with several other Asian nations including Vietnam
and the Philippines.
That story is based on a Jane's 360 analysis of satellite images:
The 23 March images show a paved section of runway 503 m by 53 m on
the northeastern side of Fiery Cross Reef, which China began to turn
into an island in late 2014. Paving and ground preparation of other
sections of the runway has also begun further along the island. In
addition, workers have paved about 400 m by 20 m of apron.
According to the Permanent Court of Arbitration on the wider South China Sea territorial dispute between China and the Philippines: (PDF)
...China had caused severe harm to the coral reef environment and
violated its obligation to preserve and protect fragile ecosystems and
the habitat of depleted, threatened, or endangered species. | {
"domain": "earthscience.stackexchange",
"id": 1435,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "ocean, environmental-protection",
"url": null
} |
javascript, jquery, json, ajax, instagram
$("#insta-4").append("<a target='_blank' href='" + data.data[3].link + "'><img src='" + size + "'></img></a>");
size = data.data[4].images.standard_resolution.url;
$("#insta-5").append("<a target='_blank' href='" + data.data[4].link + "'><img src='" + size + "'></img></a>");
size = data.data[5].images.standard_resolution.url;
$("#insta-6").append("<a target='_blank' href='" + data.data[5].link + "'><img src='" + size + "'></img></a>");
size = data.data[6].images.standard_resolution.url;
$("#insta-7").append("<a target='_blank' href='" + data.data[6].link + "'><img src='" + size + "'></img></a>");
size = data.data[7].images.standard_resolution.url;
$("#insta-8").append("<a target='_blank' href='" + data.data[7].link + "'><img src='" + size + "'></img></a>");
}
});
}
}
}();
$(document).ready(function () {
var strUser = "saturdaysnyc"; // Instagram username | {
"domain": "codereview.stackexchange",
"id": 7976,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "javascript, jquery, json, ajax, instagram",
"url": null
} |
Area Lesson 10-5 Area of Circles Lesson 10-6 Three-Dimensional Figures Lesson 10-7 Volume of prisms. Forehead bone 2. P = 4 pi and A = 12 pi B. Lesson 3 Reteach Area Of Composite Figures. Includes a whimsy color page for quick assessment. Chapter 8: Measure Figures; Lesson 3: Area of Composite Figures. A (page 17) 8. 2 Homework Answer Key | added by users. 935 m2 larger than the circle’s area. Have a class discussion with students explaining that total area is almost always an. When using Property 6 in reverse remember that the term from the logarithm that is subtracted off goes in the denominator of the quotient. Its multi-faceted nature has confounded a universal definition and hundreds of indices have been developed to characterise drought with a wide range of applications in mind (Lloyd-Hughes, 2014). -3-Answers to Finding the Area of a Circle 1) 452. In geometry (chapter 9), the focus is on area of polygons. 3 Volume of Pyramids, Cones. But I took the opportunity to add shares | {
"domain": "asdpallavolorossano.it",
"id": null,
"lm_label": "1. Yes\n2. Yes",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.959762057376384,
"lm_q1q2_score": 0.8119034559170478,
"lm_q2_score": 0.8459424392504908,
"openwebmath_perplexity": 2428.5326937190143,
"openwebmath_score": 0.3937196135520935,
"tags": null,
"url": "http://jgos.asdpallavolorossano.it/lesson-3-reteach-area-of-composite-figures-answer-key-page-123.html"
} |
ros, rosmsg, tutorials
['/opt/ros/hydro/share/roscpp_tutorials/msg'], 'move_base_msgs': ['/opt/ros/hydro/share/move_base_msgs/msg'], 'turtle_actionlib': ['/opt/ros/hydro/share/turtle_actionlib/msg'], 'python_orocos_kdl': ['/opt/ros/hydro/share/python_orocos_kdl/msg'], 'stage': ['/opt/ros/hydro/share/stage/msg'], 'tf2_geometry_msgs': ['/opt/ros/hydro/share/tf2_geometry_msgs/msg'], 'visualization_marker_tutorials': ['/opt/ros/hydro/share/visualization_marker_tutorials/msg'], 'rqt_shell': ['/opt/ros/hydro/share/rqt_shell/msg'], 'bondcpp': ['/opt/ros/hydro/share/bondcpp/msg'], 'rosconsole_bridge': ['/opt/ros/hydro/share/rosconsole_bridge/msg'], 'pluginlib_tutorials': ['/opt/ros/hydro/share/pluginlib_tutorials/msg'], 'camera_info_manager': ['/opt/ros/hydro/share/camera_info_manager/msg'], 'camera_calibration_parsers': ['/opt/ros/hydro/share/camera_calibration_parsers/msg'], 'rqt_bag_plugins': ['/opt/ros/hydro/share/rqt_bag_plugins/msg'], 'rosmsg': ['/opt/ros/hydro/share/rosmsg/msg'], 'rospy': | {
"domain": "robotics.stackexchange",
"id": 17510,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "ros, rosmsg, tutorials",
"url": null
} |
energy, energy-conservation
The answer to the simplified question is that when you pour water onto the ground, the water strikes the ground with a high velocity and generates heat due to the inelastic collision with the ground and the friction (viscosity) of the water. When you pour water onto the water wheel, the wheel slows the water down and extracts the potential energy from it so that when the water finally reaches the ground it has much less energy to give up.
So, pouring the water on the ground wastefully release all the energy at once when it hits the ground. Pouring it on the water wheel extracts some useful energy from it reducing the amount wasted on the ground. The total amount of energy spent by your body and the total amount of energy released is the same in both cases. | {
"domain": "physics.stackexchange",
"id": 19214,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "energy, energy-conservation",
"url": null
} |
a Parallelogram This video geometry lesson gives the prove of two parallelogram theorems. AC is splitting DB into two segments of equal length. x y The next theorem has for its hypothesis that a figure is a parallelogram, that is, the opposite sides are parallel. Proving the parallelogram diagonal theorem given: abcd is a parallelogram. iii) Find the area of the rectangular park. Given, 2). it is 17 feet wide. Proving the parallelogram diagonal theorem, Computers and Technology, 08.12.2020 02:20. sides of a ] … THEOREM: If a quadrilateral has diagonals which bisect each other, then it is a parallelogram. The perimeter of a stage is 116 feet. ∎ Theorem 4 . Hence, AE is conruent to CE and BE is congruent to DE. Special Parallelograms: Rhombus, Rectangles This video lesson discusses the properties of the special parallelograms: rectangle and rhombus. Both pairs of opposite sides are parallel. In a parallelogram where one pair of sides are parallel then the shape we have what is called a | {
"domain": "higgsme.ir",
"id": null,
"lm_label": "1. YES\n2. YES\n\n",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9553191259110588,
"lm_q1q2_score": 0.8100798140638624,
"lm_q2_score": 0.8479677545357568,
"openwebmath_perplexity": 1001.6566035361559,
"openwebmath_score": 0.626719057559967,
"tags": null,
"url": "https://higgsme.ir/adxb6i1d/cca795-proving-the-parallelogram-diagonal-theorem"
} |
ros, installation, package
And then follow the rest of the ROS install guide.
It also helps to set up a cron task to keep the repository synced, do this by uncommenting the line in /etc/cron.d/apt-mirror
#
# Regular cron jobs for the apt-mirror package
#
0 4 * * * apt-mirror /usr/bin/apt-mirror > /var/spool/apt-mirror/var/cron.log
Originally posted by mjcarroll with karma: 6414 on 2011-02-22
This answer was ACCEPTED on the original site
Post score: 11 | {
"domain": "robotics.stackexchange",
"id": 4832,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "ros, installation, package",
"url": null
} |
javascript, array, sorting
sourceAccount: 'A',
targetAccount: 'C',
amount: 250,
category: 'other',
time: '2018-03-02T10:33:00.000Z'
}
]
let targetList = [[{
id: 19,
sourceAccount: 'C',
targetAccount: 'D',
amount: 100,
category: 'eating_out',
time: '2018-03-02T10:33:00.000Z'
},
{
id: 17,
sourceAccount: 'C',
targetAccount: 'D',
amount: 100,
category: 'eating_out',
time: '2018-03-02T10:33:50.000Z'
},
{
id: 18,
sourceAccount: 'C',
targetAccount: 'D',
amount: 100,
category: 'eating_out',
time: '2018-03-02T10:34:10.000Z'
}],
[{
id: 1,
sourceAccount: 'A',
targetAccount: 'B',
amount: 100,
category: 'eating_out',
time: '2018-03-02T10:33:01.000Z'
},
{
id: 6,
sourceAccount: 'A',
targetAccount: 'B',
amount: 100,
category: 'eating_out', | {
"domain": "codereview.stackexchange",
"id": 39420,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "javascript, array, sorting",
"url": null
} |
rviz, ubuntu
The error was 'BadDrawable (invalid Pixmap or Window parameter)'.
(Details: serial 22 error_code 9 request_code 136 minor_code 3)
(Note to programmers: normally, X errors are reported asynchronously;
that is, you will receive the error a while after causing it.
To debug your program, run it with the --sync command line
option to change this behavior. You can then get a meaningful
backtrace from your debugger if you break on the gdk_x_error() function.)
[rviz-3] process has died [pid 16827, exit code 1].
log files: /home/adrian/.ros/log/1e62e032-4512-11e1-9e45-90004e158d56/rviz-3*.log
^C[robot_state_publisher-2] killing on exit
[rosout-1] killing on exit
[master] killing on exit
shutting down processing monitor...
... shutting down processing monitor complete
done | {
"domain": "robotics.stackexchange",
"id": 7953,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "rviz, ubuntu",
"url": null
} |
ros, setup.bash
Originally posted by Steven Bellens with karma: 735 on 2011-11-08
This answer was ACCEPTED on the original site
Post score: 4 | {
"domain": "robotics.stackexchange",
"id": 7236,
"lm_label": null,
"lm_name": null,
"lm_q1_score": null,
"lm_q1q2_score": null,
"lm_q2_score": null,
"openwebmath_perplexity": null,
"openwebmath_score": null,
"tags": "ros, setup.bash",
"url": null
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.