text stringlengths 1 1.11k | source dict |
|---|---|
c++, windows, embedded
QueryPerformanceCounter(&EndingTime);
ElapsedMicrosecondsDraw.QuadPart = EndingTime.QuadPart - StartingTime.QuadPart;
ElapsedMicrosecondsDraw.QuadPart *= 1000000;
ElapsedMicrosecondsDraw.QuadPart /= Frequency.QuadPart;
timeVectorDraw.push_back(ElapsedMic... | {
"domain": "codereview.stackexchange",
"id": 40674,
"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++, windows, embedded",
"url": null
} |
formal-methods, process-algebras
Title: Problem with definition of bisimilarity In my model checking class we have defined a bisimulation like this:
Let $K=(S,S_0,Act,R,L)$ and $K'=(S',S'_0,Act,R',L')$ be two kripke structures. A relation $B \subseteq S \times S'$ is called bisimulation if $\,\forall (s, s') \in B$ fo... | {
"domain": "cs.stackexchange",
"id": 13511,
"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": "formal-methods, process-algebras",
"url": null
} |
randomness, pr.probability, algebra, polynomials
Title: What's the bias of random polynomials with low degree over GF(2)? I have a question concerning low-degree polynomials and probability:
What is the (assyptotic behavior of the) probability that a
random* polynomial, $p$, over GF(2), with degree $\le d$ and n vari... | {
"domain": "cstheory.stackexchange",
"id": 1571,
"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": "randomness, pr.probability, algebra, polynomials",
"url": null
} |
verilog, fpga, system-verilog
endmodule Generally speaking, the code has consistent layout, is easy to understand, uses descriptive variable names and makes good use of parameters for constant values.
You have a good separation between sequential logic and combinational logic, and you take advantage of the additional ... | {
"domain": "codereview.stackexchange",
"id": 44950,
"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": "verilog, fpga, system-verilog",
"url": null
} |
# Joint PDF P[X+Y<=0.5]
I am having some difficulty with this probability that I need to compute, and I could use some help from other eyes to see where I am messing up:
Joint PDF: $$x+y$$ for $$0 < x < 1$$, $$0 < y < 1$$.
I need to find the $$P(x+y\leq 0.5)$$.
For the double integration, I have the following bound... | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES\n\n",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.971129090546975,
"lm_q1q2_score": 0.8006589607526862,
"lm_q2_score": 0.8244619263765707,
"openwebmath_perplexity": 486.69866795539576,
"openwebmath_score": 0.955306351184845,
"... |
algorithms, graphs, data-structures
Title: A question about the graph theory or data structure and algorithms I would like to ask this question as I am not sure about the answer.
Let $G=(V,E)$ be a connected, undirected graph, and let $x,y\in V$ be two different vertices. Let $A$ be the problem of finding the shortest... | {
"domain": "cs.stackexchange",
"id": 20564,
"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, graphs, data-structures",
"url": null
} |
javascript, html5, canvas
//continue looping
requestAnimationFrame(game.onFrame);
}
},
update: function(deltaTime){
//update the goat
this.goat.update(deltaTime);
},
draw: function(deltaTime){
this.clearCanvas(game.context);
//Draw the goat
... | {
"domain": "codereview.stackexchange",
"id": 6954,
"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, html5, canvas",
"url": null
} |
machine-learning, papers, bayesian-neural-networks, bayes-theorem
Title: Bayesian Perceptron: How is it compatible to Bayes Theorem? I found a very interesting paper on the internet that tries to apply Bayesian inference with a gradient-free online-learning approach: [Bayesian Perceptron: Bayesian Perceptron: Towards ... | {
"domain": "ai.stackexchange",
"id": 2803,
"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, papers, bayesian-neural-networks, bayes-theorem",
"url": null
} |
python, sampling
Assuming you don't have the resources to simply throw some cloud processing power on this problem and call it a day we have to restrict the complexity.
Note that this does not mean "sampling the data" which would indicate using only a subset of cases, as said in the beginning this isn't your problem.
... | {
"domain": "datascience.stackexchange",
"id": 8371,
"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, sampling",
"url": null
} |
image-processing, transform
Some other tricks may save you operations, but only quite few in comparison of the above numbers.
Finally, all of this should be balanced with material properties: acceleration, parallelization, CPU/GPU tricks, SIMD instructions can improve the above figures in practice. | {
"domain": "dsp.stackexchange",
"id": 3032,
"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": "image-processing, transform",
"url": null
} |
errors, pacbio, software-installation, blasr
- blasr
We have searched for the packages in the following channels:
- https://conda.anaconda.org/bioconda/osx-64
- https://conda.anaconda.org/bioconda/noarch
- https://conda.anaconda.org/conda-forge/osx-64
- https://conda.anaconda.org/conda-forge/noarch
- https... | {
"domain": "bioinformatics.stackexchange",
"id": 399,
"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": "errors, pacbio, software-installation, blasr",
"url": null
} |
electromagnetism, electrostatics, electric-fields, gauss-law, vector-fields
$$
\nabla\cdot \mathbf{E}=\frac1{\epsilon_0}\rho,\ \text{or equivalently}\
\oint_{\partial\Omega}\mathbf{E}\cdot\text d\mathbf{S}=\frac1{\epsilon_0}Q_\Omega,
$$
where $Q_\Omega=\int_\Omega\rho\,\text d\mathbf{r}$ is the electric charge in a v... | {
"domain": "physics.stackexchange",
"id": 11674,
"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, electrostatics, electric-fields, gauss-law, vector-fields",
"u... |
c++, optimization, multithreading, geospatial, pthreads
Title: Multithreaded GPS system I am trying to reduce the total execution time of my code.
I have a GPS system which calculates routes between two points, and returns all points in between them.
I did a simple profile and the calculation of the route takes on ave... | {
"domain": "codereview.stackexchange",
"id": 2753,
"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++, optimization, multithreading, geospatial, pthreads",
"url": null
} |
c#, design-patterns, .net, converting, framework
public class DogDescriptor
{
public string Name { get; set; }
}
public class Cat
{
public int Number { get; set; }
}
public class CatDescriptor
{
public int Number { get; set; }
}
So the plan is to convert from DogDescriptor to Dog and from CatDescriptor ... | {
"domain": "codereview.stackexchange",
"id": 7760,
"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#, design-patterns, .net, converting, framework",
"url": null
} |
python, python-3.x, file, generator
# Convert user_id to <class 'str'> if not already #
if type(user_id) == int:
user_id = str(user_id)
# Ensure user_id matches specifications #
if len(user_id) != 9 or not user_id.isdigit():
raise ValueError("ID should be 9 characters long and all digits."... | {
"domain": "codereview.stackexchange",
"id": 37204,
"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, file, generator",
"url": null
} |
formal-languages, regular-languages, finite-automata
But is there any way that we can PROVE that a language is regular if it is accepted by a DFA with more than one state? So for any given DFA with more than one initial state, are the languages that it accepts is regular? If so, how can I prove it? I know from Kleene'... | {
"domain": "cs.stackexchange",
"id": 9911,
"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": "formal-languages, regular-languages, finite-automata",
"url": null
} |
c++, beginner, algorithm, strings, regex
}
}
Output
1️⃣ Test Expression 1: ' 0 ' is a valid number.
2️⃣ Test Expression 2: ' 0 ' is a valid number.
3️⃣ Test Expression 3: ' 0 ' is a valid number.
1️⃣ Test Expression 1: ' 0.1 ' is a valid number.
2️⃣ Test Expression 2: ' 0.1 ' is a valid number.
3️⃣ T... | {
"domain": "codereview.stackexchange",
"id": 36268,
"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, algorithm, strings, regex",
"url": null
} |
circuit-construction, quantum-circuit, hamiltonian-simulation, hamiltonian, trotterization
Title: Is it possible to implement any random Hamiltonian using quantum circuit Are there any restrictions on implementing the evolution of any random Hamiltonian? Suppose I want to implement Rabi oscillations using a quantum c... | {
"domain": "quantumcomputing.stackexchange",
"id": 4489,
"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": "circuit-construction, quantum-circuit, hamiltonian-simulation, hamiltonian... |
rna-seq, rna-alignment, star
May there can be an issue in reference of wheat that I am using, I got this reference from here.
Here are the first ten lines of the reference using head command:
> head wheat.fa
>Pt dna:chromosome chromosome:TGACv1:Pt:1:135835:1 REF ... | {
"domain": "bioinformatics.stackexchange",
"id": 588,
"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": "rna-seq, rna-alignment, star",
"url": null
} |
php, mysql, mysqli
/**
* Wrapper for MySQLi_STMT->errno.
*
* @return int Error number for the last execution.
*
*/
public function getErrorNo()
{
return $this->statement_object->errno;
}
/**
* Wrapper for MySQLi_STMT->error.
*
* @return string Error mes... | {
"domain": "codereview.stackexchange",
"id": 367,
"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": "php, mysql, mysqli",
"url": null
} |
training, named-entity-recognition
Technically a sequence labeling model (this is the general name of the problem of which NER is a particular example) actually always annotates all the tokens. For example, POS tagging is another sequence labeling task in which all the tokens must be receive a label. In the case of th... | {
"domain": "datascience.stackexchange",
"id": 10850,
"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": "training, named-entity-recognition",
"url": null
} |
java, beginner, strings
public static void main(String[] args) throws IOException {
BufferedReader dataIn = new BufferedReader(new InputStreamReader(System.in));
System.out.print("Enter your password: ");
password = dataIn.readLine();
for ( int i = 0; i < password.length() ; i++ ) ... | {
"domain": "codereview.stackexchange",
"id": 11564,
"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, beginner, strings",
"url": null
} |
hamiltonian-formalism, phase-space, volume, chaos-theory, complex-systems
For the simple harmonic oscillator the area looks like the energy, but as the box shows us, that's a coincidence. I believe that there may be thermodynamic statements related to the entropy of the system, but for a single particle this isn't ver... | {
"domain": "physics.stackexchange",
"id": 90279,
"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": "hamiltonian-formalism, phase-space, volume, chaos-theory, complex-systems",
"url... |
predictive-modeling, multiclass-classification, accuracy, hypothesis-testing
Title: Calculating confidence interval for model accuracy in a multi-class classification problem In the book Applied Predictive Modeling by Max Kuhn and Kjell Johnson, there is an exercise concerning the calculation of a confidence interval ... | {
"domain": "datascience.stackexchange",
"id": 9637,
"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": "predictive-modeling, multiclass-classification, accuracy, hypothesis-testing",
... |
algorithms, intervals
Each interval corresponds to a job. For each interval $[L_i,R_i]$, Let $r_i = L_i$ be the release time, $d_i = R_i + 2$ be the deadline, and $p_i = 2$ be the job length. Then, single-machine no-preemption scheduling corresponds to a solution. Scheduling with non-integer start times can be convert... | {
"domain": "cs.stackexchange",
"id": 20621,
"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, intervals",
"url": null
} |
c, formatting, macros, variadic, gcc
/* untested */
#define sbprintf(buff, written, format, ...) \
( { \
alx_static_assert_array(buff); \
... | {
"domain": "codereview.stackexchange",
"id": 35049,
"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, formatting, macros, variadic, gcc",
"url": null
} |
- 3 years, 9 months ago
if x and y are real numbers satisfying x^3-3x^2+5x-17=0 and y^3-3y^2+5y+11=0 then the value of x+y=______
- 2 years, 7 months ago
2
- 2 months, 3 weeks ago
This is with regard to second part, although the approach could also be used for quadratic case. The general cubic equation is
$$a{ x ... | {
"domain": "brilliant.org",
"id": null,
"lm_label": "1. Yes\n2. Yes",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9539660976007597,
"lm_q1q2_score": 0.8253944366332565,
"lm_q2_score": 0.8652240773641087,
"openwebmath_perplexity": 658.959484182315,
"openwebmath_score": 0.9744016528129578,
"tags": n... |
atmosphere, geomagnetism, solar-terrestrial-physics, paleomagnetism, magnetosphere
As you can see, most of the charged particles are deflected away from Earth (orange lines), but a fraction of them gets funneled towards the poles through the so called "polar cusps" (yellow lines), that's why auroras (a.k.a. northern l... | {
"domain": "earthscience.stackexchange",
"id": 2153,
"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": "atmosphere, geomagnetism, solar-terrestrial-physics, paleomagnetism, magnetosp... |
javascript, ecmascript-6, event-handling
printName() {
console.log(this.name);
}
ondisable() {
this.sd.unregisterAll("List:1234", "print");
}
}
const sd = new StreamDispatcher();
const app = new App("my name is foo", sd);
sd.dispatch("List:1234", "print"); // my name is foo
app.name = "my name is bar";... | {
"domain": "codereview.stackexchange",
"id": 41072,
"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, ecmascript-6, event-handling",
"url": null
} |
c#, strings, converting
It always converts to Kilometers
Also, some helpers have only a single use, which makes them even more a waste of space. I would think that, for example, the following constructor code is more readable than yours, and saves you a method:
public Dimension(string architectural)
{
Architectu... | {
"domain": "codereview.stackexchange",
"id": 7022,
"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#, strings, converting",
"url": null
} |
newtonian-mechanics, simulations, collision
Title: Bullet: Piercing vs. Deflection I am trying to create a simulation where a projectile (imagine a bullet) is fired at a surface of some kind. When it collides with the surface, I need to figure out what happens between the bullet and surface.
Example:
Bullet fired at ... | {
"domain": "physics.stackexchange",
"id": 10713,
"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": "newtonian-mechanics, simulations, collision",
"url": null
} |
or y ⋅ y) is x. A set is called the power set of any set, if it contains all subsets of that set. Tool to understand sets of numbers N, Z, Q, R, I, C. Number sets are groups of numbers constructed by mathematicians in order to define them and classify them. Cartesian product of two sets. This web site owner is mathemat... | {
"domain": "zezenbeltz.eus",
"id": null,
"lm_label": "1. YES\n2. YES\n\n",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.975946446405965,
"lm_q1q2_score": 0.8111510958483881,
"lm_q2_score": 0.8311430394931456,
"openwebmath_perplexity": 685.1780129295474,
"openwebmath_score": 0.6768036484718323,
"tag... |
with Gnuplot: Homepage ; Addendum to Lecture 2/21: Generic Mergesorts ; Dynamic Programming: Fibonacci ; Maximum Continuous Subarray ; Homework 3: Problem 4. 1: For Example IV. What can we conclude about modified three way merge sort? A. pdf, Due Friday. 7 Recurrence Relations 7 Advanced Counting Techniques 7. 1 Select... | {
"domain": "fnaarccuneo.it",
"id": null,
"lm_label": "1. YES\n2. YES\n\n",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9850429125286726,
"lm_q1q2_score": 0.8449383995767705,
"lm_q2_score": 0.8577681122619885,
"openwebmath_perplexity": 1014.9281657158043,
"openwebmath_score": 0.5720400810241699,
"t... |
computer-architecture, cpu-cache
Title: Computing the hit and miss ratio of a cache organized as either direct mapped or two-way associative This is an example problem in a computer organization and architecture course that's giving me some trouble. It goes as follows:
Consider a cache of 4 lines of 16 bytes each. Ma... | {
"domain": "cs.stackexchange",
"id": 6831,
"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": "computer-architecture, cpu-cache",
"url": null
} |
java, beginner, object-oriented, array
final double minimumDifference =
IntStream
.range(1, distances.length)
.mapToDouble(i -> distances[i] - distances[i - 1])
.min()
.getAsDouble();
final double safeDistance = 5;... | {
"domain": "codereview.stackexchange",
"id": 31564,
"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, beginner, object-oriented, array",
"url": null
} |
c++, physics
Planet.h
#pragma once
#include <string>
#include <vector>
class Planet
{
public:
Planet(double mass, double radius, std::string name);
~Planet();
double getMass();
double getRadius();
std::string getName();
std::vector<double> x;
std::vector<double> y;
std::vector<doubl... | {
"domain": "codereview.stackexchange",
"id": 36849,
"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++, physics",
"url": null
} |
ros-kinetic
and I would like to create a broadcast between odom and world, or between any frame and world. What do you suggest?
Edit: with the help of PeteBlackerThe3rd, now the rqt_tf_tree is:
Originally posted by Dylan on ROS Answers with karma: 51 on 2019-07-16
Post score: 0
You don't create individual frames in ... | {
"domain": "robotics.stackexchange",
"id": 33442,
"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-kinetic",
"url": null
} |
gazebo, navigation, ros-melodic, costmap, husky
But the robot is not moving at all. I believe the error is in the move_base. In the terminal where i rosrun move_base, I am presented with the following errors:
[ WARN] [1593544033.915079325, 1332.320000000]: Timed out waiting for transform from base_link to map to bec... | {
"domain": "robotics.stackexchange",
"id": 35208,
"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": "gazebo, navigation, ros-melodic, costmap, husky",
"url": null
} |
homework-and-exercises, energy, electric-circuits, charge, capacitance
Edit to respond to the edited question
Congratulations on finding the effective capacitance. All the effective capacitance tells you is how the total charge relates to the total voltage. So use that (and the 100V) to find the total charge on each... | {
"domain": "physics.stackexchange",
"id": 20078,
"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": "homework-and-exercises, energy, electric-circuits, charge, capacitance",
"url": ... |
finite-automata
To begin the process of converting to DFA, I started off with the start state and noticed that if the input is a 1, this means it goes to qb, which would be represented as {qa qb}. I also think it would loop onto itself because if you have a 0 and are in that state, it goes back to qa (does this make s... | {
"domain": "cs.stackexchange",
"id": 5908,
"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": "finite-automata",
"url": null
} |
Note that both halves of the proof of Theorem VFSLS indicate that $\alpha_i=\vectorentry{\vect{x}}{f_i}$. In other words, the arbitrary scalars, $\alpha_i$, in the description of the set $S$ actually have more meaning --- they are the values of the free variables $\vectorentry{\vect{x}}{f_i}$, $1\leq i\leq n-r$. So we ... | {
"domain": "aimath.org",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9904406020637528,
"lm_q1q2_score": 0.8551381025177455,
"lm_q2_score": 0.8633916064586998,
"openwebmath_perplexity": 270.2393744512593,
"openwebmath_score": 0.8509752750396729,
"tags": nul... |
digital-communications, channelcoding, forward-error-correction
Thus, channel coding and modulation are two different steps that have different roles. For more details, you need to read the recommended resources in the comments.
It seems that you understand "convolutional coding" as modulation. Maybe it comes from the... | {
"domain": "dsp.stackexchange",
"id": 5169,
"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": "digital-communications, channelcoding, forward-error-correction",
"url": null
} |
python, dataset, pandas
Furthermore, there's no point indexing your DataFrame again with df.loc only to take the length of it... you might as well just use sum directly on the boolean vector to count the matches. Putting this together and using apply over the test DataFrame, you can achieve your same output with
tst_d... | {
"domain": "datascience.stackexchange",
"id": 1563,
"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, dataset, pandas",
"url": null
} |
python, python-3.x, postgresql, cryptocurrency
The chance that it will raise a ZeroDivisionError is only and only when your old is \$ 0 \$. Just add that condition in the prior if statement:
if now == old or old == 0:
return 0
and you won't need the try-except block anymore.
(ticker['symbol'].upper(),))
You kee... | {
"domain": "codereview.stackexchange",
"id": 29397,
"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, postgresql, cryptocurrency",
"url": null
} |
python, hash-map, socket, ip-address
# Then at the end of your function:
return IpLocalities(external_ips=external_ips, local_ips=local_ips)
The benefit here is multiple-fold. Printing this gives you the nice labels (like you had with dict):
IpLocalities(external_ips=['26.76.4.56'], local_ips=['10.0.1.1'])
But your ... | {
"domain": "codereview.stackexchange",
"id": 33622,
"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, hash-map, socket, ip-address",
"url": null
} |
bridges, prestressed-concrete, deflection
Long-term deflections are, however, influenced by one more factor, and that is the prestress' differed losses. Over time, the primary beams are going to try to shrink. This is due not only to the concrete's natural shrinkage, but also due to the prestress' compressive creep. I... | {
"domain": "engineering.stackexchange",
"id": 416,
"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": "bridges, prestressed-concrete, deflection",
"url": null
} |
## xkehaulanix 5 years ago The Taylor series about x=5 for a certain function f converges to f(x) for all x in the interval of convergence. The nth derivative of f at x=5 is given by fn(5)=[(-1)^n x n!]/[2^n x (n + 2)], and f(5)=1/2. The fn above should be "f to the nth derivative." a)Write the third-degree Taylor poly... | {
"domain": "openstudy.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9848109480714625,
"lm_q1q2_score": 0.8074399377924955,
"lm_q2_score": 0.8198933403143929,
"openwebmath_perplexity": 894.3809623374776,
"openwebmath_score": 0.8518220782279968,
"tags": ... |
c++, multithreading, concurrency, queue
Title: Work stealing queue I implemented work stealing queue inspired by Sean Parent's talk on code::dive 2016. Full implementation is here. I am looking to get feedback on improvements to make code more effective and common best practices.
TaskQueue is thread safe task queue. I... | {
"domain": "codereview.stackexchange",
"id": 26525,
"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++, multithreading, concurrency, queue",
"url": null
} |
\leq \sqrt[n]{c_N \beta^{-N}} \cdot \beta,$$ so that $$\limsup_{n \to \infty} \sqrt[n]{c_n} \leq \beta, \quad \quad (18)$$ by Theorem 3.20(b). Since (18) is true for every $$\beta > \alpha$$, we have $$\limsup_{n \to \infty} \sqrt[n]{c_n} \leq \alpha.$$ | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9664104972521579,
"lm_q1q2_score": 0.8289560938429013,
"lm_q2_score": 0.8577680977182187,
"openwebmath_perplexity": 263.527194194763,
"openwebmath_score": 0.8105267882347107,
"tags... |
One has for $f(X)=\frac{X^n-1}{X-1}=\prod\limits_{k=1}^{n-1}(X-e^{\frac{2ik\pi}{n}})$
$$\frac{f'(X)}{f(X)}=\sum\limits_{k=1}^{n-1}\frac{1}{X-e^{\frac{2ik\pi}{n}}}$$
So we have $\sum\limits_{k=1}^{n-1}\frac{1}{1-e^{\frac{2ik\pi}{n}}}=\frac{f'(1)}{f(1)}$
Now let us compute $\frac{f'(X)}{f(X)}=\frac{(n-1)X^{n-2}+(n-2)X... | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9805806484125338,
"lm_q1q2_score": 0.8213539307434192,
"lm_q2_score": 0.8376199673867852,
"openwebmath_perplexity": 375.2951162981941,
"openwebmath_score": 0.9912778735160828,
"tag... |
c, file, circular-list
if (!lcb)
return 1;
if (ferror(f))
return 2;
size_t buff_size = INITIAL_BUFF_SIZE;
char *buff = (char*)malloc(buff_size);
if (!buff)
return 1;
const size_t bytes_read = fread(buff, sizeof(char), buff_size, f);
if (ferror(f))
return 2;
... | {
"domain": "codereview.stackexchange",
"id": 11419,
"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, file, circular-list",
"url": null
} |
c++, concurrency
ConditionVariable.notify_one();
}
}
void Receiver() {
std::string data;
for (int i = 0; i < 5; ++i) {
{
std::unique_lock<std::mutex> unq_lck{Mutex};
ConditionVariable.wait(unq_lck, []() { return Free; });
data = std::move(DataGeneratedWithinSender);
Free = false;
... | {
"domain": "codereview.stackexchange",
"id": 44014,
"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++, concurrency",
"url": null
} |
quantum-mechanics, harmonic-oscillator, matrix-elements
0 & \sqrt{1} & 0 & 0 & \cdots\\
\sqrt{1} & 0 & \sqrt{2} & 0 & \cdots \\
0 & \sqrt{2} & 0 & \sqrt{3} & \cdots\\
0 & 0 & \sqrt{3} & 0 & \cdots \\
\vdots & \vdots & \vdots & \vdots & \ddots
\end{pmatrix}
\cdot\sqrt{\frac{\hbar}{2m\omega}}
\begin{pmatrix}
0 & \sqrt{1... | {
"domain": "physics.stackexchange",
"id": 68009,
"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, harmonic-oscillator, matrix-elements",
"url": null
} |
First letter could be sent from ANY of the seven postboxes - 7 (7 options);
Second letter could be sent from the SIX postboxes left - 6 (6 options);
Third letter could be sent from the FIVE postboxes left - 5 (5 options);
Total # of ways =7*6*5=210
2. what if there is no restriction, that is, if two or more letters c... | {
"domain": "gmatclub.com",
"id": null,
"lm_label": "1. Yes\n2. Yes\n",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 1,
"lm_q1q2_score": 0.84997116805678,
"lm_q2_score": 0.84997116805678,
"openwebmath_perplexity": 2026.540857085189,
"openwebmath_score": 0.8404483199119568,
"tags": null,
"url": "http... |
java, unit-testing, collections, junit, hash-map
Taboo class:
package assign1;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Set;
public class Taboo<T> {
public Map<T, Set<T>> rulesMap = new HashMap<>();
/**
... | {
"domain": "codereview.stackexchange",
"id": 20587,
"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, unit-testing, collections, junit, hash-map",
"url": null
} |
java, exception-handling
I see code like the above all over the place.... and it is broken. In one example, I have seen a 50% performance improvement on a CSV reading program by changing code like that to be:
int val = 0;
boolean isNumber = false;
if (someString.matches("\\d+")) {
try {
val = Integer.parseI... | {
"domain": "codereview.stackexchange",
"id": 7705,
"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, exception-handling",
"url": null
} |
pseudorandomness
Title: On the definition of pseudoentropy $\mathbf{Definition.}$ A random variable $X$ has pseudoentropy $k$ if it is computationally indistinguishable from a random variable $Y$ with $H(Y) = k$, where $H(Y)$ is the Shannon entropy of $Y$.
By this definition, can we say that any random variable has ps... | {
"domain": "cstheory.stackexchange",
"id": 3207,
"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": "pseudorandomness",
"url": null
} |
python, tkinter
def transpose(matrix: Sequence[Sequence[Real]]) -> List[List[Real]]:
return [
[
matrix[r][c] for r in range(len(matrix))
] for c in range(len(matrix[0]))
]
def adj(matrix: Sequence[Sequence[Real]]) -> List[List[Real]]:
return transpose(
[
[
... | {
"domain": "codereview.stackexchange",
"id": 42052,
"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, tkinter",
"url": null
} |
• Notice that $|x-1||y+3|$ is an integer between $2$ and $5$, so there are only few possibilities to check.
– Sil
Mar 22, 2021 at 11:26
• Since $x$ is a negative integer, $|x - 1| \geq 2.$ This means that $|y+3|$ must be less than $3$. Mar 22, 2021 at 11:27
• thanks for such quick responses...but can you please direct ... | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9793540698633748,
"lm_q1q2_score": 0.8052142754410744,
"lm_q2_score": 0.8221891348788759,
"openwebmath_perplexity": 310.6554377624969,
"openwebmath_score": 0.8996587991714478,
"tag... |
me clarify: the formula you gave gives the centroid **of the points**, not of the figure they enclose. Calculate the unknown defining surface areas, heights, slant heights, circumferences, volumes and radii of a conical frustum with any 3 known variables. calculate the angle α = Θ/2 = 121° {formula uses 1/2 the include... | {
"domain": "sicituradastra.it",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9830850852465429,
"lm_q1q2_score": 0.8296206869041551,
"lm_q2_score": 0.8438951005915208,
"openwebmath_perplexity": 560.3404868312341,
"openwebmath_score": 0.7373648285865784,
"tag... |
• This validates via the python script I wrote. – TemporalWolf May 8 '19 at 23:31
• @TemporalWolf: Thank you! I updated my answer for seven weeks. – Freddy Barrera May 9 '19 at 4:40
This is only a partial answer, which shows that the fewest number of weeks in which this can happen is either $$5$$ or $$6$$. I suspect t... | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9845754497285467,
"lm_q1q2_score": 0.8072468477700204,
"lm_q2_score": 0.8198933337131077,
"openwebmath_perplexity": 72.95437766835308,
"openwebmath_score": 0.2769103944301605,
"tag... |
ros, parameter
You could periodically call getParamCached(). It caches the value locally and subscribes to the parameter server for notification in the event of updates. So, the polling overhead is minimal.
Or, use dynamic_reconfigure. Even though it's marked unstable, the basic interfaces are widely used and will pro... | {
"domain": "robotics.stackexchange",
"id": 5488,
"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, parameter",
"url": null
} |
biochemistry, metabolism
Title: How do muscle cells synthesize glycogen? Hexokinase enzyme is present in all cells (including muscle cells) and can be suppressed by excessive G-6-P product. So that's why in the liver, glucokinase can act on glucose without inhibition of it despite excessive G-6-P product; that's why i... | {
"domain": "biology.stackexchange",
"id": 5239,
"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": "biochemistry, metabolism",
"url": null
} |
ros, c++, ros-kinetic, movegroup
int main(int argc, char **argv)
{
ros::init(argc, argv, "move");
ros::NodeHandle nh;
ros::AsyncSpinner spinner(1);
spinner.start();
moveit::planning_interface::MoveGroupInterface group("manipulator");
move_robot(group, pose1);
move_robot(group, pose2);
move_robot(grou... | {
"domain": "robotics.stackexchange",
"id": 33853,
"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, c++, ros-kinetic, movegroup",
"url": null
} |
energy, statistical-mechanics, partition-function
$L$ being the "length" of the space available. But I'm pretty sure that this integral does not converge.
Where am I wrong? Energy has to be bounded below. The relationship between energy & momentum in this case is $E_i = c |p_i|$, not $E_i =c p_i$. So the integral yo... | {
"domain": "physics.stackexchange",
"id": 5529,
"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, statistical-mechanics, partition-function",
"url": null
} |
human-genetics, sequence-analysis, homology
"First we aligned the current assemblies of human and chimpanzee, using the default nucmer4 options with 32 parallel threads ... We used human as the reference and chimpanzee as the query sequence. The human GRCh38 assembly contains 3.088 Gb of sequence while chimpanzee asse... | {
"domain": "biology.stackexchange",
"id": 12196,
"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-genetics, sequence-analysis, homology",
"url": null
} |
ros, memory, roscpp
Is there anyway around it?
This test was made with the program running for only 5 minutes, after two hours with my program running it slows down considerably because of this memory usage.
==== EDIT ====
I'm adding here an example code that shows this behavior in my laptop:
#include "ros/ros.h"
#in... | {
"domain": "robotics.stackexchange",
"id": 19939,
"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, memory, roscpp",
"url": null
} |
quantum-mechanics, harmonic-oscillator, molecules, matter, born-oppenheimer-approximation
$L_n^{1/2}(x^2)\propto H_n(x)$ (namely that associated Laguerre polynomials for null angular momentum case are proportional to Hermite p. of the same degree to make sure that eigenfunctions for 3d and 1d are the same). What am I ... | {
"domain": "physics.stackexchange",
"id": 81870,
"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, harmonic-oscillator, molecules, matter, born-oppenheimer-approx... |
convolutional-neural-networks, computer-vision
Title: Are CNNs exactly translation invariant with global max/average pooling layers? CNNs are naturally translation equivariant, meaning that if we translate the input, then the feature maps are translated the equally.
With the use of max/avg pooling layers, this transla... | {
"domain": "ai.stackexchange",
"id": 3712,
"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": "convolutional-neural-networks, computer-vision",
"url": null
} |
java, recursion, tree
Title: Code smell when recursively returning a List So this is part of my AVL tree implementation, namely the infix representation of the tree. Since I wanted to use a recursive method to stay close to the original algorithm and want to return a list, I have to store the values in a parameter.
Th... | {
"domain": "codereview.stackexchange",
"id": 21021,
"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, recursion, tree",
"url": null
} |
species-identification, arachnology
Title: Species Identification: Spider I usually would search for myself, but I need to be super sure about the identification because I need to know if I need to get an exterminator in here or not. (I think it might be a giant house spider, but don't let me influence your analysis.)... | {
"domain": "biology.stackexchange",
"id": 11291,
"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": "species-identification, arachnology",
"url": null
} |
We have $$\mathsf EY_\tau \geq \delta p$$ since $Y$ is a non-negative process, which leads to the inequality (2). End of the proof.
We can obtain (1) from (2) since $\sup\limits_{\tau\leq N} \,\,\,\mathsf EX_\tau = \mathsf E X_0$ if $X$ is a supermartingale. Taking $N\to\infty$ we obtain (1). | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9674102552339746,
"lm_q1q2_score": 0.8123672558745489,
"lm_q2_score": 0.8397339716830606,
"openwebmath_perplexity": 108.51864667558182,
"openwebmath_score": 0.9292986989021301,
"ta... |
algorithms, probability-theory, sets, randomness, sampling
Title: Returning a random subset with length k of N strings while only storing at most k of them Here's the problem. I've written a program that reads strings from stdin, and returns a random subset of those strings. The only other argument provided to the pro... | {
"domain": "cs.stackexchange",
"id": 3046,
"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, probability-theory, sets, randomness, sampling",
"url": null
} |
I see that you added some example problems at the bottom, and other community members could help add in the solutions. This is great :)
Staff - 6 years, 2 months ago
Thanks a lot!! Great to know that you liked the wiki; I really enjoyed writing it. Drawing and animating the diagrams was also fun :)
- 6 years, 2 mont... | {
"domain": "brilliant.org",
"id": null,
"lm_label": "1. YES\n2. YES\n\n",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9585377296574668,
"lm_q1q2_score": 0.8185075879763153,
"lm_q2_score": 0.8539127492339909,
"openwebmath_perplexity": 2269.8993141414376,
"openwebmath_score": 0.8850752115249634,
"ta... |
java, compression
/**
* Takes in a file name that is uncompressed, and will compress it's file
* contents and append a ".lzw" to the end of the current file name
*
* @param uncompressed - Name of uncompressed file being compressed
* @throws java.io.IOException - File input/output failure
... | {
"domain": "codereview.stackexchange",
"id": 18858,
"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, compression",
"url": null
} |
Now, we have:
$$Ax = \begin{bmatrix} 15 \\ 11 \\ 21 \end{bmatrix}.$$
Since the infinity vector norm is defined as:
$$\|x\|_{\infty} =\max_{1 \leq i \leq n} |x_i|$$
it follows that:
$$\|Ax\|_{\infty} = 21$$
and:
$$\|x\|_{\infty} = 3$$
But then we have:
$$\frac{\|Ax\|_{\infty}}{\|x\|_{\infty}} = \frac{21}3 = 7$$... | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9799765581257486,
"lm_q1q2_score": 0.8057260699876178,
"lm_q2_score": 0.8221891261650247,
"openwebmath_perplexity": 248.275586141645,
"openwebmath_score": 0.9208800792694092,
"tags... |
laser
Originally posted by Pi Robot on ROS Answers with karma: 4046 on 2017-09-08
Post score: 0 | {
"domain": "robotics.stackexchange",
"id": 28803,
"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": "laser",
"url": null
} |
homework-and-exercises, electric-fields, gauss-law
Calculate explicitly the electric field flow through the flat and curved surfaces of the semi-cylinder.
My attempt:
Let us first consider the two side covers of the cylinder. As the vector $\bar{E}$ is perpendicular to the normal vector of the two side covers then
$$\... | {
"domain": "physics.stackexchange",
"id": 78955,
"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": "homework-and-exercises, electric-fields, gauss-law",
"url": null
} |
c, tree
// printf("What should have Happened here Label %d %d %d \n",label, parentPointer->leftChild->data, parentPointer->leftChild-> label);
if(parentPointer != '\0' && child != '\0')
{
if((parentPointer->leftChild->label) == label) return parentPointer->leftChild;
... | {
"domain": "codereview.stackexchange",
"id": 13745,
"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, tree",
"url": null
} |
Your intuition is indeed wrong. It is correct in the sense that it's true that getting seven 1s in row is indeed very unlikely. But it's incorrect to think that it's more unlikely than any other 7-digit number.
Another way to think about this is that base 10 is completely arbitrary. Imagine you were an alien with 8 fi... | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9678992905050948,
"lm_q1q2_score": 0.818787088638337,
"lm_q2_score": 0.8459424411924673,
"openwebmath_perplexity": 691.0271739476518,
"openwebmath_score": 0.6561347842216492,
"tags... |
algorithms, complexity-theory, graphs, turing-machines, np-complete
# add a vertex to the graph
def add_vertex(self, vertex):
self.vertices.append(vertex)
# add an edge to the graph
def add_edge(self, vertex1, vertex2):
self.vertices[vertex1].add_neighbor(vertex2)
self.vertices[ver... | {
"domain": "cs.stackexchange",
"id": 20699,
"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, complexity-theory, graphs, turing-machines, np-complete",
"url": null
} |
machine-learning, deep-learning, time-series, forecasting
as you can see in the sample in the date lets pick up the 1-1-2020 we have multiple observations at the same date .
i want to predict the Price column as a Y_label and taking the categorical _fature_1, categorical _fature_2, Feature_1_numeric, and Feature_2_num... | {
"domain": "datascience.stackexchange",
"id": 9896,
"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, deep-learning, time-series, forecasting",
"url": null
} |
inorganic-chemistry, nomenclature, ions, coordination-compounds
Note that according to the recommendations in Item (iii), where possible, the coordinating (ligating) atom should be placed nearer the central atom in order to provide more information about the structure of the complex. Therefore, the line formula of the... | {
"domain": "chemistry.stackexchange",
"id": 5237,
"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": "inorganic-chemistry, nomenclature, ions, coordination-compounds",
"url": null
} |
java, game, weekend-challenge, playing-cards
From what I can tell, your tests are ordered in the reverse order to what they should be... you look for the lowest-ranking results first, and then the increasingly-higher results. If you reverse the order, you can 'short-circuit' the process and exit when you have your fir... | {
"domain": "codereview.stackexchange",
"id": 28066,
"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, weekend-challenge, playing-cards",
"url": null
} |
special-relativity, spacetime, time
Due to the the first premise (that there is no preferential frame), could we not also argue that the body at rest is actually travelling at a negative velocity relative to the other body? Thus, if we consider the situation in from this reversed perspective, a time contraction is the... | {
"domain": "physics.stackexchange",
"id": 5449,
"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": "special-relativity, spacetime, time",
"url": null
} |
speech-processing, speech
synchronously sampled (i.e. the $n4th sample from each microphone happened "exactly" at the same time) and
in the same distance from the desired source of sound.
Since both 1. and 2. are usually not fulfilled, you'll have to look into adapting to that – the result is a beamformer. This migh... | {
"domain": "dsp.stackexchange",
"id": 4910,
"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": "speech-processing, speech",
"url": null
} |
c++, performance, algorithm, sorting
I modified your code to do the hybrid sort and it ran faster than the original version on randomized 32-bit input. I did not attempt to optimize it for the "values < 256" case, although there are definitely possibilities for improvements there, similar to what I mentioned in the p... | {
"domain": "codereview.stackexchange",
"id": 24531,
"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, algorithm, sorting",
"url": null
} |
navigation, rviz, costmap, global-costmap, amcl
Title: Orienting AMCL Map/Global_Costmap
I'm running AMCL navigation on a map I created with the "Autonomous Navigation of a Known Map with Turtlebot" tutorial. As you can see below, when I open RViz with "roslaunch turtlebot_rviz_launchers view_navigation.launch", the... | {
"domain": "robotics.stackexchange",
"id": 28175,
"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": "navigation, rviz, costmap, global-costmap, amcl",
"url": null
} |
thermodynamics
Title: Why does the Gibbs Free Energy change determine spontaneity of a reaction? Here is a doubt that arose in my mind while studying the chapter Thermodynamics of the 11th standard. (It might be silly, but I would love it if you try to understand what I mean to ask before down voting. Also, I want the... | {
"domain": "chemistry.stackexchange",
"id": 6921,
"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": "thermodynamics",
"url": null
} |
quantum-mechanics, hilbert-space, trace
\begin{align}
\langle H\rangle = \text{Tr}(|\psi\rangle\langle \psi|H) = \text{Tr}(\langle \psi|H|\psi\rangle) = \langle \psi|H|\psi\rangle
\end{align}
I know that trace is cyclic w.r.t matrix product, i.e. $\text{Tr}(ABC) = \text{Tr}(BCA) = \text{Tr}(CAB)$, but does the above m... | {
"domain": "physics.stackexchange",
"id": 63003,
"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, hilbert-space, trace",
"url": null
} |
java, object-oriented
public BankAccount(String firstName, String lastName, int age,double interest, InterestType interestType ){
this(new Person(firstName,lastName,age),interest,interestType);
}
public void add(double money){
balance += money;
addOperation(String.format("%s %.2f%n", "... | {
"domain": "codereview.stackexchange",
"id": 32932,
"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, object-oriented",
"url": null
} |
# [SOLVED]Volume of a pyramid
#### dwsmith
##### Well-known member
I am trying to find the volume of a pyramid where the base has length $$L$$ and width $$W$$, and the pyramid has height $$h$$.
Let $$L$$ be on the x axis and $$W$$ be on the y axis.
In the x-z plane, we have the line $$z = -\frac{h}{L/2}x + h$$, and ... | {
"domain": "mathhelpboards.com",
"id": null,
"lm_label": "1. YES\n2. YES\n\n",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9852713865827591,
"lm_q1q2_score": 0.8560301608511993,
"lm_q2_score": 0.8688267745399465,
"openwebmath_perplexity": 234.80703776362515,
"openwebmath_score": 0.9237639904022217,
... |
general-relativity, conservation-laws, symmetry, noethers-theorem
Consider an arbitrary matter action $S_m$ that is assumed to be general covariant under general coordinate transformations.
Define the Hilbert stress-energy-momentum (SEM) tensor
$$ T^{\mu\nu}~:=~\mp \frac{2}{\sqrt{|g|}}\frac{\delta S_m}{\delta g_{\mu\... | {
"domain": "physics.stackexchange",
"id": 38530,
"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": "general-relativity, conservation-laws, symmetry, noethers-theorem",
"url": null
... |
As $\cos x=\frac{e^{ix}+e^{-ix}}{2}$, $2e^x \cos x = e^{x+ix}+e^{x-ix}$, but that is not of the requested form. Is it close enough?
-
Unfortunately this does not help me much. Or is there a way to get to a solution with this form? Thanks. – Anna Lytics Jun 28 '11 at 0:15
Find the particular solution with RHS $e^{x+ix... | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9715639653084244,
"lm_q1q2_score": 0.8010174984362433,
"lm_q2_score": 0.8244619263765707,
"openwebmath_perplexity": 280.94432893408606,
"openwebmath_score": 0.7880492210388184,
"ta... |
evolution
Online resources
I suppose the above answered a big part of your question. You will be able to read all of what I just wrote (and much more) on any good introductory course to evolutionary biology. Consider having a quick look at Understanding Evolution by UC Berkeley for example as @MattDMo suggested in the... | {
"domain": "biology.stackexchange",
"id": 6175,
"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": "evolution",
"url": null
} |
deep-learning, transformer, attention-mechanism
Title: Transformer decoder output - how is it linear? I'm not quite sure how's the decoder output is flattened into a single vector.
As from my understanding, if we input the encoder with a length N sentence, it's output is N x units (e.g. N x 1000), and we input the dec... | {
"domain": "datascience.stackexchange",
"id": 7531,
"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": "deep-learning, transformer, attention-mechanism",
"url": null
} |
enthalpy, phase
$E_{diss}$ is the energy of dissociation between the to atoms $\ce{I}$.
$I_1$ is the energy of first ionisation.
$E_A$ is the energy of electron affinity.
$E_N$ is the energy of neutralisation between $\ce{Cs+}$ ans $\ce{I-}$. Not all reactions require vaporization. This process looks like the Born-Hab... | {
"domain": "chemistry.stackexchange",
"id": 569,
"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": "enthalpy, phase",
"url": null
} |
# How to get a specified number of points that are nearly equally spaced in a closed rectangle
TriangulateMesh is almost the right tool for this problem. For example,
numb = 113;
region = BoundaryMeshRegion[{{0, 0}, {3, 0}, {3, 1}, {0, 1}}, Line[{1, 2, 3, 4, 1}]];
mesh = TriangulateMesh[region, MaxCellMeasure :> Regi... | {
"domain": "stackexchange.com",
"id": null,
"lm_label": "1. YES\n2. YES",
"lm_name": "Qwen/Qwen-72B",
"lm_q1_score": 0.9465966732132748,
"lm_q1q2_score": 0.8172836356635249,
"lm_q2_score": 0.8633916205190225,
"openwebmath_perplexity": 3368.1067149321357,
"openwebmath_score": 0.3122563064098358,
"ta... |
ros2, action-server
I'll note that the id and timestamp are independent so there is a little bit more flexibility than you could take advantage of simultaneously cancelling a request as well as removing the backlog from further in the past potentially leaving some intermediate ones.
In the case you call out only effec... | {
"domain": "robotics.stackexchange",
"id": 38980,
"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": "ros2, action-server",
"url": null
} |
homework-and-exercises, fluid-dynamics, velocity, flow
http://www.google.co.in/url?sa=t&rct=j&q=&esrc=s&source=web&cd=6&sqi=2&ved=0CDEQFjAFahUKEwjm8YWKx9nGAhUKo5QKHSRZDWI&url=http%3A%2F%2Fwww.mit.edu%2Fcourse%2F1%2F1.061%2Fwww%2Fdream%2FSEVEN%2FSEVENTHEORY.PDF&ei=Q3GkVabEE4rG0gSksrWQBg&usg=AFQjCNEHNG85udrczw4D6dgihi7e... | {
"domain": "physics.stackexchange",
"id": 23347,
"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": "homework-and-exercises, fluid-dynamics, velocity, flow",
"url": null
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.