text:
# How To Calculate Standard Deviation On Ti Nspire

How To Calculate Standard Deviation On Ti Nspire. Thank You for visiting CCUART. Nowadays were excited to declare that we have discovered an incredibly interesting topic to be pointed out, namely How To Calculate Standard Deviation On Ti Nspire. Lots of people attempting to find info about master bedroom design ideas and certainly one of them is you, is not it?

## Explanation About How To Calculate Standard Deviation On Ti Nspire according to CCUART

There are particular explanation why you are researching for specifics about How To Calculate Standard Deviation On Ti Nspire, but certainly, you are looking for fresh suggestions for your needs. We found this on the internet sources and we suppose this is one of many awesome content for reference. And you know, initially when I first found it, we loved it, we hope you are too. We know, we may own diverse opinion, but, what we do just plan to support you in finding more suggestions about How To Calculate Standard Deviation On Ti Nspire.

### The other How To Calculate Standard Deviation On Ti Nspire you should know.

Ti Nspire Discrete Probability Mean Variance And Standard Deviation4 Youtube Ti Nspire Calculating Mean And Standard Deviation Of Grouped Data One Variable Statistics Of Grouped Data On The Ti Nspire In Problem 1 Students Find The Mean Standard Deviation And Normal Distribution In Order To Find The Percentile Of A Given Score .

### How To Calculate Standard Deviation On Ti Nspire basic understanding

Regarding Image description: Image has been added by author. We thank you for your visit to CCUART. Make sure you get the information you are looking for. Do not forget to share and love our reference to help further develop our website.

Click Image/s to view large size

How to Use TI-nspire to Calculate Mean, Standard Deviation etc.

## .

### ti-nspire discrete probability mean, variance and standard deviation4 - YouTube.

TI-nspire - Calculating Mean and Standard Deviation of Grouped Data.

### One-variable statistics of grouped data on the TI Nspire.

In Problem 1, students find the mean, standard deviation, and normal distribution in order to find the percentile of a given score..

How to calculate standard deviation on the TI-Nspire.

TI-Nspire CX Mini-Tutorial: Binomial Distribution.

Spread of Data-TI-Nspire Cx- Standard Deviation.

Using TI-nspire to find sum of squared residuals.

image0g.

Discrete Random Variables and the TI-nSpire.

How to convert between fractions and decimals for TI Nspire CX - YouTube.

Statistics - Normal Distribution, Using TI-nSpire CAS.

TI-NSPIRE Z score to Pval & Pval to Zscore NormCDF invNorm.

Stats.

Scatter Plot, Linear Reg, Correlation & Residuals with TI-NSPIRE - YouTube.

