UltraData-Math

Dataset card Data Studio Files Files and versions

Subset (6)

UltraData-Math-L1 · 86M rows

Split (1)

train · 86M rows

content stringlengths 86 994k	meta stringlengths 288 619
Lefschetz Hyper-plane theorem for singular projective varieties? up vote 6 down vote favorite Lefschetz hyper-plane theorem for smooth projective varieties, $X\subset \mathbb{P}^{n+1}$ says: For smooth hyperplane section $Y= X\cap H$, the restriction map $H^i(X) \rightarrow H^i(Y)$ is an isomorphism for $0\leq i \leq n$ and an injection for $i=n$. Similarly we get an statement for homologies. For a singular variety projective variety $X$, lets consider the singular homology (or singular cohomology) Here is the question: Is there a Lefschetz hyperplane theorem in for projective varieties with possible canonical singularities? What which I expect is some thing like this: $X$ as before and assume $X_{sing}$ (singular locus of $X$) has codimension at least $k$ in $X$; then for generic hyperplane section $Y$ we have an isomorphism: $H_i(X)\cong H_i(Y)$ for $i$ less then some function of $k$ and $n$ !!! ag.algebraic-geometry complex-geometry at.algebraic-topology A slight typo: the $n$ in "$0\leq i\leq n$" is not the same as in "$\mathbb P^{n+1}.$" BTW, I wonder if one can deduce something from the version for intersection cohomology, combined with the constraint on codim of the singular locus. – shenghao Mar 8 '11 at 13:19 In a related but different setup you should see Dan Halpern-Leistner's paper "The Lefschetz Hyperplane theorem for stacks". – Daniel Pomerleano May 13 '11 at 10:03 add comment 3 Answers active oldest votes There are actually several versions of the Lefschetz hyperplane theorem for singular varieties. The main point is that this is ultimately a Hodge theoretic statement, one proof is using the Kodaira-Akizuki-Nakano vanishing theorem to establish the analogous statement for the Hodge components of singular cohomology. Hartshorne proved that the usual statement holds if $X\setminus Y$ is smooth, in other words, if $Y$ contains the singular locus of $X$. See 4.3 of this paper. up vote 4 down vote With the development of a sensible Hodge theory for singular varieties this has been further generalized. I am not sure whom to attribute the credit for this. You can find a version for the case when $X$ is a local complete intersection in III.3.12(iii) of this volume. the version where the hyperplane contains the singular points is already in the standard reference of milnor, morse theory. p.41. at least over the complex numbers. – roy smith Mar 8 '11 at 4:50 If you downvote (Roy, I know it wasn't you), would you mind telling me why? – Sándor Kovács Mar 8 '11 at 15:10 so you mean there is nothing none yet when $Y$ is a generic hyperplane section and not necessarily one which has the singular locus? – Mohammad F. Tehrani Mar 8 '11 at 19:44 can you say more details on the first paragraph of your answer. or can you mention one of those several versions which is most relevant to this case. The case I have in mind is when $X$ is a projective 4-fold with canonical singularities and $Y$ is a hyperplane section. You can even assume $X$ is toric. – Mohammad F. Tehrani Mar 8 '11 at 19:46 1 Is the weak Lefschetz theorem for intersection cohomology of interest? igitur-archive.library.uu.nl/math/2007-0224-201418/… – roy smith Mar 10 '11 at 16:42 show 3 more comments I think what you are looking for is the Lefschetz hyperplane theorem for singular varieties from Goresky and MacPherson's " Stratified Morse theory" (part II, section 1.2). The range in which there is an isomorphism depends on the number of equations needed to define $X$ locally. The theorem says (after some deciphering) that if this number is $\leq k$ for the points of $X$ outside the hyperplane, then the hyperplane section map is an isomorphism in degrees $< N-k-1$ where $N$ is the dimension of the ambient projective space. up vote 4 down vote Also, for the middle perversity intersection homology the Lefschetz theorem is stated almost exactly as for smooth varieties and ordinary homology: for a generic hyperplane the hyperplane section map in homology is an isomorphism in degrees $<\dim X-1$ and is surjective in degree $\dim X-1$. add comment I would like to provide two more references: First is "Positivity in algebraic geometry I" by Lazarsfeld, section 3.1 There is a nice counterexample there, showing that even if $X$ has an isolated singularity, we can have $H_1(X)\ne H_1(Y)$ for $X$ of dimension 3 and higher. Namely we should just take any smooth $X$ with $\pi_1(X)=0$ and identify two points $x,y$ on it. Then $\pi_1$ of the obtained variety will be $\ up vote 2 mathbb Z$, while for generic $Y$ we have $\pi_1(Y)=0$. But surely this singularity is by no means canonical. down vote Second reference (advised in the book of Lazarsfeld) is "On topology of algebraic varieties Fulton". If you google exactly this phrase (with " "), you will get the article. It treats in particular the case when $X$ is a local complete intersection on the complement to the hyperplane, mentioned by Sandor (first theorem in chapter 3). add comment Not the answer you're looking for? Browse other questions tagged ag.algebraic-geometry complex-geometry at.algebraic-topology or ask your own question.	{"url":"http://mathoverflow.net/questions/57744/lefschetz-hyper-plane-theorem-for-singular-projective-varieties?sort=newest","timestamp":"2014-04-19T20:27:00Z","content_type":null,"content_length":"67916","record_id":"<urn:uuid:3abd3089-d47d-4b82-a54e-ce1ea87256f8>","cc-path":"CC-MAIN-2014-15/segments/1397609537376.43/warc/CC-MAIN-20140416005217-00103-ip-10-147-4-33.ec2.internal.warc.gz"}
Mplus Discussion >> Output of EFA Hirotaka Jo posted on Saturday, April 07, 2012 - 3:45 am Dear Professor Muthen. I have two questions concerning EFA. First question As my data is dichotomous, I calculate Tetrachoric correlation coefficient. The output shows some messages below WARNING: THE BIVARIATE TABLE OF V5 AND V1 HAS AN EMPTY CELL. The correlation coefficient of V5 and V1 of Mplus output is 0.979. The result of same variables in R (freeware) was 0.999. Why these values are different? Does Mplus replace tetrachoric correlation to other correlation? Second question I did factor analysis using SPSS. Calculation stopped because of linear combination. But EFA of Mplus completed analysis. Why Mplus can calculate? In addition, I don ft know that it is possible to use Mplus result for my thesis because of below message Thank you. Linda K. Muthen posted on Sunday, April 08, 2012 - 8:57 am A zero cell in a bivariate table implies a correlation of one. There are different ways to deal with zero cells resulting in correlations being estimated at different values. If you have a zero cell, you should use only one of the variables in the analysis if the model is being fitted to tetrachoric correlations. Alternatively, you can use maximum likelihood with categorical outcomes which fits the model to the raw data. This message can be ignored. You would get a different message if some of your variables are from a linear combination. Back to top	{"url":"http://www.statmodel.com/cgi-bin/discus/discus.cgi?pg=next&topic=8&page=9181","timestamp":"2014-04-18T20:45:10Z","content_type":null,"content_length":"18068","record_id":"<urn:uuid:6f51e09c-0b7e-45c5-b59c-12ded604c8b9>","cc-path":"CC-MAIN-2014-15/segments/1398223206120.9/warc/CC-MAIN-20140423032006-00334-ip-10-147-4-33.ec2.internal.warc.gz"}
Inquiring Minds You asked: What is the exact speed a particle can be accelerated? We usually express the particle velocity as a fraction of the velocity of light. The formula is: v/c = Sqrt(E^2-m^2*c^4)/E. where E is the particle energy in GeV and m is the particle mass. Particles with 0 mass always travel at the speed of light regardless of their energy. The only particle that we know to be massless is the photon, the basic unit (particle) of light. Neutrinos have a very small mass, but may not be massless. The neutrino mass is a subject of intense research at Fermilab and other laboratories. In high energy accelerators, particles travel at nearly the speed of light, but they never exceed the speed of light. For example, the Tevatron accelerates both protons and antiprotons to 980 GeV. The mass of the proton and antiproton are the same and equal to 0.93827 GeV/c^2. >From the formula quoted above, you can calculate that the speed of particles in the Tevatron is equal to 99.999954% of the speed of light. Back to Questions About Physics Main Page	{"url":"http://fnal.gov/pub/inquiring/questions/speedopart.html","timestamp":"2014-04-17T07:38:35Z","content_type":null,"content_length":"15349","record_id":"<urn:uuid:3cb3dc85-145b-4bcd-94ce-8163541ee1a3>","cc-path":"CC-MAIN-2014-15/segments/1397609526311.33/warc/CC-MAIN-20140416005206-00456-ip-10-147-4-33.ec2.internal.warc.gz"}
Correct usage of starter? Hi all! i just want to make sure i understood everything correct - have a big pizza-session at the weekend and i'm using my Ischia and Camaldoli starter for the 1st time Hydratation 60%, Starter 5% (% of total dough), Salt 2.8%, total dough weight is 1000g (for better calculating) In this case i have to use 50g cold/active starter and feed it with 100g water and 100g flour before usage, don't I? Then the total of 125g water and 125g flour is substracted from the total weight, That means that i only add 500g flour and 250g water + salt?! Is that correct so far?	{"url":"http://www.pizzamaking.com/forum/index.php?topic=15909.0;prev_next=next","timestamp":"2014-04-21T02:25:41Z","content_type":null,"content_length":"44784","record_id":"<urn:uuid:d1b81890-7d95-4fd4-bc6b-f5a291ed8516>","cc-path":"CC-MAIN-2014-15/segments/1397609539447.23/warc/CC-MAIN-20140416005219-00116-ip-10-147-4-33.ec2.internal.warc.gz"}
I can't for the life of me figure this out!!!! August 4th 2009, 12:09 PM #1 Jul 2009 I can't for the life of me figure this out!!!! Sorry for the vague subject header, but this problem is driving me crazy!!! Here is the data that I have: 1)Days in month =31 2)Weeks in month =4.4 3)# of occurances for each day within month: Mon, Sat, Sun = 5 Tue-Fri =4 4)% Contribution for each day within a normal week Monday =21% Tuesday =18% Wednesday =17% Thursday =16% Friday =18% Saturday =8% Sunday =2% 5)Average Day contribution to week (day/days in week) =14.3% 6)Average Daily Contribution to month (day/days in month) =3.2% How do i calculate the Daily contribution for each day over a month? Could anyone give me a hand? Last edited by uneakbreed; August 4th 2009 at 12:29 PM. I've gotten close I thought i figured it out, but when i tried to check my work, i came up with 99.9376% instead of 100% when i summed every-days contribution. I tried: $x= AvgNumberOfWeekdaysMonth* \frac{AvgDayContributionToMonth}{AcutalNumberOfWee kdayInMonth}$ % Contribution of Individual Day to Month $= ActualContributionOfWeekdayToWeek *\frac{x}{AvgContributionOf WeekdayToWeek}<br />$ Any ideas? got it looksl like i overcomplicated it. got it! August 4th 2009, 02:21 PM #2 Jul 2009 August 4th 2009, 03:15 PM #3 Jul 2009	{"url":"http://mathhelpforum.com/business-math/96965-i-can-t-life-me-figure-out.html","timestamp":"2014-04-18T21:10:17Z","content_type":null,"content_length":"35135","record_id":"<urn:uuid:c6a82029-1c0e-46f3-bd2c-be9986f8fe40>","cc-path":"CC-MAIN-2014-15/segments/1397609535095.9/warc/CC-MAIN-20140416005215-00245-ip-10-147-4-33.ec2.internal.warc.gz"}
PHP Math Precision Stack Overflow is a question and answer site for professional and enthusiast programmers. It's 100% free, no registration required. $a = '35'; $b = '-34.99'; echo ($a + $b); Results in 0.009999999999998 up vote 45 down vote favorite What is up with that? I wondered why my program kept reporting odd results. Why doesn't PHP return the expected 0.01? php floating-point precision floating-accuracy add comment $a = '35'; $b = '-34.99'; echo ($a + $b); What is up with that? I wondered why my program kept reporting odd results. Because floating point arithmetic != real number arithmetic. An illustration of the difference due to imprecision is, for some floats a and b, (a+b)-b != a. This applies to any language using floats. See an example in Python. Since floating point are binary numbers with finite precision, there's a finite amount of representable numbers, which leads accuracy problems and surprises like this. Here's another interesting read: What Every Computer Scientist Should Know About Floating-Point Arithmetic. Back to your problem, basically there is no way to accurately represent 34.99 or 0.01 in binary (just like in decimal, 1/3 = 0.3333...), so approximations are used instead. To up vote 76 down vote get around the problem, you can: 1. Use round($result, 2) on the result to round it to 2 decimal places. 2. Use integers. If that's currency, store them as 3500 and 3499. Then divide the result by 100. It's a pity that PHP doesn't have a decimal datatype like other languages do. show 3 more comments Because floating point arithmetic != real number arithmetic. An illustration of the difference due to imprecision is, for some floats a and b, (a+b)-b != a. This applies to any language using floats. See an example in Python. Since floating point are binary numbers with finite precision, there's a finite amount of representable numbers, which leads accuracy problems and surprises like this. Here's another interesting read: What Every Computer Scientist Should Know About Floating-Point Arithmetic. Back to your problem, basically there is no way to accurately represent 34.99 or 0.01 in binary (just like in decimal, 1/3 = 0.3333...), so approximations are used instead. To get around the problem, you can: Use round($result, 2) on the result to round it to 2 decimal places. Use integers. If that's currency, store them as 3500 and 3499. Then divide the result by 100. It's a pity that PHP doesn't have a decimal datatype like other languages do. Floating point numbers, like all numbers, must be stored in memory as a string of 0's and 1's. It's all bits to the computer. How floating point differs from integer is in how we interpret the 0's and 1's when we want to look at them. One bit is the "sign" (0 = positive, 1 = negative), 8 bits are the exponent (ranging from -128 to +127), 23 bits are the number known as the "mantissa". So the binary representation of (S1)(P8)(M23) has the value (-1^S)M2^P The "mantissa" takes on a special form. In normal scientific notation we display the "one's place" along with the fraction. For instance: 4.39 x 10^3 = 439 In binary the "one's place" is a single bit. Since we ignore all the left-most 0's in scientific notation (we ignore any insignificant figures) the first bit is guaranteed to be a 1 1.101 x 2^4 = 1101 = 13 Since we are guaranteed that the first bit will be a 1, we remove this bit when storing the number to save space. So the above number is stored as just 101 (for the mantissa). The leading 1 is assumed As an example, let's take the binary string Breaking it into it's components: Sign Power Mantissa + +4 1.1011 + +4 1 + .5 + .125 + .0625 + +4 1.6875 Applying our simple formula: up vote 27 down vote (-1^S)M2^P +50 (-1^0)(1.6875)2^(+4) In other words, 00000010011011000000000000000000 is 27 in floating point (according to IEEE-754 standards). For many numbers there is no exact binary representation, however. Much like how 1/3 = 0.333.... repeating forever, 1/100 is 0.00000010100011110101110000..... with a repeating "10100011110101110000". A 32-bit computer can't store the entire number in floating point, however. So it makes its best guess. Sign Power Mantissa + -7 1.01000111101011100001010 0 -00000111 01000111101011100001010 (note that negative 7 is produced using 2's complement) It should be immediately clear that 01111100101000111101011100001010 looks nothing like 0.01 More importantly, however, this contains a truncated version of a repeating decimal. The original decimal contained a repeating "10100011110101110000". We've simplified this to Translating this floating point number back into decimal via our formula we get 0.0099999979 (note that this is for a 32-bit computer. A 64-bit computer would have much more accuracy) When the Operating System sees a number like this, it has to determine if it should use the number as it sees it, or if it should round to a more meaningful number. Most computers will use the number as it's stored, since this is considered "safer". Some computers, however (Windows does this, I believe) will "round" to the nearest "simple" decimal number. In this case, 0.01 looks like a good candidate. add comment Floating point numbers, like all numbers, must be stored in memory as a string of 0's and 1's. It's all bits to the computer. How floating point differs from integer is in how we interpret the 0's and 1's when we want to look at them. One bit is the "sign" (0 = positive, 1 = negative), 8 bits are the exponent (ranging from -128 to +127), 23 bits are the number known as the "mantissa". So the binary representation of (S1)(P8)(M23) has the value (-1^S)M2^P The "mantissa" takes on a special form. In normal scientific notation we display the "one's place" along with the fraction. For instance: In binary the "one's place" is a single bit. Since we ignore all the left-most 0's in scientific notation (we ignore any insignificant figures) the first bit is guaranteed to be a 1 Since we are guaranteed that the first bit will be a 1, we remove this bit when storing the number to save space. So the above number is stored as just 101 (for the mantissa). The leading 1 is Sign Power Mantissa 0 00000100 10110000000000000000000 + +4 1.1011 + +4 1 + .5 + .125 + .0625 + +4 1.6875 In other words, 00000010011011000000000000000000 is 27 in floating point (according to IEEE-754 standards). For many numbers there is no exact binary representation, however. Much like how 1/3 = 0.333.... repeating forever, 1/100 is 0.00000010100011110101110000..... with a repeating "10100011110101110000". A 32-bit computer can't store the entire number in floating point, however. So it makes its best guess. 0.0000001010001111010111000010100011110101110000 Sign Power Mantissa + -7 1.01000111101011100001010 0 -00000111 01000111101011100001010 0 11111001 01000111101011100001010 It should be immediately clear that 01111100101000111101011100001010 looks nothing like 0.01 More importantly, however, this contains a truncated version of a repeating decimal. The original decimal contained a repeating "10100011110101110000". We've simplified this to Translating this floating point number back into decimal via our formula we get 0.0099999979 (note that this is for a 32-bit computer. A 64-bit computer would have much more accuracy) When the Operating System sees a number like this, it has to determine if it should use the number as it sees it, or if it should round to a more meaningful number. Most computers will use the number as it's stored, since this is considered "safer". Some computers, however (Windows does this, I believe) will "round" to the nearest "simple" decimal number. In this case, 0.01 looks like a good There's plenty of answers here about why floating point numbers work the way they do... But there's little talk of arbitrary precision (Pickle mentioned it). If you want (or need) exact precision, the only way to do it (for rational numbers at least) is to use the BC Math extension (which is really just a BigNum, Arbitrary Precision implementation... To add two numbers: $number = '12345678901234.1234567890'; $number2 = '1'; echo bcadd($number, $number2); will result in 12345678901235.1234567890... This is called arbitrary precision math. Basically all numbers are strings which are parsed for every operation and operations are performed on a digit by digit basis (think long division, but done by the library). So that means it's quite slow (in comparison to regular math constructs). But it's very powerful. You can multiply, add, subtract, divide, find modulo and exponentiate any number that has an exact string representation. So you can't do 1/3 with 100% accuracy, since it has a repeating decimal (and hence isn't rational). But, if you want to know what 1500.0015 squared is: up vote 10 Using 32 bit floats (double precision) gives the estimated result of: down vote But bcmath gives the exact answer of: It all depends on the precision you need. Also, something else to note here. PHP can only represent either 32 bit or 64 bit integers (depending on your install). So if an integer exceeds the size of the native int type (2.1 billion for 32bit, 9.2 x10^18, or 9.2 billion billion for signed ints), PHP will convert the int into a float. While that's not immediately a problem (Since all ints smaller than the precision of the system's float are by definition directly representable as floats), if you try multiplying two together, it'll lose significant precision. For example, given $n = '40000000002': As a number, $n will be float(40000000002), which is fine since it's exactly represented. But if we square it, we get: float(1.60000000016E+21) As a string (using BC math), $n will be exactly '40000000002'. And if we square it, we get: string(22) "1600000000160000000004"... So if you need the precision with large numbers, or rational decimal points, you might want to look into bcmath... add comment There's plenty of answers here about why floating point numbers work the way they do... But there's little talk of arbitrary precision (Pickle mentioned it). If you want (or need) exact precision, the only way to do it (for rational numbers at least) is to use the BC Math extension (which is really just a BigNum, Arbitrary Precision implementation... This is called arbitrary precision math. Basically all numbers are strings which are parsed for every operation and operations are performed on a digit by digit basis (think long division, but done by the library). So that means it's quite slow (in comparison to regular math constructs). But it's very powerful. You can multiply, add, subtract, divide, find modulo and exponentiate any number that has an exact string representation. So you can't do 1/3 with 100% accuracy, since it has a repeating decimal (and hence isn't rational). But, if you want to know what 1500.0015 squared is: Using 32 bit floats (double precision) gives the estimated result of: Also, something else to note here. PHP can only represent either 32 bit or 64 bit integers (depending on your install). So if an integer exceeds the size of the native int type (2.1 billion for 32bit, 9.2 x10^18, or 9.2 billion billion for signed ints), PHP will convert the int into a float. While that's not immediately a problem (Since all ints smaller than the precision of the system's float are by definition directly representable as floats), if you try multiplying two together, it'll lose significant precision. As a number, $n will be float(40000000002), which is fine since it's exactly represented. But if we square it, we get: float(1.60000000016E+21) As a string (using BC math), $n will be exactly '40000000002'. And if we square it, we get: string(22) "1600000000160000000004"... So if you need the precision with large numbers, or rational decimal points, you might want to look into bcmath... Use PHP's round() function: http://php.net/manual/en/function.round.php up vote 4 This answer solves problem, but not explains why. I thought that it is obvious [I am also programming in C++, so it IS obvious for me ;]], but if not, let's say that PHP has it's own down vote calculating precision and in that particular situation it returned most complying information regarding that calculation. show 4 more comments This answer solves problem, but not explains why. I thought that it is obvious [I am also programming in C++, so it IS obvious for me ;]], but if not, let's say that PHP has it's own calculating precision and in that particular situation it returned most complying information regarding that calculation. my php returns 0.01... up vote 1 down vote maybe it have todo with php version, (i using 5.2) add comment maybe it have todo with php version, (i using 5.2) Because 0.01 can't be represented exactly as sum of series of binary fractions. And that is how floats are stored in memory. up vote 1 down vote I guess it is not what you want to hear, but it is answer to question. For how to fix see other answers. add comment Because 0.01 can't be represented exactly as sum of series of binary fractions. And that is how floats are stored in memory. I guess it is not what you want to hear, but it is answer to question. For how to fix see other answers. bcadd() might be useful here. $a = '35'; $b = '-34.99'; echo $a + $b; echo '<br />'; up vote 0 down vote echo bcadd($a,$b,2); (inefficient output for clarity) First line gives me 0.009999999999998. Second gives me 0.01 add comment <?PHP $a = '35'; $b = '-34.99'; echo $a + $b; echo '<br />'; echo bcadd($a,$b,2); ?> wouldn't it be easier to use number_format(0.009999999999998, 2) or $res = $a+$b; -> number_format($res, 2);? up vote 0 down vote add comment wouldn't it be easier to use number_format(0.009999999999998, 2) or $res = $a+$b; -> number_format($res, 2);?	{"url":"http://stackoverflow.com/questions/3726721/php-math-precision/3726761","timestamp":"2014-04-21T05:31:30Z","content_type":null,"content_length":"123429","record_id":"<urn:uuid:4f7ed6ed-b39c-4831-8f5c-bce762ba039f>","cc-path":"CC-MAIN-2014-15/segments/1397609539493.17/warc/CC-MAIN-20140416005219-00527-ip-10-147-4-33.ec2.internal.warc.gz"}
Two's Complement Binary Strings - File Exchange - MATLAB Central Be the first to rate this file! 44 Downloads (last 30 days) File Size: 4.4 KB File ID: #38889 Two's Complement Binary Strings 02 Nov 2012 Convert between binary fixed point two's complement strings and decimal numbers. File Information These functions convert between binary strings and decimal numbers like the built-in MATLAB functions BIN2DEC and DEC2BIN but can accommodate negative integers (via two's complement) and fractional positive and negative numbers (via two's complement fixed point with a binary point in the string). Note that many fractional numbers that can be represented with a finite number of fractional digits cannot be represented by a finite number of fractional bits (specifically non-powers-of-two fractions like 0.3), which means that FIX2DEC will not always exactly invert DEC2FIX. Required MATLAB MATLAB MATLAB 7.5 (R2007b) Tags for This File Convert between binary fixed point two's complement strings and decimal numbers. File Information These functions convert between binary strings and decimal numbers like the built-in MATLAB functions BIN2DEC and DEC2BIN but can accommodate negative integers (via two's complement) and fractional positive and negative numbers (via two's complement fixed point with a binary point in the string). Note that many fractional numbers that can be represented with a finite number of fractional digits cannot be represented by a finite number of fractional bits (specifically non-powers-of-two fractions like 0.3), which means that FIX2DEC will not always exactly invert DEC2FIX. Required MATLAB MATLAB MATLAB 7.5 (R2007b) These functions convert between binary strings and decimal numbers like the built-in MATLAB functions BIN2DEC and DEC2BIN but can accommodate negative integers (via two's complement) and fractional positive and negative numbers (via two's complement fixed point with a binary point in the string). Note that many fractional numbers that can be represented with a finite number of fractional digits cannot be represented by a finite number of fractional bits (specifically non-powers-of-two fractions like 0.3), which means that FIX2DEC will not always exactly invert DEC2FIX.	{"url":"http://www.mathworks.com/matlabcentral/fileexchange/38889-two-s-complement-binary-strings","timestamp":"2014-04-18T20:53:18Z","content_type":null,"content_length":"24349","record_id":"<urn:uuid:6cb38c55-6853-4e0b-bc5b-b483c1fb66ee>","cc-path":"CC-MAIN-2014-15/segments/1397609535095.9/warc/CC-MAIN-20140416005215-00250-ip-10-147-4-33.ec2.internal.warc.gz"}
-Fuzzy Connectedness in Stratified Order-Preserving Operator Spaces Advances in Fuzzy Systems Volume 2012 (2012), Article ID 925948, 6 pages Research Article -Fuzzy Connectedness in Stratified Order-Preserving Operator Spaces ^1Department of Mathematics, Hunan University of Science and Engineering, Yongzhong 425100, China ^2Department of English Teaching, Hunan University of Science and Engineering, Yongzhong 425100, China ^3Department of Physics and Mathematics, WuYi University, Jangmen 529020, China Received 6 August 2011; Revised 8 December 2011; Accepted 8 December 2011 Academic Editor: Ping Feng Pai Copyright © 2012 Xiu-Yun Wu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. The concepts of stratified order-preserving operators and stratified continuity are introduced in -fuzzy topological spaces. Their basic properties are discussed, and their characteristic properties are observed. The relationship between induced stratified order-preserving topological spaces and general order-preserving operator topological spaces is studied. Finally, stratified connectedness is introduced, and its properties are studied systematically. 1. Introduction Since the concept of -fuzzy order-preserving operator was introduced by Professor Chen in 2002 (see [1]), a lot of papers have being devoted to it (see [2–5]). In general topology, similar researches were established (see [5]). However, it has not yet been found in stratified space. As we know, it is quite different between -fuzzy stratified topological spaces and -fuzzy topological spaces. Thus, it is important and meaningful to introduce the concept. 2. Preliminaries In this paper, a lattice is called a completely distributive lattice with an order-reserving involution′, if the following conditions hold.(1) is a completely lattice. That is, the largest element , and smallest elements . Besides, , , .(2)Distributive law holds in . That is, , , , then (3)There is a mapping satisfies: , then , and , implies (see [6]). In this paper, will always denote nonempty crisp sets, A mapping is called an -fuzzy set. is the set of all -fuzzy sets on . An element is called an irreducible element in , if implies or , where . The set of all nonzero irreducible elements in will be denoted by (see [6]). If , , then is called a molecule in . The set of all molecules in is denoted by (see [7]). If , , take . If , the complement of , denoted by , and (see [8]). The following are the concepts of -fuzzy order-preserving operator in -fuzzy topological space and order-preserving operator in general topological space. Let be an nonempty set. An operator is called an -fuzzy order preserving operator in , if it satisfies: (1) , (2) and implies . A set is called an -set, if . The set of all -sets in is denoted by . And is called an order-preserving operator space (briefly, -). A molecule , is called an -remote neighborhood of , if . The set of all -remote neighborhood of is denoted by . Let , is called an -adherent point of , if ,. The union of all -adherent points of is called the -closure of , denoted by . A set is called -closed, if . The set of all -closed sets in is denoted by . is finite union and infinite intersection preserving (see [1]). Let be an nonempty set, be the family of all subsets of . An operator is called an order preserving operator in , if it satisfies: (1) , (2) implies . A set is called an -set, if . The set of all -sets in is denoted by . And is called an order-preserving operator space on (briefly, ). Let , is called an -remote neighborhood of , if there is , such that . The set of all -remote neighborhood of is denoted by . Let , is called an -adherent point of , if , . The union of all -adherent points of is called the -closure of , denoted by . An set is called -closed, if . The set of all -closed sets in is denoted by . is finite union and infinite intersection preserving (see [5]). Let be an , be an fuzzy lattice, . A fuzzy set is called a lower continuous function, if . Then, the set of all the lower continuous functions, denoted by consists an -fuzzy topology in . The space is called the induced - by (see [5]). Considering the above definitions, if we say there is an - or an , we mean there is an order-preserving operator on , or on . The two spaces are generated by them, respectively. Let and be two -fuzzy topological spaces, be induced by simple mapping . If and its reverse mapping satisfies:(1), ;(2), . Then is called an -fuzzy mapping (see [6]). An -fuzzy mapping is called homomorphism, if it satisfies:(1) is union preserving. That is, for , ;(2) is reserving involution preserving. That is, for , (see [6]). 3. -Closed Set Definition 1. Let be an -, . An operator is defined by: , Since the operator is related to , such kind of operator is generally called stratified order-preserving operator. Clearly, if is a closure operator, then is (see [9]). Theorem 2. Let be an -, . , then the following statements hold:(1) implies ;(2);(3);(4). Proof. (1), (2) are easy. (3) by (1), we have . On the other hand, (4) , we have On the other hand, as , then by Definition 1, we have . Hence, (4) holds. Definition 3. Let be an -, . A set is called -closed, if . The set of all -closed sets in is denoted by . is called -order-preserving operator space, (briefly, -). By Definition 3, if is the closure operator, then an -closed set is a -closed set (see [9]). Theorem 4. Let be an -, . Then(1);(2)If , then ;(3)If , then . Proof. (1) As , it is easy to check . Thus, . (2) By Theorem 2, if . We have . Then Hence, (2) holds. (3) If , so Remark 5. The theorem shows that is finite union and infinite intersection preserving. Corollary 6. Let be an -, . If there is , such that . Then consists an -fuzzy co-topology on . Proof. By Theorem 4, we only need to prove . In fact, as there is , such that . Then Hence, . Remark 7. In fact, the smallest fuzzy set is -closed. That is, . Otherwise, , . It means is an -adherent point of . However, for all , . This is a contradiction with the hypothesis that is an -adherent point of . Taking the fact above, we can conclude that given an -fopos , is always an -fuzzy co-topology. Corollary 8. Let be an -. is an -fuzzy co-topology on . Then is a co-topology on . So is an on . Moreover, one has , . Proof. We only prove . By Theorem 2 (1), . Again, by Theorem 2 (4), we have . So . Conversely, if there is , but . Since, there is , such that and . So we have . This is a contradiction, because . Therefore, . Lemma 9. Let be an , be an - induced by . . Then if and only if . Proof. For any . If , then . If , then . Thus, by the definition of lower continuous function, we have if and only if . Theorem 10. Let be an , be an - induced by . , . Then if and only if . Proof. For any , by Lemma 9, we have iff . Let . Then So . Conversely, if , by Lemma 9, we have . And , so Hence, . This implies . Theorem 11. Let be an , is an - induced by . Then iff , . Proof. By Theorem 10, we have Definition 12. Let , be -, -, respectively. An -fuzzy homomorphism is called -continuous, if , then . Theorem 13. Let , be -, -, respectively. is an -fuzzy mapping. Then the following statements are equivalent.(1) is -continuous;(2), ;(3), . Proof. (1)(2) , so , then . Therefore, . On the other hand, by Theorem 2, we get that . And by hypothesis, is -continuous, then, . Hence, . Therefore, we have (2)(3) , so . By (2), we get . So, And obviously, . Thus, (2) holds. (3)(1). . By (3), we have So, . On the other hand, obviously, . Therefore, . This shows that . 4. -Connectedness Definition 14. Let be an -, . are called -separated, if . Otherwise, are called -connected. Clearly, if is the closure operator in , then -connected is -connected [8]. Definition 15. Let be an -, . is called an -connected set, if there not exist -separated sets , such that, , and . Specially, if is -connected, then, is called -connected. Theorem 16. Let be an -, . Then is not -connected if and only if there are , such that, , and , . Proof. Necessity. Let be not -connected. That is, is not -connected. By Definition 15, there are two -separated sets , such that, , and . Since, are -separated, we have Therefore, . Hence, the necessity holds. Sufficiency. Take satisfies the conditions stated in the theorem. So . As , and , we have . Similarly, . Hence, are -separated. By Definition 15, we have is not -connected. Theorem 17. Let is an -, . be -connected, then implies is -connected. Proof. Since is -connected. is connected in . By Theorem 20 in reference [10] (page 54) and Corollary 8, is connected. So is connected. Therefore, is -connected. Theorem 18. Let be an -. , is -connected, and there is , such that for any , and are -connected. Then is -connected. Proof. Since is -connected, is connected in . and are collected for each . Then by Theorem 21 in reference [10] (page 54) and Corollary 8, is connected. Therefore, is -connected. Theorem 19. Let be an , and be the induced -. Then is -connected if and only if is connected. Proof. Necessity. Let be -connected. Suppose that is not connected, then there are nonempty , such that , and . By Theorem 10, , . So This means are -separated sets, and . A contradiction. Sufficiency. Suppose is not -connected. Then There are -separated sets , such that , and . Since , by Theorem 10, we have . Thus, . Therefore, Similarly, we get that . This means is not connected. A Theorem 20. Let be two -s, be -continuous, be -connected. Then is -connected. Proof. Let , . Since . Take we have Besides, by we get Denote , . Then , and Since is -connected, then , or . Take the former, for example, . Thus, Thus, Theorem 21. Let be an -, , for all, . Then is -connected if and only if for all , for all , there are finite molecular , such that . Proof. Necessity. Suppose the result does not holds. That is, there is , . And there is a mapping such that for any finite , does not holds. For the convenient sake, , and are called joined, if there are finite , such that , denoted by . Otherwise, and are called disjoined, denoted by . Let and . Obviously, , so . and , so . Hence, . Since , , or . So . Next, let us prove are not -connected. Suppose that , then there is . By , we have . So there is , such that , and , hence . This means that , and . On the other hand, by , then , so there is , such that . Therefore, . And by , we have . This means and . This is a contradiction with . Therefore . Similarly, we get that . Sufficiency. Suppose is not -connected. Then there are , such that are -separated, and , . Define a mapping Then , we have , . Take . Then for any finite , , or . Thus, , or , . However, since , there is , such that . Therefore, . A contradiction. The work is supported by Youth Science Foundation of Hunan University of Science and Engineering (10XKYTB038). 1. S. L. Chen and C. Q. Dong, “On L-fuzzy order-preserving operator spaces,” Fuzzy systems and Mathematics, vol. 16, pp. 36–41, 2002. 2. S. L. Chen, “$\omega$-countability on L-fuzzy order-Preserving operator spaces,” Fuzzy systems and Mathematics, vol. 3, pp. 11–16, 2004. 3. S. L. Chen, “Moore-Smith convergence theory in L-fuzzy order-preserving operator spaces,” The Journal of Jimei University, vol. 3, pp. 271–277, 2002. 4. C. X. Hang, “$\omega$-separation axioms on L-fuzzy order-preserving operator spaces,” The Journal of Mathematics, vol. 4, pp. 383–388, 2005. 5. C. X. Hang, “Pre-Lindelof properties in L-fuzzy order-preserving operator spaces,” Fuzzy systems and Mathematics, vol. 3, pp. 34–38, 2004. 6. D. S. Zhao, “The N-compactness in L-fuzzy topological spaces,” Journal of Mathematical Analysis and Applications, vol. 128, no. 1, pp. 64–79, 1987. 7. S. B. Sun and G. W. Meng, “${D}_{\alpha }$-connectedness in L-fuzzy topological spaces,” Fuzzy system and Mathematics, vol. 22, pp. 82–86, 2008. 8. B. M. Pu and Y. M. Liu, “Fuzzy topological, Neighborhood structure of a fuzzy point and Moore-Smith convergence,” Journal of Mathematical Analysis and Applications, vol. 76, pp. 571–599, 1980. 9. G. W. Meng and H. Meng, “${D}_{\alpha }$-closed sets and their applications,” Journal of Mathematical Analysis and Applications, vol. 1, pp. 24–27, 2003. 10. J. L. Kelly, General Topology, Springer, 1955.	{"url":"http://www.hindawi.com/journals/afs/2012/925948/","timestamp":"2014-04-17T07:14:34Z","content_type":null,"content_length":"727299","record_id":"<urn:uuid:759c807b-7fa6-4494-be81-309ac6139532>","cc-path":"CC-MAIN-2014-15/segments/1397609526311.33/warc/CC-MAIN-20140416005206-00122-ip-10-147-4-33.ec2.internal.warc.gz"}
quick circle plotting help needed ... [Archive] - OpenGL Discussion and Help Forums Hi All, I need an openGL routine that plots a circle or circles and later on at different locations using Salford FTN95 fortran compiler. The data available would be x and y coordinates of the centre and the radius. I really would like to see if this would work satisfactorily for me as a first step before I get the books out on openGL and spend ages. This may appear completely trivial to some of you but I would appreciate a piece of fortran code that plots these circles in a kind of animated fashion. Thanks in advance,	{"url":"http://www.opengl.org/discussion_boards/archive/index.php/t-123248.html","timestamp":"2014-04-17T01:21:39Z","content_type":null,"content_length":"4839","record_id":"<urn:uuid:c3f0eb7f-b72a-4edc-ba10-83c22fd1dceb>","cc-path":"CC-MAIN-2014-15/segments/1397609526102.3/warc/CC-MAIN-20140416005206-00103-ip-10-147-4-33.ec2.internal.warc.gz"}
Number of results: 369 AP Physics Momentum One of those Civil War cannons is fired. The Cannon has a mass of 873kg It fires a 35.0kg cannon ball at a velocity of 145 m/s at an elevation angle of 35.0 degrees. The length of the barrel is 2.10m. (a) What is the recoil velocity of the cannon?(b)What is the KE of ... Tuesday, January 8, 2013 at 3:10am by Daisy A spring cannon is fastened to a glider at rest on a horizontal frictionless air track. The combined mass of the cannon and the glider is 0.560kg. The cannon fires a ball with a mass of 50g horizontally at a speed of 14 m/s. How fast does the cannon-glider assembly move ... Wednesday, March 12, 2014 at 12:55am by Anonymous A cannon of mass 200kg, fires a cannonball with a mass of 10kg. The cannon ball leaves the barrel of the cannon with a velocity of 60 m/s. Using the law of conservation of momentum , explain what happens to the cannon when the cannon ball is fired. (Answer should include ... Tuesday, March 22, 2011 at 6:57pm by Nelly A 500 kg cannon rests on wheels that are free to roll. The cannon fires a 2 kg cannon ball horizontally with an average force of 400 N. What is the acceleration of the cannon ball? What is the recoil acceleration of the cannon Friday, November 9, 2012 at 1:42pm by Mark A cannon is mounted on a truck that moves forward at a speed of 5 m/s. The operator wants to launch a ball from a cannon so the ball goes as far as possible before hitting the level surface. The muzzle velocity of the cannon is 50 m/s. What angle from the horizontal should the... Sunday, February 17, 2013 at 4:11pm by Brian AP Physics 22. a)You are a pirate working for Dread Pirate Roberts. You are in charge of a cannon that exerts a force 20000 N on a cannon ball while the ball is in the barrel of the cannon. The length of the cannon barrel is 2.19 m and the cannon is aimed at a 32 angle from the ground. ... Saturday, February 26, 2011 at 9:49pm by jeff physic--help --- one of the main battery of cannons protecting the entrance to San Francisco Bay were able t horizontally propel 7.3 kg cannon balls with an average speed of 26.2m/s. if the height of the cannon emplacement were 112m above San Francisco Bay, a. how far from the cannon's muzzle... Tuesday, November 12, 2013 at 2:02am by Tram Part 1 You are a pirate working for Dread Pirate Roberts. You are in charge of a cannon that exerts a force 10000 N on a cannon ball while the ball is in the barrel of the cannon. The length of the cannon barrel is 2.47 m and the cannon is aimed at a 42degrees angle from the ... Sunday, February 27, 2011 at 3:48pm by Dave Part 1 You are a pirate working for Dread Pirate Roberts. You are in charge of a cannon that exerts a force 10000 N on a cannon ball while the ball is in the barrel of the cannon. The length of the cannon barrel is 2.47 m and the cannon is aimed at a 42degrees angle from the ... Sunday, February 27, 2011 at 4:27pm by Mike Part 2 You are a pirate working for Dread Pirate Roberts. You are in charge of a cannon that exerts a force 20000 N on a cannon ball while the ball is in the barrel of the cannon. The length of the cannon barrel is 2.19 m and the cannon is aimed at a 32◦ angle from the ... Friday, February 25, 2011 at 8:03pm by ally i was wondering if i did this right A cannon ball is shot from a cannon on top of a hill that is 73.5 meters above sea level. The cannon ball leaves the cannon with a velocity of 9.8 m/s. Write and solve a quadratic equation to determine when the cannon ball will reach sea ... Monday, August 22, 2011 at 5:14pm by sarah A cannon is mounted on a truck that moves forward at a speed of 5 m/s. The operator wants to launch a ball from a cannon so the ball goes as far as possible before hitting the level surface. The muzzle velocity of the cannon is 50 m/s. What angle from the horizontal should the... Wednesday, February 13, 2013 at 11:42pm by Brian Suppose a fixed cannon is to fire a projectile at an enemy tank, which is moving toward the cannon at a speed of 15 mph. If the cannon is to fire at the moment the tank is 3 miles from the cannon and the muzzle speed of the cannon is 1100 mph, what is the correct equation to ... Tuesday, April 6, 2010 at 4:04pm by Drew vector geometry Suppose a fixed cannon is to fire a projectile at an enemy tank, which is moving toward the cannon at a speed of 15 mph. If the cannon is to fire at the moment the tank is 3 miles from the cannon and the muzzle speed of the cannon is 1100 mph, what is the correct equation to ... Tuesday, April 6, 2010 at 4:40pm by Drew Fundamental Problem 15.12 The cannon and support without a projectile have a mass of 250 kg. If a 20 kg projectile is fired from the cannon with a velocity of 400 m/s , measured relative to the cannon, determine the speed of the projectile as it leaves the barrel of the cannon... Wednesday, September 21, 2011 at 1:21am by Kate A cannon is mounted on a railroad car. The cannon shoots a 1.75 kg ball with a muzzle velocity if 300 m/s. The cannon and the railroad car together have a mass of 4500 kg. if the ball, cannon, and railroad car are initially at rest, what is the recoil velocity of the car and ... Monday, September 30, 2013 at 11:17pm by Cori When a cannon fires a cannonball, the cannon will recoil backward because the a) energy of the cannonball and the cannon is conserved b) momentum of the cannonball and cannon is conserved c)energy of the cannon is greater than the energy of the cannonball d) momentum of the ... Wednesday, October 24, 2007 at 3:16pm by Tammy A railway flat car is rushing along a level frictionless track at a speed of 45m/s. Mounted on the car and aimed forward is a cannon that fires 65 kg cannon balls with a muzzle speed of 625m/s. The total mass of the car, the cannon, and the large supply of cannon balls on the ... Monday, October 10, 2011 at 6:30pm by Alejandro A 350 kg cannon shoots a 10 kg cannon ball at a speed of 420 m/s. Find the recoil velocity of the cannon. Thursday, May 2, 2013 at 4:55pm by Zar A cannon fires a shell at an angle of 55.0° above the horizontal. The shell has a mass of 17.5 kg, and its initial speed as it leaves the cannon is 289 m/s. The cannon is not anchored to the ground. It is mounted on a base—a large block of wood—which is sitting on a level ... Monday, November 1, 2010 at 4:03am by becca A cannon at ground level launches a cannon ball at an angle of 30 degrees with a velocity of 28.3m/s. How far will the cannon ball travel? Wednesday, March 7, 2012 at 3:36pm by Brent Two identical cannons fire cannonballs horizontally with the same initial velocity. One cannon is located on a platform partway up a tower, and the other is on top, four times higher than the first cannon. How much farther from the tower does the cannonball from the higher ... Friday, June 15, 2012 at 7:48pm by daniel Suppose a fixed cannon is to fire a projectile at an enemy tank, which is moving toward the cannon at a speed of 15 mph. If the cannon is to fire at the moment the tank is 3 miles from the cannon and the muzzle speed of the cannon is 1100 mph, what is the correct equation to ... Tuesday, April 6, 2010 at 10:09pm by drew algebra 2 A cannonball is launched from a cannon on a wall. If the path is traced on piece of paper so that the cannon is situated on the y axis, the equation of the path is y= -1/600x^2 + 1/2x + 20. How high above the ground is the cannon. Monday, March 22, 2010 at 12:32pm by DEE a cannon with mass of 2000kg fires a 10kg shell at an angle of 60 degrees above the horizontal. if the recoil velocity of the cannon across the level ground is 0.5 m/s what is the velocity of the cannon ball. Monday, July 8, 2013 at 4:38pm by larry a cannon fires at a castle. the walls are 9m high. if the cannon is pointed at an angle of 60 degrees and has a muzzle velocity of 35m/s will the cannon balls go over the wall or hit the wall? Monday, October 18, 2010 at 12:02am by Natalie A cannon ball is fired from ground level with a speed of 86.0 m/s at an angle of 32 deg. above the horizontal. A 8.5 m tall wall is located 265 m away from the cannon. By how much does the cannon ball clear the wall? In the previous problem, what is the speed of the cannon ... Sunday, March 2, 2014 at 2:57pm by Yarielis A revolutionary cannon, with a mass of 2000kg, fires a 20kg ball horizontally. The cannonball has a speed of 140m/s after it has left the barrel. The cannon carriage is on a flat platform and is free to roll horizontally. What is the speed of the cannon immediately after it ... Monday, September 18, 2006 at 8:17pm by puff puff A 500-kg cannon and a supply of 80 cannon balls, each with a mass of 45.0 kg, are inside a sealed railroad car with a mass of 11000 kg and a length of 49 m. The cannon fires to the right; the car recoils to the left. The cannon balls remain in the car after hitting the wall. ... Saturday, March 3, 2012 at 12:03pm by Katie 11th grade-physics a cannon with a mass of 1,500kg fired a 7kg cannonball along its 3m long barrel in 0.015 seconds a)calculate the acceleration of the cannonball b)the force acting on the cannonball c) the reaction force exerted on the cannon d)the acceleration of the cannon e) the distance the... Sunday, March 28, 2010 at 2:43pm by Bill Williams If the vertical initial speed of the ball is 4.0m/s as the cannon moves horizontally at a speed of 0.70m/s , how far from the launch point does the ball fall back into the cannon? What would happen if the cannon were accelerating? Sunday, February 9, 2014 at 2:06pm by beti f the vertical initial speed of the ball is 4.0m/s as the cannon moves horizontally at a speed of 0.70m/s , how far from the launch point does the ball fall back into the cannon? What would happen if the cannon were accelerating? Sunday, February 9, 2014 at 8:44pm by beti A cannon with a muzzle speed of 1008 m/s is used to start an avalanche on a mountain slope. The target is 1900 m from the cannon horizontally and 802 m above the cannon. At what angle, above the horizontal, should the cannon be fired? (Ignore air resistance.) Someone help ... Monday, October 10, 2011 at 11:24pm by tibby During a circus performance, a 75-kg human cannonball is shot out of an 19-m-long cannon. If the human cannonball spends 0.94 s in the cannon, determine the average net force exerted on him in the barrel of the cannon Wednesday, September 29, 2010 at 6:18pm by Xavier During a circus performance, a 75-kg human cannonball is shot out of an 19-m-long cannon. If the human cannonball spends 0.94 s in the cannon, determine the average net force exerted on him in the barrel of the cannon Sunday, October 3, 2010 at 4:09pm by Jibri During a circus performance, a 73.1-kg human cannonball is shot out of a 19.5-m-long cannon. If the human cannonball spends 0.921 s in the cannon, determine the average net force exerted on him in the barrel of the cannon. Wednesday, February 2, 2011 at 8:08pm by Tiffany During a circus performance, a 67.2-kg human cannonball is shot out of a 17.1-m-long cannon. If the human cannonball spends 0.772 s in the cannon, determine the average net force exerted on him in the barrel of the cannon. Wednesday, February 23, 2011 at 6:28pm by heather During a circus performance, a 74.8-kg human cannonball is shot out of a 18.0-m-long cannon. If the human cannonball spends 0.844 s in the cannon, determine the average net force exerted on him in the barrel of the cannon. Wednesday, February 1, 2012 at 10:57pm by Erin During a circus performance, a 64-kg human cannonball is shot out of an 17-m-long cannon. If the human cannonball spends 0.99 s in the cannon, determine the average net force exerted on him in the barrel of the cannon. Wednesday, October 3, 2012 at 12:36pm by Anonymous During a circus performance, a 64-kg human cannonball is shot out of an 17-m-long cannon. If the human cannonball spends 0.99 s in the cannon, determine the average net force exerted on him in the barrel of the cannon. Wednesday, October 3, 2012 at 10:45pm by Donald During a circus performance, a 77-kg human cannonball is shot out of an 20-m-long cannon. If the human cannonball spends 0.91 s in the cannon, determine the average net force exerted on him in the barrel of the cannon. Friday, February 22, 2013 at 8:25pm by Ronnica a 1.5kg cannon is mounted on top of a 2.0kg cart and loaded with a 52.7 gram ball. The cannon, car, and ball are moving forward with a speed of 1.27m/s. The cannon is ignited and launches a 52.7 gram ball forward with a speed of 75m/s. Determine the post-explosion velocity of ... Sunday, April 29, 2012 at 10:35pm by Sarah a 1.5kg cannon is mounted on top of a 2.0kg cart and loaded with a 52.7 gram ball. The cannon, car, and ball are moving forward with a speed of 1.27m/s. The cannon is ignited and launches a 52.7 gram ball forward with a speed of 75m/s. Determine the post-explosion velocity of ... Monday, April 30, 2012 at 1:34pm by Sarah Assume you are a medieval knight attacking a castle with a canon. The ball leaves the cannon with a speed of 34.9 m/s. The barrel's angle with respect to the ground is 39.5 deg, and you make a perfect hit on the tyrant's chamber which is at the same level as the cannon's ... Thursday, November 5, 2009 at 5:35pm by Anonymous A 1175-kg cannon shoots a 33-kg shell at an angle of 25° above the horizontal and a speed of 495 m/s. What is the recoil velocity of the cannon? (Take the direction the cannon is firing to be the positive direction. Indicate the direction with the sign of your answer.) Tuesday, October 11, 2011 at 9:50am by mymi PHY - C of M A 1100-kg cannon shoots a 31-kg shell at an angle of 25¡ above the horizontal and a speed of 520 m/s. What is the recoil velocity of the cannon? (Take the direction the cannon is firing to be the positive direction. Indicate the direction with the sign of your answer.) Saturday, June 16, 2012 at 7:45pm by Sarah A daredevil is shot out of a cannon at 45.0° to the horizontal with an initial speed of 28.0 m/s. A net is positioned a horizontal distance of 51.0 m from the cannon. At what height above the cannon should the net be placed in order to catch the daredevil? Thursday, September 30, 2010 at 8:49pm by Caroline HOW DO I DO THIS? A daredevil is shot out of a cannon at 45.0° to the horizontal with an initial speed of 28.0 m/s. A net is positioned a horizontal distance of 51.0 m from the cannon. At what height above the cannon should the net be placed in order to catch the daredevil? Thursday, September 30, 2010 at 8:51pm by Maddy A cannon fires a shell at an angle of 55.0 above the horizontal. The shell has a mass of 17.5kg, and its initial speed as it leaves the cannon is 289m/s. The cannon is not anchored to the ground. It is mounted on a base -a large block of wood- which is sittin go n a level ... Monday, November 2, 2009 at 4:11pm by John A cannon ball is fired at 50 m/s at a 37 degree angle above the horizontal. Calculate the time the cannon ball in the air, calculate how high it rises and calculate how far from the cannon the ball lands? Answers: 6.14 s, 46.2 m, 245.2 m Tuesday, November 13, 2012 at 10:00pm by Victoria A daredevil is shot out of a cannon at 43.0° to the horizontal with an initial speed of 25.0 m/s. A net is positioned a horizontal distance of 50.0 m from the cannon. At what height above the cannon should the net be placed in order to catch the daredevil? please walk me ... Monday, November 8, 2010 at 5:15pm by alecia A cannon ball is fired straight up into the air at a speed of 80 ft/sec from a height of 2 ft. a)when will be the cannon ball be 98 feet in the air. b) when will the cannon ball hit the ground? Thursday, September 29, 2011 at 5:40am by muthu A cannon is rigidly attached to a carriage,which can move along horizontal rails but is connected to a post by a large spring, initially unstretched, of force constant 60000 N/m. The cannon ﬁres a 305 kg projectile at a velocity of 174 m/s directed 38.9◦ above the... Sunday, January 29, 2012 at 10:21pm by amanda and leah A daredevil is shot out of a cannon at 54 degrees to the horizontal with an initial speed of 33.3 m/s. A net is positioned a horizontal distance of 41.8 m from the cannon. At what height above the cannon should the net be placed in order to catch the daredevil? The ... Monday, September 19, 2011 at 11:57pm by Ronald A daredevil is shot out of a cannon at 41.6 ◦ to the horizontal with an initial speed of 28.6 m/s. A net is positioned a horizontal distance of 29 m from the cannon. At what height above the cannon should the net be placed in order to catch the daredevil? The ... Thursday, September 20, 2012 at 9:54pm by asdfghjk A bronze cannon ball with a mass of 4.5 kg is fired vertically from a small cannon and reaches a height of 10.0 m. If the canon is now aimed at an angle 33 degrees above the horizontal, calculate the horizontal distance the cannon ball would travel before it reaches the ground. Saturday, March 8, 2014 at 10:28am by Yarielis how much does gravity affects my cannon shot? Sunday, December 5, 2010 at 7:57pm by cannon ball A cannon on a stationery railway truck fires a shell of mass 5 kg with a velocity of 240 m.s -1. The mass of the cannon is 600kg. The cannon recoils and moves back on the rails and collides with a stationery truck of mass 400 kg. The velocity of the cannon after the collision ... Thursday, February 10, 2011 at 2:18pm by Claudia physical scinsce A cannon that is 10m long is designed to launch a 10kg ball over a castle wall. In order to do this the ball must have a speed of at least 50m/s as it exits the cannon. For every 10kg of explosives used, the force on the ball in the cannon increases by 1000N. How many kg of ... Thursday, September 27, 2012 at 1:22am by Help physical scinsce A cannon that is 10m long is designed to launch a 10kg ball over a castle wall. In order to do this the ball must have a speed of at least 50m/s as it exits the cannon. For every 10kg of explosives used, the force on the ball in the cannon increases by 1000N. How many kg of ... Thursday, May 9, 2013 at 1:26am by Help A cannon on a railroad car is facing in a direction parallel to the tracks. It fires a 99 kg shell at a speed of 105 m/s (relative to the ground) at an angle of 60.0° above the horizontal. If the cannon plus car have a mass of 5.5 104 kg, what is the recoil speed of the car if... Monday, October 22, 2007 at 10:34pm by Dante physical scinsce A cannon that is 10m long is designed to launch a 10kg ball over a castle wall. In order to do this the ball must have a speed of at least 50m/s as it exits the cannon. For every 10kg of explosives used, the force on the ball in the cannon increases by 1000N. How many kg of ... Thursday, September 27, 2012 at 1:22am by Christian physical scinsce A cannon that is 10m long is designed to launch a 10kg ball over a castle wall. In order to do this the ball must have a speed of at least 50m/s as it exits the cannon. For every 10kg of explosives used, the force on the ball in the cannon increases by 1000N. How many kg of ... Thursday, September 27, 2012 at 1:22am by Christian A cannon barrel is elevated at an angle of 45°. It fires a ball with a speed of 350 m/s What is the horizontal range of the cannon? Thursday, August 25, 2011 at 10:00pm by yelya Rhonda Vous, the 445N human cannonball, is shot from her cannon, leaving it at 18.0 m/s. How much work did the cannon do on her? Wednesday, December 7, 2011 at 8:59pm by beth A revolutionary war cannon, with a mass of 2170 kg, fires a 18.1 kg ball horizontally. The cannonball has a speed of 146 m/s after it has left the barrel. The cannon carriage is on a flat platform and is free to roll horizontally. What is the speed of the cannon immedi- ately ... Monday, October 18, 2010 at 11:03pm by Cole A cannon that is 10m long is designed to launch a 10kg ball over a castle wall. In order to do this the ball must have a speed of at least 50m/s as it exits the cannon. For every 10kg of explosives used, the force on the ball in the cannon increases by 1000N. How many kg of ... Thursday, September 27, 2012 at 1:12am by Christian I have a projectile motion question. If let's say a cannon which was placed on a moving cart with negligible friction projects a cannonball straight up in the air where will it fall? Would it be behind the cannon, on the rider or fall straight down back into the cannon? And ... Saturday, September 17, 2011 at 11:51am by Jen A cannon on a railroad car is facing in a direction parallel to the tracks (the figure below ). It fires a 99-kg shell at a speed of 105 m/s (relative to the ground) at an angle of 60 above the horizontal. If the cannon plus car have a mass of 4.6 104 kg, what is the recoil ... Friday, February 25, 2011 at 7:23am by Renee physical science A cannon that is 10m long is designed to launch a 10kg ball over a castle wall. In order to do this the ball must have a speed of at least 50m/s as it exits the cannon. For every 10kg of explosives used, the force on the ball in the cannon increases by 1000N. How many kg of ... Wednesday, June 22, 2011 at 4:48pm by Christian A cannon is mounted on a railway flatcar, the muzzle elevated to 31.4° and pointed in the direction of the track. The cannon fires a 1.10-metric-ton projectile at 1.10 km/s. (a) If the flatcar and cannon together have a mass of 36.0 metric tons (not including the projectile), ... Tuesday, May 3, 2011 at 4:54pm by Dani A 530 cannon fires a 12 cannonball with a speed of 200 relative to the muzzle. The cannon is on wheels that roll without friction. Wednesday, November 30, 2011 at 3:02pm by Anonymous Intro to Physical Science A cannon that is 10m long is designed to launch a 10kg ball over a castle wall. In order to do this the ball must have a speed of at least 50m/s as it exits the cannon. For every 10kg of explosives used, the force on the ball in the cannon increases by 1000N. How many kg of ... Saturday, September 9, 2006 at 3:31pm by Christian Physical Sciene A cannon is fired horizontally from a top of a 15-m platform. What is the cannon balls horizontal speed when it hits the ground 250 m downrange? Tuesday, November 1, 2011 at 10:58am by Diana True or False: If a cannon fires a cannonball in an easterly direction, the tendency of the cannon to move to the west is a result of the principle of conservation of energy. Tuesday, December 13, 2011 at 8:18pm by David Mighty Mouse (who flies at a constant speed of 600mph) was standing by a cannon that was pointed straight up. A cannonball was shot vertically into the air with an initial velocity of 300 mph. Exactly one second after the cannon was fired, Mighty Mouse flew up to touch the ... Wednesday, April 24, 2013 at 12:27pm by bern A projectile of mass 0.777 kg is shot from a cannon, at height 6.6 m, as shown in the ﬁgure, with an initial velocity vi having a horizontal component of 7.8m/s. The projectile rises to a maximum height of ∆y above the end of the cannon’s barrel and strikes the ... Tuesday, October 4, 2011 at 11:19am by steve a spring loaded "cannon" on a wheeled car fires a metal ball vertically. the car is given a push and set in motion horizontally with a constant velocity. A pin is pulled with a string to launch the ball, which travels upward and then falls back into the moving cannon everytime... Tuesday, January 1, 2008 at 8:26pm by melissa Projectile motion A cannon is fired from a cliff top 15m high and at 30 degrees. It takes 3 seconds for canon to reach the earth, what is the initial velocity of the cannon Sunday, October 20, 2013 at 10:17am by Lorna You are standing stationary along the side of the railroad tracks. A toy cannon shoots a baseball at 9 m/s. The cannon is mounted facing forward on the handlebars of a bike. Your friend is riding the bike from the front toward the back of a train car at 5 m/s. The train is ... Tuesday, February 26, 2013 at 8:35pm by aly A human cannonball is launched from a cannon at 26.4 m/s at 20.4 degrees above the horizontal. (Assume he/she lands in a net the same height as the cannon.) How high in the air does he/she go? Thursday, May 16, 2013 at 7:48pm by John Mighty Mouse (who flies at a constant speed of 1400 ft/sec) was standing next to a cannon that was pointed straight up. A cannonball was shot vertically into the air with an initial velocity of 880 ft/sec. Exactly one second after the cannon was fired, Might Mouse flew up to ... Monday, December 10, 2012 at 9:23am by Jeremie A cannon is fired horizontally from a platform (see figure). The platform rests on a flat, icy, frictionless surface. Just after the shell is fired and while it is moving through the barrel of the gun, the shell (mass 3.0 kg) has an acceleration of +2450 m/s2. At the same time... Friday, September 16, 2011 at 10:15pm by angela Physics Honors A cannon fires a cannonball 500 m downrange when sest at a 45° angle. At what velocity does the cannonball leave the cannon? Friday, December 2, 2011 at 12:23am by Jacqueline Suppose you are a general in the Napoleonic wars. You are no top of a plain 50 m high overlooking the enemy soldiers. You now have a brand new cannon that will decimate the enemy. Unfortunately in the christening process you used some rather cheap grade champagne and all the ... Wednesday, February 19, 2014 at 9:27pm by Michelle Suppose you are a general in the Napoleonic wars. You are no top of a plain 50 m high overlooking the enemy soldiers. You now have a brand new cannon that will decimate the enemy. Unfortunately in the christening process you used some rather cheap grade champagne and all the ... Saturday, February 22, 2014 at 4:28pm by Michelle A cannon is placed on a hillside pointing up the hill, where the hill is at an angle a Pi/4 to the horizontal. The cannon points at an angle Pi/6 to the slope. and a shot is red uphill with initial speed v0. (i) Find the maximum value of the distance between the cannon ball ... Saturday, March 2, 2013 at 12:13pm by hayley maths and physics A cannon is placed on a hillside pointing up the hill, where the hill is at an angle a Pi/4 to the horizontal. The cannon points at an angle Pi/6 to the slope. and a shot is red uphill with initial speed v0. (i) Find the maximum value of the distance between the cannon ball ... Sunday, March 3, 2013 at 3:36pm by tom A cannon fires a projectile into the air at an angle of 60degrees above the horizontal. The projectile falls back on the ground at a distance d from the cannon and its maximum height is h. Ratio d/h is equal to: Saturday, May 12, 2012 at 10:36pm by Zess A cannon is rigidly attached to a carriage,which can move along horizontal rails but is connected to a post by a large spring, initially unstretched, of force constant 60000 N/m. The cannon ﬁres a 305 kg projectile at a velocity of 174 m/s directed 38.9◦ above the... Sunday, January 29, 2012 at 9:48pm by amanda and leah A cannon tilted up at a 26.0 degree angle fires a cannon ball at 78.0 m/s from atop a 12.0 m-high fortress wall. What is the ball's impact speed on the ground below? Monday, March 21, 2011 at 10:38pm by duke A cannon ball is shot straight upward with a velocity of 57.50 m/s. How high is the cannon ball above the ground 4.30 seconds after it is fired? (Neglect air resistance.) Tuesday, January 17, 2012 at 6:34pm by Anonymous A cannon tilted up at a 34.0^\circ angle fires a cannon ball at 69.0 m/s from atop a 23.0 m-high fortress wall. What is the ball's impact speed on the ground below? Thursday, March 29, 2012 at 9:53pm by Cody During a training exercise a cannon ball is fired with a muzzle velocity of 84.9 m/s at an angle of 45o above the horizontal. Determine how far from the cannon the ball will land when it hits the Saturday, June 23, 2012 at 8:32pm by Aria A cannon ball is shot straight upward with a velocity of 72.50 m/s. How high is the cannon ball above the ground 2.30 seconds after it is fired? (Neglect air resistance.) Friday, September 14, 2012 at 11:08pm by Anonymous physical science if a cannon ball and a bowling ball were dropped at the same time from the top of a building, the instant before the cannon ball hit the ground it has greater? Wednesday, September 9, 2009 at 10:20pm by Anonymous A 20.0-kg cannon ball is fired from a cannon with a muzzle speed of 1000 m/s at an angle of 37.0° with the horizontal. A second ball is fired at an angle of 90.0°. Use the conservation of energy principle to find (a) the maximum height reached by each ball and For the first ... Thursday, March 15, 2007 at 5:38am by Amal Alzamil a cannon with a mass of 1200 kilograms is positioned at the edge of a cliff where it fires a 100 kilogram cannonball horizontally. The cannonballs initial speed is 35 meters per second. What is the recoil of speed of the cannon. Thursday, April 4, 2013 at 11:15am by lauren If the vertical initial speed of the ball is 4.0m/s as the cannon moves horizontally at a speed of 0.70m/s , how far from the launch point does the ball fall back into the cannon? Friday, February 7, 2014 at 4:24pm by beti physics (please help!) A projectile of mass 0.539 kg is shot from a cannon. The end of the cannon’s barrel is at height 6.4 m, as shown in the figure. The initial velocity of the projectile is 9 m/s . How long does it take the projectile to hit the ground? Answer in units of s Wednesday, September 21, 2011 at 9:42pm by meagan Pages: 1 \| 2 \| 3 \| 4 \| Next>>	{"url":"http://www.jiskha.com/search/index.cgi?query=cannon","timestamp":"2014-04-16T19:17:52Z","content_type":null,"content_length":"42888","record_id":"<urn:uuid:acb2219a-4924-4722-be9d-e4185456b34f>","cc-path":"CC-MAIN-2014-15/segments/1398223207046.13/warc/CC-MAIN-20140423032007-00419-ip-10-147-4-33.ec2.internal.warc.gz"}
Measuring persistence, randomness, and true talent - HockeyAnalysis.com In Rob Vollman’s Hockey Abstract book he talks about the persistence and its importance when it comes to a particular statistics having value in hockey analytics. For something to qualify as the key to winning, two things are required: (1) a close statistical correlation with winning percentage and (2) statistical persistence from one season to another. More generally, persistence is a prerequisite for being able to call something a talent or a skill and how close it correlates with winning or some other positive outcome (such as scoring goals) tells us how much value that skill has. Let’s look at persistence first. The easiest way to measure persistence is to look at the correlation of that statistics over some chunk of time vs some future chunk of time. For example, how well does a stat from last season correlate with the same stat this season (i.e. year over year correlation). For some statistics such as shooting percentages it may even be necessary to go with even larger sample sizes such as 3 year shooting percentage vs future 3 year shooting percentages. One mistake that many people make when doing this is conclude that the lack of correlation and thus lack of persistence means that the statistics is not a repeatable skill and thus, essentially, random. The thing is, the method for how we measure persistence can be a major factor in how well we can measure persistence and how well we can measure true randomness. Let’s take two methods for measuring persistence: 1. Three year vs three year correlation, or more precisely the correlation between 2007-10 and 2010-13. 2. Even vs odd seconds over the course of 6 seasons, or the statistic during every even second vs the statistic during every odd second. Both methods split the data roughly in half so we are doing a half the data vs half the data comparison and I am going to do this for offensive statistics for forwards with at least 1000 minutes of 5v5 ice time in each half. I am using 6 years of data so we get large sample sizes for shooting percentage calculations. Here are the correlations we get. Comparison 0710 vs 1013 Even vs Odd Difference GF20 vs GF20 0.61 0.89 0.28 FF20 vs FF20 0.62 0.97 0.35 FSh% vs FSh% 0.51 0.73 0.22 GF20 is Goals for per 20 minutes of ice time. FF20 is fenwick for (shots + missed shots) per 20 minutes of ice time. FSh% is Fenwick Shooting Percentage or goals/fenwick. We can see that the level of persistence we identify is much greater when looking at even vs odd minute correlation than when looking at 3 year vs 3 year correlation. A different test of persistence gives us significantly different results. The reason for this is that there are a lot of other factors that come into play when looking at 3 year vs 3 year correlations than even vs odd correlations. In the even vs odd correlations factors such as quality of team mates, quality of competition, zone starts, coaching tactics, etc. are non-factors because they should be almost exactly the same in the even minutes as the odd minutes. This is not true for the 3 year vs 3 year correlation. The difference between the two methods is roughly the amount of the correlation that can be attributed to those other factors. True randomness, and thus true lack of persistence, is essentially the difference between 1.00 and the even vs odd correlation. This equates to 0.11 for GF20, 0.03 for FF20 and 0.27 for FSh%. Now, lets look at how well they correlate with a positive outcome, scoring goals. But instead of just looking at that lets combine it with persistence by looking at how well predict ‘other half’ goal Comparison 0710 vs 1013 Even vs Odd Difference FF20 vs GF20 0.54 0.86 0.33 GF20 vs FF20 0.44 0.86 0.42 FSh% vs GF20 0.48 0.76 0.28 GF20 vs FSh% 0.57 0.77 0.20 As you can see, both FF20 and FSh% are very highly correlated with GF20 but this is far more evident when looking at even vs odd than when looking at 3 year vs 3 year correlations. FF20 is more predictive of ‘other half’ GF20 but not significantly so but this is likely solely due to the greater randomness of FSh% (due to sample size constraints) since FSh% is more correlated with GF20 than FF20 is. The correlation between even FF20 and even GF20 is 0.75 while the correlation between even FSh% and even GF20 is 0.90. What is also interesting to note is that even vs odd provides greater benefit for identifying FF20 value and persistence than for FSh%. What this tells us is that the skills related to FF20 are not as persistent over time as the skills related to FSh%. I have seen this before. I think what this means is that GMs are valuing shooting percentage players more than fenwick players and thus are more likely to maintain a core of shooting percentage players on their team while letting fenwick players walk. Eric T. found that teams reward players for high shooting percentage more than high corsi so this is likely the reason we are seeing this. Now, let’s take a look at how well FF20 correlates with FSh%. Comparison 0710 vs 1013 Even vs Odd Difference FF20 vs FSh% 0.38 0.66 0.28 FSh% vs FF20 0.22 0.63 0.42 It is interesting to note that fenwick rates are highly correlated with shooting percentages especially when looking at the even vs odd data. What this tells us is that the skills that a player needs to generate a lot of scoring chances are a similar set of skills required to generate high quality scoring chances. Skills like good passing, puck control, quickness can lead to better puck possession and thus more shots but those same skills can also result in scoring at a higher rate on those chances. We know that this isn’t true for all players (see Scott Gomez) but generally speaking players that are good at controlling the puck are good at putting the puck in the net too. Finally, let’s look at one more set of correlations. When looking at the the above correlations for players with >1000 minutes in each ‘half’ of the data there are a lot of players that have significantly more than 1000 minutes and thus their ‘stats’ are more reliable. In any given year a top line forward will get 1000+ minutes of 5v5 ice time (there were 125 such players in 2011-12) but generally less than 1300 minutes (only 5 players had more than 1300 minutes in 2010-11). So, I took all the players that had more than 1000 even and odd minutes over the course of the past 6 seasons but only those that had fewer than 2600 minutes in total. In essense, I took all the players that have between 1000 and 1300 even and odd minutes over the past 6 seasons. From this group of forwards I calculated the same correlations as above and the results should tell us approximately how reliable (predictive) one seasons worth of data is for a front line forward assuming they played in exactly the same situation the following season. Comparison Even vs odd GF20 vs GF20 0.82 FF20 vs FF20 0.93 FSh% vs FSh% 0.63 FF20 vs GF20 0.74 GF20 vs FF20 0.77 FSh% vs GF20 0.65 GF20 vs FSh% 0.66 FF20 vs FSh% 0.45 FSh% vs FF20 0.40 It should be noted that because of the way in which I selected the players (limited ice time over past 6 seasons) to be included in this calculation there is an abundance of 3rd liners with a few players that reached retirement (i.e. Sundin) and young players (i.e. Henrique, Landenskog) mixed in. It would have been better to take the first 2600 minutes of each player and do even/odd on that but I am too lazy to try and calculate that data so the above is the best we have. There is far less diversity in the list of players used than the NHL in general so it is likely that for any particular player with between 1000 and 1300 minutes of ice time the correlations are stronger. So, what does the above tell us? Once you factor out year over year changes in QoT, QoC, zone starts, coaching tactics, etc. GF20, FF20 and FSh% are all pretty highly persistent with just one years worth of data for a top line player. I think this is far more persistent, especially for FSh%, than most assume. The challenge is being able to isolate and properly account for changes in QoT, QoC, zone starts, coaching tactics, etc. This, in my opinion, is where the greatest challenge in hockey analytics lies. We need better methods for isolating individual contribution, adjusting for QoT, QoC, usage, etc. Whether that comes from better statistics or better analytical techniques or some combination of the two only time will tell but in theory at least there should be a lot more reliable information within a single years worth of data than we are currently able to make use of. 2 Responses to “Measuring persistence, randomness, and true talent” 1. Yeah you can’t just look at Corsi For and Against rates (even if you look at them in the context of the rates of their team mates when playing without them and their competition when playing against others). You have to look at advanced statistics in a holistic way. I hate how opponents of advanced stats cherry pick Corsi rates and then say “see? I told you advanced stats are a joke. Games are won on the ice, not on Excel spreadsheets. This ain’t moneyball! Watch teh gamez!!” It doesn’t help though when Corsi proponents tell us that shot quality doesn’t matter and that Scott Gomez is just having bad luck while Sidney Crosby is lucky. That’s what makes us look like a joke to people. I can’t count how many times I’ve been derided by Leafs fans for pulling up advanced stats to make a case for or against a player. Especially whenever I talk about Nazem Kadri’s unsustainable on-ice sh% and PDO last season (higher than Sidney Crosby’s career level and Martin St. Louis’ level in the last 3 seasons). I get branded a moneyball Corsi kook. For a player of his tenure, Scott Gomez probably has among the worst finishing ability in the NHL. But as a playmaker, he is very, very underrated. Look at his IAP rate. He has seen some regression in his IAP rate in 2012-13 for the Sharks. But his IGP and IPP were both higher last season. Probably because he played with 3rd/4th liners for the Sharks, who like him, also lack finishing ability. So he was forced to shoot at the net more this time. Scott Gomez ranks 43rd/301 NHL forwards (1500+ 5v5 mins) in IAP but dead last in IGP among that sample. When you harmonize the goals and assists and look at IPP, he’s 285th/301. Considering that most NHL teams dress 2 scoring lines, maybe 3, I’m pretty sure the Sharks didn’t sign him for his offensive flair. They signed Gomez because he’s great at bringing the puck north and generating shots, he’s a top 15 percentile playmaker (43rd/301) and while he’s below-average defensively, he’s not Tyler Bozak (so good enough defensively for a 3rd line role). And now he’s with the Florida Panthers for 900k/1yr. They’re probably going to use Scott Gomez in a similar capacity. He’s paid low enough that they could bury him in the minors at no cap hit if he doesn’t perform. But Scott Gomez still has something to offer as an NHL regular in a 3rd scoring/checking line or 4th energy line role. He’s just probably not Top 6 quality anymore. His Corsi For stats are great. But probably not good enough to justify his anemic 58.2% IPP. Scott Gomez needs to play with 1 solid finisher and 1 well-rounded offense guy (goalscorer/playmaker) to justify a 2nd scoring line role. In hockey, assists are important too. But not being able to score goals is such a liability that you would have a hard time making a top 6 role in the NHL. Guys who are typically heralded as the best pure playmakers in the NHL typically shoot at a higher percentage than Scott Gomez and if their percentage is good or better, they get criticized for not shooting enough (ie. Alex Tanguay has a very high shooting %. But he doesn’t take many shots. Small sample size). Scott Gomez 2010-13(3yr) forwards 1500+ 5v5 mins (301) IAP: 43/301 (47.3%) IGP: 301/301 (10.9%) IPP: 285/301 (58.2%) Sh%: 301/301 (3.11%) Scott Gomez Sample Size: 2012-13 forwards 400+ 5v5 mins (277) IAP: 90/277 (45.5%) IGP: 237/277 (18.2%) Sh%: 246/277 (5%) Sidney Crosby 2010-13(3yr) forwards 1250+ 5v5 mins (327) IAP: 10/327 (52.5%) IGP: 110/327 (31.4%) IPP: 3/327 (83.9%) Sh%: 8/327 (15.81%) 2. On the Scott Gomez tip, his on-ice Corsi Sh% (not to be confused with straight up shooting %) would bump up to 3.77% instead of 2.64% if he played with team mates who were NHL league average goal scorers (4.19 CSh%). It’s easy to blame Scott Gomez for the lack of production on his lines because he has a low shooting percentage. But he only takes 16.88% of the team’s shots while he’s on the ice anyway. Scott Gomez is a passer and if his line mates can’t get the job done with scoring, his assist production is going to suffer. At 3.77% on-ice CSh%, Scott Gomez’s Goal For rate would be above the NHL average. Scott Gomez would be productive on a 2nd scoring line with two average goal scorers. If you put him in with a clinical goal scorer and a well-rounded offensive winger, he’d be even more productive. Scott Gomez will never be Sidney Crosby good. But he’s very underrated. Goals For with or without yous don’t work sometimes tells the story. But in Scott Gomez’s case, it does not. Just because Scott Gomez’s team mates do better without him doesn’t mean that Scott Gomez is a drag necessarily. If you put Scott Gomez in with guys who can’t score, then that’s just bad pairing and line chemistry. Scott Gomez’s team mates do better without Gomez because they have low iCorsi sh% themselves and need to play with a goal scorer to be productive. To evaluate Scott Gomez I made use of Corsi, on-ice sh%, individual stats and production rates to provide a holistic picture. I know that the average Joe shmoe hockey fan will write off my analysis. But I am 100% positive that Scott Gomez, if he’s not playing with guys who can’t score, would be a suitable 2nd scoring line forward on a number of NHL teams. If Scott Gomez was flanked by Phil Kessel and James van Riemsdyk/Joffrey Lupul, he would score more points than Tyler Bozak. At <20% of the cap hit. Scott Gomez By the Numbers 2010-13 (3yrs) Data 5v5 TOI (mins) 1967.616667 iCSh% 1.71% Individual Goals 6 Individual Assists 26 First Assists 17 iCorsi 351 Individual Share of On-ice Corsi events 16.88% G/60 0.183 A/60 0.793 P/60 0.976 FirstA/60 0.518 CF20 21.142 Total On-ice Corsi 2080 GF20 0.559 On-Ice GF 55 On-Ice CSh% 2.64% Teammate Goals 49 Teammate Corsi 1729 Teammates’ iCSh% 2.83% NHL Average CSh% 4.19% Goals scored by Scott’s team mates if they were average goal scorers 72.48670476 Total on-ice Goals For if Scott Gomez had average goal scoring team mates 78.48670476 On-Ice CSh% if Scott Gomez had average goal scoring team mates 3.77% GF20 Rate if Scott Gomez had average goal scoring team mates 0.798 NHL Average GF20 0.760 Assist Rate on Team Mate Goals 53.1% First Assist Rate on Team Mate Goals 34.69% Assists Recorded if Team Mates were Average Goal Scorers 38.46233314 First Assists Recorded if Team Mates were Average Goal Scorers 25.14844859 A/60 Rate if Team Mates were Average Goal Scorers 1.173 FirstA/60 Rate if Team Mates were Average Goal Scorers 0.767 P/60 Rate if Team Mates were Average Goal Scorers 1.356 Tyler Bozak with 1337 Goal Scorer Team Mates 1.34 Sorry, the comment form is closed at this time.	{"url":"http://hockeyanalysis.com/2013/08/02/measuring-persistence-randomness-and-true-talent/","timestamp":"2014-04-17T15:27:14Z","content_type":null,"content_length":"55527","record_id":"<urn:uuid:cffd0822-84ed-46ee-97fc-807651f5747a>","cc-path":"CC-MAIN-2014-15/segments/1397609530136.5/warc/CC-MAIN-20140416005210-00156-ip-10-147-4-33.ec2.internal.warc.gz"}
Simulated annealing is a generic probabilistic In computer science, metaheuristic designates a computational method that optimizes a problem by iteratively trying to improve a candidate solution with regard to a given measure of quality. Metaheuristics make few or no assumptions about the problem being optimized and can search very large spaces... for the global optimization Global optimization is a branch of applied mathematics and numerical analysis that deals with the optimization of a function or a set of functions to some criteria.- General :The most common form is the minimization of one real-valued function... problem of locating a good approximation to the global optimum In mathematics, a global optimum is a selection from a given domain which yields either the highest value or lowest value , when a specific function is applied. For example, for the function... of a given In mathematics, a function associates one quantity, the argument of the function, also known as the input, with another quantity, the value of the function, also known as the output. A function assigns exactly one output to each input. The argument and the value may be real numbers, but they can... in a large search space Search space may refer to one of the following.In optimization, the domain of the function to be optimizedIn search algorithms of computer science, the set of all possible solutions... . It is often used when the search space is discrete (e.g., all tours that visit a given set of cities). For certain problems, simulated annealing may be more efficient than exhaustive enumeration — provided that the goal is merely to find an acceptably good solution in a fixed amount of time, rather than the best possible solution. The name and inspiration come from Annealing, in metallurgy and materials science, is a heat treatment wherein a material is altered, causing changes in its properties such as strength and hardness. It is a process that produces conditions by heating to above the recrystallization temperature, maintaining a suitable temperature, and... Metallurgy is a domain of materials science that studies the physical and chemical behavior of metallic elements, their intermetallic compounds, and their mixtures, which are called alloys. It is also the technology of metals: the way in which science is applied to their practical use... , a technique involving heating and controlled cooling of a material to increase the size of its A crystal or crystalline solid is a solid material whose constituent atoms, molecules, or ions are arranged in an orderly repeating pattern extending in all three spatial dimensions. The scientific study of crystals and crystal formation is known as crystallography... s and reduce their Crystalline solids exhibit a periodic crystal structure. The positions of atoms or molecules occur on repeating fixed distances, determined by the unit cell parameters. However, the arrangement of atom or molecules in most crystalline materials is not perfect... . The heat causes the The atom is a basic unit of matter that consists of a dense central nucleus surrounded by a cloud of negatively charged electrons. The atomic nucleus contains a mix of positively charged protons and electrically neutral neutrons... s to become unstuck from their initial positions (a local minimum of the internal energy In thermodynamics, the internal energy is the total energy contained by a thermodynamic system. It is the energy needed to create the system, but excludes the energy to displace the system's surroundings, any energy associated with a move as a whole, or due to external force fields. Internal... ) and wander randomly through states of higher energy; the slow cooling gives them more chances of finding configurations with lower internal energy than the initial one. By analogy with this physical process, each step of the SA algorithm attempts to replace the current solution by a random solution (chosen according to a candidate distribution , often constructed to sample from solutions near the current solution). The new solution may then be accepted with a probability that depends both on the difference between the corresponding function values and also on a global parameter (called the ), that is gradually decreased during the process. The dependency is such that the choice between the previous and current solution is almost random when is large, but increasingly selects the better or "downhill" solution (for a minimization problem) as goes to zero. The allowance for "uphill" moves potentially saves the method from becoming stuck at local optima Local optimum is a term in applied mathematics and computer science.A local optimum of a combinatorial optimization problem is a solution that is optimal within a neighboring set of solutions... —which are the bane of A greedy algorithm is any algorithm that follows the problem solving heuristic of making the locally optimal choice at each stagewith the hope of finding the global optimum.... The method was independently described by Scott Kirkpatrick, C. Daniel Gelatt and Mario P. Vecchi in 1983, and by Vlado Černý in 1985. The method is an adaptation of the Metropolis-Hastings algorithm In mathematics and physics, the Metropolis–Hastings algorithm is a Markov chain Monte Carlo method for obtaining a sequence of random samples from a probability distribution for which direct sampling is difficult... , a Monte Carlo method Monte Carlo methods are a class of computational algorithms that rely on repeated random sampling to compute their results. Monte Carlo methods are often used in computer simulations of physical and mathematical systems... to generate sample states of a thermodynamic system, invented by M.N. Rosenbluth Marshall Nicholas Rosenbluth was an American plasma physicist and member of the National Academy of Sciences. In 1997 he was awarded the National Medal of Science for discoveries in controlled thermonuclear fusion, contributions to plasma physics and work in computational statistical mechanics. ... in a paper by N. Metropolis Nicholas Constantine Metropolis was a Greek American physicist.-Work:Metropolis received his B.Sc. and Ph.D. degrees in physics at the University of Chicago... et al. in 1953. In the simulated annealing (SA) method, each point of the search space is analogous to a A thermodynamic state is a set of values of properties of a thermodynamic system that must be specified to reproduce the system. The individual parameters are known as state variables, state parameters or thermodynamic variables. Once a sufficient set of thermodynamic variables have been... of some physical system In physics, the word system has a technical meaning, namely, it is the portion of the physical universe chosen for analysis. Everything outside the system is known as the environment, which in analysis is ignored except for its effects on the system. The cut between system and the world is a free... , and the function ) to be minimized is analogous to the internal energy In thermodynamics, the internal energy is the total energy contained by a thermodynamic system. It is the energy needed to create the system, but excludes the energy to displace the system's surroundings, any energy associated with a move as a whole, or due to external force fields. Internal... of the system in that state. The goal is to bring the system, from an arbitrary initial state , to a state with the minimum possible energy. The basic iteration At each step, the SA heuristic considers some neighbouring state of the current state , and probabilistically decides between moving the system to state or staying in state . These probabilities ultimately lead the system to move to states of lower energy. Typically this step is repeated until the system reaches a state that is good enough for the application, or until a given computation budget has been exhausted. The neighbours of a state The neighbours of a state are new states of the problem that are produced after altering the given state in some particular way. For example, in the traveling salesman problem, each state is typically defined as a particular In mathematics, the notion of permutation is used with several slightly different meanings, all related to the act of permuting objects or values. Informally, a permutation of a set of objects is an arrangement of those objects into a particular order... of the cities to be visited. The neighbours of some particular permutation are the permutations that are produced for example by interchanging a pair of adjacent cities. The action taken to alter the solution in order to find neighbouring solutions is called "move" and different "moves" give different neighbours. These moves usually result in minimal alterations of the solution, as the previous example depicts, in order to help an algorithm to optimize the solution to the maximum extent and also to retain the already optimum parts of the solution and affect only the suboptimum parts. In the previous example, the parts of the solution are the parts of the tour. Searching for neighbours to a state is fundamental to optimization because the final solution will come after a tour of successive neighbours. Simple Heuristic refers to experience-based techniques for problem solving, learning, and discovery. Heuristic methods are used to speed up the process of finding a satisfactory solution, where an exhaustive search is impractical... s move by finding best neighbour after best neighbour and stop when they have reached a solution which has no neighbours that are better solutions. The problem with this approach is that a solution that does not have any immediate neighbours that are better solutions is not necessarily the optimum. It would be the optimum if it was shown that kind of alteration of the solution does not give a better solution and not just a particular kind of alteration. For this reason it is said that simple Heuristic refers to experience-based techniques for problem solving, learning, and discovery. Heuristic methods are used to speed up the process of finding a satisfactory solution, where an exhaustive search is impractical... s can only reach local optima Local optimum is a term in applied mathematics and computer science.A local optimum of a combinatorial optimization problem is a solution that is optimal within a neighboring set of solutions... and not the global optimum In mathematics, a global optimum is a selection from a given domain which yields either the highest value or lowest value , when a specific function is applied. For example, for the function... . Metaheuristics, although they also optimize through the neighbourhood approach, differ from heuristics in that they can move through neighbours that are worse solutions than the current solution. Simulated Annealing in particular doesn't even try to find the best neighbour. The reason for this is that the search can no longer stop in a local optimum and in theory, if the metaheuristic can run for an infinite amount of time, the global optimum will be found. Acceptance probabilities The probability of making the transition from the current state acceptance probability function temperature States with a smaller energy are better than those with a greater energy. The probability function greedy algorithm A greedy algorithm is any algorithm that follows the problem solving heuristic of making the locally optimal choice at each stagewith the hope of finding the global optimum.... , which makes only the downhill transitions. In the original description of SA, the probability Given these properties, the temperature The annealing schedule The name and inspiration of the algorithm demand an interesting feature related to the temperature variation to be embedded in the operational characteristics of the algorithm. This necessitates a gradual reduction of the temperature as the simulation proceeds. The algorithm starts initially with annealing schedule —which may be specified by the user, but must end with Example illustrating the effect of cooling schedule on the performance of simulated annealing. The problem is to rearrange the pixel In digital imaging, a pixel, or pel, is a single point in a raster image, or the smallest addressable screen element in a display device; it is the smallest unit of picture that can be represented or s of an image so as to minimize a certain potential energy In physics, potential energy is the energy stored in a body or in a system due to its position in a force field or due to its configuration. The SI unit of measure for energy and work is the Joule... function, which causes similar colours to attract at short range and repel at a slightly larger distance. The elementary moves swap two adjacent pixels. These images were obtained with a fast cooling schedule (left) and a slow cooling schedule (right), producing results similar to amorphous In condensed matter physics, an amorphous or non-crystalline solid is a solid that lacks the long-range order characteristic of a crystal.... and crystalline solids, respectively. For any given finite problem, the probability that the simulated annealing algorithm terminates with the global optimal In mathematics, a global optimum is a selection from a given domain which yields either the highest value or lowest value , when a specific function is applied. For example, for the function... solution approaches 1 as the annealing schedule is extended. This theoretical result, however, is not particularly helpful, since the time required to ensure a significant probability of success will usually exceed the time required for a complete search In computer science, brute-force search or exhaustive search, also known as generate and test, is a trivial but very general problem-solving technique that consists of systematically enumerating all possible candidates for the solution and checking whether each candidate satisfies the problem's... of the solution space. The following In computer science and numerical computation, pseudocode is a compact and informal high-level description of the operating principle of a computer program or other algorithm. It uses the structural conventions of a programming language, but is intended for human reading rather than machine reading... presents the simulated annealing heuristic as described above. It starts from a state and continues to either a maximum of steps or until a state with an energy of or less is found. In the process, the call should generate a randomly chosen neighbour of a given state s; the call should return a random value in the range , which should yield the temperature to use, given the fraction of the time budget that has been expended so far. s ← s0; e ← E(s) // Initial state, energy. sbest ← s; ebest ← e // Initial "best" solution k ← 0 // Energy evaluation count. while k < kmax and e > emax // While time left & not good enough: snew ← neighbour(s) // Pick some neighbour. enew ← E(snew) // Compute its energy. if P(e, enew, temp(k/kmax)) > random then // Should we move to it? s ← snew; e ← enew // Yes, change state. if enew < ebest then // Is this a new best? sbest ← snew; ebest ← enew // Save 'new neighbour' to 'best found'. k ← k + 1 // One more evaluation done return sbest // Return the best solution found. Pedantically speaking, the "pure" SA algorithm does not keep track of the best solution found so far: it does not use the variables , it lacks the second inside the loop, and, at the end, it returns the current state instead of . While remembering the best state is a standard technique in optimization that can be used in any In computer science, metaheuristic designates a computational method that optimizes a problem by iteratively trying to improve a candidate solution with regard to a given measure of quality. Metaheuristics make few or no assumptions about the problem being optimized and can search very large spaces... , it does not have an analogy with physical annealing — since a physical system can "store" a single state only. Even more pedantically speaking, saving the best state is not necessarily an improvement, since one may have to specify a smaller in order to compensate for the higher cost per iteration and since there is a good probability that in the final iteration anyway. However, the step sbest ← snew happens only on a small fraction of the moves. Therefore, the optimization is usually worthwhile, even when state-copying is an expensive operation. Selecting the parameters In order to apply the SA method to a specific problem, one must specify the following parameters: the state space, the energy (goal) function , the candidate generator procedure , the acceptance probability function , and the annealing schedule AND initial temperature . These choices can have a significant impact on the method's effectiveness. Unfortunately, there are no choices of these parameters that will be good for all problems, and there is no general way to find the best choices for a given problem. The following sections give some general guidelines. Diameter of the search graph Simulated annealing may be modeled as a random walk on a search graph In mathematics and computer science, graph theory is the study of graphs, mathematical structures used to model pairwise relations between objects from a certain collection. A "graph" in this context refers to a collection of vertices or 'nodes' and a collection of edges that connect pairs of... , whose vertices are all possible states, and whose edges are the candidate moves. An essential requirement for the neighbour function is that it must provide a sufficiently short path on this graph from the initial state to any state which may be the global optimum. (In other words, the diameter of the search graph must be small.) In the traveling salesman example above, for instance, the search space for In mathematics, the factorial of a non-negative integer n, denoted by n!, is the product of all positive integers less than or equal to n... = 2,432,902,008,176,640,000 (2.4 quintillion) states; yet the neighbour generator function that swaps two consecutive cities can get from any state (tour) to any other state in at most Transition probabilities For each edge transition probability, which is the probability that the SA algorithm will move to state temp, by the order in which the candidate moves are generated by the neighbour function, and by the acceptance probability function P. (Note that the transition probability is not simply Acceptance probabilities The specification of neighbour, P, and temp is partially redundant. In practice, it's common to use the same acceptance function P for many problems, and adjust the other two functions according to the specific problem. In the formulation of the method by Kirkpatrick et al., the acceptance probability function Metropolis-Hastings algorithm In mathematics and physics, the Metropolis–Hastings algorithm is a Markov chain Monte Carlo method for obtaining a sequence of random samples from a probability distribution for which direct sampling is difficult... , in the case where the proposal distribution of Metropolis-Hastings is symmetric. However, this acceptance probability is often used for simulated annealing even when the neighbour function, which is analogous to the proposal distribution in Metropolis-Hastings, is not symmetric, or not probabilistic at all. As a result, the transition probabilities of the simulated annealing algorithm do not correspond to the transitions of the analogous physical system, and the long-term distribution of states at a constant temperature Efficient candidate generation When choosing the candidate generator neighbour, one must consider that after a few iterations of the SA algorithm, the current state is expected to have much lower energy than a random state. Therefore, as a general rule, one should skew the generator towards candidate moves where the energy of the destination state heuristic Heuristic refers to experience-based techniques for problem solving, learning, and discovery. Heuristic methods are used to speed up the process of finding a satisfactory solution, where an exhaustive search is impractical... (which is the main principle of the Metropolis-Hastings algorithm In mathematics and physics, the Metropolis–Hastings algorithm is a Markov chain Monte Carlo method for obtaining a sequence of random samples from a probability distribution for which direct sampling is difficult... ) tends to exclude "very good" candidate moves as well as "very bad" ones; however, the latter are usually much more common than the former, so the heuristic is generally quite effective. In the traveling salesman problem above, for example, swapping two consecutive cities in a low-energy tour is expected to have a modest effect on its energy (length); whereas swapping two arbitrary cities is far more likely to increase its length than to decrease it. Thus, the consecutive-swap neighbour generator is expected to perform better than the arbitrary-swap one, even though the latter could provide a somewhat shorter path to the optimum (with A more precise statement of the heuristic is that one should try first candidate states neighbour function that swaps two random cities, where the probability of choosing a city pair vanishes as their distance increases beyond Barrier avoidance When choosing the candidate generator neighbour one must also try to reduce the number of "deep" local minima — states (or sets of connected states) that have much lower energy than all its neighbouring states. Such "closed catchment A drainage basin is an extent or an area of land where surface water from rain and melting snow or ice converges to a single point, usually the exit of the basin, where the waters join another waterbody, such as a river, lake, reservoir, estuary, wetland, sea, or ocean... basins" of the energy function may trap the SA algorithm with high probability (roughly proportional to the number of states in the basin) and for a very long time (roughly exponential on the energy difference between the surrounding states and the bottom of the basin). As a rule, it is impossible to design a candidate generator that will satisfy this goal and also prioritize candidates with similar energy. On the other hand, one can often vastly improve the efficiency of SA by relatively simple changes to the generator. In the traveling salesman problem, for instance, it is not hard to exhibit two tours Cooling schedule The physical analogy that is used to justify SA assumes that the cooling rate is low enough for the probability distribution of the current state to be near thermodynamic equilibrium In thermodynamics, a thermodynamic system is said to be in thermodynamic equilibrium when it is in thermal equilibrium, mechanical equilibrium, radiative equilibrium, and chemical equilibrium. The word equilibrium means a state of balance... at all times. Unfortunately, the relaxation time—the time one must wait for the equilibrium to be restored after a change in temperature—strongly depends on the "topography" of the energy function and on the current temperature. In the SA algorithm, the relaxation time also depends on the candidate generator, in a very complicated way. Note that all these parameters are usually provided as black box functions In computing, a procedural parameter is a parameter of a procedure that is itself a procedure.This concept is an extremely powerful and versatile programming tool, because it allows programmers to modify certain steps of a library procedure in arbitrarily complicated ways, without having to... to the SA algorithm. Therefore, in practice the ideal cooling rate cannot be determined beforehand, and should be empirically adjusted for each problem. The variant of SA known as thermodynamic simulated annealing tries to avoid this problem by dispensing with the cooling schedule, and instead automatically adjusting the temperature at each step based on the energy difference between the two states, according to the laws of thermodynamics. Sometimes it is better to move back to a solution that was significantly better rather than always moving from the current state. This process is called restarting of simulated annealing. To do this we set s and e to sbest and ebest and perhaps restart the annealing schedule. The decision to restart could be based on several criteria. notable among these include restarting based a fixed number of steps, based on whether the current energy being too high from the best energy obtained so far, restarting randomly etc. Related methods • Quantum annealing In mathematics and applications, quantum annealing is a general method for finding the global minimum of a given objective function over a given set of candidate solutions , by a process analogous to quantum fluctuations... uses "quantum fluctuations" instead of thermal fluctuations to get through high but thin barriers in the target function. • Stochastic tunneling Stochastic tunneling is an approach to global optimization based on the Monte Carlo method-sampling of the function to be minimized.- Idea :... attempts to overcome the increasing difficulty simulated annealing runs have in escaping from local minima as the temperature decreases, by 'tunneling' through barriers. • Tabu search Tabu search is a mathematical optimization method, belonging to the class of trajectory based techniques. Tabu search enhances the performance of a local search method by using memory structures that describe the visited solutions: once a potential solution has been determined, it is marked as... normally moves to neighbouring states of lower energy, but will take uphill moves when it finds itself stuck in a local minimum; and avoids cycles by keeping a "taboo list" of solutions already • Reactive search optimization Reactive search optimization defines local-search heuristics based on machine learning, a family of optimization algorithms based on the local search techniques... focuses on combining machine learning with optimization, by adding an internal feedback loop to self-tune the free parameters of an algorithm to the characteristics of the problem, of the instance, and of the local situation around the current solution. • Stochastic gradient descent Stochastic gradient descent is an optimization method for minimizing an objective function that is written as a sum of differentiable functions.- Background :... runs many greedy searches from random initial locations. • Genetic algorithms maintain a pool of solutions rather than just one. New candidate solutions are generated not only by "mutation" (as in SA), but also by "recombination" of two solutions from the pool. Probabilistic criteria, similar to those used in SA, are used to select the candidates for mutation or combination, and for discarding excess solutions from the pool. • Graduated optimization Graduated optimization is a global optimization technique that attempts to solve a difficult optimization problem by initially solving a greatly simplified problem, and progressively transforming that problem until it is equivalent to the difficult optimization problem.-Technique... digressively "smooths" the target function while optimizing. • Ant colony optimization In computer science and operations research, the ant colony optimization algorithm ' is a probabilistic technique for solving computational problems which can be reduced to finding good paths through graphs.... (ACO) uses many ants (or agents) to traverse the solution space and find locally productive areas. • The cross-entropy method The cross-entropy method attributed to Reuven Rubinstein is a general Monte Carlo approach tocombinatorial and continuous multi-extremal optimization and importance sampling.The method originated from the field of rare event simulation, where... (CE) generates candidates solutions via a parameterized probability distribution. The parameters are updated via cross-entropy minimization, so as to generate better samples in the next • Harmony search In computer science and operations research, harmony search is a phenomenon-mimicking algorithm inspired by the improvisation process of musicians... mimics musicians in improvisation process where each musician plays a note for finding a best harmony all together. • Stochastic optimization Stochastic optimization methods are optimization methods that generate and use random variables. For stochastic problems, the random variables appear in the formulation of the optimization problem itself, which involve random objective functions or random constraints, for example. Stochastic... is an umbrella set of methods that includes simulated annealing and numerous other approaches. • Particle swarm optimization In computer science, particle swarm optimization is a computational method that optimizes a problem by iteratively trying to improve a candidate solution with regard to a given measure of is an algorithm modelled on swarm intelligence that finds a solution to an optimization problem in a search space, or model and predict social behavior in the presence of objectives. • Intelligent Water Drops (IWD) which mimics the behavior of natural water drops to solve optimization problems • Parallel tempering Parallel tempering, also known as replica exchange MCMC sampling, is a simulation method aimed at improving the dynamic properties of Monte Carlo method simulations of physical systems, and of Markov chain Monte Carlo sampling methods more generally... is a simulation of model copies at different temperatures (or Hamiltonian Hamiltonian may refer toIn mathematics :* Hamiltonian system* Hamiltonian path, in graph theory** Hamiltonian cycle, a special case of a Hamiltonian path* Hamiltonian group, in group theory* s) to overcome the potential barriers. See also Further reading • A. Das and B. K. Chakrabarti (Eds.), Quantum Annealing and Related Optimization Methods, Lecture Note in Physics, Vol. 679, Springer, Heidelberg (2005)}} External links	{"url":"http://www.absoluteastronomy.com/topics/Simulated_annealing","timestamp":"2014-04-21T16:17:21Z","content_type":null,"content_length":"69058","record_id":"<urn:uuid:ad041556-0288-4df1-a87a-d33ec6af0907>","cc-path":"CC-MAIN-2014-15/segments/1398223206120.9/warc/CC-MAIN-20140423032006-00416-ip-10-147-4-33.ec2.internal.warc.gz"}
surd help urgent March 16th 2007, 06:29 PM surd help urgent the question states "write an irrational fraction that when rationalised the solution is 5. prove":confused: :eek: please help me its really urgent your help would be much appreciated March 17th 2007, 01:41 AM Are you sure that the question says "irrational fraction"? such usage is quite unusual. However lets try: sqrt(125)/sqrt(5) = sqrt(5*25)/sqrt(5) = [sqrt(25) sqrt(5)] / sqrt(5) = sqrt(25) = 5. March 17th 2007, 01:44 AM Don't make multiple posts of the same question, it confuses the system and wastes the helper time. March 17th 2007, 01:40 PM hi i think thats correct if it can be a surd over a surd can u explain how u got it March 17th 2007, 01:55 PM Well I needed two surds one of which was 5 times the other, so anything like 5 sqrt(n) and sqrt(n) will do, Now 5 sqrt(n) = sqrt(25 n), so now we choose any n and sqrt(25 n)/sqrt(n) will do the trick, as long as n is not a perfect square when the numerator and denominator will be integers - which we do not want. March 17th 2007, 05:43 PM thanks for your help but square root125/ square root 5 is a rational number it has to be irrational March 18th 2007, 01:48 AM No it has to be rational when all reduced to lowest form, as it has to be 5, which is an integer but may be written 5/1 so is rational. What you want is for both the numerator and denominator to be irrational, as sqrt(125) and sqrt(5) are. (there is no irrational number equal to 5) March 21st 2007, 02:48 PM ok thanks for your help you might be able to help with my other question the heading is money and investment thnkyou heaps and heaps	{"url":"http://mathhelpforum.com/algebra/12649-surd-help-urgent-print.html","timestamp":"2014-04-18T03:08:40Z","content_type":null,"content_length":"7950","record_id":"<urn:uuid:b9a8c34a-bdf3-4645-a193-0b1de37954eb>","cc-path":"CC-MAIN-2014-15/segments/1397609532480.36/warc/CC-MAIN-20140416005212-00214-ip-10-147-4-33.ec2.internal.warc.gz"}
4 word problems on functions, please help. October 27th 2007, 04:36 PM #1 4 word problems on functions, please help. I'm sorry for having to ask like this. I've never been good at word problems. 1. As a weather balloon is inflated, its radius increases at the rate of 4 cm per second. Express the volume of the balloon as a function of time, and determine the volume of the balloon after 4 2. Express the surface area of the weather balloon in the above problem as a function of time. 3. (this one has a picture, I tried to get the basics) Brandon, who is 6 feet tall, walks away from a streetlight that is 15 ft high at a rate of 5 feet per second, as shown in the figure. Express the length s of Brandon's shadow as a function of time. 4. (This one has a picture, too) A water-filled balloon is dropped from a window 120 ft above the ground. Its height above the ground after t seconds is 120-16t(squared) ft. Laura is standing on the ground 40 ft from the point where the balloon will hit the ground, as shown in the figure. (A) Express the distance d between Laura and the balloon as a function of time. (B) When is the balloon exactly 90 ft from Laura?] I'm sorry for the poor quality of the pictures, I had to use a picture editor instead of something like paint. Also, if it helps, we have only done number patterns and equations and inequalities before this. I'm sorry for having to ask like this. I've never been good at word problems. 1. As a weather balloon is inflated, its radius increases at the rate of 4 cm per second. Express the volume of the balloon as a function of time, and determine the volume of the balloon after 4 2. Express the surface area of the weather balloon in the above problem as a function of time. to 1.: I assume that the balloon has the shape of a sphere. Let t be the variable for the time. Then r = 4t. You know the formula for the volume of a sphere: $V(r) = \frac43 \pi r^3$ . Plug in the term for r: $V(t) = \frac43 \pi (4t)^3~\implies~V(t) = \frac{256}{3} \cdot \pi t^3$ to 2.: You know the formula for the surface of a sphere: $A(r) = 4 \pi r^2$ . Plug in the term for r: $A(t) = 4 \pi (4t)^2~\implies~A(t)=64 \pi t^2$ I'm sorry for having to ask like this. I've never been good at word problems. 1. ... 2. ... 3. (this one has a picture, I tried to get the basics) Brandon, who is 6 feet tall, walks away from a streetlight that is 15 ft high at a rate of 5 feet per second, as shown in the figure. Express the length s of Brandon's shadow as a function of time. 4. (This one has a picture, too) A water-filled balloon is dropped from a window 120 ft above the ground. Its height above the ground after t seconds is 120-16t(squared) ft. Laura is standing on the ground 40 ft from the point where the balloon will hit the ground, as shown in the figure. (A) Express the distance d between Laura and the balloon as a function of time. (B) When is the balloon exactly 90 ft from Laura?] to 3.: Set up the proportion $\frac{s}{s+d}=\frac{6}{15}=\frac25$ . Solve for s. $s=\frac23 d$ Now plug in the term for d: $d = 5t$ . So you have now: $s=\frac23 \cdot 5t ~\implies~s=\frac{10}{3} t$ to 4.: Use Pythagorean theorem: Set up the equation with the given distance: $90^2=40^2+(120-16t^2)^2$ . If the balloon falls down the complete distance of 120' it will take approximately 2.7 seconds until it hits the ground. Therefore the solution of this equation can only be between zero and 2.7 s. Substitute $y = t^2$ and solve for y. Afterwards calculate t. Because it was asked for the exact solution you should get: $t=\frac14 \cdot \sqrt{120-10 \cdot \sqrt{65}}$ October 27th 2007, 10:29 PM #2 October 27th 2007, 10:52 PM #3	{"url":"http://mathhelpforum.com/pre-calculus/21463-4-word-problems-functions-please-help.html","timestamp":"2014-04-21T15:39:28Z","content_type":null,"content_length":"44757","record_id":"<urn:uuid:aed1f4a0-c7e1-4bf7-9d0a-45a80f7da381>","cc-path":"CC-MAIN-2014-15/segments/1397609540626.47/warc/CC-MAIN-20140416005220-00591-ip-10-147-4-33.ec2.internal.warc.gz"}
Broadview, IL Algebra 2 Tutor Find a Broadview, IL Algebra 2 Tutor ...Additionally, I specialize in guiding students (and parents) through the college admissions process by providing strategies that best position the applicant for both admission to and funding for the school(s) of his/her choice. I, myself, successfully earned full tuition and a stipend for both m... 38 Subjects: including algebra 2, Spanish, reading, statistics ...I have also tutored Geometry and Calculus students. I have helped my nephew with his math in the past. I love helping students at this age - when they are just beginning their educational 7 Subjects: including algebra 2, geometry, algebra 1, trigonometry ...I was valedictorian in elementary school, achieved AP scores of 5/5 in French Language, French Literature, AB Calculus, and Biology in high school, and graduated from college as J.N. Honors Scholar Cum Laude with a BS in Elementary Education. I am certified to teach grades K-8 in Michigan and grades 1-6 in NY. 19 Subjects: including algebra 2, English, geometry, reading ...Algebra 2 builds on the skills learned in Algebra 1 and digs further into variable mathematics. Topics include: functions and graphing (linear, quadratic, logarithmic, exponential), complex numbers, systems of equations and inequalities, and relations. This can also include beginning trigonometry and probability and statistics. 11 Subjects: including algebra 2, calculus, geometry, algebra 1 ...Mike K.I have a B.S. in Mechanical Engineering from the University of Illinois at Chicago. B.S. conferred December 1992. I have been practicing Mechanical Engineering for 21 years. 12 Subjects: including algebra 2, physics, trigonometry, precalculus Related Broadview, IL Tutors Broadview, IL Accounting Tutors Broadview, IL ACT Tutors Broadview, IL Algebra Tutors Broadview, IL Algebra 2 Tutors Broadview, IL Calculus Tutors Broadview, IL Geometry Tutors Broadview, IL Math Tutors Broadview, IL Prealgebra Tutors Broadview, IL Precalculus Tutors Broadview, IL SAT Tutors Broadview, IL SAT Math Tutors Broadview, IL Science Tutors Broadview, IL Statistics Tutors Broadview, IL Trigonometry Tutors Nearby Cities With algebra 2 Tutor Bellwood, IL algebra 2 Tutors Berwyn, IL algebra 2 Tutors Brookfield, IL algebra 2 Tutors Forest Park, IL algebra 2 Tutors Hillside, IL algebra 2 Tutors Hines, IL algebra 2 Tutors Hinsdale, IL algebra 2 Tutors La Grange Park algebra 2 Tutors Lyons, IL algebra 2 Tutors Maywood, IL algebra 2 Tutors Melrose Park algebra 2 Tutors North Riverside, IL algebra 2 Tutors River Forest algebra 2 Tutors Riverside, IL algebra 2 Tutors Westchester algebra 2 Tutors	{"url":"http://www.purplemath.com/Broadview_IL_Algebra_2_tutors.php","timestamp":"2014-04-18T23:53:07Z","content_type":null,"content_length":"24076","record_id":"<urn:uuid:e845829a-174f-4e1e-8bc4-7eefbaa2432c>","cc-path":"CC-MAIN-2014-15/segments/1397609535535.6/warc/CC-MAIN-20140416005215-00543-ip-10-147-4-33.ec2.internal.warc.gz"}
Syntax: Semantics: F --> i ^x.xSK F --> * F F [F][F] That's the whole language. For comparison, the lambda calculus requires an infinite stock of distinct variable symbols, and even Combinatory Logic requires at least three symbols, including S, K, and something to serve the function of parentheses. The syntax generates strings like i, ii, iii, or iiii, but not ii, ii, or ii. The semantics is expressed using the lambda calculus. The symbol "^" stands for lambda, and the functions S and K are the standard functions from Combinatory Logic (henceforth referred to as "CL"): S = ^xyz.xz(yz) and K = ^xy.x. If you're not familiar with CL, see, e.g., Hankin's 1994 Oxford book, Lambda Calculi: A guide for computer scientists, or the wonderful Unlambda page for a thorough explanation. Note that as usual, functional application is left-associative, so that, e.g., xSK = ((x(S))(K)). The expression [F] indicates "the meaning of the expression F"; in other words, the star prefix in the syntax corresponds to functional application in the semantics. Iota is highly similar to other simple Turing-complete languages. For one thing, the trick of using the star prefix instead of left and right parentheses is a strategy also adopted in Unlambda. (In fact, in general, exploring the Unlambda page will help tremendously in understanding this document.) For another, Hankin (page 61) proposes the term ^x.xKSK as a one-element basis for the lambda-calculus; my language pursues essentially the same idea, except that my unique basis element is marginally simpler (^x.xSK instead of ^x.xKSK). Of course, when there is only one element in the basis, even a marginal difference in simplicity is a substantial fraction of the whole! 18 March 2002: Jeroen Fokker compares a number of one-combinator bases. He claims that his (^f.fS(^x^y^z.x)) is the smallest, but does not consider my combinator. For purposes of comparison, my combinator can be rendered as ^f.fS(^x^y.x), which is clearly smaller. Fokker is trying to minimize the number of combinators it takes to reconsruct K and S, and on that score, he wins (2 and 3, respectively, for him versus 4 and 5 for me--see below). But in terms of the size of the combinator itself, I win. See Fokker 1992, `The systematic construction of a one-combinator basis for Lambda-terms', Formal Aspects of Computing 4:776-780, available here . Here is a complete reference implementation for Iota in R5RS Scheme: (let iota () (if (eq? #\ (read-char)) ((iota)(iota)) (lambda (c) ((c (lambda (x) (lambda (y) (lambda (z) ((x z)(y z)))))) (lambda (x) (lambda (y) x)))))) When executed in a Scheme interpreter, this program will read one well-formed Iota expression, then return the function denoted by the Iota expression. (Scheme exercise: what happens when the input does not contain a well-formed Iota expression? Consider, for instance, trying as input just "".) If you want to try out Iota, you can either download the reference interpreter and run it in a Scheme interpreter, or try the JavaScript program Since the expression "[A][B]" in Iota means the same thing as "AB" in CL (namely, functional application in which the meaning of A is applied as a function to the meaning of B), we need only establish the appropriateness of the translations of the lexical items I, K, and S. Bear in mind that functional application is left-associative: In addition, it is easy to find a meaning-preserving mapping from Iota into CL: the semantics in the definition for Iota are given as a mapping from Iota to the lambda calculus, and there are well-known techniques for mapping the lambda calculus into CL (see, e.g., Hankin or the Unlambda page for details). 2. Jot: a better Goedel-numbering Goedel's famous incompleteness theorem depends on finding a way to map the natural numbers onto the set of effectively computable functions. Such so-called Goedel numberings are usually fairly complex, and typically involve factoring the number in certain clever ways and mapping the result onto a string of symbols in a formal language. The techniques used to construct Iota give rise to a similar but distinct language that I will call Jot. One of Jot's interesting properties is that it provides a particularly elegant Goedel numbering. In many ways, Jot is simpler than Iota, though it is slightly more complex to describe: Syntax: Semantics: F --> e ^x.x F --> F 0 [F]SK F --> F 1 ^xy.[F](xy) Here "e" represents the empty string. Jot's syntax is incredibly simple: every possible string consisting of 1's and 0s is grammatical, including the empty string. The meaning of the empty string, by the way, is the identity function, which I find pleasant for some reason. In other words, it is impossible to make a syntax error in Jot! One interesting difference between Iota and Jot is that in Iota, the parentheses operator, , was treated syncategorematically. In Jot, 1 serves the same purpose, but it is treated lexically. In other words, in Iota, is a punctuation mark, but in Jot, 1 denotes a function just like i in Iota or 0 in Jot. Unlike Iota, where the syntactic tree for a string can branch either on the left or on the right, Jot syntax is uniformly left-branching. As a result, Iota is strictly context-free, but Jot is a regular language. The reference implementation of Jot requires one extra line, because it is necessary to check for end of file in order to know when the expression is finished: (let jot ((v (lambda (x) x))) (cond ((eof-object? (peek-char)) v) ((eq? #\1 (read-char)) (jot (lambda (f) (lambda (a) (v (f a)))))) (else (jot ((v (lambda (x) (lambda (y) (lambda (z) ((x z)(y z)))))) (lambda (x) (lambda (y) x))))))) The semantics of Jot are similar to those of Iota, but not identical. For one thing, the 1 operator does not treat 0 as a unit, but is capable of dividing the meaning of 0 into its K half and its S half. As a result, there are typically more 1's than 0's in a useful Jot program, in comparison with Iota, in which there must always be exactly one more i than there are 's in order for the expression to be well-formed. Here are the rules for mapping an arbitrary CL program into Jot: CL Jot K ==> 11100 S ==> 11111000 AB ==> 1[A][B] Note that every CL expression translates into a Jot expression that begins with 1. Constructing a Goedel-numbering now becomes trivial: simply express each natural number in base 2 as a string of 1's and 0's. Since every such string is a legitimate Jot program, each base-2 numeral will give rise to a legitimate Jot program. Furthermore, since the base 2 representation of a number always begins with a 1, and since the translation of each CL expression begins with a 1, for every CL program there will be a numeral with the same interpretation. Since CL is Turing-complete, we have a suitable Goedel-numbering in which the base-2 representation of the number itself is treated as a program directly. 3. Iota and Jot in JavaScript In order to make it convenient to try out Iota and Jot, I have embedded interpreters within this web page, coded in JavaScript. (You must have JavaScript turned on in your browser for this to work.) You can look at the JavaScript code by clicking on View->Page Source. The interpreter is designed to pop up an "alert" window, which trys to present the function denoted by the Iota program. When you click on "Run Iota", you should see an alert window pop up, probably displaying some uninformative code related to the K function. This makes sense, since as discussed above iiii denotes K. Similarly, if you evaluate the Iota code corresponding to S by inserting i at the beginning of the program to make it iii*ii, clicking should produce an alert window containing code for S. In general, however, since the alert window does not provide full access to the closure denoted by the Iota program, examining the alert window is not terribly helpful. And since Iota (unlike most practical programming languages) does not produce any output, it can be difficult to verify that the program is behaving as expected. Nevertheless, it is possible to observe indirectly whether the interpreter is working as it is supposed to. For instance, consider what ought to happen when the program denotes an infinite loop: the interpreter will either run forever, or run out of resources. Unfortunately, there is a price to pay for the convenience of running the interpreter inside of a browser: JavaScript interpreters are usually designed to fail silently. But most browsers provide a JavaScript console that will tell you when a stack overflow occurs. You can open the console by clicking on Task->Tools->JavaScript console or some such. Warning: running these infinite loops may cause some browsers to crash---on my system, Netscape 4.77 crashes. This program also denotes an infinite loop, but with a difference: the equivalent lambda expression reduces to an expression that is longer than the original. (Translation of S(SK)(SK)(SII) in CL, and of ```s`sk`sk``sii in Unlambda; similar in behavior to the lambda expression (^x.xx)(^x.x(xx)).) On my Scheme interpreter, the behavior is different than the last example; rather than looping endlessly, it causes a stack overflow. On the JavaScript interpreter, however, it causes "too much recursion", just like the first example. You can verify for yourself that just about any other well-formed Iota program returns almost instantly without producing a JavaScript error ("just about", because you might manage to find another infinite loop!): just type an Iota program into the input window, and click "Run Iota". Here are the corresponding infinite-loop programs in Jot (also, try K = 11100 or S = 11111000):	{"url":"http://www.semanticsarchive.net/barker/Iota/","timestamp":"2014-04-18T10:35:07Z","content_type":null,"content_length":"18377","record_id":"<urn:uuid:e9cf48d1-7844-4f4f-b6aa-a67f7b8829d1>","cc-path":"CC-MAIN-2014-15/segments/1397609533308.11/warc/CC-MAIN-20140416005213-00069-ip-10-147-4-33.ec2.internal.warc.gz"}
Math Graphic Download Software • Advertisement Easy-to-use math calculator that immediately computes the result as you type a math expression. It allows multiples math expressions at same time. It also allows defining your own variables that can be set to a value or other math expressions. It has. ... □ Windows Vista, 2003, XP, 2000, 98, Me, NT • EDraw Flowchart ActiveX Control - Build flowchart applications with minimum time loss! Lets you quickly build basic flowcharts, organizational charts, business charts, hr diagram, work flow, programming flowchart and network design diagrams. □ Shareware ($499.00) □ 1.54 Mb □ WinNT 3.x, WinNT 4.x, Windows2000, WinXP, Windows2003, Windows Vista • Are you weight-conscious? BMR Calculator uses a widely accepted formula to help you work out your Body Mass Index(BMI) and Basal Metabolic Rate (BMR). Calculate your body composition, metabolic rate, and calories needed if you are starting on a diet. □ WinXP, Windows2000, Windows2003, Windows Vista • Graph mathematical functions and equations in 2D or 3D with this advanced graphing calculator. - Easy graphing calculator - Beautiful user-interface - Plots functions: y=sin(x) - Plots equations: sin(x) = y2 - Easy and detailed customization of axis. ... □ Windows Vista, XP, 2000, 98, Me • Graphic Organizer - use graphic organizer as the best home graphic organizer application. This graphic organizer, the award-winning graphic organizer software, the cutting-edge graphic organizer program and the awesome graphic organizer utility will. ... □ graphic-organizer-setup.exe □ Shareware ($39.95) □ 18.06 Mb • Math ODF recovery software for documents created with OpenOffice Math software. Repair .odf files and recover data from them and save to new working .odf files Kernel for Math, easily available file repair software for OpenOffice Math files. Free to download and easy to understand are the main attraction of odf file repair software. □ Shareware ($79.00) □ 1.78 Mb □ Windows XP, Windows 2000, Windows 2003, Windows Vista • Perfect Download Icons is a royalty-free collection of quality icons representing various concepts and technologies related to uploading and downloading. Includes 70 quality icons with 5 sizes, 2 color depths, 4 file formats and 3 states for each one. □ perfect-download-icons.zip □ Shareware ($29.95) □ 1.58 Mb □ WinXP, WinVista, WinVista x64, Win7 x32, Win7 x64, Win2000, WinOther, Other, Mac OS X, Mac OS X, Mac Other, Windows2000, Windows2003, WinServer, Windows Vista, WinMobile, Windows CE, Pocket PC, Android, BlackBerry, iPhone, iPod, iTouch, Palm, Palm OS 6.0, Win98, WinME, WinNT 3.x, WinNT 4.x, Win95, Unix, Linux, Java, Win 3.1x, Windows Tablet PC Edition 2005, Windows Media Center Edition 2005, Windows Mobile 2003, Windows Mobile 2005, Linux Gnome, Linux GPL, Linux Open Source, AS, 400, OS, 2, OS, 2 Warp, OS, 2 Warp 4, Mac PPC, Mac OS X 10.5 • Instantly write high impact website headings or sentences using elaborate graphic text fonts instead of the limited range of installed fonts. Add you own picture images or download pure graphic • Chasys Math is a suite of math utilities including a calculator featuring graph-plotting, complex numbers and visually-perfect algebraic method (Chasys Math Calculator), and a matrix equation solver that can handle systems of equations as large as 32. ... • AppleMacSoft Graphic Converter for Mac allows you to batch convert and resize thousands of graphic files on Mac OS X with a few clicks. It supports more than 50 graphic formats. ... □ Shareware ($19.95) □ 3.04 Mb • Download Direct (also known as DLD) was developed to accelerate your downloads by up to 500% (sometimes more) and let you manage them via one central screen. We wanted to ensure ease of use for the average home user with its simple, clean, great. ... □ Windows2000, Windows2003, WinNT 4.0, WinXP, Windows Vista, Windows 7 • Free Math Board Game is a puzzle game with a 6 x 6 matrix where the digits 1 through 6 must be placed in each column and in each row without repetition. This is a very interesting game just looks like the popular Sudoku. This Math game for people who want to practise important mathematics skills including counting, subtraction and adding. □ Win2000, Win7 x32, Win7 x64, Win98, WinVista, WinVista x64, WinXP Related: Math Graphic Download - Math Graphic Mobile - Math Graphic Design - Math Graphic Viewer - Advanced Math Graphic	{"url":"http://www.winsite.com/math/math+graphic+download/","timestamp":"2014-04-20T08:37:49Z","content_type":null,"content_length":"31876","record_id":"<urn:uuid:e7f6aaf5-b70e-455a-a8b8-166855726474>","cc-path":"CC-MAIN-2014-15/segments/1398223205375.6/warc/CC-MAIN-20140423032005-00647-ip-10-147-4-33.ec2.internal.warc.gz"}
Programming assignment help! 03-13-2003 #1 Registered User Join Date Mar 2003 Hello... this is only my second time posting on these boards and yet I am asking for help again. My assignment: in short I am supposed to use already given data to determine the total cost to produce several open-top cylindrical containers. I have to ask the user to input the dimensions and the cost per inch of the material being used, and in return output the surface are for the container and the cost of materials for the container in dollars, all formatted to 2 decimal places. I am also required to ask if they want to input another container and at the very end, display the total cost for all the cylinders entered. I am not sure how to put that into my program... not sure if I need to make some kind of loop with a counter and keep track of the sum or what. So any help there would be appreciated as well! #include <iostream.h> #include <math.h> #include <iomanip.h> //Function Prototype void program (); double surface(double, double); //Main function int main() //Variable Declarations int cyl_count; double radius; double height; double volume; double cost; double cyl_cost; char another = 'Y'; //Obtain data from the user while (another == 'Y') void program (); cout<<"Enter the radius of the base in inches: "<<endl; cout<<"Enter the height of the container in inches: "<<endl; cout<<"Enter the cost per square inch of the material being used in dollars: "<<endl; cout<<"\nTotal surface area for this container is: "<<setprecision(2) <<setiosflags(ios::fixed \| ios:: showpoint)<<surface<<endl; cyl_cost = cost * surface; cout<<"\nThe cost of the materials for this container is: "<<setprecision(2) <<setiosflags(ios::fixed \| ios:: showpoint)<<"$"<<cyl_cost<<endl; cout<<"\nAre there any additional containters to process? Enter Y for yes. "<<endl; cyl_count = return 0; //Output program description void program() cout<<"This program will determine the cost to produce open-top cylindrical containers."<<endl; double surface(double radius, double height) double base_area; double surface_area; double circumference; double total_surface_area; const double PI = 3.14159265; base_area = PI * pow(radius, 2); circumference = 2 * PI * radius; surface_area = circumference * height; total_surface_area = base_area + surface_area; return surface; Ok, from what I can make out, you are having trouble with the use of functions. Namely your surface() function. First off the return value. I assume you want to return the base area + the surface area right? So instead of return surface; you do return base_area + surface_area; Also, when you call the function in main() you are not supplying any arguments. You just write However your function needs 2 arguments, radius and height. So you need to give it these values when you call it as follows surface (radius, height) Now in order to keep a running total of the cost of all your cylinders you could do with a variable named total_cost. You are correctly (well apart from the incorrect function call as explained earlier) calculating the cost of each cylinder on each loop. Once this is calculated, using: total_cost += cyl_cost; will make total_cost a running total of your complete cost. Also, you have this cyl_count = This isn't doing anything, in fact it shouldn't compile. If you want to increment it for each cylinder. Change it to, Hope this helps. Last edited by minesweeper; 03-13-2003 at 05:21 PM. Not a bad start... This is an incomplete answer... I'm not at my compiler... void program (); - When you put this inside main, you leave out the return type (void), and you place it in the sequence where you "call" it. // Get user input program(); // Go to program() function and do it! // Show results // Ask to loop And... Your function needs a return type... you want it to return a cost or something, you don't want void in this case. And, you need parameters... something like... // Function prototype float program(float Area, float CostPerInch) // Call program() function Cost = program(Area, CostPerInch); Remember variable "scope". The variables aren't avaliable inside your function unless they are passed-in as paramaters (arguements?) You can define local variables inside the function, PI for example. And, you could ask for user input inside the function... if that's what you wanted to do. Start "small". Write the body of your main program first, compile and test it, then add a little and repeat. This makes it much easier to locate errors. You can also write "empty" functions to test compile. A function is (sort-of) like a detour. Go over there and do something. Then, come back here continue... maybe take some numbers with you, and maybe bring one number back. Now, just so I don't get flamed... Later, you'll learn that sometimes these "numbers" may be references or pointers. Last edited by DougDbug; 03-13-2003 at 05:56 PM. Thank you... Wow... thank you both for your relpy's! I am going to take both your suggestions and test them out to see if it fixes/helps my problems. Thanks again! Awesome... I tried both your suggestions and was able to make it work! Only one more question... I am supposed to use a void function to output to the user the statement "This program will determine the cost to produce open-top cylindrical containers." I must be doing something wrong because I can't seem to get it to actually output the statement when I run the program. Can you see what it is I am missing? Thanks again! 03-13-2003 #2 03-13-2003 #3 Hardware Engineer Join Date Sep 2001 03-13-2003 #4 Registered User Join Date Mar 2003 03-13-2003 #5 Registered User Join Date Mar 2003	{"url":"http://cboard.cprogramming.com/cplusplus-programming/35974-programming-assignment-help.html","timestamp":"2014-04-18T11:21:19Z","content_type":null,"content_length":"61284","record_id":"<urn:uuid:31508857-b3e6-41b9-b2b7-496f7c21139f>","cc-path":"CC-MAIN-2014-15/segments/1397609533308.11/warc/CC-MAIN-20140416005213-00405-ip-10-147-4-33.ec2.internal.warc.gz"}
Please help me with this Java programming January 13th, 2010, 05:20 PM Please help me with this Java programming Hello everyone I am a BSC Mathematics student and very beginner in Java Programming and as part of my Mathematics degree I am also learning Algorithm with Java programming. I am in very early stages of Java so I could be making very silly mistake but believe it or not but I am stuck with this error for last 2 days but still cannot figure out where is the problem. Anyone please help me I will really appreciate that. Following is the programme code I am using: Code : class diy70 public static void main(String[] args) int degree; degree = 0; double px, x; /* px is the variable used to store the result of the polynomial at x. Calculate Taylor_Polynomials tp=newCalculate_Taylor_Polynomials(); // Evaluate the polynomial at x = 0.2. x = 0.2; switch (degree) { case 0: px = tp.p0(x); tp.printpx(0.8, x, px); break; case 1: px = tp.p1(x); tp.printpx(0.8, x, px); break; case 2: px = tp.p2(x); tp.printpx(0.8, x, px); break; default: System.out.println("nothing is done."); static class Calculate_Taylor_Polynomials /* Return the result of the polynomial in P.3 Lecture 2 */ double p0(double x) double pofx =1.0; return pofx; Double p1 (double x) double pofx = 1.0 + x; return pofx; double p2(double x) double px = 1.0 + x + Math.pow(x,2); return px; void printpx(int degree, double x, double px) System.out.println("Degree " + degree + "polynomial"); System.out.println ("P( = " + x + ")=" + px); But when I run the above programme I am getting error on line 11 saying something like this: ';' expected and also there is ^ this sign between Polynomials and tp Will wait for reply and may God bless you for this. January 13th, 2010, 05:45 PM Re: Please help me with this Java programming Code : Calculate Taylor_Polynomials tp=newCalculate_Taylor_Polynomials(); It looks like you're missing a space between "new" and "Calculate_Taylor_Polynomials();" Code : Calculate Taylor_Polynomials tp=new Calculate_Taylor_Polynomials(); // fixed January 14th, 2010, 05:06 AM Freaky Chris Re: Please help me with this Java programming Also an underscore Code : Calculate Taylor_Polynomials tp=newCalculate_Taylor_Polynomials(); Code : Calculate_Taylor_Polynomials tp=new Calculate_Taylor_Polynomials(); January 14th, 2010, 05:30 AM Re: Please help me with this Java programming Thanks , I tried this but the problems is still there . Giving me the same error January 14th, 2010, 05:41 AM Re: Please help me with this Java programming Thanks Chris u were right i forgot to put underscore. January 14th, 2010, 05:42 AM Re: Please help me with this Java programming Also Thanks for your help HelloWorld 922 . I have some more problems so i will put on this tread.	{"url":"http://www.javaprogrammingforums.com/%20whats-wrong-my-code/3029-please-help-me-java-programming-printingthethread.html","timestamp":"2014-04-19T15:13:50Z","content_type":null,"content_length":"9263","record_id":"<urn:uuid:10d5f99b-f4f8-479b-8cf3-7866bf76dfb0>","cc-path":"CC-MAIN-2014-15/segments/1397609537271.8/warc/CC-MAIN-20140416005217-00384-ip-10-147-4-33.ec2.internal.warc.gz"}
New Mathematical Structures in Supersymmetric Gauge Theory? Over the last few years, there have been interesting developments in the calculation of new protected quantities for supersymmetric field theories in various dimensions. The mathematical implications of such results are still rather unexplored. One example is the sphere partition function for two-dimensional gauge theories describing Calabi-Yau sigma models in the IR, computed using UV field theory methods, which may lead to important advances in mirror symmetry. Another is the supersymmetric index of certain three-dimensional gauge theories compactified on a two-sphere, which point to the existence of new homological knot The goal of the proposed workshop is to bring together leading mathematicians and mathematical physicists interested in the connections between quantum field theory and frontier areas of mathematics, in order to encourage a fruitful exchange of ideas.	{"url":"http://www.perimeterinstitute.ca/conferences/new-mathematical-structures-supersymmetric-gauge-theory","timestamp":"2014-04-16T17:56:05Z","content_type":null,"content_length":"26175","record_id":"<urn:uuid:489df7c4-25f4-4ffe-aad4-b25ab370f68b>","cc-path":"CC-MAIN-2014-15/segments/1397609524259.30/warc/CC-MAIN-20140416005204-00538-ip-10-147-4-33.ec2.internal.warc.gz"}
Designing a PI controller I'm doing my homework, and encountered a problem. The problem is the one as attached. It includes a part of solution that I don't understand. I've known that when designing the PI controller, we start from D(s) = (Kp + Ki/S) The condition of the PI controller is, firstly, unity DC gain. So the way I started is setting D(0) = 1, but couldn't proceed anymore cuz there is 1/s in D(s), also it is obviously different from the solution. The second way was setting whole transfer function of the system Gcl(0) = 1, but couldn't find the right solution. According to solution, it approaches Kp and Ki separately. And it uses (G(0)/(1+Kp*G(0))=1), but I can't understand this. Could somebody help me out??	{"url":"http://www.physicsforums.com/showthread.php?p=4154488","timestamp":"2014-04-18T18:25:53Z","content_type":null,"content_length":"33082","record_id":"<urn:uuid:a4347f9b-8934-4de7-bcf1-ad0e34cb97b3>","cc-path":"CC-MAIN-2014-15/segments/1397609535095.7/warc/CC-MAIN-20140416005215-00008-ip-10-147-4-33.ec2.internal.warc.gz"}
SAS-L archives -- July 2007, week 4LISTSERV at the University of Georgia SAS-L archives July 2007, week 4 1. "not a valid SAS name" ● "not a valid SAS name" (40 lines) ● Re: "not a valid SAS name" (58 lines) 2. %dosfileinfo and %dosfilesize macros added ● %dosfileinfo and %dosfilesize macros added (15 lines) 3. =?utf-8?B?4pa64pa6R2V0IEZSRUUgU2F0ZWxsaXRlIFRWIG9uIHlvdXIgUEMgb3IgTGFwdG9w4peE4peE?= ● =?utf-8?B?4pa64pa6R2V0IEZSRUUgU2F0ZWxsaXRlIFRWIG9uIHlvdXIgUEMgb3IgTGFwdG9w4peE4peE?= (17 lines) 4. =?utf-8?B?4pa6V2F0Y2ggRlJFRSBTYXRlbGxpdGUgVFYgb24geW91ciBQQyBvciBMYXB0b3Dil4Q=?= ● =?utf-8?B?4pa6V2F0Y2ggRlJFRSBTYXRlbGxpdGUgVFYgb24geW91ciBQQyBvciBMYXB0b3Dil4Q=?= (21 5. =?utf-8?B?4peY4pa6QWNjZXNzIEZSRUUgU2F0ZWxsaXRlIFRWIG9uIHlvdXIgUEMgb3IgTGFwdG9w4peE4peY?= ● =?utf-8?B? 4peY4pa6QWNjZXNzIEZSRUUgU2F0ZWxsaXRlIFRWIG9uIHlvdXIgUEMgb3IgTGFwdG9w4peE4peY?= (21 6. =?utf-8?B?4peY4pa6RlJFRSBTYXRlbGxpdGUgVFYgb24geW91ciBQQ+KXhOKXmA==?= ● =?utf-8?B?4peY4pa6RlJFRSBTYXRlbGxpdGUgVFYgb24geW91ciBQQ+KXhOKXmA==?= (18 lines) 7. A DATA MANUPULATION QUESTION 8. A PROC CONTENTS QUESTION 9. A simple MACRO question: 10. A variable Sorting Problem 11. AIC problem in ROBUSTREG. Is bigger better ? ● AIC problem in ROBUSTREG. Is bigger better ? (85 lines) ● Re: AIC problem in ROBUSTREG. Is bigger better ? (23 lines) 12. Allison's example page 133 - 136 ● Allison's example page 133 - 136 (169 lines) ● Re: Allison's example page 133 - 136 (26 lines) 13. Archiving SAS-L-posted codes 14. Basic question, I hope...SAS XML too ● Re: Basic question, I hope...SAS XML too (159 lines) ● Re: Basic question, I hope...SAS XML too (190 lines) 15. CART analysis on SAS enterprise miner ● CART analysis on SAS enterprise miner (25 lines) 16. CART on SAS enterprise miner ● CART on SAS enterprise miner (23 lines) ● Re: CART on SAS enterprise miner (41 lines) 17. Calculating current record minus minimum of previous ● Calculating current record minus minimum of previous (60 lines) ● Re: Calculating current record minus minimum of previous (123 lines) ● Re: Calculating current record minus minimum of previous (129 lines) 18. Case crossover design ● Case crossover design (28 lines) 19. Change character variable to num variable 20. Collin output in PROC REG ● Collin output in PROC REG (14 lines) ● Re: Collin output in PROC REG (24 lines) ● Re: Collin output in PROC REG (41 lines) 21. Complex survey data analysis question ● Re: Complex survey data analysis question (61 lines) 22. Conditional Footnotes-PROC REPORT ● Conditional Footnotes-PROC REPORT (28 lines) ● Re: Conditional Footnotes-PROC REPORT (59 lines) 23. Conditional Hiding Form Viewer Components ● Re: Conditional Hiding Form Viewer Components (45 lines) ● Re: Conditional Hiding Form Viewer Components (54 lines) ● Re: Conditional Hiding Form Viewer Components (97 lines) 24. Consistent formatting of numbers ● Consistent formatting of numbers (23 lines) ● Re: Consistent formatting of numbers (35 lines) 25. Correlation to SAS Dataset ● Correlation to SAS Dataset (18 lines) ● Re: Correlation to SAS Dataset (32 lines) ● Re: Correlation to SAS Dataset (17 lines) 26. Counting instances across variables ● Counting instances across variables (27 lines) ● Re: Counting instances across variables (51 lines) ● Re: Counting instances across variables (87 lines) 27. Create an Error ● Create an Error (12 lines) ● Re: Create an Error (21 lines) ● Re: Create an Error (50 lines) 28. Create macro variable to refer to program name - for multiple programs 29. Data Step Question--Flag obs 30. Date Calculation 31. Deploying SAS to client computers - What options do we have? 32. Display Date in the subject line in a SAS generated email - Mainframe 33. Display Date in the subject line in a SAS generated email - Mainframe [SAS-L] ● Re: Display Date in the subject line in a SAS generated email - Mainframe [SAS-L] (77 lines) 34. Divide datasets into sub-datasets based on Variable Value 35. Draw border that seperate group column 36. E-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007 ● E-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007 (65 lines) 37. Error in Passing Parameters in Macros (Urgent) 38. Excel, Word, DDE and Paste ● Excel, Word, DDE and Paste (213 lines) ● Re: Excel, Word, DDE and Paste (39 lines) ● Re: Excel, Word, DDE and Paste (49 lines) 39. Exit macro 40. Fisher's Exact Test vs Generalized Linear Models 41. Format in Proc SQL ...a syntax question 42. Free Online: Data Mining Intro for Beginners ● Free Online: Data Mining Intro for Beginners (45 lines) 43. Friday humor - list of clinical sas programmer distractions ● Friday humor - list of clinical sas programmer distractions (98 lines) 44. GLM procedure ● GLM procedure (32 lines) ● Re: GLM procedure (43 lines) 45. Generate observations with a specific range of randomly ● Re: Generate observations with a specific range of randomly (57 lines) 46. Generate observations with a specific range of randomly chosen values 47. Google Book Search for SAS Publishing Titles 48. Help: a probelm about X command in a data step! ● Help: a probelm about X command in a data step! (29 lines) 49. Help: a problem about X command in a data step! ● Re: Help: a problem about X command in a data step! (49 lines) 50. How can I copy the whole directory (library XX) to another location using libname ● Re: How can I copy the whole directory (library XX) to another location using libname statement? (38 lines) 51. How could I add multi-hyperlinks automatically in a word ● Re: How could I add multi-hyperlinks automatically in a word (61 lines) 52. How could I add multi-hyperlinks automatically in a word documents? ● How could I add multi-hyperlinks automatically in a word documents? (23 lines) ● Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) 53. How to RANDOMLY split a whole dataset into two sub-dataset? ● Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) ● Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) 54. How to erase a dataset using the command bar? 55. How to randomly split a whole dataset into two sub-dataset? ● Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) 56. How to turn off ods csvall "file download" dialog window ● How to turn off ods csvall "file download" dialog window (15 lines) ● Re: How to turn off ods csvall "file download" dialog window (24 lines) ● Re: How to turn off ods csvall "file download" dialog window (35 lines) 57. Identifying Overlapping Periods 58. Increase P-Value for H-L test in logistic regression ● Increase P-Value for H-L test in logistic regression (27 lines) ● Re: Increase P-Value for H-L test in logistic regression (38 lines) 59. Invoking SAS from non SAS environment! 60. Is it possible to use GEE to model my data? ● Is it possible to use GEE to model my data? (116 lines) 61. Koyck lag specification in cox models ● Koyck lag specification in cox models (14 lines) 62. Largest amount of text that can be placed into a SAS dataset cell? ● Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) ● Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) 63. Linear Trend in Proc Arima ● Linear Trend in Proc Arima (32 lines) ● Re: Linear Trend in Proc Arima (83 lines) 64. Loading data to oracle taking a long time ● Re: Loading data to oracle taking a long time (41 lines) 65. Mapping different scale Survey data ● Re: Mapping different scale Survey data (79 lines) 66. Meta data information 67. Modeling Question--Transforming a Variable ● Re: Modeling Question--Transforming a Variable (177 lines) ● Re: Modeling Question--Transforming a Variable (50 lines) ● Re: Modeling Question--Transforming a Variable (241 lines) 68. Moving to the next line ● Re: Moving to the next line (100 lines) 69. Multinomial Regression? ● Multinomial Regression? (42 lines) ● Re: Multinomial Regression? (59 lines) 70. My "Common Unix Commands" document updated 71. My new book "Saving Time and Money Using SAS" is now available world-wide! ● My new book "Saving Time and Money Using SAS" is now available world-wide! (31 72. Need Map datasets for Australia ● Re: Need Map datasets for Australia (45 lines) 73. Need help in Arrays and do loops 74. Negative duplication 75. Newey-corrected t-stats ● Re: Newey-corrected t-stats (46 lines) 76. OLAP alternatives ● OLAP alternatives (16 lines) ● Re: OLAP alternatives (23 lines) ● Re: OLAP alternatives (30 lines) 77. ORACLE Date Format ● Re: ORACLE Date Format (7 lines) 78. OT - Friday Humor ● Re: OT - Friday Humor (38 lines) ● Re: OT - Friday Humor (42 lines) 79. OT: second french newspaper publish about Sas Institute ● OT: second french newspaper publish about Sas Institute (157 lines) 80. Ordinal logistic regression question on classification table ● Ordinal logistic regression question on classification table (67 lines) 81. Ouput window displays no results 82. PROC GCHART - Pie chart, slice label ● Re: PROC GCHART - Pie chart, slice label (42 lines) 83. PROC LP CPU time %dosfileinfo and %dosfilesize macros added%dosfileinfo and %dosfilesize macros added (15 lines) =?utf-8?B?4pa64pa6R2V0IEZSRUUgU2F0ZWxsaXRlIFRWIG9uIHlvdXIgUEMgb3IgTGFwdG9w4peE4peE?==?utf-8?B? 4pa64pa6R2V0IEZSRUUgU2F0ZWxsaXRlIFRWIG9uIHlvdXIgUEMgb3IgTGFwdG9w4peE4peE?= (17 lines) =?utf-8?B?4pa6V2F0Y2ggRlJFRSBTYXRlbGxpdGUgVFYgb24geW91ciBQQyBvciBMYXB0b3Dil4Q=?==?utf-8?B? 4pa6V2F0Y2ggRlJFRSBTYXRlbGxpdGUgVFYgb24geW91ciBQQyBvciBMYXB0b3Dil4Q=?= (21 lines) =?utf-8?B?4peY4pa6QWNjZXNzIEZSRUUgU2F0ZWxsaXRlIFRWIG9uIHlvdXIgUEMgb3IgTGFwdG9w4peE4peY?==?utf-8?B? 4peY4pa6QWNjZXNzIEZSRUUgU2F0ZWxsaXRlIFRWIG9uIHlvdXIgUEMgb3IgTGFwdG9w4peE4peY?= (21 lines) =?utf-8?B?4peY4pa6RlJFRSBTYXRlbGxpdGUgVFYgb24geW91ciBQQ+KXhOKXmA==?==?utf-8?B? 4peY4pa6RlJFRSBTYXRlbGxpdGUgVFYgb24geW91ciBQQ+KXhOKXmA==?= (18 lines) A DATA MANUPULATION QUESTIONA PROC CONTENTS QUESTIONA simple MACRO question:A variable Sorting ProblemAIC problem in ROBUSTREG. Is bigger better ?AIC problem in ROBUSTREG. Is bigger better ? (85 lines) Re: AIC problem in ROBUSTREG. Is bigger better ? (23 lines) Allison's example page 133 - 136Allison's example page 133 - 136 (169 lines) Re: Allison's example page 133 - 136 (26 lines) Archiving SAS-L-posted codesBasic question, I hope...SAS XML tooRe: Basic question, I hope...SAS XML too (159 lines) Re: Basic question, I hope...SAS XML too (190 lines) CART analysis on SAS enterprise minerCART analysis on SAS enterprise miner (25 lines) CART on SAS enterprise minerCART on SAS enterprise miner (23 lines) Re: CART on SAS enterprise miner (41 lines) Calculating current record minus minimum of previousCalculating current record minus minimum of previous (60 lines) Re: Calculating current record minus minimum of previous (123 lines) Re: Calculating current record minus minimum of previous (129 lines) Case crossover designCase crossover design (28 lines) Change character variable to num variableCollin output in PROC REGCollin output in PROC REG (14 lines) Re: Collin output in PROC REG (24 lines) Re: Collin output in PROC REG (41 lines) Complex survey data analysis questionRe: Complex survey data analysis question (61 lines) Conditional Footnotes-PROC REPORTConditional Footnotes-PROC REPORT (28 lines) Re: Conditional Footnotes-PROC REPORT (59 lines) Conditional Hiding Form Viewer ComponentsRe: Conditional Hiding Form Viewer Components (45 lines) Re: Conditional Hiding Form Viewer Components (54 lines) Re: Conditional Hiding Form Viewer Components (97 lines) Consistent formatting of numbersConsistent formatting of numbers (23 lines) Re: Consistent formatting of numbers (35 lines) Correlation to SAS DatasetCorrelation to SAS Dataset (18 lines) Re: Correlation to SAS Dataset (32 lines) Re: Correlation to SAS Dataset (17 lines) Counting instances across variablesCounting instances across variables (27 lines) Re: Counting instances across variables (51 lines) Re: Counting instances across variables (87 lines) Create an ErrorCreate an Error (12 lines) Re: Create an Error (21 lines) Re: Create an Error (50 lines) Create macro variable to refer to program name - for multiple programsData Step Question--Flag obsDate CalculationDeploying SAS to client computers - What options do we have?Display Date in the subject line in a SAS generated email - MainframeDisplay Date in the subject line in a SAS generated email - Mainframe [SAS-L]Re: Display Date in the subject line in a SAS generated email - Mainframe [SAS-L] (77 lines) Divide datasets into sub-datasets based on Variable ValueDraw border that seperate group columnE-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007E-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007 (65 lines) Error in Passing Parameters in Macros (Urgent)Excel, Word, DDE and PasteExcel, Word, DDE and Paste (213 lines) Re: Excel, Word, DDE and Paste (39 lines) Re: Excel, Word, DDE and Paste (49 lines) Exit macroFisher's Exact Test vs Generalized Linear ModelsFormat in Proc SQL ...a syntax questionFree Online: Data Mining Intro for BeginnersFree Online: Data Mining Intro for Beginners (45 lines) Friday humor - list of clinical sas programmer distractionsFriday humor - list of clinical sas programmer distractions (98 lines) GLM procedureGLM procedure (32 lines) Re: GLM procedure (43 lines) Generate observations with a specific range of randomlyRe: Generate observations with a specific range of randomly (57 lines) Generate observations with a specific range of randomly chosen valuesGoogle Book Search for SAS Publishing TitlesHelp: a probelm about X command in a data step!Help: a probelm about X command in a data step! (29 lines) Help: a problem about X command in a data step!Re: Help: a problem about X command in a data step! (49 lines) How can I copy the whole directory (library XX) to another location using libname statement?Re: How can I copy the whole directory (library XX) to another location using libname statement? (38 lines) How could I add multi-hyperlinks automatically in a wordRe: How could I add multi-hyperlinks automatically in a word (61 lines) How could I add multi-hyperlinks automatically in a word documents?How could I add multi-hyperlinks automatically in a word documents? (23 lines) Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time =?utf-8?B?4pa64pa6R2V0IEZSRUUgU2F0ZWxsaXRlIFRWIG9uIHlvdXIgUEMgb3IgTGFwdG9w4peE4peE?==?utf-8?B?4pa64pa6R2V0IEZSRUUgU2F0ZWxsaXRlIFRWIG9uIHlvdXIgUEMgb3IgTGFwdG9w4peE4peE?= (17 lines) =?utf-8?B? 4pa6V2F0Y2ggRlJFRSBTYXRlbGxpdGUgVFYgb24geW91ciBQQyBvciBMYXB0b3Dil4Q=?==?utf-8?B?4pa6V2F0Y2ggRlJFRSBTYXRlbGxpdGUgVFYgb24geW91ciBQQyBvciBMYXB0b3Dil4Q=?= (21 lines) =?utf-8?B? 4peY4pa6QWNjZXNzIEZSRUUgU2F0ZWxsaXRlIFRWIG9uIHlvdXIgUEMgb3IgTGFwdG9w4peE4peY?==?utf-8?B?4peY4pa6QWNjZXNzIEZSRUUgU2F0ZWxsaXRlIFRWIG9uIHlvdXIgUEMgb3IgTGFwdG9w4peE4peY?= (21 lines) =?utf-8?B? 4peY4pa6RlJFRSBTYXRlbGxpdGUgVFYgb24geW91ciBQQ+KXhOKXmA==?==?utf-8?B?4peY4pa6RlJFRSBTYXRlbGxpdGUgVFYgb24geW91ciBQQ+KXhOKXmA==?= (18 lines) A DATA MANUPULATION QUESTIONA PROC CONTENTS QUESTIONA simple MACRO question:A variable Sorting ProblemAIC problem in ROBUSTREG. Is bigger better ?AIC problem in ROBUSTREG. Is bigger better ? (85 lines) Re: AIC problem in ROBUSTREG. Is bigger better ? (23 lines) Allison's example page 133 - 136Allison's example page 133 - 136 (169 lines) Re: Allison's example page 133 - 136 (26 lines) Archiving SAS-L-posted codesBasic question, I hope...SAS XML tooRe: Basic question, I hope...SAS XML too (159 lines) Re: Basic question, I hope...SAS XML too (190 lines) CART analysis on SAS enterprise minerCART analysis on SAS enterprise miner (25 lines) CART on SAS enterprise minerCART on SAS enterprise miner (23 lines) Re: CART on SAS enterprise miner (41 lines) Calculating current record minus minimum of previousCalculating current record minus minimum of previous (60 lines) Re: Calculating current record minus minimum of previous (123 lines) Re: Calculating current record minus minimum of previous (129 lines) Case crossover designCase crossover design (28 lines) Change character variable to num variableCollin output in PROC REGCollin output in PROC REG (14 lines) Re: Collin output in PROC REG (24 lines) Re: Collin output in PROC REG (41 lines) Complex survey data analysis questionRe: Complex survey data analysis question (61 lines) Conditional Footnotes-PROC REPORTConditional Footnotes-PROC REPORT (28 lines) Re: Conditional Footnotes-PROC REPORT (59 lines) Conditional Hiding Form Viewer ComponentsRe: Conditional Hiding Form Viewer Components (45 lines) Re: Conditional Hiding Form Viewer Components (54 lines) Re: Conditional Hiding Form Viewer Components (97 lines) Consistent formatting of numbersConsistent formatting of numbers (23 lines) Re: Consistent formatting of numbers (35 lines) Correlation to SAS DatasetCorrelation to SAS Dataset (18 lines) Re: Correlation to SAS Dataset (32 lines) Re: Correlation to SAS Dataset (17 lines) Counting instances across variablesCounting instances across variables (27 lines) Re: Counting instances across variables (51 lines) Re: Counting instances across variables (87 lines) Create an ErrorCreate an Error (12 lines) Re: Create an Error (21 lines) Re: Create an Error (50 lines) Create macro variable to refer to program name - for multiple programsData Step Question--Flag obsDate CalculationDeploying SAS to client computers - What options do we have?Display Date in the subject line in a SAS generated email - MainframeDisplay Date in the subject line in a SAS generated email - Mainframe [SAS-L]Re: Display Date in the subject line in a SAS generated email - Mainframe [SAS-L] (77 lines) Divide datasets into sub-datasets based on Variable ValueDraw border that seperate group columnE-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007E-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007 (65 lines) Error in Passing Parameters in Macros (Urgent)Excel, Word, DDE and PasteExcel, Word, DDE and Paste (213 lines) Re: Excel, Word, DDE and Paste (39 lines) Re: Excel, Word, DDE and Paste (49 lines) Exit macroFisher's Exact Test vs Generalized Linear ModelsFormat in Proc SQL ...a syntax questionFree Online: Data Mining Intro for BeginnersFree Online: Data Mining Intro for Beginners (45 lines) Friday humor - list of clinical sas programmer distractionsFriday humor - list of clinical sas programmer distractions (98 lines) GLM procedureGLM procedure (32 lines) Re: GLM procedure (43 lines) Generate observations with a specific range of randomlyRe: Generate observations with a specific range of randomly (57 lines) Generate observations with a specific range of randomly chosen valuesGoogle Book Search for SAS Publishing TitlesHelp: a probelm about X command in a data step!Help: a probelm about X command in a data step! (29 lines) Help: a problem about X command in a data step!Re: Help: a problem about X command in a data step! (49 lines) How can I copy the whole directory (library XX) to another location using libname statement?Re: How can I copy the whole directory (library XX) to another location using libname statement? (38 lines) How could I add multi-hyperlinks automatically in a wordRe: How could I add multi-hyperlinks automatically in a word (61 lines) How could I add multi-hyperlinks automatically in a word documents?How could I add multi-hyperlinks automatically in a word documents? (23 lines) Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time =?utf-8?B?4pa6V2F0Y2ggRlJFRSBTYXRlbGxpdGUgVFYgb24geW91ciBQQyBvciBMYXB0b3Dil4Q=?==?utf-8?B?4pa6V2F0Y2ggRlJFRSBTYXRlbGxpdGUgVFYgb24geW91ciBQQyBvciBMYXB0b3Dil4Q=?= (21 lines) =?utf-8?B? 4peY4pa6QWNjZXNzIEZSRUUgU2F0ZWxsaXRlIFRWIG9uIHlvdXIgUEMgb3IgTGFwdG9w4peE4peY?==?utf-8?B?4peY4pa6QWNjZXNzIEZSRUUgU2F0ZWxsaXRlIFRWIG9uIHlvdXIgUEMgb3IgTGFwdG9w4peE4peY?= (21 lines) =?utf-8?B? 4peY4pa6RlJFRSBTYXRlbGxpdGUgVFYgb24geW91ciBQQ+KXhOKXmA==?==?utf-8?B?4peY4pa6RlJFRSBTYXRlbGxpdGUgVFYgb24geW91ciBQQ+KXhOKXmA==?= (18 lines) A DATA MANUPULATION QUESTIONA PROC CONTENTS QUESTIONA simple MACRO question:A variable Sorting ProblemAIC problem in ROBUSTREG. Is bigger better ?AIC problem in ROBUSTREG. Is bigger better ? (85 lines) Re: AIC problem in ROBUSTREG. Is bigger better ? (23 lines) Allison's example page 133 - 136Allison's example page 133 - 136 (169 lines) Re: Allison's example page 133 - 136 (26 lines) Archiving SAS-L-posted codesBasic question, I hope...SAS XML tooRe: Basic question, I hope...SAS XML too (159 lines) Re: Basic question, I hope...SAS XML too (190 lines) CART analysis on SAS enterprise minerCART analysis on SAS enterprise miner (25 lines) CART on SAS enterprise minerCART on SAS enterprise miner (23 lines) Re: CART on SAS enterprise miner (41 lines) Calculating current record minus minimum of previousCalculating current record minus minimum of previous (60 lines) Re: Calculating current record minus minimum of previous (123 lines) Re: Calculating current record minus minimum of previous (129 lines) Case crossover designCase crossover design (28 lines) Change character variable to num variableCollin output in PROC REGCollin output in PROC REG (14 lines) Re: Collin output in PROC REG (24 lines) Re: Collin output in PROC REG (41 lines) Complex survey data analysis questionRe: Complex survey data analysis question (61 lines) Conditional Footnotes-PROC REPORTConditional Footnotes-PROC REPORT (28 lines) Re: Conditional Footnotes-PROC REPORT (59 lines) Conditional Hiding Form Viewer ComponentsRe: Conditional Hiding Form Viewer Components (45 lines) Re: Conditional Hiding Form Viewer Components (54 lines) Re: Conditional Hiding Form Viewer Components (97 lines) Consistent formatting of numbersConsistent formatting of numbers (23 lines) Re: Consistent formatting of numbers (35 lines) Correlation to SAS DatasetCorrelation to SAS Dataset (18 lines) Re: Correlation to SAS Dataset (32 lines) Re: Correlation to SAS Dataset (17 lines) Counting instances across variablesCounting instances across variables (27 lines) Re: Counting instances across variables (51 lines) Re: Counting instances across variables (87 lines) Create an ErrorCreate an Error (12 lines) Re: Create an Error (21 lines) Re: Create an Error (50 lines) Create macro variable to refer to program name - for multiple programsData Step Question--Flag obsDate CalculationDeploying SAS to client computers - What options do we have?Display Date in the subject line in a SAS generated email - MainframeDisplay Date in the subject line in a SAS generated email - Mainframe [SAS-L]Re: Display Date in the subject line in a SAS generated email - Mainframe [SAS-L] (77 lines) Divide datasets into sub-datasets based on Variable ValueDraw border that seperate group columnE-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007E-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007 (65 lines) Error in Passing Parameters in Macros (Urgent)Excel, Word, DDE and PasteExcel, Word, DDE and Paste (213 lines) Re: Excel, Word, DDE and Paste (39 lines) Re: Excel, Word, DDE and Paste (49 lines) Exit macroFisher's Exact Test vs Generalized Linear ModelsFormat in Proc SQL ...a syntax questionFree Online: Data Mining Intro for BeginnersFree Online: Data Mining Intro for Beginners (45 lines) Friday humor - list of clinical sas programmer distractionsFriday humor - list of clinical sas programmer distractions (98 lines) GLM procedureGLM procedure (32 lines) Re: GLM procedure (43 lines) Generate observations with a specific range of randomlyRe: Generate observations with a specific range of randomly (57 lines) Generate observations with a specific range of randomly chosen valuesGoogle Book Search for SAS Publishing TitlesHelp: a probelm about X command in a data step!Help: a probelm about X command in a data step! (29 lines) Help: a problem about X command in a data step!Re: Help: a problem about X command in a data step! (49 lines) How can I copy the whole directory (library XX) to another location using libname statement?Re: How can I copy the whole directory (library XX) to another location using libname statement? (38 lines) How could I add multi-hyperlinks automatically in a wordRe: How could I add multi-hyperlinks automatically in a word (61 lines) How could I add multi-hyperlinks automatically in a word documents?How could I add multi-hyperlinks automatically in a word documents? (23 lines) Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time =?utf-8?B?4peY4pa6QWNjZXNzIEZSRUUgU2F0ZWxsaXRlIFRWIG9uIHlvdXIgUEMgb3IgTGFwdG9w4peE4peY?==?utf-8?B?4peY4pa6QWNjZXNzIEZSRUUgU2F0ZWxsaXRlIFRWIG9uIHlvdXIgUEMgb3IgTGFwdG9w4peE4peY?= (21 lines) =?utf-8?B? 4peY4pa6RlJFRSBTYXRlbGxpdGUgVFYgb24geW91ciBQQ+KXhOKXmA==?==?utf-8?B?4peY4pa6RlJFRSBTYXRlbGxpdGUgVFYgb24geW91ciBQQ+KXhOKXmA==?= (18 lines) A DATA MANUPULATION QUESTIONA PROC CONTENTS QUESTIONA simple MACRO question:A variable Sorting ProblemAIC problem in ROBUSTREG. Is bigger better ?AIC problem in ROBUSTREG. Is bigger better ? (85 lines) Re: AIC problem in ROBUSTREG. Is bigger better ? (23 lines) Allison's example page 133 - 136Allison's example page 133 - 136 (169 lines) Re: Allison's example page 133 - 136 (26 lines) Archiving SAS-L-posted codesBasic question, I hope...SAS XML tooRe: Basic question, I hope...SAS XML too (159 lines) Re: Basic question, I hope...SAS XML too (190 lines) CART analysis on SAS enterprise minerCART analysis on SAS enterprise miner (25 lines) CART on SAS enterprise minerCART on SAS enterprise miner (23 lines) Re: CART on SAS enterprise miner (41 lines) Calculating current record minus minimum of previousCalculating current record minus minimum of previous (60 lines) Re: Calculating current record minus minimum of previous (123 lines) Re: Calculating current record minus minimum of previous (129 lines) Case crossover designCase crossover design (28 lines) Change character variable to num variableCollin output in PROC REGCollin output in PROC REG (14 lines) Re: Collin output in PROC REG (24 lines) Re: Collin output in PROC REG (41 lines) Complex survey data analysis questionRe: Complex survey data analysis question (61 lines) Conditional Footnotes-PROC REPORTConditional Footnotes-PROC REPORT (28 lines) Re: Conditional Footnotes-PROC REPORT (59 lines) Conditional Hiding Form Viewer ComponentsRe: Conditional Hiding Form Viewer Components (45 lines) Re: Conditional Hiding Form Viewer Components (54 lines) Re: Conditional Hiding Form Viewer Components (97 lines) Consistent formatting of numbersConsistent formatting of numbers (23 lines) Re: Consistent formatting of numbers (35 lines) Correlation to SAS DatasetCorrelation to SAS Dataset (18 lines) Re: Correlation to SAS Dataset (32 lines) Re: Correlation to SAS Dataset (17 lines) Counting instances across variablesCounting instances across variables (27 lines) Re: Counting instances across variables (51 lines) Re: Counting instances across variables (87 lines) Create an ErrorCreate an Error (12 lines) Re: Create an Error (21 lines) Re: Create an Error (50 lines) Create macro variable to refer to program name - for multiple programsData Step Question--Flag obsDate CalculationDeploying SAS to client computers - What options do we have?Display Date in the subject line in a SAS generated email - MainframeDisplay Date in the subject line in a SAS generated email - Mainframe [SAS-L]Re: Display Date in the subject line in a SAS generated email - Mainframe [SAS-L] (77 lines) Divide datasets into sub-datasets based on Variable ValueDraw border that seperate group columnE-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007E-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007 (65 lines) Error in Passing Parameters in Macros (Urgent)Excel, Word, DDE and PasteExcel, Word, DDE and Paste (213 lines) Re: Excel, Word, DDE and Paste (39 lines) Re: Excel, Word, DDE and Paste (49 lines) Exit macroFisher's Exact Test vs Generalized Linear ModelsFormat in Proc SQL ...a syntax questionFree Online: Data Mining Intro for BeginnersFree Online: Data Mining Intro for Beginners (45 lines) Friday humor - list of clinical sas programmer distractionsFriday humor - list of clinical sas programmer distractions (98 lines) GLM procedureGLM procedure (32 lines) Re: GLM procedure (43 lines) Generate observations with a specific range of randomlyRe: Generate observations with a specific range of randomly (57 lines) Generate observations with a specific range of randomly chosen valuesGoogle Book Search for SAS Publishing TitlesHelp: a probelm about X command in a data step!Help: a probelm about X command in a data step! (29 lines) Help: a problem about X command in a data step!Re: Help: a problem about X command in a data step! (49 lines) How can I copy the whole directory (library XX) to another location using libname statement?Re: How can I copy the whole directory (library XX) to another location using libname statement? (38 lines) How could I add multi-hyperlinks automatically in a wordRe: How could I add multi-hyperlinks automatically in a word (61 lines) How could I add multi-hyperlinks automatically in a word documents?How could I add multi-hyperlinks automatically in a word documents? (23 lines) Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time =?utf-8?B?4peY4pa6RlJFRSBTYXRlbGxpdGUgVFYgb24geW91ciBQQ+KXhOKXmA==?==?utf-8?B?4peY4pa6RlJFRSBTYXRlbGxpdGUgVFYgb24geW91ciBQQ+KXhOKXmA==?= (18 lines) A DATA MANUPULATION QUESTIONA PROC CONTENTS QUESTIONA simple MACRO question:A variable Sorting ProblemAIC problem in ROBUSTREG. Is bigger better ?AIC problem in ROBUSTREG. Is bigger better ? (85 lines) Re: AIC problem in ROBUSTREG. Is bigger better ? (23 lines) Allison's example page 133 - 136Allison's example page 133 - 136 (169 lines) Re: Allison's example page 133 - 136 (26 lines) Archiving SAS-L-posted codesBasic question, I hope...SAS XML tooRe: Basic question, I hope...SAS XML too (159 lines) Re: Basic question, I hope...SAS XML too (190 lines) CART analysis on SAS enterprise minerCART analysis on SAS enterprise miner (25 lines) CART on SAS enterprise minerCART on SAS enterprise miner (23 lines) Re: CART on SAS enterprise miner (41 lines) Calculating current record minus minimum of previousCalculating current record minus minimum of previous (60 lines) Re: Calculating current record minus minimum of previous (123 lines) Re: Calculating current record minus minimum of previous (129 lines) Case crossover designCase crossover design (28 lines) Change character variable to num variableCollin output in PROC REGCollin output in PROC REG (14 lines) Re: Collin output in PROC REG (24 lines) Re: Collin output in PROC REG (41 lines) Complex survey data analysis questionRe: Complex survey data analysis question (61 lines) Conditional Footnotes-PROC REPORTConditional Footnotes-PROC REPORT (28 lines) Re: Conditional Footnotes-PROC REPORT (59 lines) Conditional Hiding Form Viewer ComponentsRe: Conditional Hiding Form Viewer Components (45 lines) Re: Conditional Hiding Form Viewer Components (54 lines) Re: Conditional Hiding Form Viewer Components (97 lines) Consistent formatting of numbersConsistent formatting of numbers (23 lines) Re: Consistent formatting of numbers (35 lines) Correlation to SAS DatasetCorrelation to SAS Dataset (18 lines) Re: Correlation to SAS Dataset (32 lines) Re: Correlation to SAS Dataset (17 lines) Counting instances across variablesCounting instances across variables (27 lines) Re: Counting instances across variables (51 lines) Re: Counting instances across variables (87 lines) Create an ErrorCreate an Error (12 lines) Re: Create an Error (21 lines) Re: Create an Error (50 lines) Create macro variable to refer to program name - for multiple programsData Step Question--Flag obsDate CalculationDeploying SAS to client computers - What options do we have?Display Date in the subject line in a SAS generated email - MainframeDisplay Date in the subject line in a SAS generated email - Mainframe [SAS-L]Re: Display Date in the subject line in a SAS generated email - Mainframe [SAS-L] (77 lines) Divide datasets into sub-datasets based on Variable ValueDraw border that seperate group columnE-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007E-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007 (65 lines) Error in Passing Parameters in Macros (Urgent)Excel, Word, DDE and PasteExcel, Word, DDE and Paste (213 lines) Re: Excel, Word, DDE and Paste (39 lines) Re: Excel, Word, DDE and Paste (49 lines) Exit macroFisher's Exact Test vs Generalized Linear ModelsFormat in Proc SQL ...a syntax questionFree Online: Data Mining Intro for BeginnersFree Online: Data Mining Intro for Beginners (45 lines) Friday humor - list of clinical sas programmer distractionsFriday humor - list of clinical sas programmer distractions (98 lines) GLM procedureGLM procedure (32 lines) Re: GLM procedure (43 lines) Generate observations with a specific range of randomlyRe: Generate observations with a specific range of randomly (57 lines) Generate observations with a specific range of randomly chosen valuesGoogle Book Search for SAS Publishing TitlesHelp: a probelm about X command in a data step!Help: a probelm about X command in a data step! (29 lines) Help: a problem about X command in a data step!Re: Help: a problem about X command in a data step! (49 lines) How can I copy the whole directory (library XX) to another location using libname statement?Re: How can I copy the whole directory (library XX) to another location using libname statement? (38 lines) How could I add multi-hyperlinks automatically in a wordRe: How could I add multi-hyperlinks automatically in a word (61 lines) How could I add multi-hyperlinks automatically in a word documents?How could I add multi-hyperlinks automatically in a word documents? (23 lines) Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time A DATA MANUPULATION QUESTIONA PROC CONTENTS QUESTIONA simple MACRO question:A variable Sorting ProblemAIC problem in ROBUSTREG. Is bigger better ?AIC problem in ROBUSTREG. Is bigger better ? (85 lines) Re: AIC problem in ROBUSTREG. Is bigger better ? (23 lines) Allison's example page 133 - 136Allison's example page 133 - 136 (169 lines) Re: Allison's example page 133 - 136 (26 lines) Archiving SAS-L-posted codesBasic question, I hope...SAS XML tooRe: Basic question, I hope...SAS XML too (159 lines) Re: Basic question, I hope...SAS XML too (190 lines) CART analysis on SAS enterprise minerCART analysis on SAS enterprise miner (25 lines) CART on SAS enterprise minerCART on SAS enterprise miner (23 lines) Re: CART on SAS enterprise miner (41 lines) Calculating current record minus minimum of previousCalculating current record minus minimum of previous (60 lines) Re: Calculating current record minus minimum of previous (123 lines) Re: Calculating current record minus minimum of previous (129 lines) Case crossover designCase crossover design (28 lines) Change character variable to num variableCollin output in PROC REGCollin output in PROC REG (14 lines) Re: Collin output in PROC REG (24 lines) Re: Collin output in PROC REG (41 lines) Complex survey data analysis questionRe: Complex survey data analysis question (61 lines) Conditional Footnotes-PROC REPORTConditional Footnotes-PROC REPORT (28 lines) Re: Conditional Footnotes-PROC REPORT (59 lines) Conditional Hiding Form Viewer ComponentsRe: Conditional Hiding Form Viewer Components (45 lines) Re: Conditional Hiding Form Viewer Components (54 lines) Re: Conditional Hiding Form Viewer Components (97 lines) Consistent formatting of numbersConsistent formatting of numbers (23 lines) Re: Consistent formatting of numbers (35 lines) Correlation to SAS DatasetCorrelation to SAS Dataset (18 lines) Re: Correlation to SAS Dataset (32 lines) Re: Correlation to SAS Dataset (17 lines) Counting instances across variablesCounting instances across variables (27 lines) Re: Counting instances across variables (51 lines) Re: Counting instances across variables (87 lines) Create an ErrorCreate an Error (12 lines) Re: Create an Error (21 lines) Re: Create an Error (50 lines) Create macro variable to refer to program name - for multiple programsData Step Question--Flag obsDate CalculationDeploying SAS to client computers - What options do we have?Display Date in the subject line in a SAS generated email - MainframeDisplay Date in the subject line in a SAS generated email - Mainframe [SAS-L]Re: Display Date in the subject line in a SAS generated email - Mainframe [SAS-L] (77 lines) Divide datasets into sub-datasets based on Variable ValueDraw border that seperate group columnE-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007E-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007 (65 lines) Error in Passing Parameters in Macros (Urgent)Excel, Word, DDE and PasteExcel, Word, DDE and Paste (213 lines) Re: Excel, Word, DDE and Paste (39 lines) Re: Excel, Word, DDE and Paste (49 lines) Exit macroFisher's Exact Test vs Generalized Linear ModelsFormat in Proc SQL ...a syntax questionFree Online: Data Mining Intro for BeginnersFree Online: Data Mining Intro for Beginners (45 lines) Friday humor - list of clinical sas programmer distractionsFriday humor - list of clinical sas programmer distractions (98 lines) GLM procedureGLM procedure (32 lines) Re: GLM procedure (43 lines) Generate observations with a specific range of randomlyRe: Generate observations with a specific range of randomly (57 lines) Generate observations with a specific range of randomly chosen valuesGoogle Book Search for SAS Publishing TitlesHelp: a probelm about X command in a data step!Help: a probelm about X command in a data step! (29 lines) Help: a problem about X command in a data step!Re: Help: a problem about X command in a data step! (49 lines) How can I copy the whole directory (library XX) to another location using libname statement?Re: How can I copy the whole directory (library XX) to another location using libname statement? (38 lines) How could I add multi-hyperlinks automatically in a wordRe: How could I add multi-hyperlinks automatically in a word (61 lines) How could I add multi-hyperlinks automatically in a word documents?How could I add multi-hyperlinks automatically in a word documents? (23 lines) Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time A PROC CONTENTS QUESTIONA simple MACRO question:A variable Sorting ProblemAIC problem in ROBUSTREG. Is bigger better ?AIC problem in ROBUSTREG. Is bigger better ? (85 lines) Re: AIC problem in ROBUSTREG. Is bigger better ? (23 lines) Allison's example page 133 - 136Allison's example page 133 - 136 (169 lines) Re: Allison's example page 133 - 136 (26 lines) Archiving SAS-L-posted codesBasic question, I hope...SAS XML tooRe: Basic question, I hope...SAS XML too (159 lines) Re: Basic question, I hope...SAS XML too (190 lines) CART analysis on SAS enterprise minerCART analysis on SAS enterprise miner (25 lines) CART on SAS enterprise minerCART on SAS enterprise miner (23 lines) Re: CART on SAS enterprise miner (41 lines) Calculating current record minus minimum of previousCalculating current record minus minimum of previous (60 lines) Re: Calculating current record minus minimum of previous (123 lines) Re: Calculating current record minus minimum of previous (129 lines) Case crossover designCase crossover design (28 lines) Change character variable to num variableCollin output in PROC REGCollin output in PROC REG (14 lines) Re: Collin output in PROC REG (24 lines) Re: Collin output in PROC REG (41 lines) Complex survey data analysis questionRe: Complex survey data analysis question (61 lines) Conditional Footnotes-PROC REPORTConditional Footnotes-PROC REPORT (28 lines) Re: Conditional Footnotes-PROC REPORT (59 lines) Conditional Hiding Form Viewer ComponentsRe: Conditional Hiding Form Viewer Components (45 lines) Re: Conditional Hiding Form Viewer Components (54 lines) Re: Conditional Hiding Form Viewer Components (97 lines) Consistent formatting of numbersConsistent formatting of numbers (23 lines) Re: Consistent formatting of numbers (35 lines) Correlation to SAS DatasetCorrelation to SAS Dataset (18 lines) Re: Correlation to SAS Dataset (32 lines) Re: Correlation to SAS Dataset (17 lines) Counting instances across variablesCounting instances across variables (27 lines) Re: Counting instances across variables (51 lines) Re: Counting instances across variables (87 lines) Create an ErrorCreate an Error (12 lines) Re: Create an Error (21 lines) Re: Create an Error (50 lines) Create macro variable to refer to program name - for multiple programsData Step Question--Flag obsDate CalculationDeploying SAS to client computers - What options do we have?Display Date in the subject line in a SAS generated email - MainframeDisplay Date in the subject line in a SAS generated email - Mainframe [SAS-L]Re: Display Date in the subject line in a SAS generated email - Mainframe [SAS-L] (77 lines) Divide datasets into sub-datasets based on Variable ValueDraw border that seperate group columnE-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007E-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007 (65 lines) Error in Passing Parameters in Macros (Urgent)Excel, Word, DDE and PasteExcel, Word, DDE and Paste (213 lines) Re: Excel, Word, DDE and Paste (39 lines) Re: Excel, Word, DDE and Paste (49 lines) Exit macroFisher's Exact Test vs Generalized Linear ModelsFormat in Proc SQL ...a syntax questionFree Online: Data Mining Intro for BeginnersFree Online: Data Mining Intro for Beginners (45 lines) Friday humor - list of clinical sas programmer distractionsFriday humor - list of clinical sas programmer distractions (98 lines) GLM procedureGLM procedure (32 lines) Re: GLM procedure (43 lines) Generate observations with a specific range of randomlyRe: Generate observations with a specific range of randomly (57 lines) Generate observations with a specific range of randomly chosen valuesGoogle Book Search for SAS Publishing TitlesHelp: a probelm about X command in a data step!Help: a probelm about X command in a data step! (29 lines) Help: a problem about X command in a data step!Re: Help: a problem about X command in a data step! (49 lines) How can I copy the whole directory (library XX) to another location using libname statement?Re: How can I copy the whole directory (library XX) to another location using libname statement? (38 lines) How could I add multi-hyperlinks automatically in a wordRe: How could I add multi-hyperlinks automatically in a word (61 lines) How could I add multi-hyperlinks automatically in a word documents?How could I add multi-hyperlinks automatically in a word documents? (23 lines) Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time A simple MACRO question:A variable Sorting ProblemAIC problem in ROBUSTREG. Is bigger better ?AIC problem in ROBUSTREG. Is bigger better ? (85 lines) Re: AIC problem in ROBUSTREG. Is bigger better ? (23 lines) Allison's example page 133 - 136Allison's example page 133 - 136 (169 lines) Re: Allison's example page 133 - 136 (26 lines) Archiving SAS-L-posted codesBasic question, I hope...SAS XML tooRe: Basic question, I hope...SAS XML too (159 lines) Re: Basic question, I hope...SAS XML too (190 lines) CART analysis on SAS enterprise minerCART analysis on SAS enterprise miner (25 lines) CART on SAS enterprise minerCART on SAS enterprise miner (23 lines) Re: CART on SAS enterprise miner (41 lines) Calculating current record minus minimum of previousCalculating current record minus minimum of previous (60 lines) Re: Calculating current record minus minimum of previous (123 lines) Re: Calculating current record minus minimum of previous (129 lines) Case crossover designCase crossover design (28 lines) Change character variable to num variableCollin output in PROC REGCollin output in PROC REG (14 lines) Re: Collin output in PROC REG (24 lines) Re: Collin output in PROC REG (41 lines) Complex survey data analysis questionRe: Complex survey data analysis question (61 lines) Conditional Footnotes-PROC REPORTConditional Footnotes-PROC REPORT (28 lines) Re: Conditional Footnotes-PROC REPORT (59 lines) Conditional Hiding Form Viewer ComponentsRe: Conditional Hiding Form Viewer Components (45 lines) Re: Conditional Hiding Form Viewer Components (54 lines) Re: Conditional Hiding Form Viewer Components (97 lines) Consistent formatting of numbersConsistent formatting of numbers (23 lines) Re: Consistent formatting of numbers (35 lines) Correlation to SAS DatasetCorrelation to SAS Dataset (18 lines) Re: Correlation to SAS Dataset (32 lines) Re: Correlation to SAS Dataset (17 lines) Counting instances across variablesCounting instances across variables (27 lines) Re: Counting instances across variables (51 lines) Re: Counting instances across variables (87 lines) Create an ErrorCreate an Error (12 lines) Re: Create an Error (21 lines) Re: Create an Error (50 lines) Create macro variable to refer to program name - for multiple programsData Step Question--Flag obsDate CalculationDeploying SAS to client computers - What options do we have?Display Date in the subject line in a SAS generated email - MainframeDisplay Date in the subject line in a SAS generated email - Mainframe [SAS-L]Re: Display Date in the subject line in a SAS generated email - Mainframe [SAS-L] (77 lines) Divide datasets into sub-datasets based on Variable ValueDraw border that seperate group columnE-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007E-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007 (65 lines) Error in Passing Parameters in Macros (Urgent)Excel, Word, DDE and PasteExcel, Word, DDE and Paste (213 lines) Re: Excel, Word, DDE and Paste (39 lines) Re: Excel, Word, DDE and Paste (49 lines) Exit macroFisher's Exact Test vs Generalized Linear ModelsFormat in Proc SQL ...a syntax questionFree Online: Data Mining Intro for BeginnersFree Online: Data Mining Intro for Beginners (45 lines) Friday humor - list of clinical sas programmer distractionsFriday humor - list of clinical sas programmer distractions (98 lines) GLM procedureGLM procedure (32 lines) Re: GLM procedure (43 lines) Generate observations with a specific range of randomlyRe: Generate observations with a specific range of randomly (57 lines) Generate observations with a specific range of randomly chosen valuesGoogle Book Search for SAS Publishing TitlesHelp: a probelm about X command in a data step!Help: a probelm about X command in a data step! (29 lines) Help: a problem about X command in a data step!Re: Help: a problem about X command in a data step! (49 lines) How can I copy the whole directory (library XX) to another location using libname statement?Re: How can I copy the whole directory (library XX) to another location using libname statement? (38 lines) How could I add multi-hyperlinks automatically in a wordRe: How could I add multi-hyperlinks automatically in a word (61 lines) How could I add multi-hyperlinks automatically in a word documents?How could I add multi-hyperlinks automatically in a word documents? (23 lines) Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time A variable Sorting ProblemAIC problem in ROBUSTREG. Is bigger better ?AIC problem in ROBUSTREG. Is bigger better ? (85 lines) Re: AIC problem in ROBUSTREG. Is bigger better ? (23 lines) Allison's example page 133 - 136Allison's example page 133 - 136 (169 lines) Re: Allison's example page 133 - 136 (26 lines) Archiving SAS-L-posted codesBasic question, I hope...SAS XML tooRe: Basic question, I hope...SAS XML too (159 lines) Re: Basic question, I hope...SAS XML too (190 lines) CART analysis on SAS enterprise minerCART analysis on SAS enterprise miner (25 lines) CART on SAS enterprise minerCART on SAS enterprise miner (23 lines) Re: CART on SAS enterprise miner (41 lines) Calculating current record minus minimum of previousCalculating current record minus minimum of previous (60 lines) Re: Calculating current record minus minimum of previous (123 lines) Re: Calculating current record minus minimum of previous (129 lines) Case crossover designCase crossover design (28 lines) Change character variable to num variableCollin output in PROC REGCollin output in PROC REG (14 lines) Re: Collin output in PROC REG (24 lines) Re: Collin output in PROC REG (41 lines) Complex survey data analysis questionRe: Complex survey data analysis question (61 lines) Conditional Footnotes-PROC REPORTConditional Footnotes-PROC REPORT (28 lines) Re: Conditional Footnotes-PROC REPORT (59 lines) Conditional Hiding Form Viewer ComponentsRe: Conditional Hiding Form Viewer Components (45 lines) Re: Conditional Hiding Form Viewer Components (54 lines) Re: Conditional Hiding Form Viewer Components (97 lines) Consistent formatting of numbersConsistent formatting of numbers (23 lines) Re: Consistent formatting of numbers (35 lines) Correlation to SAS DatasetCorrelation to SAS Dataset (18 lines) Re: Correlation to SAS Dataset (32 lines) Re: Correlation to SAS Dataset (17 lines) Counting instances across variablesCounting instances across variables (27 lines) Re: Counting instances across variables (51 lines) Re: Counting instances across variables (87 lines) Create an ErrorCreate an Error (12 lines) Re: Create an Error (21 lines) Re: Create an Error (50 lines) Create macro variable to refer to program name - for multiple programsData Step Question--Flag obsDate CalculationDeploying SAS to client computers - What options do we have?Display Date in the subject line in a SAS generated email - MainframeDisplay Date in the subject line in a SAS generated email - Mainframe [SAS-L]Re: Display Date in the subject line in a SAS generated email - Mainframe [SAS-L] (77 lines) Divide datasets into sub-datasets based on Variable ValueDraw border that seperate group columnE-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007E-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007 (65 lines) Error in Passing Parameters in Macros (Urgent)Excel, Word, DDE and PasteExcel, Word, DDE and Paste (213 lines) Re: Excel, Word, DDE and Paste (39 lines) Re: Excel, Word, DDE and Paste (49 lines) Exit macroFisher's Exact Test vs Generalized Linear ModelsFormat in Proc SQL ...a syntax questionFree Online: Data Mining Intro for BeginnersFree Online: Data Mining Intro for Beginners (45 lines) Friday humor - list of clinical sas programmer distractionsFriday humor - list of clinical sas programmer distractions (98 lines) GLM procedureGLM procedure (32 lines) Re: GLM procedure (43 lines) Generate observations with a specific range of randomlyRe: Generate observations with a specific range of randomly (57 lines) Generate observations with a specific range of randomly chosen valuesGoogle Book Search for SAS Publishing TitlesHelp: a probelm about X command in a data step!Help: a probelm about X command in a data step! (29 lines) Help: a problem about X command in a data step!Re: Help: a problem about X command in a data step! (49 lines) How can I copy the whole directory (library XX) to another location using libname statement?Re: How can I copy the whole directory (library XX) to another location using libname statement? (38 lines) How could I add multi-hyperlinks automatically in a wordRe: How could I add multi-hyperlinks automatically in a word (61 lines) How could I add multi-hyperlinks automatically in a word documents?How could I add multi-hyperlinks automatically in a word documents? (23 lines) Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time AIC problem in ROBUSTREG. Is bigger better ?AIC problem in ROBUSTREG. Is bigger better ? (85 lines) Re: AIC problem in ROBUSTREG. Is bigger better ? (23 lines) Allison's example page 133 - 136Allison's example page 133 - 136 (169 lines) Re: Allison's example page 133 - 136 (26 lines) Archiving SAS-L-posted codesBasic question, I hope...SAS XML tooRe: Basic question, I hope...SAS XML too (159 lines) Re: Basic question, I hope...SAS XML too (190 lines) CART analysis on SAS enterprise minerCART analysis on SAS enterprise miner (25 lines) CART on SAS enterprise minerCART on SAS enterprise miner (23 lines) Re: CART on SAS enterprise miner (41 lines) Calculating current record minus minimum of previousCalculating current record minus minimum of previous (60 lines) Re: Calculating current record minus minimum of previous (123 lines) Re: Calculating current record minus minimum of previous (129 lines) Case crossover designCase crossover design (28 lines) Change character variable to num variableCollin output in PROC REGCollin output in PROC REG (14 lines) Re: Collin output in PROC REG (24 lines) Re: Collin output in PROC REG (41 lines) Complex survey data analysis questionRe: Complex survey data analysis question (61 lines) Conditional Footnotes-PROC REPORTConditional Footnotes-PROC REPORT (28 lines) Re: Conditional Footnotes-PROC REPORT (59 lines) Conditional Hiding Form Viewer ComponentsRe: Conditional Hiding Form Viewer Components (45 lines) Re: Conditional Hiding Form Viewer Components (54 lines) Re: Conditional Hiding Form Viewer Components (97 lines) Consistent formatting of numbersConsistent formatting of numbers (23 lines) Re: Consistent formatting of numbers (35 lines) Correlation to SAS DatasetCorrelation to SAS Dataset (18 lines) Re: Correlation to SAS Dataset (32 lines) Re: Correlation to SAS Dataset (17 lines) Counting instances across variablesCounting instances across variables (27 lines) Re: Counting instances across variables (51 lines) Re: Counting instances across variables (87 lines) Create an ErrorCreate an Error (12 lines) Re: Create an Error (21 lines) Re: Create an Error (50 lines) Create macro variable to refer to program name - for multiple programsData Step Question--Flag obsDate CalculationDeploying SAS to client computers - What options do we have?Display Date in the subject line in a SAS generated email - MainframeDisplay Date in the subject line in a SAS generated email - Mainframe [SAS-L]Re: Display Date in the subject line in a SAS generated email - Mainframe [SAS-L] (77 lines) Divide datasets into sub-datasets based on Variable ValueDraw border that seperate group columnE-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007E-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007 (65 lines) Error in Passing Parameters in Macros (Urgent)Excel, Word, DDE and PasteExcel, Word, DDE and Paste (213 lines) Re: Excel, Word, DDE and Paste (39 lines) Re: Excel, Word, DDE and Paste (49 lines) Exit macroFisher's Exact Test vs Generalized Linear ModelsFormat in Proc SQL ...a syntax questionFree Online: Data Mining Intro for BeginnersFree Online: Data Mining Intro for Beginners (45 lines) Friday humor - list of clinical sas programmer distractionsFriday humor - list of clinical sas programmer distractions (98 lines) GLM procedureGLM procedure (32 lines) Re: GLM procedure (43 lines) Generate observations with a specific range of randomlyRe: Generate observations with a specific range of randomly (57 lines) Generate observations with a specific range of randomly chosen valuesGoogle Book Search for SAS Publishing TitlesHelp: a probelm about X command in a data step!Help: a probelm about X command in a data step! (29 lines) Help: a problem about X command in a data step!Re: Help: a problem about X command in a data step! (49 lines) How can I copy the whole directory (library XX) to another location using libname statement?Re: How can I copy the whole directory (library XX) to another location using libname statement? (38 lines) How could I add multi-hyperlinks automatically in a wordRe: How could I add multi-hyperlinks automatically in a word (61 lines) How could I add multi-hyperlinks automatically in a word documents?How could I add multi-hyperlinks automatically in a word documents? (23 lines) Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Allison's example page 133 - 136Allison's example page 133 - 136 (169 lines) Re: Allison's example page 133 - 136 (26 lines) Archiving SAS-L-posted codesBasic question, I hope...SAS XML tooRe: Basic question, I hope...SAS XML too (159 lines) Re: Basic question, I hope...SAS XML too (190 lines) CART analysis on SAS enterprise minerCART analysis on SAS enterprise miner (25 lines) CART on SAS enterprise minerCART on SAS enterprise miner (23 lines) Re: CART on SAS enterprise miner (41 lines) Calculating current record minus minimum of previousCalculating current record minus minimum of previous (60 lines) Re: Calculating current record minus minimum of previous (123 lines) Re: Calculating current record minus minimum of previous (129 lines) Case crossover designCase crossover design (28 lines) Change character variable to num variableCollin output in PROC REGCollin output in PROC REG (14 lines) Re: Collin output in PROC REG (24 lines) Re: Collin output in PROC REG (41 lines) Complex survey data analysis questionRe: Complex survey data analysis question (61 lines) Conditional Footnotes-PROC REPORTConditional Footnotes-PROC REPORT (28 lines) Re: Conditional Footnotes-PROC REPORT (59 lines) Conditional Hiding Form Viewer ComponentsRe: Conditional Hiding Form Viewer Components (45 lines) Re: Conditional Hiding Form Viewer Components (54 lines) Re: Conditional Hiding Form Viewer Components (97 lines) Consistent formatting of numbersConsistent formatting of numbers (23 lines) Re: Consistent formatting of numbers (35 lines) Correlation to SAS DatasetCorrelation to SAS Dataset (18 lines) Re: Correlation to SAS Dataset (32 lines) Re: Correlation to SAS Dataset (17 lines) Counting instances across variablesCounting instances across variables (27 lines) Re: Counting instances across variables (51 lines) Re: Counting instances across variables (87 lines) Create an ErrorCreate an Error (12 lines) Re: Create an Error (21 lines) Re: Create an Error (50 lines) Create macro variable to refer to program name - for multiple programsData Step Question--Flag obsDate CalculationDeploying SAS to client computers - What options do we have?Display Date in the subject line in a SAS generated email - MainframeDisplay Date in the subject line in a SAS generated email - Mainframe [SAS-L]Re: Display Date in the subject line in a SAS generated email - Mainframe [SAS-L] (77 lines) Divide datasets into sub-datasets based on Variable ValueDraw border that seperate group columnE-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007E-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007 (65 lines) Error in Passing Parameters in Macros (Urgent)Excel, Word, DDE and PasteExcel, Word, DDE and Paste (213 lines) Re: Excel, Word, DDE and Paste (39 lines) Re: Excel, Word, DDE and Paste (49 lines) Exit macroFisher's Exact Test vs Generalized Linear ModelsFormat in Proc SQL ...a syntax questionFree Online: Data Mining Intro for BeginnersFree Online: Data Mining Intro for Beginners (45 lines) Friday humor - list of clinical sas programmer distractionsFriday humor - list of clinical sas programmer distractions (98 lines) GLM procedureGLM procedure (32 lines) Re: GLM procedure (43 lines) Generate observations with a specific range of randomlyRe: Generate observations with a specific range of randomly (57 lines) Generate observations with a specific range of randomly chosen valuesGoogle Book Search for SAS Publishing TitlesHelp: a probelm about X command in a data step!Help: a probelm about X command in a data step! (29 lines) Help: a problem about X command in a data step!Re: Help: a problem about X command in a data step! (49 lines) How can I copy the whole directory (library XX) to another location using libname statement?Re: How can I copy the whole directory (library XX) to another location using libname statement? (38 lines) How could I add multi-hyperlinks automatically in a wordRe: How could I add multi-hyperlinks automatically in a word (61 lines) How could I add multi-hyperlinks automatically in a word documents?How could I add multi-hyperlinks automatically in a word documents? (23 lines) Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Archiving SAS-L-posted codesBasic question, I hope...SAS XML tooRe: Basic question, I hope...SAS XML too (159 lines) Re: Basic question, I hope...SAS XML too (190 lines) CART analysis on SAS enterprise minerCART analysis on SAS enterprise miner (25 lines) CART on SAS enterprise minerCART on SAS enterprise miner (23 lines) Re: CART on SAS enterprise miner (41 lines) Calculating current record minus minimum of previousCalculating current record minus minimum of previous (60 lines) Re: Calculating current record minus minimum of previous (123 lines) Re: Calculating current record minus minimum of previous (129 lines) Case crossover designCase crossover design (28 lines) Change character variable to num variableCollin output in PROC REGCollin output in PROC REG (14 lines) Re: Collin output in PROC REG (24 lines) Re: Collin output in PROC REG (41 lines) Complex survey data analysis questionRe: Complex survey data analysis question (61 lines) Conditional Footnotes-PROC REPORTConditional Footnotes-PROC REPORT (28 lines) Re: Conditional Footnotes-PROC REPORT (59 lines) Conditional Hiding Form Viewer ComponentsRe: Conditional Hiding Form Viewer Components (45 lines) Re: Conditional Hiding Form Viewer Components (54 lines) Re: Conditional Hiding Form Viewer Components (97 lines) Consistent formatting of numbersConsistent formatting of numbers (23 lines) Re: Consistent formatting of numbers (35 lines) Correlation to SAS DatasetCorrelation to SAS Dataset (18 lines) Re: Correlation to SAS Dataset (32 lines) Re: Correlation to SAS Dataset (17 lines) Counting instances across variablesCounting instances across variables (27 lines) Re: Counting instances across variables (51 lines) Re: Counting instances across variables (87 lines) Create an ErrorCreate an Error (12 lines) Re: Create an Error (21 lines) Re: Create an Error (50 lines) Create macro variable to refer to program name - for multiple programsData Step Question--Flag obsDate CalculationDeploying SAS to client computers - What options do we have?Display Date in the subject line in a SAS generated email - MainframeDisplay Date in the subject line in a SAS generated email - Mainframe [SAS-L]Re: Display Date in the subject line in a SAS generated email - Mainframe [SAS-L] (77 lines) Divide datasets into sub-datasets based on Variable ValueDraw border that seperate group columnE-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007E-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007 (65 lines) Error in Passing Parameters in Macros (Urgent)Excel, Word, DDE and PasteExcel, Word, DDE and Paste (213 lines) Re: Excel, Word, DDE and Paste (39 lines) Re: Excel, Word, DDE and Paste (49 lines) Exit macroFisher's Exact Test vs Generalized Linear ModelsFormat in Proc SQL ...a syntax questionFree Online: Data Mining Intro for BeginnersFree Online: Data Mining Intro for Beginners (45 lines) Friday humor - list of clinical sas programmer distractionsFriday humor - list of clinical sas programmer distractions (98 lines) GLM procedureGLM procedure (32 lines) Re: GLM procedure (43 lines) Generate observations with a specific range of randomlyRe: Generate observations with a specific range of randomly (57 lines) Generate observations with a specific range of randomly chosen valuesGoogle Book Search for SAS Publishing TitlesHelp: a probelm about X command in a data step!Help: a probelm about X command in a data step! (29 lines) Help: a problem about X command in a data step!Re: Help: a problem about X command in a data step! (49 lines) How can I copy the whole directory (library XX) to another location using libname statement?Re: How can I copy the whole directory (library XX) to another location using libname statement? (38 lines) How could I add multi-hyperlinks automatically in a wordRe: How could I add multi-hyperlinks automatically in a word (61 lines) How could I add multi-hyperlinks automatically in a word documents?How could I add multi-hyperlinks automatically in a word documents? (23 lines) Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Basic question, I hope...SAS XML tooRe: Basic question, I hope...SAS XML too (159 lines) Re: Basic question, I hope...SAS XML too (190 lines) CART analysis on SAS enterprise minerCART analysis on SAS enterprise miner (25 lines) CART on SAS enterprise minerCART on SAS enterprise miner (23 lines) Re: CART on SAS enterprise miner (41 lines) Calculating current record minus minimum of previousCalculating current record minus minimum of previous (60 lines) Re: Calculating current record minus minimum of previous (123 lines) Re: Calculating current record minus minimum of previous (129 lines) Case crossover designCase crossover design (28 lines) Change character variable to num variableCollin output in PROC REGCollin output in PROC REG (14 lines) Re: Collin output in PROC REG (24 lines) Re: Collin output in PROC REG (41 lines) Complex survey data analysis questionRe: Complex survey data analysis question (61 lines) Conditional Footnotes-PROC REPORTConditional Footnotes-PROC REPORT (28 lines) Re: Conditional Footnotes-PROC REPORT (59 lines) Conditional Hiding Form Viewer ComponentsRe: Conditional Hiding Form Viewer Components (45 lines) Re: Conditional Hiding Form Viewer Components (54 lines) Re: Conditional Hiding Form Viewer Components (97 lines) Consistent formatting of numbersConsistent formatting of numbers (23 lines) Re: Consistent formatting of numbers (35 lines) Correlation to SAS DatasetCorrelation to SAS Dataset (18 lines) Re: Correlation to SAS Dataset (32 lines) Re: Correlation to SAS Dataset (17 lines) Counting instances across variablesCounting instances across variables (27 lines) Re: Counting instances across variables (51 lines) Re: Counting instances across variables (87 lines) Create an ErrorCreate an Error (12 lines) Re: Create an Error (21 lines) Re: Create an Error (50 lines) Create macro variable to refer to program name - for multiple programsData Step Question--Flag obsDate CalculationDeploying SAS to client computers - What options do we have?Display Date in the subject line in a SAS generated email - MainframeDisplay Date in the subject line in a SAS generated email - Mainframe [SAS-L]Re: Display Date in the subject line in a SAS generated email - Mainframe [SAS-L] (77 lines) Divide datasets into sub-datasets based on Variable ValueDraw border that seperate group columnE-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007E-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007 (65 lines) Error in Passing Parameters in Macros (Urgent)Excel, Word, DDE and PasteExcel, Word, DDE and Paste (213 lines) Re: Excel, Word, DDE and Paste (39 lines) Re: Excel, Word, DDE and Paste (49 lines) Exit macroFisher's Exact Test vs Generalized Linear ModelsFormat in Proc SQL ...a syntax questionFree Online: Data Mining Intro for BeginnersFree Online: Data Mining Intro for Beginners (45 lines) Friday humor - list of clinical sas programmer distractionsFriday humor - list of clinical sas programmer distractions (98 lines) GLM procedureGLM procedure (32 lines) Re: GLM procedure (43 lines) Generate observations with a specific range of randomlyRe: Generate observations with a specific range of randomly (57 lines) Generate observations with a specific range of randomly chosen valuesGoogle Book Search for SAS Publishing TitlesHelp: a probelm about X command in a data step!Help: a probelm about X command in a data step! (29 lines) Help: a problem about X command in a data step!Re: Help: a problem about X command in a data step! (49 lines) How can I copy the whole directory (library XX) to another location using libname statement?Re: How can I copy the whole directory (library XX) to another location using libname statement? (38 lines) How could I add multi-hyperlinks automatically in a wordRe: How could I add multi-hyperlinks automatically in a word (61 lines) How could I add multi-hyperlinks automatically in a word documents?How could I add multi-hyperlinks automatically in a word documents? (23 lines) Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time CART analysis on SAS enterprise minerCART analysis on SAS enterprise miner (25 lines) CART on SAS enterprise minerCART on SAS enterprise miner (23 lines) Re: CART on SAS enterprise miner (41 lines) Calculating current record minus minimum of previousCalculating current record minus minimum of previous (60 lines) Re: Calculating current record minus minimum of previous (123 lines) Re: Calculating current record minus minimum of previous (129 lines) Case crossover designCase crossover design (28 lines) Change character variable to num variableCollin output in PROC REGCollin output in PROC REG (14 lines) Re: Collin output in PROC REG (24 lines) Re: Collin output in PROC REG (41 lines) Complex survey data analysis questionRe: Complex survey data analysis question (61 lines) Conditional Footnotes-PROC REPORTConditional Footnotes-PROC REPORT (28 lines) Re: Conditional Footnotes-PROC REPORT (59 lines) Conditional Hiding Form Viewer ComponentsRe: Conditional Hiding Form Viewer Components (45 lines) Re: Conditional Hiding Form Viewer Components (54 lines) Re: Conditional Hiding Form Viewer Components (97 lines) Consistent formatting of numbersConsistent formatting of numbers (23 lines) Re: Consistent formatting of numbers (35 lines) Correlation to SAS DatasetCorrelation to SAS Dataset (18 lines) Re: Correlation to SAS Dataset (32 lines) Re: Correlation to SAS Dataset (17 lines) Counting instances across variablesCounting instances across variables (27 lines) Re: Counting instances across variables (51 lines) Re: Counting instances across variables (87 lines) Create an ErrorCreate an Error (12 lines) Re: Create an Error (21 lines) Re: Create an Error (50 lines) Create macro variable to refer to program name - for multiple programsData Step Question--Flag obsDate CalculationDeploying SAS to client computers - What options do we have?Display Date in the subject line in a SAS generated email - MainframeDisplay Date in the subject line in a SAS generated email - Mainframe [SAS-L]Re: Display Date in the subject line in a SAS generated email - Mainframe [SAS-L] (77 lines) Divide datasets into sub-datasets based on Variable ValueDraw border that seperate group columnE-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007E-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007 (65 lines) Error in Passing Parameters in Macros (Urgent) Excel, Word, DDE and PasteExcel, Word, DDE and Paste (213 lines) Re: Excel, Word, DDE and Paste (39 lines) Re: Excel, Word, DDE and Paste (49 lines) Exit macroFisher's Exact Test vs Generalized Linear ModelsFormat in Proc SQL ...a syntax questionFree Online: Data Mining Intro for BeginnersFree Online: Data Mining Intro for Beginners (45 lines) Friday humor - list of clinical sas programmer distractionsFriday humor - list of clinical sas programmer distractions (98 lines) GLM procedureGLM procedure (32 lines) Re: GLM procedure (43 lines) Generate observations with a specific range of randomlyRe: Generate observations with a specific range of randomly (57 lines) Generate observations with a specific range of randomly chosen valuesGoogle Book Search for SAS Publishing TitlesHelp: a probelm about X command in a data step!Help: a probelm about X command in a data step! (29 lines) Help: a problem about X command in a data step!Re: Help: a problem about X command in a data step! (49 lines) How can I copy the whole directory (library XX) to another location using libname statement?Re: How can I copy the whole directory (library XX) to another location using libname statement? (38 lines) How could I add multi-hyperlinks automatically in a wordRe: How could I add multi-hyperlinks automatically in a word (61 lines) How could I add multi-hyperlinks automatically in a word documents?How could I add multi-hyperlinks automatically in a word documents? (23 lines) Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time CART on SAS enterprise minerCART on SAS enterprise miner (23 lines) Re: CART on SAS enterprise miner (41 lines) Calculating current record minus minimum of previousCalculating current record minus minimum of previous (60 lines) Re: Calculating current record minus minimum of previous (123 lines) Re: Calculating current record minus minimum of previous (129 lines) Case crossover designCase crossover design (28 lines) Change character variable to num variableCollin output in PROC REGCollin output in PROC REG (14 lines) Re: Collin output in PROC REG (24 lines) Re: Collin output in PROC REG (41 lines) Complex survey data analysis questionRe: Complex survey data analysis question (61 lines) Conditional Footnotes-PROC REPORTConditional Footnotes-PROC REPORT (28 lines) Re: Conditional Footnotes-PROC REPORT (59 lines) Conditional Hiding Form Viewer ComponentsRe: Conditional Hiding Form Viewer Components (45 lines) Re: Conditional Hiding Form Viewer Components (54 lines) Re: Conditional Hiding Form Viewer Components (97 lines) Consistent formatting of numbersConsistent formatting of numbers (23 lines) Re: Consistent formatting of numbers (35 lines) Correlation to SAS DatasetCorrelation to SAS Dataset (18 lines) Re: Correlation to SAS Dataset (32 lines) Re: Correlation to SAS Dataset (17 lines) Counting instances across variablesCounting instances across variables (27 lines) Re: Counting instances across variables (51 lines) Re: Counting instances across variables (87 lines) Create an ErrorCreate an Error (12 lines) Re: Create an Error (21 lines) Re: Create an Error (50 lines) Create macro variable to refer to program name - for multiple programsData Step Question--Flag obsDate CalculationDeploying SAS to client computers - What options do we have?Display Date in the subject line in a SAS generated email - MainframeDisplay Date in the subject line in a SAS generated email - Mainframe [SAS-L]Re: Display Date in the subject line in a SAS generated email - Mainframe [SAS-L] (77 lines) Divide datasets into sub-datasets based on Variable ValueDraw border that seperate group columnE-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007E-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007 (65 lines) Error in Passing Parameters in Macros (Urgent)Excel, Word, DDE and PasteExcel, Word, DDE and Paste (213 lines) Re: Excel, Word, DDE and Paste (39 lines) Re: Excel, Word, DDE and Paste (49 lines) Exit macroFisher's Exact Test vs Generalized Linear ModelsFormat in Proc SQL ...a syntax questionFree Online: Data Mining Intro for BeginnersFree Online: Data Mining Intro for Beginners (45 lines) Friday humor - list of clinical sas programmer distractionsFriday humor - list of clinical sas programmer distractions (98 lines) GLM procedureGLM procedure (32 lines) Re: GLM procedure (43 lines) Generate observations with a specific range of randomlyRe: Generate observations with a specific range of randomly (57 lines) Generate observations with a specific range of randomly chosen valuesGoogle Book Search for SAS Publishing TitlesHelp: a probelm about X command in a data step!Help: a probelm about X command in a data step! (29 lines) Help: a problem about X command in a data step!Re: Help: a problem about X command in a data step! (49 lines) How can I copy the whole directory (library XX) to another location using libname statement?Re: How can I copy the whole directory (library XX) to another location using libname statement? (38 lines) How could I add multi-hyperlinks automatically in a wordRe: How could I add multi-hyperlinks automatically in a word (61 lines) How could I add multi-hyperlinks automatically in a word documents?How could I add multi-hyperlinks automatically in a word documents? (23 lines) Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Calculating current record minus minimum of previousCalculating current record minus minimum of previous (60 lines) Re: Calculating current record minus minimum of previous (123 lines) Re: Calculating current record minus minimum of previous (129 lines) Case crossover designCase crossover design (28 lines) Change character variable to num variableCollin output in PROC REGCollin output in PROC REG (14 lines) Re: Collin output in PROC REG (24 lines) Re: Collin output in PROC REG (41 lines) Complex survey data analysis questionRe: Complex survey data analysis question (61 lines) Conditional Footnotes-PROC REPORTConditional Footnotes-PROC REPORT (28 lines) Re: Conditional Footnotes-PROC REPORT (59 lines) Conditional Hiding Form Viewer ComponentsRe: Conditional Hiding Form Viewer Components (45 lines) Re: Conditional Hiding Form Viewer Components (54 lines) Re: Conditional Hiding Form Viewer Components (97 lines) Consistent formatting of numbersConsistent formatting of numbers (23 lines) Re: Consistent formatting of numbers (35 lines) Correlation to SAS DatasetCorrelation to SAS Dataset (18 lines) Re: Correlation to SAS Dataset (32 lines) Re: Correlation to SAS Dataset (17 lines) Counting instances across variablesCounting instances across variables (27 lines) Re: Counting instances across variables (51 lines) Re: Counting instances across variables (87 lines) Create an ErrorCreate an Error (12 lines) Re: Create an Error (21 lines) Re: Create an Error (50 lines) Create macro variable to refer to program name - for multiple programsData Step Question--Flag obsDate CalculationDeploying SAS to client computers - What options do we have?Display Date in the subject line in a SAS generated email - MainframeDisplay Date in the subject line in a SAS generated email - Mainframe [SAS-L]Re: Display Date in the subject line in a SAS generated email - Mainframe [SAS-L] (77 lines) Divide datasets into sub-datasets based on Variable ValueDraw border that seperate group columnE-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007E-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007 (65 lines) Error in Passing Parameters in Macros (Urgent) Excel, Word, DDE and PasteExcel, Word, DDE and Paste (213 lines) Re: Excel, Word, DDE and Paste (39 lines) Re: Excel, Word, DDE and Paste (49 lines) Exit macroFisher's Exact Test vs Generalized Linear ModelsFormat in Proc SQL ...a syntax questionFree Online: Data Mining Intro for BeginnersFree Online: Data Mining Intro for Beginners (45 lines) Friday humor - list of clinical sas programmer distractionsFriday humor - list of clinical sas programmer distractions (98 lines) GLM procedureGLM procedure (32 lines) Re: GLM procedure (43 lines) Generate observations with a specific range of randomlyRe: Generate observations with a specific range of randomly (57 lines) Generate observations with a specific range of randomly chosen valuesGoogle Book Search for SAS Publishing TitlesHelp: a probelm about X command in a data step!Help: a probelm about X command in a data step! (29 lines) Help: a problem about X command in a data step!Re: Help: a problem about X command in a data step! (49 lines) How can I copy the whole directory (library XX) to another location using libname statement?Re: How can I copy the whole directory (library XX) to another location using libname statement? (38 lines) How could I add multi-hyperlinks automatically in a wordRe: How could I add multi-hyperlinks automatically in a word (61 lines) How could I add multi-hyperlinks automatically in a word documents?How could I add multi-hyperlinks automatically in a word documents? (23 lines) Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Case crossover designCase crossover design (28 lines) Change character variable to num variableCollin output in PROC REGCollin output in PROC REG (14 lines) Re: Collin output in PROC REG (24 lines) Re: Collin output in PROC REG (41 lines) Complex survey data analysis questionRe: Complex survey data analysis question (61 lines) Conditional Footnotes-PROC REPORTConditional Footnotes-PROC REPORT (28 lines) Re: Conditional Footnotes-PROC REPORT (59 lines) Conditional Hiding Form Viewer ComponentsRe: Conditional Hiding Form Viewer Components (45 lines) Re: Conditional Hiding Form Viewer Components (54 lines) Re: Conditional Hiding Form Viewer Components (97 lines) Consistent formatting of numbersConsistent formatting of numbers (23 lines) Re: Consistent formatting of numbers (35 lines) Correlation to SAS DatasetCorrelation to SAS Dataset (18 lines) Re: Correlation to SAS Dataset (32 lines) Re: Correlation to SAS Dataset (17 lines) Counting instances across variablesCounting instances across variables (27 lines) Re: Counting instances across variables (51 lines) Re: Counting instances across variables (87 lines) Create an ErrorCreate an Error (12 lines) Re: Create an Error (21 lines) Re: Create an Error (50 lines) Create macro variable to refer to program name - for multiple programsData Step Question--Flag obsDate CalculationDeploying SAS to client computers - What options do we have?Display Date in the subject line in a SAS generated email - MainframeDisplay Date in the subject line in a SAS generated email - Mainframe [SAS-L]Re: Display Date in the subject line in a SAS generated email - Mainframe [SAS-L] (77 lines) Divide datasets into sub-datasets based on Variable ValueDraw border that seperate group columnE-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007E-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007 (65 lines) Error in Passing Parameters in Macros (Urgent)Excel, Word, DDE and PasteExcel, Word, DDE and Paste (213 lines) Re: Excel, Word, DDE and Paste (39 lines) Re: Excel, Word, DDE and Paste (49 lines) Exit macroFisher's Exact Test vs Generalized Linear ModelsFormat in Proc SQL ...a syntax questionFree Online: Data Mining Intro for BeginnersFree Online: Data Mining Intro for Beginners (45 lines) Friday humor - list of clinical sas programmer distractionsFriday humor - list of clinical sas programmer distractions (98 lines) GLM procedureGLM procedure (32 lines) Re: GLM procedure (43 lines) Generate observations with a specific range of randomlyRe: Generate observations with a specific range of randomly (57 lines) Generate observations with a specific range of randomly chosen valuesGoogle Book Search for SAS Publishing TitlesHelp: a probelm about X command in a data step!Help: a probelm about X command in a data step! (29 lines) Help: a problem about X command in a data step!Re: Help: a problem about X command in a data step! (49 lines) How can I copy the whole directory (library XX) to another location using libname statement?Re: How can I copy the whole directory (library XX) to another location using libname statement? (38 lines) How could I add multi-hyperlinks automatically in a wordRe: How could I add multi-hyperlinks automatically in a word (61 lines) How could I add multi-hyperlinks automatically in a word documents?How could I add multi-hyperlinks automatically in a word documents? (23 lines) Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Change character variable to num variableCollin output in PROC REGCollin output in PROC REG (14 lines) Re: Collin output in PROC REG (24 lines) Re: Collin output in PROC REG (41 lines) Complex survey data analysis questionRe: Complex survey data analysis question (61 lines) Conditional Footnotes-PROC REPORTConditional Footnotes-PROC REPORT (28 lines) Re: Conditional Footnotes-PROC REPORT (59 lines) Conditional Hiding Form Viewer ComponentsRe: Conditional Hiding Form Viewer Components (45 lines) Re: Conditional Hiding Form Viewer Components (54 lines) Re: Conditional Hiding Form Viewer Components (97 lines) Consistent formatting of numbersConsistent formatting of numbers (23 lines) Re: Consistent formatting of numbers (35 lines) Correlation to SAS DatasetCorrelation to SAS Dataset (18 lines) Re: Correlation to SAS Dataset (32 lines) Re: Correlation to SAS Dataset (17 lines) Counting instances across variablesCounting instances across variables (27 lines) Re: Counting instances across variables (51 lines) Re: Counting instances across variables (87 lines) Create an ErrorCreate an Error (12 lines) Re: Create an Error (21 lines) Re: Create an Error (50 lines) Create macro variable to refer to program name - for multiple programsData Step Question--Flag obsDate CalculationDeploying SAS to client computers - What options do we have?Display Date in the subject line in a SAS generated email - MainframeDisplay Date in the subject line in a SAS generated email - Mainframe [SAS-L]Re: Display Date in the subject line in a SAS generated email - Mainframe [SAS-L] (77 lines) Divide datasets into sub-datasets based on Variable ValueDraw border that seperate group columnE-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007E-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007 (65 lines) Error in Passing Parameters in Macros (Urgent)Excel, Word, DDE and PasteExcel, Word, DDE and Paste (213 lines) Re: Excel, Word, DDE and Paste (39 lines) Re: Excel, Word, DDE and Paste (49 lines) Exit macroFisher's Exact Test vs Generalized Linear ModelsFormat in Proc SQL ...a syntax questionFree Online: Data Mining Intro for BeginnersFree Online: Data Mining Intro for Beginners (45 lines) Friday humor - list of clinical sas programmer distractionsFriday humor - list of clinical sas programmer distractions (98 lines) GLM procedureGLM procedure (32 lines) Re: GLM procedure (43 lines) Generate observations with a specific range of randomlyRe: Generate observations with a specific range of randomly (57 lines) Generate observations with a specific range of randomly chosen valuesGoogle Book Search for SAS Publishing TitlesHelp: a probelm about X command in a data step!Help: a probelm about X command in a data step! (29 lines) Help: a problem about X command in a data step!Re: Help: a problem about X command in a data step! (49 lines) How can I copy the whole directory (library XX) to another location using libname statement?Re: How can I copy the whole directory (library XX) to another location using libname statement? (38 lines) How could I add multi-hyperlinks automatically in a wordRe: How could I add multi-hyperlinks automatically in a word (61 lines) How could I add multi-hyperlinks automatically in a word documents?How could I add multi-hyperlinks automatically in a word documents? (23 lines) Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Collin output in PROC REGCollin output in PROC REG (14 lines) Re: Collin output in PROC REG (24 lines) Re: Collin output in PROC REG (41 lines) Complex survey data analysis questionRe: Complex survey data analysis question (61 lines) Conditional Footnotes-PROC REPORTConditional Footnotes-PROC REPORT (28 lines) Re: Conditional Footnotes-PROC REPORT (59 lines) Conditional Hiding Form Viewer ComponentsRe: Conditional Hiding Form Viewer Components (45 lines) Re: Conditional Hiding Form Viewer Components (54 lines) Re: Conditional Hiding Form Viewer Components (97 lines) Consistent formatting of numbersConsistent formatting of numbers (23 lines) Re: Consistent formatting of numbers (35 lines) Correlation to SAS DatasetCorrelation to SAS Dataset (18 lines) Re: Correlation to SAS Dataset (32 lines) Re: Correlation to SAS Dataset (17 lines) Counting instances across variablesCounting instances across variables (27 lines) Re: Counting instances across variables (51 lines) Re: Counting instances across variables (87 lines) Create an ErrorCreate an Error (12 lines) Re: Create an Error (21 lines) Re: Create an Error (50 lines) Create macro variable to refer to program name - for multiple programsData Step Question--Flag obsDate CalculationDeploying SAS to client computers - What options do we have?Display Date in the subject line in a SAS generated email - MainframeDisplay Date in the subject line in a SAS generated email - Mainframe [SAS-L]Re: Display Date in the subject line in a SAS generated email - Mainframe [SAS-L] (77 lines) Divide datasets into sub-datasets based on Variable ValueDraw border that seperate group columnE-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007E-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007 (65 lines) Error in Passing Parameters in Macros (Urgent)Excel, Word, DDE and PasteExcel, Word, DDE and Paste (213 lines) Re: Excel, Word, DDE and Paste (39 lines) Re: Excel, Word, DDE and Paste (49 lines) Exit macroFisher's Exact Test vs Generalized Linear ModelsFormat in Proc SQL ...a syntax questionFree Online: Data Mining Intro for BeginnersFree Online: Data Mining Intro for Beginners (45 lines) Friday humor - list of clinical sas programmer distractionsFriday humor - list of clinical sas programmer distractions (98 lines) GLM procedureGLM procedure (32 lines) Re: GLM procedure (43 lines) Generate observations with a specific range of randomlyRe: Generate observations with a specific range of randomly (57 lines) Generate observations with a specific range of randomly chosen valuesGoogle Book Search for SAS Publishing TitlesHelp: a probelm about X command in a data step!Help: a probelm about X command in a data step! (29 lines) Help: a problem about X command in a data step!Re: Help: a problem about X command in a data step! (49 lines) How can I copy the whole directory (library XX) to another location using libname statement?Re: How can I copy the whole directory (library XX) to another location using libname statement? (38 lines) How could I add multi-hyperlinks automatically in a wordRe: How could I add multi-hyperlinks automatically in a word (61 lines) How could I add multi-hyperlinks automatically in a word documents?How could I add multi-hyperlinks automatically in a word documents? (23 lines) Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Complex survey data analysis questionRe: Complex survey data analysis question (61 lines) Conditional Footnotes-PROC REPORTConditional Footnotes-PROC REPORT (28 lines) Re: Conditional Footnotes-PROC REPORT (59 lines) Conditional Hiding Form Viewer ComponentsRe: Conditional Hiding Form Viewer Components (45 lines) Re: Conditional Hiding Form Viewer Components (54 lines) Re: Conditional Hiding Form Viewer Components (97 lines) Consistent formatting of numbersConsistent formatting of numbers (23 lines) Re: Consistent formatting of numbers (35 lines) Correlation to SAS DatasetCorrelation to SAS Dataset (18 lines) Re: Correlation to SAS Dataset (32 lines) Re: Correlation to SAS Dataset (17 lines) Counting instances across variablesCounting instances across variables (27 lines) Re: Counting instances across variables (51 lines) Re: Counting instances across variables (87 lines) Create an ErrorCreate an Error (12 lines) Re: Create an Error (21 lines) Re: Create an Error (50 lines) Create macro variable to refer to program name - for multiple programsData Step Question--Flag obsDate CalculationDeploying SAS to client computers - What options do we have?Display Date in the subject line in a SAS generated email - MainframeDisplay Date in the subject line in a SAS generated email - Mainframe [SAS-L]Re: Display Date in the subject line in a SAS generated email - Mainframe [SAS-L] (77 lines) Divide datasets into sub-datasets based on Variable ValueDraw border that seperate group columnE-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007E-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007 (65 lines) Error in Passing Parameters in Macros (Urgent)Excel, Word, DDE and PasteExcel, Word, DDE and Paste (213 lines) Re: Excel, Word, DDE and Paste (39 lines) Re: Excel, Word, DDE and Paste (49 lines) Exit macroFisher's Exact Test vs Generalized Linear ModelsFormat in Proc SQL ...a syntax questionFree Online: Data Mining Intro for BeginnersFree Online: Data Mining Intro for Beginners (45 lines) Friday humor - list of clinical sas programmer distractionsFriday humor - list of clinical sas programmer distractions (98 lines) GLM procedureGLM procedure (32 lines) Re: GLM procedure (43 lines) Generate observations with a specific range of randomlyRe: Generate observations with a specific range of randomly (57 lines) Generate observations with a specific range of randomly chosen valuesGoogle Book Search for SAS Publishing TitlesHelp: a probelm about X command in a data step!Help: a probelm about X command in a data step! (29 lines) Help: a problem about X command in a data step!Re: Help: a problem about X command in a data step! (49 lines) How can I copy the whole directory (library XX) to another location using libname statement?Re: How can I copy the whole directory (library XX) to another location using libname statement? (38 lines) How could I add multi-hyperlinks automatically in a wordRe: How could I add multi-hyperlinks automatically in a word (61 lines) How could I add multi-hyperlinks automatically in a word documents?How could I add multi-hyperlinks automatically in a word documents? (23 lines) Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Conditional Footnotes-PROC REPORTConditional Footnotes-PROC REPORT (28 lines) Re: Conditional Footnotes-PROC REPORT (59 lines) Conditional Hiding Form Viewer ComponentsRe: Conditional Hiding Form Viewer Components (45 lines) Re: Conditional Hiding Form Viewer Components (54 lines) Re: Conditional Hiding Form Viewer Components (97 lines) Consistent formatting of numbersConsistent formatting of numbers (23 lines) Re: Consistent formatting of numbers (35 lines) Correlation to SAS DatasetCorrelation to SAS Dataset (18 lines) Re: Correlation to SAS Dataset (32 lines) Re: Correlation to SAS Dataset (17 lines) Counting instances across variablesCounting instances across variables (27 lines) Re: Counting instances across variables (51 lines) Re: Counting instances across variables (87 lines) Create an ErrorCreate an Error (12 lines) Re: Create an Error (21 lines) Re: Create an Error (50 lines) Create macro variable to refer to program name - for multiple programsData Step Question--Flag obsDate CalculationDeploying SAS to client computers - What options do we have?Display Date in the subject line in a SAS generated email - MainframeDisplay Date in the subject line in a SAS generated email - Mainframe [SAS-L]Re: Display Date in the subject line in a SAS generated email - Mainframe [SAS-L] (77 lines) Divide datasets into sub-datasets based on Variable ValueDraw border that seperate group columnE-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007E-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007 (65 lines) Error in Passing Parameters in Macros (Urgent) Excel, Word, DDE and PasteExcel, Word, DDE and Paste (213 lines) Re: Excel, Word, DDE and Paste (39 lines) Re: Excel, Word, DDE and Paste (49 lines) Exit macroFisher's Exact Test vs Generalized Linear ModelsFormat in Proc SQL ...a syntax questionFree Online: Data Mining Intro for BeginnersFree Online: Data Mining Intro for Beginners (45 lines) Friday humor - list of clinical sas programmer distractionsFriday humor - list of clinical sas programmer distractions (98 lines) GLM procedureGLM procedure (32 lines) Re: GLM procedure (43 lines) Generate observations with a specific range of randomlyRe: Generate observations with a specific range of randomly (57 lines) Generate observations with a specific range of randomly chosen valuesGoogle Book Search for SAS Publishing TitlesHelp: a probelm about X command in a data step!Help: a probelm about X command in a data step! (29 lines) Help: a problem about X command in a data step!Re: Help: a problem about X command in a data step! (49 lines) How can I copy the whole directory (library XX) to another location using libname statement?Re: How can I copy the whole directory (library XX) to another location using libname statement? (38 lines) How could I add multi-hyperlinks automatically in a wordRe: How could I add multi-hyperlinks automatically in a word (61 lines) How could I add multi-hyperlinks automatically in a word documents?How could I add multi-hyperlinks automatically in a word documents? (23 lines) Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Conditional Hiding Form Viewer ComponentsRe: Conditional Hiding Form Viewer Components (45 lines) Re: Conditional Hiding Form Viewer Components (54 lines) Re: Conditional Hiding Form Viewer Components (97 lines) Consistent formatting of numbersConsistent formatting of numbers (23 lines) Re: Consistent formatting of numbers (35 lines) Correlation to SAS DatasetCorrelation to SAS Dataset (18 lines) Re: Correlation to SAS Dataset (32 lines) Re: Correlation to SAS Dataset (17 lines) Counting instances across variablesCounting instances across variables (27 lines) Re: Counting instances across variables (51 lines) Re: Counting instances across variables (87 lines) Create an ErrorCreate an Error (12 lines) Re: Create an Error (21 lines) Re: Create an Error (50 lines) Create macro variable to refer to program name - for multiple programsData Step Question--Flag obsDate CalculationDeploying SAS to client computers - What options do we have?Display Date in the subject line in a SAS generated email - MainframeDisplay Date in the subject line in a SAS generated email - Mainframe [SAS-L]Re: Display Date in the subject line in a SAS generated email - Mainframe [SAS-L] (77 lines) Divide datasets into sub-datasets based on Variable ValueDraw border that seperate group columnE-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007E-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007 (65 lines) Error in Passing Parameters in Macros (Urgent)Excel, Word, DDE and PasteExcel, Word, DDE and Paste (213 lines) Re: Excel, Word, DDE and Paste (39 lines) Re: Excel, Word, DDE and Paste (49 lines) Exit macroFisher's Exact Test vs Generalized Linear ModelsFormat in Proc SQL ...a syntax questionFree Online: Data Mining Intro for BeginnersFree Online: Data Mining Intro for Beginners (45 lines) Friday humor - list of clinical sas programmer distractionsFriday humor - list of clinical sas programmer distractions (98 lines) GLM procedureGLM procedure (32 lines) Re: GLM procedure (43 lines) Generate observations with a specific range of randomlyRe: Generate observations with a specific range of randomly (57 lines) Generate observations with a specific range of randomly chosen valuesGoogle Book Search for SAS Publishing TitlesHelp: a probelm about X command in a data step!Help: a probelm about X command in a data step! (29 lines) Help: a problem about X command in a data step!Re: Help: a problem about X command in a data step! (49 lines) How can I copy the whole directory (library XX) to another location using libname statement?Re: How can I copy the whole directory (library XX) to another location using libname statement? (38 lines) How could I add multi-hyperlinks automatically in a wordRe: How could I add multi-hyperlinks automatically in a word (61 lines) How could I add multi-hyperlinks automatically in a word documents?How could I add multi-hyperlinks automatically in a word documents? (23 lines) Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Consistent formatting of numbersConsistent formatting of numbers (23 lines) Re: Consistent formatting of numbers (35 lines) Correlation to SAS DatasetCorrelation to SAS Dataset (18 lines) Re: Correlation to SAS Dataset (32 lines) Re: Correlation to SAS Dataset (17 lines) Counting instances across variablesCounting instances across variables (27 lines) Re: Counting instances across variables (51 lines) Re: Counting instances across variables (87 lines) Create an ErrorCreate an Error (12 lines) Re: Create an Error (21 lines) Re: Create an Error (50 lines) Create macro variable to refer to program name - for multiple programsData Step Question--Flag obsDate CalculationDeploying SAS to client computers - What options do we have?Display Date in the subject line in a SAS generated email - MainframeDisplay Date in the subject line in a SAS generated email - Mainframe [SAS-L]Re: Display Date in the subject line in a SAS generated email - Mainframe [SAS-L] (77 lines) Divide datasets into sub-datasets based on Variable ValueDraw border that seperate group columnE-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007E-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007 (65 lines) Error in Passing Parameters in Macros (Urgent)Excel, Word, DDE and PasteExcel, Word, DDE and Paste (213 lines) Re: Excel, Word, DDE and Paste (39 lines) Re: Excel, Word, DDE and Paste (49 lines) Exit macroFisher's Exact Test vs Generalized Linear ModelsFormat in Proc SQL ...a syntax questionFree Online: Data Mining Intro for BeginnersFree Online: Data Mining Intro for Beginners (45 lines) Friday humor - list of clinical sas programmer distractionsFriday humor - list of clinical sas programmer distractions (98 lines) GLM procedureGLM procedure (32 lines) Re: GLM procedure (43 lines) Generate observations with a specific range of randomlyRe: Generate observations with a specific range of randomly (57 lines) Generate observations with a specific range of randomly chosen valuesGoogle Book Search for SAS Publishing TitlesHelp: a probelm about X command in a data step!Help: a probelm about X command in a data step! (29 lines) Help: a problem about X command in a data step!Re: Help: a problem about X command in a data step! (49 lines) How can I copy the whole directory (library XX) to another location using libname statement?Re: How can I copy the whole directory (library XX) to another location using libname statement? (38 lines) How could I add multi-hyperlinks automatically in a wordRe: How could I add multi-hyperlinks automatically in a word (61 lines) How could I add multi-hyperlinks automatically in a word documents?How could I add multi-hyperlinks automatically in a word documents? (23 lines) Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Correlation to SAS DatasetCorrelation to SAS Dataset (18 lines) Re: Correlation to SAS Dataset (32 lines) Re: Correlation to SAS Dataset (17 lines) Counting instances across variablesCounting instances across variables (27 lines) Re: Counting instances across variables (51 lines) Re: Counting instances across variables (87 lines) Create an ErrorCreate an Error (12 lines) Re: Create an Error (21 lines) Re: Create an Error (50 lines) Create macro variable to refer to program name - for multiple programsData Step Question--Flag obsDate CalculationDeploying SAS to client computers - What options do we have?Display Date in the subject line in a SAS generated email - MainframeDisplay Date in the subject line in a SAS generated email - Mainframe [SAS-L]Re: Display Date in the subject line in a SAS generated email - Mainframe [SAS-L] (77 lines) Divide datasets into sub-datasets based on Variable ValueDraw border that seperate group columnE-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007E-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007 (65 lines) Error in Passing Parameters in Macros (Urgent)Excel, Word, DDE and PasteExcel, Word, DDE and Paste (213 lines) Re: Excel, Word, DDE and Paste (39 lines) Re: Excel, Word, DDE and Paste (49 lines) Exit macroFisher's Exact Test vs Generalized Linear ModelsFormat in Proc SQL ...a syntax questionFree Online: Data Mining Intro for BeginnersFree Online: Data Mining Intro for Beginners (45 lines) Friday humor - list of clinical sas programmer distractionsFriday humor - list of clinical sas programmer distractions (98 lines) GLM procedureGLM procedure (32 lines) Re: GLM procedure (43 lines) Generate observations with a specific range of randomlyRe: Generate observations with a specific range of randomly (57 lines) Generate observations with a specific range of randomly chosen valuesGoogle Book Search for SAS Publishing TitlesHelp: a probelm about X command in a data step!Help: a probelm about X command in a data step! (29 lines) Help: a problem about X command in a data step!Re: Help: a problem about X command in a data step! (49 lines) How can I copy the whole directory (library XX) to another location using libname statement?Re: How can I copy the whole directory (library XX) to another location using libname statement? (38 lines) How could I add multi-hyperlinks automatically in a wordRe: How could I add multi-hyperlinks automatically in a word (61 lines) How could I add multi-hyperlinks automatically in a word documents?How could I add multi-hyperlinks automatically in a word documents? (23 lines) Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Counting instances across variablesCounting instances across variables (27 lines) Re: Counting instances across variables (51 lines) Re: Counting instances across variables (87 lines) Create an ErrorCreate an Error (12 lines) Re: Create an Error (21 lines) Re: Create an Error (50 lines) Create macro variable to refer to program name - for multiple programsData Step Question--Flag obsDate CalculationDeploying SAS to client computers - What options do we have?Display Date in the subject line in a SAS generated email - MainframeDisplay Date in the subject line in a SAS generated email - Mainframe [SAS-L]Re: Display Date in the subject line in a SAS generated email - Mainframe [SAS-L] (77 lines) Divide datasets into sub-datasets based on Variable ValueDraw border that seperate group columnE-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007E-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007 (65 lines) Error in Passing Parameters in Macros (Urgent)Excel, Word, DDE and PasteExcel, Word, DDE and Paste (213 lines) Re: Excel, Word, DDE and Paste (39 lines) Re: Excel, Word, DDE and Paste (49 lines) Exit macroFisher's Exact Test vs Generalized Linear ModelsFormat in Proc SQL ...a syntax questionFree Online: Data Mining Intro for BeginnersFree Online: Data Mining Intro for Beginners (45 lines) Friday humor - list of clinical sas programmer distractionsFriday humor - list of clinical sas programmer distractions (98 lines) GLM procedureGLM procedure (32 lines) Re: GLM procedure (43 lines) Generate observations with a specific range of randomlyRe: Generate observations with a specific range of randomly (57 lines) Generate observations with a specific range of randomly chosen valuesGoogle Book Search for SAS Publishing TitlesHelp: a probelm about X command in a data step!Help: a probelm about X command in a data step! (29 lines) Help: a problem about X command in a data step!Re: Help: a problem about X command in a data step! (49 lines) How can I copy the whole directory (library XX) to another location using libname statement?Re: How can I copy the whole directory (library XX) to another location using libname statement? (38 lines) How could I add multi-hyperlinks automatically in a wordRe: How could I add multi-hyperlinks automatically in a word (61 lines) How could I add multi-hyperlinks automatically in a word documents?How could I add multi-hyperlinks automatically in a word documents? (23 lines) Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Create an ErrorCreate an Error (12 lines) Re: Create an Error (21 lines) Re: Create an Error (50 lines) Create macro variable to refer to program name - for multiple programsData Step Question--Flag obsDate CalculationDeploying SAS to client computers - What options do we have?Display Date in the subject line in a SAS generated email - MainframeDisplay Date in the subject line in a SAS generated email - Mainframe [SAS-L]Re: Display Date in the subject line in a SAS generated email - Mainframe [SAS-L] (77 lines) Divide datasets into sub-datasets based on Variable ValueDraw border that seperate group columnE-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007E-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007 (65 lines) Error in Passing Parameters in Macros (Urgent)Excel, Word, DDE and PasteExcel, Word, DDE and Paste (213 lines) Re: Excel, Word, DDE and Paste (39 lines) Re: Excel, Word, DDE and Paste (49 lines) Exit macroFisher's Exact Test vs Generalized Linear ModelsFormat in Proc SQL ...a syntax questionFree Online: Data Mining Intro for BeginnersFree Online: Data Mining Intro for Beginners (45 lines) Friday humor - list of clinical sas programmer distractionsFriday humor - list of clinical sas programmer distractions (98 lines) GLM procedureGLM procedure (32 lines) Re: GLM procedure (43 lines) Generate observations with a specific range of randomlyRe: Generate observations with a specific range of randomly (57 lines) Generate observations with a specific range of randomly chosen valuesGoogle Book Search for SAS Publishing TitlesHelp: a probelm about X command in a data step!Help: a probelm about X command in a data step! (29 lines) Help: a problem about X command in a data step!Re: Help: a problem about X command in a data step! (49 lines) How can I copy the whole directory (library XX) to another location using libname statement?Re: How can I copy the whole directory (library XX) to another location using libname statement? (38 lines) How could I add multi-hyperlinks automatically in a wordRe: How could I add multi-hyperlinks automatically in a word (61 lines) How could I add multi-hyperlinks automatically in a word documents?How could I add multi-hyperlinks automatically in a word documents? (23 lines) Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Create macro variable to refer to program name - for multiple programsData Step Question--Flag obsDate CalculationDeploying SAS to client computers - What options do we have?Display Date in the subject line in a SAS generated email - MainframeDisplay Date in the subject line in a SAS generated email - Mainframe [SAS-L]Re: Display Date in the subject line in a SAS generated email - Mainframe [SAS-L] (77 lines) Divide datasets into sub-datasets based on Variable ValueDraw border that seperate group columnE-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007E-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007 (65 lines) Error in Passing Parameters in Macros (Urgent)Excel, Word, DDE and PasteExcel, Word, DDE and Paste (213 lines) Re: Excel, Word, DDE and Paste (39 lines) Re: Excel, Word, DDE and Paste (49 lines) Exit macroFisher's Exact Test vs Generalized Linear ModelsFormat in Proc SQL ...a syntax questionFree Online: Data Mining Intro for BeginnersFree Online: Data Mining Intro for Beginners (45 lines) Friday humor - list of clinical sas programmer distractionsFriday humor - list of clinical sas programmer distractions (98 lines) GLM procedureGLM procedure (32 lines) Re: GLM procedure (43 lines) Generate observations with a specific range of randomlyRe: Generate observations with a specific range of randomly (57 lines) Generate observations with a specific range of randomly chosen valuesGoogle Book Search for SAS Publishing TitlesHelp: a probelm about X command in a data step!Help: a probelm about X command in a data step! (29 lines) Help: a problem about X command in a data step!Re: Help: a problem about X command in a data step! (49 lines) How can I copy the whole directory (library XX) to another location using libname statement?Re: How can I copy the whole directory (library XX) to another location using libname statement? (38 lines) How could I add multi-hyperlinks automatically in a wordRe: How could I add multi-hyperlinks automatically in a word (61 lines) How could I add multi-hyperlinks automatically in a word documents?How could I add multi-hyperlinks automatically in a word documents? (23 lines) Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Data Step Question--Flag obsDate CalculationDeploying SAS to client computers - What options do we have?Display Date in the subject line in a SAS generated email - MainframeDisplay Date in the subject line in a SAS generated email - Mainframe [SAS-L]Re: Display Date in the subject line in a SAS generated email - Mainframe [SAS-L] (77 lines) Divide datasets into sub-datasets based on Variable ValueDraw border that seperate group columnE-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007E-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007 (65 lines) Error in Passing Parameters in Macros (Urgent)Excel, Word, DDE and PasteExcel, Word, DDE and Paste (213 lines) Re: Excel, Word, DDE and Paste (39 lines) Re: Excel, Word, DDE and Paste (49 lines) Exit macroFisher's Exact Test vs Generalized Linear ModelsFormat in Proc SQL ...a syntax questionFree Online: Data Mining Intro for BeginnersFree Online: Data Mining Intro for Beginners (45 lines) Friday humor - list of clinical sas programmer distractionsFriday humor - list of clinical sas programmer distractions (98 lines) GLM procedureGLM procedure (32 lines) Re: GLM procedure (43 lines) Generate observations with a specific range of randomlyRe: Generate observations with a specific range of randomly (57 lines) Generate observations with a specific range of randomly chosen valuesGoogle Book Search for SAS Publishing TitlesHelp: a probelm about X command in a data step!Help: a probelm about X command in a data step! (29 lines) Help: a problem about X command in a data step!Re: Help: a problem about X command in a data step! (49 lines) How can I copy the whole directory (library XX) to another location using libname statement?Re: How can I copy the whole directory (library XX) to another location using libname statement? (38 lines) How could I add multi-hyperlinks automatically in a wordRe: How could I add multi-hyperlinks automatically in a word (61 lines) How could I add multi-hyperlinks automatically in a word documents?How could I add multi-hyperlinks automatically in a word documents? (23 lines) Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Date CalculationDeploying SAS to client computers - What options do we have?Display Date in the subject line in a SAS generated email - MainframeDisplay Date in the subject line in a SAS generated email - Mainframe [SAS-L]Re: Display Date in the subject line in a SAS generated email - Mainframe [SAS-L] (77 lines) Divide datasets into sub-datasets based on Variable ValueDraw border that seperate group columnE-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007E-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007 (65 lines) Error in Passing Parameters in Macros (Urgent)Excel, Word, DDE and PasteExcel, Word, DDE and Paste (213 lines) Re: Excel, Word, DDE and Paste (39 lines) Re: Excel, Word, DDE and Paste (49 lines) Exit macroFisher's Exact Test vs Generalized Linear ModelsFormat in Proc SQL ...a syntax questionFree Online: Data Mining Intro for BeginnersFree Online: Data Mining Intro for Beginners (45 lines) Friday humor - list of clinical sas programmer distractionsFriday humor - list of clinical sas programmer distractions (98 lines) GLM procedureGLM procedure (32 lines) Re: GLM procedure (43 lines) Generate observations with a specific range of randomlyRe: Generate observations with a specific range of randomly (57 lines) Generate observations with a specific range of randomly chosen valuesGoogle Book Search for SAS Publishing TitlesHelp: a probelm about X command in a data step!Help: a probelm about X command in a data step! (29 lines) Help: a problem about X command in a data step!Re: Help: a problem about X command in a data step! (49 lines) How can I copy the whole directory (library XX) to another location using libname statement?Re: How can I copy the whole directory (library XX) to another location using libname statement? (38 lines) How could I add multi-hyperlinks automatically in a wordRe: How could I add multi-hyperlinks automatically in a word (61 lines) How could I add multi-hyperlinks automatically in a word documents?How could I add multi-hyperlinks automatically in a word documents? (23 lines) Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Deploying SAS to client computers - What options do we have?Display Date in the subject line in a SAS generated email - MainframeDisplay Date in the subject line in a SAS generated email - Mainframe [SAS-L]Re: Display Date in the subject line in a SAS generated email - Mainframe [SAS-L] (77 lines) Divide datasets into sub-datasets based on Variable ValueDraw border that seperate group columnE-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007E-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007 (65 lines) Error in Passing Parameters in Macros (Urgent)Excel, Word, DDE and PasteExcel, Word, DDE and Paste (213 lines) Re: Excel, Word, DDE and Paste (39 lines) Re: Excel, Word, DDE and Paste (49 lines) Exit macroFisher's Exact Test vs Generalized Linear ModelsFormat in Proc SQL ...a syntax questionFree Online: Data Mining Intro for BeginnersFree Online: Data Mining Intro for Beginners (45 lines) Friday humor - list of clinical sas programmer distractionsFriday humor - list of clinical sas programmer distractions (98 lines) GLM procedureGLM procedure (32 lines) Re: GLM procedure (43 lines) Generate observations with a specific range of randomlyRe: Generate observations with a specific range of randomly (57 lines) Generate observations with a specific range of randomly chosen valuesGoogle Book Search for SAS Publishing TitlesHelp: a probelm about X command in a data step!Help: a probelm about X command in a data step! (29 lines) Help: a problem about X command in a data step!Re: Help: a problem about X command in a data step! (49 lines) How can I copy the whole directory (library XX) to another location using libname statement?Re: How can I copy the whole directory (library XX) to another location using libname statement? (38 lines) How could I add multi-hyperlinks automatically in a wordRe: How could I add multi-hyperlinks automatically in a word (61 lines) How could I add multi-hyperlinks automatically in a word documents?How could I add multi-hyperlinks automatically in a word documents? (23 lines) Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Display Date in the subject line in a SAS generated email - MainframeDisplay Date in the subject line in a SAS generated email - Mainframe [SAS-L]Re: Display Date in the subject line in a SAS generated email - Mainframe [SAS-L] (77 lines) Divide datasets into sub-datasets based on Variable ValueDraw border that seperate group columnE-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007E-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007 (65 lines) Error in Passing Parameters in Macros (Urgent)Excel, Word, DDE and PasteExcel, Word, DDE and Paste (213 lines) Re: Excel, Word, DDE and Paste (39 lines) Re: Excel, Word, DDE and Paste (49 lines) Exit macroFisher's Exact Test vs Generalized Linear ModelsFormat in Proc SQL ...a syntax questionFree Online: Data Mining Intro for BeginnersFree Online: Data Mining Intro for Beginners (45 lines) Friday humor - list of clinical sas programmer distractionsFriday humor - list of clinical sas programmer distractions (98 lines) GLM procedureGLM procedure (32 lines) Re: GLM procedure (43 lines) Generate observations with a specific range of randomlyRe: Generate observations with a specific range of randomly (57 lines) Generate observations with a specific range of randomly chosen valuesGoogle Book Search for SAS Publishing TitlesHelp: a probelm about X command in a data step!Help: a probelm about X command in a data step! (29 lines) Help: a problem about X command in a data step!Re: Help: a problem about X command in a data step! (49 lines) How can I copy the whole directory (library XX) to another location using libname statement?Re: How can I copy the whole directory (library XX) to another location using libname statement? (38 lines) How could I add multi-hyperlinks automatically in a wordRe: How could I add multi-hyperlinks automatically in a word (61 lines) How could I add multi-hyperlinks automatically in a word documents?How could I add multi-hyperlinks automatically in a word documents? (23 lines) Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Display Date in the subject line in a SAS generated email - Mainframe [SAS-L]Re: Display Date in the subject line in a SAS generated email - Mainframe [SAS-L] (77 lines) Divide datasets into sub-datasets based on Variable ValueDraw border that seperate group columnE-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007E-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007 (65 lines) Error in Passing Parameters in Macros (Urgent)Excel, Word, DDE and PasteExcel, Word, DDE and Paste (213 lines) Re: Excel, Word, DDE and Paste (39 lines) Re: Excel, Word, DDE and Paste (49 lines) Exit macroFisher's Exact Test vs Generalized Linear ModelsFormat in Proc SQL ...a syntax questionFree Online: Data Mining Intro for BeginnersFree Online: Data Mining Intro for Beginners (45 lines) Friday humor - list of clinical sas programmer distractionsFriday humor - list of clinical sas programmer distractions (98 lines) GLM procedureGLM procedure (32 lines) Re: GLM procedure (43 lines) Generate observations with a specific range of randomlyRe: Generate observations with a specific range of randomly (57 lines) Generate observations with a specific range of randomly chosen valuesGoogle Book Search for SAS Publishing TitlesHelp: a probelm about X command in a data step!Help: a probelm about X command in a data step! (29 lines) Help: a problem about X command in a data step!Re: Help: a problem about X command in a data step! (49 lines) How can I copy the whole directory (library XX) to another location using libname statement?Re: How can I copy the whole directory (library XX) to another location using libname statement? (38 lines) How could I add multi-hyperlinks automatically in a wordRe: How could I add multi-hyperlinks automatically in a word (61 lines) How could I add multi-hyperlinks automatically in a word documents?How could I add multi-hyperlinks automatically in a word documents? (23 lines) Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Divide datasets into sub-datasets based on Variable ValueDraw border that seperate group columnE-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007E-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007 (65 lines) Error in Passing Parameters in Macros (Urgent)Excel, Word, DDE and PasteExcel, Word, DDE and Paste (213 lines) Re: Excel, Word, DDE and Paste (39 lines) Re: Excel, Word, DDE and Paste (49 lines) Exit macroFisher's Exact Test vs Generalized Linear ModelsFormat in Proc SQL ...a syntax questionFree Online: Data Mining Intro for BeginnersFree Online: Data Mining Intro for Beginners (45 lines) Friday humor - list of clinical sas programmer distractionsFriday humor - list of clinical sas programmer distractions (98 lines) GLM procedureGLM procedure (32 lines) Re: GLM procedure (43 lines) Generate observations with a specific range of randomlyRe: Generate observations with a specific range of randomly (57 lines) Generate observations with a specific range of randomly chosen valuesGoogle Book Search for SAS Publishing TitlesHelp: a probelm about X command in a data step!Help: a probelm about X command in a data step! (29 lines) Help: a problem about X command in a data step!Re: Help: a problem about X command in a data step! (49 lines) How can I copy the whole directory (library XX) to another location using libname statement?Re: How can I copy the whole directory (library XX) to another location using libname statement? (38 lines) How could I add multi-hyperlinks automatically in a wordRe: How could I add multi-hyperlinks automatically in a word (61 lines) How could I add multi-hyperlinks automatically in a word documents?How could I add multi-hyperlinks automatically in a word documents? (23 lines) Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Draw border that seperate group columnE-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007E-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007 (65 lines) Error in Passing Parameters in Macros (Urgent)Excel, Word, DDE and PasteExcel, Word, DDE and Paste (213 lines) Re: Excel, Word, DDE and Paste (39 lines) Re: Excel, Word, DDE and Paste (49 lines) Exit macroFisher's Exact Test vs Generalized Linear ModelsFormat in Proc SQL ...a syntax questionFree Online: Data Mining Intro for BeginnersFree Online: Data Mining Intro for Beginners (45 lines) Friday humor - list of clinical sas programmer distractionsFriday humor - list of clinical sas programmer distractions (98 lines) GLM procedureGLM procedure (32 lines) Re: GLM procedure (43 lines) Generate observations with a specific range of randomlyRe: Generate observations with a specific range of randomly (57 lines) Generate observations with a specific range of randomly chosen valuesGoogle Book Search for SAS Publishing TitlesHelp: a probelm about X command in a data step!Help: a probelm about X command in a data step! (29 lines) Help: a problem about X command in a data step!Re: Help: a problem about X command in a data step! (49 lines) How can I copy the whole directory (library XX) to another location using libname statement?Re: How can I copy the whole directory (library XX) to another location using libname statement? (38 lines) How could I add multi-hyperlinks automatically in a wordRe: How could I add multi-hyperlinks automatically in a word (61 lines) How could I add multi-hyperlinks automatically in a word documents?How could I add multi-hyperlinks automatically in a word documents? (23 lines) Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time E-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007E-MEDISYS 2007 . Fez , Morocco , October 24-26, 2007 (65 lines) Error in Passing Parameters in Macros (Urgent)Excel, Word, DDE and PasteExcel, Word, DDE and Paste (213 lines) Re: Excel, Word, DDE and Paste (39 lines) Re: Excel, Word, DDE and Paste (49 lines) Exit macroFisher's Exact Test vs Generalized Linear ModelsFormat in Proc SQL ...a syntax questionFree Online: Data Mining Intro for BeginnersFree Online: Data Mining Intro for Beginners (45 lines) Friday humor - list of clinical sas programmer distractionsFriday humor - list of clinical sas programmer distractions (98 lines) GLM procedureGLM procedure (32 lines) Re: GLM procedure (43 lines) Generate observations with a specific range of randomlyRe: Generate observations with a specific range of randomly (57 lines) Generate observations with a specific range of randomly chosen valuesGoogle Book Search for SAS Publishing TitlesHelp: a probelm about X command in a data step!Help: a probelm about X command in a data step! (29 lines) Help: a problem about X command in a data step!Re: Help: a problem about X command in a data step! (49 lines) How can I copy the whole directory (library XX) to another location using libname statement?Re: How can I copy the whole directory (library XX) to another location using libname statement? (38 lines) How could I add multi-hyperlinks automatically in a wordRe: How could I add multi-hyperlinks automatically in a word (61 lines) How could I add multi-hyperlinks automatically in a word documents?How could I add multi-hyperlinks automatically in a word documents? (23 lines) Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Error in Passing Parameters in Macros (Urgent)Excel, Word, DDE and PasteExcel, Word, DDE and Paste (213 lines) Re: Excel, Word, DDE and Paste (39 lines) Re: Excel, Word, DDE and Paste (49 lines) Exit macroFisher's Exact Test vs Generalized Linear ModelsFormat in Proc SQL ...a syntax questionFree Online: Data Mining Intro for BeginnersFree Online: Data Mining Intro for Beginners (45 lines) Friday humor - list of clinical sas programmer distractionsFriday humor - list of clinical sas programmer distractions (98 lines) GLM procedureGLM procedure (32 lines) Re: GLM procedure (43 lines) Generate observations with a specific range of randomlyRe: Generate observations with a specific range of randomly (57 lines) Generate observations with a specific range of randomly chosen valuesGoogle Book Search for SAS Publishing TitlesHelp: a probelm about X command in a data step!Help: a probelm about X command in a data step! (29 lines) Help: a problem about X command in a data step!Re: Help: a problem about X command in a data step! (49 lines) How can I copy the whole directory (library XX) to another location using libname statement?Re: How can I copy the whole directory (library XX) to another location using libname statement? (38 lines) How could I add multi-hyperlinks automatically in a wordRe: How could I add multi-hyperlinks automatically in a word (61 lines) How could I add multi-hyperlinks automatically in a word documents?How could I add multi-hyperlinks automatically in a word documents? (23 lines) Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Excel, Word, DDE and PasteExcel, Word, DDE and Paste (213 lines) Re: Excel, Word, DDE and Paste (39 lines) Re: Excel, Word, DDE and Paste (49 lines) Exit macroFisher's Exact Test vs Generalized Linear ModelsFormat in Proc SQL ...a syntax questionFree Online: Data Mining Intro for BeginnersFree Online: Data Mining Intro for Beginners (45 lines) Friday humor - list of clinical sas programmer distractionsFriday humor - list of clinical sas programmer distractions (98 lines) GLM procedureGLM procedure (32 lines) Re: GLM procedure (43 lines) Generate observations with a specific range of randomlyRe: Generate observations with a specific range of randomly (57 lines) Generate observations with a specific range of randomly chosen valuesGoogle Book Search for SAS Publishing TitlesHelp: a probelm about X command in a data step!Help: a probelm about X command in a data step! (29 lines) Help: a problem about X command in a data step!Re: Help: a problem about X command in a data step! (49 lines) How can I copy the whole directory (library XX) to another location using libname statement?Re: How can I copy the whole directory (library XX) to another location using libname statement? (38 lines) How could I add multi-hyperlinks automatically in a wordRe: How could I add multi-hyperlinks automatically in a word (61 lines) How could I add multi-hyperlinks automatically in a word documents?How could I add multi-hyperlinks automatically in a word documents? (23 lines) Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Exit macroFisher's Exact Test vs Generalized Linear ModelsFormat in Proc SQL ...a syntax questionFree Online: Data Mining Intro for BeginnersFree Online: Data Mining Intro for Beginners (45 lines) Friday humor - list of clinical sas programmer distractionsFriday humor - list of clinical sas programmer distractions (98 lines) GLM procedureGLM procedure (32 lines) Re: GLM procedure (43 lines) Generate observations with a specific range of randomlyRe: Generate observations with a specific range of randomly (57 lines) Generate observations with a specific range of randomly chosen valuesGoogle Book Search for SAS Publishing TitlesHelp: a probelm about X command in a data step!Help: a probelm about X command in a data step! (29 lines) Help: a problem about X command in a data step!Re: Help: a problem about X command in a data step! (49 lines) How can I copy the whole directory (library XX) to another location using libname statement?Re: How can I copy the whole directory (library XX) to another location using libname statement? (38 lines) How could I add multi-hyperlinks automatically in a wordRe: How could I add multi-hyperlinks automatically in a word (61 lines) How could I add multi-hyperlinks automatically in a word documents?How could I add multi-hyperlinks automatically in a word documents? (23 lines) Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Fisher's Exact Test vs Generalized Linear ModelsFormat in Proc SQL ...a syntax questionFree Online: Data Mining Intro for BeginnersFree Online: Data Mining Intro for Beginners (45 lines) Friday humor - list of clinical sas programmer distractionsFriday humor - list of clinical sas programmer distractions (98 lines) GLM procedureGLM procedure (32 lines) Re: GLM procedure (43 lines) Generate observations with a specific range of randomlyRe: Generate observations with a specific range of randomly (57 lines) Generate observations with a specific range of randomly chosen valuesGoogle Book Search for SAS Publishing TitlesHelp: a probelm about X command in a data step!Help: a probelm about X command in a data step! (29 lines) Help: a problem about X command in a data step!Re: Help: a problem about X command in a data step! (49 lines) How can I copy the whole directory (library XX) to another location using libname statement?Re: How can I copy the whole directory (library XX) to another location using libname statement? (38 lines) How could I add multi-hyperlinks automatically in a wordRe: How could I add multi-hyperlinks automatically in a word (61 lines) How could I add multi-hyperlinks automatically in a word documents?How could I add multi-hyperlinks automatically in a word documents? (23 lines) Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Format in Proc SQL ...a syntax questionFree Online: Data Mining Intro for BeginnersFree Online: Data Mining Intro for Beginners (45 lines) Friday humor - list of clinical sas programmer distractionsFriday humor - list of clinical sas programmer distractions (98 lines) GLM procedureGLM procedure (32 lines) Re: GLM procedure (43 lines) Generate observations with a specific range of randomlyRe: Generate observations with a specific range of randomly (57 lines) Generate observations with a specific range of randomly chosen valuesGoogle Book Search for SAS Publishing TitlesHelp: a probelm about X command in a data step!Help: a probelm about X command in a data step! (29 lines) Help: a problem about X command in a data step!Re: Help: a problem about X command in a data step! (49 lines) How can I copy the whole directory (library XX) to another location using libname statement?Re: How can I copy the whole directory (library XX) to another location using libname statement? (38 lines) How could I add multi-hyperlinks automatically in a wordRe: How could I add multi-hyperlinks automatically in a word (61 lines) How could I add multi-hyperlinks automatically in a word documents?How could I add multi-hyperlinks automatically in a word documents? (23 lines) Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Free Online: Data Mining Intro for BeginnersFree Online: Data Mining Intro for Beginners (45 lines) Friday humor - list of clinical sas programmer distractionsFriday humor - list of clinical sas programmer distractions (98 lines) GLM procedureGLM procedure (32 lines) Re: GLM procedure (43 lines) Generate observations with a specific range of randomlyRe: Generate observations with a specific range of randomly (57 lines) Generate observations with a specific range of randomly chosen valuesGoogle Book Search for SAS Publishing TitlesHelp: a probelm about X command in a data step!Help: a probelm about X command in a data step! (29 lines) Help: a problem about X command in a data step!Re: Help: a problem about X command in a data step! (49 lines) How can I copy the whole directory (library XX) to another location using libname statement?Re: How can I copy the whole directory (library XX) to another location using libname statement? (38 lines) How could I add multi-hyperlinks automatically in a wordRe: How could I add multi-hyperlinks automatically in a word (61 lines) How could I add multi-hyperlinks automatically in a word documents?How could I add multi-hyperlinks automatically in a word documents? (23 lines) Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Friday humor - list of clinical sas programmer distractionsFriday humor - list of clinical sas programmer distractions (98 lines) GLM procedureGLM procedure (32 lines) Re: GLM procedure (43 lines) Generate observations with a specific range of randomlyRe: Generate observations with a specific range of randomly (57 lines) Generate observations with a specific range of randomly chosen valuesGoogle Book Search for SAS Publishing TitlesHelp: a probelm about X command in a data step!Help: a probelm about X command in a data step! (29 lines) Help: a problem about X command in a data step!Re: Help: a problem about X command in a data step! (49 lines) How can I copy the whole directory (library XX) to another location using libname statement?Re: How can I copy the whole directory (library XX) to another location using libname statement? (38 lines) How could I add multi-hyperlinks automatically in a wordRe: How could I add multi-hyperlinks automatically in a word (61 lines) How could I add multi-hyperlinks automatically in a word documents?How could I add multi-hyperlinks automatically in a word documents? (23 lines) Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time GLM procedureGLM procedure (32 lines) Re: GLM procedure (43 lines) Generate observations with a specific range of randomlyRe: Generate observations with a specific range of randomly (57 lines) Generate observations with a specific range of randomly chosen valuesGoogle Book Search for SAS Publishing TitlesHelp: a probelm about X command in a data step!Help: a probelm about X command in a data step! (29 lines) Help: a problem about X command in a data step!Re: Help: a problem about X command in a data step! (49 lines) How can I copy the whole directory (library XX) to another location using libname statement?Re: How can I copy the whole directory (library XX) to another location using libname statement? (38 lines) How could I add multi-hyperlinks automatically in a wordRe: How could I add multi-hyperlinks automatically in a word (61 lines) How could I add multi-hyperlinks automatically in a word documents?How could I add multi-hyperlinks automatically in a word documents? (23 lines) Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Generate observations with a specific range of randomlyRe: Generate observations with a specific range of randomly (57 lines) Generate observations with a specific range of randomly chosen valuesGoogle Book Search for SAS Publishing TitlesHelp: a probelm about X command in a data step!Help: a probelm about X command in a data step! (29 lines) Help: a problem about X command in a data step!Re: Help: a problem about X command in a data step! (49 lines) How can I copy the whole directory (library XX) to another location using libname statement?Re: How can I copy the whole directory (library XX) to another location using libname statement? (38 lines) How could I add multi-hyperlinks automatically in a wordRe: How could I add multi-hyperlinks automatically in a word (61 lines) How could I add multi-hyperlinks automatically in a word documents?How could I add multi-hyperlinks automatically in a word documents? (23 lines) Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Generate observations with a specific range of randomly chosen valuesGoogle Book Search for SAS Publishing TitlesHelp: a probelm about X command in a data step!Help: a probelm about X command in a data step! (29 lines) Help: a problem about X command in a data step!Re: Help: a problem about X command in a data step! (49 lines) How can I copy the whole directory (library XX) to another location using libname statement?Re: How can I copy the whole directory (library XX) to another location using libname statement? (38 lines) How could I add multi-hyperlinks automatically in a wordRe: How could I add multi-hyperlinks automatically in a word (61 lines) How could I add multi-hyperlinks automatically in a word documents?How could I add multi-hyperlinks automatically in a word documents? (23 lines) Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Google Book Search for SAS Publishing TitlesHelp: a probelm about X command in a data step!Help: a probelm about X command in a data step! (29 lines) Help: a problem about X command in a data step! Re: Help: a problem about X command in a data step! (49 lines) How can I copy the whole directory (library XX) to another location using libname statement?Re: How can I copy the whole directory (library XX) to another location using libname statement? (38 lines) How could I add multi-hyperlinks automatically in a wordRe: How could I add multi-hyperlinks automatically in a word (61 lines) How could I add multi-hyperlinks automatically in a word documents?How could I add multi-hyperlinks automatically in a word documents? (23 lines) Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Help: a probelm about X command in a data step!Help: a probelm about X command in a data step! (29 lines) Help: a problem about X command in a data step!Re: Help: a problem about X command in a data step! (49 lines) How can I copy the whole directory (library XX) to another location using libname statement?Re: How can I copy the whole directory (library XX) to another location using libname statement? (38 lines) How could I add multi-hyperlinks automatically in a wordRe: How could I add multi-hyperlinks automatically in a word (61 lines) How could I add multi-hyperlinks automatically in a word documents?How could I add multi-hyperlinks automatically in a word documents? (23 lines) Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Help: a problem about X command in a data step!Re: Help: a problem about X command in a data step! (49 lines) How can I copy the whole directory (library XX) to another location using libname statement?Re: How can I copy the whole directory (library XX) to another location using libname statement? (38 lines) How could I add multi-hyperlinks automatically in a wordRe: How could I add multi-hyperlinks automatically in a word (61 lines) How could I add multi-hyperlinks automatically in a word documents?How could I add multi-hyperlinks automatically in a word documents? (23 lines) Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time How can I copy the whole directory (library XX) to another location using libname statement?Re: How can I copy the whole directory (library XX) to another location using libname statement? (38 lines) How could I add multi-hyperlinks automatically in a wordRe: How could I add multi-hyperlinks automatically in a word (61 lines) How could I add multi-hyperlinks automatically in a word documents?How could I add multi-hyperlinks automatically in a word documents? (23 lines) Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time How could I add multi-hyperlinks automatically in a wordRe: How could I add multi-hyperlinks automatically in a word (61 lines) How could I add multi-hyperlinks automatically in a word documents?How could I add multi-hyperlinks automatically in a word documents? (23 lines) Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time How could I add multi-hyperlinks automatically in a word documents?How could I add multi-hyperlinks automatically in a word documents? (23 lines) Re: How could I add multi-hyperlinks automatically in a word documents? (42 lines) How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time How to RANDOMLY split a whole dataset into two sub-dataset?Re: How to RANDOMLY split a whole dataset into two sub-dataset? (78 lines) Re: How to RANDOMLY split a whole dataset into two sub-dataset? (69 lines) How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time How to erase a dataset using the command bar?How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time How to randomly split a whole dataset into two sub-dataset?Re: How to randomly split a whole dataset into two sub-dataset? (38 lines) How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time How to turn off ods csvall "file download" dialog windowHow to turn off ods csvall "file download" dialog window (15 lines) Re: How to turn off ods csvall "file download" dialog window (24 lines) Re: How to turn off ods csvall "file download" dialog window (35 lines) Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Identifying Overlapping PeriodsIncrease P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Increase P-Value for H-L test in logistic regressionIncrease P-Value for H-L test in logistic regression (27 lines) Re: Increase P-Value for H-L test in logistic regression (38 lines) Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Invoking SAS from non SAS environment!Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Is it possible to use GEE to model my data?Is it possible to use GEE to model my data? (116 lines) Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Koyck lag specification in cox modelsKoyck lag specification in cox models (14 lines) Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Largest amount of text that can be placed into a SAS dataset cell?Re: Largest amount of text that can be placed into a SAS dataset cell? (17 lines) Re: Largest amount of text that can be placed into a SAS dataset cell? (58 lines) Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Linear Trend in Proc ArimaLinear Trend in Proc Arima (32 lines) Re: Linear Trend in Proc Arima (83 lines) Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Loading data to oracle taking a long timeRe: Loading data to oracle taking a long time (41 lines) Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Mapping different scale Survey dataRe: Mapping different scale Survey data (79 lines) Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Meta data informationModeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Modeling Question--Transforming a VariableRe: Modeling Question--Transforming a Variable (177 lines) Re: Modeling Question--Transforming a Variable (50 lines) Re: Modeling Question--Transforming a Variable (241 lines) Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Moving to the next lineRe: Moving to the next line (100 lines) Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Multinomial Regression?Multinomial Regression? (42 lines) Re: Multinomial Regression? (59 lines) My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time My "Common Unix Commands" document updatedMy new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time My new book "Saving Time and Money Using SAS" is now available world-wide!My new book "Saving Time and Money Using SAS" is now available world-wide! (31 lines) Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Need Map datasets for AustraliaRe: Need Map datasets for Australia (45 lines) Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Need help in Arrays and do loopsNegative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Negative duplicationNewey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Newey-corrected t-statsRe: Newey-corrected t-stats (46 lines) OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time OLAP alternativesOLAP alternatives (16 lines) Re: OLAP alternatives (23 lines) Re: OLAP alternatives (30 lines) ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time ORACLE Date FormatRe: ORACLE Date Format (7 lines) OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time OT - Friday HumorRe: OT - Friday Humor (38 lines) Re: OT - Friday Humor (42 lines) OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time OT: second french newspaper publish about Sas InstituteOT: second french newspaper publish about Sas Institute (157 lines) Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Ordinal logistic regression question on classification tableOrdinal logistic regression question on classification table (67 lines) Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time Ouput window displays no resultsPROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time PROC GCHART - Pie chart, slice labelRe: PROC GCHART - Pie chart, slice label (42 lines) PROC LP CPU time	{"url":"http://www.listserv.uga.edu/cgi-bin/wa?A1=ind0707d&L=sas-l&H=1&T=0","timestamp":"2014-04-16T16:26:29Z","content_type":null,"content_length":"96856","record_id":"<urn:uuid:9c244e5d-0be5-480a-bc0e-0a7d8fb6db5f>","cc-path":"CC-MAIN-2014-15/segments/1397609524259.30/warc/CC-MAIN-20140416005204-00213-ip-10-147-4-33.ec2.internal.warc.gz"}
Help me find a multiplication toy. Help me find a multiplication toy. I would like to purchase for my nephew a learning toy that I had as a kid. I can not seem to find it anywhere, and hope that someone here can help me out, since this is a sort of math-related Basically, it is a multiplication (or addition) learning toy. The toy has a plastic frame, with the numbers 1 through 10 enumerated along the top and bottom in the normal format of a multiplication table. Aligned with the numbers is a square make of 100 elevated white plastic cubic buttons. When one of the cubes is depressed, you can see the correct entry for that cell of the multiplication table through the thin plastic surface of the cube. Help me out here. Gotta make my nephew smart. Just get the kid a computer. You'll be the best uncle ever! I had that toy. Don't remember the name of it and don't know where you'd find it now. But at least you're not making things up. Am I close? Thank you SO MUCH. I've looked long and hard for that. Not a problem. I hope your nephew enjoys it.	{"url":"http://cboard.cprogramming.com/brief-history-cprogramming-com/92948-help-me-find-multiplication-toy-printable-thread.html","timestamp":"2014-04-21T17:02:17Z","content_type":null,"content_length":"8091","record_id":"<urn:uuid:b5605f8f-2050-4a94-8a3e-4c0359c0a28c>","cc-path":"CC-MAIN-2014-15/segments/1397609540626.47/warc/CC-MAIN-20140416005220-00560-ip-10-147-4-33.ec2.internal.warc.gz"}
Power Series November 23rd 2009, 11:05 PM #1 Apr 2009 Power Series Im having trouble with this power series, I know it converges absolutely but im having trouble getting there. any help appreciated, Thanks. Are you trying to prove it converges absolutely? If so, you need to show that $\lim_{n \to \infty}\left\|\frac{a_{n + 1}}{a_n}\right\| < 1$. So in your case $a_n = \frac{x^{2n + 1}}{n!}$ and $a_{n + 1} = \frac{x^{2n + 3}}{(n + 1)!}$. Thus $\left\|\frac{a_{n + 1}}{a_n}\right\| = \left\|\frac{x^{2n + 3}}{(n + 1)!}\cdot \frac{n!}{x^{2n + 1}}\right\|$ $= \frac{x^2}{n + 1}$. What happens as $n \to \infty$? awesome thanks for the quick post, ya sorry I needed to prove a.c. it eventually gets infinity small < 1 In fact, you can determine what that sum is equal to. It is well known that $e^x= \sum_{n=0}^\infty \frac{x^n}{n!}$. Here you have $\sum_{n=0}^\infty \frac{x^{2n+1}}{n!}= \sum_{n=0}^\infty x\frac {(x^2)^n}{n!}= x e^{x^2}$ If this power series isn't known to you (which it really should be) we can find it slighly differently. Suppose we just want to find the explicity function described by $f(x)=\sum_{n=0}^{\infty}\ frac{x^{2n}}{n!}$ notice that we may (take for granted here that you can...there is criterion it needs to meet but it does...so) differentate to obtain $f'(x)=\sum_{n=1}^{\infty}\frac{2nx^{2n-1}} {n!}=\sum_{n=0}^{\infty}\frac{2(n+1)x^{2(n+1)-1}}{(n+1)!}=\sum_{n=0}^{\infty}\frac{2x^{2n+1}}{n! }=2xf(x)$. Therefore, $f'(x)=2xf(x)\implies \frac{f'(x)}{f(x)}=2x\implies \ln\left(f(x)\right)=x^ 2+C\implies f(x)=C_1e^{x^2}$. And seeing that $f(0)=1$ we can conclude that $C_1=1\implies f(x)=e^{x^2}$ therefore $\sum_{n=0}^{\infty}\frac{x^{2n+1}}{n!}=xf(x)=xe^{x ^2}$. November 23rd 2009, 11:11 PM #2 November 23rd 2009, 11:20 PM #3 Apr 2009 November 24th 2009, 03:42 AM #4 MHF Contributor Apr 2005 November 24th 2009, 07:57 AM #5	{"url":"http://mathhelpforum.com/calculus/116441-power-series.html","timestamp":"2014-04-16T07:50:19Z","content_type":null,"content_length":"49448","record_id":"<urn:uuid:764e0e9f-b785-4250-8464-c28e265b805d>","cc-path":"CC-MAIN-2014-15/segments/1397609521558.37/warc/CC-MAIN-20140416005201-00496-ip-10-147-4-33.ec2.internal.warc.gz"}
Posts about SAS on Xi'an's Og I spotted on R-bloggers a post discussing optimising the efficiency of programming accept-reject algorithms. While it is about SAS programming, and apparently supported by the SAS company, there are two interesting features with this discussion. The first one is about avoiding the dreaded loop in accept-reject algorithms. For instance, taking the case of the truncated-at-one Poisson distribution, the code while (length(sampl)<n){ if (x!=0) sampl=c(sampl,x)} is favoured by my R course students but highly inefficient: > system.time(rtpois(10^5,.5)) user system elapsed 61.600 27.781 98.727 both for the stepwise increase in the size of the vector and for the loop. For instance, defining the vector sampl first requires a tenth of the above time (note the switch from 10⁵ to 10⁶): > system.time(rtpois(10^6,.5)) user system elapsed 54.155 0.200 62.635 As discussed by the author of the post, a more efficient programming should aim at avoiding the loop by predicting the number of proposals necessary to accept a given number of values. Since the bound M used in accept-reject algorithms is also the expected number of attempts for one acceptance, one should start with something around Mn proposed values. (Assuming of course all densities are properly normalised.) For instance, in the case of the truncated-at-one Poisson distribution based on proposals from the regular Poisson, the bound is 1/1-e^-λ. A first implementation of this principle is to build the sample via a few loops: if (n0>=n) else return(c(propal,rtpois(n-n0,lambda))) with a higher efficiency: > system.time(rtpois(10^6,.5)) user system elapsed 0.816 0.092 0.928 Replacing the expectation with an upper bound using the variance of the negative binomial distribution does not make a significant dent in the computing time if (n0>=n) else return(c(propal,rtpois(n-n0,lambda)))} since we get > system.time(rtpois(10^6,.5)) user system elapsed 0.824 0.048 0.877 The second point about this Poisson example is that simulating a distribution with a restricted support using another distribution with a larger support is quite inefficient. Especially when λ goes to zero By comparison, using a Poisson proposal with parameter μ and translating it by 1 may bring a considerable improvement: without getting into the gory details, it can be shown that the optimal value of μ (in terms of maximal acceptance probability) is λ and that the corresponding probability of acceptance is which is larger than the probability of the original approach when λ is less than one. As shown by the graph below, this allows for a lower bound in the probability of acceptance that remains	{"url":"http://xianblog.wordpress.com/tag/sas/","timestamp":"2014-04-19T08:02:37Z","content_type":null,"content_length":"69814","record_id":"<urn:uuid:ab985d35-c278-4478-a51e-3abd916b1aa7>","cc-path":"CC-MAIN-2014-15/segments/1397609536300.49/warc/CC-MAIN-20140416005216-00655-ip-10-147-4-33.ec2.internal.warc.gz"}
[Numpy-discussion] using numpy functions on an array of objects Robert Kern robert.kern@gmail.... Sat Jan 31 17:24:52 CST 2009 On Sat, Jan 31, 2009 at 10:30, Sebastian Walter <sebastian.walter@gmail.com> wrote: > Wouldn't it be nice to have numpy a little more generic? > All that would be needed was a little check of the arguments. > If I do: > numpy.trace(4) > shouldn't numpy be smart enough to regard the 4 as a 1x1 array? Why? It's not a 1x1 array. It's a scalar. If you want a 1x1 array, give it a 1x1 array. > numpy.sin(4) works! Yes, numpy.sin() operates on scalars in addition to arrays. > and if > x = my_class(4) > wouldn't it be nice if > numpy.trace(x) > would call > x.trace() ? > numpy.sin(my_class(4)) works! > Wouldn't it be nice if numpy worked a little more consistent. > Is this worth a ticket? Or am I missing something here? numpy.sin() is a ufunc. Unary ufuncs will call the method of the same name on objects in an object array (or the scalar itself if given an object scalar). For example: In [8]: class MyClass(object): ...: def __init__(self, x): ...: self.x = x ...: def __repr__(self): ...: return 'MyClass(%r)' % (self.x,) ...: def sin(self): ...: return MyClass(self.x+1) In [9]: sin(MyClass(4)) Out[9]: MyClass(5) In [10]: sin([MyClass(4), MyClass(5)]) Out[10]: array([MyClass(5), MyClass(6)], dtype=object) You'll notice that numpy.sin() does not try to call the list.sin() method when given the list. It interprets it as an object array, and calls the MyClass.sin() method on each of the elements. numpy.trace() is not an unary ufunc. It's just a function that operates on (N>=2)-D arrays. You simply couldn't apply the same rules as numpy.sin(). Otherwise, it would try to call the .trace() method on each of the objects in your container, and obviously you can't implement trace that way. Having numpy.trace(x) simply call x.trace() would not be making numpy more consistent. Now, that said, the implementation of numpy.trace(x, args) is actually simply asarray(x).trace(args). That should probably be asanyarray(x) in order to allow ndarray subclasses. But this only works because ndarray.trace() already exists. Making every function in numpy check for a method first is just not going to happen. Robert Kern "I have come to believe that the whole world is an enigma, a harmless enigma that is made terrible by our own mad attempt to interpret it as though it had an underlying truth." -- Umberto Eco More information about the Numpy-discussion mailing list	{"url":"http://mail.scipy.org/pipermail/numpy-discussion/2009-January/040023.html","timestamp":"2014-04-20T03:24:07Z","content_type":null,"content_length":"5430","record_id":"<urn:uuid:5e798a34-0731-427e-95f7-8d80138d5c35>","cc-path":"CC-MAIN-2014-15/segments/1397609538787.31/warc/CC-MAIN-20140416005218-00497-ip-10-147-4-33.ec2.internal.warc.gz"}
Anchor Chain Snubber Design Shortly, I will be building snubbers for the all-chain rode of my soon to arrive (“end of Dec”) Krogen 39, so I started looking into design specifications. Finding no specifications, I then started thinking about design criteria and analysis. I don’t remember ever reading anything anywhere about the specifics of snubber design or analysis, (has anyone else on the list?), so I started down that road. First off, I found out that premium three-stranded nylon New England Ropes line stretches 16% at its safe working load, SWL, and the SWL is 15% of its average breaking strength, ABS. The latter is rather remarkable; I didn’t realize that it was so low. Anyway, the first question is, How much stretch do we need at the SWL limit? I have no idea but consider the following table: (L = S / 0.16) ┃Stretch (ft) at│Length (ft) of┃ ┃ the SWL │ Line Needed ┃ ┃ 1 │ 6.25 ┃ ┃ 2 │ 12.50 ┃ ┃ 3 │ 18.75 ┃ ┃ 4 │ 25.00 ┃ ┃ 5 │ 31.25 ┃ ┃ 6 │ 37.50 ┃ ┃ 7 │ 43.75 ┃ ┃ 8 │ 50.00 ┃ ┃ 10 │ 62.50 ┃ ┃ 15 │ 93.75 ┃ ┃ 20 │ 125.00 ┃ ┃ 30 │ 187.50 ┃ ┃ 40 │ 250.00 ┃ 4 feet and 8 feet of stretch jump out at me based on the nice round number of the length of line needed. It tickles my fancy. I think I will go with 4 feet of stretch with 25 feet of line. That feels right to me. What do you think? (ps: If the SWL is exceeded, the line length will be permanently increased and its stretchability will be decreased.) Now, what size line do we need? Well that depends on the wind strength. If you want 4 feet of stretch at the high end of each line's wind range, then you have to have a number of snubber lines in order to cover the entire set of wind ranges. This will become more clear later. Consider the next table: ┃Line Size (in)│ABS (#)│SWL (#)│Wind strength (kn) @ SWL┃ ┃ 1/4 │ 2000 │ 300 │ 15.0 ┃ ┃ 5/16 │ 3000 │ 450 │ 18.4 ┃ ┃ 3/8 │ 4400 │ 660 │ 22.4 ┃ ┃ 7/16 │ 5900 │ 885 │ 25.8 ┃ ┃ 1/2 │ 7500 │ 1125 │ 29.0 ┃ ┃ 9/16 │ 9400 │ 1410 │ 32.5 ┃ ┃ 5/8 │ 12200 │ 1830 │ 37.0 ┃ ┃ 3/4 │ 16700 │ 2504 │ 43.3 ┃ ┃ 1 │ 29400 │ 4410 │ 57.5 ┃ ┃ │ 32000 │ 4800 │ 60.0 ┃ ┃ │ 50000 │ 7500 │ 75.0 ┃ The wind strengths needed to generate the SWL-limit forces were calculated using V = (SWL/1.333)^0.5 which was derived from the ABYC anchor load tables for a 40 foot powerboat. Yes, I know the ABYC numbers are conservative, but so am I. Son of a gun, that’s a lot of possible snubbers. I wonder what my all chain catenary will do for me; maybe it can eliminate some of the smaller snubbers. Then probably 3/4 (43kn), 9/16 (32 kn.), and 7/16 (26 kn.) will do it. This choice results in a loss of 2 (an arbitrary choice) of the 4 feet of desired stretch, at the low end of the usable wind range of the snubber. For example, if 3/4" line were used in 43.3 kn. of wind, the snubber would stretch out the full 4 feet. However, if the wind were to drop to 32.5 kn, it would stretch only 2 feet. In order to have 4 feet of stretch in a 32.5 knot wind, the snubber would have to be 9/16". I could use 2 ea. 3/4’s for 60 knots and 3 ea. for 75 knots. Or maybe just one 3/4 as it has a breaking strength much higher than the wind forces. That way if I ever encounter a 60 or more knot wind, I could use the 3/4 snubber and then throw it away afterwards and get a new one. One thing you should note is that in order to ensure that the SWL of the snubber is not exceeded, the length of the stretch has to be limited. This can be done by adjusting the length of the chain, from the chain hook to the bow, so that it is not longer than 29 feet, ie the 25’ length of the snubber plus the allowed 4 feet of stretch. However, limiting the stretch defeats the purpose of the snubber. I determined that the boat will move horizontally X feet from the position it had with no wind nor current, i.e. from where the chain was hanging straight down, to the position it will have when the chain is bar tight. The equation is: X = ((S^2 - 1)^.5 - (S-1))(D+B) S is the scope as defined by: Length of chain L = S(D+B) D = depth of water B is the height of the bow (about 7’ for my K39). For example, for a 7:1 scope in 30’ of water the boat will move 34’, almost a boat length. Next comes the catenary. It has a little more math to it, but what the heck, if you are still reading this then I suppose you want the math. So here it is such as it is. Being a little lazy, I made a simplifying assumption, namely that the weight of the chain will be a point mass in the middle of the span, in order to make the math easier. I then took the sum of the X axis components and the sum of the Y axis forces and ended up with two equations in five unknowns. From this I solved for T1, the force acting on the bow. The results are as follows: T1 = W/(sin b - (cos b * tan a)) W = the weight of the chain W = wL = wS*(D+B) w = the unit weight of the chain; 1.5 #/ft for 3/8 hi test S = L/(D + B) = scope L, D, and B as described previously b = phi + d a = phi - d phi = the angle of the chain to the horizontal when bar tight phi = arc sin 1/S d = the number of degrees the middle of the chain is from being bar tight. F = T1 cos b = the horizontal force of the wind and waves on the boat. kn. = the wind strength that produces F. Since there are 5 unknowns, I selected the value of 3 and solved for the other two. I selected the depth to be 15 feet and the scope to be 5:1, a somewhat typical situation. Then I selected several values of d and solved for the corresponding values of T1, the force on the bow. The results are as follows: ┃ d │ T1 │ F │kn┃ ┃ 2 │2346│2281│40┃ ┃ 4 │1175│1132│29┃ ┃ 6 │740 │753 │23┃ ┃ 8 │591 │563 │20┃ ┃ 10 │442 │448 │18┃ ┃11.5│422 │389 │17┃ Drawing conclusions from this one condition of depth and scope, and from equations that were derived from a simplified model, is fraught with dangers but I am going to do it anyway. Its either that or 4 more tables to define the extremes: shallow water and short scope, shallow water and long scope, deep water and short scope, and deep water and long scope. Or worse yet, ditch the assumption, redo the analysis and then do the 4 extreme conditions. So here goes with conclusion leaping. It looks like the chain catenary will provide adequate snubbing for my boat in winds up to about 20 knots. After that the forces needed to straighten the chain any more get progressively higher in a hurry, i.e. the boat has moved back almost all the way at 20 knots. This can be seen by plotting the data of the above table. I would be greatly interested in hearing from anyone who has had contrary experiences with similar hardware and conditions. 1. Stretch is a function of line length, line size and the force applied. The amount of stretch required to do a good job of snubbing is the big gaping hole in this analysis. But you can choose length based on experience and what feels right. I will go with 4 feet of stretch. Maybe more is needed for the higher wind ranges, I don’t know. Does anyone else have a handle on this? 2. One snubber does not fit all. Three or more snubbers are needed. I will use 1/2" line for (expected) gusts of wind from 15 to 29 knots, 5/8” to 37 kn, 3/4" to 43 kn, and two 3/4" lines for over 43 kn gusts. 3. If the SWL is not to be exceeded, then the amount of stretch needs to be physically restrained by a loop of chain of the appropriate length. 4. I think that if the expected wind is higher than 43 kn., I will use two 3/4 inch snubbers and leave extra length in the chain of the snubber loop, ie not let it bottom out. 5. I think I will also use rubber snubbers like Falcon Line-Master Compensators (p574 of the West Marine catalog). This is intended to enhance the snubbing effect in the lower end of the snubber’s wind range. 6. A boat will move back about one boat length max when all of the slack of the chain is taken out by wind, current, or wave forces. 7. The chain alone should provide sufficient snubbing in winds up to 20 kn., if you have a K39 and 3/8” high test chain or the equal. (Experience has shown that 15 to 18 knots is a better number.) 8. If you need more snubbing in winds less than 20 kn., let out more chain. p.s.: Experience has shown that I can use the 5/8" line over 95% of the time, from 15 to 37 knots of wind. And I only need to use about 6 to 10 feet of the line. The rest I use to secure the loose loop of chain so it won't rub against the boat. However, if I ever have to anchor off of a lee shore in a blow, I will use the full 25 feet of the snubber. NK 1-27-07	{"url":"http://kluznick.com/Snubber.html","timestamp":"2014-04-16T17:39:45Z","content_type":null,"content_length":"49356","record_id":"<urn:uuid:bbf1a8d6-7c4e-4e90-8f00-9bbb43df78d0>","cc-path":"CC-MAIN-2014-15/segments/1397609524259.30/warc/CC-MAIN-20140416005204-00508-ip-10-147-4-33.ec2.internal.warc.gz"}
The two polarization waveforms 10.4 The two polarization waveforms The theoretical templates of the compact binary inspiral follow from insertion of the previous solutions for the 3.5PN-accurate orbital frequency and phase into the binary’s two polarization waveforms [46, 4 ]. The polarization waveforms are defined with respect to two polarization vectors where The post-Newtonian terms are ordered by means of the frequency-related variable where 226)), and where For the cross polarization, we have We use the shorthands [4] is reported here: The practical implementation of the theoretical templates in the data analysis of detectors follows the standard matched filtering technique. The raw output of the detector and divide where theoretically computed template 243) maximizes the SNR if To conclude, the use of theoretical templates based on the preceding 2.5PN wave forms, and having their frequency evolution built in via the 3.5PN phase evolution (234, 235), should yield some accurate detection and measurement of the binary signals. Interestingly, it should also permit some new tests of general relativity, because we have the possibility of checking that the observed signals do obey each of the terms of the phasing formulas (234, 235), e.g., those associated with the specific non-linear tails, exactly as they are predicted by Einstein’s theory [47, 48, 5]. Indeed, we don’t know of any other physical systems for which it would be possible to perform such tests.	{"url":"http://relativity.livingreviews.org/Articles/lrr-2006-4/articlesu26.html","timestamp":"2014-04-20T23:28:46Z","content_type":null,"content_length":"18673","record_id":"<urn:uuid:61438590-b6a1-4f3d-91af-ed7c758e4d82>","cc-path":"CC-MAIN-2014-15/segments/1398223210034.18/warc/CC-MAIN-20140423032010-00333-ip-10-147-4-33.ec2.internal.warc.gz"}
Rubinstein's Proof [Note: See Definition 3.2 for the notation used in this proof.] Let T[2] denote the number of messages that Joanna's e-mail system sends, and T[1] denote the number of messages that Lizzi's e-mail system sends. We might suppose that T[i] appears on each agent's computer screen. If T[1] = 0, then Lizzi sends no message, that is, ω[1] has occurred, in which case Lizzi's unique best response is to choose A. If T[2] = 0, then Joanna did not receive a message. She knows that in this case, either ω[1] has occurred and Lizzi did not send her a message, which occurs with probability .51, or ω[2] has occurred and Lizzi sent her a message which did not arrive, which occurs with probability .49ε. If ω[1] has occurred, then Lizzi is sure to choose A, so Joanna knows that whatever Lizzi might do at ω[2], E(u[2](A) \| T[2]=0) ≥ 2(.51) + 0(.49)ε .51 + .49ε > −4(.51) + 2(.49)ε .51 + .49ε ≥ E(u[2](B) \| T[2]=0 ) so Joanna is strictly better off choosing A no matter what Lizzi does at either state of the world. Suppose next that for all T[i] < t, each agents' unique best response given her expectations regarding the other agent is A, so that the unique Nash equilibrium of the game is (A,A). Assume that T[1] = t. Lizzi is uncertain whether T[2] = t, which is the case if Joanna received Lizzi's t^th automatic confirmation and Joanna's t^th confirmation was lost, or if T[2] = t − 1, which is the case if Lizzi's t^th confirmation was lost. Then μ[1](T[2] = t−1 \| T[1] = t) = z > ½.^[1] Thus it is more likely that Lizzi's last confirmation did not arrive than that Joanna did receive this message. By the inductive assumption, Lizzi assesses that Joanna will choose A if T[2] = t−1. So E(u[1](B) \| T[1] = t) ≤ −4z + 2(1−z) = −6z + 2 < −3 + 2 = −1, E(u[1](A) \| T[1] = t) = 0 since Lizzi knows that ω[2] is the case. So Lizzi's unique best action is A. Similarly, one can show that A is Joanna's best reply if T[2] = t. So by induction, (A,A) is the unique Nash equilibrium of the game for every t ≥ 0.	{"url":"http://plato.stanford.edu/entries/common-knowledge/rubinsteinsproof.html","timestamp":"2014-04-16T07:35:45Z","content_type":null,"content_length":"17862","record_id":"<urn:uuid:c97d28c7-77ce-4c09-9316-40f5573f3298>","cc-path":"CC-MAIN-2014-15/segments/1397609521558.37/warc/CC-MAIN-20140416005201-00630-ip-10-147-4-33.ec2.internal.warc.gz"}
[Haskell-cafe] Re: type trickery oleg at okmij.org oleg at okmij.org Thu Dec 20 05:57:35 EST 2007 Adrian Neumann wrote: > I figured I'd need something like this > data GF = GF Integer Integer > so that each element of the finite field would remember p. However I > can't think of a way to use the typesystem to ensure that p is always > the same. You might like: Vectro: Haskell library for "statically typed linear algebra" which marks each element of a vector space with its dimension. The type system makes sure that you can only add vectors of the same dimension (the type system does even more: it computes the dimension of a result of multiplying a vector by a non-square matrix, for > I think that would need an infinite number of different types, You think correctly. Haskell already has the infinite number of different types (e.g., the infinite number of function types). More information about the Haskell-Cafe mailing list	{"url":"http://www.haskell.org/pipermail/haskell-cafe/2007-December/036688.html","timestamp":"2014-04-17T08:15:06Z","content_type":null,"content_length":"3396","record_id":"<urn:uuid:4a778cc7-9504-429c-910d-4ffa561da35f>","cc-path":"CC-MAIN-2014-15/segments/1397609526311.33/warc/CC-MAIN-20140416005206-00620-ip-10-147-4-33.ec2.internal.warc.gz"}
from the CUPM Curriculum Guide Only connect! David M. Bressoud May, 2005 Recommendation 3: Communicate the breadth and interconnections of the mathematical sciences. Every course should strive to • Present key ideas and concepts from a variety of perspectives; • Employ a broad range of examples and applications to motivate and illustrate the material; • Promote awareness of connections to other subjects (both in and out of the mathematical sciences) and strengthen each student’s ability to apply the course material to these subjects; • Introduce contemporary topics from the mathematical sciences and their applications, and enhance student perceptions of the vitality and importance of mathematics in the modern world. “Only connect! … Live in fragments no longer” [Howard’s End, E.M. Forster] is a plea to unite the dual aspects of our nature: the monk and the beast. I find it appropriate advice to those of us who teach mathematics, a plea to unite the multiple aspects of the mathematical concepts that we present to our students. As mathematicians, we recognize that the power of mathematics comes from the web of connections in which each idea rests. The derivative is a powerful idea precisely because it unites symbolic manipulation with the geometric concept of a tangent line and the dynamic concept of a rate of change. It tells us about the microscopic behavior of a function and so provides a means of approximation. It can be interpreted as a one-dimensional Jacobian, expressing local magnification. It is the inverse of an operation that accumulates, i.e. integration. Most importantly, it enables the language of differential equations with which we can model almost any phenomenon that changes in response to external stimuli. In other words, it is a concept at the nexus of many mathematical ideas. The connections it establishes are what make it important. How many of our students finish first-year calculus with an appreciation for the power of this concept? I remember my own sense of amazement mixed with horror the first time I sat down with a student to probe his understanding of the derivative. He had successfully completed calculus through several variables. He understood differentiation as a process that “turns functions into simpler functions, like x cubed into three x squared.” As much as I questioned, hinted, and suggested, I could evoke no other connections. Is there any sense in which such a student has learned calculus? This was the question that led to the calculus reform movement. The first bullet of this recommendation echoes its rallying cry: to teach the ideas not just symbolically but also graphically, numerically, and verbally. This is not just a call for us to draw pictures, analyze data, and describe situations. Students do not learn from what we do. They learn from what they do. They must build their own repertoires of experiences with pictures, data, and concrete situations. This recommendation is more than a request to embrace the rule of four. This recommendation says that we need to provide opportunities for our students to discover the rich texture of mathematics, especially contemporary concepts. The CUPM-Illustrative Resources lists many sources with suggestions for enriching undergraduate courses. A brief sampling of what can be found in the CUPM-IR • A collection of MAA publications including Applications of Calculus, edited by Philip Straffin (MAA Notes # 29), Cryptology, by Albrecht Beutelspacher, Elementary Cryptanalysis by Abraham Sinkov, Environmental Math in the Classroom, edited by Bernard Fusaro and Patricia Kenschaft, Geometry at Work, edited by Catherine Gorini, Linear Algebra Gems, edited by David Carlson, Charles R. Johnson, David C. Lay, A. Duane Porter, and Problems for Student Investigation, edited by Michael Jackson and John Ramsay, • Robert Devaney's Dynamical Systems and Technology Project, • The Heart of Mathematics: An invitation to effective thinking by Ed Burger and Michael Starbird, • Mathematics : Contemporary Topics and Applications, a first-year course developed at the University of Maryland University College, • Duke University’s Connected Curriculum Project, • MAA’s Journal of Online Mathematics and its Applications (JOMA), and, the grand-daddy of them all, • The Consortium for Mathematics and Its Applications (COMAP) which has been building its database of applications since 1980. There is yet another aspect to this recommendation. That is the challenge to think about traditional courses from radically different perspectives. I believe that there are students who benefit from a calculus course that is taught from a logical, rigorously deductive point of view. I know there are students who would best learn what they need in calculus from a geometrically grounded, conceptual course. Linear algebra can and often should be taught from a geometric point of view. Traditionally, statistical analysis has been built from probability theory. George Cobb at Mount Holyoke and Danny Kaplan at Macalester have developed courses that build these same statistical tools from Monte Carlo simulations. Computational science, an orphan that often finds itself abandoned in the gap between mathematics and computer science, is in fact an important and exciting field that can motivate and lend its perspectives to much of the undergraduate curriculum. References to many of these courses can be found in the CUPM-IR. It is not easy to teach this way. We need to find ways to help our students discover the power of these connections for themselves, and we need to find means of determining whether or not they really are getting the message. There is a large and growing community of mathematicians who strive for this level of teaching. We need to continue to learn from each other. Do you know of programs, projects, or ideas that should be included in the CUPM Illustrative Resources? Submit resources at www.maa.org/cupm/cupm_ir_submit.cfm. We would appreciate more examples that document experiences with the use of technology as well as examples of interdisciplinary cooperation. ││David Bressoud is DeWitt Wallace Professor of Mathematics at Macalester College in St. Paul, Minnesota, he was one of the writers for the Curriculum Guide, and he currently serves as Chair of the │ ││CUPM. He wrote this column with help from his colleagues in CUPM, but it does not reflect an official position of the committee. You can reach him at bressoud@macalester.edu. │	{"url":"http://www.maa.org/external_archive/columns/launchings/launchings_05_05.html","timestamp":"2014-04-20T01:55:59Z","content_type":null,"content_length":"10718","record_id":"<urn:uuid:14d20bc4-4602-4998-9457-b06ada52daac>","cc-path":"CC-MAIN-2014-15/segments/1397609537804.4/warc/CC-MAIN-20140416005217-00513-ip-10-147-4-33.ec2.internal.warc.gz"}
Roselle, IL Find a Roselle, IL Calculus Tutor ...My friends ask me for help in math when they don't understand something. My tutoring methods would be the following: I would first ask the child if he or she believes he or she learns better by seeing, hearing or touching. I would then have the child fill out a questionnaire to see if what he or she believes is true. 19 Subjects: including calculus, reading, geometry, algebra 1 I graduated magna cum laude with honors from Illinois State University with a bachelor's degree in secondary mathematics education in 2011. I taught trigonometry and algebra 2 to high school juniors in the far north suburbs of Chicago for the past two years. I am currently attending DePaul University to pursue my master's degree in applied statistics. 19 Subjects: including calculus, geometry, statistics, algebra 1 ...Coordinate Geometry Word Problems 24. Translating from English to Algebra 25. Percent Problems 26. 17 Subjects: including calculus, reading, geometry, statistics ...This tutoring experience may well be my most significant qualification as a calculus tutor. When you major in physics, you must be fluent in calculus and differential equations because physics cannot survive without advanced mathematics. However, neither the time I spent earning my bachelors in... 7 Subjects: including calculus, physics, geometry, algebra 1 ...I use both analytical as well as graphical methods or a combination of the two as needed to cater to each student. Having both an Engineering and Architecture background, I am able to explain difficult concepts to either a left or right-brained student, verbally or with visual representations. ... 34 Subjects: including calculus, reading, writing, statistics Related Roselle, IL Tutors Roselle, IL Accounting Tutors Roselle, IL ACT Tutors Roselle, IL Algebra Tutors Roselle, IL Algebra 2 Tutors Roselle, IL Calculus Tutors Roselle, IL Geometry Tutors Roselle, IL Math Tutors Roselle, IL Prealgebra Tutors Roselle, IL Precalculus Tutors Roselle, IL SAT Tutors Roselle, IL SAT Math Tutors Roselle, IL Science Tutors Roselle, IL Statistics Tutors Roselle, IL Trigonometry Tutors	{"url":"http://www.purplemath.com/Roselle_IL_calculus_tutors.php","timestamp":"2014-04-17T01:06:01Z","content_type":null,"content_length":"23945","record_id":"<urn:uuid:419ab85f-0749-492f-97d4-cc65081e6c58>","cc-path":"CC-MAIN-2014-15/segments/1398223205375.6/warc/CC-MAIN-20140423032005-00193-ip-10-147-4-33.ec2.internal.warc.gz"}
Brevet US7284184 - Forward error correction scheme compatible with the bit error spreading of a scrambler The present invention relates to data communications and high speed transmission in general and is more particularly concerned with the correction of errors occurring on strings of data that need to be scrambled for transmission. The transmission of information over very high-speed links requires, to enhance the transmission characteristics of the signal, that data strings to be forwarded have to be first encoded by the transmitting side. A particular desirable characteristic to acquire is that, irrespective of the information to be transported, the binary transmitted signal remains DC balanced. Also, transmitted signal must have enough transitions so as the receiver side can reliably recover a clock and can operate without any drift that would possibly result from long sequences of transmitted 1's or 0's. A standard technique to achieve this objective is to scramble the transmitted data. Thus, various scramblers are specified by telecommunications standards. The one of the IEEE 802.3ae physical coding sublayer (PCS) broadly referred to as 10 Gb Ethernet (10 GbE), using a transmission coding technique known as 64B/66B, is based on polynomial: X^58+X^39 +1. On the other hand, the bit error rate (BER) of high-speed transmission links cannot generally be specified at a better rate than 10^−12. Being given that any modern data communications equipment is now required to reach aggregate data throughput in a tera (10^12) bits per second (Tbps) range then, hundredths of links (link speed are typically in a 2.5 to 12.5 Giga or 10^9 bits per second range) must be used irrespective of the actual implementation of a machine. Hence, it can easily be seen that errors are thus susceptible to occur at a rate well in excess of one every second. Even though link BER might be, in practice, better than what can be specified, designers of such data communications equipment such as Tbps routers and switches, are now forced to consider the use of forward error correction (FEC) a standard technique in which redundant bits of information are transmitted so a receiver can correct errors without requiring re-transmission. Unfortunately, scrambling and FEC are somehow incompatible. It is well-known that scramblers multiply the number of error bits after de-scrambling. For example, 10 GbE scrambler, which has three terms, creates three errors after decoding for each real error occurring on a transmission link. Moreover, these three errors span on 59 bits corresponding to the degree of the polynomial. While a single error can easily be corrected with a simple FEC code e.g., a Hamming code, requiring few extra bits, much more redundancy is needed to handle the bit error spreading as a result of the scrambling. Also codes to use in this case, such as BCH codes, are complex to decode. Thus, it is a broad object of the invention to remedy the shortcomings of the prior art as described here above. It is another object of the invention to provide a method and systems for transmitting data wherein a simple forward error correction code is combined with data scrambling to give required characteristics to the transmitted signal and to provide error correction capabilities. It is a further object of the invention to provide a method and systems for recovering scrambled received data by using a simple forward error correction code after data descrambling, compatible with the bit error spreading of the scrambler. The accomplishment of these and other related objects is achieved by a method of detecting and correcting random bit errors in a digital transmission system using a shortened single-bit error correction/double-bit error detection code wherein data is scrambled after said error detection/correction code is applied over a set of data and wherein said set of data is subsequently checked, after descrambling, for detecting and correcting transmission errors, to still obtain unique syndromes for said random bit errors after they have been multiplied as a result of said descrambling, said method of detecting and correcting random bit errors including: □ obtaining unique syndromes for all combinations of said multiplied errors completely confined to a same said set of data; □ obtaining unique syndromes too for those combinations of said multiplied errors occurring at the end of said set of data and overlapping a next set of data, ☆ remembering the end unique syndrome types for allowing correction of said next set of data; □ obtaining syndromes for all combinations of said multiplied errors occurring at the beginning of said set of data that are at least unique per said end types; thereby, allowing to correct all said random bit errors in spite of their multiplication by said descrambling and whichever they stay confined to a single said set of data or are spreading on two consecutive said sets of data. A method for transmitting data and associated redundant information allowing error detection and correction upon reception, said method comprising: □ selecting a set of data; □ computing forward error correction bits of said selected set of data according to a predetermined forward error correction code; □ merging said selected set of data and said forward error correction bits to form a packet; □ scrambling said packet; and, □ transmitting said scrambled packet, □ wherein said predetermined forward error correction code is determined via a shortened single-bit error correction/double-bit error detection code. A method for recovering information encoded in a received data packet, said received data packet being scrambled and containing forward error correction bits, said method comprising: □ descrambling said received data packet; □ computing a syndrome of said descrambled received data packet; □ if said syndrome is an all-zero syndrome, extracting the data from said received data packet; □ else if said syndrome is not an all-zero syndrome, determining the state of a status flag, ☆ if said status flag is set to a first logical value, determining a number of bits in error in said received data packet according to said syndrome and, ○ if the number of bits in error in said received data packet is equal to a degree of the scrambling polynomial, extracting the data from said received data packet and correcting said extracted data; ○ else if the number of bits in error in said received data packet is less than the degree of the scrambling polynomial, setting said status flag to a second logical value for one packet cycle and setting a value, associated to said status flag, to the degree of the scrambling polynomial minus the number of bits in error in said received data packet, extracting the data from said received data packet and correcting said extracted data; ☆ else if said status flag is set to a second logical value, determining if the number of bits in error in said received data packet is equal to said value associated to said status flag and, if the number of bits in error in said received data packet is equal to said value associated to said flag, extracting the data from said received data packet and correcting said extracted data, ☆ correcting said extracted data being done according to a predetermined forward error correction code as described previously. Further objects, features and advantages of the present invention will become apparent to ones skilled in the art upon examination of the following description in reference to the accompanying drawings. It is intended that any additional advantages be incorporated herein. FIG. 1 briefly introduces IEEE 802.3ae physical coding sublayer and the associated scrambling and descram-bling with polynomial X^58+X^39+1. FIG. 2 shows the conventional representation of the 10 Gb Ethernet scrambler and descrambler. FIG. 3 reviews the cases of errors resulting of the error bit spreading and discusses the overhead introduced by forward error correction code. FIG. 4 discusses the properties of the correcting code which allows the correction of the kind of errors shown in FIG. 3. FIG. 5 is the state diagram of the method according to the invention. FIG. 6 explains how a forward error correction code can be derived that complies with the requirements discussed in previous figures especially, with FIG. 4. FIG. 7 is the list of syndromes corresponding to all error cases as shown in FIG. 3, for polynomial of FIG. 6, assuming that packets to protect are up to 915-bit long. FIG. 8 illustrates an implementation example of the invention. FIG. 1 briefly introduces IEEE 802.3ae PCS (physical coding sublayer) and the associated scrambling and descrambling with polynomial x^58+x^39+1. PCS upper interface (100) is the so-called ‘10 gigabit media independent interface’ or XGMII which provides for the attachment of data communications equipment irrespective of the physical mode of transport of the streams of data to be forwarded (102) or received (104). Lower interface (110) provides for physical attachment to the transmission medium (115) e.g., a serial optical transmission. Data are transmitted in 66-bit blocks (120) comprised of a 64-b scrambled payload with a b ‘01’ preamble (122). There are also 66-b control blocks (130) including an 8-bit type field preceded by a b ‘10’ preamble. Both the block type and the remaining 56-bit data/control field of a control block are scrambled. Preambles, that allow block alignment, bypass the scrambler. Transmit path (140) includes a scrambler (144) which improves the transmission characteristics so that sufficient transitions are present in the physical bit streams e.g., to make clock recovery possible at the receiver. The 64B/66B transmission code has a high transition density and is a run-length-limited code. The encode (142) and gear box (146) functions are necessary to map data and control characters to the blocks and to adapt formats. They are not necessary to the understanding of the invention thus, are not further described. Receive path (150) includes a descrambler (154) to recover the original stream of bits. Synchronization on the preambles is achieved first (156). PCS also includes a function (160) that monitors the bit error rate over the transmission medium. There is a decode function (152) which is the counterpart of the transmit encode. Apart from the scrambler and descrambler, none of these functions need to be further described to understand the invention. They are shown here for the sake of accuracy on what is exactly the 10 GbE physical coding sublayer and to understand the context where the invention better applies. Those skilled in the art will realize that although the invention is described in the particular context of 10 GbE it could be practiced as well in a different environment and will know, from the here after description, how to adapt it to other applications, especially for applications where a different scrambling polynomial would be used. FIG. 2 shows the conventional representation of the 10 GbE scrambler and descrambler, i.e. implementing, according to the standard (see however the remark at the end of FIG. 3), the polynomial: G(x)= Scrambler (200) and descrambler (210) are linear feedback shift register (LFSR) to perform respectively, continuous division and multiplication of binary strings i.e., in an algebra modulo 2 modulo G (x), one bit at a time. Adders are XOR's such as (205). The two 58-bit shift registers have taps at indexes 0, 39 and 58 corresponding to the powers of the three terms of G(x) a primitive irreducible polynomial thus capable of generating a pseudo-random maximum length sequence. The sequence will repeat only after 2^58-1 shifts, i.e. never for all practical purposes. Even though there would be one shift possible every 1 pico (10^−12) second, the time to wrap around the sequence would still be larger than the time that has elapsed since the creation of the universe. Scramblers and descramblers have been in use for decades and are used to randomize strings of bits in order to obtain a better behavior of various electronic pieces of equipment mainly in the field of transmission. The chief applications being to allow that signals obtained be, on the average, DC balanced and to get enough transitions to be able to recover timing references from them. As an example of this, the first all-zero 64-bit sequence (220) gives, after scrambling, the 64-bit pattern (221) which is comprised of a good proportion of 0's and 1's (38 1's for 26 0's). After de-scrambling, the all-zero sequence is restored (222). Obviously, because of the randomness of the LFSR and of the length of the pseudo-random sequence no two identical input sequences are ever going to be encoded identically as this is illustrated here where the two successive all-zero input sequences (220, 230) gives different scrambled patterns (221, 231). However, an undesirable well-known effect of scrambling is illustrated with the second example of an all-zero pattern (230) to transmit. This, after scrambling, gives pattern (231) in which an error is assumed to flip 5th bit from left (233) when the signal is propagated through the transmission medium. Then, after descrambling, not only 5th bit is false but two more errors are created (237, 239 ) in the restored pattern (232). The three errors are spread at distances corresponding to the powers of G(x) terms. Indeed, scrambling multiplies the errors by a number corresponding to the number of terms of the polynomial in use, e.g. 3 with the 10 GbE polynomial. Moreover, because errors are largely spread (errors thus span here on 59 bits), they are not generally going to stay confined to a single 64-bit block. For example, the all-one third pattern (240) gives, after scrambling, pattern (241) in which an error is assumed to affect the 36th bit from left (243). After de-scrambling only bit 36 (245) is going to be false in the current 64-bit block. However, the following transmitted block (not shown) will have two errors in it since errors are nevertheless multiplied and spaced by the de-scrambler as in previous example. Hence, implementing an error correcting code in an attempt to improve the bit error rate (BER) of transmissions using the 64B/66B 10 GbE code, for the reasons discussed in the background section, is problematic since each error occurring during the transmission is not only multiplied by three but is also largely spread. Performing FEC is thus becoming much complicated and normally-requires many more redundant ECC bits and the use of sophisticated codes, such as a BCH (Bose-Chaudhuri-Hocquenghem). BCH codes are the type of codes that can be tailored to correct any occurrence of up to three errors in a string of scrambled bits. However, implementing a TEC code, e.g. triple error correction code, at the expense of having to compute and decode a complex code adds to system cost and complexity especially at the multi-Gbps transmission speeds considered by the invention. Another approach is illustrated by U.S. Pat. No. 6,349,138 entitled ‘Method and Apparatus for Digital Transmission Incorporating Scrambling and Forward Error Correction while Preventing Bit Error Spreading Associated with Desrambling’. The above patent manages to perform FEC after scrambling and before descrambling to get rid of its spreading effect and in order to continue to use a simple code such as a Hamming code capable of correcting single bit errors. However, the immediate consequence is that only part of the transmitted string of bits is actually scrambled and has the necessary properties for a good transmission. Redundant ECC bits that are calculated after scrambling must be concatenated as is to the scrambled string of bits. The following description of the invention shows how a simple Hamming code can still be used on top of scrambling to circumvent the effect of error spreading. FIG. 3 reviews the cases of errors resulting from the error bit spreading and discusses the overhead introduced by FEC. The invention assumes that FEC is performed at a physical level, above scrambling, so as to take care of the transmission errors on high speed links. Although FEC could be carried out with each transmitted packet, this would require having one redundant byte i.e., 8 bits, reserved per transmitted block. Along with the 2-bit preamble necessary for synchronization this would give an overhead of (2+8)/(64-8) or 18% for the 64B/66B code that would include a per-block FEC. Although this is better than the 25% overhead of the 8B/10B code often used for transmission on high speed links this fails meeting the objective of this code which is to require much less overhead i.e., 2/64 or 3% to operate. Hence, FEC should be devised so as to protect a series of blocks (300), rather than a single block, to keep overhead at a low value while allowing on-the-fly corrections of errors so as the transmission on high-speed links can indeed be considered error-free. A common data unit often manipulated by modem data communications devices, such as switches and routers, is a 64-byte or 512-bit data packet requiring eight 64B/66B blocks of the kind shown in FIG. 1 (120). FEC applied at packet level i.e., over eight 8-byte or 64-bit blocks (300), requires 11 bits as this is discussed in detail in the following description of the invention. Hence, in this case, overhead becomes (8×2+11)/(512 −11) or 5.4%, which is a modest increase over the original 3% overhead of the 64B/66B, while permitting single-bit transmission error corrections. Since, in practice more than a weird 11-bit field would likely have to be reserved in a 512-bit payload a maximum of 6.4% may have to be considered if a 2-byte field would be reserved for practical considerations. Hence, FEC requires that redundant bits be taken from the payload under the form of a FCS (field check sequence) generally placed at the end of the packet (310). Whichever packet size is considered, the kinds of errors that the invention assumes to be correctable are all shown in FIG. 3. The common case is when the three errors, resulting of the de-scrambling, are all confined to a single packet (320). Although, for a sake of accuracy, the 2-bit preambles are shown here (370), it must be understood that they are neither included in the scrambling nor are participating into FEC since they are only used for block synchronization by the physical coding sublayer shown in FIG. 1. The other error types are: □ a single-bit error (340) preceded by a double-bit error in previous packet. □ a double-bit error (330) preceded by a single-bit error in previous packet. □ a single-bit error (350) followed by a double-bit error in next packet. □ a double-bit error (360) followed by a single-bit error in next packet. All these error cases, resulting from a single error occurring in the transmission links, are correctable according to the method of the invention further described. □ It is worth noting here that FIG. 3 shows blocks and packet in a traditional way, i.e. with block preamble and beginning of packet (BoP) shown on the left. The most left bit is considered as the most significant bit and is transmitted first, from left to right, so the FCS is transmitted last with the end of packet (EoP). However, this is not consistent with the representation of the scrambler and descrambler by the standard as shown in FIG. 2. By referring to this figure one can notice that the MSB, i.e. 2 ^58, is shown to be the most right bit of the shift register. By referring to the proper literature on the subject for example: ‘Error-Correcting Codes’, Peterson & Weldon, 2nd edition, The MIT press, 1972, and more specifically to chapter 7 ‘Linear Switching Circuit’ it can easily be found that scrambler and de-scrambler of the 10 GbE standard are implementing the reciprocal of the polynomial quoted above i.e.: G(x)=X^58+X^19+1 and scrambler and de-scrambler should rather be indexed from 58 to 0, from left to right (so as the middle term is 2^19). This does not change anything in practice. Both polynomials have exactly the same properties. However, the invention needs to consider the right indexing to be understood. Hence, the rest of the description assumes that the polynomial is actually G(x)=X^58+X^19+1 with, as usual, the most significant term on the left as with ordinary numbers. FIG. 4 discusses the properties of the correcting code which allows the correction of the kind of errors shown in FIG. 3. In the following, a syndrome must be understood as the result of the packet FEC checking. If, e.g., FCS is 11-bits wide, then the syndrome is an all-zero (405) 11-bit binary vector when no error has occurred. Otherwise it is generally different from 0. The set of values 2048 with 11 redundant bits added for correction) is the syndrome (400). First, all shifts of three-bit errors (410) spaced as G(x), i.e. at indexes 58, 19 and 0 and entirely contained in the packet payload (including FCS), must have unique syndrome values once a packet is FEC checked so that they can be unambiguously corrected. These errors are of the kind shown in FIG. 3 (320). When this happens no single-bit error or double-bit error respectively of the type (330 ) and (340) shown in FIG. 3 may have possibly occurred in previous packet. Second, all single-bit (420) and double-bit (430) errors occurring at the end of a packet (EoP), corresponding respectively to cases (350) and (360) of FIG. 3 must give unique syndromes too (different of the above three-bit error syndromes) so they can be unambiguously corrected in current packet too. There are 58−19 =39 single-bit errors of this category (350) possibly affecting the 39 most-right bits of a packet including FCS. Additionally, there are 19 double-bit errors of this kind affecting the 19 most-right bits of a packet. When this occurs (single-bit and double-bit errors occurring at the end of a packet) this must be remembered (441, 442) since next packet should have respectively, a double-bit or single-bit error at its beginning (BoP). Third, all single-bit (450) and double-bit (460) errors occurring at the beginning of a packet, corresponding respectively to cases (330) and (340) of FIG. 3 must have unique syndromes. However, they need not to be unique versus all the others (first and second case above) and even together since, as mentioned above, one remembers for one packet cycle that an error at the end of previous packet has occurred and the type of this error, single (441) or double (442). In other words, since single and double-bit errors, having unique syndromes, have occurred in the previous packets, double or single-bit errors respectively, at the beginning of the next packet are to be expected. Thus, syndromes of such errors need not be unique. They only need to be unique per type (single or double). Then, the set of syndromes must comply with what is shown in FIG. 4 so as state diagram of FIG. 5 hereafter can apply allowing correction after de-scrambling of all single-bit errors occurring during transmission of packets. The syndromes that do not fit must be considered uncorrectable errors. The corresponding packet should be flagged and/or discarded. FIG. 5 is the state diagram of the method according to the invention. Each time a packet is received a syndrome is computed (500). If different from the all-zero syndrome a correction must be attempted. A first step is to check if an error has been found at the end of previous packet (505). If not, the syndrome is further checked. If it corresponds to a triple-bit error (520) a correction can be performed (550). If the syndrome however belongs to the ones of a double-bit error at the end of a packet (515), this is remembered (530) for the processing of the next packet (and only for next packet). The syndrome may also match the ones of the end-of-packet single-bit errors (510) in which ease this is remembered (525) as with the end-of-packet double bit error. In both cases a correction is performed (550). If, at step (505), a double-bit error or a single-bit error was found to have been corrected in the previous packet, then the current computed syndrome must be checked against respectively, the set of single-bit error syndromes (535) and the set of double-bit errors syndromes (540) that occur at the beginning of a packet (BoP). If there is a match a correction can be performed (550). If none of the above match (545), the syndrome does not fit the model of errors. An uncorrectable error (555) is therefore detected. FIG. 6 explains how an FEC code can be derived that complies with the requirements discussed in previous figures, especially with FIG. 4. The invention is hereafter exemplified using the following code generator polynomial: G(x)=(X+1) (X^10+X^9+X^7+X^6+X^4+X^1+1). This type of polynomial, which is the product by (X+1) of a primitive irreducible polynomial, here of degree 10, is known to produce a SEC/DED (single error correction/double error detection) type of code. Because of the multiplication by (X+1), vectors of the code are all odd-weight so that it is easy to split the syndromes in two disjoint sets. Single bit error syndromes are odd while double bit error syndromes are all even. This property has been extensively used to implement what is referred to as an odd-weight extended Hamming code. On this, and on error correction in general, one may refer for example to ‘Error-Correcting Codes for Semiconductor Memory Applications: A State-of-the-Art Reviews’, C. L. Chen and M. Y. Hsiao, IBM Journal of Research and Development, Volume 28, Number 2, March 1984 . A list of irreducible polynomials in a binary GF (Galois Field) of the kind corresponding to the right term of G(x), and much theory on the field of error correction, can be found in the book already cited above, i.e. in ‘Error-Correcting Codes’, Peterson & Weldon, 2nd edition, The MIT press, 1972. The degree-10 right polynomial chosen to illustrate the invention is listed, in appendix C of this book, in octal notation, as ‘3323’. The reason of the choice of this particular polynomial will become clear in the following description of the invention. From G(x) it is possible to form a finite group under multiplication of odd-weight vectors (600), ranked from 0 to 1022 and noted α^0 to α^1022, comprising 2 ^10−1 or 1023 vectors, a number which corresponds to the degree of the right term of G(x). Vectors at beginning and end of the multiplicative group plus some intermediate vectors are shown. As mentioned, they are all comprised of an odd number of ones. For the sake of readability, 0's are replaced by a dot (.) in the binary vectors shown. In this group, since it is a multiplicative group, the following holds: α^X×α^Y=α^X+Y modulo 1023. However, it is still possible to define an addition of three vectors (even though this is not a field) that always returns a vector of the group so that α^X+α^Y+α^Z=α^W. This is always true because group is made of all possible odd-weight vectors. Adding three vectors together gives again an odd vector that belongs to the group. Moreover, following holds too: α^X+n+α^Y+n+α^Z+n=α^W+n. As an example of this, one can easily verify from what is listed in (600) that α^0+α^3+α^5=α^1012 and that α^X1+α^4+α^6=α^1013 and so on. Hence, it is possible to compute the addition of the three group vectors that corresponds to the terms of the scrambler polynomial, namely 58, 19 and 0. Adding α^58+α^19+α^0 gives α^166 and, α^ 58+856+α^19+856+α^0+856=α^166+856=α^1022 (610) the last vector of the group. Therefore there are 1022-(166-1) i.e.: 857 successive combinations of triple-bit errors, spaced as scrambler polynomial powers, that give unique syndromes spanning from α^166 to α^1022. The polynomial chosen has been selected to maximize the range of usable vectors. Among all possibilities of primitive irreducible polynomials listed in Peterson and Weldon book mentioned previously, polynonial ‘3323’ (in octal notation) the right term of G(x) i.e.: X^10+X^9+X^7+X^6+X^4+X^1+1, is a good choice since it gives a low value for the addition of three vectors of the group spaced as 58,19 and 0. Choosing another polynomial gives a higher value for the addition of α^58+α^19+α^0, reducing the range of possible unique combinations as this is further discussed. It is worth noting here that this results from the fact that all Galois Fields, which can be generated with different primitive irreducible polynomials, are isomorphic in the mathematical sense of this term. That is, all fields of degree n contain all 2^n−1 non-zero vectors. They just differ by the order in which these vectors appear in the field. The vector addition table thus varies greatly from one choice of polynomial to another. This behavior is carried over to the multiplicative group obtained after multiplication by X+1, resulting from the fact that there are better choices to obtain a large range of three-bit error combinations that have unique syndromes. The above requires that code generated with suggested polynomial G(x)=(X+1)(X^10+X^9+X^7+X^6+X^4+X^1+1) be shortened so combinations of three errors cannot return a vector greater than α^1022 for the reason that the next value would be α^0(since the group is a finite cyclic group). Indeed, the EoP single-bit errors, i.e. (350) in FIG. 3, need to be unique according to the invention. As they are using the 39 starting vectors (620) of the multiplicative group they cannot be used by the three-bit error combinations. This is obtained by excluding the use of group vectors (630) beyond α^914 (the 915th vector of the group), i.e. the 857 three-bit error combinations+58, the degree of the polynomial. As far as the two-bit errors are concerned, the addition of two vectors of the group does not belong to the multiplicative group (on the contrary of the addition of three vectors). It returns an even-weight vector that neither belongs to the three-bit error syndromes nor to the single-bit error syndromes which exceeds the requirements discussed in FIG. 4. Therefore, by limiting the code to the protection of packets of up to 915 bits it is possible to correct all errors, after scrambling, according to the method of FIG. 5. The impact of shortening the code to obtain this result is however minimized by choosing a polynomial where the sum of three vectors, spaced as in scrambler polynomial, i.e. 58, 19, and 0, corresponds to a low displacement (610) in the multiplicative group so fewer vectors have to be excluded (630). FIG. 7 is the list of syndromes corresponding to all error cases shown in FIG. 3, for polynomial of figure 6, assuming that packets to protect are up to 915-bit long. The code can obviously be further shortened to adapt to any lower packet size as shown in FIG. 8 here after. The single-bit and triple-bit error syndromes are listed according to their rank into the multiplicative group of figure 6. The left column (750) is the number of bits in error. The double-bit error syndromes (710) and (750) do not belong to the multiplicative group off FIG. 6. Their ranks listed are taken out of the dual multiplicative group made of all even vectors (not shown). Hence, ranks of double-bit errors cannot and need not be compared to the odd multiplicative group. However, double-bit errors at the beginning of packet (710) and double-bit errors at the end of packet, can be, and should be compared to each other, to check that they are unique allowing to unambiguously correct all double-bit From the BoP there are 19 single-bit errors (700). These errors correspond to case (340) of FIG. 3. They are followed by 39 double-bit errors corresponding to case (330) of FIG. 3. After which starts (760) all the shifts of triple-bit errors, a down sequence from rank 1022 to rank 166 (770). There are again 19 double-bit errors at the end of packet (720) corresponding to case (360). Finally, there are 39 EoP single-bit errors (730). BoP single-bit errors (730), all triple-bit errors from (760) to (770) and double-bit errors (720) have unique syndromes and can be corrected directly. Single-bit errors at the beginning of packet (700) are unique alone but have duplicates in the set of triple-bit errors which is permitted by the algorithm of FIG. 5. Therefore, all errors resulting from a single-bit error during the transmission of 64B/66B blocks can be corrected after de-scrambling. All syndromes of errors that do not fit in list of FIG. 7 are uncorrectable errors. Since, in this particular example, there are 2047 (2^11−1) possible non-zero syndrome combinations and 973−19=954 unique combinations used for the corrections (the first 19 BoP syndromes have all a duplicate in the set of triple-error syndromes) the difference, 1093 combinations, may serve to detect directly uncorrectable errors according what is shown in FIG. 5 (555). More uncorrectable errors are possibly detected by the algorithm of FIG. 5 since, even though a syndrome matches one of the BoP single and double error syndromes, a corresponding error must have been found in previous packet to allow a correction. If this is not the case an uncorrectable error is detected too. FIG. 8 shows, as an example among numerous possibilities, an implementation of the invention. The choice of a particular implementation is highly dependent on the performance required and of the technology available. Communications devices, for which the invention is devised, are generally implemented in high-speed ASIC's (application specific integrated circuits) that may be comprised of millions of logic gates and latches. To achieve the necessary level of performance with a cost-performance, relatively slow, technology as CMOS (complementary metal oxide semiconductor)1 logic designers tend to favor wide buses and parallel processing of information data. Hence, the particular implementation of FIG. 8 assumes that, e.g., a 512-bit wide packet (800) is checked with a large block of combinatorial logic implemented with exclusive OR gates (XOR's) and shown here under the form of a matrix (810), the so-called H-Matrix of the code, where 1's are XOR inputs. The matrix corresponds to what is shown in FIG. 6, however further shortened, for illustrating the case of a typical 64-byte packet. Logic block (810) thus allows generation of an 11-bit syndrome (820) which is decoded (830) to perform a correction if necessary. Correction consists of inverting the bits found in error. Input data, i.e. the whole packet which is applied (800) over the matrix that generates the syndrome (820), is also applied to the series of XOR's (840) to invert the bits found in error by the decode of the syndrome (830). As discussed previously EoP errors must be remembered (850), for one packet cycle, so that the information can be used for the next packet for correction (860) when necessary. Also, decoding the syndrome allows the finding of the uncorrectable errors (870). Implementation is not further described since it uses techniques and methods well known from the art of logic design, especially the design of the ASIC's used for communications devices. The generation of the eleven ECC bits on the transmit side is trivial. Generation is equivalent to checking except that the eleven FCC bits (805) are set to 0 so that the matrix (810) returns the FCS (instead of the syndrome) to be inserted at the end of the message as shown in FIG. 3 before it is forwarded. Again, all of these are standard practices well known from the art. Finally, those skilled in the art will recognize that, although the invention is described for the particular case of the 10 GbE scrambler it is straightforward to adapt it to all other primitive scrambler polynomials. A list of such primitive polynomials, up to degree 300, can be found in ‘Built-In Test for VLSI, Pseudorandom Techniques’, Paul H. Bardell and al., John Wiley & Sons, 1987. It must also be understood that the choice of a code to correct the errors after scrambling can be different from the one suggested while still practicing the invention. Especially, if longer or shorter packets must be protected, different polynomial may be chosen so as to adapt the number of necessary redundant bits to a particular application of the invention. Also, the particular implementation of FIG. 8 does not preclude a completely different approach. Because the invention only requires that code be shortened, generation and checking can still be performed cyclically, with a state machine, that would compute FCS and syndrome n-bit or n-byte at a time instead of using a single combinatorial block of logic. While the invention has been particularly shown and described with references to an embodiment, it will be understood by those skilled in the art that various changes in both form and detail may be made therein without departing from the scope and spirit of the invention.	{"url":"http://www.google.fr/patents/US7284184","timestamp":"2014-04-18T11:12:39Z","content_type":null,"content_length":"110834","record_id":"<urn:uuid:4286d2d0-1e1d-461a-88fb-e5b9e00b9606>","cc-path":"CC-MAIN-2014-15/segments/1397609533308.11/warc/CC-MAIN-20140416005213-00102-ip-10-147-4-33.ec2.internal.warc.gz"}
How to Calculate and Deduce Current, Voltage Parameters in Transformerless Power Supplies We all know how Ohm’s law works and how to use it for finding the unknown parameter when the other two are known. However, with a capacitive type of power supply having peculiar features and with LEDs connected to it, calculating current, voltage drop and LED resistor becomes a bit confusing. More innovative circuits How to Calculate and Deduce Current, Voltage Parameters in Transformerless Power Supplies. After carefully studying the relevant patterns, I devised a simple and effective way of solving the above issues, especially when the power supply used is a transformerless one or incorporates PPC capacitors or reactance for controlling current. Typically, a transformerless power supply will produce an output with very low values but with voltages equal to the applied AC mains (until it’s loaded). For example, a 1 µF, 400 V (breakdown voltage) when connected to a 220 V x 1.4 = 308V (after bridge) mains supply will produce a maximum of 70 mA of current and an initial voltage reading of 308 However this voltage will show a very linear drop as the output gets loaded and current is drawn from the “70 mA” reservoir. We know that if the load consumes the whole 70 mA would mean the voltage dropping to almost zero. Now since this drop is linear, we can simply divide the initial output voltage with the max current to find the voltage drops that would occur for different magnitudes of load currents. Therefore dividing 308 volts by 70 mA gives 4.4V. This is the rate at which the voltage will drop for every 1 mA of current added with the load. That means if the load consumes 20 mA of current, the drop in voltage will be 20 × 4.4 = 88 volts, so the output now will show a voltage of 308 – 62.8 = 220 volts DC(after bridge). For example with a 1 watt LED connected directly to this circuit without a resistor would show a voltage equal to forward voltage drop of the LED (3.3V), this is because the LED is sinking almost all the current available from the capacitor. However the voltage across the LED is not dropping to zero because the forward voltage is maximum specified voltage that can drop across it. Conclusion: From the above discussion and analysis, it becomes clear that voltage in any power supply unit is immaterial if the current delivering capability of the power supply is "relatively" low. For example if we consider an LED, it can withstand 30 to 40 mA current at voltages close to its "forward voltage drop", however at higher voltages this current can become dangerous for the LED, so it's all about keeping the maximum current equal to the maximum safe tolerable limit of the load. While calculating series resistor values with LEDs, instead of using the standard LED formula directly, we can use the above rule first. That means either we choose a capacitor whose reactance value only allows the maximum tolerable current to the LED, in which case a resistor can be totally avoided. If the capacitor value is large with higher current outputs, then probably as discussed above we can incorporate a resistor to reduce the current to tolerable limits. Example: In the shown diagram, the value of the capacitor produces 70 mA of max. current which is quite high for any LED to withstand. Using the standard LED/resistor formula: R = (supply voltage VS – LED forward voltage VF) / LED current IL, = (220 - 1.5)/0.02 = 11K, Therefore the value of the resistor for controlling one red LED safely would be 11K. The above theory of How to Calculate and Deduce Current, Voltage Parameters in Transformerless Power Supplies has been assumed and deduced by me, I am not very sure about its feasibility, though 6 comments: 1. can we use this circuit for power supply for water level circuit and fluorescent tube circuit 1. yes can be used... 2. hi, sir, can we connect 3 blue led with resistor for this circuit, when 70 ma is the output current 1. hi, yes you may connect them, but use 0.33uF/400V capacitor instead of the shown 105/400V. the zener diode won't be required. 3. Hello Dada If I want To create 5V 500mA output, can I connect 5 250v 225K capacitors in parallel because they have 100ma and 24V output voltage? 1. No you cannot do that, unless the output load operating voltage doesn't match the input mains level, adding caps won't work, rather would become dangerous for the LEDs. Readers are requested not to include external links while commenting. For consulting a diagram, upload it on Google Drive and provide the link here.	{"url":"http://homemadecircuitsandschematics.blogspot.com/2011/12/how-to-calculate-and-deduce-current-and.html","timestamp":"2014-04-21T09:35:45Z","content_type":null,"content_length":"149567","record_id":"<urn:uuid:f260ce84-7555-48c2-9efa-1fa06c2c1141>","cc-path":"CC-MAIN-2014-15/segments/1397609539705.42/warc/CC-MAIN-20140416005219-00354-ip-10-147-4-33.ec2.internal.warc.gz"}
How Do You Find the Constant of Variation from a Direct Variation Equation? Wondering if a point is part of the equation of a line? Got the equation of the line but no graph? No problem! Just take that point and plug it into the equation and simplify. If you end up with a true statement, the point is indeed part of the equation. If you end up with a false statement, then that point is not part of the equation. See this process first-hand in this tutorial!	{"url":"http://www.virtualnerd.com/algebra-1/linear-equation-analysis/direct-variation/direct-variation-examples/find-constant-of-variation","timestamp":"2014-04-21T05:17:58Z","content_type":null,"content_length":"26638","record_id":"<urn:uuid:95061a4a-8cef-4939-a1ef-bcdb41a5aff4>","cc-path":"CC-MAIN-2014-15/segments/1397609539493.17/warc/CC-MAIN-20140416005219-00507-ip-10-147-4-33.ec2.internal.warc.gz"}
An improved overlap argument for on-line multiplication, in - STOC'07 , 2007 "... For more than 35 years, the fastest known method for integer multiplication has been the Schönhage-Strassen algorithm running in time O(n log n log log n). Under certain restrictive conditions there is a corresponding Ω(n log n) lower bound. The prevailing conjecture has always been that the complex ..." Cited by 41 (0 self) Add to MetaCart For more than 35 years, the fastest known method for integer multiplication has been the Schönhage-Strassen algorithm running in time O(n log n log log n). Under certain restrictive conditions there is a corresponding Ω(n log n) lower bound. The prevailing conjecture has always been that the complexity of an optimal algorithm is Θ(n log n). We present a major step towards closing the gap from above by presenting an algorithm running in time n log n 2 O(log ∗ n). The main result is for boolean circuits as well as for multitape Turing machines, but it has consequences to other models of computation as well. - Communications of the ACM , 1983 "... foremost recognition of technical contributions to the computing community. The citation of Cook's achievements noted that "Dr. Cook has advanced our understanding of the complexity of computation in a significant and profound way. His seminal paper, The Complexity of Theorem Proving Procedures ..." Cited by 17 (0 self) Add to MetaCart foremost recognition of technical contributions to the computing community. The citation of Cook's achievements noted that "Dr. Cook has advanced our understanding of the complexity of computation in a significant and profound way. His seminal paper, The Complexity of Theorem Proving Procedures, presented at the 1971 ACM SIGACT Symposium on the Theory of Computing, laid the foundations for the theory of NP-completeness. The ensuing exploration of the boundaries and nature of the NP-complete class of problems has been one of the most active and important research activities in computer science for the last decade. Cook is well known for his influential results in fundamental areas of computer science. He has made significant contributions to complexity theory, to time-space tradeoffs in computation, and to logics for programming languages. His work is characterized by elegance and insights and has illuminated the very nature of computation." During 1970-1979, Cook did extensive work under grants from the - Bull. of Euro. Assoc. for Theor. Computer Science , 1988 "... I felt honored and uncertain when Grzegorsz Rozenberg, the president of EATCS, proposed that I write a continuing column on logic in computer science in this Bulletin. Writing essays wasn’t my favorite subject in high school. After some hesitation, I decided to give it a try. I’ll need all the help ..." Cited by 6 (2 self) Add to MetaCart I felt honored and uncertain when Grzegorsz Rozenberg, the president of EATCS, proposed that I write a continuing column on logic in computer science in this Bulletin. Writing essays wasn’t my favorite subject in high school. After some hesitation, I decided to give it a try. I’ll need all the help I can get from you: criticism, comments, queries, suggestions, etc. Andrei Nikolayevich Kolmogorov died a few months ago. In recent years he chaired the Department of Mathematical Logic at the Moscow State University. In a later article or articles, I hope to discuss Kolmogorov’s ideas on randomness and information complexity; here let me take up the issue of Kolmogorov machines and their close relatives, Schönhage machines. I believe, we are a bit too faithful to the Turing model. It is often easier to explain oneself in a dialog. To this end, allow me to introduce my imaginary student Quizani. • Quizani: I think you should introduce yourself too. Don’t assume everyone knows you. • Author: All right. I grew up in the Soviet Union and started my career in the Ural University as an algebraist and self-taught logician. In 1973, I emigrated to Israel where I did logic and taught at Ben-Gurion - PROC. 5TH ACM SYMPOSIUM ON THEORY OF COMPUTING , 1974 "... A Turing machine multiplies binary integers on-Zine if it receives its inputs low-order digits first and produces the jth digit of the product before reading in the (j+l)st digits of the two inputs. We present a general method for converting any off-line multiplication algorithm which forms the prod ..." Cited by 5 (1 self) Add to MetaCart A Turing machine multiplies binary integers on-Zine if it receives its inputs low-order digits first and produces the jth digit of the product before reading in the (j+l)st digits of the two inputs. We present a general method for converting any off-line multiplication algorithm which forms the product of two n-digit binary numbers in time F(n) into an on-line method which uses time only O(F() log ), assuming that F is monotone and satisfies n F() F(2)/2 ! kF() for some constant k. Applying this technique to the fast multiplication algorithm of Schönhage and Strassen gives an upper bound of O(n (log n)² loglog n) for on-line multiplication of integers. A refinement of the technique yields an optimal method for on-line multiplication by certain sparse integers. Other applications are to the on-line computation of products of polynomials, recognition of palindromes, and multiplication by a constant. - EPTCS 1 , 2009 "... Multi-head finite automata were introduced in [36] and [38]. Since that time, a vast literature on computational and descriptional complexity issues on multi-head finite automata documenting the importance of these devices has been developed. Although multi-head finite automata are a simple concept, ..." Cited by 2 (0 self) Add to MetaCart Multi-head finite automata were introduced in [36] and [38]. Since that time, a vast literature on computational and descriptional complexity issues on multi-head finite automata documenting the importance of these devices has been developed. Although multi-head finite automata are a simple concept, their computational behavior can be already very complex and leads to undecidable or even non-semi-decidable problems on these devices such as, for example, emptiness, finiteness, universality, equivalence, etc. These strong negative results trigger the study of subclasses and alternative characterizations of multi-head finite automata for a better understanding of the nature of non-recursive trade-offs and, thus, the borderline between decidable and undecidable problems. In the present paper, we tour a fragment of this literature.	{"url":"http://citeseerx.ist.psu.edu/showciting?cid=1708390","timestamp":"2014-04-16T10:07:17Z","content_type":null,"content_length":"26118","record_id":"<urn:uuid:2aa66c96-a8d0-4fba-8220-2939560e87f0>","cc-path":"CC-MAIN-2014-15/segments/1397609521558.37/warc/CC-MAIN-20140416005201-00445-ip-10-147-4-33.ec2.internal.warc.gz"}
Moshe Rubin's Cryptologia Chaocipher article, now viewable online... Moshe Rubin’s Cryptologia Chaocipher article, now viewable online… Moshe Rubin just emailed me to let me know that his extensive October 2011 Cryptologia article “John F. Byrne’s Chaocipher Revealed: An Historical and Technical Appraisal” (vol. 35 issue 4, pp.328-379 [!!!]) can currently be viewed and downloaded for free from Taylor & Francis (who publish Cryptologia), via the “Download full text” button there. If (like me) you’re into both the social and technical aspects of historical cryptography, it’s a cracking old read, covering both Byrne’s life and his numerous attempts to get the US military to accept his “Chaocipher” invention. Yet Moshe’s article is far from all ra-ra-pro-Byrne stuff: it also makes clear… * the system’s inherent fragility (because each step changed the state of the two rotors, it suffered from near-worst-case error propagation); * Byrne’s cryptographic inexperience (the way that he proposed concealing the indicator settings was far from secure); and * Byrne’s cryptologic naivety (he believed that the flat letter distribution of the ciphertext made it explicitly unbreakable). If you’ve read Ratcliff’s “Delusions of Intelligence” (a book the GCHQ Historian recommended I read, thanks for that!), you’ll know that this last mindset was precisely what the various German agencies using the Enigma machine suffered from: and if Chaocipher had been extensively used by the Allies in WW2, who’s to say that Hitler’s fragmented array of codebreaking agencies wouldn’t have eventually found a way of breaking into it, just as they did with virtually all the Allies’ low-to-medium-echelon ciphers? One thing that strikes me most about the whole saga is that even though Byrne (who sometimes wrote under the anagrammatic pseudonym “J. F. Renby”, I was amused to see) seems to have envisaged Chaocipher as an expensive-to-build set of mechanical rotors, I think it is actually very easy to use with two Scrabble alphabets arranged in horizontal rows. (OK, Scrabble wasn’t devised until the 1930s, but my basic point still stands regardless). All the sliding operations (zenith / nadir, etc) then become immediately straightforward, arguably far more so than if you were using a machine to do the same. Regardless of whether or not Scrabble tiles are the best way to Chaocipherify your plaintext, I’d argue that what sets Byrne’s cryptographic ideas apart most is the way he conceptualized his crypto system in terms that mesh peculiarly well with modern computer science: in fact, it’s quite hard to describe it at all without lapsing into contemporary CompSciSpeak. It’s almost as if Byrne were projecting himself forward into a software world: but then again, one of the chapters of his autobiography was SciFi, so perhaps the future was where he felt most at home! 10 Comments 1. And here I thought I was long-winded when it came to composing written dialogue. Umpteen commas (though grammatically correct), a colon or two, and I could find only one period in your entire paragraph. (Maybe two periods; I’ll go back and check.) 2. What an interesting article. I don’t understand computer-based ciphers very well, but the Chaocipher system certainly reminds me of the ‘mangler functions’ used to manipulate blocks of ASCII text and there are certainly similarities with dynamic substitution. Can a better mathematician than I (which is not difficult – a school report described me as ‘innumerate’) tell me how the number of potential combinations of alphabets on the two wheels compares with the number of potential combinations on a three-wheel Enigma (I assume 17576)? I should be able to work this out, but it’s been a very long day. 3. SirHubert: bear in mind that each letter emitted triggers a letter-dependent reorganization of both rotors, yielding the desired chaos. 4. @Nick – I do understand how the ‘chaos’ is introduced and how this differs from a running-key cipher. But the choice of which cipher-alphabet is used for a given letter is not truly random or ‘chaotic’ – it’s determined by the algorithm. It isn’t really aleatoric in the way that generating random numbers using radioactive decay gives truly unpredictable results. I was thinking about the strengths and weaknesses of Chaocipher as opposed to Enigma, insofar as I understand either very well. Imagine that it’s World War 2, and you have intercepted a fairly long message sent in a cipher you’ve already broken, giving you a letter-by-letter crib. You then intercept what appears to be the same message in Chaocipher. Am I right that you only need to try out a maximum of 676 possible initial settings on Chaocipher in order to get a complete solution, as opposed to 17576 on Enigma (ignoring the plugboard settings temporarily)? 5. SirHubert: actually, I think that because each rotor is “soft-coded” rather than hard-coded, the number of possible settings is closer to (25!)^2, which is 2.4059764e+50 – somewhat bigger, let’s Oh, and I was using “chaos” in the modern mathematical sense, of a simple system repeatedly iterating to yield unforeseeable results. The fact that Byrne thought “chaos” a good name for his system may well be another neat bit of future thinking on his part. 6. Thank you – even with a B in AO maths I should have worked that out. Final stupid question if you can face it – why (25!)^2 and not (26!)^2? 7. SirHubert: combinatorics isn’t really my field, but the idea here is that the position of the very first letter is immaterial to the overall state of the rotor. You only really have a genuine choice when placing the second letter on the (soft) rotor, where you have 25 options. And so forth, to (25!). And you have two rotors. However, thinking about it, because the rotors are a physically linked system, you do have a 26-way choice for where you place the first letter of the second rotor: so the answer is probably the slightly higher (25!) x (26!), i.e. 6.2555386e+51 or thereabouts. 8. I have read this post four times. I am returning now to my blog, where I can enjoy an illusion of being not-too-stupid. 9. Diane, I think I might check in on your blog later. The “alpha-math” is beginning to resemble computer programming for an electronic “pin-ball” machine–rotors and all! 10. For a diagram demonstrating Nick’s idea of using two Scrabble alphabets for Chaocipher enciphering, see Gary J. Shannon’s (‘fiziwig’) excellent graphical rendition of just such an idea.	{"url":"http://www.ciphermysteries.com/2013/03/01/moshe-rubins-cryptologia-chaocipher-article-now-viewable-online","timestamp":"2014-04-18T00:38:51Z","content_type":null,"content_length":"50428","record_id":"<urn:uuid:7bcc137b-5ee4-42bb-a136-896c61acb810>","cc-path":"CC-MAIN-2014-15/segments/1398223207046.13/warc/CC-MAIN-20140423032007-00286-ip-10-147-4-33.ec2.internal.warc.gz"}
57 projects tagged "Linux" Ch is an embeddable C/C++ interpreter for cross-platform scripting, shell programming, 2D/3D plotting, numerical computing, and embedded scripting. It is the simplest solution to numerical computing and visualization in the domain of C/C++. It supports the ISO 1990 C Standard (C90), major features in C99 (complex numbers, variable length arrays or VLAs, type generic functions, long long data type, etc), classes in C++, and extensions to the C language like nested functions, string types, etc. It can be embedded in other applications and hardware and used as a scripting language. C/C++ code is interpreted directly with no compilation to intermediate code. It supports Linux, Windows, MacOS X, Solaris, HP-UX, and FreeBSD.	{"url":"http://freecode.com/tags/linux?page=1&sort=name&with=417%2C2892&without=","timestamp":"2014-04-18T03:35:13Z","content_type":null,"content_length":"91897","record_id":"<urn:uuid:e677274d-c69b-47e5-bb1d-6303cf8d071b>","cc-path":"CC-MAIN-2014-15/segments/1397609532480.36/warc/CC-MAIN-20140416005212-00017-ip-10-147-4-33.ec2.internal.warc.gz"}
Know a good math tutor? Town Square Know a good math tutor? Original post made by Math-Phobic Parent on Oct 25, 2007 It's become clear that my child is not going to able to successfully navigate advanced math without a tutor. Apparently, I'm late to understand this and many of the other kids in the class use tutoring routinely. Others are lucky enough to have a math-oriented parent in house. I'm looking for suggestions for good math tutors...any ideas? Posted by RS, a resident of Duveneck/St. Francis on Oct 25, 2007 at 3:51 pm There were some good suggestions in this thread from last Summer Web Link Posted by Enjoys Tutoring Math, a resident of Midtown on Oct 25, 2007 at 9:08 pm Math-Phobic parent - You didn't mention which grade your student is in, but I've tutored kids in math at Gunn for a couple of years, and work occasionally with those kids outside school. I also have four kids of my own, from a high school junior down to a fourth grader, so I've had lots of experience helping with math at many grade levels. I'm currently working for the PAUSD as a math instructional aide at our elementary school at the request of our principal, and I am gradually working towards a math teaching credential (I was a chemical engineer in my "prior" lifetime). If you think that I might work well as a tutor for your student, you could email me at rivkachana2003@yahoo.com. Hope I can be of help! Posted by Math-Phobic Parent, a resident of Old Palo Alto on Oct 25, 2007 at 9:46 pm Thank you for the link and the note...I appreciate the input!	{"url":"http://www.paloaltoonline.com/square/print/2007/10/25/know-a-good-math-tutor","timestamp":"2014-04-20T17:44:50Z","content_type":null,"content_length":"11371","record_id":"<urn:uuid:649c3260-8a4a-4097-b419-cff45be55631>","cc-path":"CC-MAIN-2014-15/segments/1398223207046.13/warc/CC-MAIN-20140423032007-00252-ip-10-147-4-33.ec2.internal.warc.gz"}
used books, rare books and new books Book summary: This text reproduces the chapters of the Sixth Edition of Calculus by Earl Swokowski, Michael Olinick, and Dennis Pence that are most relevant for a second-year course in calculus. The primary focus is the material on multivariable calculus suitable for a one-semester course: vectors and surfaces, vector-valued functions, partial differentiation, multiple integrals, and vector calculus. Chapters on infinite series, parametric equations and polar coordinates, and differential equations are also included. This text is a continuation of the Second Edition of Calculus of a Single Variable by the same trio of authors, however, this text may be used as a sequel to many other first-year texts. This text preserves the strengths that characterize the entire Swokowski series of mathematics texts--mathematical integrity, comprehensive discussions of the concepts of calculus, and an impressively large collection of worked examples and illustrative figures. It allow instructors maximum flexibility in designing their third-semester calculus course. [via]	{"url":"http://www.bookfinder.com/author/earl-swokowski/","timestamp":"2014-04-19T08:23:59Z","content_type":null,"content_length":"96140","record_id":"<urn:uuid:95a2db3b-e623-49db-83da-38e54ceb5423>","cc-path":"CC-MAIN-2014-15/segments/1397609536300.49/warc/CC-MAIN-20140416005216-00462-ip-10-147-4-33.ec2.internal.warc.gz"}
Z94.1 - Analytical Techniques & Operations Research Terminology \| A \| B \| C \| D \| E \| F \| G \| H \| I \| J \| K \| L \| M \| N \| O \| P \| Q \| R \| S \| T \| U \| V \| W \| X \| Y \| Z \| GAMBLER'S RUIN. The name given to one of the classical topics in probability theory. A game of chance can be related to a series of Bernoulli trials at which a gambler wins a certain predetermined sum of money for every success and loses a second sum of money for every failure. The play may proceed until his initial capital is exhausted and he is ruined. The statistical problems involved are concerned with the probability of the ruin of a player, given the stakes, initial capital and chances of success, and with such matters as the distribution of the length of play. There are many variations to this classical problem, which is closely associated with problems of the random walk and in the limiting case, Brownian motion, in particular, of sequential sampling. [22:117, 5.25, 13:334, 25:144] GAME THEORY. The study of the following problem: if n players Pl, P2...PN play a given game G, how must the ith player, Pi, play to achieve the most favorable result? Special two-person games can be solved by linear programming methods. More generally, the mathematical study of cooperative/competitive situations. [15] GAUSSIAN ELIMINATION. A reduction method for systems of simultaneous linear equations, in which one of the equations is solved for one of the variables in terms of the remaining variables. When these expressions for the solved variable are substituted into the remaining equations, the result is an equivalent system with one less equation and one less variable. A Gaussian elimination step is exactly equivalent to a pivot step. It is a single change of basis and can be expressed functionally as premultiplying by the inverse of an appropriate elementary column matrix. Sufficient repetition of this procedure can yield the numerical solution in case of a nonsingular square system, and a solution of parametric form, (a linear function of a subset of the variables) if the number of variables exceeds the number of equations. [19] GEOMETRIC SOLUTION. A graphic method of solving a linear programming problem, by plotting the halfplanes determined by the constraints and the lines of constant value for the objective function. GLOBAL OPTIMUM. A feasible solution (q.v.) which gives a value to the objective function at least as great (small) as any other in the feasible region. It is contrasted with a local optimum, which yields the best objective function value of all points in some subset of the feasible region. In convex programming problems a local optimum is a global optimum. (See ABSOLUTE MAXIMUM.) [19] GOAL PROGRAMMING. A model and associated algorithm to minimize the absolute value of deviations from a set of values called goals subject to technological constraints. For example, one may have goals for profit, market share, and pollution limits. GRADIENT OF A FUNCTION. A vector at a point, whose direction is the direction of most rapid change of some function f, and whose magnitude is the rate of change of f in that direction. [19] GRADIENT METHODS. A term applied to algorithms which at each iteration in their use seek to improve the current function value by moving in the direction of the gradient of the function f(x) to be optimized. The application of this method in the presence of constraints gives rise to numerous forms depending upon the type of problem and the manner in which the method is modified to handle constraints. [18] GRAPH (LINEAR). Compare network. A linear graph consists of a number of nodes or junction points, each joined to some or all of the others by arcs or lines. [11] GRAPH, SIGNAL FLOW. (See SIGNAL FLOW GRAPH.) < Previous \| Next >	{"url":"http://www.iienet.org/Details.aspx?id=1590","timestamp":"2014-04-17T07:48:29Z","content_type":null,"content_length":"120392","record_id":"<urn:uuid:c6ffca09-8e19-4382-85bb-60a80e21ffe4>","cc-path":"CC-MAIN-2014-15/segments/1397609526311.33/warc/CC-MAIN-20140416005206-00397-ip-10-147-4-33.ec2.internal.warc.gz"}
Got Homework? Connect with other students for help. It's a free community. • across MIT Grad Student Online now • laura* Helped 1,000 students Online now • Hero College Math Guru Online now Here's the question you clicked on: Solve the quadratic equation 5x2 - 125 = 0. Show all your steps. • one year ago • one year ago Your question is ready. Sign up for free to start getting answers. is replying to Can someone tell me what button the professor is hitting... • Teamwork 19 Teammate • Problem Solving 19 Hero • Engagement 19 Mad Hatter • You have blocked this person. • ✔ You're a fan Checking fan status... Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy. This is the testimonial you wrote. You haven't written a testimonial for Owlfred.	{"url":"http://openstudy.com/updates/50785c5ae4b0ed1dac50e08e","timestamp":"2014-04-21T04:42:40Z","content_type":null,"content_length":"42049","record_id":"<urn:uuid:b332bc96-6ac5-431a-9225-3b160e69d0b0>","cc-path":"CC-MAIN-2014-15/segments/1398223204388.12/warc/CC-MAIN-20140423032004-00181-ip-10-147-4-33.ec2.internal.warc.gz"}
Lesson Plans for Subtraction with Regrouping Lesson Plans Lesson Plans for Subtraction with Regrouping Rationale: Students need to acquire the mathematical skills, understanding, and attitudes that they will need to be successful in their careers and daily lives. Objectives: To develop an understanding of subtraction with regrouping by using physical materials to construct meaning for numbers. Single popsicle sticks and bundles of ten. Place value mats. Procedure: The students will be asked to place bundles and single popsicle sticks onto their place value mats that coincide with the number written on the blackboard. The students will then be given a number to subtract that will require regrouping. The students will be shown how take a bundle from the 10’s column in order to regroup, placing the bundle of ten in the 1’s column. As the students solve the problem with the manipulatives, the teacher will write the problem on the board. This will numerically illustrate what the students are solving. Assessment: Students will be assessed by observation of the correct placement of the popsicle sticks on the mat. The students will also be assessed by the completion of a review worksheet to be given as classwork. Lesson Plans for “Me on the Map” Students will read aloud the story “Me on the Map” in order to increase fluency and review for reading comprehension. Students will create a time line to sequence information learned from text into a logical order to retell facts in order to increase reading comprehension skills and response to text. The students will also answer questions correctly that are posed about the story in order to increase fluency. Procedure: The students will be given computer created picture cards representing the key words in the story “Me on the Map”. The students will be asked to place their cards on the appropriate position on the teacher created time line. Students will be assessed through teacher observation of reading and proper placement of picture cards on the time line. Lesson Plans for “The Crowded House” Oral language is a powerful tool for communicating, thinking, and learning. Through speaking and listening, students acquire the building blocks necessary to connect with others, develop vocabulary, and perceive the structure of the English language. An important goal in the language arts classroom is for students to speak confidently and fluently in a variety of situations. Descriptive statement of Standard 3.3: Speaking NJ Core Curriculum Content Standards The students will create sentences containing new vocabulary words from the play, “The Crowded House” in order to expand their language skills. The students will be given roles to read aloud in order to use speaking techniques, including voice modulation, inflection, tempo, and enunciation for effective presentation. The students will participate in a group discussion in order to respond orally to literature and participate in class discussions appropriately. The students will write paragraphs comparing and contrasting plays to other literary genres in order to demonstrate higher order thinking skills and writing clarity when answering questions in response to literature. The students will be assessed based on teacher observation of student performance. The students will also be assessed on the mechanics of writing, content, and clarity of their writing assignment. Lesson Plans: Measuring with Crayons Grade level: K-1 Topic: The students will be introduced to the concept of estimation. They will also learn measurement using crayons. We have put together a fun activity which will encompass both of these aspects. It is a way for the students to use measurement and estimation in such a way that it relates to their everyday lives. Rationale: Children need to understand the concept of measurement and how it relates to their lives. They also need to understand that measurements can be made with everyday objects because standard units of measurement are not always available. Objective: Students will be able to measure length using crayons. Assessment: The students will write the correct measurement on their strips of paper. We will go around helping and checking for accurate measurement. Objective: The students will also learn the terms standard unit of measurement, and estimation. The students will have a clear understanding of measurement upon completion of the lesson. They will also have an emergent understanding of estimation. Assessment: The students will be asked to estimate the length of their paper strips, as well as the paper chain. Their estimations will be recorded on a graph. We will discuss the results with the Prior Knowledge: The students have already had two lessons on measuring length. Kristy and I taught a lesson on measuring with candy corn. Mrs. Shilkret, our coordinating teacher also taught a lesson on measurement using Popsicle sticks. With this background, the students will be able to expand on their knowledge of measurement and use this knowledge to begin to understand a new concept, Standards: The New Jersey Core Curriculum Content Standard for Science that this lesson covers is 5.3, section B. Geometry and Measurement. Hook: We will ask the students what their parents would do if they were going to buy a new couch, but were not sure that the couch would fit in the living room. We will then show the students a ruler, a tape measure, and a measuring tape. We will ask the students what types of objects these standard units of measure could be used to measure. Activities: Students will be given three strips of construction paper with graduating lengths. We will then model using estimation. Kristy will estimate the length of the blackboard. We will then measure the blackboard using crayons. We will write down the estimation of the blackboard as well as the actual measurement. We will then ask the children to estimate the length of their longest paper strip. Estimates will be written on the board. We will continue to do this for the other two strips. Then we will pass out the crayons and have the students actually measure their paper strips. The students will write the number of crayons used to measure their strips on the strips themselves. The next activity involves having the students bring their two largest strips up to the front of the room where will be construct a paper chain. When the chain is completed, we will call on students to makes estimations as to how long the paper chain will be in crayons measurement. The estimates will be recorded on a graph. Finally, the students will gather at the back of the room and count aloud as we place the crayons in a long line down the paper chain. When we get the actual measurement, the students will go back to their desks and we will compare their estimations to the actual length of the paper chain. Questions and Examples: Questions will include, “What would your mom or dad do if they were going to buy a new couch, and they weren’t sure if it would fit in your living room?” When holding up a standard unit of measurement, we will ask, “What would you measure with this?” We will also be asking the students to estimate on numerous occasions. Closure: As the lesson draws to a close, we will ask the students if they have to use a ruler to measure. We will also ask if it is necessary to measure all the time. In this way we are reiterating what the students have already learned, as well as getting them to recognize that they now have the ability to estimate.	{"url":"http://pan.intrasun.tcnj.edu/501-S03/Cooper/lesson_plans.htm","timestamp":"2014-04-18T11:58:47Z","content_type":null,"content_length":"17373","record_id":"<urn:uuid:e9680ec3-4704-465c-81f5-d1ed21739a7a>","cc-path":"CC-MAIN-2014-15/segments/1397609533308.11/warc/CC-MAIN-20140416005213-00029-ip-10-147-4-33.ec2.internal.warc.gz"}
Proof for Hilbert's third problem See Hilbert's third problem for what we want to prove, motivation, discussion and importance. Due to the moderate length of the proof, I give an outline of the ideas and principal constructs used. More details are in the linked nodes. Max Dehn proved a counterexample to Hilbert's third problem; in fact, his method gives a means to construct very many counterexamples, as well as a more general framework for studying how polyhedra can fit together in three dimensions. The proof shows how to construct pairs of tetrahedra of equal volume which are neither equidecomposable nor equicomplementable. As such, the equality of their volumes cannot be justified without the use of calculus. The proof uses some linear algebra in an ingenious way. It may help to "recall" that the real numbers R are a vector space over the field of rational numbers Q. A basis for this vector space is often called a Hamel basis, to emphasise that only finite linear combinations are considered here (unlike, e.g., the bases used in Hilbert spaces and other Banach spaces). The existence of such a Hamel basis requires the axiom of choice; luckily, Dehn doesn't really require such a basis. The proof can proceed without relying on the axiom of choice. It is completely constructive: the tetrahedra may be specified explicitly. I recommend you first read just the outline, then follow the links to learn about what happens in each step. A. Define Dehn invariants. A Dehn invariant D[f] is a function mapping polyhedra in R^3 to numbers. See next steps for the essential property of Dehn invariants, which provides motivation for the strange definition. Dehn invariants are preserved by all congruent transformations. B. Show that Dehn invariants are "additive". If you cut up a polyhedron into smaller polyhedra, the Dehn invariant of their "sum" is the sum of the Dehn invariants of the smaller polyhedra. It immediately follows that for any Dehn invariant D[f], if A and B are either equidecomposable or equicomplementable then D[f](A)=D[f](B). This should show the relevance of Dehn invariants to Hilbert's third problem... C. "Note" (or, if you're like me, get some hints) that there are zero and nonzero Dehn invariants of some polyhedra (the problem is actually showing that any polyhedra with nonzero invariants). In particular, find tetrahedra R,T of equal volume and some D[f] with D[f](S)≠D[f](T). D. It follows that R and T are neither equidecomposable nor equicomplementable! Since there are two tetrahedra R and T such that all Dehn invariants D(R) of R are zero, and one Dehn invariant D[f] for which D[f](T)≠0. These R and T have equal bases (indeed, they have congruent bases -- the isoceles right triangle) and equal heights above these bases (1). This concludes the (dis)proof for Hilbert's third problem . There be a truly " " definition of	{"url":"http://everything2.com/title/Proof%2520for%2520Hilbert%2527s%2520third%2520problem","timestamp":"2014-04-16T19:10:59Z","content_type":null,"content_length":"26471","record_id":"<urn:uuid:bc7a7a58-8887-4699-b6d9-a0b88b5f7945>","cc-path":"CC-MAIN-2014-15/segments/1398223202548.14/warc/CC-MAIN-20140423032002-00372-ip-10-147-4-33.ec2.internal.warc.gz"}
MaplePrimes Commons General Technical Discussions Someone asked me the other week whether a color gradient could be easily applied to a high density point-plot, either vertically or horizontally graded. Without thinking, I said, "Sure, easy." But when I got to a computer, and gave it a little thought, I realized that it's not that easy to do it efficiently. And it really ought to be, even for tens of thousands of points. There is a help-page plot,color which briefly describes some things that can be done with coloring plots. As of Maple 16, it mentions a "color data structure" which can be created by calls to the new ColorTools package. There is an example on that page for a single color, but not for several colors concurrently. Using Colortools to get a list of colors, for many points, can be done. (And there ought to be such an example.) But for the case of many data points that uses quite a lot of memory, and is slow. Also, there is no 2D plotting equivalent to the 3D plotting colorfunc functionality. There ought to be. And just as the 3D colorfunc should be fixed to take three arguments (x,y, & z) any new 2D colorfunc should be made to take two arguments (x & y). So, how can we apply a color gradient on a 25000 2D-point-plot, shaded by y-value? One way is to notice that the various 2D and 3D plot data structures can now store an efficient m-by-3 (or m-by-n-by-3) C_order, float[8] Array for the purpose of representing the chosen colors. (That is not documented, but can be learned by observation and inspection of various example plot structures.) We know that such an Array is relatively memory-light, and can be produced very quickly. What this task has become is a 2D version of this method of inserting a custom made color sequence into a 3D plot, but more efficient on account of using a float[8] Array. To get some decent timings the attached worksheet uses the time[real] command. Timings are computed both immediately after computation (same execution block) as well as after plot rendering (next execution block). It takes about 1 sec for the Maple 16.01 64bit Standard GUI on Windows 7 to throw up and render the plot, for both methods. It takes 3.4 sec, and a 108 MB increase in allocated memory, to compute the plot data structure result using ColorTools and a list. But it takes only 0.45 sec, and a 20.5 MB increase in allocated memory, to compute an equivalent plot data structure using the float[8] Array. (Timings on an Intel i7-960.) [worksheet upload is misbehaving. So inlining the code.] time[real]()-str; # in new execution group time[real]()-str; # in new execution group	{"url":"http://www.mapleprimes.com/posts/MaplePrimes%20Commons%20General%20Technical%20Discussions?page=5","timestamp":"2014-04-19T22:26:15Z","content_type":null,"content_length":"158724","record_id":"<urn:uuid:33b16c33-9f91-406a-b951-5a2f3573acf4>","cc-path":"CC-MAIN-2014-15/segments/1398223210034.18/warc/CC-MAIN-20140423032010-00528-ip-10-147-4-33.ec2.internal.warc.gz"}
Maximum Charge on Designed Capacitor I'll spare you all the details, but suppose for some reason (too complicated to get into here) I needed to design a capacitor with certain fixed parameters and only one adjustable aspect, and I wanted the design to maximize the total charge the device could store. According to my calculations, changing the adjustable parameter described below does not seem to make any difference to the answer, and I'm suspicious that I am making a error, hence my post: Here are the fixed parameters: - the plate area A - the distance between the plates d - the space between is filled with two dielectrics as follows: i) Strontium Titanate, (K=300, V/m=8e6) ii) dry air @ STP, (K=1, V/m=3e6) - the StrontiumTi is in the middle with equal sized air gaps before each plate - the air gaps are required in the design and must be at least 0.001d each. The question becomes, what fraction of "d" should the thickness of the StrontiumTi be to maximize the total charge the capacitor can hold. The issue is that C increases with more StontiumTi, but the air gap has a higher voltage gradient and the maximum charging voltage falls as the air gap decreases. Since Q=CV, I suspect that Q is a constant in this case, but I wanted to set up the equations to prove this, and I'm having some trouble making sense of it all. Now don't ask why the air gap is required, that's an independent issue outside the scope of the problem and is simply a design constraint. If it could be eliminated, then clearly the entire dielectric could just be the StontiumTi and then this would give the ideal situation. And this is why I'm confused, because it seems as soon as we insist on the presence of the air gap, the amount of the other material doesn't seem to affect the total charge attainable. On the one hand, this result seems plausible because the voltage gradient is much lower in the StrontiumTi leaving the bulk of the charging voltage across the thin air gap limiting the charging voltage substantially. But on the other hand it seems fishy that things would change so suddenly and drastically due to the presence of this required air gap, and that's why I'm suspicious that something is amiss. If the air gap wasn't there, Vmax would become 8e6 X d and C would be a maximum giving Q=CV the highest possible value. However, once the air gap is introduced, Vmax drops substantially. As the air gap is increased, Vmax increases, but C falls accordingly, and Q seems to be constant as a result. In my attempts at working on this, I recognized that the voltage gradient (delta V / delta d) is 300 times lower in the StontiumTi than in the air, but that the voltage is the gradient X thickness of the layer. So I think I did all that part correctly.	{"url":"http://www.physicsforums.com/showthread.php?p=4272054","timestamp":"2014-04-18T15:51:37Z","content_type":null,"content_length":"49161","record_id":"<urn:uuid:bda99538-08ae-41a0-aa8f-a22be0a7d983>","cc-path":"CC-MAIN-2014-15/segments/1397609533957.14/warc/CC-MAIN-20140416005213-00150-ip-10-147-4-33.ec2.internal.warc.gz"}
Got Homework? Connect with other students for help. It's a free community. • across MIT Grad Student Online now • laura* Helped 1,000 students Online now • Hero College Math Guru Online now Here's the question you clicked on: x(7 – x) > 8 A. 2 B. 8 C. –1 D. 0 • one year ago • one year ago Best Response You've already chosen the best response. Start by distributing that x. x(7 -x) > 8 7x + x^2 > 8 x^2 + 7x -8 > 0 (x+8)(x-1) > 0 x = -8 x = 1 Best Response You've already chosen the best response. Then substitute each back into the original equation, and see which one is true. Best Response You've already chosen the best response. For a problem like this, that you don't know how to solve, it is best to just pluge in the answers. A 2= 10>8 B 8= -8>8 C -1= -8>8 D 0= 0>8 So there is only one true statement there and it is a Best Response You've already chosen the best response. where did the 10 come from? Best Response You've already chosen the best response. @Rosy95: there will be an occasion when there are no answers... Therefore, it is always better to learn how to do such a problem (see @blurbendy's method), so next time you'll know what to do. Best Response You've already chosen the best response. 10 is what you get on that side when you sub the 2 in for the x's. x(7-x)>8 2(7-2)>8 14-4>8 10>8 @ZeHanz yes I know that, however I was just saying that when it comes down to a test you cant just look it up, therefore when they give you answer choice, plug it in Best Response You've already chosen the best response. @Rosy95 thanks Best Response You've already chosen the best response. @Rosy95: Am I right in thinking that a lot of people asking questions here do multiple choice questions all the time? Best Response You've already chosen the best response. Yes, and on math test it is a lot of mult choice questions, so if you are not getting something, plug it in and your welcome @d_poole Best Response You've already chosen the best response. That explains a lot. I'm from Holland, and many high school students never see even one multiple choice question at maths. Best Response You've already chosen the best response. Oh ok. Well to give you an example. I had a 40 question math test and only 3-5 were NOT multipul choice, so even if you miss the written ones, you will still pass. Best Response You've already chosen the best response. Advantage for the teacher: quick grading, although less rewarding if students are just trying some numbers, probably using a calculator... Best Response You've already chosen the best response. yes that is all true lol...and I am actually a tutor in algebra currently so I know how do these problems, but because someone had already explained how to do this problem, i was giving d_poole another option Best Response You've already chosen the best response. but @ZeHanz if you are good at precal or math in general can you help me with my question..here is the link to it on here http://openstudy.com/study#/updates/50f5c9aee4b061aa9f9ad656 Best Response You've already chosen the best response. I'going to sleep now...sorry, but glad to help you soon! Bye. Best Response You've already chosen the best response. Ok. Thanks night! Your question is ready. Sign up for free to start getting answers. is replying to Can someone tell me what button the professor is hitting... • Teamwork 19 Teammate • Problem Solving 19 Hero • Engagement 19 Mad Hatter • You have blocked this person. • ✔ You're a fan Checking fan status... Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy. This is the testimonial you wrote. You haven't written a testimonial for Owlfred.	{"url":"http://openstudy.com/updates/50f5c876e4b061aa9f9ad5a5","timestamp":"2014-04-19T22:41:53Z","content_type":null,"content_length":"64584","record_id":"<urn:uuid:22f3bf0a-e18b-448d-9f8f-3958562d4ea6>","cc-path":"CC-MAIN-2014-15/segments/1397609537754.12/warc/CC-MAIN-20140416005217-00107-ip-10-147-4-33.ec2.internal.warc.gz"}
Prove: If H is a finite group of even cardinality, the H contains an element h of ord Prove: If H is a finite group of even cardinality, the H contains an element h of order 2. Problem: Suppose $\left\|H\right\|$ is even. Prove that at least one element of $H$ is of order two. Proof: Suppose that $H$ contained no elements of order two. We can see then that $ae a^{-1}$ for all nontrivial elements of $H$. Therefore elements of this nature come in distinct pairs ( $a,a^{-1}$) adding up all these elements will then give an even number. Then noting that since no nontrivial element of $H$ had order two we can see that the total number of elements in $H$ is the number of all elements whose order isn't two and the identity element. But this is an even number plus one, thus odd which is of course a contradiction.	{"url":"http://mathhelpforum.com/advanced-algebra/112706-prove-if-h-finite-group-even-cardinality-h-contains-element-h-ord-print.html","timestamp":"2014-04-16T11:23:22Z","content_type":null,"content_length":"6114","record_id":"<urn:uuid:42dd7052-cbfc-4c07-8119-cf4b64fc5576>","cc-path":"CC-MAIN-2014-15/segments/1398223206647.11/warc/CC-MAIN-20140423032006-00402-ip-10-147-4-33.ec2.internal.warc.gz"}
Constructivism, Situated Learning, and What is Mathematics? Major Unifying Themes in This Document Foundational Information Learning Theories Mind and Body Tools Science of Teaching & Learning Project-Based Learning Computational Mathematics The Future Website Author "Dr. Dave" Moursund │Constructivism, Situated Learning, and Other Learning Theories ││ │ ││ │ Click here for this Website's search engine. ││ Overview of This Topic How do students learn math? Are there learning theories that are especially relevant to the teaching and learning of math? Progress is occurring in providing answers to these sorts of questions. However, the prevailing teaching situation is summarized by the following quote: For example, I've been in enough high school math classes over the last five years to know that there is no developmental theory of how students learn algebra. The kids who don't make it and don't respond to the kind of instruction they're receiving are simply not included in the instructional model. And teachers in the classrooms I've observed take no responsibility for the lowest-performing students. That's because the prevailing a theory of learning suggests that teaching mathematics is not a developmental problem but a problem of aptitude. Some people get it, some don't. Elmore, Richard F. (2002). The Limits of Change [Online]. Accessed 2/18/02: http://www.edletter.org/current/ This quotation captures the essence of a need for understanding of mathematics developmental theory and a need for understanding of learning theories appropriate to the teaching and learning of math. Both are missing in many math education environments. There are many different learning theories. For many years, the behaviorist theory of B. F. Skinner was dominant. In more recent years, a number of new theories have been developed. Some are called cognitive learning theories, because they take into consideration the conscious thinking abilities of a human being. These theories posit that human learners are much more than pigeons and rats where a stimulus/response approach can be used to condition certain behaviors. Much of this workshop is built on constructivism. This is a learning theory that says that people build (construct) new knowledge upon their previous knowledge. In recent years, there has been considerable research that supports constructivism. It is a theory that can help guide curriculum, instruction, and assessment across all disciplines covered in our formal educational system. It is particularly applicable in mathematics education. Humans and many other animals have a modest amount of innate ability to deal with numbers. Many different species can perceive the difference between two small numbers -- such as three offspring are present versus only one is present. But, the human innate capacity to count -- 1, 2, 3, 4, many -- is certainly limited relative to needs in our contemporary society. Thus, throughout recorded human history we find evidence of humans developing aids to the innate mathematical abilities of their brains. A baboon bone with 29 incised notches has been dated at 37,000 years old. A 20,000 year old bone has been discovered that has 11 groups of five marks incised on it. More recent example include the counting board, abacus, math tables, mechanical calculators, logarithms, electrical and electronic calculators, and electronic digital computers. Mathematics is much more than counting and simple arithmetic. It is a cumulative science in which new results are built upon and depend on earlier results. We have a 5,000 year history of formal mathematical development. Humans have accumulated (discovered, developed) a huge amount of mathematical knowledge -- far far more than a person can learn in a lifetime, even if the person spent all of their time studying mathematics. During these 5,000 years we have developed many aids to learning and "doing" (using, applying) mathematics. Thus, our educational system is faced by: 1. The need to decide what mathematical knowledge and skills should be included in the curriculum 2. How to effectively and efficiently help students to gain the mathematical knowledge and skills that are incorporated into the curriculum. 3. How to teach (learn) for transfer and retention -- so that the mathematical knowledge and skills that students gain in school are available for use throughout the curriculum, work, and play of their lifetime. Constructivism and Learning Mathematics Howard Gardner has identified Logical/mathematical as one of the eight (or more) intelligences that people have. As with the other intelligences in Gardner's classification system, people vary considerably in the innate levels of mathematical intelligence that they are born with. People like to argue nature versus nurture in terms of both general intelligence and intelligence within specific domains such as those that Gardner lists. We know that the brain has great plasticity, that there is a lot of brain growth after a person is born, that the brain continues to grow new neurons and new connections among neurons throughout life, that certain drugs can damage brain cells, that proper nutrition is needed for proper brain growth, and so on. A certain amount of math knowledge and skill is innate--genetic in origin. The great majority of a person's math knowledge and skills comes from learning--learning to use parts of the brain that can learn to do math, but were not genetically designed specifically for this purpose. Math is a cumulative, vertically structured discipline. One learns math by building on the math that one has previously learned. That, of course, sounds like Constructivism. In brief summary, here is a constructivist approach to thinking about mathematics education. 1. People are born with an innate ability to deal with small integers (such as 1, 2, 3, 4) and to make comparative estimates of larger numbers (the herd of buffalo that we saw this morning is much smaller than the herd that we are looking at now.) 2. The human brain has components that can adapt to learning and using mathematics. 3. Humans vary considerably in their innate mathematical abilities or intelligence. 4. The mathematical environments that children grow up in vary tremendously. 5. Thus, when we combine nature and nature, by the time children enter kindergarten, they have tremendously varying levels of mathematical knowledge, skills, and interests. 6. Even though we offer a somewhat standardized curriculum to young students, that actual curriculum, instruction, assessment, engagement of intrinsic and extrinsic motivation, and so on varies 7. Thus, the are huge differences among the mathematical knowledge and skill levels of students at any particular grade level or in any particular math course. In addition, there are considerable differences in their ability to learn mathematics. 8. Thus, mathematics curriculum, instruction, and assessment needs to appropriately take into consideration these differences. One way to do this is through appropriate use of constructivist teaching and learning principles. It is interesting to note that many researchers and practitioners in ICT have come to the same conclusion about teaching and learning ICT. They recommend a constructivist approach. Journaling, Project-based Learning, and Problem-based Learning are all standard components of a constructivist teaching/learning environment. (Note that both project-based and problem-based learning are abbreviated PBL.) One of the strands of this workshop is devoted to ICT-Assisted PBL Situated Learning and Learning Mathematics Situated Learning is emerging as a learning theory that is particularly relevant to teaching. Thus, this topic needs to be presented in some detail here. My current bibliography on the topic is given http://otec.uoregon.edu/learning_theory.htm#Situated Learning Situated learning tends to have characteristics of Project-Based Learning and Problem-Based Learning. It also appears to tie in closely with general ideas of Problem Solving. Thus, in Problem Solving we talk about domain specificity and domain independence. The argument is that one needs a lot of domain specific knowledge to solve problems within a domain. Situated Learning tends to be within a domain (a situation). Thus one might call it a Domain Specific Learning Theory. Other Learning Theories See: http://otec.uoregon.edu/learning_theory.htm Top of Page	{"url":"http://pages.uoregon.edu/moursund/Math/learning-theories.htm","timestamp":"2014-04-20T21:55:26Z","content_type":null,"content_length":"15091","record_id":"<urn:uuid:b60f1c45-43e1-4c7c-aecf-7b2e36157301>","cc-path":"CC-MAIN-2014-15/segments/1398223205137.4/warc/CC-MAIN-20140423032005-00269-ip-10-147-4-33.ec2.internal.warc.gz"}
Calling NAG Library Routines from Octave 1. According to the C Library Manual, the prototype for function s15ddc looks like this: #include <nag.h> #include <nags.h> Complex nag_complex_erfc(Complex z, NagError *fail); The function takes two arguments. The first one is of type Complex and is the argument z of the function. The second argument to s15ddc is the error handling argument fail which is of type NagError. See the NAG C Library Manual for more information about the NagError type. To keep things simple we are not going to try to pass the contents of the NagError structure back to Octave. Instead, we will return only integer value of fail.code. 2. Here is the source code of our C++ function nag_cmplx_erfc.cc: #undef Complex #define Complex OctComplex #include <octave/oct.h> #undef Complex #define Complex NagComplex #define MatrixType NagMatrixType #include <nag.h> #include <nags.h> DEFUN_DLD (nag_cmplx_erfc, args, , "Calls nag_complex_erfc (s15ddc), which computes values \n\ of the function w(z)=e^(-z^2)erfc-iz, for complex z.\n") // Variable to store function output values octave_value_list retval; // Retrieve input arguments from args OctComplex z = args(0).complex_value(); // Local variables NagError fail; OctComplex w; NagComplex z_nag, w_nag; // Copy the input OctComplex variable into NagComplex one z_nag.re = z.real(); z_nag.im = z.imag(); // Call NAG routine like in C w_nag = nag_complex_erfc(z_nag,&fail); // Copy the output NagComplex variable into OctComplex one w.real() = w_nag.re; w.imag() = w_nag.im; // Assign output arguments to retval retval(0) = w; retval(1) = fail.code; return retval; Points to note about this code: ● For clarity, the input arguments type checking and error message printing have been omitted in the article text. However, they have been added to the file you can download from this site. ● Complex and MatrixType types are defined in Octave and NAG header files. In this example we are using Complex type, so we need to rename both of its definitions. We overwrite it with OctComplex, before including oct.h, and with NagComplex, before including nag.h. We are not using MatrixType, so it can be renamed in one place only, like in the previous example. ● NAG and Octave Complex types are defined differently, so we cannot pass an Octave complex variable directly to a NAG routine. We create a local variable of type NagComplex and make a copy of the Octave variable. We do the opposite with the complex type result from the NAG routine. ● The third DEFUN_DLD argument (nargout) is not used, so it is omitted in order to avoid the warning from gcc about an unused function parameter. 3. To compile the C++ function into oct-files, we use the mkoctfile script supplied with Octave: % mkoctfile nag_cmplx_erfc.cc -L/opt/NAG/cll6a08dg/lib -lnagc_nag -I/opt/NAG/cll6a08dg/include ● the -L switch tells the C compiler where to look for NAG C Library installed on your system; ● -lnagc_nag is the name of the NAG C Library; ● the -I switch should be followed by the location of NAG C Library header files. 4. Assuming that all has gone well, we can call the function as if it was part of Octave itself, i.e. either from the Octave command line or from within an Octave program. An example call may be: octave:1> z=complex(-3.01,0.75) z = -3.01000 + 0.75000i octave:2> [w,ifail]=nag_cmplx_erfc(z) w = 0.052156 - 0.183776i ifail = 0 (If you get an error message saying that a library cannot be located, see the tip given in Example 1).	{"url":"http://www.nag.co.uk/doc/techrep/html/Tr4_09/Example2/TRExample2.html","timestamp":"2014-04-18T13:14:03Z","content_type":null,"content_length":"6288","record_id":"<urn:uuid:b688bf98-0431-4120-9c4c-efc99004eb89>","cc-path":"CC-MAIN-2014-15/segments/1397609533689.29/warc/CC-MAIN-20140416005213-00341-ip-10-147-4-33.ec2.internal.warc.gz"}
Simple theoretical Mechanical Energy question May 28th 2009, 03:41 PM Simple theoretical Mechanical Energy question What is the answer to only the letter e in the following?: "A 0.5kg rubber ball is thrown into the air. At a height of 20m above the ground, it is trabelling at 15m/s. (a) What is the ball's kinetic energy? (b) What is its gravitational potential energy relative to the ground? (c) How much work was done by someone at ground level throwing the ball up into the air? (d) What was the speed of the ball when it left the ground? (e) Do your answers depend on the ball's direction?" Any help would be greatly appreciated! Thanks in advance! May 28th 2009, 04:21 PM energy has no direction and it does not depend on direction this is one of the huge advantages to using energy to calculate rather than using velocity formulas where you would have to pay attention to the direction(sign) on your numbers	{"url":"http://mathhelpforum.com/math-topics/90871-simple-theoretical-mechanical-energy-question-print.html","timestamp":"2014-04-21T07:30:56Z","content_type":null,"content_length":"4157","record_id":"<urn:uuid:18515b88-aa73-4852-b0cb-7342a47e561d>","cc-path":"CC-MAIN-2014-15/segments/1397609539665.16/warc/CC-MAIN-20140416005219-00369-ip-10-147-4-33.ec2.internal.warc.gz"}
formal smooth morphism with a formal smooth source up vote 5 down vote favorite Let $f:X\rightarrow Y$ a morpism between $k$-schemes ( $k$ a field). We suppose that X is formally smooth and f is formally smooth and surjective. Do we have that $Y$ is formally smooth? Or if it's not is there weaker hypotheses as every thing is locally of finite type to obtain smoothness of $Y$? ag.algebraic-geometry deformation-theory smooth-manifolds schemes You write "as every thing is locally of finite type", but prior to that you make no such lft hypothesis, so it is confusing. If $X$ and $Y$ are locally finite type over $k$ then any $k$-morphism between them is lft (equivalently, locally of finite presentation), and for an lfp map smoothness is the same as formal smoothness by EGA. So in the lft case, if f is formally smooth then it is smooth, and thus flat. So then $Y$ inherits $k$-smoothness from $X$, as we can pass up to $\overline{k}$ and use that a noetherian ring is regular if it has a faithfully flat extension ring that is regular. – user29720 Jun 23 '13 at 16:51 1 what I meant is that in the lft case it's well known but I would like to know if we can weaken these hypotheses. – prochet Jun 23 '13 at 16:53 By Theorem 28.7 in Matsumura's "Commutative Ring Theory", a noetherian local $k$-algebra is formally $k$-smooth for its max-adic topology if and only if it is "geometrically regular" over $k$, in the sense that it remains regular after tensoring against any finite extension of $k$. By 19.7.1 in EGA 0$_{\rm{IV}}$, if $X$ and $Y$ are locally noetherian and $f$ between local rings is formally smooth for max-adic topologies then it is flat, so $Y$ inherits geometric regularity over $k$ from $X$. So try to relate "global" formal smoothness to max-adic formal smoothness on local rings. – user29720 Jun 23 '13 at 19:19 so it's probably true if X and Y are locally noetherian? To relate global to local, maybe it's sufficient to say that formal smoothness is local for Zariski topology on the source and on the target by 17.1.6 (i) and (ii) in EGA IV.4 – prochet Jun 23 '13 at 22:32 and let say that only Y is locally noetherian and moreover the morphism is faithfully flat? – prochet Jun 23 '13 at 22:34 show 2 more comments Know someone who can answer? Share a link to this question via email, Google+, Twitter, or Facebook. Browse other questions tagged ag.algebraic-geometry deformation-theory smooth-manifolds schemes or ask your own question.	{"url":"http://mathoverflow.net/questions/134537/formal-smooth-morphism-with-a-formal-smooth-source","timestamp":"2014-04-19T02:36:17Z","content_type":null,"content_length":"52900","record_id":"<urn:uuid:129ca387-71e0-448f-867f-289266998160>","cc-path":"CC-MAIN-2014-15/segments/1397609535745.0/warc/CC-MAIN-20140416005215-00535-ip-10-147-4-33.ec2.internal.warc.gz"}
Download v0.5 of the toolkit for Mac OS 10.5 and higher. last updated 10/22/2010 What is LPC? From Digital Processing of Speech Signals by Rabiner and Schafer "The basic idea behind linear predictive analysis is that a speech sample can be approximated as a linear combination of past speech samples. By minimizing the sum of the squared differences (over a finite interval) between the actual speech samples and the linearly predicted ones, a unique set of predictor coefficients can be determined. (The predictor coefficients are the weighting coefficients used in the linear combination)" LPC is essentially a way to do source/filter separation. In speech, it works on the premise that the vocal tract can be considered a slowly-time varying filter in which an excitation (glottal pulse and noise) is fed to produce speech. Using linear prediction we can estimate the vocal tract filter coefficients. The error signal between the estimated and the actual speech can be considered the excitation signal (the source). The voice can be resynthesized by running the error signal through the inverse prediction filter or by running a synthesized excitation signal through the inverse In music, you can use this technique for cross-synthesis by performing linear prediction analysis on two different source signals, and running the resulting excitation of one source into the resonance filter of the other. Basic LPC block diagram (from Digital Processing of Speech Signals): The LPC toolkit The idea behind the LPC toolkit is to separate out many of the pieces of LPC into a number of usable Max/MSP objects which can be ordered in different ways to yield a variety of effects for speech processing, synthesis and cross-synthesis. The goal is to give the user enough flexibility to allow them to easily incorporate the techniques of speech processing in creative, musical ways in **NOTE: these tools are intended for making music, not compressing speech. Object details Current object list This object performs the basic linear prediction analysis. It uses the autocorrelation method, so it is guaranteed to produce stable coefficients (within numerical limits). It outputs both PARCOR and filter coefficients, as well as a coefficient index signal, a filter gain signal and a time aligned throughput. If you are going to be quantizing the coefficients, you should use the PARCOR coefficients (less prone to instability due to quantization). In this implementation of LPC, the user has the option to turn pre-emphasis on or off. When analyzing a speech signal, pre-emphasis reduce the effects of the glottal pulse and radiation, and therefore the linear prediction analysis is more accurately representing just the vocal tract. However, if this is used, de-emphasis should be used during resynthesis to recover the low pass properties of the glottal pulse, etc. A high order FIR filter to compute the error signal of the linear prediction analysis. This error can also be thought of us the residual, the excitation or the "source" (as in source/filter In addition to the input of the signal to be filtered it also has a coefficient input and a coefficient index input. A high order IIR filter that acts as the resynthesis filter in LPC. This object is used to impose the analyzed/synthesized spectral envelope of a sound onto an excitation signal (or any signal... be creative). This object has the option of enabling de-emphasis to return the approximated glottal pulse response that may have been removed before analysis In order to synthesize a flexible, parametric excitation signal (for speech) from bandlimited impulse train and noise generators, we must be able to extract the fundamental frequency of the source. The algorithm used in this object is based on IRCAM's Yin algorithm and the Tartini project (for the clarity measure). This object outputs a band limited impulse train. The algorithm it implements is the sum of windowed sync (SWS) method described in Tim Stilson's PhD thesis This object takes a coefficient signal and coefficient index signal as inputs and outputs a list formatted for Max/MSP's filtergraph~ object to create a frequency response display over the filter coefficients. Max/MSP's filtergraph~ object can only display up to 49th order filters, so the frequency response will be a bit inaccurate at orders > 49 (though the correct general shape will be More information on LPC Other references LPC in computer music languages Classic examples of LPC in composition	{"url":"http://www.markcartwright.com/projects/lpcToolkit/","timestamp":"2014-04-19T19:34:40Z","content_type":null,"content_length":"8931","record_id":"<urn:uuid:ba5abf5e-e395-4dbc-b22b-a8b8544ad37c>","cc-path":"CC-MAIN-2014-15/segments/1398223203422.8/warc/CC-MAIN-20140423032003-00573-ip-10-147-4-33.ec2.internal.warc.gz"}
Radix must be an exact integer, either 2, 8, 10, or 16. If omitted, radix defaults to 10. The procedure `number->string' takes a number and a radix and returns as a string an external representation of the given number in the given radix such that (let ((number number) (radix radix)) (eqv? number (string->number (number->string number is true. It is an error if no possible result makes this expression true. If z is inexact, the radix is 10, and the above expression can be satisfied by a result that contains a decimal point, then the result contains a decimal point and is expressed using the minimum number of digits (exclusive of exponent and trailing zeroes) needed to make the above expression true [howtoprint], [howtoread]; otherwise the format of the result is unspecified. The result returned by `number->string' never contains an explicit radix prefix. Note: The error case can occur only when z is not a complex number or is a complex number with a non-rational real or imaginary part. Rationale: If z is an inexact number represented using flonums, and the radix is 10, then the above expression is normally satisfied by a result containing a decimal point. The unspecified case allows for infinities, NaNs, and non-flonum representations.	{"url":"http://www.delorie.com/gnu/docs/guile/r5rs_56.html","timestamp":"2014-04-16T07:14:11Z","content_type":null,"content_length":"8969","record_id":"<urn:uuid:c5e87a66-557e-455a-974c-16916bcd2da0>","cc-path":"CC-MAIN-2014-15/segments/1397609521558.37/warc/CC-MAIN-20140416005201-00057-ip-10-147-4-33.ec2.internal.warc.gz"}
A Railroad Car With A Mass Of 5.0x105 Kg Collides ... \| Chegg.com A railroad car with a mass of 5.0x10^5 kg collides with astationary railroad car of equal mass. After the collision,the two cars together move off at 4.0m/s. a. Before the collision, the first railroad car was moving at8.0m/s. What was its momentum. (I got 4,000,000kgm/s) b.What is the total momentum of the two cars before and after thecollision? (Before and after 4,000,000kgm/s) c. Find the kinetic energies of the two cars before and after thecollision. (Before and after 4 Joules) d. Account for the loss of kinetic energy. (I said therewasn't a loss but I dont think I'm right.)	{"url":"http://www.chegg.com/homework-help/questions-and-answers/railroad-car-mass-50x105-kg-collides-astationary-railroad-car-equal-mass-collision-two-car-q144668","timestamp":"2014-04-18T04:32:43Z","content_type":null,"content_length":"20522","record_id":"<urn:uuid:54852731-b5a4-4234-912a-c99174fddde4>","cc-path":"CC-MAIN-2014-15/segments/1397609532480.36/warc/CC-MAIN-20140416005212-00534-ip-10-147-4-33.ec2.internal.warc.gz"}
Post a reply I answered this question and I choose (B) and it was correct But I am stuck on this question bellow(#14) well first I answered B and it was incorrect then I said: My new answer would be (F) a triangle with an angle of 90o, then a side of SQRT(2), then an angle of 45o. I have two corresponding angles that are congruent which are angles (45°,45°) and (90°,90°) and the corresponding sides (SQRT(2)),(SQRT(2)) between the angles are congruent. So,according to the angle-side-angle theorem (ASA)the triangles are congruent. And that was incorrect my teacher said #14 is incorrect. The right angle would not be adjacent to the hypotenuse of the triangle. I am really confused help plzzzz 14. I have a triangle with sides of 1 and a side of SQRT(2), with an angle of 45o and an angle of 90o. Which of the following would be congruent to it? (You will need to use what you've learned about triangles and angle / side relations, as well as your knowledge of the rules of congruence to fill in the gaps and answer the question. Sketches may be helpful.) A a triangle with a side of 1, then an angle of 90o, and a side of 1 B a triangle with a side of 1, then an angle of 90o, then a side of SQRT(2) C a triangle with the angles 45o, 45o, 90o D a triangle with sides of 1 and 1 E a triangle with a side of 1, then an angle of 45o, then a side of 1 F a triangle with an angle of 90o, then a side of SQRT(2), then an angle of 45o	{"url":"http://www.mathisfunforum.com/post.php?tid=18208&qid=234603","timestamp":"2014-04-21T09:59:02Z","content_type":null,"content_length":"24681","record_id":"<urn:uuid:ca6d75b3-aa14-4557-98ed-dde538b8bce9>","cc-path":"CC-MAIN-2014-15/segments/1397609539705.42/warc/CC-MAIN-20140416005219-00157-ip-10-147-4-33.ec2.internal.warc.gz"}
Approximating Formulas for the USCF Rating System Next: About this document ... Approximating Formulas for the USCF Rating System This document provides approximation formulas for players to compute and update their USCF ratings. The actual rating system is quite complex, and performing the computations by hand is virtually impossible. It should be noted that, on occasion, the formulas presented below produce ratings considerably different from ratings calculated under the actual algorithm, so that the formulas below should serve only as a rough guide. A detailed description of the new system's formulas is posted at the USCF web site (www.uschess.org), and is available on request from the USCF. Provisional and established ratings: Players' ratings are considered provisional if they have played 25 or fewer games (rather than 20 under the old system), and established if having played more than 25. There are two different formulas to compute ratings. The criterion for using the different formulas depends on whether the player has completed 8 tournament games. The formula for ratings based on 8 or fewer games is called the ``special'' rating formula, and the other is called the ``standard'' formula. A provisional rating is updated using the special formula if the number of completed games is 8 or fewer, and the standard formula if the number is greater than 8. Established ratings are based on the standard formula. Special rating formula: If a player has a rating based on 8 or fewer games, or is unrated, then the new rating can be approximated by the old provisional rating formula, that is Example: Suppose a player rated 1500 based on 6 games competes against players rated 1400, 1550 and 1650, winning the first, losing the second and drawing the third. In this case, The final result has been rounded from 1511.111. It should be noted that, from the approximating formula, a player could gain rating points by losing to a high rated player, or lose rating points with a win over a low rated player. The actual rating procedure corrects for these possibilities. Furthermore, the actual formulas first calculate ratings for unrated opponents, thereby making use of all game outcomes. Standard rating formula: To approximate one's rating using the standard formulas, a player needs to know (or approximate) the number of games played in tournaments, only if less than 50. Let If the player's rating is 2200 or greater, then set Example: Suppose a player's pre-tournament rating is Because 26.7 is smaller than 30, The next step in the calculation is to determine the value of and for half- Finally, once where away from the pre-event rating. To calculate This is computed for each opponent, and the results are totaled to produce a value of The bonus, This is the extra amount added to one's rating for having an unusually strong result. Please note that the value ``10'' in the formula will revert to ``16'' in January 2003, resulting in greater difficulty to obtain bonus amounts. Example: Suppose a player is rated 1300 based on 45 games, and competes in a full- First, we compute the value of so that the lower of 16.57 and 45 is The value of The winning expectancy against the opponent rated 1250 is Similarly, the winning expectancies against the other three opponents are computed as 0.360, 0.240 and 0.192. Adding these four values results in is larger than the bonus is which is then rounded up to 1447. Rating floors: Rating floors exist at 100, 1400, 1500, 1600, Next: About this document ... Mark Glickman	{"url":"http://math.bu.edu/people/mg/ratings/approx/approx.html","timestamp":"2014-04-20T13:19:12Z","content_type":null,"content_length":"18633","record_id":"<urn:uuid:351e2305-a0a9-4ddf-8199-fdce9ae9ed6b>","cc-path":"CC-MAIN-2014-15/segments/1398223205375.6/warc/CC-MAIN-20140423032005-00087-ip-10-147-4-33.ec2.internal.warc.gz"}
-Bell Numbers with Real Arguments ISRN Discrete Mathematics Volume 2013 (2013), Article ID 274697, 7 pages Research Article An Asymptotic Formula for -Bell Numbers with Real Arguments ^1Institute of Mathematics, University of the Philippines, Diliman, Quezon City 1004, Philippines ^2Department of Mathematics, Mindanao State University, Marawi City 9700, Philippines Received 24 December 2012; Accepted 15 January 2013 Academic Editors: A. Ashrafi and H. Deng Copyright © 2013 Cristina B. Corcino and Roberto B. Corcino. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. The -Bell numbers are generalized using the concept of the Hankel contour. Some properties parallel to those of the ordinary Bell numbers are established. Moreover, an asymptotic approximation for -Bell numbers with real arguments is obtained. 1. Introduction The -Stirling numbers of the second kind, denoted by , are defined by Broder in [1], combinatorially, to be the number of partitions of the set into nonempty subsets, such that the numbers are in distinct subsets. Several properties of these numbers are established in [1–3]. Further generalization was established in [4] which is called -Stirling numbers. These numbers are equivalent to the -Whitney numbers of the second kind [5] and the Rucinski-Voigt numbers [6]. The sum of -Stirling numbers of the second kind for integral arguments was first considered by Corcino in [7] and was called the -Bell numbers. Corcino obtained an asymptotic approximation of -Bell numbers using the method of Moser and Wyman. Here, we use to denote the -Bell numbers; that is, In a followup study of Mező [8], the -Bell numbers were given more properties. One of these is the following exponential generating function: A more general form of Bell numbers, denoted by , was defined in [9] as where the parameters , , and are complex numbers with , , and . In this paper, we define the -Bell numbers with complex argument using the concept of Hankel contour and establish some properties parallel to those obtained by Mező in [8]. Moreover, an asymptotic formula of these numbers for real arguments will be derived using the method of Moser and Wyman [10]. 2. -Stirling Numbers of the Second Kind Graham et al. [11] proposed another way of generalizing the Stirling numbers by extending the range of values of the parameters and to complex numbers. This problem was first considered by Flajolet and Prodinger [12] by defining the classical Stirling numbers with complex arguments using the concept of Hankel contour. Recently, the -Stirling numbers with complex arguments, denoted by , were defined in [9] by means of the following integral representation over a Hankel contour : where and are complex numbers with , , and . We know that, for integral case, the -Stirling numbers of the second kind may be obtained by taking . Hence, using (4), we can define the second-kind -Stirling numbers with complex arguments as follows. Definition 1. The -Stirling numbers of the second kind of complex arguments and are defined by where is complex number with and , and the logarithm involved in the functions and is taken to be the principal branch. The Hankel contour starts from below the negative axis, surrounds the origin counterclockwise, and returns to in the half plane , such that it has a distance from the nonpositive real axis. Remark 2. Since and , the integral in (5) converges for all values of and . Also, is a meromorphic function of (for any fixed ) with poles at the nonpositive integers, and it is entire as a function of (for any fixed not a negative integer). Remark 3. By the change of variable on the integral in (4), say , we can express in terms of as follows: Because of relation (6), every property of -Stirling numbers with complex arguments will have a corresponding property for -Stirling numbers with complex arguments and vice versa. For instance, the -Stirling numbers in [9] satisfy the following relation: Replacing with , we get Using (6), we obtain Thus, we have On the other hand, the -Stirling numbers in [9] satisfy the relation Again, replacing with , we obtain By (6), we get Thus, we have Let’s state these relations formally in the following theorem. Theorem 4. The -Stirling numbers of the second kind with complex arguments satisfy the following relations: Remark 5. We can give an alternative proof of this theorem. That is, by applying integration by parts on (5) and using the fact that , we obtain This implies (15) immediately. On the other hand, using Newton’s Binomial Theorem, (5) can be expressed as We know that Hankel’s contour integral is a unit for gamma function over the set of complex numbers; that is, This implies that This completes the proof of (16). The next theorem contains a property for which is analogous to the identity that usually defines Stirling-type numbers. Theorem 6. The -Stirling numbers of the second kind with complex arguments satisfy the following relation: where . Proof. Using (5) with , a nonnegative integer, we obtain Thus, by (20), we prove the theorem. Remark 7. It is worth mentioning that this type of property was not established for -Stirling numbers with complex arguments. However, replacing with and with in (21), we obtain Using relation (6), we get This is the corresponding property for -Stirling numbers with complex arguments. Remark 8. In a separate paper of the present authors, an asymptotic formula for -Stirling numbers of the second kind with real arguments was established using the method of Chelluri et al. [13]. 3. -Bell Numbers Using Cauchy’s integral formula, (2) can be transformed into the following integral representation of : where the integral contour is a small contour encircling the origin. Since is nonnegative in ( 25), the contour can be deformed into a Hankel contour that starts from below the negative axis, surrounds the origin counterclockwise, and returns to in the half plane . We assume that it is at distance ≤1 from the real axis. Now, let us consider the following definition for the generalization of -Bell numbers where is a complex number. Definition 9. The -Bell numbers of complex argument are defined by where is complex numbers with and . Since and , clearly, the integral in (26) converges for all values of . Moreover, is a meromorphic function of with poles at the nonpositive integers. It can easily be shown that By (16) and (20), we obtain Hence, we have the following theorem. Theorem 10. The -Bell numbers are equal to where and are complex numbers. By Theorem 10, we have verified that identity in (1) also holds for with complex argument . This means that the numbers in Definition 9 belong to the family of Bell numbers. The next theorem asserts that also possess a kind of Dobiński’s formula which can easily be shown using Definiton 9 and the expansion of . Theorem 11. The -Bell numbers are equal to where and are complex numbers. Using (26) and (30), we obtain the following corollary which is a kind of extension of the integral formula obtained by Mező in [8]. Corollary 12. The following integral identity holds: The -Bell polynomials of Mező [8] satisfy the recurrence relation where and are nonnegative integers. This will reduce to when . Analogous to this relation, we have the following relation which can easily be shown using (28), (15), and (16). Theorem 13. The -Bell numbers satisfy the following relation: where and are complex numbers. Proof. Summing up both sides of (15) gives By applying (16), we get Hence, we have Substituting this to (35) completes the proof of the theorem. Note that, when the parameters , and are nonnegative integers, Definition 1 is just equivalent to the integral representation of the -Stirling numbers of the second kind in [1]. Hence, the value of is equal to 0. 4. Asymptotic Formula An asymptotic formula for -Bell numbers was first established by Corcino in [7]. But the formula holds only when is a nonnegative integer. Here, we aim to obtain an asymptotic formula for when is a real number. Using Definition 9, To obtain an asymptotic formula, we deform the path into the following contour: , where (i) is the line , and , is a small positive number; (ii) is the line segment , going from to the circle ; (iii) and are the reflections in the real axis of and , respectively;(iv) is the portion of the circle , meeting and . The new contour is in the counterclockwise sense. This idea of deforming the contour is also done in [13]. The integrals along , , , and are seen to be It will also be shown that these integrals go to 0 as provided that . To see this, we consider . For the other contours, the estimate can be seen similarly. We look at Note that Turning to , Thus, Consider Choose , so that . Then This implies that Consequently, we obtain where Since as , we have the integral along goes to 0 as . So what remains is the integral along . That is, where is a semicircle , . Hence, by Laplace method or following the analysis in [7], In [7], the integration is along a circle about zero with radius . This number is shown to be the unique solution to as a function of (see Lemma 3 [7]). We see that the asymptotic formula for the -Bell numbers obtained in [7] holds for real argument . Thus, we have the following asymptotic formula. Theorem 14. The -Bell numbers with real arguments and have the following asymptotic formula: where and is the unique positive solution to as a function of . An asymptotic formula for -Bell numbers has already been established in [14]. However, the formula holds only when is a nonnegative integer. Here, using the same method as employed above, we can show that this asymptotic formula will also work for the case in which the parameters , , and are real numbers. Now, for real parameters , , and , we have where the path can also be deformed into the following contour: , such that (i) is the line , , and , is a small positive number; (ii) is the line segment , going from to the circle ; (iii) and are the reflections in the real axis of and , respectively; (iv) is the portion of the circle , meeting and . Also, the new contour is in the counterclockwise sense. It can easily be shown that, along the path , Hence, as goes to , This can be done similarly along , and . Thus, we have where is a semicircle , . Then This implies that the asymptotic formula for the -Bell numbers obtained in [14] holds for real argument. Thus, from [14], we have the following asymptotic formula for -Bell numbers with real arguments , , and : where and is the unique positive solution to as a function of . 5. Summary and Recommendation In this paper, we have defined -Stirling numbers of the second kind and -Bell numbers with complex arguments using the concept of Hankel contour and established some properties parallel to those of the classical Stirling and Bell numbers. Moreover, we have derived an asymptotic formula for -Bell numbers as well as for -Bell numbers for real arguments using the method of Chelluri and that of Moser and Wyman. We observe that, by employing those methods, one can possibly establish an asymptotic formula for -Stirling numbers of the second kind with real arguments and, consequently, using relation (6), an asymptotic formula for -Stirling numbers with real arguments. The authors would like to acknowledge the support from the Office of the Vice Chancellor for Research andDevelopment of the University of the Philippines Diliman for this research project. The authors also wish tothank the referees for reading and evaluating the paper thoroughly.	{"url":"http://www.hindawi.com/journals/isrn.discrete.mathematics/2013/274697/","timestamp":"2014-04-20T11:39:30Z","content_type":null,"content_length":"561196","record_id":"<urn:uuid:9a93bd76-979a-4e0c-b35d-3d6d09d9528d>","cc-path":"CC-MAIN-2014-15/segments/1398223211700.16/warc/CC-MAIN-20140423032011-00468-ip-10-147-4-33.ec2.internal.warc.gz"}
Wolfram Demonstrations Project Simple Unconstrained Optimization Method This Demonstration shows the simple one-dimensional unconstrained maximization algorithm for finding the (local) maximum of the function near the starting value . It is a nongradient method and it requires only the starting value and the initial step value . Assume that the function has a single local maximum on the interval . For the given real numbers and , construct the sequences and in the following way: It can be proved that the sequence converges to . The method is simple and easy to implement. It does not require the differentiability of the function nor any additional condition on and . This method is also known as simplex method I and has a linear convergence.	{"url":"http://demonstrations.wolfram.com/SimpleUnconstrainedOptimizationMethod/","timestamp":"2014-04-20T15:52:16Z","content_type":null,"content_length":"43669","record_id":"<urn:uuid:8de0d9f4-b91d-4bee-ba37-785e13b8edd3>","cc-path":"CC-MAIN-2014-15/segments/1398223202548.14/warc/CC-MAIN-20140423032002-00047-ip-10-147-4-33.ec2.internal.warc.gz"}
Minnesota M1PR Reject Codes LEGACY Category: Minnesota Minnesota M1PR Reject Codes LEGACY 0001 Processing site is not “S” The processing site in the TRANA record must be “S”. 0002 Invalid format - checkbox A checkbox field must be the single character “X”. 0003 ETIN has been suspended The ETIN in the TRANA record must not be suspended. 0004 Transmitter Production/Test Code is not correct. The TranA Transmission production/test code field must contain a literal value of “P” for production region or “T” for test region. 0005 Unexpected end of file. 0006 Transmitter is not authorized to send this type of return/transmission. 0007 Invalid format – field too long. The field exceeds the maximum length. 0008 Total return count in RECAP record not equal to number of returns The total return count in the RECAP record must equal the number of returns in the transmission. 0009 EIN does not match EIN in our database The EIN in the TRANA record must match the EIN for the ETIN on our database. 0011 Invalid record format. Record does not end with “#”. 0012 Invalid ETIN. The ETIN in the RECAP record must match the ETIN in the TRANA record. 0014 TRANA date out of range. The date in the TRANA record must be in the range of tomorrow and three days ago. That is, we will accept a transmission dated one day in the future [i.e., tomorrow], but not two days in the future. We will also accept a transmission that is dated three days in the past. 0016 Statement not valid for this field. This field cannot contain a statement reference. 0024 Unexpected form in M1PR return. 0025 Invalid format – alpha. An alpha field may contain only upper case letters and spaces. 0026 Invalid format – alphanumeric. An alphanumeric field may contain only case letters [A-Z or a-z], numbers [0-9], and spaces. 0027 Record length incorrect or missing record terminating character “#”. All records must be the correct length [as specified in bytes 1-4 of the record]. The last character in the record must be “# 0028 Undefined ETIN. The ETIN in the TRANA record must be defined in our database. 0029 Field is not significant. A field was encountered that is not significant. Either a numeric field is zero and a field is empty [or contains only spaces]. 0030 Invalid format – maximum length exceeded. The data must not exceed the maximum length defined for this field. 0032 Mismatched Julian date and sequence in TRANA and RECAP records. The Julian date and sequence in the RECAP record must match the Julian date and sequence in the TRANA record. 0033 form is not valid for this return type. A form was encountered that is not valid for the return type. 0034 Unknown return type in transmission. 0036 Missing TRANA record. The first 120 bytes must be the TRANA record. 0039 Page 2 of a form is not preceded by page 1 of a form. 0040 Record length format error. 0043 Unspecified parsing error within return. 0044 Missing TRANB record. The second 120 bytes must be the TRANB record. 0045 The fixed portion of a record cannot be processed. All or part of the fixed data is missing in the record header. 0046 Unknown form type in transmission. 0047 Julian date does not match the regular date in TRANA record. The Julian date in the TRANA record must match the regular date in the TRANA record. 0050 Transmission must not contain unprintable (high ASCII) characters. 0054 Invalid format - numeric. A numeric field may contain only the digits 0 through 9. It may not contain spaces or a decimal point. 0055 ETIN EFIN mismatch. The EFIN in the TRANA record must match the EFIN for the ETIN in our database. 0059 Multiple TRANA, TRANB, or RECAP record. There must be only one TRANA, one TRANB, and one RECAP record in the file. 0060 The taxpayer must be a registered profile in the department system to file withholding tax returns. 0060 The taxpayer must be a registered profile in the department system to file sales tax returns. 0061 Missing RECAP record. The last 120 bytes must be the RECAP record. Ignoring, or course, any extraneous characters at the end of the transmission. 0063 Production/test code mismatch. The production/test code in the TRANA record must match that in the transmission database. 0064 Syntax error in variable length fields. 0065 Field sequence number not defined for this form. A field sequence number was encountered that is not defined for this form in Minnesota's system. If field sequence is correct, contact Minnesota for assistance. 0066 Number of occurrences of a specific form exceeds maximum allowable. The number of occurrences of a specific form exceeds maximum allowable. 0067 Parsing error – for future use. 0071 Invalid format – signed numeric. A signed numeric field may contain only digits, except that the right most character may be either plus ["+"] or minus ["-"]. Spaces will not be allowed, and unsigned numeric is always positive.] 0072 Invalid start of record sentinel. 0073 The use code in the RECAP record does not match the use code in the TRANA record. The use code in the RECAP record must match the use code in the TRANA record. 0076 Invalid format – date. A date field must be digits formatted as CCYYMMDD and must be a valid date between 1850 and 2050. 0077 Parsing error – for future use. 0080 Duplicate transmission. The Julian date and sequence in the TRANA record must not have been previously transmitted during the current year. For production mode only. 0081 Transmission format for return does not match specified tax period. 0083 TRANA record type is not “V”. The record type in the TRANA record must be “V”. We will not accept fixed format transmissions. 0086 Field sequence number repeated in a form. A field sequence number occurs more than once in the same form. 0087 Non-numeric Julian date or sequence in TRANA record. The Julian date and sequence in the TRANA record must be numeric. 0088 The system was unable to successfully complete the return processing due to an environmental issue. The general response by preparers to this error should to resubmit the return for processing. However, if a problem is repeatedly encountered on the same return, contact Minnesota for assistance. 0089 Invalid format – percentage. A percentage fields must be 6 digits. The decimal point is assumed to be between the first and second digits. 0091 Page 2 of a form is preceded by page 1 of a different form. 0092 TRANA transmission format is not “A”. The transmission format in the TRANA record must be “A”. 0093 EIN mismatch in TRANA and TRANB records. The EIN in the TRANA record must match the EIN in the TRANB record. 0099 The period end date cannot be determined for this return. The return cannot be processed with an invalid period end date. 0100 One or more sales tax returns are duplicated within the same transmission. Duplicate returns are not permitted. 0100 One or more withholding tax returns are duplicated within the same transmission. Duplicate returns are not permitted. 0116 SUM 0260 The electronic postmark date [SUM.0260] is not valid for this return. The return must be filed within one year of the due date. 0135 M1PR 0870 On form M1PR, Line 27 [M1PR.0870] must equal the greater of Line 26 [M1PR.0860] or $100. 0137 CRP 0250 On form CRP, the sum of Line 1 [CRP.0250] for all CRPs not exceed 99,999. 0150 M1PR 0690 On form M1PR, Line 11 [M1PR.0690] requires form PROPST. If filing as mobile home owner, requires either PROPST or CRP (or both). 0152 M1PR 0420 On form M1PR, if renter checkbox [M1PR.0420] is significant, Line 9 [M1PR.0670] must be greater than zero. 0153 M1PR 1090 DELETE RULE 0163 The percentage received is not a valid format. Valid format is six digits with no decimals or space, and the decimal is assumed between the first and second digits. 0164 M1PR 0060 On form M1PR, primary taxpayer address type [M1PR.0060] is invalid. 0185 PROPST 0180 On form PROPST, taxpayer with delinquent tax checkbox [PROPST.0180] is not eligible for property tax refund. 0188 M1PR 0050 On form M1PR, duplicate filings are not allowed. Primary taxpayer [M1PR.0050] previously filed either as primary taxpayer or spouse [M1PR.0250]. 0194 Contact the Minnesota Department of Revenue for assistance with processing this return. The department will manually correct this error on a case-by-case basis. The form occurrence numbers for each form and schedule must be sequential beginning with 0000001. Gaps are not permitted in form occurrence numbers. 0206 M1PR 0840 On form M1PR, taxpayer does not qualify for special refund if Line 18 [M1PR.0800] is less than Line 24 [M1PR.0840]. Lines 25 through 30 [M1PR.0850, M1PR.0860, M1PR.0870, M1PR.0880, M1PR.0890 and M1PR.0900] must not be significant. 0226 M1PR 0900 On form M1PR, Line 30 [M1PR.0900] requires estimated market value [PROPST.0160], taxable market value [PROPST.0170], and Line 6 property tax[PROPST.0200] for previous year on form 0257 M1PR 0860 On form M1PR, Line 26 [M1PR.0860] must equal Line 24 [M1PR.0840] multiplied by 12%. 0261 CRP 0210 On form CRP, rental period [CRP.0210, CRP.0220] must not exceed one year. 0262 M1PR 0815 On form M1PR, Line 20 [M1PR.0815] must equal Line 18 [M1PR.0800] multiplied by Line 19 [M1PR.0810]. 0270 M1PR 0660 On form M1PR, Line 8 [M1PR.0660] must equal Line 6 [M1PR.0540] minus Line 7 [M1PR.0650], and Line 8 must not be negative. 0285 M1PR 1210 On form M1PR, [Worksheet 1 Mobile Home Owners] Step 2 [M1PR.1210] must not exceed the sum of Line 1 [PROPST.0260] for all PROPSTs. 0290 CRP 0010 On form CRP, the information is incomplete. The following are required: -renter's name [CRP.0010] -rental unit address [CRP.0050, CRP.0060, CRP.0070, CRP.0080] -owner or agent name, address and phone [CRP.0120, CRP.0130, CRP.0140, CRP.0150, CRP.0160, CRP.0170] -property ID [CRP.0180] -county [CRP.0190] -number of units [CRP.0200] -rental period [CRP.0210, CRP.0220] -number of adults in unit [CRP.0230] -Lines 1 and 3 [CRP.0250, CRP.0270] 0323 M1PR 0650 On form M1PR, Line 7 [M1PR.0650] must equal the amount from Table A based on number of dependents [M1PR.0560]. If 65 or older checkbox [M1PR.0570] or disabled checkbox [M1PR.0580] is selected, Line 7 must equal the amount from Table B based on number. 0324 PROPST 0210 On form PROPST, current year property class [PROPST.0210] is invalid. (Valid values: 11=Residential; 12=Condominium; 13=Double Bungalow; 14=Agricultural; 15=Fractional; 16= Residential Resort; 17=Farm; 18=Green Acres; 19=Agricultural Preservation; 20=Apartment; 21=Disabled; 22=Townhouse; 23=Triplex; 24=Timber; 25=Residential/Agricultural Homestead; 26=Agricultural 0334 M1PR 0817 On form M1PR, Line 21 [M1PR.0817] must equal Line 18 [M1PR.0800] minus Line 20 [M1PR.0815]. 0347 M1PR 0810 On form M1PR, Line 20 [M1PR.0810] must equal Step 3 [M1PR.1320] [Improvements for Homeowners Worksheet 3]. 0351 M1PR 0680 On form M1PR, Line 10 [M1PR.0680] must equal the amount from Renter's Table. If Line 38 [M1PR.1010] is significant then Line 10 [M1PR.0680] must equal Line 38 [M1PR.1010] and CRP must be significant. 0352 M1PR 0693 On form M1PR, Line 11 [M1PR.0693] must equal county [PROPST.0090] on form PROPST. 0358 M1PR 0420 On form M1PR, filing status is incomplete. One or more of the following checkboxes must be significant: renter [M1PR.0420], homeowner [M1PR.0430], nursing home resident [M1PR.0440], or mobile home owner [M1PR.0450]. 0364 M1PR 0540 On form M1PR, Line 6 [M1PR.0540] must equal the sum of Line 1 through Line 5 [M1PR.0460, M1PR.0490, M1PR.0500, M1PR.0510, M1PR.0520]. Line 6 must not be negative. 0374 M1PR 0450 On form M1PR, if mobile home owner [M1PR.0450] is significant Line 11 [M1PR.0690], [Worksheet 1 Moble Home Owner] Step 1 [M1PR.1200], Step 2 [M1PR.1210] and Step 3 [M1PR.1220] must all be significant. 0379 M1PR 0960 On form M1PR, Line 33 [M1PR.0960] must equal Line 31 [M1PR.0940] minus Line 32 [M1PR.0950]. 0399 SUM 0260 The electronic postmark date [SUM.0260] is not valid. Property tax refund returns containing form PROPST must be filed on or after March 15. For Hennepin County only, PROPST may be filed beginning on March 1. 0401 CRP 0170 On form CRP, owner's or agent's business phone # [CRP.0170] is invalid. Phone number must be exactly ten digits (no non-numeric characters). First and fourth digits cannot be 0 or 1. 0420 M1PR 0260 On form M1PR, spouse [filing jointly] address type [M1PR.0260] is invalid. 0421 CRP 0210 On form CRP, rental period [CRP.0210, CRP.0220] must fall within tax year. 0423 M1PR 0670 On form M1PR, Line 9 [M1PR.0670] requires form CRP. 0436 M1PR 0430 On form M1PR, if homeowner checkbox [M1PR.0420] is significant, Line 11 [M1PR.0690] must be greater than zero. If claiming the special property tax refund only, Line 12 [M1PR.0700] must be greater than zero. 0447 M1PR 0380 On form M1PR, spouse [filing jointly] day phone type [M1PR.0380] is invalid. 0452 M1PR 0760 On form M1PR, the direct deposit banking information is incomplete. The following are required: checking or savings account indicator [M1PR.0760, M1PR.0765], routing number [M1PR.0770], and account number [M1PR.0780]. 0463 CRP 0300 On Worksheet 2, Step 1 [CRP.0300] must equal line 3 [CRP.0270] form CRP. 0474 M1PR 0040 Name suffix [M1PR.0040] must be a valid value. Valid values are "II", "III", "IV", "V", "VI", "VII", "JR", and "SR". 0475 M1PR 0440 On form M1PR, if nursing home checkbox [M1PR.0440] is significant, Line 31 [M1PR.0940], Line 33 [M1PR.0960], Line 35 [M1PR.0980], Line 36 [M1PR.0990] must all be significant. 0477 M1PR 0190 On form M1PR, primary taxpayer's phone # [M1PR.0190] is invalid. Phone number must be exactly ten digits (no non-numeric characters). First and fourth digits cannot be 0 or 1. 0481 M1PR 0180 On form M1PR, primary taxpayer day phone type [M1PR.0180] is invalid. 0483 CRP 0320 On Worksheet 2, Step 3 [CRP.0320] must equal Step 1 [CRP.0300] multiplied by Step 2 [CRP.0310] 0485 PROPST 0300 On Worksheet 2, Step 1 [PROPST.0300] must equal line 1 [PROPST.0260] form PROPST. 0491 M1PR 0830 On form M1PR, Line 23 [M1PR.0830] must not exceed $1,000. 0494 M1PR 0240 Name suffix [M1PR.0240] must be a valid value. Valid values are "II", "III", "IV", "V", "VI", "VII", "JR", and "SR". 0500 M1PR 0980 On form M1PR, Line 35 [M1PR.0980] must equal Line 31 [M1PR.0940] plus Line 34 [M1PR.0970]. 0511 M1PR 0550 On form M1PR, Line 6 [M1PR.0540] requires an explanation [M1PR.0550] or statement reference if Line 6 is less than rent paid [CRP.0250]. 0513 M1PR 0710 On form M1PR, Line 13 [M1PR.0710] must equal Line 11 [M1PR.0690] minus Line 12 [M1PR.0700]. 0536 M1PR Transmitter [ETIN] is not authorized to transmit return type M1PR. 0537 PROPST 0230 On form PROPST, current year new improvement [PROPST.0230] requires new improvement worksheet Step 1 through Step 3 [PROPST.1300, PROPST.1310, PROPST.1320]. 0539 M1PR 1140 DELETE RULE 9/22/2006 0558 M1PR 1110 DELETE RULE 9/22/2006 0560 M1PR 0690 On form M1PR, Line 11 [M1PR.0690] must equal the sum of Line 1 [PROPST.0260] for all property tax statements. If part of the home is rented or used for business, Line 11 [M1PR.0690] must equal Step 3 [PROPST.0320] of the Worksheet 2. Mobile home owners [M1PR.0450] must include amount from [M1PR.1220] of the Worksheet 1. 0568 M1PR 0800 On form M1PR, Line 18 [M1PR.0800] must equal Line 1 [PROPST.0260] on form PROPST. If business use exists, Line 18 must equal Step 3 [PROPST.0320] of Worksheet 2. 0587 M1PR 0900 On form M1PR, Line 30 [M1PR.0900] must equal the lesser of Line 29 [M1PR.0890] or $1,000. 0589 M1PR 0160 On form M1PR, primary taxpayer death date [M1PR.0160] must be a valid date in the past. 0593 PROPST 0130 On form PROPST, prior year property class [PROPST.0130] is invalid. (Valid values: 11=Residential; 12=Condominium; 13=Double Bungalow; 14=Agricultural; 15=Fractional; 16=Residential Resort; 17=Farm; 18=Green Acres; 19=Agricultural Preservation; 20=Apartment; 21=Disabled; 22=Townhouse; 23=Triplex; 24=Timber; 25=Residential/Agricultural Homestead; 26=Agricultural Homestead/ 0606 M1PR 0780 On form M1PR, Line 39 bank account number [M1PR.0780] is invalid. [Account number must be letters, numbers, or hyphens only.] 0617 M1PR 1100 DELETE RULE 9/22/2006 0624 CRP 0270 On form CRP, Line 3 [CRP.0270] must equal Line 1 [CRP.0250] multiplied by 19%. 0626 M1PR 0350 On form M1PR, spouse [filing jointly] birth date [M1PR.0350] must be a valid date in the past. 0630 PROPST 0010 On form PROPST, property tax statement information is incomplete. The following are required: taxpayer name [PROPST.0010], property address [PROPST.0050, PROPST.0060, PROPST.0070, PROPST.0080], county [PROPST.0090], current taxes payable year [PROPST.0100], owner [PROPST.0110], property ID, [PROPST.0120], and current year tax information [PROPST.0210, PROPST.0240, PROPST.0250, PROPST.0260, PROPST.0270]. 0639 M1PR 0450 On form M1PR, if mobile home owner checkbox [M1PR.0450] is significant, form CRP or form PROPST must be significant. 0642 M1PR 0150 On form M1PR, primary taxpayer birth date [M1PR.0150] must be a valid date in the past. 0648 SUM 0020 The electronic filer identification number (EFIN) is not registered with Minnesota. Otherwise, EFIN is missing from the summary record. To register, electronic return originator must fax a copy of current IRS Letter of Acceptance. Visit our web site at http://www.taxes.state.mn.us for more information. 0649 M1PR 0700 On form M1PR, Line 12 [M1PR.0700] must equal Line 31 [M1PR.0900]. 0652 M1PR 0750 On form M1PR, Line 17 [M1PR.0750] must equal Line 15 [M1PR.0730] minus Line 16 [M1PR.0740]. 0657 M1PR 1310 On form M1PR, Worksheet 3, Step 2 [M1PR.1310] must equal the sum taxable market values [PROPST.0250] for all property tax statements. 0660 M1PR 0390 On form M1PR, spouse's phone # [M1PR.0390] is invalid. Phone number must be exactly ten digits (no non-numeric characters). First and fourth digits cannot be 0 or 1. 0678 M1PR 0220 On form M1PR, spouse (filing jointly) information is incomplete. The followng are required: spouse name [M1PR.0220, M1PR.0230], social security number [M1PR.0250], and birth date [M1PR.0350]. Otherwise, all spouse (filing jointly) information must be blank [including M1PR.0240, M1PR.0260, M1PR.0270, M1PR.0280, M1PR.0290, M1PR.0300, M1PR.0310, M1PR.0320, M1PR.0330, M1PR.0340, M1PR.0350, M1PR.0360, M1PR.0370, M1PR.0380, M1PR.0390, M1PR.0400, M1PR.0410]. 0685 PROPST 0320 On Worksheet 2, Step 3 [PROPST.0300] must equal Step 1 [PROPST.0300] multiplied by Step 2 [PROPST.0310] 0690 M1PR 1070 DELETE RULE 9/22/2006 0697 M1PR 1030 On form M1PR, paid preparer's phone # [M1PR.1030] is invalid. Phone number must be exactly ten digits (no non-numeric characters). First and fourth digits cannot be 0 or 1. 0698 M1PR 0250 On form M1PR, duplicate filings are not allowed. Spouse [M1PR.0250] previously filed either as primary taxpayer [M1PR.0050] or spouse. 0704 M1PR 0470 On form M1PR, income other than taxpayer amount [M1PR.0480] requires an explanation [M1PR.0470] or statement reference. 0710 PROPST 0100 On form PROPST, current taxes payable year [PROPST.0100] must equal current tax year. 0713 M1PR 0950 On form M1PR, Line 32 [M1PR.0950] must not be less than the sum of Line B [CRP.0245] for all CRPs. 0717 M1PR 0850 On form M1PR, taxpayer does not qualify for special refund if Line 25 [M1PR.0850] is less than $100. 0719 M1PR 0720 On form M1PR, Line 14 [M1PR.0720] must equal the amount from Homeowner's Table based on Line 8 [M1PR.0660] and Line 13 [M1PR.0710]. 0726 M1PR 1020 On form M1PR, paid preparer identification number [M1PR.1020] must be numeric, or it must be a valid PTIN (first character is "P" or "S" followed by numerals). 0730 M1PR 1020 On form M1PR, self prepared [M1PR.1060 = "S"] returns must not include paid preparer information [M1PR.1020, M1PR.1030, M1PR.1040] . 0734 M1PR 1050 On form M1PR, paid preparer ID # [M1PR.1020] and indicator [M1PR.1060 = "P"] must accompany power of attorney indicator [M1PR.1050]. 0748 M1PR 1060 On form M1PR, electronic return type indicator [M1PR.1060] is invalid. 0758 M1PR 0050 On form M1PR, taxpayer social security numbers [M1PR.0050, M1PR.0250] must not be test. Test social security numbers start with '40000', and they are not valid for live processing. 0770 M1PR 1320 On Worksheet 3, Step 3 [M1PR.1320] must equal Step 1 [M1PR.1300] divided by Step 2 [M1PR.1310]. (The result must be a whole percentage.) 0776 M1PR 0697 On form M1PR, Line 11 [M1PR.0697] must equal property ID number [PROPST.0120] on form PROPST. NOTE: If multiple PROPST …….. 0783 M1PR 0840 On form M1PR, Line 24 [M1PR.0840] must equal Line 22 [M1PR.0820] minus Line 23 [M1PR.0830]. 0793 M1PR 1010 On form M1PR, Line 38 [M1PR.1010] must equal Line 36 [M1PR.0990] multiplied by Line 37 [M1PR.1000] when nursing home resident indicator [M1PR.0440] is checked. 0794 PROPST 0200 On form PROPST, Line 6 [PROPST.0200] must not exceed the taxable market value [PROPST.0170] multiplied by 2.5% for the previous year. 0795 M1PR 0880 On form M1PR, Line 28 [M1PR.0880] must equal Line 25 [M1PR.0850] minus Line 27 [M1PR.0870], and Line 28 must not be negative. 0803 M1PR 0530 On form M1PR, description of nontaxable income [M1PR.0530] or statement reference is required for Line 5 [M1PR.0520]. 0819 PROPST 0270 On form PROPST, Line 6 [PROPST.0270] must not exceed the taxable market value [PROPST.0250] multiplied by 2.5% for the current year. 0826 M1PR 0890 On form M1PR, Line 29 [M1PR.0890] must equal Line 28 [M1PR.0880] multipled by 60%. 0828 M1PR 0030 On form M1PR, taxpayer name [M1PR.0020, M1PR.0030] must not be test. Test names start with "TEST" in both first name [M1PR.0020] and last name [M1PR.0030]. This reject is normally received when educators are teaching lessons using live social security numbers with a live online (web based) software product. 0830 M1PR 0880 On form M1PR, taxpayer does not qualify for special refund if Line 28 [M1PR.0880] is less than or equal to zero. 0835 M1PR 0080 On form M1PR, if address type [M1PR.0060 = 3] is foreign, primary taxpayer foreign address [M1PR.0120, M1PR.0130, M1PR.0140] must be significant. Otherwise, domestic address [M1PR.0080, M1PR.0090, M1PR.0100, M1PR.0110] significant. Both must not be significant, and the primary address line [M1PR.0080] must not contain references to an in care of address ("in care of", "c /o", or "%"). 0845 M1PR 0020 On form M1PR, primary taxpayer information is incomplete. The following are required: taxpayer name [M1PR.0020, M1PR.0030], social security number [M1PR.0050], and birthdate 0849 M1PR 0770 On form M1PR, Line 39 bank routing number [M1PR.0770] is invalid. [First two digits must be 01 through 12, or they must be 21 through 32. Otherwise, the routing number verification routine indicates that the routing number is not valid based on the check digit.] 0854 M1PR 0970 On form M1PR, Line 34 [M1PR.0970] must equal sum of rent paid by GAMC or Medicaid [CRP.0240] on form CRP. 0868 M1PR 0820 On form M1PR, Line 22 [M1PR.0820] must equal the sum of Line 2 [PROPST.0190] on form PROPST. If there is no Line 2, use Line 6 [PROPST.0200] on form PROPST. 0884 M1PR 0670 On form M1PR, Line 9 [M1PR.0670] must equal the sum of Line 3 [CRP.0270] on form CRP. Otherwise, Line 9 must equal the amount on Worksheet 2 Step 3 [CRP.0320] if one exists. 0888 M1PR 0360 On form M1PR, spouse [filing jointly] death date [M1PR.0360] must be a valid date in the past. 0895 M1PR 1220 On form M1PR, [Worksheet 1 Mobile Home Owners] Step 3 [M1PR.1220] must equal Step 1 [M1PR.1200] plus Step 2 [M1PR.1210]. 0896 M1PR 0370 On form M1PR, spouse [filing jointly] political party code [M1PR.0370] selection is invalid. 0917 M1PR 0940 On form M1PR, Line 31 [M1PR.0940] must equal Line 6 [M1PR.0540] when nursing home resident indicator [M1PR.0440] is checked. 0927 M1PR 0560 On form M1PR, Line 7 number of dependents [M1PR.0560] requires dependent information [M1PR.0590, M1PR.0600, M1PR.0610, M1PR.0620, M1PR.0630, M1PR.0640]. [Statement is required for more than two dependents.] Otherwise, dependent information is present, but the number of dependents is missing. 0939 M1PR 0420 On form M1PR, renter [M1PR.0420] does not qualify for special refund on Line 18 through Line 30 [M1PR.0800, M1PR.0810, M1PR.0815, M1PR.0817, M1PR.0820, M1PR.0830, M1PR.0840, M1PR.0850, M1PR.0860, M1PR.0870, M1PR.0880, M1PR.0890, M1PR.0900]. 0943 SUM 0260 The electronic postmark date [SUM.0260] is not valid. This date is required, and it must not be in the future or older than three weeks. 0954 M1PR 1000 On form M1PR, Line 37 [M1PR.1000] must equal the amount from the renters refund table based on Line 8 [M1PR.0660] and Line 9 [M1PR.0670] when nursing home resident indicator [M1PR.0440] is checked. 0961 M1PR 1220 On form M1PR, [Worksheet 1 Mobile Home Owners] Step 1 [M1PR.1200] must not exceed the sum of Line 3 [CRP.0270] for all CRPs. 0965 M1PR 1300 On Worksheet 3, Step 1 [M1PR.1300] must equal the sum of current year new improvements [PROPST.0230] for all form PROPSTs. 0966 M1PR 0170 On form M1PR, primary taxpayer political party selection [M1PR.0170] is invalid. 0969 M1PR 0990 On form M1PR, Line 36 [M1PR.0990] must equal Line 33 [M1PR.0960] divided by Line35 [M1PR.0980]. 0980 M1PR 0850 On form M1PR, Line 25 [M1PR.0850] must equal Line 21 [M1PR.0817] minus Line 24 [M1PR.0840]. 0990 M1PR 0730 On form M1PR, Line 15 [M1PR.0730] must equal sum of Line 10 [M1PR.0680], Line 12 [M1PR.0700] and Line 14 [M1PR.0720].	{"url":"http://www.taxslayer.com/support/59/Minnesota-M1PR-Reject-Codes?language=1&mostViewed=True&page=1","timestamp":"2014-04-16T04:35:25Z","content_type":null,"content_length":"48901","record_id":"<urn:uuid:a5504aa8-e03d-47a6-a042-7000f83116cb>","cc-path":"CC-MAIN-2014-15/segments/1397609521512.15/warc/CC-MAIN-20140416005201-00052-ip-10-147-4-33.ec2.internal.warc.gz"}
SD, SE, Variance, Mean and Median Calculator Note: The standard deviation (SD) is a simple measure of the variablity of a data set. It tells you how tightly all the various examples are clustered. Smaller SD value means samples are clustered tightly, vice versa. The formula of Mean is: The Variance of a finite population of size n is: The Standard Deviation is the square root of Variance: The Standard Error of the Mean is:: , S , ... S are samples. µ is the population mean of the samples. n is the total sample number. The median of a data set can be calculated by first sort the data set from lowest to highest (or highest to lowest), and then pick the middle value where the lower half and the higher half have equal number of samples. If the total number of samples is even, the median then is the mean of the two sample values in the middle. For example, the median of data set 1,2,3,4,5 is the middle value 3, which separate the lower half 1,2 from the higher half 4,5. The median of data set 1,2,3,4 is (2 + 3) / 2 = 2.5.	{"url":"http://www.endmemo.com/math/sd.php","timestamp":"2014-04-19T22:05:10Z","content_type":null,"content_length":"21765","record_id":"<urn:uuid:b441780d-c7a2-4195-972c-1a0447aca88e>","cc-path":"CC-MAIN-2014-15/segments/1397609537754.12/warc/CC-MAIN-20140416005217-00571-ip-10-147-4-33.ec2.internal.warc.gz"}
vector: 1-D ndarray : widths: 1-D sequence : Widths to use for calculating the CWT matrix. In general, this range should cover the expected width of peaks of interest. wavelet: function : Should take a single variable and return a 1d array to convolve with vector. Should be normalized to unit area. Default is the ricker wavelet max_distances: 1-D ndarray,optional : Default widths/4. See identify_ridge_lines gap_thresh: float, optional : Default 2. See identify_ridge_lines min_length: int, optional : Default None. See filter_ridge_lines min_snr: float, optional : Default 1. See filter_ridge_lines noise_perc: float, optional : Default 10. See filter_ridge_lines	{"url":"http://docs.scipy.org/doc/scipy-0.11.0/reference/generated/scipy.signal.find_peaks_cwt.html","timestamp":"2014-04-17T16:09:25Z","content_type":null,"content_length":"12202","record_id":"<urn:uuid:3ce74660-3ac9-4f52-aba7-9e73613f389e>","cc-path":"CC-MAIN-2014-15/segments/1398223206770.7/warc/CC-MAIN-20140423032006-00000-ip-10-147-4-33.ec2.internal.warc.gz"}
st: RE: re: std error covariances between equations [Date Prev][Date Next][Thread Prev][Thread Next][Date index][Thread index] st: RE: re: std error covariances between equations From "FEIVESON, ALAN H. (AL) (JSC-SD) (NASA)" <alan.h.feiveson1@jsc.nasa.gov> To "'statalist@hsphsun2.harvard.edu'" <statalist@hsphsun2.harvard.edu> Subject st: RE: re: std error covariances between equations Date Tue, 17 Sep 2002 08:59:10 -0500 Kit - Oops! I am guilty of not reading the manual. I was unaware of the -stddp- command. Thanks, Kit for pointing it out. As you say, it should be a relatively simple manner to get the cross-covariance terms from the variance of the difference. But I still question of what use the variance of a difference between two equations really is. In many applications, the quantities estmated by separate equations are not comparable (different units, discrete-continuous, etc). Wouldn't it be more useful to have a direct command to obtqin the cross-covariance? Perhaps we could get a response from someone at Stata Corp. on this. Al Feiveson -----Original Message----- From: Kit Baum, Faculty Micro Resource Center [mailto:fmrc@bc.edu] Sent: Friday, September 13, 2002 9:04 PM To: StataList Subject: st: re: std error covariances between equations I believe that Alan's problem, in a two-equation context, could be viewed as looking for the covariance term cov [x1 0] V [0 x2'] = x1 V12 x2' using V12 to refer to the NE block of the covariance matrix. Alternatively, we could be looking for cov [0 x2] V [x1' 0] = x2 V21 x1' where V21 is the SW block of the covariance matrix. Since x1 and x2 may have different numbers of columns, these off-diagonal blocks are not symmetric. The predict option stddp calculates the standard error of the difference in linear predictions. Using the same algebra, and the formula given in [r] this is x1 V11 x1' - x2 V21 x1' - x1 V12 x2' + x2 V22 x2' where the first and last terms are related to the variances of the two individual equations. It would seem like they could be calculated (via stdp for each equation) and added, and the result negated. Without working it out in detail, I am not sure how - [- x2 V21 x1' - x1 V12 x2' ] relates to what Alan seeks, but it seems like you ought to be able to get it out of Since Stata will calculate this stddp for any pair of equations, it would be quite straightforward to have an ado do all the necessary predicts (for both the stdp and stddp) and crank out the desired quantities, even for >2 if they can be derived from the stddp magnitudes. Kit Baum, Faculty Micro Resource Center fmrc@bc.edu Academic Technology Services, Boston College http://www.bc.edu/ats http://fmwww.bc.edu/FMRC/ http://fmwww.bc.edu/GStat/ * For searches and help try: * http://www.stata.com/support/faqs/res/findit.html * http://www.stata.com/support/statalist/faq * http://www.ats.ucla.edu/stat/stata/ * For searches and help try: * http://www.stata.com/support/faqs/res/findit.html * http://www.stata.com/support/statalist/faq * http://www.ats.ucla.edu/stat/stata/	{"url":"http://www.stata.com/statalist/archive/2002-09/msg00278.html","timestamp":"2014-04-16T10:29:40Z","content_type":null,"content_length":"7760","record_id":"<urn:uuid:21aac183-7c8f-412e-856e-d7d40ffe7dc9>","cc-path":"CC-MAIN-2014-15/segments/1398223201753.19/warc/CC-MAIN-20140423032001-00654-ip-10-147-4-33.ec2.internal.warc.gz"}
Math Forum Discussions Math Forum Ask Dr. Math Internet Newsletter Teacher Exchange Search All of the Math Forum: Views expressed in these public forums are not endorsed by Drexel University or The Math Forum. Topic: textbook Replies: 10 Last Post: Jul 15, 1998 8:18 AM Messages: [ Previous \| Next ] Gregali textbook Posted: Jul 13, 1998 2:28 PM Posts: 16 Registered: 12/6/04 Does anyone know the name of a calculus textbook that has a picture of the F- hole of a violin on it (because it looks like an integral sign)? A student in my pre-calc class will be using it next year at Tufts Univ. and he wanted to get a head-start on it. Alison Kyler-Wank Herricks High School Long Island, NY	{"url":"http://mathforum.org/kb/thread.jspa?threadID=160906","timestamp":"2014-04-19T09:38:00Z","content_type":null,"content_length":"27610","record_id":"<urn:uuid:5ee46d58-454b-4862-be66-b0ea444778e3>","cc-path":"CC-MAIN-2014-15/segments/1397609537097.26/warc/CC-MAIN-20140416005217-00252-ip-10-147-4-33.ec2.internal.warc.gz"}
Math Tools Algebra Balance Scales - Negatives Reviewer: weedthenmulch, Nov 3 2006 07:54:05:310PM Review based on: personal experience Appropriate for: introduction to a concept, practice of skills and understandings, applications of a concept or technique Other Comments: I have taught elementary students with learning disabilities. I believe this would be helpful to all student as they move up into algebra. The interaction is great and the visuals simple yet What math does one need to know to use the resource? Algebraic expressions, algebraic equations What hardware expertise does one need to learn to use the resource? Use of mouse and the concept of dragging an image on the screen. How hard was it for you to learn? I didn't read the instructions. I just started playing around with it - a learning technique that students employ often. Ability to meet my goals: Very Ineffective Recommended for: Math 7: Algebra and expressions, Equations and functions Algebra: One Variable Equations Reviewer: Kraz, Oct 17 2006 09:11:32:840AM Review based on: Assignment for school Appropriate for: practice of skills and understandings, applications of a concept or technique What math does one need to know to use the resource? Algebra and problem solving What hardware expertise does one need to learn to use the resource? little to none How hard was it for you to learn? Tool was intuitive and easy to pick up. I understood the use and application right away. Ability to meet my goals: Recommended for: Algebra: Integer Operations, Use of Variables, One Variable Equations Reviewer: Deatra, Oct 14 2005 07:59:14:460PM Review based on: I am a college student, and I was looking for ideas on how to teach two-step equations. This tool had everything that I needed. I loved the way that it walked the students step-by-step through the process of solving the equation. Appropriate for: introduction to a concept, practice of skills and understandings Other Comments: This tool would be great for walking a students through the algorithmic steps needed to solve a two-step equation. What math does one need to know to use the resource? the idea of addition, subtraction, multiplication, and division and the inverse relationoships among them. What hardware expertise does one need to learn to use the resource? What extra things must be done to make it work? After you get the correct equation onto the scales, you must click continue before you can start to solve the equation. How hard was it for you to learn? Very Easy It didn't take me any time to figure it out or to set it up. Ability to meet my goals: Recommended for: Math 7: Algebra and expressions, Equations and functions	{"url":"http://mathforum.org/mathtools/all_reviews/19435/","timestamp":"2014-04-17T16:49:22Z","content_type":null,"content_length":"16830","record_id":"<urn:uuid:2a9f9397-bed9-4f73-afeb-e196a0bf3866>","cc-path":"CC-MAIN-2014-15/segments/1397609530136.5/warc/CC-MAIN-20140416005210-00016-ip-10-147-4-33.ec2.internal.warc.gz"}
Grandis on Collared Cobordisms and TQFT Posted by Urs Schreiber Marco Grandis has a new preprint Marco Grandis Collared cospans, cohomotopy and TQFT (Cospans in Algebraic Topology, II) Dip. Mat. Univ. Genova, Preprint 555 (2007). As we know, quantum field theory is the study of representations of cobordism categories. In most cases, in order to set up decent categories of cobordisms one needs to equip these with collars. A collar on a cobordism is certain extra data associated with its boundary which helps to avoid pathological gluing of cobordisms along their boundary components. Grandis sets up the theory of cobordisms in full generality by considering categories of cospans. A cospan $\array{ && \Sigma \\ &earrow && warrow \\ \partial_{\mathrm{in}}\Sigma &&&& \partial_{\mathrm{out}}\Sigma }$ models a cobordism $\Sigma$ with its “incoming” and “outgoing” boundary components injected into it. (This way of putting it is much less general that what Grandis actually considers). These cospans are naturally composed using pushouts, which models the idea of gluing along common boundary components. Grandis proposes a way how to incorporate the notion of a collared cobordism into his category-theoretic setup. Then he uses this to study 2-dimensional topological field theory. Cobordism cospans, as well as their dual spans of configuration spaces of maps from these into some “target space”, have been discussed at the $n$-Café previously for instance in Slides for Freed’s Andrejewski Lecture or in QFT of charged $n$-Particle: Dynamics. In Hopkins Lecture on TFT: Infinity-Category Definition I had begun listing some relevant literature, like Cheng/Gurski: Towards an $n$-category of cobordisms Jeffrey Morton: A double bicategory of cobordisms with corners. Posted at May 2, 2007 3:05 PM UTC	{"url":"http://golem.ph.utexas.edu/category/2007/05/grandis_on_collared_cobordisms.html","timestamp":"2014-04-20T10:47:31Z","content_type":null,"content_length":"13947","record_id":"<urn:uuid:767b01fa-f87b-404b-bb6f-796af35dda39>","cc-path":"CC-MAIN-2014-15/segments/1398223202548.14/warc/CC-MAIN-20140423032002-00577-ip-10-147-4-33.ec2.internal.warc.gz"}
Universal search problems, Problemi Peredachi Informatsii 9 Results 1 - 10 of 24 - JOURNAL OF COMPUTER AND SYSTEM SCIENCES , 1997 "... ..." - In Proc. of the 15 th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA , 2004 "... Abstract This paper studies the problem of constructing a minimum-weight spanning tree (MST) in a dis-tributed network. This is one of the most important problems in the area of distributed computing. There is a long line of gradually improving protocols for this problem, and the state of the art to ..." Cited by 37 (2 self) Add to MetaCart Abstract This paper studies the problem of constructing a minimum-weight spanning tree (MST) in a dis-tributed network. This is one of the most important problems in the area of distributed computing. There is a long line of gradually improving protocols for this problem, and the state of the art today isa protocol with running time O(\Lambda (G) + pn * log * n) due to Kutten and Peleg [22], where \Lambda (G) denotesthe diameter of the graph G. Peleg and Rubinovich [29] have shown that ~\Omega (pn) time is required forconstructing an MST even on graphs of small diameter, and claimed that their result "establishes the asymptotic near-optimality " of the protocol of [22].In this paper we refine this claim, and devise a protocol that constructs the MST in ~ O(u (G,!)+pn)rounds, where u(G,!) is the MST-radius of the graph. The ratio between the diameter and the MST-radius may be as large as \Theta ( n), and, consequently, on some inputs our protocol is faster than theprotocol of [22] by a factor of ~\Omega (p n). Also, on every input, the running time of our protocol is nevergreater than twice the running time of the protocol of [22]. - Probability,” Proceedings of the Sixth Israeli Conference on Artificial Intelligence, Computer Vision and Pattern Recognition , 1989 "... We have employed Algorithmic Probability Theory to construct a system for machine learning of great power and generality. The principal thrust of present research is the design of sequences of problems to train this system. Current programs for machine learning are limited in the kinds of concepts a ..." Cited by 20 (10 self) Add to MetaCart We have employed Algorithmic Probability Theory to construct a system for machine learning of great power and generality. The principal thrust of present research is the design of sequences of problems to train this system. Current programs for machine learning are limited in the kinds of concepts accessible to them, the kinds of problems they can learn to solve, and in the efficiency with which they learn — both in computation time needed and/or in amount of data needed for learning. Algorithmic Probability Theory provides a general model of the learning process that enables us to understand and surpass many of these limitations. Starting with a machine containing a small set of concepts, we use a carefully designed sequence of problems of increasing difficulty to bring the machine to a high level of problem solving skill. The use of training sequences of problems for machine knowledge acquisition promises to yield Expert Systems that will be easier to train and free of the brittleness that characterizes the narrow specialization of present day systems of this sort. It is also expected that the present research will give needed insight in the design of training sequences for human learning. - Bulletin of the European Association for Theoretical Computer Science , 2003 "... y Abstract What is an algorithm? The interest in this foundational problem is not only theoretical; applications include specification, validation and verification of software and hardware systems. We describe the quest to understand and define the notion of algorithm. We start with the Church-Turin ..." Cited by 19 (9 self) Add to MetaCart y Abstract What is an algorithm? The interest in this foundational problem is not only theoretical; applications include specification, validation and verification of software and hardware systems. We describe the quest to understand and define the notion of algorithm. We start with the Church-Turing thesis and contrast Church's and Turing's approaches, and we finish with some recent - Electronic Colloquium on Computational Complexity , 1997 "... Abstract. In 1984, Leonid Levin initiated a theory of average-case complexity. We provide an exposition of the basic definitions suggested by Levin, and discuss some of the considerations underlying these definitions. Keywords: Average-case complexity, reductions. This survey is rooted in the author ..." Cited by 18 (2 self) Add to MetaCart Abstract. In 1984, Leonid Levin initiated a theory of average-case complexity. We provide an exposition of the basic definitions suggested by Levin, and discuss some of the considerations underlying these definitions. Keywords: Average-case complexity, reductions. This survey is rooted in the author’s (exposition and exploration) work [4], which was partially reproduded in [1]. An early version of this survey appeared as TR97-058 of ECCC. Some of the perspective and conclusions were revised in light of a relatively recent work of Livne [21], but an attempt was made to preserve the spirit of the original survey. The author’s current perspective is better reflected in [7, Sec. 10.2] and [8], which advocate somewhat different definitional choices (e.g., focusing on typical rather than average performace of algorithms). 1 - Communications of the ACM , 1983 "... foremost recognition of technical contributions to the computing community. The citation of Cook's achievements noted that "Dr. Cook has advanced our understanding of the complexity of computation in a significant and profound way. His seminal paper, The Complexity of Theorem Proving Procedures ..." Cited by 17 (0 self) Add to MetaCart foremost recognition of technical contributions to the computing community. The citation of Cook's achievements noted that "Dr. Cook has advanced our understanding of the complexity of computation in a significant and profound way. His seminal paper, The Complexity of Theorem Proving Procedures, presented at the 1971 ACM SIGACT Symposium on the Theory of Computing, laid the foundations for the theory of NP-completeness. The ensuing exploration of the boundaries and nature of the NP-complete class of problems has been one of the most active and important research activities in computer science for the last decade. Cook is well known for his influential results in fundamental areas of computer science. He has made significant contributions to complexity theory, to time-space tradeoffs in computation, and to logics for programming languages. His work is characterized by elegance and insights and has illuminated the very nature of computation." During 1970-1979, Cook did extensive work under grants from the , 1991 "... We are interested in very general systems which are programmed once and which from then on learn autonomously all sorts of things simply by observing a sequence of input data. In this preliminary note we give examples of techniques which apparently permit to deal with two basic aspects related ..." Cited by 13 (6 self) Add to MetaCart We are interested in very general systems which are programmed once and which from then on learn autonomously all sorts of things simply by observing a sequence of input data. In this preliminary note we give examples of techniques which apparently permit to deal with two basic aspects related , 2003 "... We will describe recent developments in a system for machine learning that we've been working on for some time (Sol 86, Sol 89). It is meant to be a "Scientist's Assistant" of great power and versatility in many areas of science and mathematics. It di#ers from other ambitious work in this area i ..." Cited by 10 (4 self) Add to MetaCart We will describe recent developments in a system for machine learning that we've been working on for some time (Sol 86, Sol 89). It is meant to be a "Scientist's Assistant" of great power and versatility in many areas of science and mathematics. It di#ers from other ambitious work in this area in that we are not so much interested in knowledge itself, as we are in how it is acquired - how machines may learn. To start o#, the system will learn to solve two very general kinds of problems. Most, but perhaps not all problems in science and engineering are of these two kinds. , 2004 "... The strive for efficiency is ancient and universal, as time is always short for humans. Computational Complexity is a mathematical study of the what can be achieved when time (and other resources) are scarce. In this ..." Cited by 9 (1 self) Add to MetaCart The strive for efficiency is ancient and universal, as time is always short for humans. Computational Complexity is a mathematical study of the what can be achieved when time (and other resources) are scarce. In this	{"url":"http://citeseerx.ist.psu.edu/showciting?cid=57250","timestamp":"2014-04-20T07:03:19Z","content_type":null,"content_length":"34911","record_id":"<urn:uuid:d15ed5cd-f301-42c6-9b29-cc7f6d4c525f>","cc-path":"CC-MAIN-2014-15/segments/1397609538022.19/warc/CC-MAIN-20140416005218-00348-ip-10-147-4-33.ec2.internal.warc.gz"}
Information-theoretic method for the inversion of the lidar equation A new solution is presented for the reconstruction of profiles of aerosol volume extinction coefficients from the noisy backscattered returns of a monostatic single-wavelength lidar system. This inverse problem is solved by utilizing an information-theoretic method based on the principle of minimum cross-entropy (MCE), which represents an objective and rational approach for the effective incorporation, into the inversion procedure, of both prior information in the form of an initial estimate of the extinction coefficient and additional information in the form of the observed lidar data. A simple and robust numerical procedure, based on the ellipsoid algorithm, is developed to compute the MCE reconstruction of the extinction function. A number of numerical examples, based on noisy synthetic lidar data, are employed to demonstrate and evaluate the utility and efficacy of the inversion method. © 1989 Optical Society of America Original Manuscript: May 16, 1988 Published: May 1, 1989 Eugene Yee, "Information-theoretic method for the inversion of the lidar equation," Appl. Opt. 28, 1628-1637 (1989) Sort: Year \| Journal \| Reset 1. B. T. N. Evans, “Field Evaluations of a Canadian Laser Cloud Mapper and Candidate IR Screening Aerosols,” presented at Smoke/Obscurants Symposium VI, Unclassified Section, Harry Diamond Laboratories, Adelphi, MD. (Apr. 1982). 2. W. Hitchfeld, J. Bordan, “Errors Inherent in the Radar Measurement of Rainfall at Attenuating Wavelengths,” J. Meteorol. 11, 58 (1954). [CrossRef] 3. J. D. Klett, “Stable Analytical Inversion Solution for Processing Lidar Returns,” Appl. Opt. 20, 211 (1981). [CrossRef] [PubMed] 4. B. T. N. Evans, “On the Inversion of the Lidar Equation (U),” DREV R-4343/84 (Nov.1984). 5. R. H. Kohl, “Discussion of the Interpretation Problem Encountered in Single-Wavelength Lidar Transmissometers,” J. Appl. Meteorol. 17, 1034 (1978). [CrossRef] 6. G. DeLeeuw, “Mie Scattering on Particle Size Distributions: Influence of Size Limits and Complex Refractive Index on the Calculated Extinction and Backscatter Coefficients,” Physics Laboratory TNO, PHL 1982-50, The Netherlands (1982). 7. S. Kullback, Information Theory and Statistics (Wiley, New York, 1959). 8. M. S. Pinsker, Information and Information Stability of Random Variables and Processes (Holden-Day, San Francisco, 1964). 9. I. J. Good, Probability and the Weighting of Evidence (Griffen, London, 1950). 10. I. Csiszar, “I-Divergence Geometry of Probability Distributions and Minimization Problems,” Ann. Prob. 3, 146 (1975). [CrossRef] 11. J. E. Shore, R. W. Johnson, “Axiomatic Derivation of the Principle of Maximum Entropy and the Principle of Minimum Cross-Entropy,” IEEE Trans. Inf. Theory IT-26, 26 (1980). [CrossRef] 12. J. E. Shore, R. W. Johnson, “Properties of Cross-Entropy Minimization,” IEEE Trans. Inf. Theory IT-27, 472 (1981). [CrossRef] 13. W. M. Elsasser, “On Quantum Measurements and the Role of the Uncertainty Relations in Statistical Mechanics,” Phys. Rev. 52, 978 (1937). [CrossRef] 14. E. T. Jaynes, “Information Theory and Statistical Mechanics I,” Phys. Rev. 108, 171 (1957). [CrossRef] 15. E. T. Jaynes, “Prior Probabilities,” IEEE Trans. Syst. Sci. Cybern. SSC-4, 227 (1968). [CrossRef] 16. L. G. Khachian, “A Polynomial Algorithm in Linear Programming,” Sov. Math. 20, 191 (1979). 17. N. Z. Shor, “Cut-Off Method with Space Extension in Convex Programming Problems,” Cybernetics 12, 94 (1977). 18. N. Z. Shor, V. I. Gershovich, “Family of Algorithms for Solving Convex Programming Problems,” Cybernetics 15, 502 (1980). [CrossRef] 19. R. G. Bland, D. Goldfarb, M. J. Todd, “The Ellipsoid Method: A Survey,” Oper. Res. 29, 1039 (1981). [CrossRef] 20. E. P. Shettle, R. W. Fenn, “Models for the Aerosols of the Lower Atmosphere and the Effects of Humidity Variations on Their Optical Properties (U),” AFGL-TR-79-0214, Air Force Geophysics Laboratory, Hanscom AFB, MA (Sept.1979). 21. L. R. Bissonnette, “Multiscattering Lidar Method for Determining Optical Parameters of Aerosols (U),” DREV R-4430/86 (Oct.1986). OSA is able to provide readers links to articles that cite this paper by participating in CrossRef's Cited-By Linking service. CrossRef includes content from more than 3000 publishers and societies. In addition to listing OSA journal articles that cite this paper, citing articles from other participating publishers will also be listed. « Previous Article \| Next Article »	{"url":"http://www.opticsinfobase.org/ao/abstract.cfm?uri=ao-28-9-1628","timestamp":"2014-04-18T19:25:44Z","content_type":null,"content_length":"111301","record_id":"<urn:uuid:8443810b-590a-4360-bb4e-81c5428cfe71>","cc-path":"CC-MAIN-2014-15/segments/1397609535095.7/warc/CC-MAIN-20140416005215-00276-ip-10-147-4-33.ec2.internal.warc.gz"}
Distance Conversion Metric MathScore EduFighter is one of the best math games on the Internet today. You can start playing for free! Distance Conversion Metric - Sample Math Practice Problems The math problems below can be generated by MathScore.com, a math practice program for schools and individual families. References to complexity and mode refer to the overall difficulty of the problems as they appear in the main program. In the main program, all problems are automatically graded and the difficulty adapts dynamically based on performance. Answers to these sample questions appear at the bottom of the page. This page does not grade your responses. Want unlimited math worksheets? Learn more about our online math practice software. See some of our other supported math practice problems. Complexity=4, Mode=metric Do the following conversions. Round to nearest tenth where necessary. Complexity=6, Mode=metric Do the following conversions. Round to nearest tenth where necessary. Complexity=2, Mode=english Do the following conversions. Round to nearest tenth where necessary. Complexity=4, Mode=english Do the following conversions. Round to nearest tenth where necessary. Complexity=4, Mode=mixed Do the following conversions. Round to nearest tenth where necessary. Complexity=6, Mode=mixed Do the following conversions. Round to nearest tenth where necessary. Complexity=2, Mode=complex Do the following conversions. Round to nearest tenth where necessary. Complexity=3, Mode=complex Do the following conversions. Round to nearest tenth where necessary. Complexity=1, Mode=metric Do the following conversions. Round to nearest tenth where necessary. Complexity=4, Mode=metric Do the following conversions. Round to nearest tenth where necessary. Complexity=6, Mode=metric Do the following conversions. Round to nearest tenth where necessary. Complexity=2, Mode=english Do the following conversions. Round to nearest tenth where necessary. Complexity=4, Mode=english Do the following conversions. Round to nearest tenth where necessary. Complexity=4, Mode=mixed Do the following conversions. Round to nearest tenth where necessary. Complexity=6, Mode=mixed Do the following conversions. Round to nearest tenth where necessary. Complexity=2, Mode=complex Do the following conversions. Round to nearest tenth where necessary. Complexity=3, Mode=complex Do the following conversions. Round to nearest tenth where necessary. Learn more about our online math practice software.	{"url":"http://www.mathscore.com/math/practice/Distance%20Conversion%20Metric/","timestamp":"2014-04-19T10:00:02Z","content_type":null,"content_length":"19159","record_id":"<urn:uuid:0ea036da-d734-41f4-9555-a936dabba95a>","cc-path":"CC-MAIN-2014-15/segments/1397609537097.26/warc/CC-MAIN-20140416005217-00441-ip-10-147-4-33.ec2.internal.warc.gz"}
STOR 831 Course Information for STOR 831 (Fall 2009) Advanced Probability Class meetings: MONDAY and WEDNESDAY 2-3:15pm, in HANES 1. Prerequisites: Good working knowledge of measure theoretic probability, and real analysis at the level of Rudin's book ``Principles of Real Analysis''. Registration: Enrollment and registration for the course is handled by Charlotte Rogers in the Department Statistics and Operations Research. Ms. Rogers can be reached at 962.2307, or by email at Instructor: Andrew B. Nobel, Department of Statistics and Operations Research Office: Hanes 308 Phone: 962-1352. Office Hours: TBA and by appointment. Course Overview: STOR 831 is a PhD level course in advanced probability that is appropriate for graduate students in Statistics and Mathematics, and for mathematically oriented graduate students in other fields of study. The course will cover basic results from several areas in probability. It will focus on results that are of potential use in probabilisitic and statistical research. Results will be presented in a mathematically rigorous fashion. Whenever possible we will present complete proofs that illustrate important techniques and ideas. The course will be self-contained: the majority of the results and applications will be derived from first principles. Texts: There is no required textbook for the course. Depending on the topic, lectures will be based on textbooks, lecture notes, or research papers. The instructor will provide pointers to the relevant sources for each topic. Syllabus: The following is a tentative list of topics (as of August 25) and will be updated as needed. The final list of topics will depend on available time and, to some extent, student preferences. Large deviation theory: Cramer's theorem in R^1 and R^d and applications Sanov's theorem for finite alphabets Varadhan's Integral Lemma Long rare segments in random walks Introduction to coupling with applications Poisson approximation for independent indicators Existence of stationary distributions for Harris Markov Chains Poisson approximation using the Chen-Stein method, with emphasis on the case of dependent indicators Combinatorial and probabilisitic applications Basic comparision theorems for Gaussian random variables. Concentration inequalities The Efron-Stein inequality Gaussian concentration via log Sobolev inequalities Borell's inequality for Gaussian processes Inequalities for bounded differences and self-bounding functions Ergodic theory: basic definitions, notions of mixing, ergodic and subadditive ergodic theorems Grading: Reading assignments and homework problems will be set periodically throughout the semester. In addition, students will be asked to read and offer written or oral comments on a paper in the literature. More details on the project will be provided later in the semester. Lecture references: "Large Deviations Techniques and Applications", second edition, by A. Dembo and O. Zeitouni, Springer, 1998. "Lectures on the Coupling Method'', by T. Lindvall, Wiley, 1992. "Poisson Approximation", by A.D. Barbour, L. Holst and S. Janson, Oxford Science, 1992. "Concentration Inequalities", by S. Boucheron, O. Bousquet, and G. Lugosi, 2004. Lecture notes available from G. Lugosi's web page. "Probability: Theory and Examples", by R. Durrett. Preliminary versions of the 4th edition are available from the author's web page. Background and further references: "Probability and Measure", third edition, P. Billingsley, Wiley, 1995. "The Cauchy-Schwartz Master Class'', J.M. Steele, Cambridge, 2004. (A nice book on basic inequalities that can be read with relatively little background. Contains many of problems, with solutions.) "Principles of Mathematical Analysis", third edition, W. Rudin, McGraw Hill. (A good reference for real analysis.) "Probability", L. Breiman, SIAM, 1992. "Real Analysis and Probability", R.M. Dudley, Chapman and Hall, 1989. "The Concentration of Measure Phenomenon'', M. Ledoux, AMS Mathematical Surveys, 2000. Honor Code: Students are expected to adhere to the UNC honor code at all times.	{"url":"http://www.unc.edu/~nobel/nobel/831/831info.html","timestamp":"2014-04-16T22:20:59Z","content_type":null,"content_length":"14084","record_id":"<urn:uuid:203b2e06-7751-46a6-b2bf-2993c731432d>","cc-path":"CC-MAIN-2014-15/segments/1398223206770.7/warc/CC-MAIN-20140423032006-00093-ip-10-147-4-33.ec2.internal.warc.gz"}
Excursions in Physics Homework, Chapter 7: Energy Ch 7, Energy; Ex 4, 7, 13, 14, 44, 46; Pb 2, 6 \| Back to 3050's Home Page \| Back to Calendar \| ToC, Ch 7 \| Ch 8, Rotation \| Exercises (Discussion Questions) Ex7.4 When a rifle with a long barrel is fired, the force of expanding gases acts on the bullet for a longer distance. What effect does this have on the velocity of the emerging bullet? (Do you see why long-range cannons have such long barrels?) Work = force x distance work = change in KE = change in [ ^1/[2] m v^2 ] The expanding gases exert a force on the bullet. This force is exerted over a distance so work is done on the bullet. This work done on the bullet means its KE (kinetic energy) increases. If the distance over which the force acts increases, then the amount of work done on the bullet increases and the final value of its KE increases -- more KE means more speed! Long-rang cannons on naval ships are 10 or 15 meters long. Ex 7.7 Can something have energy without having momentum? Explain. Can something have momentum without having energy? Defend your answer. An object at rest has no momentum; its velocity is zero. But it can still have potential energy -- PE -- because of work we have done on it. We can lift an object and give it gravitational PE = m g h. It has PE because it can do work on something else as it falls -- or it can increase its own KE. Lifting the object, to give it PE, requires that work be done on it. If we compress a spring, we must do work on it. That work is then stored in the compressed spring and is available to do work on something else. That means there is PE stored in a compressed spring. If we bend a bow we must do work on it. That work is then stored in the bent bow and is available to do work on something else. That means there is PE stored in a bent bow. In all these cases, on object can have energy -- potential energy -- even though it is at rest; an object at rest has no momentum. However, if an object has momentum it has a velocity. And, if it has a velocity, it has KE -- kinetic energy or energy of motion. So, if an object has momentum, it must also have energy. Ex 7.13 At what point in its motion is the KE of a pendulum bob a maximum? At what point is its PE a maximum? When its KE is half its maximum value, how much PE does it have? The KE of a pendulum is maximum at the bottom of its swing where its PE is minimum (or where we often take its PE to be zero). The PE of a pendulum is maximum at the top of its swing where it momentarily stops and its KE is zero. The total energy remains constant, E = KE + PE So when the pendulum's KE is half its maximum value, its PE is half its maximum value if we have counted its PE as zero at the bottom of its swing. Ex 7.14 A Physics instructor demonstrates energy conservation by releasing a heavy pendulum bob, as shown in the sketch, allowing it to swing to and fro. What would happen if, in his exuberance, he gave the bob a slight shove as it left his nose? Why? If the bob starts off from rest, it will convert its PE into KE going down to the bottom of the swing and then convert KE back to PE and come to rest at the other end of its swing and then start back. On the way back, it increases its KE by reducing its PE until it comes to the bottom of the swing. On the last part of its swing, this KE decreases as it rises and increases its PE until the KE finally goes to zero and the pendulum comes to rest. With KE = 0, the PE must be equal to the total energy which is the original PE and it is back at its original height. However, if the bob starts off with some KE because of a shove, then its total energy is greater than for the case just described. At the bottom of its swing, the pendulum will have a greater speed due to this increased energy. At the other end of the swing, it will come to rest at a greater height so its PE is greater. On the way back, that great height means it will smash our exuberant physicist in the nose! Ex 7.44 Scissors for cutting paper have long blades and short handles, whereas metal-cutting shears have long handles and shout blades. Bolt cutters have very long handles and very short blades. Why is this so? Scissors are levers. A longer blade with the short handles means that the longer blade moves a greater distance but with less force when compared to the handles. Metal-cutting shears have blades that move a smaller distance but with more force. The bolt cutters, with very short blades and very long handles, have blades that move and even smaller distance but with even greater force. Input work is done by the "operator" as she or he exerts a force on the handles and moves them through a distance. Output work is done by the blade as it exerts a force and moves through a distance. These devices trade off moving a small force through a large distance, as with the scissors, or moving a greater force through a smaller distance. Ex 7.44 Consider the swinging-balls apparatus, also known as Newton's pendulum. If two balls are lifted and released, momentum is conserved as two balls pop out the other side with the same speed as the released balls at impact. But momentum would also be conserved if one ball popped out at twice the speed. Can you explain why this never happens? (And why is this exercise in Chapter 6, on Energy, rather than Chapter 5, on Momentum?) Indeed, momentumwould be conserved if a single ball popped out with twice the original, incoming speed. We might write that as initial momentum = (2 m) (v[o]) = (m) (2 v[o]) = final momentum But what does that do to the KE? Remember that KE = (^1/[2]) m v^2 initial KE = 2 [ (^1/[2]) m v[o]^2 ] =?= 1 [ (^1/[2]) m (2 v[o])^2 ] = final KE initial KE = 2 [ (^1/[2]) m v[o]^2 ] =?= 1 [ (^1/[2]) m (4 v[o]^2 )] = final KE initial KE = 2 [ (^1/[2]) m v[o]^2 ] =?= 4 [ (^1/[2]) m v[o]^2 ] = final KE initial KE = 2 [ (^1/[2]) m v[o]^2 ] =/= 4 [ (^1/[2]) m v[o]^2 ] = final KE Because of the way KE is defined, this situation would make the final KE twice as much as the initial KE. So this doe not happen! Pb 7.2 This question is typical on some driver's license exams: A car moving at 50 km/h skids 15 m with locked brakes. How far will the car skid with locked brakes at 150 km/h? Work done by the brakes changes the car's KE from its initial value to zero. This work is equal to the force of friction causing the skid marks multiplied by the length of the skid marks since work = force x distance When the car's speed is increased from 50 km/h to 150 km/h, its KE is increased by nine times! Remember that KE is given by KE = (^1/[2]) m v^2 so increasing v by three means that KE increases by nine. The force of friction between the road and the skidding tires does not change appreciably so the distance or length over which the force is applied must increase nine times as well. That means we would expect skid marks to be about 9 x 15 m or 135 m long. Pb 7.6 Consider the inelastic collision between the two freight cars in the last chapter (Figure 6.11). The momentum before and after the collision is the same. The KE, however, is less after the collision than before the collision. How much less, and what becomes of this energy? momentum = mass x velocity The two freight cars have the same mass -- just call it M -- so the momentum is conserved. We can see that from initial momentum = M (10) + M (0) = M (10) initial momentum = M (10) = (2 M) (5) = final momentum But what has happened to the KE? initial KE = (1/2) M v[o]^2 = (1/2) M (10)^2 = (1/2) M (100) (1/2) M[total] v[f]^2 = (1/2) (2 M) (5)^2 = (1/2) M (50) = final KE initial KE = 2 x final KE The final Kinetic Energy is only one-half the initial Kinetic Energy (even though the final momentum is equal to the initial momentum). In an accidental collision, kinetic energy will be "lost" (that is, converted into heat) by bending and breaking parts of the cars. In a designed collision, like this, kinetic energy will be "lost" (or turned into heat) by heating up the couplings that hold the cars together. Here's an "extra" one. Pb 7.* Your monthly electric bill is probably expressed in kilowatt-hours (kWh), a unit of energy delivered by the flow of 1 kW of electricity for 1 hr. How many joules of energy do you get when you buy 1 kWh? 1 watt = 1 W = 1 J/s 1 J = (1 W) x (1 s) = (1 W) (1 s) = 1 W s 1 kWh = [1 kW] [ h ] 1 kWh = [1 kW (^1000 W /[kW])] [ h (^60 min/[h]) (^60 s/[min])] = 3,600,000 Ws = 3,600,000 J 1 kWh = 3,600,000 J \| Back to 3050's Home Page \| Back to Calendar \| ToC, Ch 7 \| Ch 8, Rotation \| Typical or possible multiple-guess questions for this material: 1. If you push an object twice as far while applying the same force you do A) half as much work B) the same amount of work C) twice as much work D) four times as much work 2. If you push an object just as far while applying twice the force you do A) half as much work B) the same amount of work C) twice as much work D) four times as much work 3. Exert 1 N for a distance of 1 m in 1 s and you deliver a power of A) 0.5 W B) 1.0 W C) 2.0 W D) 3.0 W 4. Exert 100 J in 50 s and your power output is A) 0.5 W B) 1.0 W C) 2.0 W D) 4.0 W 5. An object is raised above the ground gaining a certain amount of potential energy. If the same object is raised twice as high it gains A) half as much energy B) the same amount of energy C) twice as much energy D) four times as much energy 6. An object that has kinetic energy must be A) elevated B) falling C) moving D) at rest 7. An object that has potential energy may have this energy because of its A) speed B) acceleration C) momentum D) position 8. A clerk can lift containers a vertical distance of 1 meter or can roll them up a 2 meter-long ramp to the same elevation. With the ramp, the applied force required is about A) one-fourth as much B) half as much C) the same D) twice as much 9. When a car is braked to a stop, its kinetic energy is transformed to A) energy of motion B) heat energy C) stopping energy D) potential energy 10. For which position above does the ball on the end of the string have the greatest gravitational potential energy? 11. For which position above does the ball on the end of the string have the greatest kinetic energy? 12. Which requires more work: lifting a 5 kg sack vertically 2 meters or lifting a 10 kg sack vertically 4 meters? A) lifting the 5 kg sack B) both require the same amount of work C) lifting the 10 kg sack D) both require the same amount of force 13. A 10 kg sack is lifted 2 meters in the same time as a 5 kg sack is lifted 4 meters. The power expended in raising the 10 kg sack compared to the power used to lift the 5 kg sack is A) half as much B) the same C) twice as much D) four times as much 14. A 2 kg mass is held 4 m above the ground. What is the approximate potential energy of the mass with respect to the ground? A) 8 J B) 40 J C) 80 J D) 160 J 15. A 2 kg mass has 40 J of potential energy with respect to the ground. Approximately how far is it located above the ground? A) 1 m B) 2 m C) 3 m D) 4 m 16. Using 1,000 J of work, a model elevator is raised from the ground floor to the second floor in 20 seconds. How much power does the elevator use? A) 50 W B) 500 W C) 2 kW D) 20 kW 17. A car moves 4 times as fast as another identical car. Compared to the slower car, the faster car has A) the same kinetic energy B) 4 times the kinetic energy C) 8 times the kinetic energy D) 16 times the kinetic energy 18. A car moving at 50 km/hr skids 20 m with locked brakes. How far will the car skid with locked brakes if it is traveling at 150 km/hr? A) 40 m B) 60 m C) 90 m D) 180 m 19. When a rifle is fired it recoils so both the bullet and rifle are set in motion. The rifle and bullet ideally acquire equal but opposite amounts of A) kinetic energy B) momentum C) potential energy D) all of the above 20. What does an object have when moving that it doesn`t have when at rest? A) momentum C) mass D) all of the above 21. If an object has kinetic energy, then it also must have A) momentum B) velocity C) speed D) all of the above \| Back to 3050's Home Page \| Back to Calendar \| ToC, Ch 7 \| Ch 8, Rotation \| Answers to the typical or possible multiple-choice questions for this material: 1. If you push an object twice as far while applying the same force you do A) half as much work B) the same amount of work C) twice as much work W = F s W = F s D) four times as much work 2. If you push an object just as far while applying twice the force you do A) half as much work B) the same amount of work C) twice as much work W = F s W = F s D) four times as much work 3. Exert 1 N for a distance of 1 m in 1 s and you deliver a power of A) 0.5 W B) 1.0 W Power is the rate at which work is done P = P = [(1 N) ( 1 m)] / (1 s) P = 1 J / 1 s P = 1 W C) 2.0 W D) 3.0 W 4. Exert 100 J in 50 s and your power output is A) 0.5 W B) 1.0 W C) 2.0 W Power is the rate at which work is done P = P = 100 J / 50 s P = 2 W D) 4.0 W 5. An object is raised above the ground gaining a certain amount of potential energy. If the same object is raised twice as high it gains A) half as much energy B) the same amount of energy C) twice as much energy PE = m g h D) four times as much energy 6. An object that has kinetic energy must be A) elevated B) falling C) moving KE = (^1/[2]) m v^2 D) at rest 7. An object that has potential energy may have this energy because of its A) speed B) acceleration C) momentum D) position 8. A clerk can lift containers a vertical distance of 1 meter or can roll them up a 2 meter-long ramp to the same elevation. With the ramp, the applied force required is about A) one-fourth as much B) half as much W[ramp] = W[lift] F[ramp] x 1 m = F[lift] x 2m F[ramp] = (^1/[2]) F[lift] C) the same D) twice as much 9. When a car is braked to a stop, its kinetic energy is transformed to A) energy of motion B) heat energy C) stopping energy D) potential energy 10. For which position above does the ball on the end of the string have the greatest gravitational potential energy? A) PE = m g h The height is greatest at position A. 11. For which position above does the ball on the end of the string have the greatest kinetic energy? D) KE = (^1/[2]) m v^2 E[Tot] = PE + KE KE = maximum when PE = minimum PE = minimum at D Therefore, KE = maximum at D 12. Which requires more work: lifting a 5 kg sack vertically 2 meters or lifting a 10 kg sack vertically 4 meters? A) lifting the 5 kg sack B) both require the same amount of work C) lifting the 10 kg sack W = m g h W[5] = (5 kg) ( 10 m/s^2) ( 2 m) = 100 J W[10] = (10 kg) (10 m/s^2) (4 m) = 400 J D) both require the same amount of force 13. A 10 kg sack is lifted 2 meters in the same time as a 5 kg sack is lifted 4 meters. The power expended in raising the 10 kg sack compared to the power used to lift the 5 kg sack is A) half as much B) the same P = W / t P = m g h / t P[5] = (10 kg) (10 m/s^2) (2 m) / t = 200 J / t P[10] = (5 kg) (10 m/s^2) (4 m) / t = 200 J / t C) twice as much D) four times as much 14. A 2 kg mass is held 4 m above the ground. What is the approximate potential energy of the mass with respect to the ground? A) 8 J B) 40 J C) 80 J PE = m g h PE = (2 kg) (10 m/s^2) (4 m) PE = 80 J D) 160 J 15. A 2 kg mass has 40 J of potential energy with respect to the ground. Approximately how far is it located above the ground? A) 1 m B) 2 m PE = m g h PE = (2 kg) (10 m/s^2) (2 m) PE = 40 J C) 3 m D) 4 m 16. Using 1,000 J of work, a model elevator is raised from the ground floor to the second floor in 20 seconds. How much power does the elevator use? A) 50 W P = W / t P = 1,000 J / 20 s P = 50 J / s P = 50 W B) 500 W C) 2 kW D) 20 kW 17. A car moves 4 times as fast as another identical car. Compared to the slower car, the faster car has A) the same kinetic energy B) 4 times the kinetic energy C) 8 times the kinetic energy D) 16 times the kinetic energy KE = (^1/[2]) m v^2 If v is 4 times greater then v^2 is 4^2 = 16 times greater. 18. A car moving at 50 km/hr skids 20 m with locked brakes. How far will the car skid with locked brakes if it is traveling at 150 km/hr? A) 40 m B) 60 m C) 90 m D) 180 m W = F s = Increasing the speed by a factor of three means KE has increased by a factor of nine. The brakes only exert so much force as they skid; the force is constant. The stopping distance must increase by a factor of nine. This was also a homework problem, Pb 6.1 . 19. When a rifle is fired it recoils so both the bullet and rifle are set in motion. The rifle and bullet ideally acquire equal but opposite amounts of A) kinetic energy B) momentum Momentum is always conserved C) potential energy D) all of the above 20. What does an object have when moving that it doesn`t have when at rest? A) momentum At rest, an object's momentum must be zero. But an object can have potential energy while it is at rest. And an object certainly has mass while it is at rest. B) energy C) mass D) all of the above 21. If an object has kinetic energy, then it also must have A) momentum B) velocity C) speed D) all of the above If it has KE, it has velocity and that means it also has momentum and speed. \| Back to 3050's Home Page \| Back to Calendar \| ToC, Ch 7 \| Ch 8, Rotation \| (C) 2003, Doug Davis; all rights reserved	{"url":"http://www.ux1.eiu.edu/~cfadd/3050/Ch07Energy/Hmwk.html","timestamp":"2014-04-16T15:59:28Z","content_type":null,"content_length":"32531","record_id":"<urn:uuid:99188507-0367-4aee-8d75-a4b9879685bc>","cc-path":"CC-MAIN-2014-15/segments/1397609524259.30/warc/CC-MAIN-20140416005204-00131-ip-10-147-4-33.ec2.internal.warc.gz"}
Elements of Combinatorial and Differential Topology American Mathematical Society, Providence: Graduate Studies in Mathematics, vol. 74 The main topic of this book is combinatorial and differential topology. The author discusses a lot of interesting and basic facts avoiding sophisticated techniques, hence the reading of the book requires only a modest background for these topics (e.g. basic topological properties of sets in Euclidean space). After an introductory discussion of graphs, the topology of subsets in Euclidean space is considered (including the Jordan theorem for curves, the Brouwer fixed point theorem and the Sperner lemma). Simplicial complexes and CW-complexes are discussed in the next chapter, followed by a treatment of surfaces, coverings, fibrations and homotopy groups. The fifth chapter turns to differential topology (smooth manifolds, embeddings and immersions, the degree of a map, the Hopf theorem on the homotopy classification of maps to the sphere and Morse theory). The last chapter treats the fundamental groups (with many explicit examples). The book contains a lot of problems and their solutions can be found at the end of the book.	{"url":"http://www.euro-math-soc.eu/node/2304","timestamp":"2014-04-17T15:53:06Z","content_type":null,"content_length":"12522","record_id":"<urn:uuid:68921c84-94c8-4a64-bc3a-81560ef20682>","cc-path":"CC-MAIN-2014-15/segments/1397609530136.5/warc/CC-MAIN-20140416005210-00103-ip-10-147-4-33.ec2.internal.warc.gz"}
Distance Between Two Lines Distance Between Parallel Lines The distance from a line, r, to another parallel line, s, is the distance from any point from r to s. Distance Between Skew Lines The distance between skew lines is measured on the common perpendicular. The vectors The volume of a parallelepiped is Given that the volume is the absolute value of the triple product of three vectors and the area of the base is the cross product of the direction vectors of the lines, the height is the distance between two points equal to: Find the minimum distance between the following lines:	{"url":"http://www.vitutor.com/geometry/distance/distance_lines.html","timestamp":"2014-04-16T16:00:16Z","content_type":null,"content_length":"17603","record_id":"<urn:uuid:3f80b3fc-9b05-4a17-b764-f239b2e9266a>","cc-path":"CC-MAIN-2014-15/segments/1397609524259.30/warc/CC-MAIN-20140416005204-00294-ip-10-147-4-33.ec2.internal.warc.gz"}
1.3.3 Procedures as General Methods \| SICP in Clojure 1.3.3 Procedures as General Methods We introduced compound procedures in section 1.1.4 as a mechanism for abstracting patterns of numerical operations so as to make them independent of the particular numbers involved. With higher-order procedures, such as the integral procedure of section 1.3.1, we began to see a more powerful kind of abstraction: procedures used to express general methods of computation, independent of the particular functions involved. In this section we discuss two more elaborate examples — general methods for finding zeros and fixed points of functions — and show how these methods can be expressed directly as procedures. Finding roots of equations by the half-interval method The half-interval method is a simple but powerful technique for finding roots of an equation f(x) = 0, where f is a continuous function. The idea is that, if we are given points a and b such that f (a) < 0 < f(b), then f must have at least one zero between a and b. To locate a zero, let x be the average of a and b and compute f(x). If f(x) > 0, then f must have a zero between a and x. If f(x) < 0, then f must have a zero between x and b. Continuing in this way, we can identify smaller and smaller intervals on which f must have a zero. When we reach a point where the interval is small enough, the process stops. Since the interval of uncertainty is reduced by half at each step of the process, the number of steps required grows as Θ(log( L/T)), where L is the length of the original interval and T is the error tolerance (that is, the size of the interval we will consider “small enough”). Here is a procedure that implements this strategy: (define (search f neg-point pos-point) (let ((midpoint (average neg-point pos-point))) (if (close-enough? neg-point pos-point) (let ((test-value (f midpoint))) (cond ((positive? test-value) (search f neg-point midpoint)) ((negative? test-value) (search f midpoint pos-point)) (else midpoint)))))) We assume that we are initially given the function f together with points at which its values are negative and positive. We first compute the midpoint of the two given points. Next we check to see if the given interval is small enough, and if so we simply return the midpoint as our answer. Otherwise, we compute as a test value the value of f at the midpoint. If the test value is positive, then we continue the process with a new interval running from the original negative point to the midpoint. If the test value is negative, we continue with the interval from the midpoint to the positive point. Finally, there is the possibility that the test value is 0, in which case the midpoint is itself the root we are searching for. To test whether the endpoints are “close enough” we can use a procedure similar to the one used in section 1.1.7 for computing square roots: (define (close-enough? x y) (< (abs (- x y)) 0.001)) Search is awkward to use directly, because we can accidentally give it points at which f’s values do not have the required sign, in which case we get a wrong answer. Instead we will use search via the following procedure, which checks to see which of the endpoints has a negative function value and which has a positive value, and calls the search procedure accordingly. If the function has the same sign on the two given points, the half-interval method cannot be used, in which case the procedure signals an error.[56] (define (half-interval-method f a b) (let ((a-value (f a)) (b-value (f b))) (cond ((and (negative? a-value) (positive? b-value)) (search f a b)) ((and (negative? b-value) (positive? a-value)) (search f b a)) (error "Values are not of opposite sign" a b))))) The following example uses the half-interval method to approximate π as the root between 2 and 4 of sin x = 0: (half-interval-method sin 2.0 4.0) Here is another example, using the half-interval method to search for a root of the equation x^3 - 2x - 3 = 0 between 1 and 2: (half-interval-method (lambda (x) (- (* x x x) (* 2 x) 3)) Finding fixed points of functions A number x is called a fixed point of a function f if x satisfies the equation f(x) = x. For some functions f we can locate a fixed point by beginning with an initial guess and applying f repeatedly, until the value does not change very much. Using this idea, we can devise a procedure fixed-point that takes as inputs a function and an initial guess and produces an approximation to a fixed point of the function. We apply the function repeatedly until we find two successive values whose difference is less than some prescribed tolerance: (define tolerance 0.00001) (define (fixed-point f first-guess) (define (close-enough? v1 v2) (< (abs (- v1 v2)) tolerance)) (define (try guess) (let ((next (f guess))) (if (close-enough? guess next) (try next)))) (try first-guess)) For example, we can use this method to approximate the fixed point of the cosine function, starting with 1 as an initial approximation:[57] (fixed-point cos 1.0) Similarly, we can find a solution to the equation y = sin y + cos y: (fixed-point (lambda (y) (+ (sin y) (cos y))) The fixed-point process is reminiscent of the process we used for finding square roots in section 1.1.7. Both are based on the idea of repeatedly improving a guess until the result satisfies some criterion. In fact, we can readily formulate the square-root computation as a fixed-point search. Computing the square root of some number x requires finding a y such that y^2 = x. Putting this equation into the equivalent form y = x/y, we recognize that we are looking for a fixed point of the function[58] y → x/y, and we can therefore try to compute square roots as (define (sqrt x) (fixed-point (lambda (y) (/ x y)) Unfortunately, this fixed-point search does not converge. Consider an initial guess y[1]. The next guess is y[2] = x/y[1] and the next guess is y[3] = x/y[2] = x/(x/y[1]) = y[1]. This results in an infinite loop in which the two guesses y[1] and y[2] repeat over and over, oscillating about the answer. One way to control such oscillations is to prevent the guesses from changing so much. Since the answer is always between our guess y and x/y, we can make a new guess that is not as far from y as x/y by averaging y with x/y, so that the next guess after y is (1/2)(y + x/y) instead of x/y. The process of making such a sequence of guesses is simply the process of looking for a fixed point of y → (1 /2)(y + x/y): (define (sqrt x) (fixed-point (lambda (y) (average y (/ x y))) (Note that y = (1/2)(y + x/y) is a simple transformation of the equation y = x/y; to derive it, add y to both sides of the equation and divide by 2.) With this modification, the square-root procedure works. In fact, if we unravel the definitions, we can see that the sequence of approximations to the square root generated here is precisely the same as the one generated by our original square-root procedure of section 1.1.7. This approach of averaging successive approximations to a solution, a technique we that we call average damping, often aids the convergence of fixed-point searches. We have used 0.001 as a representative “small” number to indicate a tolerance for the acceptable error in a calculation. The appropriate tolerance for a real calculation depends upon the problem to be solved and the limitations of the computer and the algorithm. This is often a very subtle consideration, requiring help from a numerical analyst or some other kind of magician. This can be accomplished using , which takes as arguments a number of items that are printed as error messages. Try this during a boring lecture: Set your calculator to radians mode and then repeatedly press the button until you obtain the fixed point. → (pronounced “maps to”) is the mathematician’s way of writing (lambda(y) (/ x y)) , that is, the function whose value at Submitted by Visitor on 29 January 2012 - 7:06am. I could read a book about this wioutht finding such real-world approaches! Submitted by Visitor on 4 June 2013 - 10:36pm. Submitted by Visitor on 22 October 2013 - 11:33pm. Submitted by Visitor on 14 January 2014 - 11:43am. Submitted by Visitor on 24 March 2014 - 6:50am. Nice post, I bookmark your blog because I found very good information on your blog, Thanks for sharing more information Quality Services & Training Pvt.Ltd.	{"url":"http://sicpinclojure.com/sicp/1-3-3-procedures-general-methods","timestamp":"2014-04-25T03:05:22Z","content_type":null,"content_length":"79000","record_id":"<urn:uuid:cad981b8-1935-4bdf-ad2f-de79454105fd>","cc-path":"CC-MAIN-2014-15/segments/1398223207985.17/warc/CC-MAIN-20140423032007-00507-ip-10-147-4-33.ec2.internal.warc.gz"}
Numeracy Resources for teachers Interactive Maths SATs Revision, Flash Cards, Quizzes, Worksheets, Games and Word problems to solve. Everything you need to help you improve your maths is right here on Woodlands Web. An excellent list of interactive tools Educational Online Games and Activities Interactive Resources Interactive Resources Maths Packs contain over 55 numeracy tools for use on an interactive whiteboard, projector or large display. Areas covered include pie charts, bar charts, flash cards, ordering, tally charts, probability, angles, number squares, telling the time, properties of polygons, geoboards, target boards, number lines, function machines, counting on/back, line graphs, Cuisenaire rods, fractions, estimation, coordinates, place value, percentages, reflection and more! Interactive online resources From the Numeracy Strategy website. Scroll to the bottom of the page. Maths Year 2000 - now called counton	{"url":"http://resources.woodlands-junior.kent.sch.uk/teacher/maths.html","timestamp":"2014-04-18T23:20:19Z","content_type":null,"content_length":"34013","record_id":"<urn:uuid:baaa0dcb-1a3a-4984-a8ad-0477a855bf33>","cc-path":"CC-MAIN-2014-15/segments/1397609535535.6/warc/CC-MAIN-20140416005215-00241-ip-10-147-4-33.ec2.internal.warc.gz"}
Summary: Computer Science 254 Spring 2000 Instructor: Professor R. Alperin, Duncan Hall 239, Telephone: 924-5066, Office hours: 2:45-4:00 M, 11:00-12:15 W, 6:45-8:00 MW or by appointment, Text: Introduction to the Theory of Computation by Michael Sipser, PWS Course: Theory of Computation The prerequisite is CS 154 with a grade of B or better. The main goal of this class is to introduce students to the theoretical foundations of computer science, specifically the Chomsky hierarchy of formal languages, Turing machines, the Church-Turing thesis, and the various com- plexity classes. We shall discuss the relations between P and NP. A project report describing (with proofs) an NP-complete problem will be assigned. Your final grade is based on a point total on tests (50%), homework (25%) and your written/oral project report (25%). Students must prepare a notebook of homework assignments which will be collected regularly. ·Chapter 1: Regular Languages (review) (1) ·Chapter 2: Context-Free Languages (review) (1)	{"url":"http://www.osti.gov/eprints/topicpages/documents/record/133/3089260.html","timestamp":"2014-04-19T08:22:41Z","content_type":null,"content_length":"8122","record_id":"<urn:uuid:7a17f29d-eeac-4216-a51b-0f12b3f1c5a5>","cc-path":"CC-MAIN-2014-15/segments/1397609536300.49/warc/CC-MAIN-20140416005216-00520-ip-10-147-4-33.ec2.internal.warc.gz"}
The SIS Great Circle Epidemic model Neal, Peter (2008) The SIS Great Circle Epidemic model. Journal of Applied Probability, 45 (2). pp. 513-530. Full text not available from this repository. We consider a stochastic SIS model for the spread of an epidemic amongst a population of n individuals that are equally spaced upon the circumference of a circle. Whilst infectious, an individual, i say, makes both local and global infectious contacts at the points of homogeneous Poisson point processes. Global contacts are made uniformly at random with members of the entire population, whilst local contacts are made according to a contact distribution centred upon the infective. Individuals at the end of their infectious period return to the susceptible state and can be reinfected. The emphasis of the paper is on asymptotic results as the population size n → ∞. Therefore, a contact process with global infection is introduced representing the limiting behaviour as n → ∞ of the circle epidemics. A branching process approximation for the early stages of the epidemic is derived and the endemic equilibrium of a major outbreak is obtained. Furthermore, assuming exponential infectious periods, the probability of a major epidemic outbreak and the proportion of the population infectious in the endemic equilibrium are shown to satisfy the same equation which characterises the epidemic process. Item Type: Article Journal or Publication Title: Journal of Applied Probability Uncontrolled Keywords: SIS epidemic ; contact process ; great circle model ; endemic equilibrium ; branching process Subjects: Q Science > QA Mathematics Departments: Faculty of Science and Technology > Mathematics and Statistics ID Code: 59736 Deposited By: ep_importer_pure Deposited On: 05 Nov 2012 11:25 Refereed?: Yes Published?: Published Last Modified: 09 Oct 2013 15:43 Identification Number: URI: http://eprints.lancs.ac.uk/id/eprint/59736 Actions (login required)	{"url":"http://eprints.lancs.ac.uk/59736/","timestamp":"2014-04-20T03:49:18Z","content_type":null,"content_length":"16511","record_id":"<urn:uuid:cb8d55f4-e328-4300-8591-dca57ddb9eb9>","cc-path":"CC-MAIN-2014-15/segments/1397609537864.21/warc/CC-MAIN-20140416005217-00223-ip-10-147-4-33.ec2.internal.warc.gz"}
Sound propagation through atmospheric turbulence: Multifractal ASA 125th Meeting Ottawa 1993 May 5aPA7. Sound propagation through atmospheric turbulence: Multifractal phase fluctuations. R. H. Mellen G. Siling Marine Sci. Inst., Univ. of Connecticut, Groton, CT 06340 Measurements of phase fluctuations in sound propagation through turbulent air show frequency spectra that approximate the Kolmogorov (beta)=5/3 scaling law over several decades. This suggests a fractal-like process for which the apparent fractal dimension would be D=(5-(beta))/2(approximately equal to)5/3. However, most natural phenomena are found to be multifractal rather than monofractal. Multifractal theory treats, not only first and second moments of the process, but also the relation between moments (including nonintegral). For monofractals, this relation is simply a linear function of the moment number and a codimension 0(less than or equal to)C[sub 1](less than or equal to)1. The degree of multifractality 0(less than or equal to)(alpha)(less than or equal to)2 is determined from systematic deviations from linearity. The parameters (alpha), (beta), and C[sub 1] are all indicators of the nature of the nonlinear energy cascade. Analysis of experimental data obtained at 5 kHz, range (approximately equal to)4 m and wind speed (approximately equal to)12 m/s is reported here. Results indicate that phase fluctuations are ``hard multifractal'' ((alpha)>1), which is comparable to measures of velocity fluctuations in atmospheric turbulence.	{"url":"http://www.auditory.org/asamtgs/asa93ott/5aPA/5aPA7.html","timestamp":"2014-04-20T11:09:44Z","content_type":null,"content_length":"1911","record_id":"<urn:uuid:082173d8-fb08-4c46-828a-588b4e1f70e9>","cc-path":"CC-MAIN-2014-15/segments/1397609538423.10/warc/CC-MAIN-20140416005218-00099-ip-10-147-4-33.ec2.internal.warc.gz"}
Got Homework? Connect with other students for help. It's a free community. • across MIT Grad Student Online now • laura* Helped 1,000 students Online now • Hero College Math Guru Online now Here's the question you clicked on: It costs $300 to join the new Superfit Gym. You then pay $15 each month and $2 each time you work out. Carlo thinks he will use the gym about 20 times each month for a year. Part A : Write An Expression You can use to calculate the cost of SuperFit Gym For One Year. Part B : Use Your Expression to calculate the cost of using the SuperFit Gym for one year. • one year ago • one year ago Your question is ready. Sign up for free to start getting answers. is replying to Can someone tell me what button the professor is hitting... • Teamwork 19 Teammate • Problem Solving 19 Hero • Engagement 19 Mad Hatter • You have blocked this person. • ✔ You're a fan Checking fan status... Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy. This is the testimonial you wrote. You haven't written a testimonial for Owlfred.	{"url":"http://openstudy.com/updates/5053a401e4b02986d3705ef5","timestamp":"2014-04-17T06:46:58Z","content_type":null,"content_length":"53821","record_id":"<urn:uuid:53b6abc9-2dfd-415d-81c0-991bbd49de3d>","cc-path":"CC-MAIN-2014-15/segments/1397609526311.33/warc/CC-MAIN-20140416005206-00625-ip-10-147-4-33.ec2.internal.warc.gz"}
Tarzana Algebra 1 Tutor Find a Tarzana Algebra 1 Tutor ...I also have experience tutoring children in grades 1 through 6 in both reading and mathematics. My stellar study skills have helped me to obtain the highest marks throughout high school, college, and graduate school. I also have experience teaching study skills to others. 44 Subjects: including algebra 1, English, reading, writing ...I have a California teaching credential and a Masters in Mathematics Education from UCLA. I taught over 30 years in high school math and science. I taught several years in elite private schools (Brentwood, Marymount, Loyola) and I'm familiar with the private school requirements and curriculum. 72 Subjects: including algebra 1, reading, writing, English ...I believe in providing fresh insights and strive to connect math material with a student's interests. I have a Master of Arts degree and a credential in Special Education. I understand when students find reading and comprehension frustrating. 15 Subjects: including algebra 1, reading, accounting, ESL/ESOL As a former employee at a summer camp, I have a lot of experience not only with interacting with children and special needs adults in general, but also with gently guiding them toward their desired goals. I love working with kids, and I understand firsthand what it's like to feel my own academic po... 17 Subjects: including algebra 1, English, reading, public speaking ...I hope to share my love and enthusiasm with a fun, knowledgeable lessons to reach your goal to pass your math class and stay current with the class. I tutor Algebra Pre, I, II, Geometry, Trig and Pre-Calc. I have been a tutor for over 30 years and hope to be the Tutor you choose to build a goal to work together to be learn whatever level of math you are at. 7 Subjects: including algebra 1, geometry, algebra 2, precalculus	{"url":"http://www.purplemath.com/tarzana_ca_algebra_1_tutors.php","timestamp":"2014-04-19T23:26:56Z","content_type":null,"content_length":"23922","record_id":"<urn:uuid:a3e131f3-3a94-46eb-a236-168204634c55>","cc-path":"CC-MAIN-2014-15/segments/1397609537754.12/warc/CC-MAIN-20140416005217-00341-ip-10-147-4-33.ec2.internal.warc.gz"}
Replication Is Not Coincidence: Reply to Iverson, Lee, and Wagenmakers (2009) Lecoutre, Bruno, Killeen, Peter R., Psychonomic Bulletin & Review Iverson, Lee, and Wagenmakers (2009) claimed that Killeen's (2005) statistic p^sub rep^ overestimates the "true probability of replication." We show that Iverson et al. confused the probability of replication of an observed direction of effect with a probability of coincidence-the probability that two future experiments will return the same sign. The theoretical analysis is punctuated with a simulation of the predictions of p^sub rep^ for a realistic random effects world of representative parameters, when those are unknown a priori. We emphasize throughout that p^sub rep^ is intended to evaluate the probability of a replication outcome after observations, not to estimate a parameter. Hence, the usual conventional criteria (unbiasedness, minimum variance estimator) for judging estimators are not appropriate for probabilities such as p and p^sub rep^. Iverson, Lee, and Wagenmakers (2009; hereafter, ILW) claimed that Killeen's (2005) p^sub rep^ "misestimates the true probability of replication" (p. 424). But it was never designed to estimate what they call the true probability of replication (the broken lines named "Truth" in their Figure 1). We clarify that by showing that their "true probability" for a fixed parameter δ-their scenario-is the probability that the effects of two future experiments will agree in sign, given knowledge of the parameter δ. We call this the probability of coincidence and show that its goals are different from those of p^sub rep^, the predictive probability that a future experiment will return the same sign as one already observed. ILW's "truth" has nothing to do with the "true probability of replication" in its most useful instantiation, the one proposed by Killeen (2005). The "True Probability of Replication" Statistical analysis of experimental results inevitably involves unknown parameters. Suppose that you have observed a positive standardized difference of d^sub obs^ = 0.30 between experimental and control group means having n = 10 subjects each.1 You assume the usual normal model with an unknown true effect size δ and (for simplification) a known variance. What is the probability of getting again a positive effect in a replication (d^sub rep^ > 0)? If you are ready to assume a particular value for δ, the answer is trivial: It follows from the sampling distribution of d^sub rep^, given this δ. The true probability of replication is the (sampling) probability [varphi]+\|δ (a function of δ and n) that a normal variable with a mean of δ and a variance of 2/n exceeds 0: [varphi]+\|δ = φ( δvn/2). If you hypothesize that δ is 0, then [varphi]+\|0 = 0.5. Some other values, for different hypothesized δs, are [varphi]+\|0.50 = 0.868, [varphi]+\|1.00 = 0.987, [varphi]+\|2.00 [asymptotically =] 1. These values do not depend on d^sub obs^: It would not matter that d^sub obs^ = 0.30 or d^sub obs^ = 1.30. Of course, for reasons of symmetry, [varphi]+\|-δ = 1-[varphi]+\|δ. What was novel about Killeen's (2005) statistic prep was his attempt to move away from the assumption of knowledge of parameter values, and the "true replication probabilities" [varphi]+\|δ that can be calculated if you know them. The Bayesian derivation of p^sub rep^ involves no knowledge about δ other than the effect size measured in the first experiment, d^sub obs^. This is made explicit by assuming an uninformative (uniform) prior before observations-hence, the associated posterior distribution for δ: a normal distribution centered on d^sub obs^ with a variance of 2/n. To illustrate the nature and purpose of p^sub rep^, consider the steps one must follow to simulate its value, starting with a known first observation: Repeat the two following steps many times: (1) generate a value δ from a normal(d^sub obs^,2/n) distribution; (2) given this δ value, generate a value d^sub rep^ from a normal(δ,2/n); and then compute the proportion of d^sub rep^ having the same sign as d^sub obs^. Each particular value of d^sub rep^ is the realization of a particular experiment assuming a true effect size δ, and corresponds to a "true probability of replication" [varphi]+\|δ (if d^sub obs^ > 0) or 1-[varphi]+\|δ (if d^sub obs^ , 0). …	{"url":"http://www.questia.com/read/1P3-2018232111/replication-is-not-coincidence-reply-to-iverson","timestamp":"2014-04-19T00:27:56Z","content_type":null,"content_length":"137210","record_id":"<urn:uuid:a3b55303-3b0c-4992-837d-d3c4f955095f>","cc-path":"CC-MAIN-2014-15/segments/1397609535535.6/warc/CC-MAIN-20140416005215-00552-ip-10-147-4-33.ec2.internal.warc.gz"}
evaluate the integral using FTC April 13th 2009, 10:45 AM evaluate the integral using FTC ∫10 (e^(-9x)) / (e^(-9x) + 6)) dx Evaluate the integral using the fundamental theorem of calculus. I don't know how to do rational numbers, i know that it is complex because of the quotient rule for derivatives anyway, here's mywork so far ∫from 10 to 8 (e^(-9x))/(e^(-9x)) + ∫from 10 to 8 (e^(-9x))/6 ∫from 10-8 (1) + ∫from 10 to 8 (e^(-9x))/6 2 + 1/6 ∫from 10 to 8 (e^(-9x)) 2 + 1/6 [((e^(-90+1))/(-90+1)) - ((e^(-72+1))/(-72+1))] 2 + 1/6 [(e^(-89)/(-89)) - (e^(-71)/(-71))] this is wrong, please help :( April 13th 2009, 12:40 PM Just let $u=e^{-9x}\Rightarrow du=-9e^{-9x}\,dx.$ As for your work... You cannot split fractions in this way. $\frac a{b+c}$ is not, in general, equal to $\frac ab+\frac ac.$ Also, you are integrating from 8 to 10, not 10 to 8 (unless you wrote it wrong at the top of your post). 2 + 1/6 [((e^(-90+1))/(-90+1)) - ((e^(-72+1))/(-72+1))] Okay, even if we assume that your previous work was correct, this line does not make sense. You can only apply the power rule when the variable is not in the exponent. For an exponential function like $e^{-9x},$ you need to use the following rules. $\frac d{dx}\left[e^x\right]=e^x$ $\int e^x\,dx=e^x+C$ If the base is something other than $e,$ you can use $\frac d{dx}\left[a^x\right]=(\ln a)a^x$ $\int a^x\,dx=\frac{a^x}{\ln a}+C$	{"url":"http://mathhelpforum.com/calculus/83521-evaluate-integral-using-ftc-print.html","timestamp":"2014-04-17T03:54:44Z","content_type":null,"content_length":"7434","record_id":"<urn:uuid:171e96e6-d71c-4309-91b8-cb87d67af16b>","cc-path":"CC-MAIN-2014-15/segments/1397609526252.40/warc/CC-MAIN-20140416005206-00534-ip-10-147-4-33.ec2.internal.warc.gz"}
Calculus Tutors in Pasadena, CA 91106 Math, Science, and Foreign Language Tutor I am currently a senior Math major at Caltech. I tutored throughout high school (algebra, , statistics, chemistry, physics, Spanish, and Latin) and tutored advanced math classes during college. Above all other things, I love to learn how other people learn... Offering 10+ subjects including calculus	{"url":"http://www.wyzant.com/91107_calculus_tutors.aspx","timestamp":"2014-04-17T10:00:08Z","content_type":null,"content_length":"60174","record_id":"<urn:uuid:b8a6e68f-bf8a-4866-abe4-e550ecf7c36a>","cc-path":"CC-MAIN-2014-15/segments/1397609527423.39/warc/CC-MAIN-20140416005207-00594-ip-10-147-4-33.ec2.internal.warc.gz"}
Coplay Math Tutor Find a Coplay Math Tutor ...Some of those I have tutored include students from middle school all the way up to college, and range in age from 12 to 60. When I was younger, I even tutored one of my older sisters AND my father in algebra, as neither reached that level in high school. One of the things I emphasize is learning how to do basic math without the use of calculators. 11 Subjects: including linear algebra, algebra 1, algebra 2, calculus My name is Karyn, and I currently live in Macungie, PA. I have lived in Lehigh County all of my life and attended schools here. I graduated high school in 1983 from William Allen High School, and I graduated with a degree in Mathematics from Cedar Crest College. 9 Subjects: including trigonometry, linear algebra, probability, ACT Math I am a tutor with over five years of experience teaching math, science, and humanities at the secondary level. I have worked with students from all backgrounds; I have also worked extensively with children with disabilities. I hold a BA in Anthropology from Florida Atlantic University and am currently a graduate student in the Anthropology Department. 55 Subjects: including linear algebra, probability, SAT math, ACT Math ...I have taught Physical Science in Philadephia, Earth Science in Allentown, AP Physics in Hamburg, and I currently teach Earth Science with Commonwealth Connections Academy. In addition to my Science Education degree I have earned a B.S. in Geoscience Engineering and I am currently working toward... 31 Subjects: including geometry, probability, SAT math, discrete math ...I have passed the Chemistry and the Physical Sciences Praxis exams with excellence, scoring in the top 15% of all those who have taken the exams. Score reports are available upon request. Since I am working to be a teacher, I have all my clearances in order (also available upon request) and updated annually, most recently in August, 2010. 14 Subjects: including trigonometry, biochemistry, algebra 1, algebra 2	{"url":"http://www.purplemath.com/coplay_pa_math_tutors.php","timestamp":"2014-04-20T01:58:54Z","content_type":null,"content_length":"23769","record_id":"<urn:uuid:6073eed8-db4e-4f86-b88e-89301fd29726>","cc-path":"CC-MAIN-2014-15/segments/1398223205375.6/warc/CC-MAIN-20140423032005-00143-ip-10-147-4-33.ec2.internal.warc.gz"}
ALEX Lesson Plans Subject: Mathematics (6) Title: Nets: Message in a Box Description: In cooperative/collaborative groups, students will compare and contrast a two-dimensional pattern and a three-dimensional shape. Students will use a net to label and then construct a rectangular prism. Students will find the surface area of a rectangular prism. As a final performance task, students will create a message box. Subject: Mathematics (5 - 6), or Science (5 - 6) Title: Grow a GEM Description: Students will grow crystals out of different substances. Students will also document and make a podcast video of the growth of their crystals. Students will make and identify different geometric shapes. This lesson plan was created as a result of the Girls Engaged in Math and Science, GEMS Project funded by the Malone Family Foundation. Subject: Mathematics (6 - 7) Title: Painting the Pyramids Description: The students will find the area of each two dimensional figure on a net of a square pyramid. In groups, students will cut out the net and create a square pyramid. Groups will then discuss how to find the lateral area and the total surface area of the solid. This lesson plan was created by exemplary Alabama Math Teachers through the AMSTI project. Subject: Mathematics (6 - 7) Title: Cutting the CHEESE Description: The students will find the area of each two dimensional figure on a net of a triangular prism. In groups, students will cut out the net and create a triangular prism. Groups will then discuss how to find the lateral area and the total surface area of the solid. This lesson plan was created by exemplary Alabama Math Teachers through the AMSTI project. Subject: Mathematics (6 - 8) Title: Nifty Nets Description: During this activity, students will create nets for prisms. They will find the volume and surface area of the shapes. They will also use interactive activities to review three-dimensional shapes.This lesson plan was created as a result of the Girls Engaged in Math and Science University, GEMS-U Project. Subject: Mathematics (6 - 7) Title: "Movin' On Up" Description: Students will use their knowledge of scale factor to enlarge a picture to scale. They will then use PhotoStory to create a collage of their pictures. This lesson plan was created as a result of the Girls Engaged in Math and Science University, GEMS-U Project. Subject: Mathematics (6 - 7) Title: Thinking outside the "BOX" Description: The students will find the area of each two dimensional figure on a net of a rectangular prism. In groups, students will cut out the net and create a rectangular prism. Groups will then discuss how to find the lateral area and the total surface area of the solid. This lesson plan was created by exemplary Alabama Math Teachers through the AMSTI project. Subject: Mathematics (5 - 7), or Technology Education (6 - 8) Title: Ping Pong Madness Description: In this lesson, students will use their knowledge of 3D shapes to create packages for ping pong balls. They must create small, medium and large packages that are cost effective and stack easily. They will make nets of the their packages and find the volume and surface area of each. Students will present the information using a multi-media presentation and a spreadsheet software. This lesson plan was created as a result of the Girls Engaged in Math and Science University, GEMS-U Project. Subject: Mathematics (6 - 12), or Technology Education (9 - 12) Title: Golden Ratios of the Body, Architecture, and Nature Description: Students will study the golden ratio as it relates to human body measurements, architecture, and nature. Students will use a desktop publishing program to create a poster. The poster will have digital photos of themselves, architecture samples, or nature examples. Students will also include a spreadsheet with the lengths, widths, and length/width ratios of the samples included in the photos. Thinkfinity Lesson Plans Subject: Mathematics Title: Cubes Everywhere Add Bookmark Description: In this Illuminations lesson, students use cubes to develop spatial thinking and review basic geometric principles through real-life applications. Students are given the opportunity to build and take apart structures based on cubes. Thinkfinity Partner: Illuminations Grade Span: 6,7,8 Subject: Mathematics Title: Exploring the Isometric Drawing Tool Add Bookmark Description: In this lesson, one of a multi-part unit from Illuminations, students explore using an isometric drawing tool and gain practice and experience in manipulating drawings. They explore polyhedra using different representations and perspectives. Thinkfinity Partner: Illuminations Grade Span: 6,7,8 Subject: Mathematics Title: Using Cubes and Isometric Drawings Add Bookmark Description: In this unit of six lessons, from Illuminations, students explore polyhedra using different representations and perspectives for three dimensional block figures. In addition, students examine area and volume concepts for block figures within this context. Thinkfinity Partner: Illuminations Grade Span: 6,7,8 Subject: Mathematics Title: Front-right-top Views Add Bookmark Description: This reproducible transparency, from an Illuminations lesson, depicts an isometric drawing of a three-dimensional figure, along with its front, right, and top views. Thinkfinity Partner: Illuminations Grade Span: 6,7,8 Subject: Mathematics Title: Do They Match? Add Bookmark Description: In this lesson, one of a multi-part unit from Illuminations, students use three dimensional figures they have constructed to determine when two isometric drawings can represent the same shape. They also determine what possible shapes might have the same isometric drawing and explain their reasoning. Thinkfinity Partner: Illuminations Grade Span: 6,7,8 Subject: Mathematics Title: Are They Possible? Add Bookmark Description: In this lesson, one of a multi-part unit from Illuminations, students examine some isometric drawings that seem to be impossible. They investigate one method that Dutch artist M.C. Escher used to create such impossible figures. Thinkfinity Partner: Illuminations Grade Span: 6,7,8 Subject: Mathematics Title: Building Using the Front-Right-Top View Add Bookmark Description: In this lesson, one of a multi-part unit from Illuminations, students explore drawing the front-right-top view when given a three dimensional figure built from cubes. Students also explore building a three dimensional figure when given the front-right-top view. Thinkfinity Partner: Illuminations Grade Span: 6,7,8 Subject: Mathematics Title: Isometric Dot Paper Add Bookmark Description: Print this isometric grid worksheet and use it to easily draw three-dimensional figures, such as cubes. Thinkfinity Partner: Illuminations Grade Span: 6,7,8 Subject: Mathematics Title: Mat Plans Add Bookmark Description: In this lesson, one of a multi-part unit from Illuminations, students explore drawing a mat plan when given a three dimensional figure built from cubes. Students also explore building a three dimensional figure when given the mat plan. Thinkfinity Partner: Illuminations Grade Span: 6,7,8 Subject: Mathematics Title: Do They Match? Overhead Add Bookmark Description: This reproducible transparency, from an Illuminations lesson, depicts several pairs of isometric drawings of three-dimensional figures. Students determine whether the drawings in each pair represent the same shape as one another. Thinkfinity Partner: Illuminations Grade Span: 6,7,8 Subject: Language Arts,Mathematics Title: Go the Distance Add Bookmark Description: This lesson is the fourth part of a four-part Illuminations unit titled '' Analyzing Numeric and Geometric Patterns of Paper Pool.'' The interactive paper pool game in this unit provides an opportunity for students to further develop their understanding of ratio, proportion, and least common multiple. At the end of the lesson, students write reports on their findings. This resource is referenced in the Illuminations unit titled '' Analyzing Numeric and Geometric Patterns of Paper Pool'' and is related to the Illuminations lessons titled '' Paper Pool Game,'' '' Explore More Tables,'' '' Look for Patterns.'' Thinkfinity Partner: Illuminations Grade Span: 6,7,8 Subject: Mathematics Title: Are They Possible? Overhead Add Bookmark Description: This reproducible transparency, from an Illuminations lesson, depicts several isometric drawings of several '' impossible'' figures. Thinkfinity Partner: Illuminations Grade Span: 6,7,8 Subject: Mathematics Title: Surface Area Add Bookmark Description: This reproducible transparency, from an Illuminations lesson, features equations for finding the ratios for computing the surface area of cylinders and rectangular prisms. Thinkfinity Partner: Illuminations Grade Span: 6,7,8 Subject: Mathematics Title: Mat Plans: Overhead Add Bookmark Description: This reproducible transparency, from an Illuminations lesson, depicts an isometric drawing of a three-dimensional figure along with its mat plan. Thinkfinity Partner: Illuminations Grade Span: 6,7,8 Subject: Mathematics Title: Isometric Drawing Tool Add Bookmark Description: Create dynamic drawings on isometric dot paper with this interactive tool. Draw 2-D and 3-D figures using edges, faces, or cubes that you can shift, rotate, color, or decompose. Thinkfinity Partner: Illuminations Grade Span: 3,4,5,6,7,8,9,10,11,12 Subject: Mathematics Title: Dynamic Paper Tool Add Bookmark Description: Create customized activity sheets for your classroom! Nets of 3-D shapes, tessellations, coordinate graphs, and more - all based on your input. Thinkfinity Partner: Illuminations Grade Span: K,1,2,3,4,5,6,7,8,9,10,11,12	{"url":"http://alex.state.al.us/plans2.php?std_id=53889","timestamp":"2014-04-20T03:12:13Z","content_type":null,"content_length":"43336","record_id":"<urn:uuid:ebcecd21-d9d7-421d-a471-196e78a06141>","cc-path":"CC-MAIN-2014-15/segments/1397609537864.21/warc/CC-MAIN-20140416005217-00624-ip-10-147-4-33.ec2.internal.warc.gz"}
Haskell: Closest Pairs Algorithm As I mentioned in a post a couple of days ago I’ve been writing the closest pairs algorithm in Haskell and while the brute force version works for small numbers of pairs it starts to fall apart as the number of pairs increases: time ./closest_pairs 100 bf ./closest_pairs 100 bf 0.01s user 0.00s system 87% cpu 0.016 total time ./closest_pairs 1000 bf ./closest_pairs 1000 bf 3.59s user 0.01s system 99% cpu 3.597 total time ./closest_pairs 5000 bf ./closest_pairs 5000 554.09s user 0.36s system 99% cpu 9:14.46 total Luckily there’s a divide and conquer algorithm we can use which brings down the running time from O(n^2) to O(n log(n)) which is significantly quicker as n increases in size. That algorithm is defined like so: 1. Sort points along the x-coordinate 2. Split the set of points into two equal-sized subsets by a vertical line x = x[mid] 3. Solve the problem recursively in the left and right subsets. This will give the left-side and right-side minimal distances d[Lmin] and d[Rmin] respectively. 4. Find the minimal distance d[LRmin] among the pair of points in which one point lies on the left of the dividing vertical and the second point lies to the right (a split pair). 5. The final answer is the minimum among d[Lmin], d[Rmin], and d[LRmin]. By step 4 in which we’ll look for a closest pair where the x and y values are in opposite subsets we don’t need to consider the whole list of points again since we already know that the closest pair of points is no further apart than dist = min(d[Lmin], d[Rmin]). We can therefore filter out a lot of the values by only keeping values which are within dist of the middle x value. If a point is further away than that then we already know that the distance between it and any point on the other side will be greater than dist so there’s no point in considering it. I used the C# version from Rosetta Code as a template and this is what I ended up with: import Data.Maybe import Data.List import Data.List.Split import Data.Function dcClosest :: (Ord a, Floating a) => [Point a] -> (Point a, Point a) dcClosest pairs if length pairs <= 3 then = fromJust $ bfClosest pairs foldl (\closest (p1:p2:_) -> if distance (p1, p2) < distance closest then (p1, p2) else closest) (windowed 2 pairsWithinMinimumDelta) where sortedByX = sortBy compare pairs (leftByX:rightByX:_) = chunk (length sortedByX `div` 2) sortedByX closestPair = if distance closestLeftPair < distance closestRightPair then closestLeftPair else closestRightPair where closestLeftPair = dcClosest leftByX closestRightPair = dcClosest rightByX pairsWithinMinimumDelta = sortBy (compare `on` snd) $ filter withinMinimumDelta sortedByX where withinMinimumDelta (x, _) = abs (xMidPoint - x) <= distance closestPair where (xMidPoint, _) = last leftByX If the number of pairs is 3 or less then we can just use the brute force algorithm since the whole splitting the list in half thing doesn’t work so well with a list of less than 4 items. The main function is a fold which goes over all the pairs of points where we’ve determined that there might be a closest pair with one point on the left hand side of our ‘sorted by x list’ and the other on the right hand side. We use the ‘windowed‘ function to pair up the points which in this case does something like this: > windowed 2 [(0,0), (1,1), (2,2), (1.1, 1.2)] We pass along the closest pair that we’ve found from pairs of points on the left and right hand sides of the list as our seed value and check whether any of the split pairs are closer together than that one. By the time the fold is finished we will have the closest pair in the list. The code in the where section is used to split the list into two halves, sort it by x and then work out which side of the list has the closest pair. That’s all done recursively and then the last bit of code works out which values we need to consider for the split pairs part of the algorithm. I learnt about the ‘on‘ function while writing this algorithm which makes it really easy to pick a function to sort a collection with e.g. ‘compare `on` snd’ lets us sort a list in ascending order based on the second value in a tuple. One problem with the way I’ve written this algorithm is that it places a lot of focus on the split pair bit of the code when actually a big part of why it works is that we’re sorting it into an order that makes it easier to work with and then dividing the problem by 2 each time. My current thinking is that perhaps I should have had that code in the main body of the function rather than hiding it away in the where section. It isn’t actually necessary to execute the foldl all the way through since we’ll often know there’s not going to be a split pair before we go through all the pairs. I thought it reads pretty nicely as it is thought and it runs pretty quickly as it is anyway! Using the same data set as before (and getting the same answers!): > time ./closest_pairs 1000 dc ./closest_pairs 1000 dc 0.02s user 0.00s system 91% cpu 0.024 total > time ./closest_pairs 5000 dc ./closest_pairs 5000 dc 0.11s user 0.01s system 97% cpu 0.118 total I described the code for generating random numbers in an earlier blog post but I’ll include it again to show how the algorithm is wired up: import Control.Monad.State (State, evalState, get, put) import System.Random (StdGen, mkStdGen, random) import System type R a = State StdGen a rand :: R Double rand = do gen <- get let (r, gen') = random gen put gen' return r randPair :: R (Double, Double) randPair = do x <- rand y <- rand return (x,y) runRandom :: R a -> Int -> a runRandom action seed = evalState action $ mkStdGen seed normals :: R [(Double, Double)] normals = mapM (\_ -> randPair) $ repeat () main = do args <- getArgs let numberOfPairs = read (head args) :: Int if length args > 1 && args !! 1 == "bf" then putStrLn $ show ( (bfClosest $ take numberOfPairs $ runRandom normals 42)) putStrLn $ show ( (dcClosest $ take numberOfPairs $ runRandom normals 42)) The full code is on hpaste if anyone has any suggestions for how to improve it.	{"url":"http://www.markhneedham.com/blog/2012/05/09/haskell-closest-pairs-algorithm/","timestamp":"2014-04-19T01:48:39Z","content_type":null,"content_length":"50871","record_id":"<urn:uuid:6bbf6fbe-d45e-4f3a-95df-71ac79ecd849>","cc-path":"CC-MAIN-2014-15/segments/1397609535745.0/warc/CC-MAIN-20140416005215-00217-ip-10-147-4-33.ec2.internal.warc.gz"}
Flower Mound Trigonometry Tutor Find a Flower Mound Trigonometry Tutor ...I passed my applied ordinary differential equations class with a B+ after acing 3rd semester calculus. I also wrote dozens of C/C++ computer programs to solve differential equations using several iterative methods. Back in 1992 I was a college instructor teaching a C/C++ programming language course (CIS 233) at Sinclair Community College in Dayton, OH. 48 Subjects: including trigonometry, chemistry, physics, calculus ...The last part of the course deals with limits and is actually an introduction to Calculus. I have taught Trigonometry for several years in local high schools. It can be difficult at first but most students catch on quickly with some one on one tutoring. 15 Subjects: including trigonometry, chemistry, calculus, geometry ...In his free time, Drew enjoys either picking up his guitar or sitting down at the piano. Between work, school, and family, those times do not come frequently. But he enjoys what he does, especially having the satisfaction of helping others achieve success in academics. 37 Subjects: including trigonometry, Spanish, chemistry, English I am a semi-retired civil engineer that participated in the troops to teacher program at the end of my military career with emphasis on math and science in 4th through 8th grade. I held a teaching certificate for a number of years for this age group and subjects in the Commonwealth of Virginia, but... 11 Subjects: including trigonometry, geometry, algebra 1, algebra 2 ...The math courses I took in college included Advanced Calculus, Linear Algebra, Complex Analysis and Abstract Algebra. During my years as a graduate student at Duke University, I tutored undergraduates and students in the MBA program. I am certified in Secondary Math in the State of Texas and have taught Algebra II in the Irving ISD. 82 Subjects: including trigonometry, chemistry, reading, English	{"url":"http://www.purplemath.com/Flower_Mound_trigonometry_tutors.php","timestamp":"2014-04-17T07:25:05Z","content_type":null,"content_length":"24410","record_id":"<urn:uuid:cdc1a14e-e863-4029-a57f-beed10c8ccf3>","cc-path":"CC-MAIN-2014-15/segments/1398223206647.11/warc/CC-MAIN-20140423032006-00269-ip-10-147-4-33.ec2.internal.warc.gz"}
Math Forum Discussions - internal pattern uncovered Re: Calendar formula for 2nd Wednesday of<br> each successive month Date: Jan 25, 2013 5:37 PM Author: plutonium.archimedes@gmail.com Subject: internal pattern uncovered Re: Calendar formula for 2nd Wednesday of<br> each successive month Now then, I seek an internal pattern, not really the detailed answer. Because I am pressed for time. So how would a highly logical person attack this problem? Suppose the Calender were only 28 days per month for the 12 months. Suppose 1 January 2013 was a Monday. Then the 1st of every month would be Monday also. So that the 2nd Wednesday of every month would be a constant 10 day wait. But now suppose the Calendar had 29 days to January, 28 for February, 29 for March and alternating similar to the alternation of 31 to 30 days in the usual calendar. How would that affect the constant pattern of 10 day wait? Well, if January started 1st as Monday and had 29 days then February 1st would be Tuesday and since it has 28 days, March 1st would be Tuesday also, but since March has 29 days, April 1st would be a Wednesday. So the internal pattern for a 29 alternating with 28 days is that we have ONE Monday being the first of the month, TWO Tuesdays being the 1st day of the month, TWO Wednesdays being the first of the month, etc. So the internal pattern of the normal calendar is that we can expect TWO Wednesdays being the 1st of the Month in any random calendar year.	{"url":"http://mathforum.org/kb/plaintext.jspa?messageID=8152490","timestamp":"2014-04-21T05:46:31Z","content_type":null,"content_length":"2369","record_id":"<urn:uuid:7ed6cfc1-a55b-413c-8454-aca55e6f03c5>","cc-path":"CC-MAIN-2014-15/segments/1397609539493.17/warc/CC-MAIN-20140416005219-00411-ip-10-147-4-33.ec2.internal.warc.gz"}
An Olist is an ordered list. The main function of this module is the implementation of the finite subset structure of a given type a. Finite sets are represented as ordered lists and the basic set functions and relations like union, intersection, included etc. are provided. The Olist type The construction and test for ordered lists For example, > olist ["b", "c", "b", "a", "c", "a"] As the example shows, multiple occuring members are deleted. (The implementation builts the ordered list with component-wise insert and that is not an optimal sorting algorithm in general. But it is optimal, when the argument is an already ordered list. We use olist only as a an additional safety-mechanism for functions like ext :: p -> [a] -> p, where in most cases the second argument will usually be an Olist a value, anyway.) Checks if the given argument is ordered. The empty list Returns the empty list [], i.e. > Olist.empty (Note, that there is also an empty function in the Costack module.) Checks on emptiness; i.e. it is the same as the Haskell native null. > isEmpty [1,2,3] Singular operations on ordered lists For example, > member 7 [3,5,7,9] > 4 `member` [2,3,4,5] For example, > insert 7 [3,5,9,11] > insert 7 [3,5,7,9,11] For example, > delete 7 [3,5,7,9,11] > delete 7 [3,5,9,11] The common binary operations on sets These functions all assume, that the arguments are actually Olist values. Otherwise, the function doesn't terminate with an error, it just produces unintended results. Implementation of ⊆ on (finite) sets. For example, > included "acd" "abcd" -- recall, that "acd" is the list ['a', 'c', 'd'] > [2,4] `included` [1,2,3,4,5] Implementation of the strict version ⊂ of ⊆, i.e. the first argument must be included, but different to the second one. Two finite sets, i.e. two ordered lists are disjunct iff they do not have a common member. For example > disjunct "acd" "bef" > "abc" `disjunct` "bef" > [] `disjunct` [1,2,3] Two finite sets are properly disjunct iff they are disjunct and none of them is empty. > [] `properlyDisjunct` [1,2,3] The equality of two finite sets; actually it is just another name for (==) on ordered lists. The implementation of ∪, for example > [1,2,4,5] `union` [1,3,5,7] The implementation of ∩, for example > [1,2,4,5] `intersection` [1,3,5,7] Implementation of the difference operator \ on sets. For example, > [1,2,4,5] `difference` [1,3,5,7] The opposition or symmetric difference S∇T of two sets S, T is defined as (S\T)∪(T\S). For example, > [1,2,4,5] `opposition` [1,3,5,7] Returns the union of a list of ordered lists. For example, > unionList [[1,3,5], [1,2,3], [1,5,9]] > unionList [] Returns the intersection of a list of ordered lists. The result is undefined for the empty list. > intersectionList [[1,3,5], [1,2,3], [1,5,9]] > intersectionList [] *** Exception: Olist.intersectionList: not defined for empty list argument	{"url":"http://hackage.haskell.org/package/PropLogic-0.9.0.4/docs/Olist.html","timestamp":"2014-04-18T17:20:12Z","content_type":null,"content_length":"18542","record_id":"<urn:uuid:b2fab147-5d4e-4d95-ade5-90d223c1d8d2>","cc-path":"CC-MAIN-2014-15/segments/1397609533957.14/warc/CC-MAIN-20140416005213-00051-ip-10-147-4-33.ec2.internal.warc.gz"}
Everett, MA Statistics Tutor Find an Everett, MA Statistics Tutor ...I strive to help students understand the core concepts and building blocks necessary to succeed not only in their current class but in the future as well. I am a second year graduate student at MIT, and bilingual in French and English. I earned my high school diploma from a French high school, as well as a bachelor of science in Computer Science from West Point. 16 Subjects: including statistics, French, elementary math, algebra 1 ...I like to find the right balance between identifying patterns through the repetition of a given category of problem, and asking more conceptual questions. Advanced algebra was one of my favorite subjects in graduate school, where I earned an "A" in at least three or four such courses. The same concepts are in elementary algebra, and I have a good amount of experience tutoring at this level. 29 Subjects: including statistics, reading, English, writing ...I also bring an energy and love of my subject that helps students connect with their work. My creativity and an ability to connect math to real world applications, and dedication to my students are some of the things that set me apart as a teacher. I have my masters plus extensive additional coursework. 23 Subjects: including statistics, physics, calculus, geometry ...I'm a good teacher, listen and explain things well, enjoy teens and am patient and understanding. I have excellent tutoring references. I am the father of 3 teens, and have been a soccer coach, youth group leader, and scouting leader. 15 Subjects: including statistics, physics, calculus, geometry ...I researched material for class lectures and exams, and I graded exams. I have taken and excelled at numerous sociology classes during my years of schooling. I have also tutored a multitude of students for their sociology classes, and all of them have received excellent grades. 67 Subjects: including statistics, reading, English, calculus Related Everett, MA Tutors Everett, MA Accounting Tutors Everett, MA ACT Tutors Everett, MA Algebra Tutors Everett, MA Algebra 2 Tutors Everett, MA Calculus Tutors Everett, MA Geometry Tutors Everett, MA Math Tutors Everett, MA Prealgebra Tutors Everett, MA Precalculus Tutors Everett, MA SAT Tutors Everett, MA SAT Math Tutors Everett, MA Science Tutors Everett, MA Statistics Tutors Everett, MA Trigonometry Tutors Nearby Cities With statistics Tutor Arlington, MA statistics Tutors Boston statistics Tutors Brighton, MA statistics Tutors Cambridge, MA statistics Tutors Charlestown, MA statistics Tutors Chelsea, MA statistics Tutors East Boston statistics Tutors Malden, MA statistics Tutors Medford, MA statistics Tutors Melrose, MA statistics Tutors Revere, MA statistics Tutors Saugus statistics Tutors Somerville, MA statistics Tutors Winchester, MA statistics Tutors Woburn statistics Tutors	{"url":"http://www.purplemath.com/Everett_MA_Statistics_tutors.php","timestamp":"2014-04-18T09:02:56Z","content_type":null,"content_length":"24200","record_id":"<urn:uuid:bb14d138-3132-4404-a57f-ad3bfeec0ed5>","cc-path":"CC-MAIN-2014-15/segments/1397609533121.28/warc/CC-MAIN-20140416005213-00120-ip-10-147-4-33.ec2.internal.warc.gz"}
Foundations of Constructive Mathematics. Springer Ergebnisse der Mathematik und ihrer Grenzgebiete 3.Folge - REFLECTIONS ON THE FOUNDATIONS OF MATHEMATICS: ESSAY IN HONOR OF SOLOMON FEFERMAN , 1999 "... In this paper we develop mathematically strong systems of analysis in higher types which, nevertheless, are proof-theoretically weak, i.e. conservative over elementary resp. primitive recursive arithmetic. These systems are based on non-collapsing hierarchies ( n -WKL+ ; n -WKL+ ) of principles ..." Cited by 11 (4 self) Add to MetaCart In this paper we develop mathematically strong systems of analysis in higher types which, nevertheless, are proof-theoretically weak, i.e. conservative over elementary resp. primitive recursive arithmetic. These systems are based on non-collapsing hierarchies ( n -WKL+ ; n -WKL+ ) of principles which generalize (and for n = 0 coincide with) the so-called `weak' König's lemma WKL (which has been studied extensively in the context of second order arithmetic) to logically more complex tree predicates. Whereas the second order context used in the program of reverse mathematics requires an encoding of higher analytical concepts like continuous functions F : X ! Y between Polish spaces X;Y , the more exible language of our systems allows to treat such objects directly. This is of relevance as the encoding of F used in reverse mathematics tacitly yields a constructively enriched notion of continuous functions which e.g. for F : IN ! IN can be seen (in our higher order context) , 1997 "... Goodman's theorem states that intuitionistic arithmetic in all finite types plus full choice, HA ! + AC, is conservative over first-order intuitionistic arithmetic HA. We show that this result does not extend to various subsystems of HA ! , HA with restricted induction. 1 Introduction Let E-HA ..." Cited by 1 (1 self) Add to MetaCart Goodman's theorem states that intuitionistic arithmetic in all finite types plus full choice, HA ! + AC, is conservative over first-order intuitionistic arithmetic HA. We show that this result does not extend to various subsystems of HA ! , HA with restricted induction. 1 Introduction Let E-HA ! denote the system of extensional intuitionistic arithmetic and HA ! its `neutral' variant as defined in [10]). 1 E-PA ! and PA ! are the corresponding theories with classical logic. PA (resp. HA) is first-order Peano arithmetic (resp. its intuitionistic version) with all primitive recursive functions. T denotes the set of finite types. The schema AC of full choice is given by S ae;ø 2T AC ae;ø , where AC ae;ø : 8x ae 9y ø A(x; y) ! 9Y ø(ae) 8x ae A(x; Y x) and A is an arbitrary formula of L(HA ! ). We also consider a restricted (arithmetical) form of AC: AC 0;0 ar : 8x 0 9y 0 A(x; y) ! 9f 0(0) 8x 0 A(x; fx); where A contains only quantifiers of type...	{"url":"http://citeseerx.ist.psu.edu/showciting?cid=1602981","timestamp":"2014-04-17T02:28:52Z","content_type":null,"content_length":"17243","record_id":"<urn:uuid:9b38ba43-b834-4558-bfe4-ea4c7f9edb4d>","cc-path":"CC-MAIN-2014-15/segments/1397609526102.3/warc/CC-MAIN-20140416005206-00612-ip-10-147-4-33.ec2.internal.warc.gz"}
An O(n log n) algorithm for the maximum weighted tardiness problem - Formal Program Development, volume 755 of Lecture Notes in Computer Science , 1992 "... A calculus of relations is used to reason about specifications and algorithms for optimisation problems. It is shown how certain greedy algorithms can be seen as refinements of dynamic programming. Throughout, the maximum lateness problem is used as a motivating example. 1 Introduction An optimisat ..." Cited by 14 (3 self) Add to MetaCart A calculus of relations is used to reason about specifications and algorithms for optimisation problems. It is shown how certain greedy algorithms can be seen as refinements of dynamic programming. Throughout, the maximum lateness problem is used as a motivating example. 1 Introduction An optimisation problem can be solved by dynamic programming if an optimal solution is composed of optimal solutions to subproblems. This property, which is known as the principle of optimality, can be formalised as a monotonicity condition. If the principle of optimality is satisfied, one can compute a solution by decomposing the input in all possible ways, recursively solving the subproblems, and then combining optimal solutions to subproblems into an optimal solution for the whole problem. By contrast, a greedy algorithm considers only one decomposition of the argument. This decomposition is usually unbalanced, and greedy in the sense that at each step the algorithm reduces the input as much as poss...	{"url":"http://citeseerx.ist.psu.edu/showciting?cid=2890196","timestamp":"2014-04-21T11:06:28Z","content_type":null,"content_length":"12816","record_id":"<urn:uuid:1816c32a-f9b3-4a39-94d2-d2e9d32ed786>","cc-path":"CC-MAIN-2014-15/segments/1397609539705.42/warc/CC-MAIN-20140416005219-00386-ip-10-147-4-33.ec2.internal.warc.gz"}
Got Homework? Connect with other students for help. It's a free community. • across MIT Grad Student Online now • laura* Helped 1,000 students Online now • Hero College Math Guru Online now Here's the question you clicked on: i need help with number 3 a and b • one year ago • one year ago Best Response You've already chosen the best response. Best Response You've already chosen the best response. pls help Best Response You've already chosen the best response. The opposite of derivative is integration, so in a you need to integrate once and on b, twice. Since the indefinite integral (with no limits of integration) gives you an arbitrary constant that disapears when you derivate, you need a way to find that constant because any number would satisfy the derivative formula since it would disapear when you derivated, thats why they give you one value of the function you want to find. Is it too confusing the way I explained or you got it? Best Response You've already chosen the best response. b was the confusing one,so am to integrate t-cosx 2twice? Best Response You've already chosen the best response. Yes, because you are derivating twice, but then you get 2 arbitrary constants. Best Response You've already chosen the best response. whats this for dy(0)/dx=2 what do i need it for? Best Response You've already chosen the best response. my first integration i got tx-sin(x)+c Best Response You've already chosen the best response. Your integration is fine and now you need to determine c, thats when you use dy(0)/dx=2, because by integrating once, you got dy/dx Best Response You've already chosen the best response. so how do i use this dy(0)/dx=2? Best Response You've already chosen the best response. tx-sin(x)+c=dy/dx so t*0-sin(0)+c=2 Do you understand that? Best Response You've already chosen the best response. Best Response You've already chosen the best response. so what about the y(0)=-2? Best Response You've already chosen the best response. you have dy/dx, but you want y, so you integrate again, and youll need this to find the other constant. Best Response You've already chosen the best response. So, did you got the answer? Best Response You've already chosen the best response. i will integrate this tx-sin(x)+c again? Best Response You've already chosen the best response. Best Response You've already chosen the best response. because it is equal to dy/dx, and you want y Best Response You've already chosen the best response. i got (tx^2/2)+cos(x)+c Best Response You've already chosen the best response. you forgot to sonsider the constant of the previous integration Best Response You've already chosen the best response. There will be two constants in this case, because its the second derivative. Best Response You've already chosen the best response. Best Response You've already chosen the best response. Yep thats it, but keep in mind that the c's are different, and the first one you should already have it as a number Best Response You've already chosen the best response. the 1st one is 2 right? Best Response You've already chosen the best response. Best Response You've already chosen the best response. ok thanks alot for your help :) Best Response You've already chosen the best response. You are welcome Your question is ready. Sign up for free to start getting answers. is replying to Can someone tell me what button the professor is hitting... • Teamwork 19 Teammate • Problem Solving 19 Hero • Engagement 19 Mad Hatter • You have blocked this person. • ✔ You're a fan Checking fan status... Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy. This is the testimonial you wrote. You haven't written a testimonial for Owlfred.	{"url":"http://openstudy.com/updates/50749e4be4b0b4f7c79c2739","timestamp":"2014-04-21T12:47:59Z","content_type":null,"content_length":"88243","record_id":"<urn:uuid:ba22618e-cdbd-42f8-86c9-db3a338ef02d>","cc-path":"CC-MAIN-2014-15/segments/1397609539776.45/warc/CC-MAIN-20140416005219-00150-ip-10-147-4-33.ec2.internal.warc.gz"}
Puzzle: A path through pairs making squares April 23, 2012 By David Smith Ted Harding posed an interesting puzzle challenge on the r-help mailing list recently. Here's the puzzle: Take the numbers 1, 2, 3, etc. up to 17. Can you write out all seventeen numbers in a line so that every pair of numbers that are next to each other, adds up to give a square number? You can figure out the solution from first principles fairly easily (hint: what neighbours must 17 have?), but Ted's challenge was to write a "neat" R function to solve this puzzle programmatically. The r-help thread generated several solutions (including an elegant one based on recursion, and a generalization to larger sets of numbers), but I wanted to highlight this solution from Vincent Zoonekynd on StackOverflow: # Allowable pairs form a graph p <- outer( 1:17, 1:17, function(u,v) round(sqrt(u + v),6) == floor(sqrt(u+v)) ) rownames(p) <- colnames(p) <- 1:17 image(p, col=c(0,1)) # Read the solution on the plot g <- graph.adjacency(p, "undirected") V(g)$label <- V(g)$name plot(g, layout=layout.fruchterman.reingold) It's a clever use of the graph theory. Consider the numbers 1-17 as vertices in a graph, with connections between pairs defined by whether they sum to a square. The call to outer defines the T/F adjacency matrix (which the code displays as an image), and then the plot.igraph function displays the graph as an R chart: All you need to do is to trace a path that passes through each number once, and you have your solution to the puzzle. A neat and unexpected use of the igraph package for handling graphs in R. StackOverflow: Ordering 1:17 by perfect square pairs for the author, please follow the link and comment on his blog: daily e-mail updates news and on topics such as: visualization ( ), programming ( Web Scraping ) statistics ( time series ) and more... If you got this far, why not subscribe for updates from the site? Choose your flavor: , or	{"url":"http://www.r-bloggers.com/puzzle-a-path-through-pairs-making-squares/","timestamp":"2014-04-21T12:27:24Z","content_type":null,"content_length":"42148","record_id":"<urn:uuid:679f27ec-d22d-42e1-b34b-d91b71d864e1>","cc-path":"CC-MAIN-2014-15/segments/1398223206118.10/warc/CC-MAIN-20140423032006-00282-ip-10-147-4-33.ec2.internal.warc.gz"}
Re: st: Bootstrap sampling for evaluating hypothesis tests Notice: On March 31, it was announced that Statalist is moving from an email list to a forum. The old list will shut down at the end of May, and its replacement, statalist.org is already up and [Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index] Re: st: Bootstrap sampling for evaluating hypothesis tests From Maarten Buis <maartenlbuis@gmail.com> To statalist@hsphsun2.harvard.edu Subject Re: st: Bootstrap sampling for evaluating hypothesis tests Date Thu, 14 Mar 2013 11:28:19 +0100 On Wed, Mar 13, 2013 at 4:04 PM, Margaret MacDougall wrote: > I would value receiving recommendations on literature explaining the > application of bootstrap sampling to assess robustness to Type I errors of a > proposed new hypothesis test. Better still, if the recommended references > contain corresponding computer syntax! In terms of literature references, I would look at bootstrap tests. A bootstrap changes the data such that the null hypothesis is true and looks at the proportion of replictions in which the test statistic is more extreme than the one observed in the original data. In bootstrap tests these can be used as an estimate of the p-value(), but you can compare it with the asymptotic p-value returned by your tests and see if they correspond. It is useful to also consider the Monte Carlo confidence interval, which captures the variability you can expect in the proportion due to the fact that it is based on a random process. Say you find 1000 out of 20000 replications in which the test statistic was more extreme than the one in the original sample, than the Monte Carlo confidence interval can be computed by typing in Stata: -cii 20000 1000- If you save the p-values from all replications you can look at the distribution of the p-values, as I did in the examples I gave earlier. Nice introductions to bootstrap tests can be found in Chapter 4 of (Davison & Hinkley 1997) and Chapter 16 of (Efron & Tibshirani 1993). They are both good introductory texts, but I found that they complement one another well, so it is useful to look at both of them. You can also find more Stata code examples in the manual entry of -bootstrap-: Under "Remarks" go to the section titled "Achieved significance level", and it will give an example of how to use -bootstrap- to do a bootstrap test. Hope this helps, A.C. Davison and D.V. Hinkley (1997) Bootstrap Methods and their Applications. Cambridge: Cambridge University Press. B. Efron and R.J. Tibshirani (1993) An Introduction to the Bootstrap. Boca Raton: Chapman & Hall/CRC () Alternatively, for testing purposes it makes sense to use the ( number of replictions in which the test statistic is more extreme than the one observed in the original data + 1 ) / ( the number of replications +1 ), see: Chapter 4 of (Davison & Hinkley 1997). Though for a large number of replications the difference with the simple proportion is trivial. Maarten L. Buis Reichpietschufer 50 10785 Berlin * For searches and help try: * http://www.stata.com/help.cgi?search * http://www.stata.com/support/faqs/resources/statalist-faq/ * http://www.ats.ucla.edu/stat/stata/	{"url":"http://www.stata.com/statalist/archive/2013-03/msg00646.html","timestamp":"2014-04-19T05:01:28Z","content_type":null,"content_length":"10343","record_id":"<urn:uuid:f161092f-0b51-44a1-980f-2ff34fda15e2>","cc-path":"CC-MAIN-2014-15/segments/1397609538423.10/warc/CC-MAIN-20140416005218-00435-ip-10-147-4-33.ec2.internal.warc.gz"}
How hard is string theory exactly? So does this mean you can only be ready to compete after spending, say, 25-30 years (a "large part of your life") studying it? No, that's impossible. In that time the field already has involved in such a way that you should catch up again, creating some sort of Zeno paradox. That's why people buy the book of Becker^2 Schwarz. It's horrible as a pedagogic introduction, but it gives a highly compressed overview of the field in less than 1000 pages. It allows people to get the overview which is needed to start research, even though it's more of a "knowing the jargon" than "understanding what's really going on". One of the hard things about research in theoretisch physics, and string theory in particular, is that you have to find a midway between understanding and being able to contribute to the field. Most people, not being geniuses, will find the following: trying to understand too much does not allow you to contribute, and trying to dive into something very specific doesn't allow you to develop a broad overview and put your findings into the bigger picture. Which can become awkwardly exposed during questions if you give a talk :P	{"url":"http://www.physicsforums.com/showthread.php?p=4201223","timestamp":"2014-04-17T12:36:18Z","content_type":null,"content_length":"35367","record_id":"<urn:uuid:2a7c7023-7348-48d4-a727-930ec2abd73e>","cc-path":"CC-MAIN-2014-15/segments/1397609530131.27/warc/CC-MAIN-20140416005210-00132-ip-10-147-4-33.ec2.internal.warc.gz"}
Leicester, MA Calculus Tutor Find a Leicester, MA Calculus Tutor ...Many problems on the SAT are unlike any that students may have experienced in their Math classes at school. I help my students with "SAT Math" by a) expanding and deepening their understanding of the ideas behind Mathematics; b) showing them how to think on their feet and apply basic Mathematica... 14 Subjects: including calculus, geometry, trigonometry, SAT math I am a professional scientist (geophysicist) who has taught math and science at the high school and college level. Whether the objective is to swim a length of the pool or master calculus-based physics, I have always enjoyed helping students achieve their potential. The one-on-one tutoring experie... 8 Subjects: including calculus, physics, geometry, algebra 1 I am an experience math tutor for students in middle school through college. I have an PhD in Applied Math from UC Berkeley and have been tutoring students part time in the last four years. I enjoy working with students who are motivated but need a little help to understand the subject at hand. 11 Subjects: including calculus, geometry, algebra 1, algebra 2 ...Of course I used my precalculus knowledge and skills in learning calculus and engineering at Cornell University and the United States Air Force Academy. During my first seven years as a math teacher at Lowell High School, MA, I taught various levels of algebra I, II, and geometry. Then, during ... 9 Subjects: including calculus, geometry, algebra 1, algebra 2 ...If it sounds to you like I can be helpful I hope you will consider giving me a chance. Thanks.My fascination with math really began when I started studying calculus. For more then a decade I have been using calculus to solve a wide variety of complex problems. 14 Subjects: including calculus, geometry, GRE, algebra 1 Related Leicester, MA Tutors Leicester, MA Accounting Tutors Leicester, MA ACT Tutors Leicester, MA Algebra Tutors Leicester, MA Algebra 2 Tutors Leicester, MA Calculus Tutors Leicester, MA Geometry Tutors Leicester, MA Math Tutors Leicester, MA Prealgebra Tutors Leicester, MA Precalculus Tutors Leicester, MA SAT Tutors Leicester, MA SAT Math Tutors Leicester, MA Science Tutors Leicester, MA Statistics Tutors Leicester, MA Trigonometry Tutors	{"url":"http://www.purplemath.com/leicester_ma_calculus_tutors.php","timestamp":"2014-04-21T02:16:10Z","content_type":null,"content_length":"24162","record_id":"<urn:uuid:a302eafc-0ce7-4742-8882-988922cda88e>","cc-path":"CC-MAIN-2014-15/segments/1398223207046.13/warc/CC-MAIN-20140423032007-00432-ip-10-147-4-33.ec2.internal.warc.gz"}
Anybody understand cryptography? Anybody understand cryptography? This question has been nagging me for a while, and nothing I've read has helped me figure it out: From what I understand, you use a public key to encrypt a message that can only be decrypted with the private key. But if the encryption software uses the public key to encrypt the message, and you can read the source code of the encryption software to see how it does that, why can't someone listening in just reverse the process using the public key, which they know because it's public? I'm obviously missing something here, but I just can't figure out what it is. Although you can see how the message is encrypted using the public key, the algorithms used make it impossible to use the public key to decrypt the message. The encryption algorithms use one-way functions to achieve this. These functions, as their name says, cannot be reversed. You might want to google for "pgp explained" for more technical explanations... Originally Posted by dan@george why can't someone listening in just reverse the process using the public key, which they know because it's public? This is the essential idea of understanding public key cryptography. Not every algorithm can be "reversed". this is the P=NP question. Hope that it helps. I think this is a legitimate question that some people may have and I think the best place to start is right here on Wikipedia. Essentially, I think public key encryption may be less intuitive than symmetric encryption but it is no less secure. In fact, I would bet that is more widely-used than symmetric encryption. I can try and offer the reader's digest version of RSA encryption (a popular public-key cryptography), if you would like. It should clarify the issue somewhat. RSA works as such: You choose two numbers called P and Q. These are both prime numbers somewhere between 1 and 2^1024 (note: 2^1024 is a HUGE number). You now have P and Q. You also have a number PQ, which (as you might guess), is simply the product of P and Q. Finally, you have the number (P-1)(Q-1). We now need our number E. E is relatively prime to (P-1)(Q-1). This means that E and (P-1)(Q-1) share no factors except for 1. The last number that we need is D. D is the multiplicative inverse of E mod (P-1)(Q-1). That was quite a mouthful. What does it mean? The multiplicative inverse of a number is the number that makes the equation = 1. So for instance, the multiplicative inverse of 3 is 1/3. Modular arithmetic means that we only use a certain subset of integers. For instance, in a mod 4 world, we only use 0, 1, 2, and 3. So 4 mod 3 = 1. So does 7 mod 3, etc. So in a modular world, multiplicative inverses are different. For instance, the multiplicative inverse of 3 mod 5 is 2. This is because 3 * 2 = 6, and 5 * 1 = 5. So 3 * 2 = 1 in a mod 5 world. Do you follow so far? So now that we've explained the hard part, let's go over our numbers again: P = A huge prime number Q = A different huge prime number PQ = The product of P and Q (P-1)(Q-1) = Self explanatory E = A number relatively prime to (P-1)(Q-1) D = The multiplicative inverse of E mod (P-1)(Q-1) Now then, I publish only 2 numbers to the world: PQ and E. You will note that P and Q are NOT revealed (and therefore (P-1)(Q-1) is also not revealed), nor is D. Only I know (P-1)(Q-1) and D. So now, you send me a message (we'll call it M). You would do this: M ^ E mod PQ = T T is a completely jumbled message. However, one of the coolest properties of RSA is that: T ^ D mod PQ = M So you send me this jumbled up message, and I can easily use D to decrypt it! Now, RSA has a theoretical flaw in that if we knew a quick way to break down numbers into prime numbers, we could discover what P and Q were from PQ (and therefore, (P-1)(Q-1) and therefore D). However, it turns out that this process (called prime decomposition) is EXTREMELY inefficient to perform, and that even a modern supercomputer could not perform this process on a number in the range of 2^1024 before the sun burned out. So you see that despite my giving out information to the world, due to the presence of hidden information, my code is still essentially uncrackable.	{"url":"http://www.linuxforums.org/forum/miscellaneous/anybody-understand-cryptography-print-9563.html","timestamp":"2014-04-24T16:48:48Z","content_type":null,"content_length":"8624","record_id":"<urn:uuid:9eab942e-cd24-476a-908b-d2343491a1fd>","cc-path":"CC-MAIN-2014-15/segments/1398223206647.11/warc/CC-MAIN-20140423032006-00461-ip-10-147-4-33.ec2.internal.warc.gz"}
North Dartmouth, MA 02747 Top 50 WyzAnt tutor in Math, Reading, English, and Social Sciences ...worked as a teacher in Dartmouth Public Schools for 20 years, teaching all academic subjects. I am certified to teach at all levels. I have had experience in tutoring both Language Arts and ematics as well. I am certified and qualified to teach any student... Offering 10+ subjects including algebra 1, algebra 2 and prealgebra	{"url":"http://www.wyzant.com/Seekonk_Math_tutors.aspx","timestamp":"2014-04-18T16:57:20Z","content_type":null,"content_length":"59795","record_id":"<urn:uuid:f48da858-9401-4582-8121-12e13b3f6bfd>","cc-path":"CC-MAIN-2014-15/segments/1398223206147.1/warc/CC-MAIN-20140423032006-00500-ip-10-147-4-33.ec2.internal.warc.gz"}
Magnetic Flux and Induced Voltage Interesing question Simon Bridge What does "5w" refer to? What is the geometry of the system? You have not actually shown us how you attempted the problem - only the numbers you got as a result. 5w refers to 5(.2)=1m what i did was the following: The acceleration is 4.8m/s/s, this is sort of like a railgun. and i plugged in the humbers and it turns out that supposedly v when it's supposed to be 2 so now this makes me think why this isn't exactly like a railgun (the velocity decrased) any ideas? for some reason I think this can only be solved with calculus, just a feeling, a weird feeling though...	{"url":"http://www.physicsforums.com/showthread.php?t=582309","timestamp":"2014-04-18T23:23:00Z","content_type":null,"content_length":"37199","record_id":"<urn:uuid:e867d5a3-a69a-4cec-a482-5773cf393f38>","cc-path":"CC-MAIN-2014-15/segments/1398223211700.16/warc/CC-MAIN-20140423032011-00545-ip-10-147-4-33.ec2.internal.warc.gz"}