Privacy Policy

This Privacy Policy, together with the Terms Of Use, provides an explanation as to what happens to any personal data that you provide or that is collected automatically from you, while using the website. This policy may be updated from time to time, so please do review this policy regularly.

1.  Information Collected
Using this website may result in collection and processing the following data about you:
i.    Details of your visits to this website and the resources that you access, including, but not limited to, traffic data, location data, weblogs and other communication data.
ii.    Information that you provide by filling in forms on this website, such as when you registered for information.
iii.    Information provided by you when you communicate via email.

2.  Use of Cookies
On occasion, information may be gathered about your computer for services and statistical data regarding the use of this website by visitors. Such information will not identify you personally, it is statistical data about the visitors and their use of this website. This statistical data does not identify any personal details whatsoever.
Similarly to the above, information may be gathered by using a cookie file. Where used, these cookies are downloaded to your computer automatically. This cookie file is stored on the hard drive of your computer as cookies contain information that is transferred to your computer's hard drive. They are necessary for the full functionality of some sections of this website.
All web browser applications have the ability to decline cookies.  This can be done by activating the setting on your web browser which enables you to decline some or all the cookies. Please note that should you choose to decline cookies, you may be unable to access particular parts of this website.

3.  Use of Your Information
The information that is collected and stored relating to you is primarily used to provide the full services of this website to you. In addition, this information may be used additionally for the following purposes:
i.    To provide you with information requested from this website.
ii.    To notify you about any changes to this website, such as improvements or content updates, if you are a registered user.
Please be advised that, in any case, these personal data are not revealed to any third party.

4.  Storing Your Personal Data
By submitting your personal data, you agree to transfering, storing or processing of these data for purposes as described above. All reasonable steps are taken to make sure that your data is treated securely and in agreement with this Privacy Policy.
The transmission of information via the Internet is not always secure and therefore the security of data sent to and from this website can not be guaranteed in all cases. Therefore, the transmission of such data is entirely at your own risk. Registered users are provided with a username and password, so that they can access certain parts of this website, thus they are responsible for keeping this access tokens confidential.

5.  Third Party Links
You mind find links to third party websites on this website. Those websites should have their own privacy policies which you should check. No responsibility or liability is endorsed for their policies whatsoever.

6.  Access To Information and Removal on Request
You have the right to access all information about you stored in this website and, if requested, removed permanently. Should you wish to receive details or request removal, please use the contact details provided in this website.

Popular Posts

Hello x86: Low-level assembly coding for the 8086

Image
Hello x86: Low-level assembly coding for the 8086 wiring no-talking, in emulated 80286 / MS-DOS machine in DOSbox. This is a set of four "hello world" codes in x86 assembly, using single-segment 16-bit/i8086 instruction set. The purspose of this tutorial is to demonstrate how exact, minimal-space, yet razor-sharp is assembly coding, especially when dealing with such complexities like the segmented memory model of MS-DOS. The four versions are: Hello1.asm: Old-style standard directives, used by '70s-'80s assemblers, for .EXE output. Hello1C.asm: Old-style standard directives, used by '70s-'80s assemblers, for .COM output. Hello2.asm: Compact 'dot' directives, used by modern assemblers, for .EXE output. Hello2C.asm: Compact 'dot' directives, used by modern assemblers, for .COM output. The difference between .EXE and .COM comes from the MS-DOS era, when the first format required 'far' pointers (segment:offset) for memory ad
Read more

Announcement: Writing a new book in Data Science and R&D projects

Image
About two years ago an idea was hovering through my mind, a question actually: Why is that “traditional” project managers fail so gloriously in managing teams, especially in the Research and Development (R&D) field of work? I let it mature for a while, thinking that someone will eventually write a book or something about it. Two years have passed and no one did it, so I figured, well, I guess I will have to do that myself. After sending the proposal to only few top publishers, I was privileged enough to land a book contract with Elsevier , which was indeed my first choice for this endeavor.  The subject of the book will be simple: Managing and coordinating teams in the R&D environment, specifically in the domains of Data Analytics, Machine Learning and Artificial Intelligence in general , where I have been working for more than two and a half decades as a professional. Specifically, it will focus on every aspect of teamwork from the first to the last day of a R&D project, i
Read more

Fibonacci numbers in C (4 different ways)

Image
Fibonacci series in pure C no talking, using only vim and gcc in terminal, implementing four alternative designs: 1) Recursive: using the typical mathematical definition for Fib(n) 2) Iterative: using loop instead of recursion to avoid call stack overflows 3) Dynamic Programming: using buffer for cached results, calculated only once 4) Analytical: using the solution of the differential equation for Fib(n) Each option has its pros and cons, typically trading code simplicity for resources (recursion) or trading memory (cache) for speed. The purpose of this tutorial is to demonstrate coding discipline when working with very limited coding tools (command-line only in terminal) and alternative designs for use in different situations. Inline comments describe details about the code being written. Enable captions for more information on what is happening in each section of the video. Enable captions for more details and walk-through. Source code available at the Github repository (see chann
Read more

Multiplication tables in COBOL

Image
This program is a simple demonstration of basic user I/O and arithmetic operations in one of the earliest versions of COBOL that was made available for home computers in the early '80s. The "executable" was actually an intermediate binary format created as the compiler output, which could then be executed by another program, not very differently than today's Just-In-Time (JIT) compilers or pre-compiled interpreted languages. The language is the creation of Grace Hopper, a pivotal figure in the evolution of programming and the design of the first trully general-purpose languages. The two main strengths of COBOL was the rich I/O functionality for data file handling and the screen handling routines for creating terminal-based user I/O via forms and tables. Although functionally limited and with loquacious syntax by the programming standards of later language generations, COBOL was deemed extremely reliable and understandable by the programmers of those early days. So m
Read more

Bricks and towers in Prolog

Image
This program is a simple demonstration for illustrating how classic declarative programming can provide very intuitive and compact solution generators for logic problems and combinatorial tasks. In this example, a set of bricks with three sizes and a stability constraint ("do not put larger above") is coded to provide solution searching on all possible ways to build a stable tower of a specific height. Prolog's main advantage over other declarative programming languages is that even in the early '80s came with a rich library of common functionalities that made real-world application development easy. Turbo Prolog was probably the best option for PC machines, with efficient memory enhancements via more strict typing and other syntax shortcuts to limit the tree search in manageable space/time requirements for these platforms. Although now depricated by constrained and fuzzy logic paradigms, Prolog-style programming is still the most intuitive way to design simple expe
Read more

Channel Updates

Loading...