text
stringlengths 0
27.6k
| python
int64 0
1
| DeepLearning or NLP
int64 0
1
| Other
int64 0
1
| Machine Learning
int64 0
1
| Mathematics
int64 0
1
| Trash
int64 0
1
|
|---|---|---|---|---|---|---|
I have the following function:
function getLevel(points)
{
var level = -1 + Math.sqrt(4 + points/20);
// Round down to nearest level
return Math.floor(level);
}
The above function calculates the level of a player based on their points, my problem is that I need a function like this to calculate the points needed for a given level.
| 0
| 0
| 0
| 0
| 1
| 0
|
What algorithms (brute force or not) would I use to put in as many cars (assume all cars are the same size) in a parking lot so that there is at least one exit (from the container) and a car cannot be blocked. Or can someone show me an example of this problem solved programmatically.
The parking lot varies in shape would be nice but if you want to assume it's some invariant shape that is fine.
Another Edit:
Assume that driving distance in the parking lot is not a factor (although it would be totally awesome if it was weighted factor to number of cars in lot).
Another Edit:
Assume 2 Dimensional (no cranes or driving over cars).
Another Edit:
You cannot move cars around once they are parked (it's not a valet parking lot).
| 0
| 0
| 0
| 1
| 0
| 0
|
What's the broad math idea behind the calendar if you need to build one from scratch without depending on OS or other libraries ?
| 0
| 0
| 0
| 0
| 1
| 0
|
I know this is a long shot, but does anyone know of a dataset of English words that has stress information by syllable? Something as simple as the following would be fantastic:
AARD vark
A ble
a BOUT
ac COUNT
AC id
ad DIC tion
ad VERT ise ment
...
| 0
| 1
| 0
| 0
| 0
| 0
|
Is there a way to obtain Wordnet adjective nominalizations using NLTK?
For example, for happy the desired output would be happiness.
I tried to dig around, but couldn't find anything.
| 0
| 1
| 0
| 0
| 0
| 0
|
Suppose you want to compute the sum of the square of the differences of items:
$\sum_{i=1}^{N-1} (x_i - x_{i+1})^2$
the simplest code (the input is std::vector<double> xs, the ouput sum2) is:
double sum2 = 0.;
double prev = xs[0];
for (vector::const_iterator i = xs.begin() + 1;
i != xs.end(); ++i)
{
sum2 += (prev - (*i)) * (prev - (*i)); // only 1 - with compiler optimization
prev = (*i);
}
I hope that the compiler do the optimization in the comment above. If N is the length of xs you have N-1 multiplications and 2N-3 sums (sums means + or -).
Now suppose you know this variable:
$x_1^2 + x_N^2 + 2 \sum_{i=2}^{N-1} x_i^2$
and call it sum. Expanding the binomial square:
$sum_i^{N-1} (x_i-x_{i+1})^2 = sum - 2\sum_{i=1}^{N-1} x_i x_{i+1}$
so the code becomes:
double sum2 = 0.;
double prev = xs[0];
for (vector::const_iterator i = xs.begin() + 1;
i != xs.end(); ++i)
{
sum2 += (*i) * prev;
prev = (*i);
}
sum2 = -sum2 * 2. + sum;
Here I have N multiplications and N-1 additions. In my case N is about 100.
Well, compiling with g++ -O2 I got no speed up (I try calling the inlined function 2M times), why?
| 0
| 0
| 0
| 0
| 1
| 0
|
In my effort to continuously improve myself, I decided to learn about Data Mining, Statistics, Collective Intelligence and AI Algorithms, and well, that sort of stuff.
What are the free ebooks, and web resources ( tutorials, code) etc that I can use on?
| 0
| 1
| 0
| 0
| 0
| 0
|
The user can enter a math problem (expression) like 5 + 654, 6 ^ 24, 2!, sqrt(543), log(54), sin 5, sin(50). After some reformatting (e.g. change sin 5 into sin(5)), and doing an eval, PHP gives me the right result:
$problem = "5 + 5324";
eval("$result = " . $problem);
echo $problem . " = " . $result;
However, this is quite unsafe:
/* If you read this, please, plz don't be stupid and DO NOT EXECUTE this code!!!!! */
$problem = "shell_exec('rm -rf /')";
eval("$result = " . $problem); /* Nukes system */
echo $problem . " = " . $result;
Can anyone point me in the right direction parsing and solving a math question like the examples above, which is safe? Thanks.
Btw, isn't eval just a common misspelling of evil?
| 0
| 0
| 0
| 0
| 1
| 0
|
The problem: Given a set of hand categorized strings (or a set of ordered vectors of strings) generate a categorize function to categorize more input. In my case, that data (or most of it) is not natural language.
The question: are there any tools out there that will do that? I'm thinking of some kind of reasonably polished, download, install and go kind of things, as opposed to to some library or a brittle academic program.
(Please don't get stuck on details as the real details would restrict answers to less generally useful responses AND are under NDA.)
As an example of what I'm looking at; the input I'm wanting to filter is computer generated status strings pulled from logs. Error messages (as an example) being filtered based on who needs to be informed or what action needs to be taken.
| 0
| 1
| 0
| 1
| 0
| 0
|
I am trying to use the sinf function in my C Program but it gives me an undefined reference error under MSVC 6.0, however sin works fine.
This make me curious to find the difference between sin and sinf.
What is the logical difference between sin and sinf ?
How can I implement my own sinf functionality?
| 0
| 0
| 0
| 0
| 1
| 0
|
I'm looking for a method to do calculations like:
function sumIntegerUpTo(number) {
return 1+2+3+...+number;
}
If you pass number as 5 function should return the sum of 1+2+3+4+5. I'm wondering if it's possible to do without loops.
| 0
| 0
| 0
| 0
| 1
| 0
|
I'm trying to find out what a binormal is in the context of graphics programming but coming up short, I saw on a site that the binormal was being calculated as the cross product between the normal and tangent (i.e. cross(normal, tangent)), is this the correct way to calculate a binormal?
| 0
| 0
| 0
| 0
| 1
| 0
|
I have a large dataset (c. 40G) that I want to use for some NLP (largely embarrassingly parallel) over a couple of computers in the lab, to which i do not have root access, and only 1G of user space.
I experimented with hadoop, but of course this was dead in the water-- the data is stored on an external usb hard drive, and i cant load it on to the dfs because of the 1G user space cap.
I have been looking into a couple of python based options (as I'd rather use NLTK instead of Java's lingpipe if I can help it), and it seems distributed compute options look like:
Ipython
DISCO
After my hadoop experience, i am trying to make sure i try and make an informed choice -- any help on what might be more appropriate would be greatly appreciated.
Amazon's EC2 etc not really an option, as i have next to no budget.
| 0
| 1
| 0
| 0
| 0
| 0
|
A few simple marks for those who know the answer.
I'm doing revision for exams at the moment and one of the past questions is:
What is meant by the order of a perceptron?
I can't find any information about this in my lecture notes, and even google seems at a loss.
My guess is that the order is the number of layers in a neural network, but this doesn't seem quite right.
| 0
| 1
| 0
| 0
| 0
| 0
|
I'm trying to analyze some UTF-8 encoded documents in a way that recognizes different language characters. For my approach to work I need to ignore non-language characters, such as control characters, mathematical symbols etc. Just trying to dissect the basic Latin section of the UTF standard has resulted in multiple regions, with characters like the division symbol being right in the middle of a range of valid Latin characters.
Is there a list somewhere that identifies these regions? Or better yet, a Regex that defines the regions or something in C# that can identify the different characters?
| 0
| 1
| 0
| 0
| 0
| 0
|
In what particular situation you will need a depth knowledge of math/physics in software engineering?
| 0
| 0
| 0
| 0
| 1
| 0
|
I have a datasets with information like age, city, age of children, ... and a result (confirm, accept).
To help modelisation of "workflow", I want to create automatically a decision tree based on previous datasets.
I have take a look at http://en.wikipedia.org/wiki/Decision_tree_learning and I know that the problem is clearly not obvious.
I just want to have advice on some algorithm or some libs on this subject what can help me in the contruction of a decision tree based on samples.
| 0
| 0
| 0
| 1
| 0
| 0
|
I need to sum 2 decimal values together, then divide by 2 and convert to string.
My calculation currently is trimming to 2 decimal places, but I want to keep as many decimals as I can.
city.Latitude = ( (lat.North + lat.South) / 2 ).ToString();
the values for lat.North and lat.South are like: 55.32342322
| 0
| 0
| 0
| 0
| 1
| 0
|
I am trying to find out if a line defined by two points is greater than or equal to 90 degrees compared to the horizontal. Here is the code I used
bool moreThan90 = false;
double angle = Math.Atan((double)(EndingLocation.Y - Location.Y) / (double)(EndingLocation.X - Location.X));
if (angle >= Math.PI / 2.0 || angle <= -Math.PI / 2.0)
moreThan90 = true;
Did I do this correctly or is there a better built in function in .Net that will find this?
EDIT -- Actually I messed up my question I ment to say 45 off of horizontal not 90. however the answers got me to a point where I can figure it out (really I just needed to be pointed at Atan2).
| 0
| 0
| 0
| 0
| 1
| 0
|
Possible Duplicate:
Is there a string math evaluator in .NET?
Can C# parse mathematical expressions such as y=3*x + 3 into string? If so, ho?
I appreciate your help.
| 0
| 0
| 0
| 0
| 1
| 0
|
For a small project (Problem 10 Project Euler) i tried to sum up all prime numbers below 2 millions. So I used a brute force method and iterated from 0 to 2'000'000 and checked if the number is a prime. If it is I added it to the sum:
private int sum = 0;
private void calculate() {
for (int i = 0; i < 2000000; i++) {
if (i.isPrime()) {
sum = sum + i;
}
}
sysout(sum)
}
The result of this calculation is 1179908154, but this is incorrect. So i changed int to BigInteger and now i get the correct sum 142913828922. Obviously the range of int was overflowed. But why can't Java tell me that? (e.g. by an exception)
| 0
| 0
| 0
| 0
| 1
| 0
|
I'm currently implementing some algorithms into an existing program. Long story short, I created a new class, "Adder". An Adder is a member of another class representing the physical object actually doing the calculus , which calls adder.calc() with its parameters (merely a list of objects to do the maths on).
To do these maths, I need some parameters, which do not exist outside of the class (but can be set, see below). They're neither config parameters nor members of other classes. These parameters are D1 and D2, distances, and three arrays of fixed size: alpha, beta, delta.
I know some of you are more comfortable reading code than reading text so here you go:
class Adder
{
public:
Adder();
virtual Adder::~Adder();
void set( float d1, float d2 );
void set( float d1, float d2, int alpha[N_MAX], int beta[N_MAX], int delta[N_MAX] );
// Snipped prototypes
float calc( List& ... );
// ...
inline float get_d1() { return d1_ ;};
inline float get_d2() { return d2_ ;};
private:
float d1_;
float d2_;
int alpha_[N_MAX]; // A #define N_MAX is done elsewhere
int beta_[N_MAX];
int delta_[N_MAX];
};
Since this object is used as a member of another class, it is declared in a *.h:
private:
Adder adder_;
By doing that, I couldn't initialize the arrays (alpha/beta/delta) directly in the constructor ( int T[3] = { 1, 2, 3 }; ), without having to iterate throughout the three arrays. I thought of putting them in static const, but I don't think that's the proper way of solving such problems.
My second guess was to use the constructor to initialize the arrays:
Adder::Adder()
{
int alpha[N_MAX] = { 0, -60, -120, 180, 120, 60 };
int beta[N_MAX] = { 0, 0, 0, 0, 0, 0 };
int delta[N_MAX] = { 0, 0, 180, 180, 180, 0 };
set( 2.5, 0, alpha, beta, delta );
}
void Adder::set( float d1, float d2 ) {
if (d1 > 0)
d1_ = d1;
if (d2 > 0)
d2_ = d2;
}
void Adder::set( float d1, float d2, int alpha[N_MAX], int beta[N_MAX], int delta[N_MAX] ) {
set( d1, d2 );
for (int i = 0; i < N_MAX; ++i) {
alpha_[i] = alpha[i];
beta_[i] = beta[i];
delta_[i] = delta[i];
}
}
Would it be better to use another function (init()) which would initialize the arrays? Or is there a better way of doing that?
Did you see some mistakes or bad practice along the way?
| 0
| 0
| 0
| 0
| 1
| 0
|
I'm utilising some 2d / 3d tracking data (provided by pfHoe) to help integrate some 3d models into the playback of some 2d video.
Things are working.... okay... but there's still some visible 'slipping' of the models against the video background and I suspect this is may be because the XNA CreatePerspective helper method isn't taking into account some of the additional data supplied by pfHoe such as independent horizontal / vertical field of view angles and focal length.
Would anyone be able to point me towards some examples of constructing view matrices that include such details?
| 0
| 0
| 0
| 0
| 1
| 0
|
is it possible to write a program which prints its own source code utilizing a "sequence-generating-function"?
what i call a sequence-generating-function is simply a function which returns a value out of a specific interval (i.e. printable ascii-charecters (32-126)). the point now is, that this generated sequence should be the programs own source-code. as you see, implementing a function which returns an arbitrary sequence is really trivial, but since the returned sequence must contain the implementation of the function itself it is a highly non-trivial task.
this is how such a program (and its corresponding output) could look like
#include <stdio.h>
int fun(int x) {
ins1;
ins2;
ins3;
.
.
.
return y;
}
int main(void) {
int i;
for ( i=0; i<size of the program; i++ ) {
printf("%c", fun(i));
}
return 0;
}
i personally think it is not possible, but since i don't know very much about the underlying matter i posted my thoughts here.
i'm really looking forward to hear some opinions!
| 0
| 0
| 0
| 0
| 1
| 0
|
Possible Duplicates:
Is there a string math evaluator in .NET?
Converting string expression to Integer Value using C#
Best and shortest way to evaluate mathematical expressions
c# evaluating string “3*(4+2)” yield int 18
Is there a way to calculate math expressions like (2-3/4*12) in a different way than presented here?
http://www.c-sharpcorner.com/uploadfile/mgold/codedomcalculator08082005003253am/codedomcalculator.aspx
| 0
| 0
| 0
| 0
| 1
| 0
|
By using left hand rule, I rotate one object left and right using y axis, and rotate up/down using x axis.
After first object is rotated to the right, the up/down rotation should be using z axis.
However, when I try to rotate using z axis, after the first rotation, it has the same effect when I rotate using y axis.
Anyone has any ideas?
Thanks
| 0
| 0
| 0
| 0
| 1
| 0
|
When creating a libsvm training file, how do you differentiate between a nominal attribute verses a numeric attribute? I'm trying to encode certain nominal attributes as integers, but I want to ensure libsvm doesn't misinterpret them as numeric values. Unfortunately, libsvm's site seems to have very little documentation. Pentaho's docs seem to imply libsvm makes this distinction, but I'm still not clear how it's made.
| 0
| 1
| 0
| 1
| 0
| 0
|
Context: I'm trying to improve the values returned by the iPhone CLLocationManager, although this is a more generally applicable problem. The key is that CLLocationManger returns data on current velocity as and when it feels like it, rather than at a fixed sample rate.
I'd like to use a feedback equation to improve accuracy
v=(k*v)+(1-k)*currentVelocity
where currentVelocity is the speed returned by didUpdateToLocation:fromLocation: and v is the output velocity (and also used for the feedback element).
Because of the "as and when" nature of didUpdateToLocation:fromLocation: I could calculate the time interval since it was last called, and do something like
for (i=0;i<timeintervalsincelastcalled;i++) v=(k*v)+(1-k)*currentVelocity
which would work, but is wasteful of cycles. Especially as I probably want timeintervalsincelastcalled to be measured as 10ths of a second.
Is there a way to solve this without the loop ? i.e. rework (integrate?) the formula so I put an interval into the equation and get the same answer as I would have by iteration ?
| 0
| 0
| 0
| 0
| 1
| 0
|
ok so I am feeling a little stupid for not knowing this, but a coworker asked so I am asking here: I have written a python algorithm that solves his problem. given x > 0 add all numbers together from 1 to x.
def intsum(x):
if x > 0:
return x + intsum(x - 1)
else:
return 0
intsum(10)
55
first what is this type of equation is this and what is the correct way to get this answer as it is clearly easier using some other method?
| 0
| 0
| 0
| 0
| 1
| 0
|
I have a list of n logos to display in a grid, with a maximum of 3 per row.
What's an algorithm to decide how many to display per row such that the number of logos per row is as balanced as possible without using more than the minimum possible number of rows?
For example:
n -> number in each row
1 -> 1
2 -> 2
3 -> 3
4 -> 2, 2
5 -> 3, 2
6 -> 3, 3
7 -> 3, 2, 2
8 -> 3, 3, 2
9 -> 3, 3, 3
10 -> 3, 3, 2, 2
| 0
| 0
| 0
| 0
| 1
| 0
|
This is not a real situation; please ignore legal issues that you might think apply, because they don't.
Let's say I have a set of 200 known valid license keys for a hypothetical piece of software's licensing algorithm, and a license key consists of 5 sets of 5 alphanumeric case-insensitive (all uppercase) characters. Example: HXDY6-R3DD7-Y8FRT-UNPVT-JSKON
Is it possible (or likely) to extrapolate other possible keys for the system?
What if the set was known to be consecutive; how do the methods change for this situation, and what kind of advantage does this give?
I have heard of "keygens" before, but I believe they are probably made by decompiling the licensing software rather than examining known valid keys. In this case, I am only given the set of keys and I must determine the algorithm. I'm also told it is an industry standard algorithm, so it's probably not something basic, though the chance is always there I suppose.
If you think this doesn't belong in Stack Overflow, please at least suggest an alternate place for me to look or ask the question. I honestly don't know where to begin with a problem like this. I don't even know the terminology for this kind of problem.
| 0
| 0
| 0
| 0
| 1
| 0
|
It takes about minute to achieve 3000 in my comp but I need to know the millionth number in the series. The definition is recursive so I cannot see any shortcuts except to calculate everything before the millionth number. How can you fast calculate millionth number in the series?
Series Def
n_{i+1} = \floor{ 3/2 * n_{i} } and n_{0}=2.
Interestingly, only one site list the series according to Google: this one.
Too slow Bash code
#!/bin/bash
function series
{
n=$( echo "3/2*$n" | bc -l | tr '
' ' ' | sed -e 's@\\@@g' -e 's@ @@g' );
# bc gives \ at very large numbers, sed-tr for it
n=$( echo $n/1 | bc ) #DUMMY FLOOR func
}
n=2
nth=1
while [ true ]; #$nth -lt 500 ];
do
series $n # n gets new value in the function through global value
echo $nth $n
nth=$( echo $nth + 1 | bc ) #n++
done
| 0
| 0
| 0
| 0
| 1
| 0
|
Some languages, particularly Slavic languages, change the endings of people's names according to the grammatical context. (For those of you who know grammar or studied languages that do this to words, such as German or Russian, and to help with search keywords, I'm talking about noun declension.)
This is probably easiest with a set of examples (in Polish, to save the whole different-alphabet problem):
Dorothy saw the cat — Dorota zobaczyła kota
The cat saw Dorothy — Kot zobaczył Dorotę
It is Dorothy’s cat — To jest kot Doroty
I gave the cat to Dorothy — Dałam kota Dorotie
I went for a walk with Dorothy — Poszłam na spacer z Dorotą
“Hello, Dorothy!” — “Witam, Doroto!”
Now, if, in these examples, the name here were to be user-entered, that introduces a world of grammar nightmares. Importantly, if I went for Katie (Kasia), the examples are not directly comparable — 3 and 4 are both Kasi, rather than *Kasy and *Kasie — and male names will be wholly different again.
I'm guessing someone has dealt with this situation before, but my Google-fu appears to be weak today. I can find a lot of links about natural-language processing, but I don'think that's quite what I want. To be clear: I'm only ever gonna have one user-entered name per user and I'm gonna need to decline them into known configurations — I'll have a localised text that will have placeholders something like {name nominative} and {name dative}, for the sake of argument. I really don't want to have to do lexical analysis of text to work stuff out, I'll only ever need to decline that one user-entered name.
Anyone have any recommendations on how to do this, or do I need to start calling round localisation agencies ;o)
Further reading (all on Wikipedia) for the interested:
Declension
Grammatical case
Declension in Polish
Declension in Russian
Declension in Czech nouns and pronouns
Disclaimer: I know this happens in many other languages; highlighting Slavic languages is merely because I have a project that is going to be localised into some Slavic languages.
| 0
| 1
| 0
| 0
| 0
| 0
|
What is the most efficient way to truncate a number for a specific accuracy?
| 0
| 0
| 0
| 0
| 1
| 0
|
I just wrote a custom progress bar, it's single buffered and will remain so. How many frames per second are desirable for something like this? I don't want to waste too much CPU updating the screen unnecessarily.
| 0
| 0
| 0
| 0
| 1
| 0
|
I was wondering if one can do the following:
We have:
X is a product of N-primes, thus I assume unique.
C is a constant. We can assure that C is a number that is part of the N-primes or not. Whichever will work best.
X mod C = Z
We have Z and C and we know that X was a product of N-primes, where N is restricted lets say first 100 primes.
Is there anyway we can get back X?
| 0
| 0
| 0
| 0
| 1
| 0
|
I have a mesh defined by 4 points in 3D space. I need an algorithm which will subdivide that mesh into subdivisions of an arbitrary horizontal and vertical size. If the subdivision size isn't an exact divisor of the mesh size, the edge pieces will be smaller.
All of the subdivision algorithms I've found only subdivide meshes into exact powers of 2. Does anyone know of one that can do what I want?
Failing that, my thoughts about a possible implementation is to rotate the mesh so that it is flat on the Z axis, subdivide in 2D and then translate back into 3D. That's because my mind finds 3D hard ;) Any better suggestions?
Using C# if that makes any difference.
| 0
| 0
| 0
| 0
| 1
| 0
|
I'm trying to serialize "vector" (Microsoft.FSharp.Math) type. And I get that error:
Exception Details: System.Runtime.Serialization.SerializationException: Type 'Microsoft.FSharp.Math.Instances+FloatNumerics@115' with data contract name 'Instances.FloatNumerics_x0040_115:http://schemas.datacontract.org/2004/07/Microsoft.FSharp.Math' is not expected. Add any types not known statically to the list of known types - for example, by using the KnownTypeAttribute attribute or by adding them to the list of known types passed to DataContractSerializer.
I have tried to put KnownType attribute and some other stuff, but nothing helps!
Could someone know the answer?
This is the code I use:
// [< KnownType( typeof<vector> ) >]
type MyType = vector
let public writeTest =
let aaa = vector [1.1;2.2]
let serializer = new DataContractJsonSerializer( typeof<MyType> )
let writer = new StreamWriter( @"c:\test.txt" )
serializer.WriteObject(writer.BaseStream, aaa)
writer.Close()
| 0
| 0
| 0
| 0
| 1
| 0
|
Given a N-dimensional vector of small integers is there any simple way to map it with one-to-one correspondence to a large integer number?
Say, we have N=3 vector space. Can we represent a vector X=[(int16)x1,(int16)x2,(int16)x3] using an integer (int48)y? The obvious answer is "Yes, we can". But the question is: "What is the fastest way to do this and its inverse operation?"
Will this new 1-dimensional space possess some very special useful properties?
| 0
| 0
| 0
| 0
| 1
| 0
|
I have over 1000 surveys, many of which contains open-ended replies.
I would like to be able to 'parse' in all the words and get a ranking of the most used words (disregarding common words) to spot a trend.
How can I do this? Is there a program I can use?
EDIT If a 3rd party solution is not available, it would be great if we can keep the discussion to microsoft technologies only. Cheers.
| 0
| 1
| 0
| 0
| 0
| 0
|
I am currently writing some glsl like vector math classes in C++, and I just implemented an abs() function like this:
template<class T>
static inline T abs(T _a)
{
return _a < 0 ? -_a : _a;
}
I compared its speed to the default C++ abs from math.h like this:
clock_t begin = clock();
for(int i=0; i<10000000; ++i)
{
float a = abs(-1.25);
};
clock_t end = clock();
unsigned long time1 = (unsigned long)((float)(end-begin) / ((float)CLOCKS_PER_SEC/1000.0));
begin = clock();
for(int i=0; i<10000000; ++i)
{
float a = myMath::abs(-1.25);
};
end = clock();
unsigned long time2 = (unsigned long)((float)(end-begin) / ((float)CLOCKS_PER_SEC/1000.0));
std::cout<<time1<<std::endl;
std::cout<<time2<<std::endl;
Now the default abs takes about 25ms while mine takes 60. I guess there is some low level optimisation going on. Does anybody know how math.h abs works internally? The performance difference is nothing dramatic, but I am just curious!
| 0
| 0
| 0
| 0
| 1
| 0
|
How does it actually reduce noise..can you suggest some nice tutorials?
| 0
| 0
| 0
| 0
| 1
| 0
|
I don't have time to read or digest long intricate discussions on theoretical concepts around NLP (or go get my PHD). That said, I have read a few and it's a damn interesting field. The problem is I need real world solutions, for real world products, in real world time frames.
The problem I'm having is right now I'm not sure what the right questions are to ask to get started implementing. I believe this is mostly related to vocabulary. I'll read somewhere, a blog post, a forum post, a whitepaper, and it says, I'm doing flooping with the blargy blarg method, and I go google flooping and blargy blarg, and I get references to more obscurity. It seemingly never ends.
So, my question is multiphased.
First, more generally, how do I become passingly educated on this quickly? Just in time educated. I only need to know what I need to know to take the next step. I've spent 20 years writing code. Explain quick. I'll get it. (I mean provide a reference to something that explains quickly of course).
I'm happy to read the right book, but I don't want to read a book where I read the chapter introduction that explains what floopy floop is and then skip over the rest of the chapter with examples of floopy flooping (because now I get what it is). I also don't want to read a book that goes into too much detail with theoretical underpinnings or history. For example, the Jurafsky book seems like way more than I need: http://www.amazon.com/gp/product/0131873210. But I will read it if this is the right book to read. (It's also dang expensive!)
I need the root node of the expedited learning tree here, if you will. Point me in the right direction and I'll be quite grateful. I'm expecting quite a lot of firehose drinking - I just need the right firehose.
Second, what I need to do is take a single sentence, with a very reduced vocabulary, and get a grammar tree (sorry if this is the wrong terminology) that I can do something with.
I know I could easily write this command line input style in c in a more conventional manner, but I need it to be way better than that. But I don't need a chatterbot either.
What I'm doing needs to live in a constrained environment. I can't use Python (unfortunately). I can't ship with gigabytes of corpuses. I need any libraries I use to be in c/c++. If I have to write this myself, I will. Hopefully, it will be achievable considering the reduced problem set. Maybe, probably, that's just naive. If so, let me know. :-)
| 0
| 1
| 0
| 0
| 0
| 0
|
>>> num = 4.123456
>>> round(num, 3) # expecting 4.123
4.1230000000000002
I'm expecting 4.123 as a result, Am I wrong?
| 0
| 0
| 0
| 0
| 1
| 0
|
Just out of curiosity, assuming there exists a software life form. How would you detect him/her? What are your criteria of figuring out if something/someone is intelligent or not?
It seems to me that it should be quite simple to create such software once you set the right target (not just following a naive "mimic human->pass Turing Test" way).
When posting an answer try also finding a counter example. I have real difficuly inventing anything consistent which I myself agree with.
Warmup
| 0
| 1
| 0
| 0
| 0
| 0
|
I am using an external library for Artificial Neural Networks in my project..
While testing the ANN, It gave me output of all NaN (not a number in C#)
The ANN has 8 input , 5 hidden , 5 hidden , 2 output, and all activation layers are of Linear type , and it uses back-propagation, with learning rate 0.65
I used one testcase for training { -2.2, 1.3, 0.4, 0.5, 0.1, 5, 3, -5 } ,{ -0.3, 0.2 }
for 1000 epoch
And I tested it on { 0.2, -0.2, 5.3, 0.4, 0.5, 0, 35, 0.0 } which gave { NaN , NaN}
Note: this is one example of many that produces same case...
I am trying to discover whether it is a bug in the library, or an illogical configuration..
The reasons I could think of for illogical configuration:
All layers should not be linear
Can not have descending size layers, i.e 8-5-5-2 is bad..
Only one testcase ?
Values must be in range [0,1] or [-1,1]
Is any of the above reasons could be the cause of error, or there are some constraints/rules that I do not know in ANN designing..?
Note: I am newbie in ANN
| 0
| 1
| 0
| 0
| 0
| 0
|
Hi I would like to start by saying I'd greatly appreciate anyones help on this. I have built a small caculator to calculate the amount a consumer can save annually on energy by installing a ground heat pump or solar panels.
As far as I can tell the mathematical formulas are correct and my client verified this yesterday when I showed him the code. Two problems. The first is that the calculator is outputting ridiculously large numbers for the first result. The second problem is that the solar result is only working when there are no zeros in the fields.
Are there some quirks as to how one would write mathematical formulas in JS or jQuery?
Any help greatly appreciated. Here is the link - http://www.olliemccarthy.com/test/johncmurphy/?page_id=249
And here is the code for the entire function -
$jq(document).ready(function(){
// Energy Bill Saver
// Declare Variables
var A = ""; // Input for Oil
var B = ""; // Input for Storage Heater
var C = ""; // Input for Natural Gas
var D = ""; // Input for LPG
var E = ""; // Input for Coal
var F = ""; // Input for Wood Pellets
var G = ""; // Input for Number of Occupants
var J = "";
var K = "";
var H = "";
var I = "";
// Declare Constants
var a = "0.0816"; // Rate for Oil
var b = "0.0963"; // Rate for NightRate
var c = "0.0558"; // Rate for Gas
var d = "0.1579"; // Rate for LPG
var e = "0.121"; // Rate for Coal
var f = "0.0828"; // Rate for Pellets
var g = "0.02675"; // Rate for Heat Pump
var x = "1226.4";
// Splittin up I to avoid error
var S1 = ""; // Splitting up the calcuation for I
var S2 = ""; // Splitting up the calcuation for I
var S3 = ""; // Splitting up the calcuation for I
var S4 = ""; // Splitting up the calcuation for I
var S5 = ""; // Splitting up the calcuation for I
var S6 = ""; // Splitting up the calcuation for I
// Calculate H (Ground Sourced Heat Pump)
$jq(".es-calculate").click(function(){
$jq(".es-result-wrap").slideDown(300);
A = $jq("input.es-oil").val();
B = $jq("input.es-storage").val();
C = $jq("input.es-gas").val();
D = $jq("input.es-lpg").val();
E = $jq("input.es-coal").val();
F = $jq("input.es-pellets").val();
G = $jq("input.es-occupants").val();
J = ( A / a ) + ( B / b ) + ( C / c ) + ( D / d ) + ( E / e ) + ( F / f ) ;
H = A + B + C + D + E + F - ( J * g ) ;
K = ( G * x ) ;
if ( A !== "0" ) { S1 = ( ( ( A / a ) / J ) * K * a ) ; }
else { S1 = "0" ; }
if ( B !== "0" ) { S2 = ( ( ( B / b ) / J ) * K * b ) ; }
else { S2 = "0" ; }
if ( C !== "0" ) { S3 = ( ( ( C / c ) / J ) * K * c ) ; }
else { S3 = "0" ; }
if ( D !== "0" ) { S4 = ( ( ( D / d ) / J ) * K * d ) ; }
else { S4 = "0" ; }
if ( E !== "0" ) { S5 = ( ( ( E / e ) / J ) * K * e ) ; }
else { S5 = "0" ; }
if ( F !== "0" ) { S6 = ( ( ( F / f ) / J ) * K * f ) ; }
else { S6 = "0" ; }
I = S1 + S2 + S3 + S4 + S5 + S6 ;
if(!isNaN(H)) {$jq("span.es-result-span-h").text(H.toFixed(2));}
else{$jq("span.es-result-span-h").text('Error: Please enter numerals only');}
if(!isNaN(I)) {$jq("span.es-result-span-i").text(I.toFixed(2));}
else{$jq("span.es-result-span-i").text('Error: Please enter numerals only');}
});
});
| 0
| 0
| 0
| 0
| 1
| 0
|
I need to write an algorithm(I cannot use any 3rd party library, because this is an assignment) to divide(integer division, floating parts are not important) very large numbers like 100 - 1000 digits. I found http://en.wikipedia.org/wiki/Fourier_division algorithm but I don't know if it's the right way to go. Do you have any suggestions?
1) check divisior < dividend, otherwise it's zero (because it will be an int division)
2) start from the left
3) get equal portion of digits from the dividend
4) if it's divisor portion is still bigger, increment digits of dividend portion by 1
5) multiply divisor by 1-9 through the loop
6) when it exceeds the dividend portion, previous multiplier is the answer
7) repeat steps 3 to 5 until reaching to the end
| 0
| 0
| 0
| 0
| 1
| 0
|
Doing some 3D stuff in wpf- want to use a simpler test to see if everything is working (before moving to curves).
The basic question is given two points x1,y1,z1 and x2,y2,z2 I have calculated the distance between the points. But how to find the coordinates of another point (x3,y3,z3) that lies on that line at some distance?
I.e. if my line is 100 long between -50,0,0 and 50,0,0 what are the coordinates of the point at 100 * 0.1 along the line?
I think this is a simple formula but I haven't found it yet....
| 0
| 0
| 0
| 0
| 1
| 0
|
Is there a program that will take "response curve" values from me, and provide a formula that approximates the response curve?
It would be cool if such a program would take a numeric "percent correct" (perhaps with a standard deviation) so that it returns simplified formulas when laxity is permissable, and more precise (viz. complex) formulas when the curve needs to be approximated closely.
My interest is to play with the response curve values and "laxity" factor, until such a tool spits out a curve-fit formula simple enough that I know it will be high performance during machine computations.
| 0
| 0
| 0
| 0
| 1
| 0
|
Although the context of this question is about making a 2d/3d game, the problem i have boils down to some math.
Although its a 2.5D world, lets pretend its just 2d for this question.
// xa: x-accent, the x coordinate of the projection
// mapP: a coordinate on a map which need to be projected
// _Dist_ values are constants for the projection, choosing them correctly will result in i.e. an isometric projection
xa = mapP.x * xDistX + mapP.y * xDistY;
ya = mapP.x * yDistX + mapP.y * yDistY;
xDistX and yDistX determine the angle of the x-axis, and xDistY and yDistY determine the angle of the y-axis on the projection (and also the size of the grid, but lets assume this is 1-pixel for simplicity).
x-axis-angle = atan(yDistX/xDistX)
y-axis-angle = atan(yDistY/yDistY)
a "normal" coordinate system like this
--------------- x
|
|
|
|
|
y
has values like this:
xDistX = 1;
yDistX = 0;
xDistY = 0;
YDistY = 1;
So every step in x direction will result on the projection to 1 pixel to the right end 0 pixels down. Every step in the y direction of the projection will result in 0 steps to the right and 1 pixel down.
When choosing the correct xDistX, yDistX, xDistY, yDistY, you can project any trimetric or dimetric system (which is why i chose this).
So far so good, when this is drawn everything turns out okay. If "my system" and mindset are clear, lets move on to perspective.
I wanted to add some perspective to this grid so i added some extra's like this:
camera = new MapPoint(60, 60);
dx = mapP.x - camera.x; // delta x
dy = mapP.y - camera.y; // delta y
dist = Math.sqrt(dx * dx + dy * dy); // dist is the distance to the camera, Pythagoras etc.. all objects must be in front of the camera
fac = 1 - dist / 100; // this formula determines the amount of perspective
xa = fac * (mapP.x * xDistX + mapP.y * xDistY) ;
ya = fac * (mapP.x * yDistX + mapP.y * yDistY );
Now the real hard part... what if you got a (xa,ya) point on the projection and want to calculate the original point (x,y).
For the first case (without perspective) i did find the inverse function, but how can this be done for the formula with the perspective. May math skills are not quite up to the challenge to solve this.
( I vaguely remember from a long time ago mathematica could create inverse function for some special cases... could it solve this problem? Could someone maybe try?)
| 0
| 0
| 0
| 0
| 1
| 0
|
Should you use Int32 in places where you know the value is not going to be higher than 32,767?
I'd like to keep memory down, hoever, using casts everywhere just to perform simple arithmetic is getting annoying.
short a = 1;
short result = a + 1; // Error
short result = (short)(a + 1); // works but looks ugly when does lots of times
What would be better for overall application performance?
| 0
| 0
| 0
| 0
| 1
| 0
|
Possible Duplicate:
How to improve my math skills to become a better programmer
Basic Math Book for a Programmer
I've had quite a weird career till now.
First I graduated from a medical school. Then I went into marketing (pharmaceuticals).
And then umm, after some time, I decided to go for my (till then) hobby and became a "professional" programmer.
I've been quite successful at this ever since. I have quite some languages "under my belt". I earn not bad and I have been involved in the opensource community quite heavily.
The thing is that I suck at math :). Well, not totally of course, as I get my work done. But I don't know how much I suck. And I don't know how to find out.
Math has never really been of any priority during my middle/high school years. I only picked as little as I could afford, because I was always getting ready to go for Medicine. Of course I know the basics of algebra. Things like "normal" and square equations. Also the basics of geometry. But well, there are things that I have missed.
And lately I am being fascinated by things like probability theory, infinity, chaos/order etc. But every time I try to learn something about these topics, I hit a wall of terminology, special symbols, and some special kind of thinking, that is quite like mine (a programmer), but also a lot different (and appears weird to me).
So, what kinds of books would you recommend me? It's very hard to find something suitable. All that I find are either too easy (and boring) or totally impenetrable.
| 0
| 0
| 0
| 0
| 1
| 0
|
I'm developing a game with zombie running around in a swamp. I want AIs to have functionality like "chase this target" or "run away". A major stumbling block is pathfinding. Is there a good pathfinding/AI engine in XNA, or should I roll my own?
Does anyone have any experience with this: http://www.codeplex.com/simpleAI?
| 0
| 1
| 0
| 0
| 0
| 0
|
I want an algorithm which would create all possible phrases in a block of text. For example, in the text:
"My username is click upvote. I have 4k rep on stackoverflow"
It would create the following combinations:
"My username"
"My Username is"
"username is click"
"is click"
"is click upvote"
"click upvote"
"i have"
"i have 4k"
"have 4k"
..
You get the idea. Basically the point is to get all possible combinations of 'phrases' out of a sentence. Any thoughts for how to best implement this?
| 0
| 1
| 0
| 0
| 0
| 0
|
I use slerp to interpolate between two quaternions representing rotations. The resulting rotation is then extracted as Euler angles to be fed into a graphics lib. This kind of works, but I have the following problem; when rotating around two (one works just fine) axes in the direction of the green arrow as shown in the left frame
here
the rotation soon jumps around to rotate from the opposite site to the opposite visual direction, as indicated by the red arrow in the right frame.
This may be logical from a mathematical perspective (although not to me), but it is undesired. How could I achieve an interpolation with no visual flipping and changing of directions when rotating around more than one axis, following the green arrow at all times until the interpolation is complete?
Thanks in advance.
| 0
| 0
| 0
| 0
| 1
| 0
|
the pixman image library can draw radial color gradients between two circles. I'd like the radial gradient to fill a rectangular area defined by "width" and "height" completely. Now my question, how should I choose the radius of the outer circle?
My current parameters are the following:
A) inner circle (start of gradient)
center pointer of inner circle: (width*0.5|height*0.5)
radius of inner circle: 1
color: black
B) outer circle (end of gradient)
center pointer of outer circle: (width*0.5|height*0.5)
radius of outer circle: ???
color: white
How should I choose the radius of the outer circle to make sure that the outer circle will entirely fill my bounding rectangle defined by width*height. There shall be no empty areas in the corners, the area shall be completely covered by the circle. In other words, the bounding rectangle width,height must fit entirely into the outer circle. Choosing
outer_radius = max(width, height) * 0.5
as the radius for the outer circle is obviously not enough. It must be bigger, but how much bigger?
Thanks!
| 0
| 0
| 0
| 0
| 1
| 0
|
Given four points in the plane, A,B,X,Y, I wish to determine which of the following two angles is smaller ∢ABX or ∢ABY.
The angle ∢ABX is defined as the angle of BX, when AB is translated to lie on the open segment (-∞,0]. Intuitively when saying ∢ABX I mean the angle you get when you turn left after visiting vertex B.
I'd rather not use cos or sqrt, in order to preserve accuracy, and to minimize performance (the code would run on an embedded system).
In the case where A=(-1,0),B=(0,0), I can compare the two angles ∢ABX and ∢ABY, by calculating the dot product of the vectors X,Y, and watch its sign.
What I can do in this case is:
Determine whether or not ABX turns right or left
If ABX turns left check whether or not Y and A are on the same side of the line on segment BX. If they are - ∢ABX is a smaller than ABY.
If ABX turns right, then Y and A on the same side of BX means that ∢ABX is larger than ∢ABY.
But this seems too complicated to me.
Any simpler approach?
| 0
| 0
| 0
| 0
| 1
| 0
|
pow doesn't accept the second parameter to be a variable on gcc
The following code works fine on VC++10
// file test.cc
#include "stdafx.h"
#include <stdio.h>
#include <math.h>
int main(void)
{
double x = 10;
int y = 20;
printf("%f
", pow(x, y));
return 0;
}
But the following code doesn't not work on gcc:
// test.c
#include <stdio.h>
#include <math.h>
int main(void)
{
double x = 10;
int y = 20;
printf("%f
", pow(x, y)); // error here, says no such function, however when pass the second argument in `pow` for the code runs by gcc, It works fine!
return 0;
}
| 0
| 0
| 0
| 0
| 1
| 0
|
I am writing a custom animation for wpf and as a non math guy I have a couple questions...
If I am given two Point3D's, the From and To, and assuming the origin is at 0,0,0 how do I calculate a curve between the two points?
And once I have the curve 'plotted' and I know its length (how to do that too?) how can I calculate the x,y,z coords at some given distance along the line?
Thanks!
| 0
| 0
| 0
| 0
| 1
| 0
|
hello i want to develop AI car(opponent) in car race game what should be my direction to develop them with less complexity because i don't have any idea. because the player car is moving on the scrolling track plz suggest me should i have to use relative motion or way point concept but that should also be change on the scrolling track (i.e. player car movement)
| 0
| 1
| 0
| 0
| 0
| 0
|
I'm working on a project at the moment where it would be really useful to be able to detect when a certain topic/idea is mentioned in a body of text. For instance, if the text contained:
Maybe if you tell me a little more about who Mr Jones is, that would help. It would also be useful if I could have a description of his appearance, or even better a photograph?
It'd be great to be able to detect that the person has asked for a photograph of Mr Jones. I could take a really naïve approach and just look for the word "photo" or "photograph", but this would obviously be no good if they wrote something like:
Please, never send me a photo of Mr Jones.
Does anyone know where to start with this? Is it even possible?
I've looked into things like nltk, but I've yet to find an example of someone doing something similar and am still not entirely sure what this kind of analysis is called. Any help that can get me off the ground would be great.
Thanks!
| 0
| 1
| 0
| 0
| 0
| 0
|
I render isosurfaces with marching cubes, (or perhaps marching squares as this is 2D) and I want to do set operations like set difference, intersection and union. I thought this was easy to implement, by simply choosing between two vertex scalars from two different implicit surfaces, but it is not.
For my initial testing, I tried with two spheres circles, and the set operation difference. i.e A - B. One circle is moving and the other one is stationary. Here's the approach I tried when picking vertex scalars and when classifying corner vertices as inside or outside. The code is written in C++. OpenGL is used for rendering, but that's not important. Normal rendering without any CSG operations does give the expected result.
void march(const vec2& cmin, //min x and y for the grid cell
const vec2& cmax, //max x and y for the grid cell
std::vector<vec2>& tri,
float iso,
float (*cmp1)(const vec2&), //distance from stationary circle
float (*cmp2)(const vec2&) //distance from moving circle
)
{
unsigned int squareindex = 0;
float scalar[4];
vec2 verts[8];
/* initial setup of the grid cell */
verts[0] = vec2(cmax.x, cmax.y);
verts[2] = vec2(cmin.x, cmax.y);
verts[4] = vec2(cmin.x, cmin.y);
verts[6] = vec2(cmax.x, cmin.y);
float s1,s2;
/**********************************
********For-loop of interest******
*******Set difference between ****
*******two implicit surfaces******
**********************************/
for(int i=0,j=0; i<4; ++i, j+=2){
s1 = cmp1(verts[j]);
s2 = cmp2(verts[j]);
if((s1 < iso)){ //if inside circle1
if((s2 < iso)){ //if inside circle2
scalar[i] = s2; //then set the scalar to the moving circle
} else {
scalar[i] = s1; //only inside circle1
squareindex |= (1<<i); //mark as inside
}
}
else {
scalar[i] = s1; //inside neither circle
}
}
if(squareindex == 0)
return;
/* Usual interpolation between edge points to compute
the new intersection points */
verts[1] = mix(iso, verts[0], verts[2], scalar[0], scalar[1]);
verts[3] = mix(iso, verts[2], verts[4], scalar[1], scalar[2]);
verts[5] = mix(iso, verts[4], verts[6], scalar[2], scalar[3]);
verts[7] = mix(iso, verts[6], verts[0], scalar[3], scalar[0]);
for(int i=0; i<10; ++i){ //10 = maxmimum 3 triangles, + one end token
int index = triTable[squareindex][i]; //look up our indices for triangulation
if(index == -1)
break;
tri.push_back(verts[index]);
}
}
This gives me weird jaggies:
(source: mechcore.net)
It looks like the CSG operation is done without interpolation. It just "discards" the whole triangle. Do I need to interpolate in some other way, or combine the vertex scalar values? I'd love some help with this.
A full testcase can be downloaded HERE
EDIT: Basically, my implementation of marching squares works fine. It is my scalar field which is broken, and I wonder what the correct way would look like. Preferably I'm looking for a general approach to implement the three set operations I discussed above, for the usual primitives (circle, rectangle/square, plane)
EDIT 2: Here are some new images after implementing the answerer's whitepaper:
1.Difference
2.Intersection
3.Union
EDIT 3: I implemented this in 3D too, with proper shading/lighting:
1.Difference between a greater sphere and a smaller sphere
2.Difference between a greater sphere and a smaller sphere in the center, clipped by two planes on both sides, and then union with a sphere in the center.
3.Union between two cylinders.
| 0
| 0
| 0
| 0
| 1
| 0
|
I'm working on some image manipulation code in c# and need to do some matrix operations (specifically 2D convolution). I have the code written in matlab which uses the conv2 function ... is there a library for C# / .NET that does good high-speed matrix manipulations? I'd be fine if it requires some specific GPU and does the matrix math on-GPU if that's what it takes.
| 0
| 0
| 0
| 0
| 1
| 0
|
I have n=10000 10-dimensional vectors.
For every vector v1 I want to know the vector v2 that minimizes the angle between v1 and v2.
Is there a way to solve this problem faster than O(n^2)?
| 0
| 0
| 0
| 0
| 1
| 0
|
I graduated college last year with a degree in Psychology, but I also took a lot of math for fun. I recently got the book "Introductory Graph Theory" by Gary Chartrand to brush up on my math and have some fun. Here is an exercise from the book that I'm finding particularly befuddling:
Suppose you and your husband attended
a party with three other married
couples. Several handshakes took
place. No one shook hands with himself
(or herself) or with his (or her)
spouse, and no one shook hands with
the same person more than once. After
all the handshaking was completed,
suppose you asked each person,
including your husband, how many hands
he or she had shaken. Each person gave
a different answer. a) How many hands
did you shake? b) How many hands did
your husband shake?
Now, I've been reasoning about this for a while, and trying to draw sample graphs that could illustrate a solution, but I'm coming up empty-handed. My logic is this: there are 8 different vertices in the graph, and 7 of them have different degrees. The values for the degrees must therefore be 0, 1, 2, 3, 4, 5, 6, and x. The # of degrees for one married couple is (0, 6). Since all graphs have an even number of odd vertices, x must be either 5, 3, or 1.
What's your solution to this problem? And, if you could solve it in python, how would you do it?
(python is fun.)
Cheers.
| 0
| 0
| 0
| 0
| 1
| 0
|
Is it a good practice to use sigmoid or tanh output layers in Neural networks directly to estimate probabilities?
i.e the probability of given input to occur is the output of sigmoid function in the NN
EDIT
I wanted to use neural network to learn and predict the probability of a given input to occur..
You may consider the input as State1-Action-State2 tuple.
Hence the output of NN is the probability that State2 happens when applying Action on State1..
I Hope that does clear things..
EDIT
When training NN, I do random Action on State1 and observe resultant State2; then teach NN that input State1-Action-State2 should result in output 1.0
| 0
| 0
| 0
| 1
| 0
| 0
|
Is it possible to perform date arithmetic using JPA/Hibernate? For example, I have an entity with a java.util.Date field indicating when the row was created. Is it possible to perform a query using JPQL and include date arithmetic on that field? For example, can I perform a COUNT(*) of rows and then GROUP BY the month in that field? Can I perform other functions, such as only return the month or year from that field in a query?
| 0
| 0
| 0
| 0
| 1
| 0
|
I have a client who is based in the field of mathematics. We are developing, amongst other things, a website. I like to create a mock-up of a drawing tool that can produce some imagery in the background based on some scientific algorithms. The intention being that the client, later, may create their own. (They use emacs for everything, great client.)
I'm looking for an answer about where or what to search. Not code specific, pseudocode even, as we can adapt and have not yet settled on a platform.
I'm afraid my mathematics stops at the power of two and some trigonometry. Appreciated if they're are any mathematics related students/academics how could enlighten me? What to search for will be accepted?
Edit: To summarise/clarify, I want to draw pretty pictures (the design perspective). I want them to have some context (i.e. not just for the sake of pretty images but have some explanation available). In essence I would to create a rendering engine which they can draw/code the images and we set the style parameters: line, colour, etc... But to pursue this option I want to experiment myself.
Edit: great responses thanks. The aim is to make something along the lines of http://hascanvas.com/ if anyone is interested.
Thanks
Ross
| 0
| 0
| 0
| 0
| 1
| 0
|
I am very confused about these functions?
| 0
| 0
| 0
| 0
| 1
| 0
|
I have method for converting array of Booleans to integer. It looks like this
class Program
{
public static int GivMeInt(bool[] outputs)
{
int data = 0;
for (int i = 0; i < 8; i++)
{
data += ((outputs[i] == true) ? Convert.ToInt32(Math.Pow(2, i)) : 0);
}
return data;
}
static void Main(string[] args)
{
bool[] outputs = new bool[8];
outputs[0] = false;
outputs[1] = true;
outputs[2] = false;
outputs[3] = true;
outputs[4] = false;
outputs[5] = false;
outputs[6] = false;
outputs[7] = false;
int data = GivMeInt(outputs);
Console.WriteLine(data);
Console.ReadKey();
}
}
Now I want to make opposite method returning array of Booleans values
As I am short with knowledge of .NET and C# until now I have only my mind hardcoding of switch statement or if conditions for every possible int value.
public static bool[] GiveMeBool(int data)
{
bool[] outputs = new bool[8];
if (data == 0)
{
outputs[0] = false;
outputs[1] = false;
outputs[2] = false;
outputs[3] = false;
outputs[4] = false;
outputs[5] = false;
outputs[6] = false;
outputs[7] = false;
}
//After thousand lines of coed
if (data == 255)
{
outputs[0] = true;
outputs[1] = true;
outputs[2] = true;
outputs[3] = true;
outputs[4] = true;
outputs[5] = true;
outputs[6] = true;
outputs[7] = true;
}
return outputs;
}
I know that there must be easier way.
| 0
| 0
| 0
| 0
| 1
| 0
|
im very new to javascript, and writing this script to add up a shopping cart and print out subtotals and totals. it works in FF but not in IE. this function is called by onclick of one of three select options with a value of 0-25. it is in a js file called in the head. what it does is get the selected values as variables, parseint them, adds and multiplies, and changes the innerHTML of the table to reflect the subtotals, and total. FF does it great, but IE gives Nan. ive tried rewriting it a number of different ways, and many translations still work in FF but not IE8. ive made sure the variables and form id's arent repeated.
function gen_invoice() {
var scount = parseInt(document.shopcart.studentcount.value, 10);
var ycount = parseInt(document.shopcart.youthcount.value, 10);
var fcount = parseInt(document.shopcart.facultycount.value, 10);
//html output source is 3 selects like this, with diff ids and names:
//<select name="studentcount" id="studentcount">
//<option onclick="gen_invoice()" value="0">0 </option></select>
var cardcost = parseInt(document.shopcart.cardprice.value, 10);
//cardcost comes from hidden input value:
//<input type="hidden" id="cardprice" name="cardprice" value="25">
var totalsum = scount + ycount + fcount;
var grandtotal = totalsum * cardcost;
document.getElementById('s_price').innerHTML = scount * cardcost;
document.getElementById('y_price').innerHTML = ycount * cardcost;
document.getElementById('f_price').innerHTML = fcount * cardcost;
document.getElementById('grand').innerHTML = grandtotal;
//....
}
...after this there are 3 long loops for writing out some other forms, but they dont work in IE either because they depend on the selected values to be an integer. this part happens first and returns Nan, so im sure the problem is here somwhere.
I have literally hit my head on the table over this. You can imagine how frustrating it is to be able to write the entire rest of the site beautifully, but then fail at adding 3 numbers together. help please!
| 0
| 0
| 0
| 0
| 1
| 0
|
I need function which returns:
for any number from range => result
[0.001,0.01) => 0.01
[0.01,0.1) => 0.1
[0.1,1) => 1
[1,10) => 10
[10,100) => 100
etc.
My first idea was to use if, but this the worst way. Is there a simple solution?
| 0
| 0
| 0
| 0
| 1
| 0
|
How can I run hierarchical clustering on a correlation matrix in scipy/numpy? I have a matrix of 100 rows by 9 columns, and I'd like to hierarchically cluster by correlations of each entry across the 9 conditions. I'd like to use 1-pearson correlation as the distances for clustering. Assuming I have a numpy array X that contains the 100 x 9 matrix, how can I do this?
I tried using hcluster, based on this example:
Y=pdist(X, 'seuclidean')
Z=linkage(Y, 'single')
dendrogram(Z, color_threshold=0)
However, pdist is not what I want, since that's a euclidean distance. Any ideas?
thanks.
| 0
| 0
| 0
| 1
| 0
| 0
|
I'm working on an ASP.NET web app where I'm using a Wizard to take the client through a large series of steps.
One of the steps includes calculating a bunch of numbers on the fly... the numbers calculate properly but when I click "next" and then go back again... some of the numbers are not retained.
Here is the calculation function
function CalculateFields() {
txtSellingPrice = document.getElementById('<%=txtSellingPrice.ClientID %>');
//I get all of the elements like this...
//...
var regexp = /[$,]/g;
//Empty value checks
SellingPrice = (SellingPrice == "" ? "$0" : SellingPrice);
BalanceSheet = (BalanceSheet == "" ? "$0" : BalanceSheet);
DownPayment = (DownPayment == "" ? "$0" : DownPayment);
susearn = (susearn == "" ? "$0" : susearn);
susrev = (susrev == "" ? "$0" : susrev);
balmult = (balmult == "" ? "$0" : balmult);
goodmult = (goodmult == "" ? "$0" : goodmult);
sellmult = (sellmult == "" ? "$0" : sellmult);
//Replace $ with String.Empty
SellingPrice = txtSellingPrice.value.replace(regexp, "");
BalanceSheet = txtBalanceSheet.value.replace(regexp, "");
DownPayment = txtDownPayment.value.replace(regexp, "");
susearn = txtSusEarn.value.replace(regexp, "");
susrev = txtSusRev.value.replace(regexp, "");
balmult = txtBalanceMult.value.replace(regexp, "");
goodmult = txtGoodwillMult.value.replace(regexp, "");
sellmult = txtSellingPriceMult.value.replace(regexp, "");
//Set the new values
txtGoodWill.value = "$" + (SellingPrice - BalanceSheet);
txtBalance.value = "$" + (SellingPrice - DownPayment);
txtSellingPriceMult.value = "$" + SellingPrice;
txtGoodwillMult.value = "$" + (SellingPrice - BalanceSheet);
txtBalanceMult.value = "$" + BalanceSheet;
if (chkTakeBack.checked == 1) {
txtVendorTakeBackPercentage.value = Math.round((SellingPrice - DownPayment) / SellingPrice * 100);
}
else {
txtVendorTakeBackPercentage.value = "0";
}
if (!(susearn == "") && !(susearn == "0") && !(susearn == "$0")) {
txtSusEarnPercentage.value = Math.round(susearn / susrev * 100);
txtBalanceMultPercentage.value = Math.round(balmult / susearn);
txtGoodwillMultPercentage.value = Math.round(goodmult / susearn);
txtSellingPriceMultPercentage.value = Math.round(sellmult / susearn);
}
else {
txtSusEarnPercentage.value = "0";
txtBalanceMultPercentage.value = "0";
txtGoodwillMultPercentage.value = "0";
txtSellingPriceMultPercentage.value = "0";
}
}
all of these calculate properly and retain their value across postbacks
txtGoodWill.value = "$" + (SellingPrice - BalanceSheet);
txtBalance.value = "$" + (SellingPrice - DownPayment);
txtSellingPriceMult.value = "$" + SellingPrice;
txtGoodwillMult.value = "$" + (SellingPrice - BalanceSheet);
txtBalanceMult.value = "$" + BalanceSheet;
These ones however do not retain their value across postbacks
if (chkTakeBack.checked == 1) {
txtVendorTakeBackPercentage.value = Math.round((SellingPrice - DownPayment) / SellingPrice * 100);
}
else {
txtVendorTakeBackPercentage.value = "0";
}
if (!(susearn == "") && !(susearn == "0") && !(susearn == "$0")) {
txtSusEarnPercentage.value = Math.round(susearn / susrev * 100);
txtBalanceMultPercentage.value = Math.round(balmult / susearn);
txtGoodwillMultPercentage.value = Math.round(goodmult / susearn);
txtSellingPriceMultPercentage.value = Math.round(sellmult / susearn);
}
else {
txtSusEarnPercentage.value = "0";
txtBalanceMultPercentage.value = "0";
txtGoodwillMultPercentage.value = "0";
txtSellingPriceMultPercentage.value = "0";
}
The txtVendorTakeBackPercentage always comes back BLANK
and the other three always come back as 0
I'm firing these functions by using the onkeyup event within the form fields.
If Not Page.IsPostBack Then
txtSellingPrice.Attributes.Add("onkeyup", "CalculateFields()")
txtBalanceSheet.Attributes.Add("onkeyup", "CalculateFields()")
txtDownPayment.Attributes.Add("onkeyup", "CalculateFields()")
txtSusRev.Attributes.Add("onkeyup", "CalculateFields()")
txtSusEarn.Attributes.Add("onkeyup", "CalculateFields()")
End If
any thoughts/help/direction would be greatly appreciated.
EDIT:
My page load event looks something like this...
Protected Sub Page_Load(ByVal sender As Object, ByVal e As EventArgs) Handles Me.Load
'Prepair page for advanced validation'
Dim cs As ClientScriptManager = Page.ClientScript
If Not cs.IsOnSubmitStatementRegistered(Me.[GetType](), "PrepareValidationSummary") Then _
cs.RegisterOnSubmitStatement(Me.[GetType](), "PrepareValidationSummary", "CheckForm()")
If Not Page.IsPostBack Then
'Part of the client side math'
txtSellingPrice.Attributes.Add("onkeyup", "CalculateFields()")
txtBalanceSheet.Attributes.Add("onkeyup", "CalculateFields()")
txtDownPayment.Attributes.Add("onkeyup", "CalculateFields()")
txtSusRev.Attributes.Add("onkeyup", "CalculateFields()")
txtSusEarn.Attributes.Add("onkeyup", "CalculateFields()")
My actual aspx page has got over 2400 lines, so I'm not going to post the whole thing. Here is a section where the percentage fields are not retaining their values.
<tr>
<td colspan="5" class="AlignRight">
Average Annual Sustainable Earnings (ebitda) estimated
<ew:NumericBox ID="txtSusEarnPercentage" runat="server" Enabled="False" MaxLength="3"
Width="20px" TruncateLeadingZeros="True" />
%
</td>
<td class="AlignRight">
<ew:NumericBox ID="txtSusEarn" runat="server" AutoFormatCurrency="True" DecimalPlaces="2"
MaxLength="9" Width="92px" />
</td>
<td>
<asp:Image ID="HelpEBITDA0" runat="server" Height="16px" ImageUrl="~/Images/Icons/help.gif" />
</td>
</tr>
<tr>
<td colspan="5" class="AlignRight">
</td>
<td class="AlignRight">
</td>
<td>
</td>
</tr>
<tr>
<td colspan="5" class="AlignRight">
Balance Sheet / Net Asset Value as earnings multiple
<ew:NumericBox ID="txtBalanceMultPercentage" runat="server" Enabled="False" MaxLength="3"
Width="20px" />
</td>
<td class="AlignRight">
<ew:NumericBox ID="txtBalanceMult" runat="server" AutoFormatCurrency="True" DecimalPlaces="2"
MaxLength="9" Width="92px" Enabled="False" />
</td>
<td>
</td>
</tr>
<tr>
<td colspan="5" class="AlignRight">
Goodwill Value as earnings multiple
<ew:NumericBox ID="txtGoodwillMultPercentage" runat="server" Enabled="False" MaxLength="3"
Width="20px" />
</td>
<td class="AlignRight">
<ew:NumericBox ID="txtGoodwillMult" runat="server" AutoFormatCurrency="True" DecimalPlaces="2"
MaxLength="9" Width="92px" Enabled="False" />
</td>
<td>
</td>
</tr>
<tr>
<td colspan="5" class="AlignRight">
Proposed Selling Price as earnings multiple
<ew:NumericBox ID="txtSellingPriceMultPercentage" runat="server" Enabled="False"
MaxLength="3" Width="20px" />
</td>
<td class="AlignRight">
<ew:NumericBox ID="txtSellingPriceMult" runat="server" AutoFormatCurrency="True"
DecimalPlaces="2" MaxLength="9" Width="92px" Enabled="False" />
</td>
<td>
</td>
</tr>
Here is the form when I fill it in
before.png
And here is the form after I hit "next" and then "previous"
after.png
Edit
Images are long gone, sorry.
| 0
| 0
| 0
| 0
| 1
| 0
|
I'm using the PRTools MATLAB library to train some classifiers, generating test data and testing the classifiers.
I have the following details:
N: Total # of test examples
k: # of
mis-classification for each
classifier and class
I want to do:
Calculate and plot Bayesian posterior distributions of the unknown probabilities of mis-classification (denoted q), that is, as probability density functions over q itself (so, P(q) will be plotted over q, from 0 to 1).
I have that (math formulae, not matlab code!):
Posterior = Likelihood * Prior / Normalization constant =
P(q|k,N) = P(k|q,N) * P(q|N) / P(k|N)
The prior is set to 1, so I only need to calculate the likelihood and normalization constant.
I know that the likelihood can be expressed as (where B(N,k) is the binomial coefficient):
P(k|q,N) = B(N,k) * q^k * (1-q)^(N-k)
... so the Normalization constant is simply an integral of the posterior above, from 0 to 1:
P(k|N) = B(N,k) * integralFromZeroToOne( q^k * (1-q)^(N-k) )
(The Binomial coefficient ( B(N,k) ) can be omitted though as it appears in both the likelihood and normalization constant)
Now, I've heard that the integral for the normalization constant should be able to be calculated as a series ... something like:
k!(N-k)! / (N+1)!
Is that correct? (I have some lecture notes with this series, but can't figure out if it is for the normalization constant integral, or for the overall distribution of mis-classification (q))
Also, hints are welcome as how to practically calculate this? (factorials are easily creating truncation errors right?) ... AND, how to practically calculate the final plot (the posterior distribution over q, from 0 to 1).
| 0
| 0
| 0
| 1
| 0
| 0
|
I'm not quite sure why I can't do
double a = (double) my_Function(45) / 2048 / 2340 / 90;
printf("%.4f",a); // prints out 0.00
But instead I have to use one more variable as:
double a = (double) my_Function(45);
double b = a / 2048 / 2340 / 90;
printf("%.4f",b); // prints out the correct value
| 0
| 0
| 0
| 0
| 1
| 0
|
I have a single dimensional array of floating point values (c# doubles FYI) and I need to find the "peak" of the values ... as if graphed.
I can't just take the highest value, as the peak is actually a plateau that has small fluctuations. This plateau is in the middle of a bunch of noise. I'm looking find a solution that would give me the center of this plateau.
An example array might look like this:
1,2,1,1,2,1,3,2,4,4,4,5,6,8,8,8,8,7,8,7,9,7,5,4,4,3,3,2,2,1,1,1,1,1,2,1,1,1,1
where the peak is somewhere in the bolded section.
Any ideas?
| 0
| 0
| 0
| 0
| 1
| 0
|
i am using way point for the artificial car but i don't know the exact concept for that i want to make 3 AI car so how can i mange them parameter based like acceleration speed rotation on turn and collision b/w them pl z guide me.
| 0
| 1
| 0
| 0
| 0
| 0
|
As part of a larger project, I need to read in text and represent each word as a number. For example, if the program reads in "Every good boy deserves fruit", then I would get a table that converts 'every' to '1742', 'good' to '977513', etc.
Now, obviously I can just use a hashing algorithm to get these numbers. However, it would be more useful if words with similar meanings had numerical values close to each other, so that 'good' becomes '6827' and 'great' becomes '6835', etc.
As another option, instead of a simple integer representing each number, it would be even better to have a vector made up of multiple numbers, eg (lexical_category, tense, classification, specific_word) where lexical_category is noun/verb/adjective/etc, tense is future/past/present, classification defines a wide set of general topics and specific_word is much the same as described in the previous paragraph.
Does any such an algorithm exist? If not, can you give me any tips on how to get started on developing one myself? I code in C++.
| 0
| 1
| 0
| 0
| 0
| 0
|
Given any number of the random real numbers from the interval [0,1] is there exist any method to construct a floating point number with zero fractional part?
Your algorithm can use only random() function calls and no variables or constants. No constants and variables are allowed, no type casting is allowed. You can use for/while, if/else or any other programming language operands.
| 0
| 0
| 0
| 0
| 1
| 0
|
I'm working on a resize and crop workflow to allow images to be resized and then cropped to a specific size. Normally one resize the smallest dimension to fit the destination size, and then crop to get eg. a square.
However, in this case, I have some additional face-detection data: face_x, face_y and face_width and face_height. The X and Y coordinates of the face is top-left point in the original picture of where the face starts.
I want the cropped area to be centered at the face instead of in the center of the image.
Any smart minds out there who can help me out? Thanks!
| 0
| 0
| 0
| 0
| 1
| 0
|
I'm writing a sokoban solver for fun and practice, it uses a simple algorithm (something like BFS with a bit of difference).
now i want to estimate its running time ( O and omega). but need to know how to calculate count of acyclic paths from a vertex to another in a network.
actually I want an expression that calculates count of valid paths, between two vertices of a m*n matrix of vertices.
a valid path:
visits each vertex 0 or one times.
have no circuits
for example this is a valid path:
alt text http://megapic.ir/images/f1hgyp5yxcu8887kfvkr.png
but this is not:
alt text http://megapic.ir/images/wnnif13ir5gaqwvnwk9d.png
What is needed is a method to find count of all acyclic paths between the two vertices a and b.
comments on solving methods and tricks are welcomed.
| 0
| 0
| 0
| 0
| 1
| 0
|
I'm messing around with writing a class similar to mpz (C) or BigInteger (Java). This is just for fun, so please don't go on about how I shouldn't be writing my own.
I have a class similar to:
public class HugeInt
{
public List<Integer> digits;
public HugeInt(String value)
{
// convert string value into its seperate digits.
// store them in instance variable above
}
}
Now, doing the add() and subtract() method of this class are pretty simple. Here is an example:
private List<Integer> add(List<Integer> a, List<Integer> b)
{
List<Integer> smallerDigits = (compareDigits(a,b) < 0) ? a : b;
List<Integer> largerDigits = (compareDigits(a,b) >= 0) ? a : b;
List<Integer> result = new ArrayList<Integer>();
int carry = 0;
for(int i = 0; i < largerDigits.size(); i++)
{
int num1 = largerDigits.get(i);
int num2 = (i < smallerDigits.size()) ? smallerDigits.get(i) : 0;
result.add((num1 + num2 + carry) % 10);
carry = ((num1 + num2 + carry) / 10);
}
if (carry != 0) result.add(carry);
return result;
}
Similarly, doing the multiply wasn't that hard either.
I see on wikipedia there is a page on Division Algorithms, but I'm not sure which one is appropriate for what I'm trying to do.
Because these positive integers (represented as digits) can be arbitrarily long, I want to make sure I don't attempt to do any operations on anything other than digit-by-digit basis.
However, can anyone point me in the right direction for doing a division of two numbers that are represented as List<Integer>'s? Also, I can ignore the remainder as this is integer division.
| 0
| 0
| 0
| 0
| 1
| 0
|
My question is in my title. I am trying to develop a logic so that I can scale fixed aspect ratio windows to cover most of the screen without overlapping eachother. There could be two three or four windows. There could be an alignment parameter also.
| 0
| 0
| 0
| 0
| 1
| 0
|
How can I perform vector calculations in lisp, such as magnitude of a vector, norm of a vector, distance (between two points), dot product, cross product, etc.
Thanks.
| 0
| 0
| 0
| 0
| 1
| 0
|
I am working on a project with RL & NN
I need to determine the action vector structure which will be fed to a neural network..
I have 3 different actions (A & B & Nothing) each with different powers (e.g A100 A50 B100 B50)
I wonder what is the best way to feed these actions to a NN in order to yield best results?
1- feed A/B to input 1, while action power 100/50/Nothing to input 2
2- feed A100/A50/Nothing to input 1, while B100/B50/Nothing to input 2
3- feed A100/A50 to input 1, while B100/B50 to input 2, while Nothing flag to input 3
4- Also to feed 100 & 50 or normalize them to 2 & 1 ?
I need reasons why to choose one method
Any suggestions are recommended
Thanks
| 0
| 0
| 0
| 1
| 0
| 0
|
I am searching for an algorithm to fill several slots, which are already filled to some level.
The current levels and the available quantity to fill are known
Resulting levels should be as equal as possible, but existing level cannot be reduced
Slots are filled from left to right, so left slots get higher level if equal level is impossible
Examples http://img695.imageshack.us/img695/6529/fill.png
The image above shows six examples, each column represents a slot. The grey area is already filled, the blue are is the expected position of the new elements.
I could iterate through my slots and increase the quantity on the lowest slot by 1 until the available quantity is consumed, but I wonder about how to actually calculate the new filling levels.
I am going to implement this with SQL/PL/SQL, other code is just as welcome though :)
| 0
| 0
| 0
| 0
| 1
| 0
|
Let's say we have an empty bathtub. We've lost the plug, so once water is added it will drain away at a constant rate of 2 liters pr. minute. We add water to the tub in increments. 60 liters at 10:51, 30 liters at 11:54 and 50 liters at 13:18.
So, the question is: How can I find out how much water is in the bathtub at any given time?
| 0
| 0
| 0
| 0
| 1
| 0
|
I need to analyze a document and compile statistics as to how many times each a sequence of words is used (so the analysis is not on single words but of batch of recurring words). I read that compression algorithms do something similar to what I want - creating dictionaries of blocks of text with a piece of information reporting its frequency.
It should be something similar to http://www.codeproject.com/KB/recipes/Patterns.aspx
Do you have anything written in C#?
| 0
| 1
| 0
| 0
| 0
| 0
|
Using GDAL in Python, how do you get the latitude and longitude of a GeoTIFF file?
GeoTIFF's do not appear to store any coordinate information. Instead, they store the XY Origin coordinates. However, the XY coordinates do not provide the latitude and longitude of the top left corner and bottom left corner.
It appears I will need to do some math to solve this problem, but I don't have a clue on where to start.
What procedure is required to have this performed?
I know that the GetGeoTransform() method is important for this, however, I don't know what to do with it from there.
| 0
| 0
| 0
| 0
| 1
| 0
|
I'm trying to implement an image zoom effect, a bit like how the zoom works with Google Maps, but with a grid of fix position images.
I've uploaded an example of what I have so far here:
http://www.dominicpettifer.co.uk/Files/MosaicZoom.html
(uses CSS3 transforms so only works with Firefox, Opera, Chrome or Safari)
Use your mouse wheel to zoom in/out. The HTML source is basically an outer div with an inner-div, and that inner-div contains 16 images arranged using absolute position. It's going to be a Photo Mosaic basically.
I've got the zoom bit working using CSS3 transforms:
$(this).find('div').css('-moz-transform', 'scale(' + scale + ')');
...however, I'm relying on the mouse X/Y position on the outer div to zoom in on where the mouse cursor is, similar to how Google Maps functions. The problem is that if you zoom right in on an image, move the cursor to the bottom/left corner and zoom again, instead of zooming to the bottom/left corner of the image, it zooms to the bottom/left of the entire mosaic. This has the effect of appearing to jump about the mosaic as you zoom in closer while moving the mouse around, even slightly.
That's basically the problem, I want the zoom to work exactly like Google Maps where it zooms exactly to where your mouse cursor position is, but I can't get my head around the Maths to calculate the transform-origin: X/Y values correctly. Please help, been stuck on this for 3 days now.
Here is the full code listing for the mouse wheel event:
var scale = 1;
$("#mosaicContainer").mousewheel(function(e, delta)
{
if (delta > 0)
{
scale += 1;
}
else
{
scale -= 1;
}
scale = scale < 1 ? 1 : (scale > 40 ? 40 : scale);
var x = e.pageX - $(this).offset().left;
var y = e.pageY - $(this).offset().top;
$(this).find('div').css('-moz-transform', 'scale(' + scale + ')')
.css('-moz-transform-origin', x + 'px ' + y + 'px');
return false;
});
| 0
| 0
| 0
| 0
| 1
| 0
|
I am embarking upon a NLP project for sentiment analysis.
I have successfully installed NLTK for python (seems like a great piece of software for this). However,I am having trouble understanding how it can be used to accomplish my task.
Here is my task:
I start with one long piece of data (lets say several hundred tweets on the subject of the UK election from their webservice)
I would like to break this up into sentences (or info no longer than 100 or so chars) (I guess i can just do this in python??)
Then to search through all the sentences for specific instances within that sentence e.g. "David Cameron"
Then I would like to check for positive/negative sentiment in each sentence and count them accordingly
NB: I am not really worried too much about accuracy because my data sets are large and also not worried too much about sarcasm.
Here are the troubles I am having:
All the data sets I can find e.g. the corpus movie review data that comes with NLTK arent in webservice format. It looks like this has had some processing done already. As far as I can see the processing (by stanford) was done with WEKA. Is it not possible for NLTK to do all this on its own? Here all the data sets have already been organised into positive/negative already e.g. polarity dataset http://www.cs.cornell.edu/People/pabo/movie-review-data/ How is this done? (to organise the sentences by sentiment, is it definitely WEKA? or something else?)
I am not sure I understand why WEKA and NLTK would be used together. Seems like they do much the same thing. If im processing the data with WEKA first to find sentiment why would I need NLTK? Is it possible to explain why this might be necessary?
I have found a few scripts that get somewhat near this task, but all are using the same pre-processed data. Is it not possible to process this data myself to find sentiment in sentences rather than using the data samples given in the link?
Any help is much appreciated and will save me much hair!
Cheers Ke
| 0
| 1
| 0
| 0
| 0
| 0
|
I have a datagridview with 9 columns. I am simply trying take the value in column 5 and subtract it from column 6, then display the result in column 9. It seems simple enough, I know it's done in excel all the time. But I just cannot figure this out. Do I need to create a new class with a method called calculate columns? Or does the datagridview class have something already built in that can handle this?
| 0
| 0
| 0
| 0
| 1
| 0
|
I'm doing this for fun (or as 4chan says "for teh lolz") and if I learn something on the way all the better. I took an AI course almost 2 years ago now and I really enjoyed it but I managed to forget everything so this is a way to refresh that.
Anyway I want to be able to generate text given a set of inputs. Basically this will read forum inputs (or maybe Twitter tweets) and then generate a comment based on the learning.
Now the simplest way would be to use a Markov Chain Text Generator but I want something a little bit more complex than that as the MKC basically only learns by word order (which word is more likely to appear after word x given the input text). I'm trying to see if there's something I can do to make it a little bit more smarter.
For example I want it to do something like this:
Learn from a large selection of posts in a message board but don't weight it too much
For each post:
Learn from the other comments in that post and weigh these inputs higher
Generate comment and post
See what other users' reaction to your post was. If good weigh it positively so you make more posts that are similar to the one made, and vice versa if negative.
It's the weighing and learning from mistakes part that I'm not sure how to implement. I thought about Artificial Neural Networks (mainly because I remember enjoying that chapter) but as far as I can tell that's mainly used to classify things (i.e. given a finite set of choices [x1...xn] which x is this given input) not really generate anything.
I'm not even sure if this is possible or if it is what should I go about learning/figuring out. What algorithm is best suited for this?
To those worried that I will use this as a bot to spam or provide bad answers to SO, I promise that I will not use this to provide (bad) advice or to spam for profit. I definitely will not post it's nonsensical thoughts on SO. I plan to use it for my own amusement.
Thanks!
| 0
| 1
| 0
| 0
| 0
| 0
|
How to double a number of binary digits in an integer? For example, if bin(x)="1001" then bin(y) must be "11000011". Is there any smart and fast algorithm ?
UPDATE: Here is an elegant solution:
''.join([''.join(i) for i in zip(X,X)])
where X is bin(int_x)[2:]
However, I am interested in a more faster way and for the integers of any size. Maybe an arithmetical transformation should help.
| 0
| 0
| 0
| 0
| 1
| 0
|
Can we count Processing as Environment for Mathematical Modelling and Programming? And If yes can we do the same for Eclipse (Java)?
| 0
| 0
| 0
| 0
| 1
| 0
|
I'm not sure if this is the right place to post this, but the problem actually belongs to a programming assignment. This recursion is something I probably should know how to solve but Im having a bit of trouble with it.
Solve the recursion:
T(0) = 2;
T(n) = T(n-1) + 2;
Solution:
T(n) = 2(n+1)
Could someone please show me how they got to that solution?
Please not that its not the main part of the assignment to solve this particular problem.
| 0
| 0
| 0
| 0
| 1
| 0
|
Lets say I've got two squares and I know their positions, a red and blue square:
redTopX;
redTopY;
redBotX;
redBotY;
blueTopX;
blueTopY;
blueBotX;
blueBotY;
Now, I want to check if square blue resides (partly) within (or around) square red. This can happen in a lot of situations, as you can see in this image I created to illustrate my situation better:
alt text http://www.feedpostal.com/etc/ranges.gif
Note that there's always only one blue and one red square, I just added multiple so I didn't have to redraw 18 times.
My original logic was simple, I'd check all corners of square blue and see if any of them are inside square red:
if (
((redTopX >= blueTopX) && (redTopY >= blueTopY) && (redTopX <= blueBotX) && (redTopY <= blueBotY)) || //top left
((redBotX >= blueTopX) && (redTopY >= blueTopY) && (redBotX <= blueBotX) && (redTopY <= blueBotY)) || //top right
((redTopX >= blueTopX) && (redBotY >= blueTopY) && (redTopX <= blueBotX) && (redBotY <= blueBotY)) || //bottom left
((redBotX >= blueTopX) && (redBotY >= blueTopY) && (redBotX <= blueBotX) && (redBotY <= blueBotY)) //bottom right
) {
//blue resides in red
}
Unfortunately, there are a couple of flaws in this logic. For example, what if red surrounds blue (like in situation 1)?
I thought this would be pretty easy but am having trouble coming up with a good way of covering all these situations.. can anyone help me out here?
Regards,
Tom
| 0
| 0
| 0
| 0
| 1
| 0
|
I have two 2D vectors, say u and v, defined by cartesian coordinates.
Imagine that vectors are needles of a clock. I'm looking for the fastest way to find out, using python, if v is after or before u (or in other words find out in wich half plane is v, regarding to position of u). For the purpose of the problem if vectors are aligned answer should be before.
It seems easy using some trigonometry, but I believe there should be a faster way using coordinates only.
My test case:
def after(u, v):
"""code here"""
after((4,2), (6, 1)) : True
after((4,2), (3, 3)) : False
after((4,2), (2, 1)) : False
after((4,2), (3, -3)) : True
after((4,2), (-2, -5)) : True
after((4,2), (-4, -2)) : False
| 0
| 0
| 0
| 0
| 1
| 0
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.