- India's computer science graduates: High in quantity and low in quality, finds study - 1 Update
- AI may equal human intelligence without matching the true nature of our experiences - 1 Update
- Reorganizing a computer chip: Transistors can now both process and store information - 1 Update
- I correct about my new scalable algorithm is here.. - 1 Update
| aminer68@gmail.com: Dec 11 04:42PM -0800 Hello, India's computer science graduates: High in quantity and low in quality, finds study A new study, by researchers from the US, China, India and Russia, has compared the quality of computer science graduates from these four countries, the study found that graduate students in the US substantially outperformed their peers from China, Russia and India, including those from elite institutes of these countries. The findings of the study are published in the Proceedings of the National Academy of Sciences (PNAS), and the study was partly funded by India's All India Council for Technical Education (AICTE) and Russia's National Research University Higher School of Economics. Read more here: https://researchmatters.in/news/india%E2%80%99s-computer-science-graduates-high-quantity-and-low-quality-finds-study Thank you, Amine Moulay Ramdane. |
| aminer68@gmail.com: Dec 11 12:57PM -0800 Hello, AI may equal human intelligence without matching the true nature of our experiences Read more here: https://www.scientificamerican.com/article/will-machines-ever-become-conscious/ Thank you, Amine Moulay Ramdane. |
| aminer68@gmail.com: Dec 11 12:46PM -0800 Hello, Reorganizing a computer chip: Transistors can now both process and store information Researchers have created a more feasible way to combine transistors and memory on a chip, potentially bringing faster computing. Read more here: https://www.sciencedaily.com/releases/2019/12/191209161323.htm Thank you, Amine Moulay Ramdane. |
| aminer68@gmail.com: Dec 11 09:24AM -0800 Hello, I correct about my new scalable algorithm is here.. As you have noticed i am an inventor of many scalable algorithms and there implementations, but i have just thought more and i think i have just again invented a new algorithm that is scalable, i will explain it, read my following previous writing: ----------------------------------------------------------- About parallel programming and concurrency.. Look at the following concurrency abstractions of microsoft: https://docs.microsoft.com/en-us/dotnet/api/system.threading.tasks.task.waitany?view=netframework-4.8 https://docs.microsoft.com/en-us/dotnet/api/system.threading.tasks.task.waitall?view=netframework-4.8 I will soon implement waitany() and waitall() concurrency abstractions for Delphi and Freepascal, with the timeout in milliseconds of course, and they will work with my efficient implementation of a Future, so you can will be able to wait for many futures with waitany() and waitall(). And about task cancelation like in microsoft TPL, i think it is not a good abstraction, because how do you know when you have to efficiently cancel a task or tasks ? so you are understanding that task cancelation is not a so efficient abstraction , so i will not implement it, because i think the waitany() and waitall() with Futures with the "timeout" in milliseconds are good concurrency abstractions. -------------------------------------------------------------- But my new algorithm is a WaitAny() that is fully "scalable", and it can be called from mutiple threads and it will be scalable, but my WaitAny() and WaitAll() will work with Futures and with Threads and with Event objects and such and they will be portable. Thank you, Amine Moulay Ramdane. |
| You received this digest because you're subscribed to updates for this group. You can change your settings on the group membership page. To unsubscribe from this group and stop receiving emails from it send an email to comp.programming.threads+unsubscribe@googlegroups.com. |
No comments:
Post a Comment