body1
stringlengths 20
4.1k
| body2
stringlengths 23
4.09k
|
|---|---|
I am designing a mobile (iOS/Android) game and I try to save data (such as levels, coins, status) in local files. In this way, I am concerning a case that someone can just copy these files and give them to a friend, so the friend can have achieve certain levels and all the coins held in the data files right away. Instead of saving the data in a server, is there any way to prevent this happen? I am thinking to encrypt the data with a key that is unique for a device. Is this a good idea or it might cause some other problem? | What options are there for saving game data in a secure manner? I'm interested in solutions specifically tailored for C++. I'm looking for something that is fast and easy to use. I'm only concerned about storing simple information such as Which levels are and are not unlocked The user's score for each level I'm curious again to know what's out there to use, any good libraries to use that give me nice, secure game data files that the average player can't mess with. I just found here which looks very nice, but it would be great to get some opinions on potential other libraries/options out there. |
In a two months I will have a bachelors degree from a German University with an degree average (Notendurchschnitt) of 1.8 or 1.9 . My programme uses ECTS Credit Points. I am in the process of applying to British MSc programmes. They mostly require a Honours degree of "2:1" which, according to one university, is equivalent to "GPA 3.0". Do I pass these requirements? And is it legit for me to say in my application that I have a GPA of 1.9? I tried to get my head around these degree specifications but was unable to. | I'm trying to figure out the equivalence between grade schemes in different countries. According to some Google results: If you are a U.S. citizen, you need a GPA of 3.2+ (it varies, some say 3.2 and some others say 3.6, etc) to apply for a position in the UK (job or university) where the prerequisite is to have a minimum grade of 2:1. In UK 2:1 is earned if you have a 60-69% of the points. I've read that 2:1 is the same as 67%. In Spain we use a grading scheme of 10 points. So according to (2), for have a UK 2:1 you need to have 6-6.9 points. If you are Spanish and have 6.7, when converting it to GPA the result is 1.5. However, if you take the above points and treat them as a math equation, the final result will be GPA 1.5 = GPA 3.2, which doesn't make any sense. GPA 3.2 = UK 2:1 UK 2:1 = Spain 6.7 Spain 6.7 = GPA 1.5 Replacing now... UK 2:1 = GPA 1.5 GPA 3.2 = GPA 1.5 My question is if someone has a better explanation on converting grades obtained in different countries. |
how to glue multiple CPUs together, I mean How openstack achieves it. What do they really mean when they say create CPU cluster using Openstack Nova. Openstack is written in Python, Any example ( Basic one ) would be appreciated. | We are studying implementing some virtualized servers here, but we don't know what will be better suitable for us. Some folks are saying better have two huge servers, and others are saying have like a ten middle-end servers. We have a legacy Visual Foxpro application, which nowadays run on Dual Xeon E5405 @ 2GHz and 16Gb of RAM. The currently server its getting too slow due the number of active users and process running on it. Virtualizing this server will give us the benefit of an faster disaster recovery. So the question is, having like ten physical servers running at 1.7GHz and 4Gb of RAM, we could virtualize one server into 4 machines, and have one virtualized server running at 6.8GHz and 16Gb of memory? If yes, there is some how if one machine stops, automatically manage this virtual machine to another one, and execute the appropriate maintenance on it, and later back to it again? |
I would like to ask if there any Java API which can fire events, when a specific line on the txt file change and which line is change, modified or delete? If not, I would like to point me the direction to look about it! Thanks | I'd like to be notified when a file has been changed in the file system. I have found nothing but a thread that polls the lastModified File property and clearly this solution is not optimal. |
Is the definition of $p\rightarrow q$ in logic $(\lnot p) \lor q$? | I was looking at an exercise where it asked the following: $$\begin{array}{ccc} p&q&p\rightarrow q \\ T&T&T \\ &\ldots \end{array}$$ So, for the third column, I just put $T$ which was correct but I didn't understand what $\rightarrow$ meant. I have seen $\implies$ but I haven't the arrow. Are they the same thing? Thanks a bunch! |
UPDATE: I know this has been marked as a duplicate, but none of the following duplicate answers have worked (including restarting): This works: , but my original post is asking how to get around this specific hack... My setup: OSX Mountain Lion, Parallels, Windows 7 VM, Visual Studio Ultimate 2013 The problem that I have is that when I open Visual Studio to make a new solution/project, whether or not I add files or work for however long, then close Visual Studio completely, and I want to delete the root solution/project folder that was created by Visual Studio, Windows tells me that I cannot delete that folder and tells me "You'll need to provide administrator permission to delete this folder". However, if I go into that same root solution/project folder and delete all the files in there first, which it lets me do no problem, then back up, it then allows me to delete the root solution/project folder without issue. I have no idea how to delete that folder without going in and doing that hack. I should note that I am also a programming teacher who creates multiple solution/project folders everyday and then deletes them afterwards, so this is really getting annoying at this point. Is there something I am missing with: Windows permissions, Visual Studio settings, special hidden files, locked files, etc. that is creating this situation? I have asked people who use Visual Studio 2013 and Windows 7 without VM and they have never seen the issue, so I suspect it has something to do with the VM part of this... Note: I am an administrator on both systems and installed everything myself. If I turn on the "Owner" column in Windows Explorer, it shows that I am the owner of all files created in the folder. Using Visual Studio itself, I've had no problems; only this problem exists. Screenshots: | There's a folder on my desktop called like 'example' and when I try to delete it it says "You require permission from the computer's admistrator to make changes to this folder" when checking the properties; the Current owner says "Unable to display current owner." I have tried many solutions found online, including enabling & signing into the adminstrator account, but haven't been able to fix it. My situation is extremely similar . I can't even open the folder. I am running Windows 7 x64 Home Premium. I can't do anything to the folder because I need permission from my 'computer administrator' It's extremely weird, and I can't fix it. Thanks in advance! UPDATE: Yes, I'm adminsitrator on my computer. |
Once i switched on my television and i noticed that bits of paper and pieces of string stick to it. I decided to conduct my own experiment and bought a headphone jack near the screen and there was a visible spark on the jack . Can anyone explain this phenomenon. | My physics textbook states an activity- "Cut out thin strips of paper and lightly iron them. Take them near a TV screen or computer monitor. The strips get attracted to the screen and may cling to the screen for a while." But this doesn't happen in practice. Is this because I did the activity with an lcd screen. Will a crt/led/plasma screen make it happen? If so, why? Why should the paper strips be ironed? |
Find all function $f: \Bbb{N}_0 \rightarrow \Bbb{N}_0 $ satisfying the equation $f(f(n) + f(n) = 2n +3k$ for all $n \in \Bbb{N}_0 $ where $k$ is a fixed natural number. I have proceeded with solution to a point but I am not able to go further so lets say $f(0)=m$ $\implies$ $f(m) =3k-m$ $f(3k-m)=f(f(m)=2m+3k-f(m)=3m$ $f(3m)=f(f(3k-m))=2(3k-m)+3k-f(3k-m)=9k-5m $ after this I am not able to proceed through | Find all functions $f:\mathbb{N_{0}} \rightarrow \mathbb{N_{0}}$ satisfying the equation $f(f(n))+f(n)=2n+3k,$ for all & $n\in \mathbb{N_{0}}$, where $k$ is a fixed natural number. A friend of mine suggested me to use recurrence relation. While it is unfortunate that I have problems understanding recurrence relation. Please refer information to understand difference equation, homogeneous equation & auxillary equation. Thanks in advance! Kindly don't down vote for not showing my attempt. I am seriously not able to understand the question and the process suggested to use. |
I am trying to use the value of a String obtained through JOptionPane. However, there is a problem with reading the String. What am I doing wrong here? import javax.swing.JOptionPane; public class convertNumber123 { public static void main(String[] args){ String numsystem1; numsystem1 = JOptionPane.showInputDialog("Please enter the numeral system that you want to convert from: binary, octal, decimal or hexadecimal."); if (numsystem1 == "Binary" || numsystem1 == "Octal" || numsystem1 == "Decimal" || numsystem1 == "Hexadecimal") System.out.println (numsystem1 + "it is!"); else System.out.println ("Please, enter the correct system name."); } } | I've been using the == operator in my program to compare all my strings so far. However, I ran into a bug, changed one of them into .equals() instead, and it fixed the bug. Is == bad? When should it and should it not be used? What's the difference? |
When should I not use indefinite articles? I get very confused. | I can’t for the life of me figure out where to use a and where to use the — and where there is no article at all. Is there a simple rule of thumb to memorize? The standard rule you always hear: “If a person knows which item you are talking about then use "the" . . . doesn’t clear things up for me, as I have no idea whether or not they know. |
Would using there are instead of there is be acceptable in utterances that talk about quantity? For example, There are 300,000 dollars in my account. There are 20 gallons of petrol in my tank. | I read the following sentence on YouTube and initially thought it was grammatically incorrect: Here are 10 minutes of the movie Black Hawk Down! I thought "are" should have been "is" but then I realized minutes is plural so the plural form, are, is used correctly. I also thought how most people would naturally say "Here is ten dollars in change" but is the use of the singular form, is, correct since dollars is plural? Am I misunderstanding a rule? |
I have a wrapper function that allows me to achieve the result of sprintf by writing one line of code instead of 3. void output(const tstring& format, ...) { va_list args; va_start(args, format); const int len = _vsctprintf(format.c_str(), args) + 1; TCHAR* buf = new TCHAR[len]; _vstprintf(buf, format.c_str(), args); OutputDebugString(buf); delete[] buf; } My problem: The variadic arguments are corrupted. For example; output(_T("%d\n"), 1); // outputs: -858993460 output(_T("%d\n"), 2); // outputs: -858993460 Whats the cause of this error and how can I fix it? | I have this piece of code (summarized)... AnsiString working(AnsiString format,...) { va_list argptr; AnsiString buff; va_start(argptr, format); buff.vprintf(format.c_str(), argptr); va_end(argptr); return buff; } And, on the basis that pass by reference is preferred where possible, I changed it thusly. AnsiString broken(const AnsiString &format,...) { ... the rest, totally identical ... } My calling code is like this:- AnsiString s1, s2; s1 = working("Hello %s", "World"); s2 = broken("Hello %s", "World"); But, s1 contains "Hello World", while s2 has "Hello (null)". I think this is due to the way va_start works, but I'm not exactly sure what's going on. |
I'm using gdalwarp -dstalpha src.tif dst.tif to add alpha channel to an 8-bit unsigned image with 3 bands. The initial size of the image is 300 mb, but adding an alpha band increases it to 1980 mb, which is far more than expected 1/4 increase. What is the matter? | After using gdalwarp to project and align-to-grid (via -tap) a number of rasters I noticed that the output rasters were significantly larger than the original rasters. A fairly thorough web search turned up : Frank Warmerdam explained the reason: "On careful review, the difference in the file in question is because gdal_translate uses the TIFFWriteScanline() interface to write the output file from within GTiffDataset::CreateCopy?(), and this only writes as much of the final 'strip' of the file as is required to complete image area. But gdalwarp goes through the blockio interface which writes the complete final strip, even the portion that falls off the end of the file." This Trac issue is ~7 years old, however, and I know some changes to the GDAL utilities, including gdalwarp have been made since. I'd like to know if the above reasoning still holds and if the file size inflation I'm seeing is "normal." The word "normal" here might be taken to mean unsurprising or expected but, more importantly: is there anything that can be done to mitigate the effects i.e. reduce the output raster file size? Below is a table of the file size inflation I'm experiencing. Input File Size (bytes) Output File Size (bytes) Inflation 1437380431 1698334217 18% 1428001178 1698334433 19% 41683165 137036637 228% The input TIFF files were created in ArcGIS and thus have external Worldfiles, XML and DBF files but these do not make up the difference in file size. Here is a sample gdalwarp call as I've used it in all of these cases; the actual execution was handled by a Python subprocess (subprocess.Popen): $ gdalwarp -tap -tr 30 30 -t_srs "+proj=aea +lat_1=20 +lat_2=60 +lat_0=40 +lon_0=-96 +x_0=0 +y_0=0 +ellps=GRS80 +datum=NAD83 +units=m +no_defs" -co "COMPRESS=LZW" input_file.tif output_file.tif I understand that in rare cases compression makes a larger file, but the effect is the same without the LZW compression. The ratios in the table are with LZW compression. |
I want to see all the duplicate questions which were asked by other users in webmasters.stackexchange.com. I tried a lot but I don't find any filter option to see only duplicate questions. How can I find those questions alone? | I often search for closed questions and sift through the ones that are not duplicates to see if any of them need to be killed. Technically, closure is the first step towards deletion and the only closed posts that are actually useful are duplicates (unless it's a crappy one). For the rest, if the community hasn't bothered to reopen it after a while or if the OP has made no effort to edit their question, I delete it if it has no redeeming content. For example, the only closed posts seen on are exact dupes. But this does become tedious when there are several results for various close reasons with duplicates interspersed between them. I'd like to be able to search as: closed:1 duplicate:0 so that it gives a list of questions closed as OT/NaRQ/NC/TL. This will be similar in behaviour to migrated:0|1. This will also be useful for 10k+ users on all sites (2k+ in beta) in the network, especially SO, so that they can search for questions to spend their delete votes on— especially closed, non-dupe questions in the tag they specialize in. More often than not, I hesitate to vote on questions that are outside my area of interest (unless it is crappy). |
When I use Windows I currently use AutoHotKey to re-map keys (I swapped keyboards on my laptop). Is there any way I can do this in Ubuntu via a script which I can just double-click from the desktop? Or can AutoHotKey/anything similar be used on Ubuntu? Any example is most welcome- say remap the insert key to the home key? | I want to change the key bindings on some of the keys on my keyboard. I want some to run commands and others to activate different keys. What applications can I use to do this? Index: (from within System Settings) I'm still looking for answers using dconf and any other method. |
I have an iPhone 6s, released in 2015. I want to know if I can install iOS 5.1.1 on it, and if it is possible. I don't care if it could brick my iPhone. I'm willing to do it. | I'm trying to downgrade my iPhone from the current iOS to an older one, as per . But every time I try, I always receive this error: The iPhone could not be restored. This device isn't eligible for the requested build. I have tried many times with and without DFU mode. Any ideas regarding this? |
A few days ago, I have seen an example of a latex file, that did conditional \defs on subsequent runs but I can't find that one again. I still remember that it was by looking into the \jobname.aux do get the number of previous builds. In my current situation, I'd like to not use package minted but define its commands to simply use verbatim-environment during the first two builds and using minted and its built-in macros for syntaxhighlight in the third run. How exactly can I get the number of previous latex-runs? | I am not that much into TeX/LaTex programming ... but what I want to do is the following: How to put a number into my document that increments with every compilation My ideas so far are: use a text file as storage of the number read in the number add 1 save the number to the text file put the number into the text I was able to use something like this : \documentclass{minimal} \newwrite\tempfile \begin{document} \immediate\openout\tempfile=lists.tex \immediate\write\tempfile{1} \immediate\closeout\tempfile \input{lists} \end{document} () to write to a file but did not manage to read the number from the file into a variable that than could be iterated by one and saved back to the file. Does anyone has an idea? |
I am not talking about event horizons. I am talking about the actual remnant of stellar collapse. Is it just a point, hence the problem with the singularity? Or does it have a finite volume that we can infer from observable quantities? | Assuming we have a sufficiently small and massive object such that it's escape velocity is greater than the speed of light, isn't this a black hole? It has an event horizon that light cannot escape, time freezes at this event horizon, etc. However this object is not a singularity. If a large star's mass were compressed to the size of, say, a proton, it would certainly have these properties but it would still not be a singularity as a proton does have volume. The reason "physics breaks down" at singularities is because we cannot divide by zero, but as long as the proton-sized object has volume, physics won't "break down", yet we still have an event horizon and an object that is invisible (but not undetectable) from the outside. I have read the answers to related question. I'm not sure if they don't address my specific question or if I don't understand the answers. |
My post on Stack Overflow was automatically turned into a Community Wiki, the rules of which I was not aware of before. This seems to have happened because it was edited more than ten times by me. The edits had a valid reason, and the post was flagged to undo its Community Wiki status, which a moderator indeed did. After almost one day's heavy work with the OP, it was accepted as the correct answer while in the Community Wiki state. With this state reverted, the relevant reputation, i.e. upvotes and answer selection after becoming CW, seems to be lost. I have tried to wait for several hours to check if this is just a latency issue, but it does not seem to be so. I was looking for similar threads on Meta, and found these: There was another one, which I cannot find right now. Sorry about that. Would it be possible to implement a feature which makes it possible to either not lose or reclaim the reputation? | A per the Community Wiki , The original author keeps the reputation gained (or lost) before their post entered community mode. The original author can flag the post to moderator attention for re-convert the C.W to normal post, the moderators will take action on that. If the Community Wiki status of a post is reversed, what will happen to the reputation of votes (Up/down) gained by the post at during its time as a Community Wiki? |
I wanted to connect to a sql server database and print the results of my query using python. Here is the python script. import pyodbc conn = pyodbc.connect('Driver={SQL Server};' 'Server=.\SQLEXPRESS;' 'Database=Fun;' 'Trusted_Connection=yes;') cursor = conn.cursor() cursor.execute('SELECT * FROM Testing') for row in cursor: print(row) I get the following result: (u'Hello', ) It should just say 'Hello' without the "u" in there. Do I need to change my database configuration so that I don't get the u? Or is there something wrong with the python code I'm using. This is python 2.7. | This will surely be an easy one but it is really bugging me. I have a script that reads in a webpage and uses to parse it. From the soup I extract all the links as my final goal is to print out the link.contents. All of the text that I am parsing is ASCII. I know that Python treats strings as unicode, and I am sure this is very handy, just of no use in my wee script. Every time I go to print out a variable that holds 'String' I get [u'String'] printed to the screen. Is there a simple way of getting this back into just ascii or should I write a regex to strip it? |
Consider the function $f$ defined by $$f(x)=\int_0^{2\pi}\ln\left(x^2-2x\cos t+1\right) \,dt.$$ I tried calculating values of this function using Wolfram Alpha and I observed that $f(x)=0$ for all $x\in[-1,1]$. How can we prove this fact? | For $a\ge 0$ let's define $$I(a)=\int_{0}^{\pi}\ln\left(1-2a\cos x+a^2\right)dx.$$ Find explicit formula for $I(a)$. My attempt: Let $$\begin{align*} f_n(x) &= \frac{\ln\left(1-2 \left(a+\frac{1}{n}\right)\cos x+\left(a+\frac{1}{n}\right)^2\right)-\ln\left(1-2a\cos x+a^2\right)}{\frac{1}{n}}\\ &=\frac{\ln\left(\displaystyle\frac{1-2 \left(a+\frac{1}{n}\right)\cos x+\left(a+\frac{1}{n}\right)^2}{1-2a\cos x+a^2}\right)}{\frac{1}{n}}\\ &=\frac{\ln\left(1+\dfrac{1}{n}\left(\displaystyle\frac{2a-2\cos x+\frac{1}{n}}{1-2a\cos x+a^2}\right)\right)}{\frac{1}{n}}. \end{align*}$$ Now it is easy to see that $f_n(x) \to \frac{2a-2\cos x}{1-2a\cos x+a^2}$ as $n \to \infty$. $|f_n(x)|\le \frac{2a+2}{(1-a)^2}$ RHS is integrable so $\lim_{n\to\infty}\int_0^\pi f_n(x)dx = \int_0^\pi \frac{2a-2\cos x}{1-2a\cos x+a^2} dx=I'(a)$. But $$\int_0^\pi \frac{2a-2\cos x}{1-2a\cos x+a^2}=\int_0^\pi\left(1-\frac{(1-a)^2}{1-2a\cos x+a^2}\right)dx.$$ Consider $$\int_0^\pi\frac{dx}{1-2a\cos x+a^2}=\int_0^\infty\frac{\frac{dy}{1+t^2}}{1-2a\frac{1-t^2}{1+t^2}+a^2}=\int_0^\infty\frac{dt}{1+t^2-2a(1-t^2)+a^2(1+t^2)}=\int_0^\infty\frac{dt}{(1-a)^2+\left((1+a)t\right)^2}\stackrel{(*)}{=}\frac{1}{(1-a)^2}\int_0^\infty\frac{dt}{1+\left(\frac{1+a}{1-a}t\right)^2}=\frac{1}{(1-a)(1+a)}\int_0^\infty\frac{du}{1+u^2}=\frac{1}{(1-a)(1+a)}\frac{\pi}{2}.$$ So $$I'(a)=\frac{\pi}{2}\left(2-\frac{1-a}{1+a}\right)\Rightarrow I(a)=\frac{\pi}{2}\left(3a-2\ln\left(a+1\right)\right).$$ It looks too easy, is there any crucial lack? $(*)$ — we have to check $a=1$ here by hand and actually consider $[0,1), (1,\infty)$ but result on these two intervals may differ only by constant - it may be important but in my opinion not crucial for this proof. |
So I know that $\sum_{n\in\mathbb{N}}1/n$ diverges and $\sum_{n\in\mathbb{N}}1/n^2$ converges. What about the series $\sum_{n=2}^\infty1/n(\log(n))$? I'm pretty confident that it diverges but is there a quick justification? | Recently, I encountered a problem about infinite series. So my question is how to know whether the infinite series $\sum _{n=2}^{\infty } \frac{1}{n \log (n)}$ is convergent? |
Trying to work on a project but keep getting this error. Error 1 Inconsistent accessibility: parameter type 'GICT_Project.IObjects' is less accessible than method 'GICT_Project.DatabaseService.Insert(GICT_Project.IObjects)' E:\GICT_Project\GICT_Project\DatabaseService.cs 86 28 GICT_Project Don't know whats wrong. Have tried to change stuff to public but no dice. Here's the problematic code: public static void Insert(IObjects classType) //insert tool data { string query = ""; string type = (classType.GetType()).ToString(); switch (type) { case "Tools": query = "INSERT INTO group2.Tools (ToolID, ToolName, Quantity) VALUES(" + classType.GetSqlInfo() + ")"; break; case "Service": query = "INSERT INTO group2.Services (ServiceID, ServName, ToolID) VALUES(" + classType.GetSqlInfo() + ")"; break; case "Location": query = "INSERT INTO group2.Location (LocationID, Location, Features) VALUES(" + classType.GetSqlInfo() + ")"; break; case "Appointments": query = "INSERT INTO group2.Appointments (AppointmentID, CustomerID, ServiceID, LocationID, EmployeeID) VALUES(" + classType.GetSqlInfo() + ")"; break; case "Employee": query = "INSERT INTO group2.Employee (EmployeeID, EmpName, EmpBirthday, EmpAddress, LocationID) VALUES(" + classType.GetSqlInfo() + ")"; break; case "Customer": query = "INSERT INTO group2.Customer (CustomerID, CusName, CusBirthday, CusAddress) VALUES(" + classType.GetSqlInfo() + ")"; break; case "Skills": query = "INSERT INTO group2.Skills (SkillID, SkillName) VALUES(" + classType.GetSqlInfo() + ")"; break; //many to many tables need to create rows on connecting tables when initialised } InsertQuery(query); } And this is separate class: interface IObjects { string GetSqlInfo(); int GetId(); void InsertData(); } | Whats wrong with the following c# code? Compiler reports this error: Inconsistent accessibility: parameter type 'ClassLibrary1.Interface1' is less accessible than method 'ClassLibrary1.Class1.Class1(ClassLibrary1.Interface1)' with the following code: interface Interface1<T> { bool IsDataValid(); /* Other interfaces */ } public class Class1<T> { public Interface1<T> interface1; public Class1(Interface1<T> interface1) { this.interface1 = interface1; } } I've since designed my code differently using inheritence to but if anyone could tell me what the above is wrong I'd greatly appreciate it. |
Getting this error: Error: Compile Error: unexpected token: 'List' public String SupportTierValue { get { List tmpAcct = [SELECT Id, Name, Support_Tier__c FROM Account WHERE Id IN (SELECT AccountId FROM user WHERE username=:UserInfo.getUsername() ) LIMIT 1 ]; if (tmpAcct.size() > 0) { String SupportTier = tmpAcct[0].Support_Tier__c; } else { String SupportTier = 'SomeDefaultValue'; } } return SupportTierValue; } private set; } | Getting error with this code but I can't figure it out trigger LeadConvert on Lead (after insert) { list leadsToConvert = new list(); Database.LeadConvert lc; string convertedStatus = ''; list convertStatusList = new list(); convertStatusList = [Select Id, MasterLabel from LeadStatus where IsConverted=true limit 1]; if(convertStatusList.size() > 0){ convertedStatus = convertStatusList[0].MasterLabel; } else{ convertedStatus = 'Closed - Converted'; } for(Lead l : trigger.New){ if(l.AutoConvert__c == true){ lc = new database.LeadConvert(); lc.setLeadId(l.ID); lc.setDoNotCreateOpportunity(true); lc.setConvertedStatus(convertedStatus); leadsToConvert.add(lc); } } list lcrList = new list(); lcrList = Database.convertLead(leadsToConvert); } |
I'm looking for another way to describe the act of forcing yourself through a s*** week | I need a single word which means "keep moving forward". What are my options? I need word as persevere Be persistent, refuse to stop cognizant (sometimes followed by 'of') having or showing knowledge or understanding or realization or perception [] keep moving forward I want to make meaningful name for firm please help me |
When revisiting Ohm's Law, I wondered why (I know it's experimentally derived) the voltage change between two points would depend on current. I could understand this dependence with total energy dissipated in moving a current across a resistor but I can not understand why the P.D. (i.e. the work done per unit charge) depends on the current being passed. Essentially, I'm asking why does the amount of energy needed to move a single unit charge depend on how many charge carriers there are with it? | If voltage is a potential difference, describing how much energy will be lost per unit charge as charge carriers pass through the resistor, why would the rate at which charge flows (i.e. current, $=dq/dt$) affect the amount of energy lost per unit charge? I suppose I am asking why a quasi-"extensive" property of the system (current) would affect a quasi-"intensive" property of the system (voltage drop across the resistor). Apologies if the answer is obvious; I was having trouble understanding why the rate of charge flow would factor into voltage drop whilst trying to rationalize Ohm's law for myself. |
I want to activate CSS using JS. Let's say I have this code, and I want to enlarge a picture at first click and then send it to the right after at the second click, but it's not working. Is the function correct? How can I use JavaScript to control the CSS of an element? <script> function function(){ var house = document.getElementById("house"); if(this.className == "mystyle") this.className = "mystyle2"; else this.className = "mystyle"; } </script> <a href="#" style="text-decoration: none"><img src="casa1.jpg" id="house" width="200" height="150" onclick="function()"> I want it to activate this CSS: .mystyle { position: absolute; left: 50%; margin-left: -100px; } .mystyle2{ float: right; } | I have an element that already has a class: <div class="someclass"> <img ... id="image1" name="image1" /> </div> Now, I want to create a JavaScript function that will add a class to the div (not replace, but add). How can I do that? |
I got LG OPTIMUS G PRO (F240L) and I wanna know , will it get OTA 4.5 updates? | Android 5.0 (Lollipop) was officially announced on October 15th, 2014. You can review the high-level changes at the and the announcement on the official . Of course, not all devices will get this update right away and others won't get it at all. Each manufacturer and carrier often choose to add their custom modifications which tend to delay the official release. When will each device get Android 5.0, either officially or unofficially, if ever? See also: |
I've been experimenting with pointers and written the following code: #include <iostream> using std::cout; struct A { int a; char b; A(){ a = 4; } }; struct B { int c; B(){ c = 5; } }; A *a = new A; B *b = new B; int main() { a = (A*)b; cout << a -> a; //5 } Why B* can be converted to A*? Can any pointer be converted to any other pointer? | What are the proper uses of: static_cast dynamic_cast const_cast reinterpret_cast C-style cast (type)value Function-style cast type(value) How does one decide which to use in which specific cases? |
If I’m wearing a set of full plate armor and I replace the gauntlets with gauntlets of ogre strength do I lose the AC provided by the full plate as I’m no longer wearing a full set of full plate armor? | In Adventurers League, can you wear magical boots/gloves/gauntlets while wearing plate armor? |
My old name was CreepyDudes (GD account), and I changed it to CreepyDudes2. Now I want to change it again because I didn't choose wisely. Is there a way to change your username more than once? | I accidentally changed my brother's account name and can't change it back. Is it possible to change it again? |
New to Illustrator (cc) and having some issues making the align tool work for me. I am trying to place all pieces 1.5mm apart for a lasercutting file but when I use the align tool it causes them to either overlap or spread much farther than 1.5mm apart. I am too busy to manually measure the distance between hundreds of objects and play puzzle master; so I am really hoping someone can explain why my objects overlap/spread instead of placing themselves 1.5mm apart like I specify. Thankyou in advance for any help you can give me! | I am creating an animated sprite list in Adobe Illustrator. I finished creating the sprites and used the Horizontal/Vertical Distribute Center commands to distribute the objects equally in some area. But, if the objects are spread too far apart, the Distribute Center tool leaves, albeit equal, much distance between the objects. The opposite is true: if the objects are too close then distributing them will just overlap them. My question is, is there any tool that just puts objects side by side? I imagine that this tool would work if the objects aren't even equal in size. I have viewed and answer but it is not what I need. |
I used Fermat's Little Theorem to get $x^2 \equiv x\pmod 2$ So $2k = x^2-x$ for some integer $k$ $= 2k = x(x-1)$, note that this is a product of two consecutive numbers, so we can rewrite it as $2l$ for some integer $l$ $ = 2k = 2l$ $= k = l$ I don't think this tells me anything meaningful. I think my wrong step is when I start to toy around with the product of consecutive integers, but I am not sure how else to proceed. | If a prime number $p$ is a divisor of a product $ab$, $p$ has to be a divisor of $b$ or $a$. How can I demonstrate this theorem? I demonstrated this theorem on one way using Bezout's theorem in an but are there other proofs?? |
I want to compare Actual table with @TableType_TVP IF Duplicate Row Exist Create procedure sp_InsertintoTable @TableType_TVP TableType_TVP READONLY AS IF(Duplicate Row not Exist then) Begin INSERT INTO ActualTable Select * from @TableType_TVP Select Inserted row count also END else Begin Count Duplicate Row End | Assume a table structure of MyTable(KEY, datafield1, datafield2...). Often I want to either update an existing record, or insert a new record if it doesn't exist. Essentially: IF (key exists) run update command ELSE run insert command What's the best performing way to write this? |
I am currently writing my master thesis and have some specifications with the numbering. My professor wants my numbering as followed: 1. section 1.1 subsection 1.1.1 subsubsection I need a period after the section, but not after the subsections. I am using scrartcl and already tried: numbers=autoendperiod and numbers=endperiod. There also seems to be a problem with \usepackage{titlesec}, as I am getting some errors when I try to use it. Thanks a lot | I would like to add a dot between the number of the section and section name. I used \makeatletter \renewcommand*{\@seccntformat}[1]{% \csname the#1\endcsname .} \makeatother The problem is that, obviously, it put a dot also among subsection number and subsection name which I do not want. Is it possible to add the dot only between section number and section using low level instructions i.e. without any additional package? |
BACKGROUND: Once upon a time, when I installed Ubuntu 10.x on an older machine, and kept upgrading it until 13.04 or 13.10, there was an easy-to-find option in Settings that allowed to install NVidia's proprietary drivers and keep them up to date (or not, because sometimes they released a new version with a bunch of awful regressions). Now, when I installed 13.10 on my new laptop, which I then upgraded to 14.04, I haven't ever been able to find that option anywhere. An attempt to install nvidia drivers with apt-get dont-remember-what resulted in a screwed up system that wouldn't properly start Unity (or even xorg, not sure), roughly equivalent to an unbootable system. But I managed to revert that. I seem to understand that there are some sort of opensource drivers called "nouveau" that come by default in Ubuntu which kind of provide an alternative to NVidia's proprietary drivers. Is that so? THE PRACTICAL QUESTIONS: Is it ok to not install NVidia's drivers, or am I underutilizing the potential of the GPU (i.e. not using all the available hardware acceleration)? Or in other words: is there a test I can run to check whether hardware acceleration of my GPU is being properly used with my current setup (nouveau or whatever it is)? What's the proper recommended way to install NVidia proprietary drivers now on Ubuntu 14.04, without bricking the system? | I just ordered the Nvidia GTX card. I have a dilemma, though. Should I keep using the driver which is available in "additional drivers" in Ubuntu, or should I install the driver from the Nvidia site? So which driver is the best for me? |
I was wondering if it's possible to use my headphones+microphone just as a microphone using a2dp profile. I have problems using HSP because the quality of sound is very poor so i was thinking of using 2 Bluetooth headsets, one as real earphones and one as a mic. I know that ad2p is unidirectional but can I choose if use it as input (microphone) or output (earphone)? | I'm trying to use my headphones with my Ubuntu 13.10. My headphones are Nokia BH-905i, which can be connected via Bluetooth or green+pink wires. If I use bluetooth, voice quality is terrible or microphone doesn't work. If I try to choose "Headset" option from In and Out tabs in Sound Settings, they're disabling each together. In Out tab, I'm using "High sound quality A2DP", because it betters voice quality. How could I get my microphone working? Sound out works fine. |
I have a Macbook Pro A1278 with a dead hard drive. I have put a new hard drive in it and now need to figure out how to get my hands on the os. Does anyone know if it is possible to still download OS X El Capitan? If so, how? | Sometimes it's hard to search for older versions of macOS & OS X on the App Store. This is an attempt to provide the canonical QA for this issue, as per the Meta QA - I expect it to be modified over time to hopefully become a complete information resource. How can I get any older version of a Mac OS to be able to run as a VM, or to reinstall on my Mac? |
I am applying for a visit visa to the UK to attend a competition, I have an invitation letter for it. A company is willing to sponsor me, but I need info on what documents are needed. I have an idea of docs needed if its a person: 1. bank statement of last 6 months 2. letter from bank manager 3. Signed affidavit I need an idea of what is needed for a company. | There seems to be a consistent pattern on TSE, with scores of questions about what documentation best accompanies a visa application, posed not just by those reapplying after a refusal, but by first-time applicants prior to submission (and a few with post-submission anxiety). What is being overlooked, lost in translation, missed? Why is this question even being asked here, when the UK government publishes its own straightforward information? |
I am currently studying a published article as part of an undergraduate research project I am doing. I am having difficulty understanding specific parts as the article is quite dense and makes some leaps in logic that I am having trouble following. The article is of a mathematical/computer science nature and suppresses many details. I would like to email the article's author to ask a question or two, and I am wondering, is this appropriate? If I were a post-doc or something I would not hesitate. My concern is that as an undergraduate, perhaps my questions will be silly and/or a waste of time for the author. Or worse yet, I am concerned that it is inappropriate for an undergraduate to email at all. Can anyone offer some comments on this? Some relevant info: - I have studied the problem and am unable to answer the questions thus far. - My supervisor does not know the answer either and would have to study the paper (my job) to determine the answer. As noted, this is nearly identical to a question asked by a Masters student, but I feel it justifies its own responses. My concern here is that I may be asking questions that would be obvious to a Master's student. | I am reading a paper and have questions about the details of the procedure described. I have read other papers by the same team but they don't explain too much about that procedure anyway. I think it might be common, but my supervisor doesn't know it too. I am stuck and I want to get out of it. As a student working on my master thesis, can I email the contact author for the manuscript cold out, or should I ask someone to contact him for me? I would ask my supervisor but I don't want it to imply that I'm avoid taking initiatives when I could do it on my own. |
I'm trying to remember then name of an old book I read as a kid, hope someone can help locate it? Ok the book I read was part two of a trilogy from around the 70s maybe 80s, it starred a hero who was modified by some kind of either advanced tech or alien tech so that he could grow his fingernails and canine teeth when he needed to fight. I think his teeth were poisonous too, and I think he wore a ring that triggered this change somehow. The book was set on some alien planet with spaceships and so on, there was a part where an alien spaceship was found buried underground and the hero went to investigate it, I think there was some link to his power to transform found in this ship. The cover of the book showed the hero piloting a spaceship with his teeth and "claws" extended and the ring on show on his finger. He wore a seventies looking sci fi helmet. Um.. Honestly that's about all I can remember of it.. A bit vague I know.. Can anyone help? Does it sound familiar? | I have very vague impressions of a book I must have read as a child/teenager in the 1980s (so probably published in the UK in the 1970s or early 1980s). It featured a man who had been technologically enhanced with special powers that he could activate only for short periods (probably because they took a lot of energy), possibly by tonguing one of his teeth. They gave him: Much faster reactions; everything around him slowed down. Greater strength/speed. Metal fingernails/claws. Possibly some sort of enhanced vision, too. I think it described him engaging these powers as: He activated. or similar. He may have been a mercenary type, who had paid a lot for them; they were rare or unique. I don't recall any plot or other characters; it was probably a techno-action story. (No magic, armies, warrior races, telepathy, vampires, or mutants, and I don't recall aliens or space travel.) It may have been part of a short series of 2 or 3 books. I'm afraid this isn't much to go on! I'd completely forgotten about this book until recently, and my impressions are very hazy, so any of the above could be wrong. (I remember enjoying it, though.) I've not found anything I recognise on this site, or others; nor in lists of adult and young-person's SF for that period (so it probably wasn't a big-name author). Does it ring any bells for anyone? |
I'm using a PHP script to get some data from a MySQL database table. I can see the table has the collation utf8mb4_general_ci When the text is displayed on the page, I get: Cust�ias Instead of: Custóias This is what I'm trying: echo '<span id="address_city">'.iconv('utf8mb4_general_ci', 'UTF-8', $row['address_city']).'</span>', "</br>"; And: echo '<span id="address_city">'.converter($row['address_city']).'</span>', "</br>"; With: function converter($conteudo){ return iconv( 'utf8mb4_general_ci', 'UTF-8', $conteudo ); } And also: header('Content-Type: text/html; charset=utf-8'); | I'm setting up a new server and want to support UTF-8 fully in my web application. I have tried this in the past on existing servers and always seem to end up having to fall back to ISO-8859-1. Where exactly do I need to set the encoding/charsets? I'm aware that I need to configure Apache, MySQL, and PHP to do this — is there some standard checklist I can follow, or perhaps troubleshoot where the mismatches occur? This is for a new Linux server, running MySQL 5, PHP, 5 and Apache 2. |
Or why do all but one (I think there's only one...)? All the sites I see end with 'Stack Exchange` on their logo's tooltip, site's welcome bar, etc... but Cross Validated doesn't - why is that? Are there any more sites without the suffix? Examples: | I've found a strange thing: some Stack Exchange sites have their own domain names instead of https://[site name].stackexchange.com. The websites which have their own domain names are: Are there any parameters for allocating specific URLs to Stack Exchange sites? |
I know that -273.15 degrees celsius, also known as Absolute Zero or 0K is the low temperature limit for objects, but is it possible that there is a 'highest temperature?' I would have to guess that it's when it allows objects to reach light speed, but I believe there has to be some 'set temperature' that is the limit for anything. Am I wrong or is there an actual answer? | If temperature makes particles vibrate faster, and movement is limited by the speed of light, then I would assume that temperature must be limited as well. Why is there no limit? |
Let $p$ be an odd prime. Prove that $$\sum_{j = 0}^p {p \choose j}{p + j \choose j} \equiv 2^p + 1 ~(\text{mod}~p^2)$$ I have tried to write the problem as $$\sum_{j = 0}^p {p \choose j}{p + j \choose j} - 2^p - 1 \equiv 0~(\text{mod}~p^2)$$ Which mean I have to prove that the expression on the left side is divisible by $p^2$, but this doesn't help. I also know that since $p$ is odd prime, we have $2^{\varphi(p^2)} = 2^{p^2 - p} \equiv 1 ~(\text{mod} ~p^2)$ by Euler's theorem. So the expression before can be rewritten as $$\sum_{j = 0}^p {p \choose j}{p + j \choose j} - 2^p - 2^{p^2 - p} \equiv 0~(\text{mod}~p^2)$$ But this also doesn't seem to help. I think I have to modify the sum somehow, but I gut stuck. The sum looks like a hypergeometric function, but knowing this doesn't help either. Anyone? | First we know the fact that $p$ divides $\binom {p}{k}$ for $k\in \{1,\ldots,p-1\}$. Second we have : $\binom {p+k}{k}= \frac{(p+k)\cdots(p+1)}{k!}$ which means : $k!\binom {p+k}{k}=(p+k)\cdots(p+1)$. Notice that every term of the product is divided by $p$ except the last product $k(k-1)\cdots1=k!$ So $p$ divides $k!(\binom {p+k}{k} - 1)$. By Gauss lemma for $k\in \{1,\ldots,p-1\}$, $p$ divides $(\binom {p+k}{k} - 1)$. Then $p^2$ divides $\binom{p}{k}(\binom {p+k}{k} - 1)$. We obtain : $\binom{p}{k}(\binom {p+k}{k} \equiv \binom{p}{k} \pmod{p^2}$. So : $\sum \limits_{k=0}^{p} \binom {p}{k} \binom{p+k}{k}\equiv 1 +\binom{2p}{p} + \sum \limits_{k=1}^{p-1} \binom{p}{k} \equiv 1 +\binom{2p}{p} +2^{p}-2 \pmod{p^2}$ Then I'm stuck... Maybe it is possible to prove that $\binom{2p}{p} \equiv 2\pmod{p^2}$.. Thanks in advance ! |
I need to create an algorithm that extracts one of the largest possible subsets from a list, in which all elements are ordered. This subset can be non-consecutive, but must preserve the order from the original list. For example: Input: Possible Output: [1,2,8,3,6,4,7,9,5] -> [1,2,3,6,7,9] One might rephrase the question as "which elements do I at least have to remove so that the remaining list is sorted". I'm not looking for an implementation, but just for ideas for a simple algorithm. My best approach so far would be to build a tree with nodes for each number, and their children being all larger numbers following in the list. Then the longest path down the tree should equal the sorted subset. However, that seems overly complicated. Context: this is to check student's answers on a test where they have to order items by size. I want to find out for how many they got right, relative to each other. | How can I find the largest increasing (non-contiguous) subset of an array? For example, if A= array(50,1,4,9,2,18,6,3,7,10) the largest increasing non-contiguous subset is either (1,4,6,7,10) or (1,2,6,7,10). I can intuitively see how to find the subset, but I don't know how to design the algorithm. |
Einstein's equation is $$8πT_{ab}=G_{ab}$$ where the left side contains the stress-energy tensor and the right side contains the Einstein tensor. Is there exactly one unique stress-energy tensor corresponding to a given spacetime curvature? Or is it possible for one curvature (i.e. one spacetime metric) to be produced by multiple different mass configurations | Einstein's equation is $$8 \pi T_{ab} = G_{ab},$$ where the left side contains the stress-energy tensor and the right side contains the Einstein tensor. Is there exactly one unique stress-energy tensor corresponding to a given spacetime curvature? Or is it possible for one curvature (i.e. one spacetime metric) to be produced by multiple different mass configurations? |
Especially in the beginning of the first movie, Thor is brash and often petulant. He seeks the glory of king-hood without understanding or accepting the self-sacrifice and responsibility that such a role requires. He is brave, yet selfish. My question is Why was Thor worthy? I would think that some nice, selfless guy should be able to lift Mjolnir, but it is portrayed as some rare trait of extreme virtue that only Thor and perhaps a couple others possess. Because Thor himself doesn't appear to be excessively virtuous, it seems like the power to lift Mjolnir was endowed on him, not earned by him, so why all this pretense about worthiness? | Consistently across the Marvel version of Thor's various incarnations only the 'worthy' may lift Mjolnir, his enchanted hammer. The inscription reads, "Whosoever holds this hammer, be he worthy, shall posses the power of Thor." In the movie, of course, a large part of the story is centered upon Thor becoming worthy. In the comics and crossovers, many people have been able to wield Mjolnir, including Storm, Captain America, Beta-Ray Bill, Conan, a random paramedic (who hands it to an astonished Thor, laying on a stretcher), and Wonder Woman. However, Superman wields it briefly in one crossover, but then can't lift it. Thor says Odin had briefly lifted the enchantment to allow Big Blue to use it. So what determines one's 'worth' to the hammer? I know and all, but that is hardly canon. |
Should one use an apostrophe to indicate that ABC's is plural or is it incorrect? | When I was in high school back in the 1970s, I was taught that to make a plural of an acronym, a letter, or a number, one should add an apostrophe and "s". Like I would have written this sentence, "... back in the 1970's ..." I would write "one CD, two CD's". Etc. I followed this rule faithfully for years until a co-worker told me it was wrong. Now I can't find any source that agrees with what I was taught. Is this a rule that has changed over time? Was the convention in the 70s that one should use an apostrophe but this has changed and now we do not? Or were my high school English teachers just confused? |
I am new to Ubuntu and I have been researching and doing practice but I couldn't figure out exactly the correct command to help me solve my problem. I would be very grateful if someone could help me out here. I want to know how I could use nano command to add the line "dns-servers" to the /etc/network/interfaces. | Sometimes, a graphical text editor like gedit or kate cannot be used (because you're in a virtual console for example). Luckily, there are text editors for the terminal. An easy one is nano, but I cannot understand how to work with it. If I start nano by running nano, the bottom text is supposed to help me but all I see are things like ^G Get Help ^O WriteOut. How can I open text files for editing? How can I save the file? How can I quit the editor without saving the changes? How to edit? I heard that you've to enter some commands to begin editing in vi, is this true for nano too? Sometimes, if I manage to open a file, the text is unreadable due to its colors. How can I disable these colors? (see the image below) In the some files, lines are truncated because those do not fit in the screen. How can I prevent that from happening? (see the image below) |
If I have $f: \mathbb{R}^{n \times m} \times \mathbb{R}^{n} \to \mathbb{R}^{m}$ And $f(K,t) = Kt + h$ where $h \in \mathbb{R}$ How would I find $\frac{\partial f}{\partial K}$ and $\frac{\partial f}{\partial t}$? | It's stated that the gradient of: $$\frac{1}{2}x^TAx - b^Tx +c$$ is $$\frac{1}{2}A^Tx + \frac{1}{2}Ax - b$$ How do you grind out this equation? Or specifically, how do you get from $x^TAx$ to $A^Tx + Ax$? |
Have a bag of potatoes about maybe 3 weeks old. Still firmish, not green but with little small sprouts (maybe barely 1 cm) VERY small. Are these ok to eat? I trimmed off the sprouts and the inside looked fine, and they are not green. Slightly softer but still firm. | I'm talking about potatoes that have gone somewhat soft and put out shoots about 10cm long. Other online discussions suggest it's reasonably safe and the majority of us have been peeling and eating soft sprouty spuds for years. Is this correct? |
I am writing a command which is given below. if ["$avg" -ge "80"]; then echo "PASS" else echo "FAIL" I am getting an error like: x.0000000000000000 integer expression expected and the result of if -else statement is always wrong. Pls help and suggest necessary changes. | Let's say I have a coordinate (x,y), I want to make two categories: good or bad. I have no idea how to put it into words or keywords, so I created an example of what I want. I have created a bash script like this: x=3.5 #(example) y=-2.5 #(example) if [ $x -ge 0.1 -a $x -le 5.5 ] && [ $y -ge -5.9 -a $y -le -0.1 ]; then cat="good"; elif [ $x -ge 5.5 -a $x -le 10.5 ] && [ $y -ge -10.9 -a $y -le -5.9 ]; then cat="bad"; fi echo "$cat" On that script I want to know if x is within range 0.1 till 5.5 (0.1 < x < 5.5) and y within -5.9 till -0.1 (-5.9 < y < -0.1) are true then it gives result as good. With different boundaries it should give a bad result. I've run it and it gives the result as integer expression expected. When I try to replace the operator -ge (or -le) with operator > (or <), or try to add a square bracket and anything I could think of, it gives the same error or no results are given. How should I approach this? |
I made this template class: //Elenco.h #pragma once #include "Tipi.h" #include <vector> template <typename T> class Elenco { public: //constructor Elenco() : Elenco::Elenco(std::vector<T> {}) { } Elenco(const std::vector<T>& _list) : list{ _list } { sort(); } //setter T add(const T&); //viewer const std::vector<T>& view() const; private: std::vector<T> list; void sort(); }; //Elenco.cpp #include "Elenco.h" #include <algorithm> #include <iostream> //setter template<typename T> T Elenco<T>::add(const T& item) { list.push_back(item); sort(); } //viewer template<typename T> const std::vector<T>& Elenco<T>::view() const { return list; } //private template<typename T> void Elenco<T>::sort() { for (unsigned short n = 0; n < list.size(); n++) for (unsigned short m = 0; m < n; m++) { std::cout << list[m] << "-" << list[n] << ": " << bool(list[m] > list[n]) << std::endl; if (list[m] < list[n]) std::swap(list[m], list[n]); } } //main.cpp #include "Elenco.h" #include <iostream> int main() { using namespace std; vector<Player> elenco{ {"carlo", 11}, {"mario", 3}, {"franco", 5}, {"paolo", 1}, {} }; Elenco<Player> a{ elenco }; //<---- same if I use an int or any other type for (auto it : a.view()) cout << it << endl; //<---- operators<< and < have been overloaded in Player.h return system("pause"); } The problem is that when I try to create an object I get these errors: unresolved external symbol "public: class std::vector > const & __thiscall Elenco::view(void)const " (?view@?$Elenco@VGiocatore@@@@QBEABV?$vector@VGiocatore@@V?$allocator@VGiocatore@@@std@@@std@@XZ) referenced in function _main unresolved external symbol "private: void __thiscall Elenco::sort(void)" (?sort@?$Elenco@VGiocatore@@@@AAEXXZ) referenced in function "public: __thiscall Elenco::Elenco(class std::vector > const &)" (??0?$Elenco@VGiocatore@@@@QAE@ABV?$vector@VGiocatore@@V?$allocator@VGiocatore@@@std@@@std@@@Z) 2 unresolved externals I found in another post that you can fix this by including Elenco.cpp in my main.cpp file, or by including it at bottom of Elenco.h excluding the file from the project. Both solutions work, but they doesn't seem great because I lose the main purpose of an header: allowing to modify my definition without re-compiling my projects... So I could I fix that? And (above all) why do I get there errors? | Quote from : The only portable way of using templates at the moment is to implement them in header files by using inline functions. Why is this? (Clarification: header files are not the only portable solution. But they are the most convenient portable solution.) |
Podcasting seems to be exploding these days but I was wondering if anyone has come across a podcast or podcasts explores the stuff that is happening out there in the geospatial world? I have found one that a really like "" but I would love to hear if anyone out there that has any other recommendations. | I would like to make a list of podcasts related to geospatial technologies. Do you listen to any that you find interesting and informative? |
After researching into how spell effects stack, I find some ambiguity regarding certain spells that have multiple possible effects. Notably, contains updated information from the : Combining Game Effects (p. 252). This is a new subsection at the end of the “Combat” section: Different game features can affect a target at the same time. But when two or more game features have the same name, only the effects of one of them—the most potent one—apply while the durations of the effects overlap. For example, if a target is ignited by a fire elemental’s Fire Form trait, the ongoing fire damage doesn’t increase if the burning target is subjected to that trait again. Game features include spells, class features, feats, racial traits, monster abilities, and magic items. See the related rule in the ‘Combining Magical Effects’ section of chapter 10 in the Player’s Handbook. There are, however, no references in deciding how to determine what "the most potent one" may be when not using raw numbers (such as with paladin auras). This is also applicable to spells like , which inflicts a "natural disease" (and you can be afflicted by multiple natural diseases). If both effects of cannot influence a character at the same time, how do you determine which one takes effect (assuming both casts are at the same spell level)? | The Player's Handbook states that when cast as a 3rd level or higher spell, Blindness/Deafness can target additional targets equal to the difference between the spell slot the spell is cast at and its base spell slot level of 2. My question is, would it be legal to cast Blindness/Deafness as a 3rd level spell, but instead of having either effect (blindness OR deafness) target two creatures, have it target one creature with both effects (blindness AND deafness.) I'm having a hard time deciding whether this would provide an overpowered effect, as it increases the amount of disabilities one creature will suffer from, but lessens the number of creatures affected by the spell. Perhaps it could be legal provided the targeted creature gets to make a separate CON save against each effect? |
I'm looking for a rigorous introduction to probability to help prepare me for a future course I plan on taking, "Advanced Introduction to Probability". Something possibly like Spivak's, where proofs are key. Any help is appreciated. | what are some good books on probabilities and measure theory? I already know basic probabalities, but I'm interested in sigma-algrebas, filtrations, stopping times etc, with possibly examples of "real life" situations where they would be used thanks |
I want to make a tree with some branches out of a curve like this simple one (I've created this with the ALT+C, convert to curve: When I set the depth to a non zero value and set the Fill settings to full, it looks like a tree with branches. But when I change the radius on the joined point, only half of the "tree" is getting bigger/smaller. When I look inside, the problem is obvious: There are essentially two separate pieces stuck together: What can I do to get a nicely connected mesh I can work/modify on? Is there something I do fundamentally wrong? Is it bad practice to stuck connected parts of a mesh together? | I want to extrude a curve in two directions. Or join both curves into one, is it possible? I've tried copying it and then join segments, but I don't see Remove Doubles option while working with curves. |
Assume n people who are initially assigned seats from 1 t0 n but they don't know their seat number, now they randomly pick up a seat on their own and what would be the probability that no one is seating to its assigned seat? | I am trying to figure out how many permutations exist in a set where none of the numbers equal their own position in the set; for example, $3,1,5,2,4$ is an acceptable permutation where $3,1,2,4,5$ is not because 5 is in position 5. I know that the number of total permutations is $n!$. Is there a formula for how many are acceptable given the case that no position holds its own number? |
I have a csv file with list of client details. I am pulling out a particular column from that file with this code: import csv details = [] with open("userlist.csv", "r", encoding="utf8") as csv_file: csv_reader = csv.reader(csv_file, delimiter=',') for lines in csv_reader: description.append(lines[27]) print (details) I am getting this output in a list for multiple rows:'[Description]sentence1[Issue Details] *** Bunch of other data """timestamp":12:42PM,emailaddress:[email protected]', '[Description]aaa[Issue Details] *** Bunch of other data """timestamp":10:12AM,emailaddress:[email protected]' Now I want to extract the emailID of the user. So how should I do that? | Over the years I have slowly developed a that validates MOST email addresses correctly, assuming they don't use an IP address as the server part. I use it in several PHP programs, and it works most of the time. However, from time to time I get contacted by someone that is having trouble with a site that uses it, and I end up having to make some adjustment (most recently I realized that I wasn't allowing 4-character TLDs). What is the best regular expression you have or have seen for validating emails? I've seen several solutions that use functions that use several shorter expressions, but I'd rather have one long complex expression in a simple function instead of several short expression in a more complex function. |
I have a pretty simple setup: button: toggles “toggled” class on the nav li is simplified holder for submenu: it should change aria attribute on click, but only when the nav has .toggled class on it But for some reason this line doesn't work: $('.toggled .has-children').on('click', function(e){ Is it because the class is added dynamically to the parent? How would I overcome this? $(function() { var container = $('.nav'); var button = $('.menu'); //add remove class to nav button.on('click', function () { if(container.hasClass('toggled')) { container.removeClass('toggled'); } else { container.addClass('toggled'); } }); // doesn't work? $('.toggled .has-children').on('click', function(e){ e.preventDefault(); $(this).attr('aria-expanded', 'true'); }) }); .toggled { color: blue; } .has-children[aria-expanded=true] { color: red; } <script src="https://ajax.googleapis.com/ajax/libs/jquery/2.1.1/jquery.min.js"></script> <nav class="nav"> <button class="menu">Menu</button> <ul> <li class="has-children" aria-expanded="false"> Has children </li> </ul> </nav> | I have a bit of code where I am looping through all the select boxes on a page and binding a .hover event to them to do a bit of twiddling with their width on mouse on/off. This happens on page ready and works just fine. The problem I have is that any select boxes I add via Ajax or DOM after the initial loop won't have the event bound. I have found this plugin (), but before I add another 5k to my pages with a plugin, I want to see if anyone knows a way to do this, either with jQuery directly or by another option. |
I have been trying to understand the difference between different references but the theory does not provoke any ideas for me to visualize the same. Could anyone please explain in brief the different references? An example for each would do better. | What's the difference between and ? |
I have two events in a class public event AcquiredDataEvent OnNewAcquiredData; public delegate void AcquiredDataEvent(int[] newData); public ScanStartedEvent ScanStarted; public delegate void ScanStartedEvent(); I just realized that ScanStarted does not have the keyword event before it. Most likely the result of a typo by me, though it still works as expected. What is the difference between the two events if any? | What are the differences between delegates and an events? Don't both hold references to functions that can be executed? |
I'm looking for a word that would fit this description, or something close to it: To harm or disrupt another person despite the fact that your actions also harm or disrupt yourself. | When you are so mad at someone that you make a bad decision, even though you will be harmed by it as well, in order to harm that person; is there a good term for this? For example burning $100 because he owns $20 of it. |
I am trying to uninstall every single package I installed and I'm almost sure that it is possible with one command, but I don't know it. What can you suggest, please? | I installed a plain Ubuntu 10.10 on my computer and installed some software via apt-get. Last week I managed to break everything and just started from scratch, and I need to reinstall my software. Is there some way to create a list with all the packages that I have installed manually? So that it would give me a list like texlive, ... and not texlive, texlive-dep1, textlive-dep2, ... and all the standard packages removed? If I could somehow figure out which programs out of the regular install I have removed, that would be awesome too! Update 2015-05-23: I now use Ansible as configuration management on my systems. There I specify the packages to install. This serves the goal, installing all the programs on a fresh system, even better. So this question might be the entry into some light configuration management. |
Formally, one can arrange the quark flavors in a $SU(n)$ fundamental representation. One can then do tensor products for flavor and spin to construct other representations like baryons and mesons. An example: $2⊗2=3⊕1$ for spin $SU(2)$ gives scalar and vector mesons, $3⊗\overline3=8⊕1$ for flavor $SU(3)$ gives the eightfold way for both scalar and vector mesons. My question is easy: how do you get $3⊗\overline3=8⊕1$? Or for baryons: $3⊗3⊗3=10⊕8⊕8⊕1$? | I am dealing with the tensor product representation of $SU(3)$ and I have some problems in understanding some decomposition. 1) Let's find the irreducible representation of $3\otimes\bar{3}$ we have that this representation trasforms like $${T^\prime}^i_j=U^i_k {U^{\dagger}}^l_j T^k_l $$ hence I observe that $$Tr(T)=\delta^j_iT^i_j$$ is an invariant and so $$T^i_j=\left(T^i_j-\frac{1}{3}\delta^j_iT^i_j\right)+\frac{1}{3}\delta^j_iT^i_j$$ allows me to write $$3\otimes\bar{3}=8\oplus1$$ Here comes my questions: I have heard that this $8$ representation is an "$8_{MA}$" where MA is for "mixed-antisymmetric". The meaning of "mixed-antisymmetric" shold be: "the tensor $\left(T^i_j-\frac{1}{3}\delta^j_iT^i_j\right)$ should be antisymmetric for an exchange of 2 particular indexes but not for a general exchange of 3 indexes". What does this mean? I see only 2 index in that tensor. 2) Consider this representation: $$3\otimes3\otimes3=3\otimes(6\oplus\bar{3})=3\otimes6_S\oplus3\otimes\bar{3}=3\otimes 6_S\oplus8_{MA}\oplus1$$ and now on my notes I have $$3\otimes6_S=10_S\oplus8_{MS}$$ Where "MS" is for "mixed symmetric": symmetric for an exchange of 2 particular indexes but not for a general exchange of 3 indexes. I could not demonstrate this last decomposition using tensor method. I started noticeing that: $$3\otimes6_S=q^iS^{k,l}$$ where $S^{k,l}$ is a symmetric tensor But then I am not able to proceed in demonstrating the above decomposition (note: I would like to demonstrate this decomposition using only tensor properties, not Young tableaux). I tried to look on Georgi, Hamermesh, Zee and somewhere online but I have not found any good reference which explains well this representatin decomposition... EDIT: the demonstration should not include the use of Young diagrams...my professor started the demonstration by writing $\epsilon_{\rho,i,k}q^i S^{k,l}=T'^l_\rho=8_{MS}$ and then stopped the demonstration. |
I had installed Lubuntu in my old computer. It's so old that I think I should not use any desktop environment. Is there any way to boot without Any desktop environment? I had only Lubuntu on my computer thus I didn't install grub or boot loader. I don't want to remove the desktop environment for testing reasons or start single application as posted . I want to boot into my Lubuntu normally, just without any desktop environment (e.g: LXDE), I want it like Ubuntu server. | Is it possible to disable X at boot time? I'm setting up a server so it would be nice if it wouldn't load the graphical interface every time I boot. |
convert subtitle MKS to SRT in terminal ? How to ? because I can not edit my mks subtitle in ubuntu software that I use. just suport srt only | The problem is that videoplayers in Ubuntu have a problem with integrated central european subtitles.The solution is to extract them. Does anyone knows if there is a command in the terminal or a program to extract the subtitle from a mkv file? |
I just want to generate 6 digit random number, and the range should be start from 000000 to 999999. new Random().nextInt(999999) is returning me number but it is not in 6 digit. | How do I generate a random int value in a specific range? I have tried the following, but those do not work: Attempt 1: randomNum = minimum + (int)(Math.random() * maximum); Bug: randomNum can be bigger than maximum. Attempt 2: Random rn = new Random(); int n = maximum - minimum + 1; int i = rn.nextInt() % n; randomNum = minimum + i; Bug: randomNum can be smaller than minimum. |
In the movie Donnie Darko, where does the jet engine in the beginning of the movie come from originally? | In the film Donnie Darko, a jet engine lands on Donnie's room in the beginning of the movie. I thought that it was the engine of the plane in which his mother and sister were travelling, which gets crashed and was sent from the future by Donnie through the portal as an act of self sacrifice to save others. If this was the case, he had successfully altered the future and the crash should not have happened in the future. If the crash itself had not taken place, how did he send the engine? Or did he transfer that object from tangent universe to the primary universe (I think this is highly unlikely). |
I am not able to sudo apt-get update after trying to get lynis. Is there a way to undo this? (error 10) W: GPG error: https://packages.cisofy.com/community/lynis/deb stable InRelease: The following signatures couldn't be verified because the public key is not available: NO_PUBKEY 3F873450D48C4F9C E: The repository 'https://packages.cisofy.com/community/lynis/deb stable InRelease' is not signed. N: Updating from such a repository can't be done securely, and is therefore disabled by default. N: See apt-secure(8) manpage for repository creation and user configuration details. | I added some extra repositories with the Software Sources program. But when I reload the package database, I get an error like the following: W: GPG error: trusty InRelease: The following signatures couldn't be verified because the public key is not available: NO_PUBKEY 8BAF9A6F I know I can fix it using apt-key in a terminal, according to the official Ubuntu documentation. But I would have liked to do it graphically. Is there a way to do this without using a terminal? |
How can I manually install gcc tarball file in Ubuntu 12.04? | I have downloaded tar.gz files. But I don't know how to install it. How do I install this kind of file? |
I want to calculate burden resistor for a 1000:5 current transformer. I want to output 5V variation. How do I calculate this burden resistor? I using burden resister 220orm .this is out put .input primary 20A and out vmax 43.2 and freq 50. | I have 1:50 wound current transformer and I don't have the datasheet. Could anybody help me to calculate the burden resistor? Maximum current to be measured: 2A Max output voltage to ADC: 5V |
The question is to evaluate $S=\sum_{k=0}^{n} \frac{(-1)^k}{k+1} {n \choose k}$ $\textbf{My Attempt:}$ I have considered the generating function $$ f(x)=\sum_{k=0}^{n} {n\choose k} x^k = (x+1)^n$$Integrated and divided by $x$, $$\frac{1}{x} \int f(x) = \int \frac{{n \choose k}}{k+1} x^k = \left( \frac{1}{x} \right) \frac{(x+1)^{n+1}}{n+1}$$ Finally I considered the value for $x=-1$ which turns out to be $$\frac{1}{-1} \int f(-1) = \left( \frac{1}{-1} \right) \frac{(-1+1)^{n+1}}{n+1}=0$$ Which is wrong. I cannot spot my error | Other than the general inductive method,how could we show that $$\sum_{r=0}^n \frac{(-1)^r}{r+1}\binom{n}{r} = \frac1{n+1}$$ Apart from induction, I tried with to check the validity, but I can't think of an easy (manual) alternative. Please suggest an intuitive/easy method. |
I had applied for a visa for PLAB 2, which got refused based on the grounds that I wasn't employed for one year after my graduation and was unemployed. The fact was I was doing my internship which finished in August (I applied for my visa in December). I was not having my internship certificate at that time which I have now. So they were not satisfied that I will return back. I have my internship certificate now, showing that I have been working as an intern for the past year, though I am unemployed now (as we require internship certificate for applying for jobs in UAE and for getting registration, basically for everything). I also will take the residency entrance examination for UAE but the applications for this only open in April and I intend to apply for that too when the dates are announced but meanwhile want to clear my PLAB 2 examination. Can anyone guide me on now how to progress further so that my visa application doesn't get rejected? | I am a medical doctor in Pakistan. I have been on a career break to allow myself to study full time for the IELTS exam (from which I recently got the required band score) and PLAB 1. I have now registered and paid for the PLAB 1 exam in UK for June 2016, as the next sitting in Pakistan is in November 2016 and I feel like I am ready to do the exam sooner. Due to having no current employment, my savings are limited (around 25,000 Pakistani Rupees) but I live with my parents and do not have any financial commitments at home. My savings have depleted in the past ten months whilst I have taken a career break and the money has been used for my own personal expenses. My trip to the UK is being funded by my grandfather who is a British citizen. He is a retired doctor with a good NHS pension. He has provided me with: 6 months bank statements which clearly show his pension deposits Letter from NHS Pensions stating his pension Sponsorship letter stating that he will pay for my PLAB exam fee, travel, accommodation and subsistinence costs whilst in the UK Copy of British passport Document confirming that he owns the house he lives in mortgage-free Confirmation email from GMC stating he has paid the PLAB exam fee. Without large personal savings and no current job (but I have job offers now) would my application be rejected or is the strong sponsorship going to be good enough? Are there any other documents I should consider submitting that may help me get a visa? |
We have automated build bash script where at the beginning executed command apt-get update; apt-get upgrade -q -y -u --allow-downgrades --allow-remove-essential --allow-change-held-packages --allow-change-held-packages --allow-unauthenticated; but it keeps asking this question with popup in terminal A new version (/tmp/grub.xC3mMKP0zx) of configuration file /etc/default/grub is available, but the version installed currently has been locally modified. which is reason that automated script execution is hanging and i can't force skip it somehow with --allow* or -y options our ubuntu is 16.04 how i kan avoid that popup appearce ? Please help, Thanks -- UPDATE -- I have tried many solutions also this one: which was mentioned as duplicate to this question apt-get -o DPkg::Options::=--force-confdef upgrade -q -y -u --force-yes it still the same promt popup asking for choose default option | I am installing packages on remote server, using ssh: ssh root@my-host "DEBIAN_FRONTEND=noninteractive DEBCONF_NONINTERACTIVE_SEEN=true apt-get --quiet --yes install w3m" even though I have set DEBIAN_FRONTEND=noninteractive, the installation gets stuck on following question, and I have to press enter manually: Configuration file '/etc/w3m/config' ==> File on system created by you or by a script. ==> File also in package provided by package maintainer. What would you like to do about it ? Your options are: Y or I : install the package maintainer's version N or O : keep your currently-installed version D : show the differences between the versions Z : start a shell to examine the situation The default action is to keep your current version. *** config (Y/I/N/O/D/Z) [default=N] ? I suspect, the question is being asked by dpkg --configure -a and not by apt-get and therefore noninteractive is ignored. How can I automate this and have default option selected automatically, without being asked ? |
Method parameter sd & ed is LocalDate, I need return date object, but sd & ed return null. My define a private method: private void setQuarter(LocalDate sd,LocalDate ed,LocalDate today){ switch (getQuarter(today.getMonthValue())){ case 1: sd=LocalDate.of(today.getYear(),1,1); ed=LocalDate.of(today.getYear(),3,31); break; case 2: sd=LocalDate.of(today.getYear(),4,1); ed=LocalDate.of(today.getYear(),6,30); break; case 3: sd=LocalDate.of(today.getYear(),7,1); ed=LocalDate.of(today.getYear(),9,30); break; case 4: sd=LocalDate.of(today.getYear(),10,1); ed=LocalDate.of(today.getYear(),12,31); break; default: sd=LocalDate.of(today.getYear()+1,1,1); ed=LocalDate.of(today.getYear()+1,1,1); } } Invoke this method: LocalDate sd=null; LocalDate ed=null; setQuarter(sd,ed,today); log.info("==> sd:{},ed:{}",sd,ed); Output message: ==> sd:null,ed:null | I always thought Java uses pass-by-reference. However, I've seen a couple of blog posts (for example, ) that claim that it isn't (the blog post says that Java uses pass-by-value). I don't think I understand the distinction they're making. What is the explanation? |
I want to animate a camera from a ortho view to a perspective view. Is this possible and if so, how. Seems you can only have one or the other but not both. | I want to animate between perspective and orthographic camera views. How can this be done? I found where people talk about successfully animating between orthographic and perspective camera views in Unity with code, so fundamentally this must be possible. But I don't know Python, so I wouldn't be able to figure it out manually with code in Blender. |
I am a high school student interested in studying mathematics at university. I've been doing some independent study and have found the Gaussian Integers $\mathbb{Z}[i]$ particularly interesting. I was thinking about primes in $\mathbb{Z}[i]$, and came across the following results: First, considering which primes $p$ in $\mathbb{Z}$ remain prime prime in $\mathbb{Z}[i]$, I think the following is true: If $p \equiv 3 \bmod{4}$, then it remains prime in $\mathbb{Z}[i]$. If $p \equiv 1 \bmod{4}$, then $p$ is not prime in $\mathbb{Z}[i]$. This is because $p$ can be written as a sum of two squares: $p = a^2 +b^2$, and so factorizes in $\mathbb{Z}[i]$ as: $p = (a+ib)(a-ib)$, where neither $a+ib$ nor $a-ib$ are units (the latter is true because $p \neq 1$). However, I realized that this is not the end of the story, as there could be primes in $\mathbb{Z}[i]$ of the form $a +ib$, where neither a nor b equals zero. In this case, the only result I could find was that if $a^2 + b^2$ is prime (e.g. in the case of $1+i$) then $a+ib$ is prime in $Z[i]$. But this does not determine all the primes in $\mathbb{Z}[i]$. My question is: Is there a known necessary and sufficient criterion for a Gaussian Integer $a+ib$ to be prime in $\mathbb{Z}[i]$? If not, are there any additional primality tests known in $\mathbb{Z}[i]$? Any help and guidance would be greatly appreciated. | I am trying to prove the following: Let $R=\mathbb{Z}[i]$, $a, b \in \mathbb{Z}, ab \neq 0$. Show that $a+bi$ is an irreducible element in $R$ if and only if $a^2 + b^2 ∈ \mathbb{Z}$ is prime. Since $R$ is a Euclidean domain, irreducible elements are prime. I think this is relevant, but am stuck on where to go from here. |
I'm making a vocabulary practice program using arrays (I know, not Lists, but I need array practice). However, everything goes well until the program evaluates if the typed answer (when the program quizzes the user) is the actual definition. I always get the answer wrong, and I don't know why. Here's the whole program: import java.util.Scanner; public class organ { public Scanner input = new Scanner(System.in); public String language; public int temp; public static void main(String[] args){ organ organObject = new organ(); organObject.greeting(); organObject.ending(); } public void greeting(){ System.out.println("Hello! Do you want to practice vocabulary in English or Spanish?"); //Need to fix this grammar. System.out.println("!Hola! ?Quieres practicar el vocabulario en ingles o espanol?"); language = input.nextLine(); checkLanguage(language); } public void checkLanguage(String answer){ if (language.equals("English") || language.equals("ingles")){ englishTree(); } else{ spanishTree(); } } public void englishTree(){ System.out.println("How many words do you want to practice using?"); int temp = input.nextInt(); String[] wordStorage = new String[temp]; String[] meaningStorage = new String[temp]; String answer; for(int counter = 0; counter < wordStorage.length; counter++){ System.out.println("What is word number " + (1 + counter) + "?"); wordStorage[counter] = input.next(); System.out.println("What is def number " + (1 + counter) + "?"); meaningStorage[counter] = input.next(); } if (wordStorage.length > 10) { System.out.println("Stop. Now."); } System.out.println("Alright, let's get to the good stuff."); for(int counter = 0; counter < wordStorage.length; counter++){ System.out.println("What is the meaning of " + wordStorage[counter] + "?"); answer = input.next(); if (answer == meaningStorage[counter]){ System.out.println("Correct!"); } if (answer != meaningStorage[counter]){ System.out.println("Wrong. The answer is " + meaningStorage[counter] + "."); } } } public void spanishTree(){ System.out.println("Espere."); } public void ending(){ System.out.println("This is the ending of the program for now. Bye!"); } } The problem is under "Alright, let's get to the good stuff." | I've been using the == operator in my program to compare all my strings so far. However, I ran into a bug, changed one of them into .equals() instead, and it fixed the bug. Is == bad? When should it and should it not be used? What's the difference? |
I am preparing myself for ISTQB exam and I came across this question. For the code fragment given below, which answer correctly represents minimum tests required for statement and branch coverage respectively? Discount rate=1; Fare = 1000; If ((person == “senior citizen”) and (“travel month = January”)) Bonuspoints = 100+Bonuspoints If (class==”first”) discountRate = .5; Fare = fare * discountRate; a. Statement Coverage = 1, Branch Coverage = 2 b. Statement Coverage = 2, Branch Coverage = 2 c. Statement Coverage = 1, Branch Coverage = 3 d. Statement Coverage = 2, Branch Coverage = 4 Answer is A But my answer is C the reason is flowchart I draw for it given below. Straight forward from start to end One false for 1st 'if' second false for 2nd 'if' My question is: Should we draw an edge 'explicitly' for 'false' condition, if it is not given in question itself. How branch coverage is 3 here ? | I am preparing for a testing certification. These types of questions are asked frequently. Example 1: Read P Read Q IF P+Q > 100 THEN Print “Large” ENDIF If P > 50 THEN Print “P Large” ENDIF Example 2: READ X READ Y I F X>Y THEN Z = 0 ENDIF Example 3: 1 READ X 2 READ Y 3 Z =X + 2*Y 4 IF Z> 50 THEN 5 PRINT large Z 6 ENDIF What are Nodes and Edges in the flowchart? Statement Coverage: 1A-2C-3D-E-4G-5H = 1 Branch Coverage: 1A-2C-3D-E-4G-5H , 1A-2B-E-4F = 2 Path Coverage: 4 1A-2B-E-4F 1A-2B-E-4G-5H 1A-2C-3D-E-4G-5H 1A-2C-3D-E-4F Please explain , how the answers came by? In these example, how do we identify that which is a statement, branch and condition? How do we measure coverage? Please give detailed explanations of ALL 3 examples. |
Scenario: I have and a with 9 spore counters. My opponent attacks with a 10/10 and I block with my Thallid (also 10/10). I want to block and kill his 10/10, and then create 3 saprolings before Thallid hits the graveyard. My assumption is that during I assign 10 points of damage to my opponents creature, as his creature assigns 10 to my Thallid. Then during the I can activate it's ability to create saprolings because damage was already assigned. Am I correct? | Rules Question: Player A attack with 1/2 creature Player B block with with 1 +1/+1 counter And now can player B use Walking Ballista activation ability, after combat damage but before it go to graveyard, to kill 1/2 creature? |
I am trying to find raw benchmark numbers between any fairly modern desktop processor and the Raspberry Pi 4gb/8gb, but I am struggling to do so. I understand that there are architectural differences meaning that some benchmarks can not be run on both an x86 instruction set and an Arm based instruction set. What I hope to determine from the raw performance numbers is if the Pi 4 is powerful enough to replace a dual/quad core desktop CPU based VPS with a similar amount of RAM. | From my personal experience with my tablet, and from the benchmarks and articles I've read, it always seems ARM processors, as seen in virtually all mobile devices, deliver incredible performance for the amount of power they consume. It really seems like ARM is inherently more power-efficient than x86. To me, it looks like that this is because x86 is a while ARM is a . However, Intel Atom processors deliver very good performance relative to their power consumption as well. In addition, having studied computer architecture, it is my understanding that in modern processors, the complex x86 is internally translated into simpler that use an internal instruction set that is closer to the simpler ARM or MIPS ISAs than x86 proper. As such, the ISA as presented to the programmer is little more than an interface to issue commands to the processor, rather than a representation of the actual low-level operations the chip performs. Then again, implementing this translation layer requires additional silicon space on the chip... That said, assuming that they are implemented using the same semiconductor process, is ARM inherently more efficient than x86? With a properly designed , is it possible for an x86 processor to deliver the same performance per watt as an ARM processor? Remember, I'm looking for a well-written technical answer in the spirit of Stack Exchange and not mere speculation. |
Questions like this have been asked before, but I just want some quick clarification on something. Suppose that $G$ is the sum of its Sylow $p$-subgroups. Then each Sylow subgroup must be normal, and of course we have the other direction. If each Sylow subgroup is normal, then $G$ is the product of its Sylow subgroups. My question that I need clarified is, "if $G$ is a sum of its Sylow subgroups, when will this be abelian, non-abelian?" | Proposition II.7.5 of Hungerford's Algebra goes Proposition 7.5. A finite group is nilpotent if and only if it is the direct product of its Sylow subgroups. Let $G = (\mathbb{Z}_6, +)$. $G$ is abelian, so it is nilpotent and thus by the proposition is the direct product of its Sylow subgroups. The Sylow subgroups of $G$ are $H = (\mathbb{Z}_3, +)$ and $K = (\mathbb{Z}_2, +)$, so the proposition says $G = H \times K$. In particular, $0 \in H$ and $0 \in K$, so $(0,0) \in H \times K = G$... but that's not true, since $G = \{0,1,2,3,4,5\}$. Where is/are my misunderstanding(s)? |
If you back up your transaction log every hour through a maintenance plan, why does your log file continue to grow? I would think the system would delete or shrink the log after the backup. Is this something I want to do? | This one seems to be a common question in most forums and all over the web, it is asked here in many formats that typically sound like this: In SQL Server - What are some reasons the transaction log grows so large? Why is my log file so big? What are some ways to prevent this problem from occurring? What do I do when I get myself on track with the underlying cause and want to put my transaction log file to a healthy size? |
My wife and I bought our current house about a year ago. We love it. The location is great with many new projects coming to the area, including a train station, a shopping plaza and a marina by the Potomac River. I am a dentist. This year I bought a practice in downtown Washington DC. This is considered my small business investment. It's a good 45 minutes to 1 hour commute each way. I am pretty energetic but I wake up very early and I am feeling the burnout. In a few years we might move closer to my office and it will be closer to where my older son will go to college if he goes locally. I have an FHA ARM on my house that's 3.2%. I paid around 5% down and the current principal is around $540K. I pay around $3400, including interest, PMI, etc. My house value went up to around $600K but it can rent for only $3,000 to $3,200 a month. I am not worried about finding tenants. I am more concerned about a negative cash flow. I know how to run a dental practice but not real estate. It's likely that I will hire management company until I learn more about this type of investment. I hope to be working in my practice for the next 20 years. By then, hopefully this house is paid off and I can realize a good passive income. Do you think that I should rent or sell my current house? | I have recently purchased a home which will presumably be my long-term residence. I have not yet sold my original home, and I am trying to decide whether I should rent it out, or sell it. The 1st home has a mortgage remaining of $175,000, with a 5/5 ARM at 2.5% The next adjustment is in 4 years, and the maximum it could go up to is 4.5% This home was purchased 10 years ago for $203,000 - just before the real estate bubble burst. The home I just purchased has a 1st mortgage of $608,000 @ 4.25% for 30 years fixed. It also has a second mortgage of $76,000 @ 5.5% for 15 years. I think I can rent out the 1st house for $1500, and after property management fees, take home about $435 per month. That is not including any additional taxes on that income, or deductions based on repair work, etc. I think I could sell the first house for about $227,000 which after fees and loan payoff nets me $35000 If I sold the house, I could use my existing cash reserve and the net proceeds to pay off the 2nd mortgage. I could also pay off some, or none of the 2nd mortgage, and try to beat that 5.5% by investing the $35000 If I do not sell the house, I could use the $434 to almost pay off the 2nd mortgage per month/invest the $434 into an IRA or something, and try to beat the 5.5% over time. According to this website, the S&P500 has gained 6.6% over the last 10 years, or 10.3% since 1970. At 6.6%, over 7 years, I would have $46,000 dollars in the account, which would be enough to make up the $35000 sale proceeds, and additionally cover any upcoming repairs to that house. Should I sell the house now, or hold onto it and rent it out? |
I have been using Ubuntu for about a year now. And the main reason that's pulling me back to windows is the bad battery life (about 60% lesser "100% to 20%" time for the battery to discharge). I've come to the conclusion that this is because of GENERIC DRIVERS by ubuntu for a general-purpose OS and Windows doesn't have that because the manufacturers find the right drivers. My question is how can I find the OPTIMAL DRIVERS for my system? Also, if my assumption is wrong about drivers causing the bad battery life, could you please give a better explanation. My specs: 2TB HDD 8GB RAM Intel i5-8250 Nvidia MX150 | Is there a package of Ubuntu drivers as driver pack solution? I tried to search for it, but I did not find it. If there is, how can I easily get it? |
I was wondering how was the formula for Doppler effect in light i.e. $f=\sqrt{\frac{(1-v/c)}{(1+v/c)}}f$ was derived. I understood how it is derived for sound but I am unable to understand how it is derived for light . I read a few books but they were difficult for me to comprehend.A little hint of derivation would also do. | This is about a step in a derivation of the expression for the relativistic Doppler effect. Consider a source receding from an observer at a velocity $v$ along the line joining the two. Light is emitted at frequency $f_s$ and wavelength $\lambda_s$. The frequency $f_0$ and wavelength $\lambda_0$ received by the observer will be different. Some textbooks now argue that the wavelength received by the observer is given by $\lambda_0=(c+u)T_0$, where $T_0$ is the time period of the wave in the observers frame. The argument given is that the successive "crests" will be an extra distance $uT_0$ apart due to movement of the source. Upon relativistically transforming the time period in the source frame to the observer frame, the correct result $f_0=f_s\sqrt{\frac{c-u}{c+u}}$ is obtained. But the argument for the wavelength seems reminiscent of the classical Doppler effect for sound. Is it really applicable here through this argument? And is there a way to show the same result for $\lambda_0$ mathematically? |
When I list /proc/<PID>, works as expected. But when I use ps or ls /proc | grep <PID>, the process is hidden. How & Why is this possible? [user@host ~]$ ls /proc/12263 attr cpuset limits net projid_map statm autogroup cwd loginuid ns root status auxv environ map_files numa_maps sched syscall cgroup exe maps oom_adj sessionid task clear_refs fd mem oom_score setgroups timers cmdline fdinfo mountinfo oom_score_adj smaps uid_map comm gid_map mounts pagemap stack wchan coredump_filter io mountstats personality stat [user@host ~]$ ls /proc | grep 122 12230 12231 12260 12297 [user@host ~]$ ls /proc/12263 attr cpuset limits net projid_map statm autogroup cwd loginuid ns root status auxv environ map_files numa_maps sched syscall cgroup exe maps oom_adj sessionid task clear_refs fd mem oom_score setgroups timers cmdline fdinfo mountinfo oom_score_adj smaps uid_map comm gid_map mounts pagemap stack wchan coredump_filter io mountstats personality stat [user@host ~]$ ls /proc | grep 122 12230 12231 12260 12297 [user@host ~]$ ps -fp 12263 UID PID PPID C STIME TTY TIME CMD [user@host ~]$ | [root@datacenteronline ~]# ssh [email protected] Last login: Wed Apr 17 09:55:45 2013 from 192.168.1.187 [root@localhost ~]# ls /proc/ | grep 2266 [root@localhost ~]# cd /proc/2266 [root@localhost 2266]# ls attr cpuset limits net root statm autogroup cwd loginuid numa_maps sched status auxv environ maps oom_adj schedstat syscall cgroup exe mem oom_score sessionid task clear_refs fd mountinfo oom_score_adj smaps wchan cmdline fdinfo mounts pagemap stack coredump_filter io mountstats personality stat [root@localhost 2266]# ls -al /proc/2266 total 0 dr-xr-xr-x 7 apache apache 0 Apr 17 09:45 . dr-xr-xr-x 266 root root 0 Apr 17 09:11 .. dr-xr-xr-x 2 apache apache 0 Apr 17 09:45 attr -rw-r--r-- 1 root root 0 Apr 17 09:45 autogroup -r-------- 1 root root 0 Apr 17 09:45 auxv -r--r--r-- 1 root root 0 Apr 17 09:45 cgroup --w------- 1 root root 0 Apr 17 09:45 clear_refs -r--r--r-- 1 root root 0 Apr 17 09:45 cmdline -rw-r--r-- 1 root root 0 Apr 17 09:45 coredump_filter -r--r--r-- 1 root root 0 Apr 17 09:45 cpuset lrwxrwxrwx 1 root root 0 Apr 17 09:45 cwd -> / -r-------- 1 root root 0 Apr 17 09:45 environ lrwxrwxrwx 1 root root 0 Apr 17 09:45 exe -> /usr/local/apache2/bin/httpd dr-x------ 2 root root 0 Apr 17 09:45 fd dr-x------ 2 root root 0 Apr 17 09:45 fdinfo -r-------- 1 root root 0 Apr 17 09:45 io -rw------- 1 root root 0 Apr 17 09:45 limits -rw-r--r-- 1 root root 0 Apr 17 09:45 loginuid -r--r--r-- 1 root root 0 Apr 17 09:45 maps -rw------- 1 root root 0 Apr 17 09:45 mem -r--r--r-- 1 root root 0 Apr 17 09:45 mountinfo -r--r--r-- 1 root root 0 Apr 17 09:45 mounts -r-------- 1 root root 0 Apr 17 09:45 mountstats dr-xr-xr-x 6 apache apache 0 Apr 17 09:45 net -r--r--r-- 1 root root 0 Apr 17 09:45 numa_maps -rw-r--r-- 1 root root 0 Apr 17 09:45 oom_adj -r--r--r-- 1 root root 0 Apr 17 09:45 oom_score -rw-r--r-- 1 root root 0 Apr 17 09:45 oom_score_adj -r--r--r-- 1 root root 0 Apr 17 09:45 pagemap -r--r--r-- 1 root root 0 Apr 17 09:45 personality lrwxrwxrwx 1 root root 0 Apr 17 09:45 root -> / -rw-r--r-- 1 root root 0 Apr 17 09:45 sched -r--r--r-- 1 root root 0 Apr 17 09:45 schedstat -r--r--r-- 1 root root 0 Apr 17 09:45 sessionid -r--r--r-- 1 root root 0 Apr 17 09:45 smaps -r--r--r-- 1 root root 0 Apr 17 09:45 stack -r--r--r-- 1 root root 0 Apr 17 09:45 stat -r--r--r-- 1 root root 0 Apr 17 09:45 statm -r--r--r-- 1 root root 0 Apr 17 09:45 status -r--r--r-- 1 root root 0 Apr 17 09:45 syscall dr-xr-xr-x 29 apache apache 0 Apr 17 09:45 task -r--r--r-- 1 root root 0 Apr 17 09:45 wchan Cound anyone tell me what it is? |
caller below when linking saids undefined reference... in base.h file: class tempc { public: int a; } ; class base // base class { public: // public template<T> int func(T*); // template defined here }; in base.cpp file: template<T> int base :: func(T*) { std::cout << "base::func called" << std::endl; return 0; } in derived.cpp file class derived : public: base // class defined { void caller() { tempc a; func<tempc>(&a); // template used here base::func<tempc>(&a); } }; int main() { derived d; d.caller(); } the error is : undefined reference to `void base::func(tempc*)' base is the base class derived is the derived class from base this caller saids undefined reference... //sorry,because my source code is reaaaaly too large to show up | Quote from : The only portable way of using templates at the moment is to implement them in header files by using inline functions. Why is this? (Clarification: header files are not the only portable solution. But they are the most convenient portable solution.) |
I'm using Leaflet JS with a modified GeoJSON file of world contries to display a choropleth, like this: Is there any way to display the far-eastern part of Russia as a contiguous entity? Rather than it being split to due to its coordinates. | I am having the issue where the International Dateline is splitting a polygon I am working with. I have a layer of the "Federal Districts" of Russia, and the eastern most federal district is being "cut" by the international dateline. I currently have the data frame's coordinate system set to Asia Lambert Conformal Conic and this places the two "cut" polygons next to each other (how they should be). I really need the polygon to not be cut and show as a continuous polygon. I've researched up and down, tried changing the projection/coordinate system, but with no luck. I've attached a screenshot of the one multi-part polygon that is being split by the international dateline. I would like it so that there is no cutting of the polygon, and therefore no boundary line going through the polygon. I've even tried transforming this multi-part polygon into separate, single-part polygons, then merge them back together, but anytime any part of any polygon crosses this line, it gets cut. Layout View: Data View: |
I have an Ubuntu VM (running in VMWare Fusion) and I can no longer update my apps - software updater tells me I must update from 15.10 When I try to Upgrade the machine does nothing - I never see any upgrade happen and I seem to be stuck on 15.10 | Recently I have installed an older version of Ubuntu on my old machine. Whenever I try to install any software, I get an error saying it couldn't be found: $ sudo apt-get install vlc Reading package lists... Done Building dependency tree Reading state information... Done E: Couldn't find package vlc |
Please check if my method is correct. Solution : Let $$f(x) = x^8 - x^7 + x^2 -x +15 $$ Now, let $g(x)= x^8 -x^7=x^7(x - 1)$ and $h(x)= x^2 -x=x(x-1)$. Thus, $$f(x)=g(x) + h(x) + 15$$ On analyzing $g(x)$ and $h(x)$ we see that both the functions are negative between $0$ and $1$ and the maximum negative value of both the functions do not exceed $-1$. Thus, the minimum value of $f(x)$ is not less than $13$. Hence, $f(x)$ has no real root. Q.E.D | Let $ P(x)=x^8 - x^7 +x^2 -x +15 $, Descartes' Rule of Signs tells us that the polynomial has 4 positive real roots , but if we group the terms as $$ P(x)= x(x-1)(x^6+1) +15 $$ we find that $ P(x) $ does not have any positive roots. Where did I err ? |
For the past couple of weeks, I've been getting near-constant error notifications from Ubuntu (18.04 Cinnamon) Network service discovery disabled Your current network has a .local domain, which is not recommended and incompatible with the Avahi network service discovery. The service has been disabled. I had never heard of Avahi in my life until these showed up. According to , this is some sort of network software used for things like iTunes. I have never used iTunes on this computer. I haven't installed any programs that correlate to when these started to appear, as far as I can recall. The last things I can think of that I installed are the Spotify and Discord clients for Linux, both a couple of months ago, at least. I'm prepared to disable it as outlined in the post I linked to, but I have to assume that it's there for a reason and some program is using it. Is there any way for me to know why Avahi is active on my system so that I don't break something by disabling it? | Every time at boot I get a message “Network service discovery disabled. Your current network has a .local domain, which is not recommended and incompatible with the Avahi network service discovery. The service has been disabled.” What does this mean for me? Wi-Fi is disabled. |
When I tried to install android studio on my 14.04 LTS Ubuntu system on opt directory as according to mentioned on by clayton (Ubuntu user) but I could not install it as accordingly. Unpack android studio zip on download directory Then open terminal fetch the file through cd ~/Downloads Then I enter sudo -i After then I tried to move android studio to opt directory mv android-studio /opt Then it says: mv: cannot stat ‘android-studio’: No such file or directory And I installed Qt creator5.3.2 on /opt directory for third party installation policy.It works fine except I could not fetch the examples on Qt creator and it is not showing the version of Qt. If anybody could help me how to solve this problem. I would be really thankful in advance. | Please tell me the full process of installing Android Studio and its necessary dependencies. |
1) A and B are sets of natural numbers. They are the same, so they have the same cardinality. 2) Set B is transformed into set of rationals. This can be done only by adding new numbers e.g. 1/2, 1/4, 5/6, ... to this set. 3) Set B now contains the same amount of numbers as set A, with extra numbers from step 2. Therefore, set of rationals has greater cardinality than set of naturals. | So I answered this question: I believe my answer is correct, however one thing I couldn't explain fully, and which is bugging me, is why the rationals $\mathbb Q$, integers $\mathbb Z$ and naturals $\mathbb N$ all have cardinality $| \mathbb Q |=| \mathbb Z | = |\mathbb N| = \aleph_0$, when $\mathbb N \subsetneq \mathbb Z \subsetneq \mathbb Q$. The basic proof of the other question, from my answer, is that for any $r$ in $\mathbb Q$ there is a single function $f(r)$ such that $f(r) \in \mathbb Z$, and the same holds between $\mathbb Z$ and $\mathbb N$. Because there is this 1:1 transformation possible, there must be the same number of numbers in the three sets, because otherwise there would be a number in one set for which the bijection could not produce a number of the other set, and this is not so. Now, Belgi explained why $1<2$ in the other question by defining the value 0 as the cardinality of the empty set $\emptyset$, 1 as the cardinality of a set of sets containing only the empty set, and 2 as the set of sets containing the empty set and a set containing the empty set, then proceeding as follows: Now that we have defined the natural numbers we can define when one number is smaller than another. The definition is $x<y$ is $x\subset y$ and $x\neq y$ . Clearly $\{\emptyset\}\neq\{\emptyset,\{\emptyset\}\}$ and $\{\emptyset\}\subset\neq\{\emptyset,\{\emptyset\}\}$ So this a proof, by definition, of why $1<2$. ... however, by the same definition, because $\mathbb N \subsetneq \mathbb Z \subsetneq \mathbb Q$, then $| \mathbb N | < | \mathbb Z | < |\mathbb Q|$ and thus a maximum of one of these quantities can be the ordinal quantity $\aleph_0$. |
Find upper and lower limit of $\cos(x^2)-\cos((x+1)^2)$. In previous topic was shown that 2 cannot be attain. but how to find upper bound? | How to prove that upper limit of $\cos (x^2)-\cos (x+1)^2$ is $2$. Can anyone show proof of this? |
Sorry for asking a pretty shallow question, but I can't find the mistake that I made. I was trying to pass a template <typename T> in my header, but g++ threw a lot of errors that I don't know how to fix. Before this is marked as duplicate, I'd like to stress the point that I wasn't able to find such problems using template classes, as that's where the problem occurred in my case. Output: C:\Temp\cc52Nkf5.o:executesort.cpp:(.text+0x1cc8): undefined reference to `void Utils::message_input<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > >(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&)' collect2.exe: error: ld returned 1 exit status utils.h: #pragma once #ifndef utils_h #define utils_h // inputs are appropriate class Utils { public: // ... template <typename T> void message_input(string, T&); }; #endif utils.cpp #include "utils.h" // inputs are appropriate // ... template <typename T> void Utils::message_input(string str1, T& into) { cout << str1; cin >> into; } How I called: #include "utils.h" // #include blah, blah, blah int multicnt; Utils uts; uts.message_input(">>> How many times to run? (positive whole number) ", multicnt); Any help is greatly appreciated | Quote from : The only portable way of using templates at the moment is to implement them in header files by using inline functions. Why is this? (Clarification: header files are not the only portable solution. But they are the most convenient portable solution.) |
I am planning to get my first wide angle lens. Nikon 16-35 F/4 is the one which is on top of my list now and when reading the , I noticed this question and answer. Q : Can I use a Graduated ND filter with this lens( Lee Filter system)? A : It's not recommended to use a ND filter at a focal length less than 35mm. This will cause a black x or a line in the center of the frame. Not sure what the technical word for this is. This confuses me. I was planning to get some ND filters so that i can take some long exposures on bright environments. Is this a true statement ? If yes, What are the focal lengths which people usually use NDFilters with (to photograph landscapes) | I bought a inexpensive variable neutral density filter, ND2-ND400 variety. I wasn't expecting a whole lot because of the very low price point, but I think I'm either using it incorrectly or my unit is defective. Do I simply need to back off the maximum filtering setting until the results are acceptable? It seemed to provide very minimal filtering when I reached and acceptable point, maybe ND8 or so. Is this cheap ND filter only usable up to something like ND8? I am shooing with a full frame camera and a 17-40mm lens. 17mm, approximately maximum ND filtering: 40mm, approximately maximum ND filtering: 17mm, less then maximum ND filtering: |
I have an Atomic PI and Ubuntu Server 20.04 installed on it. During shutdown it hangs with an error of "watchdog soft lockup" caused by DMA controller drivers called dw_dmac and dw_dmac_core Reason is that "the HSUARTs on the SOC are not normally used on the AtomicPi, however they do appear on the 26pin connector". Solution described at the link below for 19.04 and 19.10 To be able to solve this issue the kernel modules dw_dmac and dw_dmac_core have to be unloaded. To make this I've done the following steps without success: 1.) Checked whether these modules are running and check dependencies lsmod | grep dw_dmac Result: dw_dmac 16384 2 dw_dmac_core 28672 1 dw_dmac 2.) Tried to unload with modprobe sudo modprobe -r dw_dmac dw_dmac_core Result: modprobe: FATAL: Module dw_dmac is in use. 3.) Tried to unload with rmmod sudo rmmod -v -f dw_dmac dw_dmac_core Result: rmmod: ERROR: ../libkmod/libkmod-module.c:799 kmod_module_remove_module() could not remove 'dw_dmac': Resource temporarily unavailable rmmod: ERROR: could not remove module dw_dmac: Resource temporarily unavailable rmmod: ERROR: ../libkmod/libkmod-module.c:799 kmod_module_remove_module() could not remove 'dw_dmac_core': Resource temporarily unavailable rmmod: ERROR: could not remove module dw_dmac_core: Resource temporarily unavailable 4.) Added the followings to /etc/modprobe.d/blacklist.conf blacklist dw_dmac blacklist dw_dmac_core And then updated initramfs: sudo update-initramfs -u Result: modules still loaded at startup 5.) Tried to modify GRUB settings at etc/default/grub to blacklist modules by adding modprobe.blacklist=dw_dmac modprobe.blacklist=dw_dmac_core Then sudo update-grub Sourcing file `/etc/default/grub' /usr/sbin/grub-mkconfig: 36: /etc/default/grub: modprobe.blacklist=dw_dmac: not found 6.) Another GRUB settings modification by adding to /etc/default/grub dw_dmac.blacklist=yes dw_dmac_core.blacklist=yes Then sudo update-grub Result: Sourcing file `/etc/default/grub' /usr/sbin/grub-mkconfig: 39: /etc/default/grub: dw_dmac.blacklist=yes: not found Could anyone help me how to unload these modules permanently? Thanks. | How do I disable loading of unnecessary kernel modules. Kernel 3.2.4 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.