I want to extract infromation from logs using a shell script for a particular time range . A line in logs looks like this:  [15:01:27:176][15-10-2015]: testing1-vidya-Thu Oct 15 11:49:27 IST 2015 [15:02:27:178][15-10-2015]: testing2-vidya-Thu Oct 15 11:49:27 IST 2015 [15:10:27:179][15-10-2015]: testing3-vidya-Thu Oct 15 11:49:27 IST 2015 [15:01:27:180][16-10-2015]: testing4-vidya-Thu Oct 15 11:49:27 IST 2015 [15:20:27:181][16-10-2015]: testing5-vidya-Thu Oct 15 11:49:27 IST 2015 [15:02:27:182][16-10-2015]: testing6-vidya-Thu Oct 15 11:49:27 IST 2015 [15:03:27:183][17-10-2015]: testing7-vidya-Thu Oct 15 11:49:27 IST 2015 [15:04:27:184][17-10-2015]: testing8-vidya-Thu Oct 15 11:49:27 IST 2015 [15:05:27:191][17-10-2015]: testing9-vidya-Thu Oct 15 11:49:27 IST 2015 [15:18:27:192][17-10-2015]: testing10-vidya-Thu Oct 15 11:49:27 IST 2015 [15:29:27:193][17-10-2015]: testing11-vidya-Thu Oct 15 11:49:27 IST 2015 [15:03:27:208][18-10-2015]: testing12-vidya-Thu Oct 15 11:49:27 IST 2015 [15:04:27:209][18-10-2015]: testing13-vidya-Thu Oct 15 11:49:27 IST 2015 [15:07:27:210][18-10-2015]: testing14-vidya-Thu Oct 15 11:49:27 IST 2015  I need to extract data in specific intervals. for example in between 15:01 to 15:08 on [17-10-2015] date     [15:03:27:183][17-10-2015]: testing7-vidya-Thu Oct 15 11:49:27 IST 2015   [15:04:27:184][17-10-2015]: testing8-vidya-Thu Oct 15 11:49:27 IST 2015   [15:05:27:191][17-10-2015]: testing9-vidya-Thu Oct 15 11:49:27 IST 2015   I used this code :  grep -E "^[(15:0[1-8])" | grep '[17-10' filename    I tried this . I am getting all 17-10-2015 data including 15:18 &amp;15:29. I need only data from 15:01 to 15:08. Is it correct , anythting wrong in this ?
I want to extract infromation from logs using a shell script for a particular time range . A line in logs looks like this:  [14:58:27:176][15-10-2015]: testing1-vidya-Thu Oct 15 11:49:27 IST 2015 [14:59:27:178][15-10-2015]: testing2-vidya-Thu Oct 15 11:49:27 IST 2015 [15:00:27:179][15-10-2015]: testing3-vidya-Thu Oct 15 11:49:27 IST 2015 [15:01:27:180][15-10-2015]: testing4-vidya-Thu Oct 15 11:49:27 IST 2015 [15:01:27:181][15-10-2015]: testing5-vidya-Thu Oct 15 11:49:27 IST 2015 [15:02:27:182][15-10-2015]: testing6-vidya-Thu Oct 15 11:49:27 IST 2015 [15:02:27:183][15-10-2015]: testing7-vidya-Thu Oct 15 11:49:27 IST 2015 [15:02:27:184][15-10-2015]: testing8-vidya-Thu Oct 15 11:49:27 IST 2015 [15:02:27:191][15-10-2015]: testing9-vidya-Thu Oct 15 11:49:27 IST 2015 [15:03:27:192][15-10-2015]: testing10-vidya-Thu Oct 15 11:49:27 IST 2015 [15:03:27:193][15-10-2015]: testing11-vidya-Thu Oct 15 11:49:27 IST 2015 [15:03:27:208][15-10-2015]: testing12-vidya-Thu Oct 15 11:49:27 IST 2015 [15:04:27:209][15-10-2015]: testing13-vidya-Thu Oct 15 11:49:27 IST 2015 [15:49:27:210][15-10-2015]: testing14-vidya-Thu Oct 15 11:49:27 IST 2015 [13:02:17:209][15-10-2015]: testing13-vidya-Thu Oct 15 11:49:27 IST 2015 [15:04:27:209][16-10-2015]: testing13-vidya-Fri Oct 16 11:49:27 IST 2015 [15:49:27:210][16-10-2015]: testing14-vidya-Fri Oct 16 11:49:27 IST 2015   I need to extract data in specific intervals. for example in between 14:59 to 15:03 on 15-10-2015 as shown below:   [14:59:27:178][15-10-2015]: testing2-vidya-Thu Oct 15 11:49:27 IST 2015 [15:00:27:179][15-10-2015]: testing3-vidya-Thu Oct 15 11:49:27 IST 2015 [15:01:27:180][15-10-2015]: testing4-vidya-Thu Oct 15 11:49:27 IST 2015 [15:01:27:181][15-10-2015]: testing5-vidya-Thu Oct 15 11:49:27 IST 2015 [15:02:27:182][15-10-2015]: testing6-vidya-Thu Oct 15 11:49:27 IST 2015 [15:02:27:183][15-10-2015]: testing7-vidya-Thu Oct 15 11:49:27 IST 2015 [15:02:27:184][15-10-2015]: testing8-vidya-Thu Oct 15 11:49:27 IST 2015 [15:02:27:191][15-10-2015]: testing9-vidya-Thu Oct 15 11:49:27 IST 2015 [15:03:27:192][15-10-2015]: testing10-vidya-Thu Oct 15 11:49:27 IST 2015 [15:03:27:193][15-10-2015]: testing11-vidya-Thu Oct 15 11:49:27 IST 2015 [15:03:27:208][15-10-2015]: testing12-vidya-Thu Oct 15 11:49:27 IST 2015   I am new to shell script.I have tried with grep command . Can anyone suggest me how to do this ?
An infinite subset of a countable set is countable In my book, it proves that an infinite subset of a coutnable set is countable. But not all the details are filled in, and I've tried to fill in all the details below. Could someone tell me if what I wrote below is valid?  Let $S$ be an infinite subset of a countable set $T$. Since $T$ is countable, there exists a bijection $f: \mathbb{N} \rightarrow T$. And $S \subseteq T = \{ f(n) \ | \ n \in \mathbb{N} \}$. Let $n_{1}$ be the smallest positive integer such that $f(n_{1}) \in S$. And continue where $n_{k}$ is the smallest positive integer greater than $n_{k-1}$ such that $f(n_{k}) \in S$. And because $S$ is infinite, we continue forever. Now consider the function $\beta : \mathbb{N} \rightarrow S$ which sends $k \rightarrow f(n_{k})$.   So in order for $S$ to be countable, $\beta$ would have to be a bijection. $\beta$ is injective since if $f(n_{k}) = f(n_{j})$, then $n_{k} = n_{j}$ because $f$ is injective. We also can conclude $k = j$ because the various $n_{i}$ chosen were strictly increasing.   Edit: $\beta$ also needs to be surjective. So for every $r \in S$ there exists a $q \in \mathbb{N}$ such that $\beta(q) = f(n_{q}) = r$. We know that $f^{-1}(r) \in \{n_{1}, n_{2}, ..., n_{k} ... \}$, so we can let $f^{-1}(r) = n_{d}$. Thus $\beta(d) = f(n_{d}) = r$. In the Law of Reflection, the angle of incidence is equal to angle of reflection. Why is this true? This is clearly true experimentally, but how does one prove this true mathematically? From A Classical Introduction to Modern Number Theory by Ireland and Rosen, page 33:     Corollary 1 (Euler's Theorem). If $(a,m) = 1$, then $a^{\phi(m)} \equiv 1\,(m)$.      Proof. The units in $\mathbb{Z}/m\mathbb{Z}$ form a group of order $\phi(m)$. If $(a,m) = 1$, $\bar{a}$ is a unit. Thus $\bar{a}^{\phi(m)} = \bar{1}$ or $a^{\phi(m)} \equiv 1\,(m)$.   If I'm interpreting this correctly, this proof implicitly uses the fact(?) that if $G$ is a group and $x\in G$, then $x^{|G|}=1$, where $1$ is the identity element of $G$.  If this is indeed true, can someone explain why? (I have had no prior exposure to group theory.) Eclipse doesn't start on Ubuntu 18.04 I installed eclipse via Ubuntu Software. When I start it, it take some seconds and then comes an error window showing the path of the error.  The following is the .log file:  !SESSION Wed May 02 12:53:28 BRT 2018 ------------------------------------------ !ENTRY org.eclipse.equinox.launcher 4 0 2018-05-02 12:53:28.587 !MESSAGE Exception launching the Eclipse Platform: !STACK java.lang.ClassNotFoundException: org.eclipse.core.runtime.adaptor.EclipseStarter     at java.base/java.net.URLClassLoader.findClass(URLClassLoader.java:466)     at java.base/java.lang.ClassLoader.loadClass(ClassLoader.java:566)     at java.base/java.lang.ClassLoader.loadClass(ClassLoader.java:499)     at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:626)     at org.eclipse.equinox.launcher.Main.basicRun(Main.java:584)     at org.eclipse.equinox.launcher.Main.run(Main.java:1438)     at org.eclipse.equinox.launcher.Main.main(Main.java:1414)   What is the problem and how can I fix it? Math people:  The title is the question. I am convinced that uncountable sets exist, thanks to Cantor's diagonal proof.  It is not intuitively clear to me that uncountable ordinals or cardinals should exist.  What axioms of set theory are needed to accept their existence?  I think I have read here that the Axiom of Choice is not necessary.  I am reluctant to accept as "true" any theorems that rely on the Axiom of Choice.  EDIT: This question may be a duplicate: I just found  .  I apologize if this is so. I think these terms almost refer to the same thing, when used loosely:   terminal shell tty console   What exactly does each of these terms refer to? How to remove Open CTI VF softphone page from salesforce left side Open CTI Softphone VF page is showing in salesforce left side. How to remove this ? Screenshot attached I tried:   Launching Ubuntu Software Centre I typed in "air" and found "adobe air" It says "available from the 'maverick-partner' source. and has a button "use this source" I clicked "use this source", I saw a "in progress (1)" icon come up in the side bar, and disappear, but nothing happened/changed.   I'm stuck.  I have actually already added the maverick-partner source to apt so I could install sun-java6-jdk. What is role-playing, and where do I start? I have been told that roleplaying is great fun. I've looked and looked and it all seems so complicated. Could anyone tell me a good place to start, and what sort of things you end up doing in roleplaying? Is it ok to leave a slow cooker unattended? How can I determine accuracy of past probability calculations? I do not study statistics but engineering, but this is a statistics question, and I hope you can lead me to what I need to learn to solve this problem.    I have this situation where I calculate probabilities of 1000's of things happening in like 30 days.  If in 30 days I see what actually happened, how can I test to see how accurately I predicted?  These calculations result in probabilities and in actual values (ft).  What is the method for doing this? Thanks, CP Apache accepting requests to other servers? I'm having problems with apache server (CentOS VPS at Amazon). When apache starts, it starts to receive hundreds of requests, this is an example of the log:  173.208.216.165 - - [25/Jan/2015:18:23:11 +0000] "GET http://go.padstm.com/resources/img/iebt.png HTTP/1.0" 200 36023 "http://go.padstm.com/?id=173374&amp;t=iframe&amp;var=33110" "Mozilla/5.0 (Windows; U; Windows NT 6.1; ru; rv:1.9.2.3) Gecko/20100401 Firefox/4.0 (.NET CLR 3.5.30729)"   The path /resources/img/iebt.png is in my server, but not go.padstm.com. The strangest thing is that apache is accepting all the requests.  Other example: in this case, the entire resource is NOT in my server, but apache returns 200:  198.204.239.250 - - [25/Jan/2015:19:04:39 +0000] "GET http://fstads.com/show.php?z=26&amp;pl=494&amp;j=1&amp;code=1422237874120 HTTP/1.0" 200 10819 "http://financezhen.com/?p=186#respond" "Mozilla/5.0 (Windows NT 6.1; Win64; x64; rv:2.2a1pre) Gecko/20110324 Firefox/4.2a1pre"   I don't know why these requests goes to my server, or why it returns 200...  Also, when apache starts and module prefork is enabled, it launches multiple httpd processes. If worker module is enabled, it launches multiple threads. Ok, but in both cases apache ends up consuming all the CPU and memory of the server, and there is not traffic directed to my server.  More info: ProxyRequests is Off. Also: I'm using ip-based vhosts:  NameVirtualHost xxx.xxx.xxx.xxx:80  &lt;VirtualHost xxx.xxx.xxx.xxx:80&gt;     ServerName mydomain.com     ServerAlias www.mydomain.com     DocumentRoot /var/www/html/w3prod     ServerAdmin admin@localhost     UseCanonicalName Off     CustomLog /var/log/httpd/w3prod.mydomain.com combined     ErrorLog /var/log/httpd/w3prod_error.mydomain.com &lt;/VirtualHost&gt; &lt;VirtualHost xxx.xxx.xxx.xxx:80&gt;     ServerName picfarm.mydomain.com     ServerAlias www.picfarm.mydomain.com     DocumentRoot /var/www/html/picfarm     ServerAdmin admin@localhost     UseCanonicalName Off     CustomLog /var/log/httpd/picfarm.mydomain.com combined     ErrorLog /var/log/httpd/picfarm_error.mydomain.com &lt;/VirtualHost&gt; &lt;VirtualHost xxx.xxx.xxx.xxx:80&gt;     ServerName test.mydomain.com     ServerAlias www.test.mydomain.com     DocumentRoot /var/www/html/engine-test     ServerAdmin admin@localhost     UseCanonicalName Off     CustomLog /var/log/httpd/test.mydomain.com combined     ErrorLog  /var/log/httpd/test_error.mydomain.com     ProxyRequests Off     ProxyPreserveHost On     &lt;Proxy *&gt;             Order deny,allow             Allow from all     &lt;/Proxy&gt;     ProxyPass /bosh http://xxx.xxx.xxx.xxx:7070/http-bind/     ProxyPassReverse /bosh http://xxx.xxx.xxx.xxx:7070/http-bind/     ProxyPass / http://xxx.xxx.xxx.xxx:8080/     ProxyPassReverse / http://xxx.xxx.xxx.xxx:8080/ &lt;/VirtualHost&gt;   Any help would be appreciated. Thanks! Way to detect frozen video with ffmpeg? Is there a way to detect frozen video with ffmpeg? I only need to know if there are rather large regions of frozen video, say 10 seconds or more.   I'm familar with the  filter.   Maybe you could first difference adjacent frames, then use blackdetect to tell whether the difference has not changed? I'm not sure how to perform the difference though. Seeking world map with boundaries of regions and communities for commercial use? How to install GUI desktop on a server? After installing Ubuntu server how do I install the desktop environment? Apologies if this has been asked somewhere before, but I didn't see what I was looking for after several pages of Google results.  I was reading Jech's The Axiom of Choice and was introduced to the equivalence of the ultrafilter lemma and the compactness theorem for FOL. I gather that these are also equivalent to the completeness theorem. I am primarily interested in trying to understand the "ultrafilter lemma $\implies$ completeness/compactness" direction. Jech's own proof takes an odd route through "binary messes" and I don't really follow the last couple of steps. (It's on pp.17,18 of the 2008 Dover reprint, if one is interested).  I'm wondering if anyone knows a good reference for, or can provide, a readable proof that the ultrafilter lemma implies completeness or compactness, with a preference for completeness. Alternatively, if you have Jech's book on hand, helping me bridge the concluding paragraph of his $\textrm{(ii)}\implies\textrm{(iii)}$ step with the preceding steps would clear up much of my puzzlement. (Though in this case I can't offer any help in saying what, specifically, is missing in the way of a bridge). Which groups have precisely two automorphisms Which groups $G$ have precisely two automorphisms, i.e., precisely one non-trivial automorphism?  Examples: $G= C_3, \mathbf{Z},\ldots$.  I think $G$ has to be abelian. In fact, we have $ \vert G\vert \geq 3$. Therefore, if $G$ is not abelian, we have at least two non-trivial inner automorphisms.  If we can show that $G$ is cyclic the above examples are all of them. How do I get started creating an Ubuntu Desktop App? Find: $$\lim\limits_{x \to 1} \left( {\frac{x}{{x - 1}} - \frac{1}{{\ln x}}} \right) $$  Without using L'Hospital or Taylor approximations  Thanks in advance My 12.04 x64 system won't boot into GUI, but I can still use virtual console with my own account, so apparently it's the Windows Management System that's causing it, how can I reinstall it from tty, what's the apt-get command?