I am trying to create a script to protect my formulas in sheets that co-workers will use. I have 10 workbooks with 26 sheets each, all are virtually identical as far as the the locations of the protected and unprotected ranges.   As far as I can tell the best way to do this is to protect the whole sheet then unprotect certain cells for data entry.   This is the script I have so far, I've cut out about 90% of the ranges I need unprotected to make it smaller.  function ProtectRanges() {   var sheet = SpreadsheetApp.getActiveSheet();   var protection = sheet.protect().setDescription("Protect Formulas");   var unprotected = sheet.getRange("S6:AF51")   sheet.getRange("S66:AF66")   sheet.getRange("S70:AF70")   sheet.getRange("S72:AF72")   var me = Session.getEffectiveUser();   protection.addEditor(me);   protection.removeEditors(protection.getEditors());   if (protection.canDomainEdit()) {     protection.setDomainEdit(false);   }  }   The problem I'm having is that the people that I share this with can't edit any of the cells, protected or not. I need to be the only one who can edit the formulas, but the data entry cells need to be open for them to edit.
I have created 50 spreadsheets for 50 students. Each spreadsheet contains 33 sheets, numbered 1 to 33, along with a couple of other sheets.  Within each of these 33 sheets, there are many protected ranges.  I accidentally protected a range that ought not to have been protected. So, with 50 students each having 33 sheets, I have over 1800 sheets to unprotected.  I want to loop through each sheet, 1 to 33, and remove protection from cell F15. Right now, I (the owner) am the only editor.  Since I'm not an actual programmer, I've clearly not done this properly.  Can someone offer a suggestion of how I can change my Google Script to make this work?  var ss = SpreadsheetApp.getActiveSpreadsheet(); var sheets = ss.getSheets();  for (var i=2; i  &lt;sheets.length; i++) {   var sheet = ss.getSheets()[i];   sheet.activate();   SpreadsheetApp.flush();   var range = sheet.getRange('F15');        var protection = range.protect().setDescription('Protected range');        var me = Session.getEffectiveUser();        protection.addEditor(me);        protection.removeEditors(protection.getEditors());        if (protection.canDomainEdit()) {          protection.remove();          } //end of if statement  }
Node only partially rendered near edge of plot I'm trying to draw a relatively simple chart of a number line, and when one of the nodes is too close to the edge of the plot, it gets cut off.  The code:  \documentclass{article}  \usepackage{natbib} \usepackage{graphicx} \usepackage{pgfplots}  \begin{document}  \begin{tikzpicture} \begin{axis}[   width=\columnwidth,   axis y line=none,   axis lines=left,   axis line style={-},   xmin=0,   xmax=1,   ymin=0,   ymax=1,   xlabel=$\mu$,   scatter/classes={o={mark=*}},   restrict y to domain=0:1,   xtick={0,1} ] \draw[ultra thin] (axis cs:0, 0) -- (axis cs:0,.05); \draw[ultra thin] (axis cs:.4, 0) -- (axis cs:.4,.05); \node[coordinate,label=above:{$B$}] at (axis cs:0.0,0.05) {}; \node[coordinate,label=above:{$A$}] at (axis cs:0.4,0.05) {}; \node[coordinate,label=above:{$b$}] at (axis cs:0.2,0.02) {}; \node[coordinate,label=above:{$a$}] at (axis cs:0.7,0.02) {}; \end{axis}; \end{tikzpicture} \end{document}   The Result:    How do I get the B to fully render? How to compute $k$'th roots $\!\bmod n$? I have the following equation: $$ n \equiv M^k\mod(b) $$ where n, a, b are integers, and M is unknown. How do I solve this equation to find the M value? Those a and b are public keys of the RSA algorithm and n is the result of encryption. I need to find the encrypted message. Do the Faceless Men take more than just a face? How can the speed of sound increase with an increase in temperature? Inverse images of images, images of inverse images of a set of vectors What can be said about$\ f^{-1}(f(S))$ and$\ S$, where$\ f(S):=\{f(x):x \in S\}$?   I feel as if$\ f^{-1}(f(S))$ will be smaller than or equal in size (number of elements) to$\ S$.  For example, if$\ f(x)=x$, then$\ f(\{-1, 0, 1, 2\})=\{-1, 0, 1, 2\}$and$\ f^{-1}(f\{-1, 0, 1, 2\})=\{-1, 0, 1, 2\}$ (same size).  But if$\ f(x)=x^2$, then$\ f(\{-1, 0, 1, 2\})=\{0, 1, 4\}$ and$\ f^{-1}(f\{0, 1, 4\})=\{0, 1, 2\}$, which is a little bit smaller than$\ S$.   What can be said about$\ f(f^{-1}(U))$ and$\ U$, where$\ f^{-1}(U):=\{x \in X:f(x) \in U\}$?   The same size as each other? Always?? If a subring of a ring R has identity, does R also have the identity? I know it does not make sense that if a subring of a ring $R$ is commutative, then $R$ is also commutative. (For example, the set consisting of the matrices whose all entries except (1,1)-entry are zero, is a subring of ring of 2x2 real matrices.)  I also considered the case of a ring containing a subring with identity, but I had no ideas. Maybe it seems that it does not make sense, either.  Who give me some examples supporting my guess? Identifying Coordinate System of Shapefile when Unknown? A fiber bundle over Euclidean space is trivial. What's the easiest way to see this? The only thing I could think of was to try to patch together trivializations. I couldn't find a way to make that work. Thank you! edit: For the record, here's why I asked about this special case of the more general result about fiber bundles over contractible spaces. In the much beloved book by Bott and Tu, it's claimed that the Leray Hirsch theorem can be proven in the same way the Kunneth theorem is proven:  induct on the size of a finite good cover for the base space, then apply the Mayer Vietoris sequence and the Poincare lemma for the induction step. It's assumed that there exists a finite good cover for the base space, but it's not assumed that this cover is a refinement of the cover of the base space, which gives the local trivializations of the fiber bundle. Therefore, to apply the Poincare lemma in the induction step, it seems that you need to know that the result I asked about is true. Since fiber bundles had just been introduced in the text, I thought there may be a short, elementary proof that the authors had taken for granted. recover data after using dd command Difference between $\mathbb C$ and $\mathbb R^2$ What are the basic differences between $\mathbb C$ and $\mathbb R^2$?  The points in these two sets are written as ordered pairs, I mean the structure looks similar to me. So what is the reason to denote these two sets differently? I've working LDAP authentication with the following setup   AuthName            "whatever"  AuthType            Basic  AuthBasicProvider   ldap  AuthLDAPUrl         "ldap://server/OU=SBSUsers,OU=Users,OU=MyBusiness,DC=company,DC=local?sAMAccountName?sub?(objectClass=*)"  Require ldap-group  CN=MySpecificGroup,OU=Security Groups,OU=MyBusiness,DC=company,DC=local   This works, however I've to put all users I want to authenticate into MySpecificGroup. But on LDAP server I've configured that MySpecificGroup also contains the group MyOtherGroup with another list of users.  But those users in MyOtherGroup are not authenticated, I've to manually add them all to MySpecificGroup and basically can't use the nested grouping. I'm using Windows SBS 2003.  Is there a way to configure Apache LDAP to do this? Or is there a problem with possible infinite recursion and thus not allowed? How can I completely remove ecryptfs from my system and delete .Private? Few days back I have installed ecryptfs, created a private directory using it. Now my Ubuntu login became super slow. I have tried removing ecryptfs from Synaptic. I found It, it can not be deleted that way. Somewhere I have read about this command  ecryptfs-setup-private --undo   But this command displays a rather confusing list of commands on terminal. I don't want to mess up my installation, neither want to loose my administrator account.  Now my question is, how can I safely remove /home/user/Private (.Private) and remove ecryptfs encryption ? Training N classifiers for N labels vs one classifier with N labels I have a classification problem which is multi-label with N labels. I would like to know which method would be the better choice? Training N classifiers (1 for each label) or a single classifier which use K-hot encoding. I'm using a neural network for this with a softmax at the last layer. (Is there any chance that the softmax would cause a problem?) I'm using tensorflow for the model. What do Pentax and Sigma DSLRs offer that differs from Canon and Nikon? We have a question and answers outlining the . I'm interested in the other DSLR makers, and how the cameras they make compare in terms of significant features, system design philosophy, and unique or interesting photographic capabilities enabled or made easier by these cameras. Likewise, what such things are not handled as well?  Take "the big two have more market share" and the associated advantages of availability, accessibility, and third-party support and documentation .  I'm not interested here in compact cameras, interchangeable-lens cameras with electronic viewfinders, or in rangefinders. (If you're interested in that, though, see )  P.S.: Differences in lens lineups are covered at Schengen visa validity start date My Chinese in-laws intend to visit us in one month from now. Their visa is valid from Nov 23rd. Would it be possible for them to take the airplane on November 22nd in China and arrive in Schengen area on November 23rd?  Or does the visa already have to be valid upon departure?  In our particular case, they still need to transfer in Beijing first. The actual flight to Schengen zone effectively only departs on the 23rd so I guess that should be completely fine then? By definition $\aleph_1 = 2 ^{\aleph_0}$. And since $2 &lt; \aleph_0$, then $2^{\aleph_0} = {\aleph_1} \le \aleph_0 ^ {\aleph_0}$. However, I do not know what exactly $\aleph_0 ^ {\aleph_0}$ is or how I could compute it. Can abilities with a [Click] cost be used during a run? Some abilities have a [Click] cost to them, such as Crypsis' ability to add a virus counter to it.  Does it count as a "paid ability" for the purposes of the ? I.e. could I, mid-run, add a virus counter to Crypsis for the cost of one [Click]? I recently upgraded a c# windows service to run as a 64 bit .net process. Normally, this would be trivial, but the system makes use of a 32-bit DLL written in C++. It is not an option to convert this DLL to 64 bit, so I wrapped the DLL in a separate 32 bit .net process and exposed a .net interface via remoting.  This is quite a reliable solution, but I would prefer to run the system as a single process. Is there any way I can load my 32 bit DLL into a 64 bit process and access it directly (perhaps through some sort of thunking layer)? What are the options for traveling to the airports in Paris? As a lab assignment I have to replicate experiment with spring oscillations, and eventually calculate spring constant. The measurements I took are: spring displacement from equilibrium $x$, mass of weights $m$, and period $T$. And presumed uncertainties: $\Delta_\alpha(x)=1[mm]$, $\Delta_e(x)=2[mm]$,  $\Delta_\alpha(t)=0.1[s]$,  $\Delta_e(t)=1[s]$. Where $\alpha$ stands for uncertainty of used equipment, and $e$ is readings uncertainty made by me.  I calculated the standard uncertainty using this formula: $$\sqrt\frac{\Delta_\alpha(x)^2+\Delta_e(x)^2}{3}$$ Which produced $u(x)=1.29[mm]$. Then using the following substitutions:  $$F=kx$$ $$mg=kx$$ $$x=\frac{g}{k}m$$ I assert that:  $$tan(a)=\frac{g}{k}$$  Because in this part of experiment I plotted $x=f(m)$, using excel's linest, I get the slope $s$  $$tan(a)=\frac{g}{k}=s$$  Now, my question is, since I had uncertainty for $x$ introduced, and it is used to compute $tan(a)$, then the latter is affected and should have uncertainty of itself? How in this case should I go about propagating uncertainty to $tan(a)$?