The Inverse Normal function calculates the largest score of a (left-tail) normal distribution with a given area under the graph (e.g. the probability, ....

ti nspire x cas screen.

Using independent variables x1, x2, and dependent variable y. Firstly, the covariance matrix is obtained by either the first inverse matrix equation above, ....

... TI-Nspire CX Mini-Tutorial: Quadratic Formula Template.

Alternatively, you could input the command $\text{InvNorm(0.98, 168, 2)}$InvNorm(0.98, 168, 2) directly into the calculator and ....

view symbol.

TI Nspire CX Statistics.

standard deviation sle size.

Create new list.

Variance and Standard Deviation with the TI-Nspire.

TI-NSPIRE Discrete Random Variable Mean & Standard Deviation.

TI Nspire CX CAS Graphing Calc.

ti nspire cx cas user manual instructions guide, ti nspire cx cas user manual service manual guide and maintenance manual guide on your products..

nspire cas catalog display.

Texas Instruments Stealodeal TI-Nspire CX CAS Graphical Calculator. Save.

Tutorial on how to calculate complex numbers on the TI-nSpire CX CAS..

How to Use TI-nspire to Calculate Mean, Standard Deviation etc.

Now ....

Step by Step - Statistical Tests using the TiNspire.

Solve Statistics problems stepwise using the Ti-Nspire Calculator.

Mean Median.

19 TI-NSpire: Calculate standard deviation and ....

TI-NSpire: Calculate standard deviation and mean..

Solve Equation Solver problems stepwise using the Ti-Nspire Calculator.

TI-84 Plus Graphing Calculator For Dummies Cheat Sheet - For Dummies.

Frequency Distribution with the TI-Nspire.

Step by Step - Confidence Intervals using the TiNspire.

Nspire Stat Logo.

Step by Step Statistics on the Ti-Nspire : Central Limit Theorem using Statistics Made Easy.

Step by Step - Equation Balancer using the TiNspire.

Problem 2 asks students to find the score given the percentile. Students reverse the method used in problem 1. This reversal is done by using a command ....

How to Get Pokémon and Roms on The Ti Nspire CX Calculator! Free and Simple.

Distance, Slope, Midpoint, Equation using the TiNspire.

Step by Step - Solve Separable DEQ using the TiNspire.

Find Values for Sin(x) Cos(x) using the TiNspire.

Step by Step - Solve any 90 degree Triangle using the TiNspire.

24 TI-Nspire: ....

How to Get Super Mario Bros 3 on TI-Nspire Calculator.

Solve System of Equations using the TiNspire.

Ti-Nspire CAS Finding Range and Domain of any Function THE TRICK.

6. HYUKYOUNG HONG A random sample of n-81 observations https mg a. Does someone know how to use ti nspire to calculate ....

How To Use a Graphing Calculator | Best Graphing Calculators.

Equations using the TiNspire.

TI nspire mean, standard deviation and variance.

Find Average, Mean, Median using the TiNspire.

▷Electrical Engineering Made Easy - Step by Step with the TI-Nspire CX (CAS)◁.

Step by Step - Limits (L'Hopital Rule) using the TiNspire.

Texas Instruments TI Nspire CX CAS Graphing Calculator.

TI NSPIRE. Graphic. \$253.00.

Getting Started.

Texas Instruments TI-30Xa Scientific Calculator.

Alg2: Permutations—n objects taken r at a time (TI-nSpire CX.

Texas Instruments TI-30Xa - scientific calculator.

critical z value ti 83 invnorm function.

Step by Step TiNspire Apps – Blog.

TI Nspire Dice Program.

taylor4.

7 Exercise ....

[TI-Nspire CX]Installing the CAS OS to the Nspire CX with ControlX.

Mean, Median, Lower Quartile, Upper Quartile TI NSpire CX.

Domain and Range 2.


text:
Choose a Product Community
Resources

## Can we integrate soapui with Putty?

SOLVED
Occasional Contributor

## Can we integrate soapui with Putty?

Hi,

Any idea if we can integrate Saopui Pro with PuTTY?

Thanks

1 ACCEPTED SOLUTION

Accepted Solutions
Community Hero

## Re: Can we integrate soapui with Putty?

Hi,

I've no idea....but i've no idea why you'd want to.
Can you outline why you'd want to integrate with putty? I suppose you can run curl/wget requests in putty...but im wondering why the integration requirement.

Cheers

Richie
if this helped answer the post, could you please mark it as 'solved'? Also if you consider whether the title of your post is relevant? Perhaps if the post is solved, it might make sense to update the Subject header field of the post to something more descriptive? This will help people when searching for problems. Ta
Community Hero

## Re: Can we integrate soapui with Putty?

Hi,

I've no idea....but i've no idea why you'd want to.
Can you outline why you'd want to integrate with putty? I suppose you can run curl/wget requests in putty...but im wondering why the integration requirement.

Cheers

Richie
if this helped answer the post, could you please mark it as 'solved'? Also if you consider whether the title of your post is relevant? Perhaps if the post is solved, it might make sense to update the Subject header field of the post to something more descriptive? This will help people when searching for problems. Ta
cancel
Showing results for

format: plain


text:
Astronomy Answers: From the Astronomical Dictionary

$$\def\|{&}$$

The description of the word you requested from the astronomical dictionary is given below.

the magnetic field

hè Magnetis lithos = [Greek] stone of Magnesia

The magnetic field is a force field that is associated with moving electrical charge. A magnetic field can influence electrically charged particles and certain metals by attracting or repulsing them. Almost all solar gas is susceptible to the effects of magnetic field.

Magnetic field behaves as if it is made up of closed magnetic field lines (as you can see if you hold a magnet under a transparent plate with iron filings on it and then gently tap the plate). Magnetic field on the Sun appears to exist in only two forms: either it is so weak that it is swept away by the motion of the solar gas, or it is so strong that it inhibits free motion of the gas (for example in convection). In the latter case, the magnetic field is made up of flux tubes: isolated tube-like things in which the magnetic field is strong, while it is weak or absent outside of the flux tube. Most interesting things on the Sun have something to do with magnetic field: sunspots, pores, plage, filaments, solar flares, and prominences. A famous quote in solar physics, attributed to Robert B. Leighton (around 1970), is

If the Sun didn't have a magnetic field, then it would be as boring as most people think it is.

Solar physicists measure the strength of the magnetic field in units of one gauss (G). The magnetic field of the Earth is at most about 1 G strong. The magnetic field in a sunspot at the solar surface can reach a strength of 3000 G.


text:
# $|G|=|H_1| |H_2 |$ and $H_1 \cap H_2 = e$. Is $H_1 H_2 =G$? [closed]

If there is a group $G$ with order $a$, having a subgroup $H_1$ with order $b$, and $H_2$ with order $c$, and $bc=a$, $H_1 \cap H_2 = e$. Is $H_1 H_2 =G$?

## closed as off-topic by user26857, user228113, zz20s, Michael Albanese, Silvia GhinassiApr 2 '16 at 21:58

This question appears to be off-topic. The users who voted to close gave this specific reason:

• "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." – user26857, Community, zz20s, Michael Albanese, Silvia Ghinassi
If this question can be reworded to fit the rules in the help center, please edit the question.

• If $G$ is finite, so is $H_1$ and $H_2$. We have a formula $$\frac{|H_1| \cdot |H_2|}{|H_1 \cap H_2|} = |H_1 H_2| \ .$$ Can you continue? – Gustavo Mar 30 '16 at 5:06
• – sqtrat Mar 30 '16 at 5:06
• thanks for the idea. Its like an answer below give a complete explanation. – Agus Ahmad Rizqi Mar 30 '16 at 9:29

The answer to your question is yes: if $G$ is a finite group, and $H$ and $K$ are subgroups such that $|G| = |H||K|$ and $H \cap K = 1$, then $G = HK$.

The easiest way to see this is to use the identity $$|HK| = \frac{|H||K|}{|H \cap K|}$$ Note that this identity holds even if $HK$ is merely a subset (not a subgroup) of $G$.

In your case, $|H \cap K| = 1$ and $|H||K| = |G|$, so the identity becomes $$|HK| = |G|$$ Therefore, $HK$ is a subset of $G$ with the same cardinality as $G$, so $HK = G$.

For completeness, here is a simple proof of the identity.

Recall that $H \times K$ is the direct product of $H$ and $K$. It is the set of all ordered pairs of the form $(h,k)$ where $h \in H$ and $k \in K$, and it has cardinality $|H \times K| = |H||K|$. ($H \times K$ inherits a group operation from $H$ and $K$, but we won't need to use it here.)

Also recall that $HK$ is the set $\{hk : h \in H, k \in K\}$ which is not necessarily a subgroup of $G$, but it is certainly a subset of $G$.

Define the map $f : H \times K \to HK$ by $f(h,k) = hk$. Clearly this map is surjective, so its image is $HK$, which has cardinality $|HK|$.

Now, how many elements of $H \times K$ are mapped to a given $hk \in HK$?

Note that if $d \in H \cap K$, then $(hd, d^{-1}k) \in H \times K$, and $f(hd, d^{-1}k) = hk$. This shows that there are at least $|H \cap K|$ elements of $H \times K$ which are mapped to $hk$.

It's easy to verify that these are all of the elements which are mapped to $hk$. Suppose that $f(h', k') = h'k' = hk$. Then $h^{-1}h' = k(k')^{-1} \in H \cap K$, call this element $d$. Thus $h' = hd$ and $k' = d^{-1}k$.

This shows that for each $hk \in HK$, there are exactly $|H \cap K|$ elements of $H \times K$ which are mapped to $hk$. Consequently, $$|H \times K| = |H \cap K||HK|$$ Since $|H \times K| = |H||K|$, this is equivalent to $$|H||K| = |H \cap K| |HK|$$ Dividing by $|H \cap K|$ gives us the desired identity.

• Thanks for the idea. But, i still confuse about why $H_1 H_2$ should be a subgroup? – Agus Ahmad Rizqi Mar 30 '16 at 9:30
• @agus In general, it is not a subgroup, but in this case it turns out to be all of $G$, so it is a subgroup. – Bungo Mar 30 '16 at 15:34
• I'm sorry, i'm a beginner in this course. What about a subgroup of finite group require $ab$ also in it? In $H_1 H_2$, if $h_1$ element of $H_1$, and $h_2$ element of $H_2$, then $H_1 H_2={h_1 h_2}$, and if it operated with other element $h_1^'h_2^'$, it yields $h_1 h_2 {h_1}^'{h_2}^'$. It seems not element of $H_1 H_2$. – Agus Ahmad Rizqi Mar 31 '16 at 5:23
• @AgusAhmadRizqi: At the start of the problem we do not assume that $H_1 H_2$ is a subgroup. Without making this assumption, we are able to prove that $G = H_1 H_2$. Now $G$ is of course a group, so this means that $H_1 H_2$ is a group after all. – Bungo Mar 31 '16 at 5:26
• oh, i understand. every element of $h_1 h_2$ should be in G. Thank you very much. It will be very useful for my paper next week. I'm an undergraduate student of mathematics program from indonesia, sorry if my english is not good. Again, thank you. – Agus Ahmad Rizqi Mar 31 '16 at 6:17

Since $H_1$ and $H_2$ are subgroups of $G$, we have $$|H_1H_2|=\frac{|H_1||H_2|}{|H_1\cap H_2|}=|H_1||H_2|=|G|,\tag1$$ so $H_1H_2=G$.

(See @Bungo's answer for a proof of the identity in (1))

• @Bungo Good catch, the counterexample was off-target. Let me revise. – Math1000 Mar 30 '16 at 5:20
• In your counterexample, $H_1$ is not a subgroup, because it does not contain $\tau \sigma = (123)$. Indeed, the formula $|HK| = |H||K|/|H \cap K|$ shows that there is no counterexample if $H \cap K = 1$ and $|H||K| = |G|$, for then we have $|HK| = |G|$ and hence $HK = G$. – Bungo Mar 30 '16 at 5:21
• P.S. The formula $|HK| = |H||K|/|H \cap K|$ is valid for any finite subgroups, whether abelian or not, and whether or not $HK$ is a subgroup. So the bit at the beginning where you first consider the abelian case seems unnecessary. – Bungo Mar 30 '16 at 5:28
• @Bungo Indeed, I am not very well-versed in algebra ;) – Math1000 Mar 30 '16 at 5:31
• No worries, I just want to avoid confusing the OP! – Bungo Mar 30 '16 at 6:45


text:
# [O] Maybe a typo in the manual?

Hi, Org people.

I'm not familiar with referencing in documents, so I'm not sure.  The
section "11.2 Images and Tables" in the manual says:

You can use the following lines somewhere before the table to assign a
caption and a label for cross references, and in the text you can refer
to the object with \ref{tab:basic-data}':

#+CAPTION: This is the caption for the next table (or link)
#+LABEL:   tbl:basic-data
| ... | ...|

\ref says "tab:", while #+LABEL says "tbl:".  Is that a typo?

I presume, without knowing, that these prefixes are conventional, and
they do not have a preset meaning.  I could have used "zzz:" if I felt
like it?

François

`


text:
# How to plot the lmer result by group with straight lines [closed]

I use "R" to do some clinical research.

I got a lognitudinal data such as:

id outcome groups age edu sex years
1 12 0 65 12 M 1
1 14 0 66 12 M 2
1 15 0 67 12 M 3
2 10 1 80 12 F 1
2 15 1 81 12 F 2
2 17 1 82 12 F 3
2 19 1 83 12 F 4

... Every "id" is a unique participant. "years" is the visit time from the baseline(0)

I use lmer/lme to make lognitudinal analysis by the f:

lm1 <- lmer(outcome ~ age + edu + sex + group + years + group:years + (years|id), data=mydata)

Now I want to make the result visulizable.

So I code:

lmplot <- ggplot() +
geom_line(aes(years,predict(lm1),color=group),data=mydata) +
geom_point(aes(years,outcome,color=group,data=mydata)

The R give me the plot:

However, I am looking for the Plot with two straight lines for group 0 & 1 in the same panel to show the difference of the slope by years.

something like :

It seems that the predict function did not work.

I have search for solutions like: Demetri Pananos answered the similar question before. That really help with simple model, But not for mixed fitted model (R: "Error in eval(predvars, data, env) : object 'age' not found").

Is there anyone who can help me ?

Thank you very much!

New contributor
Yann is a new contributor to this site. Take care in asking for clarification, commenting, and answering. Check out our Code of Conduct.


text:
Why the electric field inside a metal sphere carrying a charge Q is zero?

I was solving some problem regarding the polarization during this I came across an example 4.5 in Griffith's where it is written that the Electric field inside the metal sphere carrying a charge Q is zero . The metal sphere is surrounded by a dielectric material

Is there any effect of the material which has surrounded the metal sphere due to which it's electric field inside the sphere becomes zero.

Can anyone explain me about these things? I literally confuse among the situations that where the electric field should be zero or not.

The Charge Q always stays on the surface of metals because any net charge resides on the surface. So there is no charge density inside the metal sphere. i.e. ρ = 0. So applying Gauss's Law would give you: $E=0$.
• I would like to know how you go from $\rho = 0$ to $E = 0$. In general there can be an electric field even in regions where there is no charge density, such as in the vicinity of stationary point charge, or in the presence of an electromagnetic wave. One has to be careful when reasoning that there is no field inside a conductor. Jul 2 '18 at 15:35


text:
# Why base of log is insignificant while considering time complexity? [duplicate]

If so, then $O(log_2 n)$ = $O(log_{10} n)$ = $O(log_e n)$. It is very wired that computer scientist treat them equally.

Considering,

$(log_2 n)$ = $m$, meaning $n$ = $2^m$

$(log_{10} n)$ = $m$, meaning $n$ = ${10}^m$

$(log_e n)$ = $m$, meaning $n$ = $e^m$

So, does it mean that $O(2^m)$ = $O({10}^m)$ = $O(e^m)$

Is, base treated to have $O(1)$ time complexity, hence neglected?

NOTE: I want to understand in terms of computer science and not in terms of mathematics.

How does it explain the computer science part? Mathematician will explicitly mention $log_e$, but when we talk in terms of CS (time complexity) it doesn't matter, why? I have put a note also. Duplicated answer proved mathematical explanation.

• Consider this: $log_bn = log_an / log_ab$ for any positive value of $a \neq 1$. – Marcelo Fornet Jan 15 '18 at 18:39
• @D.W. How does it explain the computer science part? Mathematically it is can be proved. For an example, Mathematician will explicitly mention $log_e$, but when we talk in terms of CS (time complexity) it doesn't matter, why? I have put a note also. Duplicated answer proved mathematics explanation. – Umang.B Jan 15 '18 at 18:44
• Big-O notation is mathematics. We use mathematics in computer science. That is the explanation. I'm not sure what you are expecting, what a "computer science explanation" means to you, why you reject the existing answer, or why you think a "computer science explanation" exists that isn't about the math. – D.W. Jan 15 '18 at 18:51
• There isn't really a "computer science part". The answer to the other question explains why $O(\log_b n)$ describes the same class of functions regardless what $b>1$ you choose. – David Richerby Jan 16 '18 at 13:35
• @DavidRicherby yep! thanks once again! – Umang.B Jan 16 '18 at 14:36


text:
# American Institute of Mathematical Sciences

• Previous Article
Periodic solutions and their stability of a differential-difference equation
• PROC Home
• This Issue
• Next Article
Intelligent traffic control on internet-like topologies - integration of graph principles to the classic Runge--Kutta method
2009, 2009(Special): 394-403. doi: 10.3934/proc.2009.2009.394

## Analysis of an operator splitting method in 4D-Var

 1 Institute for Mathematics and its Applications, University of Minnesota, 114 Lind Hall, 207 Church Street S.E., Minneapolis, MN 55455-0134, United States 2 Departments of Mathematics, University of Wyoming, 1000 E., University Avenue, Laramie, WY 82071, United States

Received  July 2008 Revised  July 2009 Published  September 2009

In this paper, we present a framework of 4D variational data assimilation (4D-Var) in Hilbert spaces and discuss Marchuk-Strang operator splitting methods for 4D-Var. Convergence analysis of the operator splitting methods is made.
Citation: Lijian Jiang, Craig C. Douglas. Analysis of an operator splitting method in 4D-Var. Conference Publications, 2009, 2009 (Special) : 394-403. doi: 10.3934/proc.2009.2009.394
 [1] Liejune Shiau, Roland Glowinski. Operator splitting method for friction constrained dynamical systems. Conference Publications, 2005, 2005 (Special) : 806-815. doi: 10.3934/proc.2005.2005.806 [2] Zhili Ge, Gang Qian, Deren Han. Global convergence of an inexact operator splitting method for monotone variational inequalities. Journal of Industrial & Management Optimization, 2011, 7 (4) : 1013-1026. doi: 10.3934/jimo.2011.7.1013 [3] Manh Hong Duong, Yulong Lu. An operator splitting scheme for the fractional kinetic Fokker-Planck equation. Discrete & Continuous Dynamical Systems - A, 2019, 39 (10) : 5707-5727. doi: 10.3934/dcds.2019250 [4] Jingzhen Liu, Ka-Fai Cedric Yiu. Optimal stochastic differential games with VaR constraints. Discrete & Continuous Dynamical Systems - B, 2013, 18 (7) : 1889-1907. doi: 10.3934/dcdsb.2013.18.1889 [5] Kangkang Deng, Zheng Peng, Jianli Chen. Sparse probabilistic Boolean network problems: A partial proximal-type operator splitting method. Journal of Industrial & Management Optimization, 2019, 15 (4) : 1881-1896. doi: 10.3934/jimo.2018127 [6] Yunmei Chen, Xianqi Li, Yuyuan Ouyang, Eduardo Pasiliao. Accelerated bregman operator splitting with backtracking. Inverse Problems & Imaging, 2017, 11 (6) : 1047-1070. doi: 10.3934/ipi.2017048 [7] András Bátkai, Istvan Z. Kiss, Eszter Sikolya, Péter L. Simon. Differential equation approximations of stochastic network processes: An operator semigroup approach. Networks & Heterogeneous Media, 2012, 7 (1) : 43-58. doi: 10.3934/nhm.2012.7.43 [8] Defei Zhang, Ping He. Functional solution about stochastic differential equation driven by $G$-Brownian motion. Discrete & Continuous Dynamical Systems - B, 2015, 20 (1) : 281-293. doi: 10.3934/dcdsb.2015.20.281 [9] Chunhong Li, Jiaowan Luo. Stochastic invariance for neutral functional differential equation with non-lipschitz coefficients. Discrete & Continuous Dynamical Systems - B, 2019, 24 (7) : 3299-3318. doi: 10.3934/dcdsb.2018321 [10] Luca Calatroni, Bertram Düring, Carola-Bibiane Schönlieb. ADI splitting schemes for a fourth-order nonlinear partial differential equation from image processing. Discrete & Continuous Dynamical Systems - A, 2014, 34 (3) : 931-957. doi: 10.3934/dcds.2014.34.931 [11] Fuke Wu, Xuerong Mao, Peter E. Kloeden. Discrete Razumikhin-type technique and stability of the Euler--Maruyama method to stochastic functional differential equations. Discrete & Continuous Dynamical Systems - A, 2013, 33 (2) : 885-903. doi: 10.3934/dcds.2013.33.885 [12] Kerem Uǧurlu. Continuity of cost functional and optimal feedback controls for the stochastic Navier Stokes equation in 2D. Communications on Pure & Applied Analysis, 2017, 16 (1) : 189-208. doi: 10.3934/cpaa.2017009 [13] Monika Eisenmann, Etienne Emmrich, Volker Mehrmann. Convergence of the backward Euler scheme for the operator-valued Riccati differential equation with semi-definite data. Evolution Equations & Control Theory, 2019, 8 (2) : 315-342. doi: 10.3934/eect.2019017 [14] John A. D. Appleby, John A. Daniels. Exponential growth in the solution of an affine stochastic differential equation with an average functional and financial market bubbles. Conference Publications, 2011, 2011 (Special) : 91-101. doi: 10.3934/proc.2011.2011.91 [15] A. Alamo, J. M. Sanz-Serna. Word combinatorics for stochastic differential equations: Splitting integrators. Communications on Pure & Applied Analysis, 2019, 18 (4) : 2163-2195. doi: 10.3934/cpaa.2019097 [16] Daniel Grieser. A natural differential operator on conic spaces. Conference Publications, 2011, 2011 (Special) : 568-577. doi: 10.3934/proc.2011.2011.568 [17] Li Wang, Yang Li, Liwei Zhang. A differential equation method for solving box constrained variational inequality problems. Journal of Industrial & Management Optimization, 2011, 7 (1) : 183-198. doi: 10.3934/jimo.2011.7.183 [18] Roberto Camassa, Pao-Hsiung Chiu, Long Lee, W.-H. Sheu. A particle method and numerical study of a quasilinear partial differential equation. Communications on Pure & Applied Analysis, 2011, 10 (5) : 1503-1515. doi: 10.3934/cpaa.2011.10.1503 [19] Li Jin, Hongying Huang. Differential equation method based on approximate augmented Lagrangian for nonlinear programming. Journal of Industrial & Management Optimization, 2017, 13 (5) : 1-15. doi: 10.3934/jimo.2019053 [20] Tomás Caraballo, Gábor Kiss. Attractivity for neutral functional differential equations. Discrete & Continuous Dynamical Systems - B, 2013, 18 (7) : 1793-1804. doi: 10.3934/dcdsb.2013.18.1793

Impact Factor:


text:
News:

• February 25, 2018, 09:52:02 AM

### Author Topic: I need help being polite and gracious here  (Read 4071 times)

0 Members and 1 Guest are viewing this topic.

#### TurtleDove

• Member
• Posts: 7341
##### Re: I need help being polite and gracious here
« Reply #30 on: January 21, 2018, 08:38:36 AM »
“How they think I can survive on that is beyond me.”

This employer seems rather shady, but I wanted to address this. It is up to you to ensure you are making enough money to support yourself. I doubt the employer has thought about how much money *you* need. An employer is concerned with what work they need to accomplish. I didn’t hear you say that this was a bait and switch situation in which you accepted a job with 40 hours a week at $XX per hour plus benefits and then they only gave you a handful of hours. Be sure you know what job you are accepting next time and that it fits with your goals. #### rose red • Member • Posts: 9831 ##### Re: I need help being polite and gracious here « Reply #31 on: January 21, 2018, 11:12:43 AM » “How they think I can survive on that is beyond me.” This employer seems rather shady, but I wanted to address this. It is up to you to ensure you are making enough money to support yourself. I doubt the employer has thought about how much money *you* need. An employer is concerned with what work they need to accomplish. I didn’t hear you say that this was a bait and switch situation in which you accepted a job with 40 hours a week at$XX per hour plus benefits and then they only gave you a handful of hours. Be sure you know what job you are accepting next time and that it fits with your goals.

I was thinking the same thing. It's not an employer's job to wonder or care about their workers financial situation. Otherwise, some people won't need to work two or three jobs because they need all of them to survive. It's up to you to accept or decline offers.

#### gollymolly2

• Member
• Posts: 2876
##### Re: I need help being polite and gracious here
« Reply #32 on: January 21, 2018, 12:40:19 PM »
“How they think I can survive on that is beyond me.”

This employer seems rather shady, but I wanted to address this. It is up to you to ensure you are making enough money to support yourself. I doubt the employer has thought about how much money *you* need. An employer is concerned with what work they need to accomplish. I didn’t hear you say that this was a bait and switch situation in which you accepted a job with 40 hours a week at $XX per hour plus benefits and then they only gave you a handful of hours. Be sure you know what job you are accepting next time and that it fits with your goals. Totally agree. OP, it sounds like this place wasn't a good place to work. But based on your posts over the years, it sounds like you really struggle to keep continuous employment. I strongly suggest you seek out help from an employment counselor soon so you can change the trend. #### Nikko-chan • Member • Posts: 3454 ##### Re: I need help being polite and gracious here « Reply #33 on: January 21, 2018, 02:19:03 PM » “How they think I can survive on that is beyond me.” This employer seems rather shady, but I wanted to address this. It is up to you to ensure you are making enough money to support yourself. I doubt the employer has thought about how much money *you* need. An employer is concerned with what work they need to accomplish. I didn’t hear you say that this was a bait and switch situation in which you accepted a job with 40 hours a week at$XX per hour plus benefits and then they only gave you a handful of hours. Be sure you know what job you are accepting next time and that it fits with your goals.

Totally agree.

OP, it sounds like this place wasn't a good place to work. But based on your posts over the years, it sounds like you really struggle to keep continuous employment. I strongly suggest you seek out help from an employment counselor soon so you can change the trend.

I have a paper in my room in my bosses handwriting. On it is written:

Preschool Room WageAmount 37 hours a week.

I currently work 17 hours a week if i am lucky... in the school age room. It was definitely a bait and switch scenario. ANd yes, I will admit, I struggle to find full time employment. Everyone does. This town isn't a good one to work. They pay minimum and expect us to live off of it, which you can,if you have two full time jobs. But I take the bus right now, and can't do that.

#### Mary Lennox

• Member
• Posts: 591
##### Re: I need help being polite and gracious here
« Reply #34 on: January 21, 2018, 02:52:05 PM »
What's their incentive to give you more work when you're never on time? You said in the hugs thread you've been late for almost every shift because you won't take an earlier bus. Being on time is like the first rule of having a job.

Yeah, this place doesn't sound on the up and up, but you aren't coming out of this smelling like a model employee either.

#### Nikko-chan

• Member
• Posts: 3454
##### Re: I need help being polite and gracious here
« Reply #35 on: January 21, 2018, 03:31:16 PM »
What's their incentive to give you more work when you're never on time? You said in the hugs thread you've been late for almost every shift because you won't take an earlier bus. Being on time is like the first rule of having a job.

Yeah, this place doesn't sound on the up and up, but you aren't coming out of this smelling like a model employee either.

They knew when I take the bus I would be late. They knew this going in, that I take the bus. I tell all of my employers that up front. In fact, they make me leave early so I can catch the bus home so I don't go home in the dark. And like I said, going in early is *not* an option. They *will* make me work off the clock. The only places I can go are: a wendy's, a bank, or a church. The church looks abandoned and I dunno if its even open, the bank is a no go, and I am *not* spending money I don't have just to have someplace warm to sit. When its nice out, I do walk to work so I am not late. But they understand not everyone has cars and can drive themselves to work.

For them honestly me not being on time is not a problem. That just means they have to pay me less, which works out in their favor. I understand this as well, and sign in the time I come in (usually only five minutes late) and they let me leave ten minutes early so i can catch the bus.

Please know that all of my employers are okay with me being five minutes late. That is not the issue here. The issue here is that I am the only employee who:

Gets a text stating whether she is to work or not.
Gets her pay a week and a day late. (on one occasion)
Gets told off about doing her job. (i get yelled at for mostly everything I do)
Has not gotten her pay stubs in a month.

They have not said anything about me coming in late. And if you think that bothers them... it doesn't. Trust me. I would be the first to know if they had a problem with me coming in late. I mean they tell me off about everything else. (No lie, I got yelled at for *mopping* once).

#### gollymolly2

• Member
• Posts: 2876
##### Re: I need help being polite and gracious here
« Reply #36 on: January 21, 2018, 03:52:24 PM »
Quote
The issue here is that I am the only employee who:

Gets a text stating whether she is to work or not.
Gets her pay a week and a day late. (on one occasion)
Gets told off about doing her job. (i get yelled at for mostly everything I do)
Has not gotten her pay stubs in a month.

Ok, so why do you think you are being singled out?

#### jedikaiti

• Swiss Army Nerd
• Member
• Posts: 2865
• A pie in the hand is worth two in the mail.
##### Re: I need help being polite and gracious here
« Reply #37 on: January 21, 2018, 03:59:25 PM »
Let's be honest, this place is a dumpster fire and there's no way to salvage any kind of relationship with the employer. They do not respect you enough to pay you, you do not get many hours, you do not owe them any notice at all.

Paying you in cash is so shady and my imagination runs wild thinking about what their books probably look like. Cash is untraceable and the idea of index cards...I come from a background of doing payroll by hand at times but wowzah.

Get paid for everything they owe you and tell them that you are no longer available to work for them, given your schedule changing. Even if you did two weeks notice, you say you run the risk of just being fired anyways, you're not using this woman for a reference!

That's  my plan. I got paid yesterday. A week and a day late. ALso, stilll didn't get my pay stubs. But apparently am getting my W2s this week. Plus, I only worked 11 hours. I am the only one who works so little hours, and they think everything is hunky dory.  How they think I can survive on that is beyond me. At any rate, I am going to work this last week, and then I am gone this Friday coming. I feel like i should celebrate ><

Truthfully, I would be done now, unless you think you will actually be paid for any hours you might work this upcoming week.
Also, if this were me, I would report this business to the state.   There are so many things being done wrong, it boggles my mind.

This. And I might report them to the IRS as well, as I doubt they are doing anything on the up-and-up, including actually reporting/paying any withholding.
What part of v_e = \sqrt{\frac{2GM}{r}} don't you understand? It's only rocket science!

"The problem with re-examining your brilliant ideas is that more often than not, you discover they are the intellectual equivalent of saying, 'Hold my beer and watch this!'" - Cindy Couture

#### Nikko-chan

• Member
• Posts: 3454
##### Re: I need help being polite and gracious here
« Reply #38 on: January 21, 2018, 04:51:11 PM »
Quote
The issue here is that I am the only employee who:

Gets a text stating whether she is to work or not.
Gets her pay a week and a day late. (on one occasion)
Gets told off about doing her job. (i get yelled at for mostly everything I do)
Has not gotten her pay stubs in a month.

Ok, so why do you think you are being singled out?

Nepotism probably. Person A has worked there for 15 years and now  her daughter works with her (you really don't need two people in that room for 3 to 5 toddlers)

Person B (the girl who took over my preschoolers after I only had three days with them) is the Admins (who is the owners daughter) best friend ever. PErson B doesn't even *want* the preschoolers, nor does she have *any* experience working with them. The most she does with them is crafts and flashcards. I on the other hand at least have some experience in working with this age group. She has told me several times she doesn't want the preschoolers and wish they would have kept me with them.

I have no idea why I am not with the Preschoolers honestly. They were doing okay with me, and I was doing the exact same thing the owner did with them when she had the preschool class the year before. It wasn't like I was reinventing the wheel.

#### gollymolly2

• Member
• Posts: 2876
##### Re: I need help being polite and gracious here
« Reply #39 on: January 21, 2018, 05:14:05 PM »
Quote
The issue here is that I am the only employee who:

Gets a text stating whether she is to work or not.
Gets her pay a week and a day late. (on one occasion)
Gets told off about doing her job. (i get yelled at for mostly everything I do)
Has not gotten her pay stubs in a month.

Ok, so why do you think you are being singled out?

Nepotism probably. Person A has worked there for 15 years and now  her daughter works with her (you really don't need two people in that room for 3 to 5 toddlers)

Person B (the girl who took over my preschoolers after I only had three days with them) is the Admins (who is the owners daughter) best friend ever. PErson B doesn't even *want* the preschoolers, nor does she have *any* experience working with them. The most she does with them is crafts and flashcards. I on the other hand at least have some experience in working with this age group. She has told me several times she doesn't want the preschoolers and wish they would have kept me with them.

I have no idea why I am not with the Preschoolers honestly. They were doing okay with me, and I was doing the exact same thing the owner did with them when she had the preschool class the year before. It wasn't like I was reinventing the wheel.

Cool. Look, you certainly know your situation much better than some strangers over the Internet. And everyone can have a bad employer. It's up to you to look at your employment history and figure out if its always the employers, or if you're doing something that makes the job not work out.

#### Erich L-ster

• Member
• Posts: 772
##### Re: I need help being polite and gracious here
« Reply #40 on: January 21, 2018, 05:19:16 PM »
I hope this isn't a dogpile but if you walk in the door at 1:35 and then have to put your things away, then sign in, then start work; signing in for 1:45 doesn't seem unreasonable especially considering they let you go 10 minutes early at the end of the day.

Most jobs you have to be there and ready to start at the time your shift starts which really means being there early. Most jobs where you have to punch a clock, if you punch in more than 5 minutes after start time it takes away 1/4 hour to make you in essence 15 minutes late even if you were actually only 6 minutes late.

Are you getting paid for the 10 minutes they let you go early?

#### Nikko-chan

• Member
• Posts: 3454
##### Re: I need help being polite and gracious here
« Reply #41 on: January 21, 2018, 05:28:33 PM »
I hope this isn't a dogpile but if you walk in the door at 1:35 and then have to put your things away, then sign in, then start work; signing in for 1:45 doesn't seem unreasonable especially considering they let you go 10 minutes early at the end of the day.

Most jobs you have to be there and ready to start at the time your shift starts which really means being there early. Most jobs where you have to punch a clock, if you punch in more than 5 minutes after start time it takes away 1/4 hour to make you in essence 15 minutes late even if you were actually only 6 minutes late.

Are you getting paid for the 10 minutes they let you go early?

I go in and sign in on the sign in sheet. The sign in sheet is a physical piece of paper.  The one time I disputed it she told me to sign in at 1:40, even though my phone said 1:35, and their actual wall clocks were 5 minutes off. I even showed her my phone. And No I don't get paid for those ten minutes I leave early.

And gollymolly2 the retail job wasn't working out because they didn't have enough hours for me. And it wasn't just me, but  I couldn't justify riding the bus for just a few hours a week. And I wanted to get into a new industry anyway. They understood that, and we parted amicably.

At the first daycare, I had to report one of my coworkers for child abuse. She was harming the kids. When my workplace got the (what was supposed to be anonymous) report, my name was attached. Which violates whistleblower law. At any rate, I got fired for being a whistleblower. I only found out through the place we go through online for our training. They didn't actually *tell* me I was fired. By then my mom was really sick and I didn't give two flying figs whether I was fired or not. Then I got this job, but I didn't realize how hinky everything was.

#### HannahGrace

• Member
• Posts: 1321
##### Re: I need help being polite and gracious here
« Reply #42 on: January 21, 2018, 05:30:54 PM »
Does your college have a career center where you can talk to someone about the job application process and what to look for in a position? I think you could use some assistance based on what you’ve said here about these jobs.

#### Nikko-chan

• Member
• Posts: 3454
##### Re: I need help being polite and gracious here
« Reply #43 on: January 21, 2018, 06:38:42 PM »
Does your college have a career center where you can talk to someone about the job application process and what to look for in a position? I think you could use some assistance based on what you’ve said here about these jobs.

I don't go to college. I am getting my CDA online. Basically pay on a course by course basis while working at a daycare so i can get my hours in, and then be observed by someone when i am ready and have the requisite hours in, and then take the written test.

#### TurtleDove

• Member
• Posts: 7341
##### Re: I need help being polite and gracious here
« Reply #44 on: January 21, 2018, 06:59:47 PM »
Does your college have a career center where you can talk to someone about the job application process and what to look for in a position? I think you could use some assistance based on what you’ve said here about these jobs.

I don't go to college. I am getting my CDA online. Basically pay on a course by course basis while working at a daycare so i can get my hours in, and then be observed by someone when i am ready and have the requisite hours in, and then take the written test.

OP, it may make sense to really consider your goals and how you will get there. I don’t know what a CDA is or what your career goals are, but based on your posts here, working with children does not appear to be a strength for you. I also catch a tone in your posts that, if an employer also senses, is not an asset to you. You are there to be a value add to your employer, not the other way around. Your descriptions of your various workplaces are rather shocking in that this is not typical, and your responses for “why” you are treated differently than everyone else seem off, given the consistency across employers. If I were you, I would consider a job with an established company to make money while you earn the degree for whatever career you desire.


text:
# Clebsch surface

The Clebsch cubic in a local chart
Model of the surface

In mathematics, the Clebsch diagonal cubic surface, or Klein's icosahedral cubic surface, is a non-singular cubic surface, studied by Clebsch (1871) and Klein (1873), all of whose 27 exceptional lines can be defined over the real numbers. The term Klein's icosahedral surface can refer to either this surface or its blowup at the 10 Eckardt points.

## Definition

The Clebsch surface is the set of points (x0:x1:x2:x3:x4) of P4 satisfying the equations

${\displaystyle x_{0}+x_{1}+x_{2}+x_{3}+x_{4}=0,}$
${\displaystyle x_{0}^{3}+x_{1}^{3}+x_{2}^{3}+x_{3}^{3}+x_{4}^{3}=0.}$

Eliminating x0 shows that it is also isomorphic to the surface

${\displaystyle x_{1}^{3}+x_{2}^{3}+x_{3}^{3}+x_{4}^{3}=(x_{1}+x_{2}+x_{3}+x_{4})^{3}}$

in P3.

The symmetry group of the surface is the symmetric group S5 of order 120, acting by permutations of the coordinates (in P4). Up to isomorphism, the Clebsch surface is the only cubic surface with this automorphism group.

## Properties

The 27 exceptional lines are:

• The 15 images (under S5) of the line of points of the form (a : −a : b : −b : 0).
• The 12 images of the line though the point (1:ζ: ζ2: ζ3: ζ4) and its complex conjugate, where ζ is a primitive 5th root of 1.

The surface has 10 Eckardt points where 3 lines meet, given by the point (1 : −1 : 0 : 0 : 0) and its conjugates under permutations. Hirzebruch (1976) showed that the surface obtained by blowing up the Clebsch surface in its 10 Eckardt points is the Hilbert modular surface of the level 2 principal congruence subgroup of the Hilbert modular group of the field Q(5). The quotient of the Hilbert modular group by its level 2 congruence subgroup is isomorphic to the alternating group of order 60 on 5 points.

Like all nonsingular cubic surfaces, the Clebsch cubic can be obtained by blowing up the projective plane in 6 points. Klein (1873) described these points as follows. If the projective plane is identified with the set of lines through the origin in a 3-dimensional vector space containing an icosahedron centered at the origin, then the 6 points correspond to the 6 lines through the icosahedron's 12 vertices. The Eckardt points correspond to the 10 lines through the centers of the 20 faces.

## References

• Clebsch, A. (1871), "Ueber die Anwendung der quadratischen Substitution auf die Gleichungen 5ten Grades und die geometrische Theorie des ebenen Fünfseits", Mathematische Annalen, 4 (2): 284–345, doi:10.1007/BF01442599
• Hirzebruch, Friedrich (1976), "The Hilbert modular group for the field Q(√5), and the cubic diagonal surface of Clebsch and Klein", Russian Math. Surveys, 31 (5): 96–110, doi:10.1070/RM1976v031n05ABEH004190, ISSN 0042-1316, MR 0498397
• Hunt, Bruce (1996), The geometry of some special arithmetic quotients, Lecture Notes in Mathematics, 1637, Berlin, New York: Springer-Verlag, doi:10.1007/BFb0094399, ISBN 978-3-540-61795-2, MR 1438547
• Klein, Felix (1873), "Ueber Flächen dritter Ordnung", Mathematische Annalen, Springer Berlin / Heidelberg, 6 (4): 551, doi:10.1007/BF01443196


text:
## Page Views on Nuit Blanche since July 2010

My papers on ArXiv:
Approximating Kernels at the speed of Light
&
Imaging with Nature

LightOn
LinkedIn (727)|| on CrunchBase || our Blog
(2452)
Compressive Sensing on LinkedIn
(3967)
(1333)||
Attendant references pages:
The Advanced Matrix Factorization Jungle Page ||

Paris Machine Learning
@Meetup.com (8016 members) || @Archives

## Wednesday, December 02, 2009

### CS: Hype or Hope, Herschel news ?, Sparsity Pattern Recovery in the Noisy Setting, Cognitive Radio, CS on Least Squares Residual, Dictionary learning

Enjoy this sighting as the shuttle program will shut down in 2010.

Unrelated, did you know there were 20 probes flying around the solar system ?

There is a new online talk entitled Compressive Sensing for Computer Vision: Hype vs Hope by Rama Chellappa.

If you check the right hand side of this blog, you'll see that you can directly access the arxiv with a complex query having most of the words used for compressive sensing. The result of the query is here : http://tinyurl.com/y9v8t4a

Unbeknownst to me Jean-Luc Starck made a presentation last week in Australia:

Compressed Sensing in Astronomy - Jean-Luc Starck Special Colloquium
Friday 27 November 2009
15:30 to 16:30

ATNF Marsfield Lecture Theatre

Abstract: The spatial infrared astronomical satellite Herschel, launched on May 14 2009, is the first satellite which has a compressed sensing (CS) coder included in its on board software. We will present our motivations for using Compressed Sensing in this project. Then we will describe the practical implementation of our CS coder/decoder. We will show from simulations that CS enables to recover data with a spatial resolution enhanced up to 30% with similar sensitivity compared to the averaging technique proposed by ESA. Finally we will show how other problems in astronomy such interferometric image deconvolution or gamma ray image reconstruction can be also handled differently using CS.

Is the compressive sensing encoding scheme going to be used in production for PACS ? This suspense is killing me!

I also found the following on arxiv:
An Estimation Theoretic Approach for Sparsity Pattern Recovery in the Noisy Setting by Ali Hormati, Amin Karbasi, Soheil Mohajer, Martin Vetterli. The abstract reads:

Compressed sensing deals with the reconstruction of sparse signals using a small number of linear measurements. One of the main challenges in compressed sensing is to find the support of a sparse signal. In the literature, several bounds on the scaling law of the number of measurements for successful support recovery have been derived where the main focus is on random Gaussian measurement matrices. In this paper, we investigate the noisy support recovery problem from an estimation theoretic point of view, where no specific assumption is made on the underlying measurement matrix. The linear measurements are perturbed by additive white Gaussian noise. We define the output of a support estimator to be a set of position values in increasing order. We set the error between the true and estimated supports as the $\ell_2$-norm of their difference. On the one hand, this choice allows us to use the machinery behind the $\ell_2$-norm error metric and on the other hand, converts the support recovery into a more intuitive and geometrical problem. First, by using the Hammersley-Chapman-Robbins (HCR) bound, we derive a fundamental lower bound on the performance of any \emph{unbiased} estimator of the support set. This lower bound provides us with necessary conditions on the number of measurements for reliable $\ell_2$-norm support recovery, which we specifically evaluate for uniform Gaussian measurement matrices. Then, we analyze the maximum likelihood estimator and derive conditions under which the HCR bound is achievable. This leads us to the number of measurements for the optimum decoder which is sufficient for reliable $\ell_2$-norm support recovery. Using this framework, we specifically evaluate sufficient conditions for uniform Gaussian measurement matrices.
LS-CS: Compressive Sensing on Least Squares Residual by Namrata Vaswani. The abstract reads:
We consider the problem of recursively reconstructing time sequences of sparse signals (with unknown and time-varying sparsity patterns) from a limited number of linear incoherent measurements with additive noise. The signals are sparse in some transform domain referred to as the sparsity basis and the sparsity pattern is assumed to change slowly with time. The idea of our proposed solution, LS-CS-residual (LS-CS), is to replace compressed sensing (CS) on the observation by CS on the least squares (LS) observation residual computed using the previous estimate of the support. We bound the CS-residual error and show that when the number of available measurements is small, the bound is much smaller than that on CS error if the sparsity pattern changes slowly enough. We also obtain conditions for "stability" of LS-CS over time for a simple deterministic signal model of coefficient addition/removal and coefficient magnitude increase/decrease which has bounded signal power. By "stability", we mean that the number of misses and extras in the support estimate is bounded by a small value compared to the support size, at all times. Extensive simulation results backing our claims are shown

Mixed-Signal Parallel Compressed Sensing and Reception for Cognitive Radio by Zhuizhuan Yu, Sebastian Hoyos, Brian M. Sadler. The abstract reads:
A parallel structure to do spectrum sensing in Cognitive Radio (CR) at sub-Nyquist rate is proposed. The structure is based on Compressed Sensing (CS) that exploits the sparsity of frequency utilization. Specifically, the received analog signal is segmented or time-windowed and CS is applied to each segment independently using an analog implementation of the inner product, then all the samples are processed together to reconstruct the signal. Applying the CS framework to the analog signal directly relaxes the requirements in wideband RF receiver front-ends. Moreover, the parallel structure provides a design flexibility and scalability on the sensing rate and system complexity. This paper also provides a joint reconstruction algorithm that optimally detects the information symbols from the sub-Nyquist analog projection coefficients. Simulations showing the efficiency of the proposed approach are also presented.

In a different direction, we have:
Reference Free Structure Determination through Eigenvectors of Center of Mass Operators by Ronald R. Coifman, Yoel Shkolnisky, Fred J. Sigworth, Amit Singer. The abstract reads:

Recovering the three-dimensional structure of molecules is important for understanding their functionality. We describe a spectral graph algorithm for reconstructing the three-dimensional structure of molecules from their cryo-electron microscopy images taken at random unknown orientations. We first identify a one-to-one correspondence between radial lines in three-dimensional Fourier space of the molecule and points on the unit sphere. The problem is then reduced to determining the coordinates of points on the sphere given a subset of their pairwise geodesic distances. To recover those coordinates, we exploit the special geometry of the problem, as rendered by the Fourier projection-slice theorem, to construct a weighted graph whose vertices are the radial Fourier lines and whose edges are linked using the common line property. The graph organizes the radial lines on the sphere in a global manner that reveals the acquisition direction of each image. This organization is derived from a global computation of a few eigenvectors of the graph’s sparse adjacency matrix. Once the directions are obtained, the molecule can be reconstructed using classical tomography methods. The presented algorithm is direct (as opposed to iterative refinement schemes), does not require any prior model for the reconstructed object, and is shown to have favorable computational and numerical properties. Moreover, the algorithm does not impose any assumption on the distribution of the projection orientations. Physically, this means that the algorithm is applicable to molecules that have unknown spatial preference.

Olivier Grisel
also pointed out to me another dictionary learning technique: Fast Inference in Sparse Coding Algorithms with Applications to Object Recognition by Koray Kavukcuoglu Marc’Aurelio Ranzato, Yann LeCun. The abstract reads:
Adaptive sparse coding methods learn a possibly overcomplete set of basis functions, such that natural image patches can be reconstructed by linearly combining a small subset of these bases. The applicability of these methods to visual object recognition tasks has been limited because of the prohibitive cost of the optimization algorithms required to compute the sparse representation. In this work we propose a simple and efficient algorithm to learn basis functions. After training, this model also provides a fast and smooth approximator to the optimal representation, achieving even better accuracy than exact sparse coding algorithms on visual object recognition tasks.

I could not find the following papers freely available on the web: Compressive Imaging: An Application by Robert Muise. The abstract reads:
We consider the application of compressive imaging theory to the problem of wide-area persistent surveillance. While the compressive sensing theory enjoys significant research attention, mainly because of the possibilities for orders-of-magnitude increases in signal/image processing applications, the application areas for compressive imaging have not kept pace due to the lack of an optical architecture which could directly improve current sensing capabilities. There are now cases in the literature and under study where optical architectures have been developed which require the incorporation of compressive imaging in order to perform the indicated exploitation application. This paper utilizes one such architecture to show a dramatic (two orders of magnitude) increase in performance for the application of wide-area persistent surveillance. This application together with its architecture is described as a field-of-view (FOV) multiplexing imager, and its relation to compressive imaging is discussed and exploited for increased field-of-regard (FOR) imaging. A simulated example is given in the last section with qualitatively impressive results. The optical architecture of FOV multiplexing, while showing a significant performance increase over current capabilities, also opens some interesting research questions.

Compressive Sensing of Light Fields by S.D. Babacan; R. Ansorge; M. Luessi; R. Molina; A.K. Katsaggelos. The abstract reads:
We propose a novel camera design for light field image acquisition using compressive sensing. By utilizing a randomly coded non-refractive mask in front of the aperture, incoherent measurements of the light passing through different regions are encoded in the captured images. A novel reconstruction algorithm is proposed to recover the original light field image from these acquisitions. Using the principles of compressive sensing, we demonstrate that light field images with high angular dimension can be captured with only a few acquisitions. Moreover, the proposed design provides images with high spatial resolution and signal-to-noise-ratio (SNR), and therefore does not suffer from limitations common to existing light-field camera designs. Experimental results demonstrate the efficiency of the proposed system.

Finally, here is a handy thesaurus translating terms between Numpy/python-R-Matlab here.

Credit: NASA


text:
## Algebra 1

Slope-intercept form is written as y=mx+b, where m is the slope and b is the y intercept. Since m=$\frac{y_{2}-y_{1}}{x_{2}-x_{1}}$, and it's given that $x_{1}$=-3, $x_{2}$=2, $y_{1}$=4, and $y_{2}$=-1, we can find m by plugging in the givens into the slope equation. m=$\frac{-1-4}{2-(-3)}$=$\frac{-5}{5}$=-1. Now we know the y=(-1)x+b=-x+b, and we can solve for b by plugging in a point, in this case we'll plug in the point (-3,4). Therefore, 4=-(-3)+b=3+b, and solving for b, b=1. Therefore, y=-x+1


text:
# $\pi$ — what's in a number? Add to your resource collection Remove from your resource collection Add notes to this resource View your notes for this resource
The number $\pi$ is irrational: we cannot write it as a fraction; its decimal expansion is infinite and doesn’t end in a repeating block of numbers. In fact, if we look at the first hundred digits of that expansion, \begin{align*} 3.&14159 26535 89793 23846 26433 83279 50288 41971 69399 37510 \\ &58209 74944 59230 78164 06286 20899 86280 34825 34211 70679, \end{align*}
Many mathematicians believe that the digits of $\pi$ really do have all the properties that a random sequence would have. But what does that mean? One prerequisite for randomness is that each of the digits from $0$ to $9$ should appear in equal proportion ($1/10$th of the time), each pair of digits should appear in equal proportion ($1/100$th of the time), each triple should appear in equal proportion $(1/1000$th of the time), and so on. That’s what you would expect to happen if you cast a fair ten-sided die an infinite number of times and built a decimal from that. A sequence of numbers that has this property is called normal. Mathematicians believe that the sequence given by the decimal expansion of $\pi$ is normal, but they haven’t been able to prove it yet.
Normality has a curious consequence: it means that every sequence of digits would occur somewhere in the sequence. There are ways of translating text into numbers, for example one such is ASCII code in which a space is coded as 032, an A as 065 etc. This would mean that every name of every person who has ever lived or will live should be coded somewhere in the digits of $\pi$. For instance the name Jan has the ASCII code 074097110. There are $10^9$ possible different sequences of $9$ digits which theory suggests should all exist the same number of times somewhere in the digits of $\pi$; on average $1$ in every $10^9$ of these strings would encode the name Jan in ASCII. This also means that if we take long enough strings of digits every text that has ever been written, or will be written, would appear somewhere in the expansion of $\pi$ (if it is indeed normal). The Bible, the complete works of Shakespeare, and the secret of the universe (if there is one) would all be encoded somewhere in $\pi$. No wonder so many people are fascinated by this number!


text:
Calculate: 8 x+1 x = 9

Expression: $$8 x + 1 x = 9$$

Combine $8x$ and $1x$ to get $9x$.

$$9x=9$$

Divide both sides by $9$.

$$x=\frac{9}{9}$$

Divide $9$ by $9$ to get $1$.

$$x=1$$

Random Posts
Random Articles


text:
Archived information

Archived information is provided for reference, research or recordkeeping purposes. It is not subject to the Government of Canada Web Standards and has not been altered or updated since it was archived. Please contact us to request a format other than those available.

Introduction

Mandate of the Department of Finance Canada

Interpretation of the Statistical Report

Complaints/Investigations

Appeals to the Federal Court of Canada

APPENDIX A - Statistical Report on the Access to Information Act Requests

## Introduction

This Annual Report to Parliament on the Administration of the Access to Information Act (the Act) within the Department of Finance Canada is being submitted in accordance with section 72 of the Act and covers the period from April 1, 2009, to March 31, 2010.

The Act came into force on July 1, 1983. It gives Canadian citizens, permanent residents, or any person or corporation present in Canada a right to access information that is contained in government records.

The Department of Finance Canada recognizes that the right of access to information in records under the control of the Department and other federal government institutions is an essential element of our system of democracy. The Department is committed to openness and transparency, respecting both the spirit and the requirements of the Act, its Regulations and its related policy instruments.

The Department further acknowledges the importance of facilitating access to records by requiring that its employees make every reasonable effort to assist applicants.

## Mandateof the Department of Finance Canada

The Department of Finance Canada is the federal government central agency responsible for providing advice on all aspects of Canada’s economic and financial affairs. Concerned with the performance of the Canadian economy, it oversees all initiatives that affect the economy and follows the development of external factors that bear on domestic economic performance.

The Department is committed to making a difference for Canadians by helping the Government of Canada develop and implement strong and sustainable economic, fiscal, tax, social, security, international, and financial-sector policies and programs. It plays an important role in ensuring that government spending is focussed on results and delivers value for taxpayer dollars. The Department interacts extensively with other federal departments and agencies and plays a pivotal role in the analysis and design of public policy across a wide range of issues affecting Canadians.

The Department’s most visible output is the federal budget. The budget speech provides an authoritative review of past, present, and future economic factors that will affect Canada’s economic performance and finances. The budget reviews government accounts for the past period and presents its fiscal projections for the coming years. These include the government’s expenditure program, revenues from existing sources, taxation changes, and debt levels. The Minister of Finance has a number of statutory responsibilities and plays a significant role as central policy advisor.

Specifically, the Department’s ministerial and departmental functions are as follows:

### Program(or statutory) responsibilities and core functions

• Fiscal and monetary policy
• Budget preparation and planning
• Tax policy
• Debt and exchange fund management
• Tariff and certain aspects of trade and
tariff policy
• Financial sector policy
• International financial arrangements
• Federal‑provincial fiscal arrangements (policy and program administration)
• Private pension policy and public pension financing
• Privatization

### Centralagency functions

• Development of the fiscal framework
• Preparation of the economic outlook and forecast
• Analysis and assessment of major policy initiatives and options
• Shared supervision of Crown corporations and agencies
• Coordination with other central agencies on key files

### Accessto Information and Privacy Division

The Access to Information and Privacy (ATIP) Division is responsible for administering the Act for the Department of Finance Canada. As a centralized operation, the ATIP Division coordinates the timely processing of requests under the legislation, conducts interdepartmental consultations, handles complaints lodged with the Information Commissioner, and responds to informal inquiries. ATIP staff also provides advice, guidance and training to departmental officials on matters involving the Act.

The ATIP Division comprises a director, two team leaders, nine full-time ATIP analysts, one part-time analyst, and two administrative assistants.

### Educationaland training activities

During the past year, the ATIP Division organized eight educational and training activities for all branches of the Department. It also participated in four of the Department’s orientation sessions, providing information about the Act and proper information management procedures to 126 employees new to the Department. In addition, ATIP provided three Access to Information Act training sessions that included a total of 83 employees. Ad hoc training was also provided as needed or requested by departmental branches or individuals.

No new policies, guidelines or procedures were implemented during the reporting period.

### Delegationof authority

The delegation of authority that was approved on March 31, 2008, remained in effect throughout the reporting period. Depending on the nature of the information requested and its sensitivity, the authority to approve or deny the release of departmental information requested under the Act is shared by the Deputy Minister, the Associate Deputy Minister and G7 Deputy for Canada, the Associate Deputy Minister, the Assistant Deputy Minister and Counsel to the Department, and the Access to Information and Privacy Director. Generally, the ATIP Director approves all exemptions.

Schedule 1
Powers, duties, or functions Section Deputy Minister Associate DM Associate DM and G7 Deputy  for Canada Assistant  DM and Counsel, Law Branch Director, ATIP ATIP Team Leader Senior ATIP Analyst
Reasonable effort to assist, respond accurately and completely and provide timely access in the format requested 4(2.1) Yes Yes Yes Yes Yes No
To give notice to applicant that access will be given 7(a) Yes Yes Yes Yes Yes No
To give access to the record 7(b) Yes Yes Yes Yes Yes No
To transfer to another institution or to accept transfer from another institution and to give notice to applicant 8(1) Yes Yes Yes Yes Yes Yes
To extend time limit and give notice 9 Yes Yes Yes Yes Yes Yes
No records exist 10 Yes Yes Yes Yes Yes Yes
To require payment of additional fees 11(2) Yes Yes Yes Yes Yes Yes
To require payment for machine readable record 11(3) Yes Yes Yes Yes Yes Yes
To require payment of a deposit 11(4) Yes Yes Yes Yes Yes Yes
To give notice of amount required 11(5) Yes Yes Yes Yes Yes Yes
To waive the requirement to pay a fee 11(6) Yes Yes Yes Yes Yes Yes
To determine whether a record should be translated 12(2) Yes Yes Yes Yes Yes Yes
To determine whether a record should be provided in an alternative format 12(3) Yes Yes Yes Yes Yes Yes
To refuse to disclose a record referred to in that section 13 Yes Yes Yes Yes Yes No
To refuse to disclose a record referred to in that section 14 Yes Yes Yes Yes Yes No
To refuse to disclose a record referred to in that section 15 Yes Yes Yes Yes Yes No
To refuse to disclose a record referred to in that section 16 Yes Yes Yes Yes Yes No
To refuse to disclose a record referred to in that section 16.5 Yes Yes Yes Yes Yes No
To refuse to disclose a record referred to in that section 17 Yes Yes Yes Yes Yes No
To refuse to disclose a record referred to in that section 18 Yes Yes Yes Yes Yes No
To refuse to disclose a record referred to in that section 18.1 Yes Yes Yes Yes Yes No
To refuse to disclose a record referred to in that section 19 Yes Yes Yes Yes Yes No
To refuse to disclose a record referred to in that subsection 20(1) Yes Yes Yes Yes Yes No
To disclose part of a record referred to in that subsection 20(2) Yes Yes Yes Yes Yes No
To disclose part of a record referred to in that subsection and provide written explanation 20(3) Yes Yes Yes Yes Yes No
To disclose, with the consent of third party, a record referred to in subsection 20(1) 20(5) Yes Yes Yes Yes Yes No
To disclose, in the public interest, a record referred to in paragraphs 20(1)(b),(c) or (d) 20(6) Yes Yes Yes Yes Yes No
To refuse to disclose a record referred to in that subsection 21(1) Yes Yes Yes Yes Yes No
To refuse to disclose a record referred to in that section 22 Yes Yes Yes Yes Yes No
To refuse to disclose a record referred to in that section 22.1 Yes Yes Yes Yes Yes No
To refuse to disclose a record referred to in that section 23 Yes Yes Yes Yes Yes No
To refuse to disclose a record referred to in that section 24 Yes Yes Yes Yes Yes No
To disclose information that can reasonably be severed 25 Yes Yes Yes Yes Yes No
To refuse to disclose a record referred to in that section 26 Yes Yes Yes Yes Yes No
To give to third party notice of intent to disclose 27(1) Yes Yes Yes Yes Yes Yes
To extend time limit set out in 27(1) 27(4) Yes Yes Yes Yes Yes Yes
To decide on disclosure after third party representation and to give notice of decision to third party 28(1) Yes Yes Yes Yes Yes No
To waive requirement for written representations 28(2) Yes Yes Yes Yes Yes No
To give access unless review of decision is requested 28(4) Yes Yes Yes Yes Yes No
To give notice to applicant and to third party 29(1) Yes Yes Yes Yes Yes Yes
To advise the Information Commissioner of any third party who received notification or, if the document would have been disclosed, would have received notification 33 Yes Yes Yes Yes Yes Yes
To make representations to the Information Commissioner 35(2) Yes Yes Yes Yes Yes Yes
To give notice to the Information Commissioner that access to a record will be given 37(4) Yes Yes Yes Yes Yes Yes
To give notice to a third party of application for Court review 43(1) Yes Yes Yes Yes Yes Yes
To give notice to applicant that third party has applied for Court review 44(2) Yes Yes Yes Yes Yes Yes
To request hearing in the National Capital Region 52(2) Yes Yes Yes Yes Yes Yes
To request opportunity to make representations ex parte 52(3) Yes Yes Yes Yes Yes Yes
To provide facilities where manuals may be inspected by public 71(1) Yes Yes Yes Yes Yes Yes
To exempt information severed from manuals 71(2) Yes Yes Yes Yes Yes No
To prepare annual report for submission to Parliament 72(1) Yes Yes Yes Yes Yes Yes
To carry out responsibilities conferred on the Head of the institution by regulations made under section 77 which are not included above. 77 Yes Yes Yes Yes Yes Yes

The reading room, located in the Department’s library, is available to individuals who wish to view the records released by the Department in response to their access requests. This facility contains current volumes of Info Source, previous annual reports to Parliament, and Access to Information Request Forms.

## Interpretationof the Statistical Report

The number of requests received under the Act in this reporting period was 310, a 4.4% decrease from 324 requests the previous reporting year. This is the third consecutive decrease since
2006–07 when 444 requests were received. This reporting year, the total number of requests considered was 375 as 65 requests remained outstanding from 2008–09. By the end of 2009–10, 309 requests had been completed, with 66 carried forward to 2010–11.

In 2009–10, the ATIP Division also received 120 new consultations from other departments on matters of interest to the Department of Finance Canada. By the end of the year, 122 had been completed (includes some consultations that were carried over from the previous fiscal year).

While more than half the requests this year came from business (54.8%), this is not an overly large increase from the previous year of 46.9%. The largest differences were seen in the number of requests received from the public (a 10.1% increase, or 30 requests) and from organizations (a 9.2% decrease, also 30 requests). The next largest difference had to do with the number of requests received from the media (a decrease of 7.1%, or 26 requests). Requests received from members of the remaining category, academia, decreased slightly by 1.9%, or six requests.

Source 2008–09 2009–10
Public 28 8.6 % 58 18.7 %
Media 94 29.0 % 68 21.9 %
Business 152 46.9 % 170 54.8 %
Academia 9 2.8 % 3 0.9 %
Organizations 41 12.7 % 11 3.5 %

To determine whether there had been any noteworthy differences over the years as to the sources of requests, this year’s figures were compared to the average number of requests by category over a five-year span.

Source Average
2004–05 to 2008–09
(rounded figures)
2009–10
Public 46 12.8 % 58 18.7 %
Media 106 29.6 % 68 21.9 %
Business 159 44.5 % 170 54.8 %
Academia 4 1 % 3 0.9 %
Organizations 40 11.2 % 11 3.5 %

### Dispositionof requests

The following table indicates the disposition of the 309 requests completed during this reporting period:

Disposition Number
of Requests
Percentage
of Requests
All disclosed 25 8.1 %
Disclosed in part 158 51.2 %
Nothing disclosed (excluded) 2 0.6 %
Nothing disclosed (exempt) 2 0.6 %
Transferred 2 0.6 %
Unable to process 108 35.0 %
Abandoned by applicant 11 3.5 %
Treated informally 1 0.3 %
Total 309 99.9 %

#### Records fully disclosed

In 8.09% of the 309 requests completed (25 cases), the applicants were provided full access to the records they requested.

#### Records partially disclosed

In the majority of cases (51.13%, or 158 requests), some exemptions and/or exclusions needed to be invoked before the records could be provided to the applicants.

#### No records disclosed

In only four cases (1.29%) was the Department required to deny access to records in their entirety.

#### Requests transferred

Only two requests were transferred to other government institutions that had a greater interest in the records being sought by the applicants.

#### Unable to process

No relevant records were found regarding 108 requests (34.95% of cases). The majority of these (73 files) were responses to a group of applicants who submit monthly requests for comfort letters.

#### Abandoned

In 11 cases, applicants either failed to clarify the nature of their requests or were unwilling to pay the requisite fees and, therefore, the requests were abandoned.

#### Treated informally

Only one of the 309 requests completed was treated on an informal basis.

This year, the ATIP Division wished to see whether the disposition of completed requests had changed over the last few years. A comparison was made between this year’s figures and the average disposition rates over a five-year period.

Disposition Average
2004–05 to 2008–09 (rounded figures)
2009–10
All disclosed 31 9 % 25 8.1 %
Disclosed in part 207 58 % 158 51.2 %
Nothing disclosed (excluded) 6 1 % 2 0.6 %
Nothing disclosed (exempt) 3 1 % 2 0.6 %
Transferred 2 1 % 2 0.6 %
Unable to process 86 24 % 108 35.0 %
Abandoned by applicant 19 5 % 11 3.5 %
Treated informally 3 1 % 1 0.3 %
Average # Completed / Completed 2009–10 357 100 % 309 99.9 %

### Exemptionsinvoked and exclusions cited

During the period, the following exemptions were invoked:

Sections of the Act General Provisions Number of Files
Where Applied
Section 13 Information obtained in confidence from other governments 40
Section 14 Federal-provincial affairs 70
Section 15 International affairs and defence 35
Section 16 Law enforcement and investigations 13
Section 17 Safety of individuals 1
Section 18 Economic interests of Canada 118
Section 19 Personal information 76
Section 20 Third party information 100
Section 21 Operations of government 227
Section 22 Testing procedures, tests and audits 3
Section 23 Solicitor-client privilege 19
Section 24 Statutory prohibitions 10
Section 26 Information to be published 2

During this reporting period, the following exclusions applied:

Sections of the Act General Provisions Number of Files
Where Applied
Section 68 Published material 6
Section 69 Confidences of the
Queen’s Privy Council
49

### Completiontime

This year, 90.6% of closed requests were completed on time. This is slightly better than last year’s reporting rate of 90.1%. The Department is committed to maintaining or improving its compliance rate in responding to requests under the Act.

Of the 309 requests completed during the reporting period, 173 (or 55.98%) were completed within 30 days, 48 (or 15.53%) were completed within 31 to 60 days, 46 (or 14.88%) were completed within 61 to 120 days, and 42 (or 13.59%) were completed in 121 days or over. Requests taking 121 days or more to complete usually involved voluminous files that required extensive internal consultations, consultations with third parties, and consultations with other government institutions.

The Department has not been the subject of a Report Card by the Office of the Information Commissioner (OIC) for quite some time. However, it has conducted self-assessments using the OIC’s mathematical formula to determine its “grade.” The self-assessment resulted in a “C” in 2005–06 and a constant “B” from 2006 to 2009. In the 2009–10 self-assessment, the Department has again attained a “B” grade.

### Extensions

During the reporting period, extensions of 30 days or less were invoked as follows:

 Searching for large number of records 16 Consultation with other government institutions 22 Notification of third parties 19

Extensions of 31 days or over were invoked as follows:

 Searching for large number of records 9 Consultation with other government institutions 59 Notification of third parties 42

### Translations

No requests for translations were received.

### Method of access

In 183 cases, access was provided to the applicants either on paper or by compact disk. No applicants asked to view the records they had requested as opposed to receiving a copy.

### Fees

There have been no changes to the departmental fee policy. With the exception of the $5.00 application fee, fees assessed at less than$25.00 are waived.

During this reporting year, $1,825.00 in fees were collected, approximately$2,600 less than in the previous reporting year. This is largely due to an increase in demand for records in compact disk format.

### Costs

Costs incurred during the reporting period are calculated based on the salaries of ATIP staff
(14 full-time employees and one part-time employee) and the administrative expenses associated with administration of the Act. Costs do not include the salaries of other departmental officials and support staff involved in processing requests (i.e., search, collection, and initial review of documents). See Appendix A for cost details.

## Complaints/Investigations

Complaints filed

There were 14 complaints initiated against the Department, which represents 4.5% of the requests completed during the reported period. The categories of the complaints are as follows:

Reasons for Complaint Complaints
Refusal (general or exemption) 7
Refusal (exclusion, section 69) 3
Extension 2
Delay 2

Complaints

Of the 14 complaints received this fiscal year, three were deemed to be not well-founded by the Information Commissioner, seven were resolved, and two were discontinued. Findings have yet to be rendered regarding the remaining two files, one of which is a complaint about the exemptions claimed, while the other concerns an extension of the statutory time limit. The Information Commissioner’s investigations did not raise any specific issues or concerns.

# Appealsto the Federal Court of Canada

No appeals to the Federal Court were made in this reporting period.