- More precision about my work.. - 2 Updates
- About optimization.. - 1 Update
- In the following software project of mine i have used also a more sophisticated mathematics.. - 1 Update
- Here my other new poem of Love: "Baby Your Love is So Good Since I Can Feel It !" - 2 Updates
- Here is my new poem... - 3 Updates
| aminer68@gmail.com: Dec 01 02:22PM -0800 Hello, More precision about my work.. I have worked as a software developer and i have worked as a a network administrator, those were full time jobs, and i have worked as a software developer consultant and as network administrator consultant, and i have also studied operational research , this is why you have seen me implementing in front of you my PERT++ library and my M/M/n queuing model simulation with Object Pascal, here they are: My M/M/n queuing model simulation with Object Pascal https://sites.google.com/site/scalable68/m-m-n-queuing-model-simulation-with-object-pascal and My PERT++ (An enhanced edition of the program or project evaluation and review technique that includes Statistical PERT) in Delphi and FreePascal https://sites.google.com/site/scalable68/pert-an-enhanced-edition-of-the-program-or-project-evaluation-and-review-technique-that-includes-statistical-pert-in-delphi-and-freepascal And to know me more , read my following writing: More about my way of doing.. As you have noticed i am a white arab, i live in Quebec Canada since year 1989. Now if you ask me how i am making "money" so that to be able to live.. You have to understand my way of doing, I have gotten my Diploma in Microelectronics and informatics in 1988, it is not a college level diploma, my Diploma is a university level Diploma, it looks like an Associate degree or the french DEUG. Read here about the Associate degree: https://en.wikipedia.org/wiki/Associate_degree And after i have gotten my Diploma , I have also succeeded one year of pure 'mathematics" at the university level of mathematics. So i have studied and succeeded 3 years at the university level.. Now after that i have come to Canada in year 1989 and i have started to study more software computing and to study network administration in Quebec Canada, and after that i have started to work as a network administrator for many years, after that around years 2001 and 2002 i have started to implement some of my softwares like PerlZip that looked like PkZip of PKware software company, but i have implemented it for Perl , and i have implemented the Dynamic Link Libraries of my PerlZip that permits to compress and decompress etc. with the "Delphi" compiler, so my PerlZip software product was very fast and very efficient, in year 2002 i have posted the Beta version on internet, and as a proof , please read about it here: http://computer-programming-forum.com/52-perl-modules/ea157f4a229fc720.htm And after that i have sold the release version of my PerlZip product to many many companies and to many individuals around the world, and i have even sold it to many Banks in Europe, and with that i have made more money. And after that i have started to work like a software developer consultant, the name of my company was and is CyberNT Communications, here it is: Here is my company in Quebec(Canada) called CyberNT Communications, i have worked as a software developer and as a network administrator, read the proof here: https://opencorporates.com/companies/ca_qc/2246777231 Also read the following part of a somewhat old book of O'Reilly called Perl for System Administration by David N. Blank-Edelman, and you will notice that it contains my name and it speaks about some of my Perl modules: https://www.oreilly.com/library/view/perl-for-system/1565926099/ch04s04.html And here is one of my new software project that is my powerful Parallel Compression Library was updated to version 4.4 You can download it from: https://sites.google.com/site/scalable68/parallel-compression-library And read more about it below: Author: Amine Moulay Ramdane Description: Parallel Compression Library implements Parallel LZ4 , Parallel LZMA , and Parallel Zstd algorithms using my Thread Pool Engine. - It supports memory streams, file streams and files - 64 bit supports - lets you create archive files over 4 GB , supports archives up to 2^63 bytes, compresses and decompresses files up to 2^63 bytes. - Parallel compression and parallel decompression are extremely fast - Now it supports processor groups on windows, so that it can use more than 64 logical processors and it scales well. - It's NUMA-aware and NUMA efficient on windows (it parallelizes the reads and writes on NUMA nodes) - It minimizes efficiently the contention so that it scales well. - It supports both compression and decompression rate indicator - You can test the integrity of your compressed file or stream - It is thread-safe, that means that the methods can be called from multiple threads - Easy programming interface - Full source codes available. Now my Parallel compression library is optimized for NUMA (it parallelizes the reads and writes on NUMA nodes) and it supports processor groups on windows and it uses only two threads that do the IO (and they are not contending) so that it reduces at best the contention, so that it scales well. Also now the process of calculating the CRC is much more optimized and is fast, and the process of testing the integrity is fast. I have done a quick calculation of the scalability prediction for my Parallel Compression Library, and i think it's good: it can scale beyond 100X on NUMA systems. The Dynamic Link Libraries for Windows and Dynamic shared libraries for Linux of the compression and decompression algorithms of my Parallel Compression Library and for my Parallel archiver were compiled from C with the optimization level 2 enabled, so they are very fast. Here are the parameters of the constructor: First parameter is: The number of cores you have specify to run the compression algorithm in parallel. Second parameter is: A boolean parameter that is processorgroups to support processor groups on windows , if it is set to true it will enable you to scale beyond 64 logical processors and it will be NUMA efficient. Just look at the Easy compression library for example, if you have noticed it's not a parallel compression library: http://www.componentace.com/ecl_features.htm And look at its pricing: http://www.componentace.com/order/order_product.php?id=4 My parallel compression library costs you 0$ and it's a parallel compression library.. My Parallel compression library was updated, i have ported the Parallel LZ4 compression algorithm(one of the fastest in the world) to the Windows 64 bit system, now Parallel LZ4 compression algorithm is working perfectly with Windows 32 bit and 64 bit, if you want to use Windows 64 bit Parallel LZ4 just copy the lz4_2.dll inside the LZ4_64 directory (that you find inside the zip file) to your current directory or to the c:\windows\SysWow64 directory, and if you want to use the Windows 32bit Parallel LZ4 use the lz4_2.dll inside the LZ4_32 directory. If you want to use Windows 64 bit Parallel LZMA with Windows 64 bit just copy the LZMAStream1.dll inside the LZMA_fpc64 directory and LZMAStream2.dll inside LZMA_dcc64 directory to your current directory or to the c:\windows\SysWow64 directory, and if you want to use Windows 32bit Parallel LZMA copy the LZMAStream1.dll inside the LZMA_fpc32 directory and LZMAStream2.dll inside LZMA_dcc32 directory to your current directory or to the c:\windows\system32 directory. Operating systems: Windows , Linux (x86) Language: FPC Pascal v2.2.0+ / Delphi 7+: http://www.freepascal.org/ Required FPC switches: -O3 -Sd -Sd for delphi mode.... Required Delphi switches: -$H+ -DDelphi32 Required Delphi XE-XE5 switches: -DXE {$DEFINE CPU32} and {$DEFINE Windows32} for 32 bit systems {$DEFINE CPU64} and {$DEFINE Windows64} for 64 bit systems Thank you, Amine Moulay Ramdane. |
| Bonita Montero <Bonita.Montero@gmail.com>: Dec 02 07:57AM +0100 Your're totally mad. Go to a doctor, get your bipolar mediaction and have a normal life. |
| aminer68@gmail.com: Dec 01 01:55PM -0800 Hello, About optimization.. Advances in integer optimization from 1988 to 2017: – Improved algorithms and methods: 147,650 times faster – Improved computing power: 17,120 times faster – Overall improvement: 2,527,768,000 times faster In practice, this means that solving a typical MILP problem would have taken 80 years back in 1988, whereas today it only takes one second. However, while MILP problem solving is nowadays standard technology, MINLP problems still pose a challenge.This is motivating and inspiring researchers in the field. Read more here: The world's fastest https://www.abo.fi/en/news/the-worlds-fastest/ Optimization is a special area within Mathematics and Engineering. The idea of optimization is to find the best possible – or a sufficiently good – solution to a problem given in the form of a mathematical description of a system or process. And about optimization, i have just included the 64 bit SYMPHONY solver for mixed-integer linear programs (MILPs), with a batch file that executes the MPS file, inside the zip file that you can download from here: https://sites.google.com/site/scalable68/linear-programming-modeling-examples-in-object-pascal And you can read this interesting webpage and you will notice on the benchmark that SYMPHONY solver is good: ILP Solver Comparison Part I http://strimas.com/prioritization/scip-performance/ And read my following webpage about my Linear programming formulation of the Shortest-Route problem to understand more: http://pages.videotron.com/aminer/lp/linear.htm Thank you, Amine Moulay Ramdane. |
| aminer68@gmail.com: Dec 01 12:58PM -0800 Hello, My Universal Scalability Law for Delphi and FreePascal version 3.22 In the following software project of mine i have used also a more sophisticated mathematics.. I have included a 32 bit and 64 bit windows executables called usl.exe and usl_graph.exe inside the zip, please read the readme file to know how to use it, it is a very powerful tool. Here is an important and free book about Universal Scalability Law (USL), read it to understand more what USL is all about, you can download it from this link: https://www.vividcortex.com/resources/universal-scalability-law/ And you have to optimize the criterion of the cost for a better QoS, and for this i have supplied you with a second option called -d that you have to run for that, so you have to type at the command prompt: usl data.csv -d 0.3 0.1 the 0.3 is the slope of the secant with a step 0.1, so since the step is 0.1 so this will approximate a derivative of the USL equation that equal 0.3, so here is the output of my program when you run it with -d 0.3 0.1: -- Peak number is: 449.188 Predicted scalability peak is: 18.434 Coefficient of determination R-squared is: 0.995 The derivative of the USL equation at delta(y)/delta(x)=0.300 with a step delta(x)=0.100, gives a number and derivative of a secant or a derivative delta(y)/delta(x) of: 16.600 and 0.300 -- So as you have noticed that a good approximation for the derivative of the USL equation will arrive at the 16.600 cores and this gives also a derivative of the secant that approximate the derivative of the USL equation. So to optimize more the criterion of the cost for a better QoS, you have to choose a good delta(y)/delta(x) to optimize the criterion of the cost of your system and you have to balance better between the performance and the cost. The -nlr option means that the problem will be solved with the mathematical nonlinear regression using the simplex method as a minimization, if you don't specify -nlr, the problem will be solved by default by the mathematical polynomial regression. You can read about it and download it from: https://sites.google.com/site/scalable68/universal-scalability-law-for-delphi-and-freepascal Thank you, Amine Moulay Ramdane. |
| aminer68@gmail.com: Dec 01 12:04PM -0800 Hello, Here my other new poem of Love: "Baby Your Love is So Good Since I Can Feel It !" I was just listening to the following beautiful song of Julio Iglesias and Stevie Wonder called: My Love: https://www.youtube.com/watch?v=2OXVnsPC0gg So i have just decided to write my following new poem, here it is: Baby Your Love is So Good Since I Can Feel It ! Since you are all that i have missed ! Baby Your Love is So Good Since I Can Feel It ! Since you are here and i can not resist ! Baby Your Love is So Good Since I Can Feel It ! Your Love is like Freedom that makes me so rich ! Baby Your Love is So Good Since I Can Feel It ! Since to our beautiful love i am like addict ! Baby Your Love is So Good Since I Can Feel It ! Since our beautiful love is like a so beautiful gift ! Baby Your Love is So Good Since I Can Feel It ! So come to me because our love is not being a guilt ! Baby Your Love is So Good Since I Can Feel It ! Since you are seeing me insist because you beautifully exist ! Baby Your Love is So Good Since I Can Feel It ! Because everyone can predict that our love is all that we wish ! Baby Your Love is So Good Since I Can Feel It ! Because our kind of so beautiful Love has never been extinct ! Baby Your Love is So Good Since I Can Feel It ! Because our beautiful love will be forever a beautiful King ! Thank you, Amine Moulay Ramdane. |
| aminer68@gmail.com: Dec 01 12:04PM -0800 > Because our beautiful love will be forever a beautiful King ! > Thank you, > Amine Moulay Ramdane. It was my last poem that i have posted here, i have just posted this new one, because i think it is beautiful. Thank you, Amine Moulay Ramdane. |
| aminer68@gmail.com: Dec 01 11:03AM -0800 Hello, Here is my new poem... I was just listening to this Jewish women that is singing a beautiful arabic song, and i will share it with you: https://www.youtube.com/watch?v=A-jzhHWkYoU And i have decided to write fast a new poem, here it is: The beautiful is saying to you a beautiful Hello ! Since i am even writing it to you Love with my beautiful ego ! The beautiful is saying to you a beautiful Hello ! Since even the "beautiful" of Marilyn Monroe is our beautiful tomorrow ! The beautiful is saying to you a beautiful Hello ! Since the beautiful of the philosophy of Rousseau is also our tempo ! The beautiful is saying to you a beautiful Hello ! Since our beautiful Love is not the venom of the Scorpio ! The beautiful is saying to you a beautiful Hello ! Since our beautiful Love is also a so beautiful Flamenco ! The beautiful is saying to you a beautiful Hello ! So is it a "wild" Rodeo or is it an "evil" fight of Taekwondo ? The beautiful is saying to you a beautiful Hello ! So you have to know how to make it beautiful like a pro ! The beautiful is saying to you a beautiful Hello ! Since i am even hearing it from the city of Moscow ! The beautiful is saying to you a beautiful Hello ! And i think that you are hearing it too you all my fellows ! Thank you, Amine Moulay Ramdane. |
| aminer68@gmail.com: Dec 01 11:32AM -0800 > And i think that you are hearing it too you all my fellows ! > Thank you, > Amine Moulay Ramdane. It was my last poem, i have just posted this new one, because i think it is beautiful. Thank you, Amine Moulay Ramdane. |
| aminer68@gmail.com: Dec 01 11:33AM -0800 > And i think that you are hearing it too you all my fellows ! > Thank you, > Amine Moulay Ramdane. It was my last poem that i have posted here, i have just posted this new one, because i think it is beautiful. 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