body1
stringlengths 20
4.1k
| body2
stringlengths 23
4.09k
|
|---|---|
Biblatex-chicago package doesn't work properly. I have main file main.tex: \documentclass{article} \usepackage[% authordate,% maxcitenames=2,% backend=biber,% ]{biblatex-chicago} \addbibresource{refs.bib} \begin{document} \section{Section} Citation \parencite{colwell06}. Citation \parencite[p.~12]{colwell06}. Citation \textcite{colwell06}. Citation \textcite[p.~12]{colwell06}. \end{document} and references in refs.bib file: @Book{colwell06, author = {Robert P Colwell}, ALTeditor = {}, title = {Pentium Chronicles - The people, passion, and politics behind Intel's landmark chips}, publisher = {Wiley Interscience}, year = {2006} } For some reason the second citation of parencite doesn't show author of the article at all. Just the page number is visible and I get following output: Using normal biblatex package and style=authoryear option instead of authordate I don't get this error. Is there something wrong with chicago package or am I missing something? | I want to use the package biblatex-chicago for citations. I have a file with the following content: \documentclass[11pt]{report} \usepackage[authordate,backend=biber]{biblatex-chicago} \bibliography{myBibliography} \begin{document} \noindent \textcite{doe:2013}\\ \parencite[see][p.\ 2]{doe:2013} \printbibliography \end{document} This is the content of the file myBibliography.bib: @article{doe:2013, author = {Doe, John}, month = {5}, title = {The Title}, yournaltitle = {The Journal}, year = {2013}, } Typesetting yields Doe (2013) (seep. 2) However, one should get Doe (2013) (see Doe 2013, p. 2) Can anybody reproduce this result? Is this due to a bug in the biblatex-chicago package? |
I have two files with some lines being the same. File A : command 1{ some code lines } command 2 command 3 command 4{ some code lines } File B : command 5 command 3 command 1{ some code lines } I'd like to have a final file containing this: command 1{ some code lines } command 2 command 3 command 4{ some code lines } command 5 Order of lines is not relevant. Is there an existing tool (or a command) to do so? | I recently upgraded from Ubuntu 12.04 to 12.10 and at one point, it encountered an Apache config file conflict in apache2.conf. I didn't give me a merge option at that point, so I just rejected the new file and the installer saved the new file as apache2.conf.dpkg-dist. I can diff the two files with diff apache2.conf apache2.conf.dpkg-dist and get just the lines that are different. But I want to manually merge the two sort of like how I resolve merge conflicts in SVN or git. How can I do that? |
I would like to install wordpress multisite on a live server and have one of the sub-domains be https. The main site is not https and neither are the other sub-domains. Is that possible? Thanks! | I need a single Wordpress installation to be available from both the main domain (www.example.com) via HTTP and a subdomain (secure.example.com) via HTTPS. Of course i can just map the subdomain to the Wordpress folder in Nginx config. But will Wordpress be aware that it is called via HTTPS and change all links on the pages to HTTPS ? Also, how i can i force certain pages to be automatically redirected to their HTTPS equivalent permalink (and then back again to HTTP) ? |
This is really basic javascript here and probably pretty silly to ask but what is the difference between: a) function variable(){}; b) var variable = function() {}; I think the second one executes as soon as the browser reads it, am I correct? | I've recently started maintaining someone else's JavaScript code. I'm fixing bugs, adding features and also trying to tidy up the code and make it more consistent. The previous developer used two ways of declaring functions and I can't work out if there is a reason behind it or not. The two ways are: var functionOne = function() { // Some code }; function functionTwo() { // Some code } What are the reasons for using these two different methods and what are the pros and cons of each? Is there anything that can be done with one method that can't be done with the other? |
I've read up on many websites and I've even looked on this stack exchange but I still don't understand the difference between phase difference and path difference. Can you please explain what each means and then state the difference(s). Thank you in advance | The is the difference between the distances travelled by two waves meeting at a point. Given the path difference, how does one calculate the phase difference? |
I read a 1960s YA/Juvenile novel about a team of scientists working on a portal to another dimension/universe, looking through the portal drives anyone insane. Can't recall author or title, read it in the early 70s, in a school library hardcover binding. I assume from the style it was a 1960s work, it is possible it was from 1950s. | In the 1960s I read book--an older children's book, I think--which I loved, and still remember, roughly. I have no idea what the title is or who the author is, and I'm wondering if anyone knows this one: Scientists had invented a device which they didn't fully understand, and which had puzzling effects. For example, when a pencil was put into the machine, it disappeared, and then reappeared inside out: The lead was on the outside. When people went into the machine, they came back dead, having died from fright. Finally they sent a very open-minded person into the machine. She was an artist, I think. She was able to return alive, and described an alternate universe in which geometry was very different. I distinctly remember that there were supposedly square triangles or four-sided triangles--or was it three-sided squares? (This is, of course, a literally contradictory claim, but I didn't see the matter as clearly then.) Thanks! |
LIKE query not working, it just output blank. $stmt = $dbo->prepare("SELECT * FROM hotels WHERE h_country=:c LIKE '%m%'"); $stmt->bindValue(":c", "malaysia", PDO::PARAM_STR); $stmt->execute(); | Here's my attempt at it: $query = $database->prepare('SELECT * FROM table WHERE column LIKE "?%"'); $query->execute(array('value')); while ($results = $query->fetch()) { echo $results['column']; } |
I lost my password to both root and sudo and need to remove ubuntu and erase my HDD. Needless to say this was a stupid newby screwup. I have backed up everything I want to save. How do I rescue my HDD? | I'm working on a Ubuntu system, and my client has completely forgotten his administrative password. He doesn't even remember entering one; however it is there. I've tried the suggestions on the website, and I have been unsuccessful in deleting the password so that I can download applets required for running some files. Is there a solution? |
I created a simple model that selects iteratively elements from a point dataset and calculates a cost distance raster for each of these points. It works fine when I run it for just one dataset, but when I try to batch it get the following error. ERROR 000865: Input raster or feature source data: I_atlanta_OBJECTID does not exist. ERROR 000581: Invalid parameters. Failed to execute (Cost Distance). Please any help will be greatly appreciate. Here a link to a snapshot of the model | Am I correct that if my model has a model-only tool (Calculate Value), and then I run the model as a batched process, it will not run the Calculate Value expression? I wrote a model to upload, define, project (and clip) XY data from excel files. I had thought to use iterate tables, but it wasn't working. (I assume due to having to choose which worksheet within xlxs). So I thought to do a batch, but this seems to leave that annoying $ that arc appends to table names (and is an invalid character in most tools...) My guess is that the Calculate value that removes my $ is not being run in the batch. Ideas? Confirmations? |
I would like to copy a file, but I want the new file to be named something different, like having a (1) next to the name without changing the extension. Here is my code: import shutil from tkinter import * from tkinter.filedialog import askopenfilename import os filename = askopenfilename() file_name, file_extension = os.path.splitext(filename) dec = "_dec" newfile = file_name + dec copied = str.join(newfile, file_extension) shutil.copy(filename, copied ) master = Tk() w = Message(master, text="Copied!", width = 100) w.pack() mainloop() How would I get filename to have a (1) at the end of the name without touching the extension? | Is there a function to extract the extension from a filename? |
Consider the Cauchy problem of finding $u=u(x,t)$ such that $$\frac{\partial{u}}{\partial{t}}+u\frac{\partial{u}}{\partial{x}}=0\text{ for }x\in\mathbb{R},t>0\\u(x,0)=u_0(x),\;x\;\epsilon\;\mathbb{R}$$ which choice(s) of the following functions for $u_0$ yield a $C^1$ solution $u(x,\ t)$ for all $x\in\mathbb{R}$ and $t>0.$ $u_0(x)=\frac{1}{1+x^2}$ $u_0(x)=x$ $u_0(x)=1+x^2$ $u_0(x)=1+2x$ Because characteristic of the given PDE is $U=U_0(x-ut)$ from option 2, 4 only the satisfies the given PDE is i am right | Consider the Cauchy Problem of finding $u(x,t)$ such that $$\frac{\partial u}{\partial t}+u\frac{\partial u}{\partial x}=0,x\in\mathbb{R},t>0$$ $$u(x,0) = u_0(x), x\in\mathbb{R}$$ Which choices of the following functions for $u_{0}$ yield a $C^{1}$ solution $u(x,t)$ for all $x\in\mathbb{R},t>0$ $u_{0}(x)=\frac{1}{1+x^{2}}$ $u_{0}(x)=x$ $u_{0}(x)=1+x^{2}$ $u_{0}(x)=1+2x$. If I use the existence and uniqueness theorem for Cauchy problem i get the corresponding determinant is non zero so all are true according to me. But in answer key only option 2nd and 4th is given. Please help me to solve the problem. Thanks a lot. |
There's a shell script floating around the Internet that looks like this: :(){ :|: & };: Basically this shell script just creates a function that calls itself, leading to infinite recursion. Apparently this is a fork bomb and it will keep going until it uses up resources and crashes your system. My question is, wouldn't this script cause a stack overflow and cause the shell to segfault before it consumes all the system's resources? How does this work exactly? | WARNING DO NOT ATTEMPT TO RUN THIS ON A PRODUCTION MACHINE In reading the I generally follow what's going on with the following code: :(){ :|:& };: excerpt of description The following fork bomb was presented as art in 2002; its exact origin is unknown, but it existed on Usenet prior to 2002. The bomb is executed by pasting the following 13 characters into a shell such as or . It operates by defining a function called ':', which calls itself twice, once in the foreground and once in the background. However the last bit isn't entirely clear to me. I see the function definition: :(){ ... } But what else is going on? Also do other shells such as ksh, csh, and tcsh also suffer the same fate of being able to construct something similar? |
I have a file in my Linux work computer that I need on my personal Mac laptop and I wanted to know how I could get that to my mac computer. I can't email it to myself because it's a dmg file and it's too large via email. How can I send this file to myself using terminal commands? Also I have no administrative capabilities so I can't use sudo | I'm using Linux (centos) machine, I already connected to the other system using ssh. Now my question is how can I copy files from one system to another system? Suppose, in my environment, I have two system like System A and System B. I'm using System A machine and some other using System B machine. How can I copy a file from System B to System A? And, copy a file from System A to System B? |
I have read in numerous places that an object in free fall into a black hole will be travelling the speed of light when it passes the event horizon. How is it possible to go this fast? Does it continue accelerating, faster than light until it is crushed by the singularity? | Imagine we have something very heavy (i.e supermassive black hole) and some object that we can throw with 0.999999 speed of light (i.e proton). We are throwing our particle in the direction of hole. The black hole is so heavy that we can assume that in some moment acceleration of gravity would be say 0.0001 speed of light/s^2. So the question is what will be the speed of proton in few a seconds later, assuming we have such distances that it will not hit the black hole before. |
When I type this command, the following message appears: line 1 invalid key: -----BEGIN ... ~/.ssh/known_hosts is not a valid known hosts file. Not replacing existing known_hosts file because of errors | According to and my own understanding, the tilde expands to the home directory: $ echo ~ /home/braiam Now, whenever I want the shell expansion to work, i. e. using variable names such $FOO, and do not break due unexpected characters, such spaces, etc. one should use double quotes ": $ FOO="some string with spaces" $ BAR="echo $FOO" $ echo $BAR echo some string with spaces Why doesn't this expansion works with the tilde? $ echo ~/some/path /home/braiam/some/path $ echo "~/some/path" ~/some/path |
How long can the average, healthy adult human survive with only water? | Can humans live without eating food, just by drinking water? How long can we survive just by drinking water everyday? |
I was looking at trying to find and official Stack Overflow app for an Android smartphone. Is there any reason why SO doesn't have any? | We are in the early stages of development of the official Stack Exchange Android app and we need your help with testing. To set a few expectations: there will be bugs, crashes, and missing features, all of which will be fixed in . We are initially targeting Android devices running (Android 4.1 or higher) starting with phones (up to ~5 inch) and eventually moving our way to tablets. To register for alpha testing . After you register we will send you an invite to a private Google community where you can find a link to download our app directly from the store. The invitations will be sent out in waves, so if you don’t get an invite immediately, be patient. Crash reports will be automatically reported back to us using . Bugs or feature requests should be reported here on meta and tagged . Please do not use the Google community to report bugs. As always, we welcome your feedback and are committed to building the best mobile app possible for browsing the Stack Exchange sites. |
I'm having a hard time trying to get my head around the fundamentals of gauge theory. I've taken classes in QFT and Particle Symmetries recently, both of which touch on the topic, but neither explained it in detail. Browsing the Wikipedia entry on gauge theory gives me the same heuristic arguments I've read hundreds of times, together with some mathematical formalism that's totally impenetrable. Does anyone know of an introductory book that will explain gauge symmetries, the gauge group and their applications to a grad school student? Ideally I'd like a book which starts slowly but gets far, and isn't too basic. However I'm not looking for a text where you need to have done a couple of courses in differential geometry (fibre bundles etc) to get started! | I am looking for a preferably introductory text on Yang-Mills theory with mathematical basis and language. (Differential forms) I have a background in QCD and QED, however, I want to go more in details in geometrical interpretations of Yang-Mills theory. I am sorry if this question has asked before. Thanks in advance. |
I'm a first year PhD student (computer science), and I've felt that I lost this year up to now due to some life difficulties. I'm getting no financial support and I was forced to teach to get some money and pay my expenses. I have another personal problems that took me to a state of depression, where I've spent some months completely stuck in my work. I want to "be back on the rails" and continue to work on this, but I'm feeling lost. I need to go back to the very beginning and find what a PhD is, and what I must do to advance the state of art with my current (weak) capabilities. At the same time I must to show some results to my advisor with what I already have in my hands. I know that my "question" is pretty obscure, but I need some advices on how to proceed, from people with some experience in this situation. How can I overcome depression and 'get back on the rails' with my PhD? IMPORTANT EDIT: Some years later I finally got my PhD. I cannot believe I made it. At the time that I wrote this post it seemed utterly impossible to achieve this. If you are in the middle of a PhD you may try to endure and fight until the end. But if you are wondering about starting a PhD, please make sure YOU ABSOLUTELY LOVE your topic, otherwise you'll end like me when I wrote this. I didn't like my research area and the topic I choose. Everything else seemed to be way more interesting. I wanted to do everything instead of reading papers and conducting my own research. I felt unproductive and useless, and at some point my advisor started to complain about my lack of results. It was my fault since the beginning since I didn't followed a research area that I could have joy with it. I should have choose something that matched my abilities and preferences, for instance, I'm pretty good with programming, but my math skills aren't great, and yet I tried to enter a field that is dominated by math and advanced statistics. I couldn't do what I do the best, neither I was able to catch up with the involved math. | I am a third year (starting fourth year in the fall) PhD student in mathematics. I've passed all qualifying exams and am currently doing research. As far as I can tell, I am not doing poorly. I have the good fortune of having a great advisor, being in a very supportive department, and having friends and family who genuinely care about my success. The fact is research is hard. It appears to consist primarily of staring at a problem for days and days and days without getting anywhere. Sometimes, rarely, I do figure something out and that feels wonderful, but the overwhelming majority of my time appears to be spent banging my head against a mostly figurative wall. I am not complaining about the material being hard, and I am not averse to putting in hard work, but I get frequently discouraged when I realize the vast volumes of mathematics that I yet know nothing about (and probably never will). It's very hard to quantify progress - in particular, there are too few tangible returns after too many hours worked. I find myself thinking along the lines of "Oh, if only someone actually smart were thinking about this problem they would have solved it in moments" and so on. I've talked about this to some number of people; here is some advice I have received: Take a day off. Putting in hours upon hours of trying things doesn't magically lead to a solution, particularly if the brain is tired and just wants to sleep. Have a hobby. Since math research doesn't exactly provide instant gratification, a hobby might provide some instead. Talk to other graduate students. Realize that many graduate students go through this. I'm interested to know how other folks have dealt with being discouraged as a graduate student. Does it get better with time and experience? Is this a sign that research is not for me and that I should seriously consider a life outside academia? |
Suppose that $(S,\Sigma,\mu)$ is a finite measure space. I am trying to show that a sequence of functions $(f_n)$ converges in measure to f iff \begin{align*} \lim_{n\to \infty} \int \frac{\left\vert {f_n - f} \right\vert}{1 + \left\vert { f_n - f} \right\vert} d\mu = 0. \end{align*} I have shown if \begin{align*} \lim_{n\to \infty} \int \frac{\left\vert {f_n - f} \right\vert}{1 + \left\vert { f_n - f} \right\vert} d\mu = 0, \end{align*} then $f_n \to f$ in measure. However, I am not sure how to show the reverse direction. I know that since I converge in measure that there exists a subsequence $(f_{n_k})$ that converges $\mu$-a.e. on S to f. So I can apply the monotone convergence theorem to the subsequence and get the desired result. I am not sure though how to show it for the entire sequence. | Let $(X,\mathcal{M},\mu)$ be a measure space. We say that $\{f_n\}$ converges to $f$ in measure if, for any $\epsilon>0$ $$ \lim\limits_{n \to \infty} \mu\Big(\{x\in X: |f_n(x)-f(x)| \ge \epsilon \}\Big)=0.$$ Show that $\{f_n \}$ converges to $f$ in measure if $$\lim\limits_{n\to \infty} \int_X \frac{|f_n(x)-f(x)|}{1+|f_n(x)-f(x)|}d\mu(x)=0.$$ Suppose $\mu(X) < \infty$. Show that $$\lim\limits_{n\to \infty} \int_X \frac{|f_n(x)-f(x)|}{1+|f_n(x)-f(x)|}d\mu(x)=0$$ if $\{ f_n \}$ converges to $f$ in measure. |
I am trying to make a spotlight project a square onto the wall in Eevee, but I can't find an easy way to do it. Right now I kinda have a jimmy-rig where I made a cube and put a square-shaped hole in it, then moved it in front of the light. This is really hard to move around though and I would like it to work as it does in Cycles with nodes. Is this possible? Or should I stick with my jimmy-rig? | What is the correct vector input for a texture connected to a Cycles lamp so that I can make a projector-like textured light? I am trying to make an projector-like effect with a textured light in Cycles, currently trying it out with a Spot type of lamp, but I am open to any solution involving other lamp types if they work correctly. The problem is that whatever vector input I use, the texture is always projected downwards, towards the global $-Z$ axis in scene world space, no matter where I point my spot light. I would like to have the texture always project "forward" towards the the direction the spot light is pointing, in the local $-Z$ axis. The plan would then be to use this spot at several places in my scene, pointing at different directions, and as it currently stands I would have to have a different node setup for each spot instance, manually compensating for each unique rotation in the scene, which would quickly become unpractical. I have searched around the internet and I am currently using a solution similar to the one on this . Is there any better method, perhaps involving some funky Vector Math, or is this not currently supported? |
I'm looking for a word that means knowing about lots of different things, across different fields of study. The idea behind Renaissance man. This might be a noun or an adjective. Mrs. Jones is (a) ____________. Although she teaches Spanish, she can tutor any student at our school in any subject. | Possible Duplicate: I just wondered, what could we call a person with deep knowledge in various fields? For example, computers, music, sports, etc. I think I could use sage, but it wouldn't be appropriate if someone is experienced in multiple fields. |
I tried to install Ubuntu in my laptop that had windows 7 and I chose 'erase partition' as I was thinking it will erase the C partition only so as to make it the Ubuntu drive .After restart I found the whole hard disk mounted as one partition with no data .So is there any way to return back my data or is it impossible? | I have a Toshiba satellite A-200 laptop with a Vista OS on it with 4 NTFS partitions (C:) Vista (D:) Entertainment (E:) Work (F:) Sources and I wanted to start using Ubuntu instead. So I tried it first from the live CD and everything was OK and all the partitions were shown and working and so I decided to install Ubuntu to replace Vista on the (C:) drive. After I did that I can no longer find my folders and files on the (D:), (E:), (F:) partitions and the only file system that is shown is one 198 GB although my HDD is 320 GB. I can't access the lost data on the remaining 120 GB which I hope is still there and not totally lost I am now working from the live CD but I am unable to install testdisk. Can I recover the Vista partitions by the product recovery CD to get my laptop back to the factory settings? Can I recover the NTFS partitions using a recovery program for Windows or will that make the problem worse? I need these data badly as I don't have a backup for them. |
I know that parallel DNA helices exist and are governed by Hoogsten base pairing, but why can’t they be possible with Watson-Crick pairing? In the diagram below, if we were to flip one of the strands while keeping the other the same, it appears as though hydrogen bonding is still possible. The only specific suggestions that I could find was because of the DNA replication process and the negative polarity of hydoxyl group on the phosphates. Moreover, after flipping one strand, the DNA nucleotides form enantiomers. Are these possible reasons, or are there others? | My biology textbook mentions that DNA is antiparallel and it got me wondering... Can DNA be parallel? What would happen if it was parallel? could DNA still replicate right? |
I want to create geopackage file using PyQGIS (for example database.gpkg) with one layer (named "myLayer"). I've tried this writer=QgsVectorFileWriter(fileName,'UTF-8',layerFields,QgsWkbTypes.Unknown,QgsProject.instance().crs(),'GPKG',newLayer='myLayer') but got an error ('newLayer' is an unknown keyword argument). I can't use writeAsVectorFormatV2 because I need to create file first and than add it to QGIS. | How to add layers (vector or raster to an existing GeoPackage)? While loading an existing layer of a GeoPackage is quite trivial: path = '/home/matteo/geopackage.gpkg|layername={}'.format('admin') iface.addVectorLayer(path, 'admin', 'ogr') I couldn't find information about adding them via PyQGIS. |
I'm getting an (error code -10813) when trying to set file extensions to open with a certain app in Mountain Lion 10.8.5. Where is the plist file that has those preferences so that I can delete it and hopefully end this problem? | When I right-click on a file on my Mac OS desktop and then in the contextual menu, I move to the "Open with...", the list of potential applications to "open with" has applications listed multiple times, sometimes three or four times, right next to each other! Why does this happen? How do I fix it? how do I stop it from re-occurring? See this snapshot of the contextual menu showing the doubling up: Now I have Mountain Lion on a 13" MacBook Pro, but this problem existed before I upgraded to Mountain Lion. |
I am curious of that words; 'family' and 'set. Some use the set of the blah-blah-blah~. However, the other some use the family of the blah-blah-blah~. For example, we express $X=\{v_i\}_{i=1}^N$ as $X$ is a set of $N$ vectors $v_1, v_2, \ldots, v_N$. $X$ is a family of $N$ vectors $v_1, v_2, \ldots, v_N$. How can I understand the diffence between them? | What is the difference between "family" and "set"? The definition of "family" on mathworld () is a collection of objects of the form $\{a_i\}_{i \in I}$, where $I$ is an index set. But, I think a set can also be represented in this form. So, what is the difference between the concept family and the concept set? Is there any example of a collection of objects that is a family, but not a set, or reversely? Many thanks! |
After reading and understanding the reasons , I am interested to find out why the dust particles stick so well. Spraying powerful jets of water does not effectively remove the dirt. Some scrubbing is still required, whether it is metallic blades or plastic ones. Why is that so? | Why does dust stick to rotating fan propeller? Intuitively, most people (including I) think of the dust will not stick to rotating fan propellers. |
I have Windows 10 with English lanugage. In regional settings I have set Denmark and my keyboard is Danish. The Windows Calculator (calc.exe) seems to have switched "." and ",", like used in USA. When I enter "," on my keyboard it writes ".". , and . works as expected in other programs like Excel. Is this just the way the Windows 10 calculator behaves or can I change it? | I recently installed Windows 10 (upgrade from 7). It is an English version Windows, which I configured to the German locale(*), which uses a comma (",") instead of a dot (".") as the decimal separator, i.e. the number Pi is 3,14 not 3.14. This works fine in Excel. However, it does NOT in the standard Windows calculator, which simply IGNORES a comma key press COMPLETELY. If I use a dot, it produces a dot which works as a decimal separator (which is wrong). Note that I'm talking about the actual comma key here, not the numpad comma, which works fine but produces a dot in the Calculator (it produces a comma in Excel!). My question: Does anyone have any ideas how to get Calculator to respect the German locale and recognize the comma key and display a comma? (*) Control Panel > Change date, time, or number formats > Format: German (Germany). Under additional settings, the decimal separator is correctly set to ",". |
I hear it commonly said that the advantages of Symmetric encryption are speed and no limit to the amount of data that can be symmetrically encrypted. I also hear it commonly said that the advantages of Asymmetric encryption are security. But theoretically, if I want to symmetrically encrypt a 1TB file, my algorithm is just going to break the 1TB file into smaller chunks, encrypt them, and spit out the cipher text. Why couldn't I do the same with Asymmetric encryption? AKA, what are the practical limitations of using Asymmetric encryption for bulk encryption? | I've been told that asymmetric cryptography requires that the message to be encrypted be smaller than its key length. Why is this? I know about hybrid encryption, which . But I still want to know why public-key cryptography needs the data to be shorter than the key length. |
Before the recent change in close/on hold reasons, certain close reasons (e.g. "off topic") would carry an automatic downvote (what I call a "fault" close). Others such as "duplicate," would not (the OP isn't penalized for not realizing his question is a a duplicate, meaning "no fault." With the new close reasons, which are the "fault" closes (automatic downvote), and which aren't? | Right now, carry automatic downvotes. The for this was largely to enforce specific quality bans in part because people were not down voting questions. Now that question down votes are free on questions and it seems to be pretty commonplace for question quality bans to trigger, even without the automatic votes from closure, and we have completely revamped the closure system. Is it time to reevaluate whether or not these automatic votes are still a good idea? What benefits do the automatic votes provide and have they effectively run their course? |
How can I upload a YouTube video in terminal on Ubuntu 16.04 64-bit? I'm asking for a complete tutorial. | Are there any desktop applications for uploading video to youtube? |
I wish to write a wave line above the "ch" as described in the following picture, how should I do this? | I know what my symbol or character looks like, but I don't know what the command is or which math alphabet it came from. How do I go about finding this out? |
My parents are Polish and are traveling from Canada to Honolulu with a layover in Chicago. they arrive in Canada from Poland a day later. do they need to go through passport check and baggage/customs in Chicago, or only at their destination in Honolulu? | I'm a British citizen travelling from London Heathrow (LHR) to the Hartford, Connecticut airport, and have a two hour stopover in Newark, New Jersey (EWR) on my itinerary. At what stage would I clear immigration and customs on arriving in the USA? |
I have a shell script which will run project consist of multiple JUnit tests. Then I call this shell within cron job every a period of time. In this case, I observe the following: Time to complete executing this shell is longer than directly calling this shell. I don't know why!? They must have the same run time, mustn't they? | I have an rsync cron job which is pushing the server load and triggering monitor alerts. If I set the job to be run with a high nice level, would that effectively reduce the impact it has on system load values? |
In Shawshank Redemption, Red receives parole after serving 40 years in Shawshank. In the beginning of movie it is shown that Red's plea for rehabilitation got rejected multiple times. When Andy breaks-out of Shawshank, it gives hope to Red but in his interaction with the prison authority Red shows no interest in getting out. So how did Red get approval for rehabilitation? | In Red has three parole hearings. For the first two, in 1947 () and in 1957, he tells the parole board what he thinks they want to hear, and is unsuccessful. In his third in 1967 () he takes a different approach, saying, quoting from the IMDB quotes page: 1967 Parole Hearings Man: Ellis Boyd Redding, your files say you've served 40 years of a life sentence. Do you feel you've been rehabilitated? Red: Rehabilitated? Well, now let me see. You know, I don't have any idea what that means. 1967 Parole Hearings Man: Well, it means that you're ready to rejoin society... Red: I know what you think it means, sonny. To me it's just a made up word. A politician's word, so young fellas like yourself can wear a suit and a tie, and have a job. What do you really want to know? Am I sorry for what I did? 1967 Parole Hearings Man: Well, are you? Red: There's not a day goes by I don't feel regret. Not because I'm in here, or because you think I should. I look back on the way I was then: a young, stupid kid who committed that terrible crime. I want to talk to him. I want to try and talk some sense to him, tell him the way things are. But I can't. That kid's long gone and this old man is all that's left. I got to live with that. Rehabilitated? It's just a bullshit word. So you go on and stamp your form, sonny, and stop wasting my time. Because to tell you the truth, I don't give a shit. Red is then granted parole. Why, after this disparaging and weary speech? Was it because he was being so bluntly honest? Was intimidation a factor? |
I found this : but I would like the other way around. The reason is that I spend quite a time learning the basic init process and I am pretty much accustomed to the "service" commands. I really dont care about 10 - 20 millisecond or even 1 -2 seconds of late boot up. I just need some clarity in the init process and want to stick to the old system.. Is it possible to do this at the boot time using grub maybe, which blacklists systemd and just runs the 14.04 init routines ( I guess it was a mix of upstart and sysvinit )? I found something, but dont know how to proceed further: In the /etc/grub.d/10_linux, I find an entry with SUPPORTED_INITS="sysvinit:/lib/sysvinit/init systemd:/lib/systemd/systemd upstart:/sbin/upstart"$ | Is it possible to revert an ubuntu 14.10 install to a upstart or a SysV init system. The "loggin" and other issues with systemd has caused me issus with being unable to read the dmesg as normal and determine if my stability issues are from systemD or something else. |
I have an activity in which i am trying to get the list of data based on some condition . This selectsome() function is in the SQLiteOpenHelper subclass. MyDBHandler dbhelper = new MyDBHandler(this); Cursor cursor; cursor = dbhelper.selectSome(value); In class MyDBHelper.java public Cursor selectSome(String arg) { String columns[]=new String[]{"_id","_hotelname","_city","_imageSrc","_rent","_address"}; String selarg[]={arg}; Cursor c=db.query(TABLE_NAME,columns,"city = ?",selarg, null,null,null); return c; } I am getting this error please help. 09-01 18:08:00.394 E/AndroidRuntime( 6246): FATAL EXCEPTION: main 09-01 18:08:00.394 E/AndroidRuntime( 6246): Process: com.example.hari.testapp, PID: 6246 09-01 18:08:00.394 E/AndroidRuntime( 6246): java.lang.RuntimeException: Unable to start activity ComponentInfo{com.example.hari.testapp/com.example.hari.testapp.HotelList}: java.lang.NullPointerException: Attempt to invoke virtual method 'android.database.Cursor android.database.sqlite.SQLiteDatabase.query(java.lang.String, java.lang.String[], java.lang.String, java.lang.String[], java.lang.String, java.lang.String, java.lang.String)' on a null object reference 09-01 18:08:00.394 E/AndroidRuntime( 6246): at android.app.ActivityThread.performLaunchActivity(ActivityThread.java:2325) 09-01 18:08:00.394 E/AndroidRuntime( 6246): at android.app.ActivityThread.handleLaunchActivity(ActivityThread.java:2390) 09-01 18:08:00.394 E/AndroidRuntime( 6246): at android.app.ActivityThread.access$800(ActivityThread.java:151) 09-01 18:08:00.394 E/AndroidRuntime( 6246): at android.app.ActivityThread$H.handleMessage(ActivityThread.java:1303) 09-01 18:08:00.394 E/AndroidRuntime( 6246): at android.os.Handler.dispatchMessage(Handler.java:102) 09-01 18:08:00.394 E/AndroidRuntime( 6246): at android.os.Looper.loop(Looper.java:135) 09-01 18:08:00.394 E/AndroidRuntime( 6246): at android.app.ActivityThread.main(ActivityThread.java:5257) 09-01 18:08:00.394 E/AndroidRuntime( 6246): at java.lang.reflect.Method.invoke(Native Method) 09-01 18:08:00.394 E/AndroidRuntime( 6246): at java.lang.reflect.Method.invoke(Method.java:372) 09-01 18:08:00.394 E/AndroidRuntime( 6246): at com.android.internal.os.ZygoteInit$MethodAndArgsCaller.run(ZygoteInit.java:903) 09-01 18:08:00.394 E/AndroidRuntime( 6246): at com.android.internal.os.ZygoteInit.main(ZygoteInit.java:698) 09-01 18:08:00.394 E/AndroidRuntime( 6246): Caused by: java.lang.NullPointerException: Attempt to invoke virtual method 'android.database.Cursor android.database.sqlite.SQLiteDatabase.query(java.lang.String, java.lang.String[], java.lang.String, java.lang.String[], java.lang.String, java.lang.String, java.lang.String)' on a null object reference 09-01 18:08:00.394 E/AndroidRuntime( 6246): at com.example.hari.testapp.databaseFiles.MyDBHandler.selectSome(MyDBHandler.java:113) | What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them? What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely? |
How to prove that the $n$ functions $$ e^{r_{i}t}, te^{r_{i}t},...,t^{k_{i}-1}e^{r_{i}t} $$ $i=1,2,...,s$, where $k_{1}+k_{2}+...k_{s}=n$ and $r_{1},r_{2},...,r_{s}$ are distinct numbers , and are linearly independent on any interval $I$. My try: Let $a_{11}e^{r_{1}t} + a_{12}te^{r_{1}t} +...+ a_{1k_{1}}t^{k_{1}-1}e^{r_{1}t}+a_{21}e^{r_{2}t}+a_{22}te^{r_{2}t}+...+a_{21}e^{r_{2}t} +a_{2k_{2}}t^{k_{2}-1}e^{r_{2}t}+...+a_{s1}e^{r_{s}t}+a_{s2}te^{r_{s}t}+...+a_{sk_{s}}t^{k_{s}-1}e^{r_{s}t} =0. $ Then I differentiate above equation $n-1$ times to get a system of the form $AX=0$, now I need to prove $det(A) \ne 0$, but I am not getting any patterns here. Please help me to figure out this problem. | Let $\lambda_i \in \mathbb C$ $(i=1,2,\cdots,n)$ be $n$ different complex numbers and $p_i \in \mathbb C[t]$ $(i=1,2,\cdots,n)$ polynomials. If we have the relation $${e^{{\lambda _1}t}}{p_1}(t) + {e^{{\lambda _2}t}}{p_2}(t) + \cdots + {e^{{\lambda _n}t}}{p_n}(t) = 0$$ for all $t \geq 0$, can we conclude that all $p_i(t)=0$? |
Let $m \geq 3$ be an odd integer. Prove that for any $a \in \mathbb{F}_{2^m}$, the equation $x^6+x+a=0$ has a zero or two distinct solutions in $\mathbb{F}_{2^m}$. I have proven the following facts: Let $a>1$ be an integer. For any positive $n,d\in \mathbb{Z}$, $\,$ $d$ divides $n$ if and only if $a^d-1$ divides $a^n-1$. In particular, $\mathbb{F}_{p^d}\subseteq \mathbb{F}_{p^n}$. Let $\phi$ denote the Frobenius map $x\mapsto x^p$ on the finite field $\mathbb{F}_{p^n}$. Then $\phi$ gives an isomorphism of $\mathbb{F}_{p^n}$ to itself. Also, $\phi^n$ is the identity map and no lower power of $\phi$ is the identity. For any prime $p$ and any nonzero $a \in \mathbb{F}_p$ prove that $x^p-x+a$ is irreducible and separable over $\mathbb{F}_p$. I don't know if any of these facts will help me prove this. I am currently studying Chapter 13 from Dummit and Foote. Any help on how to prove the statement is greatly appreciated, thank you. ***My question is not exactly the same as the post in because I found a counterexample for $x^2+ax+1=0$ having the same number of solutions as $x^6+ax+1=0$ in $\mathbb{F}_{2^m}$ whenever $m \geq 3$ is odd. | I am reading a proof that narrows down to the following statement: It is easy to see that the number of solutions of $x^6+x=a$ in $\mathbb{F}_{2^m}$, where $a\in \mathbb{F}_{2^m}$ and $m\geq 3$ is odd, is same as number of solutions of $x^2+ax+1=0$ in $\mathbb{F}_{2^m}$. Why is this true? They say that $x^7=1$ for $x \neq 0$, which I also don't see. Thank you! |
On Area 51, there were at least . Both were deleted. Proposals with insufficient activity are subject to removal. Occasionally, proposals may also be removed for reasons of moderation: spam, off topic, abuse, etc. If I may ask, were these removals due to "insufficient activity" or due to military-related matters being considered off-topic? The reason I ask this question is that I see no point in gathering a few people and attempting to start a new SE site that will never take off due to its being considered off-topic. | I know of the following rules for creating a proposal on Area 51: The scope must be reasonably well-defined, not too unclear (e.g. "cool stuff"), too opinion-based (e.g. "car reviews"), too broad (e.g. "life on Earth"), or too narrow (e.g. "The 1995 academic misconduct scandal at East Oak Mews High School"). One come to Area 51 with an already existing community rather than hope to build one on Area 51. Proposals that are subsets of existing sites are not acceptable (e.g. — deleted). These get closed as "This subject is already well-covered by a live Stack Exchange site. We generally do not split off subjects simply to give them their own space." Proposals for non-English sites . Other than the criteria above, are there any per se restrictions on site content for an Area 51 proposal? If so, what topics are currently banned? I would expect a proposal for a "Let's organize a lawsuit against Stack Exchange" or "[Specific SE staff member] sucks, amirite?" would get closed for obvious reasons, but I'm interested if there are any non-obvious topics that are not currently allowed in proposals regardless of how well-defined, well-scoped, original, and well-supported by a community they are. Having a list of banned topics would be helpful to potential proposers as well as the communities that back them. For example, I wouldn't want to go to all the effort of organizing a community, bringing them to Area 51, etc., only to have my proposal closed with a curt "Sorry, due to the political climate, we are not currently accepting proposals for sites about real-life weapons." custom closure. To be clear, I am asking solely about topic restrictions (e.g. "no sites about fishing, hunting, or weapons"). I'm not asking about clarity requirements, the requirement to have a pre-existing community, not duplicating an existing site, or the requirement to not use sock puppets to artificially inflate proposal stats. Those requirements are already well-defined elsewhere or else are common sense. Also to be clear, I don't have a specific proposal idea in mind right now or the community to make it happen. I'm asking in general. The question could be rephrased as "What are those topics where I shouldn't even bother to try to define, gather a community, etc. because any attempt to propose a site will be summarily closed due to covering a banned topic?" This is not a duplicate of because that question is about the appropriateness of expanding a proposal to cover things that are acceptable proposal topics but arguably don't make sense in combination with the original proposal scope. My question is about topics that are completely banned from proposals regardless of whether they are included in the original proposal description or tacked on by the community later. |
I'm trying to figure out the closed form formula for the following: $$ \sum_{i=1}^{N} \frac{1}{i} $$ I think the denominator will have $N!$ in it but otherwise I cannot figure it out. Can someone help? | Is there any formula for this series? $$1 + \frac12 + \frac13 + \cdots + \frac 1 n .$$ |
Show for any odd prime $$p\geq 5,$$ $$\left ( \frac{-3}{p} \right ) =\begin{cases} 1 & \text{ if } p\equiv 1,-5\pmod{12} \\ -1& \text{ if } p\equiv -1,5\pmod{12} \end{cases}$$ So far I have that (1) Let $$p\equiv 1\pmod{4}$$ then $$p\equiv 1\pmod{3}$$ to get $$\left ( \frac{-3}{p} \right )=-\left ( \frac{p}{3} \right )=-\left ( \frac{1}{3} \right )=-1$$ (2)Let $$p\equiv 1\pmod{4}$$ then $$p\equiv 2\pmod{3}$$ to get $$\left ( \frac{-3}{p} \right )=-\left ( \frac{p}{3} \right )=-\left ( \frac{2}{3} \right )=1$$ (3)Let $$p\equiv 3\pmod{4}$$ then $$p\equiv 1\pmod{3}$$ to get $$\left ( \frac{-3}{p} \right )=\left ( \frac{p}{3} \right )=\left ( \frac{1}{3} \right )=1$$ (4)Let $$p\equiv 3\pmod{4}$$ then $$p\equiv 2\pmod{3}$$ to get $$\left ( \frac{-3}{p} \right )=\left ( \frac{p}{3} \right )=\left ( \frac{2}{3} \right )=-1$$ After solving CRT systems I get, $$\left ( \frac{-3}{p} \right ) =\begin{cases} 1 & \text{ if } p\equiv 5,-5\pmod{12} \\ -1& \text{ if } p\equiv 1,-1\pmod{12} \end{cases}.$$ So I'm not sure where I'm messing up. Any help would be appreciated. | Going over a past exam in my elementary number theory course, I noticed this question that caught my attention. The question asked for the conditions that allowed $-3$ to be a quadratic residue mod $p$. Doing some experimentation, I found that this was possible when $p \equiv 1 \pmod 3$. So I guess I have answered part of the question. But the proof is obviously nagging me: Prove $-3$ is a quadratic residue in $\Bbb Z_p$ if and only if $p \equiv 1\pmod 3$. I've done a bit of work on this, but haven't been able to come up with anything close to elegant nor conclusive. Any help would be appreciated. |
I search everywhere and almost everyone was suggesting to open the ~/.bashrc or ~/.bash_aliases, then put the alias command there, I created a function name palias as permanent alias function and put it in ~/.bashrc: function palias(){ echo "alias $1='$2'" >> /home/User/.bashrc;} So now if I want to permanently alias some command I just : palias update "sudo apt-get update" I wonder if there is a built in command like this function, or anything like this to install from repositories? | I would like to create an alias to rm command in order to have a confirmation message after executing this command. So I am creating an alias like this alias rm='rm -i'. But as far as I know this is a temporary alias and it lives until you close the terminal. As it is explained to save alias permanently I need to execute ~/.bash_aliases or ~/.bashrc commands in terminal and add my alias there. But when I execute ~/.bashrc I get following error message : bash: /home/bakhtiyor/.bashrc: Permission denied When I run ~/.bash_aliases I get another error message like this: bash: /home/bakhtiyor/.bash_aliases: File or directory doesn't exist. What is the actual problem and how can I solve it? |
If I speak about a neutral sex person, what can I say to exprime a possession ? Example: The student will use his or her pen to write. Is it better to write every time his or her or is there a correct sentence about it ? | I just found myself in situation that I am telling about someone who added to me in Skype: because of the nickname I think that it is a girl and used all the time the word «she». But as she didn't say anything yet with exception the "hey :)", I can't even be sure it is a human (it is could be just a bot). So I am afraid that talking about her by using «she» could lead to misunderstanding. Shall I use the word «it»? Or is it wrong? Is there another way? E.g. in Russian a sex have any noun, so I can say «she» and mean «the person» because the «person» have feminine gender. Either I can say «he», and mean «the one», because it is male gender. So, this way I don't confuse my interlocutor about my knowledge about a person's sex. |
"The Standard Model of particle physics is a theory concerning the electromagnetic, weak, and strong nuclear interactions, as well as classifying all the subatomic particles known". Since it includes electromagnetism, at least an aspect of the model has a classical limit, namely Maxwell's equations. Is this the only aspect of the model that has a defined classical limit? | Electromagnetic interaction has classical electromagnetism as its classical limit. Is it possible to similarly describe strong and weak interactions classically? |
Why isn't the reflexive property redundant we defining an equivalence class? If $x \sim y$, then $y \sim x$ by the symmetric property. Using the transitive property we can deduce that $x \sim x$. | An equivalence relation is defined by three properties: reflexivity, symmetry and transitivity. Doesn't symmetry and transitivity implies reflexivity? Consider the following argument. For any $a$ and $b$, $a R b$ implies $b R a$ by symmetry. Using transitivity, we have $a R a$. Source: Exercise 8.46, P195 of Mathematical Proofs, 2nd (not 3rd) ed. by Chartrand et al |
What can cause Windows 7 to prevent me from formatting 500 GB (actually 465 GB) external USB disk as FAT32? No matter, what I did (Windows Explorer, Disk Management), the only options I was presented were: exFAT and NTFS. Why? 465 GB is far lower than FAT32 partition size limit, right? I had to install and use 3rd party program. And using it there was absolutely no problems (no errors, no objections) in finishing this task. Formatting it as 465 GB FAT32 disk took less than 30 seconds. What am I missing here? Why Windows 7 prevented me to format this disk as FAT32 using native system tools? | I am trying to format an external hard disk to FAT32 (I need it to work with some hardware that expects it to be in FAT32). When I am trying to format it via Windows the only option get is to format it to NTFS. When I am trying to format one of my own partitions (on the hard disk that is running the OS) I can do it only in NTFS while another partition my OS can format in both NTFS and FAT32. What can cause such a behavior and how can I format the external hard disk to FAT32? |
I have a Sony CyberShot DSC-H70 camera, with a SanDisk 128 GB Extreme SD card. After taking 50 or so pictures, I decided to mount the card onto my Toshiba Satellite C655 running Ubuntu 16.04.1, but got the following error message. Is there anything that I can add to the system to make it able to mount? Thanks, in advance... Error mounting /dev/sdb1 at /media/skline47/disk: Command-line `mount -t "exfat" -o "uhelper=udisks2,nodev,nosuid,uid=1000,gid=1000,iocharset=utf8,namecase=0,errors=remount-ro,umask=0077" "/dev/sdb1" "/media/skline47/disk"' exited with non-zero exit status 32: mount: unknown filesystem type 'exfat' | When trying to mount an exfat filesystem, I get the following error: Error mounting /dev/sda6 at /media/gkp/Backup: Command-line `mount -t "exfat" -o "uhelper=udisks2,nodev,nosuid" "/dev/sda6" "/media/gkp/Backup"' exited with non-zero exit status 32: mount: unknown filesystem type 'exfat' Exfat is used on some USB sticks and camera sd cards. What can I do to mount this type of filesystem? |
Both written or spoken? For example: Please have a seat. Have a seat please. And how would the use of commas change the meaning or tone of the request? Are there other options that I've excluded? | I would please prefer to take both parts of the test on Monday. Is the placement of the word please in this sentence grammatically correct? |
I would like to input items in a bibliography as follows: Author(for example: Mike) item 1: article item 2: book item 3；... How can I do this? Could anybody help me? Thanks in advance. There is a little difference from others. I need the following form Milnor, J.: [1]. Construction of universal bundles: I, Ann. Math., (2)63:272-284 (1956). [2]. Construction of universal bundles: II, Ann. Math., (2)63: 430-436 (1956). Milnor, J., and M. A. Kervaire: [3]. Bernoulli numbers, homotopy groups, and a theorem of Rohlin, Proc. Intern. Congr. Math., 1958. | I'm working on a new edition of a book which uses a very unusual style of bibliography: Entries are sorted in author-year fashion, but then numbered per author or group of authors, e.g.: Milnor, J.: 1. Construction of universal bundles: I, Ann. Math., (2)63:272-284 (1956). 2. Construction of universal bundles: II, Ann. Math., (2)63: 430-436 (1956). 3. On manifolds homeomorphic to the 7-sphere, Ann. Math., (2)64: 399-405 (1956). 4. The theory of characteristic classes, mimeographed, Princeton University, Princeton, N.J., 1957. Milnor, J., and M. A. Kervaire: 1. Bernoulli numbers, homotopy groups, and a theorem of Rohlin, Proc. Intern. Congr. Math., 1958. Milnor, J., and E. Spanier: 1. Two remarks on fibre homotopy type, Pacific J. Math., 10: 585-590 (1960). Citations are formatted as Milnor [3], and so on. Is there any bibtex style for something strange as this? Or can this type of bibliography be created with biblatex without too much coding? |
It is a pretty simple problem but looking through most of the answers and MS documentation, I could not find a simple way to use the abbreviated timezone information from Unix system in ParseExact function of DateTime in Powershell v4. The date value that I receive is like December 29, 2016 2:04:26 PM EST All of the elements in above date time are easily mapped except the "EST". This can of course be EST, EDT, PST, PDT or any other timezone. MS timezone seems to require the full time zone name or id. How do we lookup EST in MS timezone in powershell? Update* We essentially decided to ignore the timezone since we are interested in the day not the specific time of the day. There does not seem to be a simple answer except adding a case or lookup type statement and then converting it to PS style timezone (-5:00) etc. The question that was cited as duplicate was answered 9 years ago. PS has gone through many iterations in this period so it should be reasonable to ask this question for a simpler resolution. | I'm trying to parse an international datetime string similar to: 24-okt-08 21:09:06 CEST So far I've got something like: CultureInfo culture = CultureInfo.CreateSpecificCulture("nl-BE"); DateTime dt = DateTime.ParseExact("24-okt-08 21:09:06 CEST", "dd-MMM-yy HH:mm:ss ...", culture); The problem is what should I use for the '...' in the format string? Looking at the MSDN page doesn't seem to list a format string for parsing timezones in PST/CEST/GMT/UTC form. |
I know there are way better and more tested encryption methods, but I was wondering if the following code could be use for symmetric encryption? var text = "hello"; var password = "mypass"; var message = hash(text) + encrypt(text, password); function encrypt(text, password){ var key = hash(hash(text) XOR hash(password)); var passphrase = key; while(passphrase.length < text.length){ key = hash(key); passphrase += key; } passphrase = passphrase.substring(0, text.length); return text XOR passphrase; } It can easily be decrypted if you know the password. Is there any flaw to this simple algorithm? N.B.: A similar question was asked but the algorithm doesn't work... | A few years ago I devised a symmetric-key system that worked like so: H() = some hashing function h = the number of bits in the result of H() key = bits to be used as a key ^ = the XOR operation + = concatenation len() = the length function (in bits) max = ceiling(len(cipertext) / h) pad = pad_0 + ... + pad_max pad_0 = H(key) ^ H(plaintext) pad_n = H(pad_(n-1)) cipherpart_n = plaintext_n ^ pad_n ciphertext = H(plaintext) + cipherpart_0 + ... cipherpart_max Basically, it builds up a "pad" based on the hash of the message and hash of the key and XORs the message against it. I am not actually an expert, so I was wondering why an approach like this isn't very common. |
I suppose you will assume this question as a duplicate and probably will ban it, but believe me I tried almost everything I could find on this forum and beyond but nothing helped. Please help me with this weird problem, laptop is brand new. WiFi signal is very weak, even when I put it next to adapter, it disconnects after logout/sleep and needs reboot to reconnect. Tried following solutions: lfwinger/rtlwifi_new, rtl8723be.conf in /etc/modprobe.d/...but none of this solutions has any effect. wlan0 IEEE 802.11bgn ESSID:"one13" Mode:Managed Frequency:2.467 GHz Access Point: 50:2E:5C:EE:D0:E1 Bit Rate=72.2 Mb/s Tx-Power=20 dBm Retry short limit:7 RTS thr=2347 B Fragment thr:off Encryption key:off Power Management:off Link Quality=40/70 Signal level=-70 dBm Rx invalid nwid:0 Rx invalid crypt:0 Rx invalid frag:0 Tx excessive retries:0 Invalid misc:1088 Missed beacon:0 | I have installed Ubuntu 15.04 on my laptop with RTL8723BE Wi-fi card. But it is always disconnecting from network. I have tried echo "options rtl8723be fwlps=N ips=N" | sudo tee /etc/modprobe.d/rtl8723be.conf but that didn't helped. What can I do to prevent the wifi from disconnecting? If I upgrade to kernel 4.X, will it help? ~$ lspci -knn | grep Net -A2 09:00.0 Network controller [0280]: Realtek Semiconductor Co., Ltd. RTL8723BE PCIe Wireless Network Adapter [10ec:b723] Subsystem: Hewlett-Packard Company Device [103c:2231] Kernel driver in use: rtl8723be ~$ rfkill list 0: hci0: Bluetooth Soft blocked: yes Hard blocked: no 1: phy0: Wireless LAN Soft blocked: no Hard blocked: no ~$ ifconfig && iwconfig && route -n && ping -c 1 google.com eth0 Link encap:Ethernet HWaddr 38:63:bb:cd:4a:7e UP BROADCAST MULTICAST MTU:1500 Metric:1 RX packets:3 errors:0 dropped:0 overruns:0 frame:0 TX packets:53 errors:0 dropped:0 overruns:0 carrier:0 collisions:0 txqueuelen:1000 RX bytes:752 (752.0 B) TX bytes:8445 (8.4 KB) lo Link encap:Local Loopback inet addr:127.0.0.1 Mask:255.0.0.0 inet6 addr: ::1/128 Scope:Host UP LOOPBACK RUNNING MTU:65536 Metric:1 RX packets:3870 errors:0 dropped:0 overruns:0 frame:0 TX packets:3870 errors:0 dropped:0 overruns:0 carrier:0 collisions:0 txqueuelen:0 RX bytes:314613 (314.6 KB) TX bytes:314613 (314.6 KB) wlan0 Link encap:Ethernet HWaddr c0:38:96:6d:c4:83 inet addr:192.168.1.205 Bcast:192.168.1.255 Mask:255.255.255.0 inet6 addr: fe80::c238:96ff:fe6d:c483/64 Scope:Link UP BROADCAST RUNNING MULTICAST MTU:1500 Metric:1 RX packets:15240 errors:0 dropped:0 overruns:0 frame:0 TX packets:14627 errors:0 dropped:0 overruns:0 carrier:0 collisions:0 txqueuelen:1000 RX bytes:14410285 (14.4 MB) TX bytes:2192744 (2.1 MB) eth0 no wireless extensions. wlan0 IEEE 802.11bgn ESSID:"DIR-615" Mode:Managed Frequency:2.437 GHz Access Point: 00:90:4C:08:00:0D Bit Rate=150 Mb/s Tx-Power=20 dBm Retry short limit:7 RTS thr=2347 B Fragment thr:off Power Management:off Link Quality=70/70 Signal level=-22 dBm Rx invalid nwid:0 Rx invalid crypt:0 Rx invalid frag:0 Tx excessive retries:0 Invalid misc:186 Missed beacon:0 lo no wireless extensions. Kernel IP routing table Destination Gateway Genmask Flags Metric Ref Use Iface 0.0.0.0 192.168.1.1 0.0.0.0 UG 400 0 0 wlan0 169.254.0.0 0.0.0.0 255.255.0.0 U 1000 0 0 wlan0 192.168.1.0 0.0.0.0 255.255.255.0 U 0 0 0 wlan0 PING google.com.Dlink (172.26.136.19) 56(84) bytes of data. 64 bytes from 19.136.26.172.in-addr.arpa (172.26.136.19): icmp_seq=1 ttl=249 time=102 ms --- google.com.Dlink ping statistics --- 1 packets transmitted, 1 received, 0% packet loss, time 0ms rtt min/avg/max/mdev = 102.547/102.547/102.547/0.000 ms |
On in XI Free Models and Logic Programming of Ebbinghaus' Mathematical Logic: In general, the following statement is false: (*) If $\Phi \vdash \exists x \phi$ then there is a term $t$ with $\Phi \vdash \phi \frac{t}{x}$ We get a counterexample for $S = \{R\}$ with unary $R$, $\Phi = \{\exists x Rx\}$, and $\phi = Rx$. In the counterexample, why if $\{\exists x Rx\} \vdash \exists x R x $, then there is no term $t$ with $\{\exists x Rx\} \vdash R t $? On or the $(\exists S)$ sequent rule says $$ \frac{\Gamma \quad \phi \frac{t}{x}}{\Gamma \quad \exists x \phi}$$ Is this $(\exists S)$ rule the converse of (*) in the quote at the beginning? Thanks. I mistook $\vdash$ as $\models$ in | On in XI Free Models and Logic Programming of Ebbinghaus' Mathematical Logic: In general, the following statement is false: (*) If $\Phi \models \exists x \phi$ then there is a term $t$ with $\Phi \models \phi \frac{t}{x}$ We get a counterexample for $S = \{R\}$ with unary $R$, $\Phi = \{\exists x Rx\}$, and $\phi = Rx$. In the counterexample, why if $\{\exists x Rx\} \models \exists x R x $, then there is no term $t$ with $\{\exists x Rx\} \models R t $? Thanks. |
How to calculate $$\mathop {\lim }\limits_{n \to \infty } \left( {\sqrt[n]{{{3^n} + {4^n}}}} \right)?$$ I saw on the suggestions that you can use the sandwich theorem or compression. And the fact that $\displaystyle\mathop {\lim }\limits_{n \to \infty } \left( {\sqrt[n]{2}} \right) = 1$ So I must first find upper bounds and lower. someone help me with this please? | How can I prove the convergence of the sequence $b_n=\sqrt[n]{x^n+y^n}$ where $x, y > 0$? Can I divide it in two cases? Case 1: $x > y$. $$ b_n=\sqrt[n]{x^n+y^n} < \sqrt[n]{x^n+x^n} = \sqrt[n]{2 \cdot x^n}=x \cdot \sqrt[n]{2} $$ Case 2: $x < y$. $$ b_n=\sqrt[n]{x^n+y^n} < \sqrt[n]{y^n+y^n} = \sqrt[n]{2 \cdot y^n}=y \cdot \sqrt[n]{2}$$ Result: Does the sequence converges to $\max(x,y)$? |
I'll be staying in Paris for several weeks and I am planning to stay at an Ibis hotel. I want to know if I am able to invite unregistered guests during the day (not to sleep, eat, or take advantage of any other service). Or if I have to pay a fee. | Can I let my friend come and join me in my hotel room, just for visiting? Not sleeping or eating. |
I understand that both the electric and gravitational forces are inversely proportional to the squared distance from the point source and that the gravitational constant is around $10^{-20}$ times Coulomb's constant. I don't understand why this suffices to conclude that the gravitational force is stronger than the electric force. The two constants that I see getting compared here have different units. One involves electric charges, while the other involves gravitational masses. To me, this makes as much sense as saying that a second is larger than a meter. Is it related to the energy densities of these fields? If yes, how? I think that it is not the duplicate of the mentioned question because the point being asked in that question is why do we consider gravitational fields weaker even if they are more dominant in the universe at macroscopic levels. But, I want to ask that what are the criteria based on which we define the relative strength or weakness of forces/fields. What do we exactly mean by declaring a force/field stronger than the other? Is it related to their energy densities? | I can understand that on small scales (within an atom/molecule), the other forces are much stronger, but on larger scales, it seems that gravity is a far stronger force; e.g. planets are held to the sun by gravity. So what does it mean to say that "gravity is the weakest of the forces" when in some cases, it seems far stronger? |
What are Android's hidden Secret Codes? There are a bunch of secret codes to access hidden features or perform special actions. They're entered into the dialer and have the following format: *#*#<CODE>#*#* What are the standard (vanilla) codes and what do various carriers and device makers add? And how can I find out about them by myself? | There a lots of differents keypad commands in Android. Which one do you know ? Some of them are listed here : *#*#checkin#*#* Phones home to check for updates. *#*#info#*#* - Enters a detailed phone information menu. *#*#1472365#*#* : Access to the GPS config menu (useful for patching ) |
This question might be trivial but I have a conceptual confusion regarding permittivity and susceptibility of a dielectric According to Wikipedia, permittivity is the ability to resist external electric field. This means a substance with high permittivity requires high external electric field to polarize. On the other hand, susceptibility is defined as the ability to polarize. So a substance with higher susceptibility should polarize easily. This means both the quantities are inversely proportional to each other but mathematically they are linearly dependant Where am I going wrong? I get it that there is a similar question but the answer for that question did not answer mine and I still did not get the privilege of commenting as I am a newbie. That's why I posted it as a separate question I understood the definitions but couldn't understand the mathematical relation | I want to ask a question about the meaning of the names of some dielectric properties. I'm not a native English speaker, so I don't know why the name of the properties are susceptibility and permittivity. It could be trivial, but I want to understand why they are named this way. As far as I understand, susceptibility is about how susceptible the material is. Atoms are susceptible to electric fields. Then what about permittivity? Do they permit something? Permittivity is about total field and polarization ($\mathbf{D}= \epsilon_0 \mathbf{E} + \epsilon_0 \chi_e \mathbf{E}$ $=\epsilon_0 \mathbf{E}+\mathbf{P}$). But to me, both look almost the same. Why don't you call susceptibility permittivity, and permittivity susceptibility? |