straight_stewie

One that I've always wanted to do, and came close before a family disaster stopped me doing my hobbies for a couple of years:

Be warned, that this one is extremely intensive in the higher order maths:

Languages definable by parallel string rewriting are proven to be equivalent to languages definable by sequential string rewriting. In a manner of speaking, this means that a generalized L-System can define any language.

The project that I want to undertake is two-fold:
Prove that it is possible to write a useful programming language where-in parsing happens on all tokens in "parallel" rather than sequentially.  From some early experiments I conducted with plain string rewriting, this is actually fairly easy to parallelize execution on in all cases. General rules can be derived for actually running a parallel string rewriting algorithm that can handle both context free and left-right context sensitive grammars in parallel. This can speed up processing of large inputs by an incredible amount. This can generate huge amounts of user-defined patterned and possibly stochastic data quickly (enough to crash a 32GB RAM machine in about 5 seconds using just an i7-6700HQ when doing things in-memory) A mini-language for object searching and manipulation can be created, similar in some ways to LINQ or PLINQ, except that, by the very definition of a parallel string rewriting system, the language used would allow for "automatic" parallelization of the searching, creation, and manipulation of a collection of objects.  
L-Systems and parallel rewriting languages are definitely an open area of research in this regard. Most existing research has to do with their usefulness in describing biological growth/processes or for drawing curves.

One way to see if this is an area worth exploring further is to try to convince yourself that the string rewriting rules used in L-Systems are the same as would be defined for a Chomsky grammar using BNF.
 

You need one database and multiple (database) tables, not multiple databases. Look at the relations between your data.
 
First, you have a person with some personal information. So something like
Person: { PersonId, First Name, Last Name, Age, Sex, … }  
Then you have a prescription. A person can have multiple prescriptions, but a prescription can only belong to one person, so 1:n. This is easily done with a foreign key in the prescription table
Prescription: { PrescriptionId, PersonId, DisplayName, … }  
Then you have drugs. A drug can belong to multiple prescriptions and a prescription can contain multiple drugs, so n:n. This requires an additional relationship table. Technically your relationship table does not need its own ID, you could just use the combination of both other IDs as its key. However it can make certain things easier to do, e.g. its often easier in SQL scripts if you don't have to deal with a composite key.
PrescriptionDrug: { PrescriptionDrugId, PrescriptionId, DrugId, Dosage, Duration, … }  
Last you have the drug, which like person is a simple table without any relationship information
Drug: { DrugId, Name, Manufacturer, Price, Currency, … }  

Well, I came into this topic thinking of another 'high'. What a disappointment.
In terms of LTT clickbait rating, I'd give it a solid 7.89/10
 
/s

Well, keep me informed.
 

PM me about the price if you wouldn't mind shipping to MS. I could buy it and shipping if the price is right. I'm looking for something in that performance range to enhance my folding rig. I have two open slots, adding that card would double my current production, and I have an oversized PSU for what I'm running.

Where is "local"?

The 75k seems about right for a 750Ti considering that two GTX 760s are giving me roughly 100k ppd each.

That's only making 75k ppd?
 

You know, I'm left wondering if we could do a week long folding event once a year, and a weekend long folding event once a month. I'm quite enjoying this sub community so far.

I think they've actually admitted to doing this in the past. The reason I didn't mention this in reply to the question was because, technically speaking, this is difficulty matching, not difficulty scaling.

Overall difficulty of running F@H is probably pretty constant over time. Some work units may be difficult than others, depending on what calculations they are doing, but these changes in difficulty appear in no specific order and are not by design like they are in block chains.

It seems as if they need to be reset to the stats last night. When I added them I added a note in the name cell that pointed to me as the modifier and also recorded the time in the note. When I didn't get a reply very quickly I went into damage control mode to try and minimize Yoshi's losses.

Just for reference, a cell that has a note in Google Sheets has a little black triangle in the upper right hand corner of the cell. Hovering over that cell opens the note.

@iamdarkyoshi your stats were not added to the sheet. Do you know what they were at midnight last night? Otherwise, I can just add your stats now and you will be behind by 12 hours.

I'm not sure which would be more accurate. All of the other numbers seems to be the same except for team totals. I wonder if there's a team in one that's not in the other.

On a side note, I really need to upgrade cards. I've been folding 24/7 for a while now and only making about 200,000 ppd.

https://folding.extremeoverclocking.com/team_summary.php?s=&t=223518

So just a few questions:
Is the soft date of March 26, 2018 now a hard date? What time does the contest start (We will need to make sure someone is available to correctly log the start points data at that time)?

Request sent.

Well, I'll get the ball rolling on that. My folding handle is the same as it is here, minus the underscore ("superstewie")

I'm wondering if it would be possible to make this a contest. I think it's already been mentioned that badges will not be awarded this time around, but perhaps it would still be fun to get a list of all participants and rank them based on amount contributed just during folding week.

The team page seems to have alot of contributors that made alot of points and then stopped folding. Perhaps this is a way to cut through that noise and figure out who is still contributing.

I'm slowly making my way up the group. I'm only capable of generating somewhere around 200,000 PPD, but I'm running 24/7. I've noticed that alot of people on team statistics page haven't been active for a very long time.

Whaler is unfortunately gone  

Well, one could argue that the GPL is not sane unless you are in the universe of GNU tools.

If I'm following this correctly, that just prints all numbers b <= n <= a where n % b = 0. In plain English, you are looking to find all multiples of b between b and a inclusive.
 
What you should do is find the largest multiple of b less than a. We can do this by writing:
int largestMultiple = div(a, b) * b; Then you would just continually subtract b from largestMultiple until you are equal to or less than b, printing as you go along.

This is about as efficient as it gets, because it only requires as many iterations as there are multiples of b such that  b <= multiple <= a.

Are they blocked, though?

Is the paper air permeable?
 
More generally:
 
Does having the paper reduce dust intake?
Does the paper reduce noise that is otherwise extremely loud?
Is this a manufacturing mistake only in some units? (i.e. Paper installed to transport partially completed machine from one place to the next, and forgot to remove it)
Could this have been a workflow mistake by factory workers?
Could Asus be nerfing their own product line(s) without Intel's involvement?
Could these units have been intercepted and modified without Asus knowledge?
 
There are many things that could explain this. Let's give Asus a chance to explain themselves before jumping to conclusions and trying to cancel Intel/Asus.

Those aren't terrible temperatures, but there's room for improvement. 

If you find it difficult to understand, you can just leave it alone, and if those are really the peak temperatures, you should be fine for many years still.