I will begin our blog on Java Tutorial with an incredibly important aspect of java development:  memory management.  The importance of this topic should not be minimized as an application's performance and footprint size are at stake.

From the outset, the Java Virtual Machine (JVM) manages memory via a mechanism known as Garbage Collection (GC).  The Garbage collector

• Manages the heap memory.   All obects are stored on the heap; therefore, all objects are managed.  The keyword, new, allocates the requisite memory to instantiate an object and places the newly allocated memory on the heap.  This object is marked as live until it is no longer being reference.
• Deallocates or reclaims those objects that are no longer being referened. 
• Traditionally, employs a Mark and Sweep algorithm.  In the mark phase, the collector identifies which objects are still alive.  The sweep phase identifies objects that are no longer alive.
• Deallocates the memory of objects that are not marked as live.
• Is automatically run by the JVM and not explicitely called by the Java developer.  Unlike languages such as C++, the Java developer has no explict control over memory management.
• Does not manage the stack.  Local primitive types and local object references are not managed by the GC.

So if the Java developer has no control over memory management, why even worry about the GC?  It turns out that memory management is an integral part of an application's performance, all things being equal.  The more memory that is required for the application to run, the greater the likelihood that computational efficiency suffers. To that end, the developer has to take into account the amount of memory being allocated when writing code.  This translates into the amount of heap memory being consumed.

Memory is split into two types:  stack and heap.  Stack memory is memory set aside for a thread of execution e.g. a function.  When a function is called, a block of memory is reserved for those variables local to the function, provided that they are either a type of Java primitive or an object reference.  Upon runtime completion of the function call, the reserved memory block is now available for the next thread of execution.  Heap memory, on the otherhand, is dynamically allocated.  That is, there is no set pattern for allocating or deallocating this memory.  Therefore, keeping track or managing this type of memory is a complicated process. In Java, such memory is allocated when instantiating an object:

String s = new String();  // new operator being employed
String m = "A String";    /* object instantiated by the JVM and then being set to a value.  The JVM
calls the new operator */

Companies have been collecting and analyzing data forever, pretty much.” So what’s really new here? What’s driving the data-analytics revolution and what does it mean for those that choose to postpone or ignore the pivotal role big-data is currently having on productivity and competition globally?

General Electric chairman and CEO Jeff Immelt explains it best when stating that “industrial companies are now in the information business—whether they like it or not.”  Likewise, digital data is now everywhere, it’s in every industry, in every economy, in every organization and according to the McKinsey Global Institute (MGI), this topic might once have concerned only a few data geeks, but big data is now relevant for leaders across every sector as well as consumers of products and services.

In light of the new data-driven global landscape and rapid technological advances, the question for senior leaders in companies now is how to integrate new capabilities into their operations and strategies—and position themselves globally where analytics can influence entire industries. An interesting discussion with six of theses senior leaders is covered in MGI’s article, “How companies are using big data and analytics,” providing us with a glimpse into a real-time decision making processes.

When eCommerce companies want to optimize information security, password management tools enable users to create strong passwords for every login.

Better than a Master Pass
A two-factor authentication, a security process in which the user provides two means of identification, one of which is typically a physical token, such as a card, and the other of which is typically something memorized, such as a security code can drastically reduce online fraud such as identity theft . A common example of two-factor authenticationis a bank card: the card itself is the physical item and the personal identification number (PIN) is the data that goes with it.

LastPass 3.0 Premium and RoboForm, security downloads offer fingerprint-based authentication features that can be configured to any computer PC or mobile application.  Both are supported by the Google Authenticator mobile app for smart phone and device integration.

LastPass 3.0 is most powerful on-demand password manager on the market. LastPass 3.0 Premium includes mobile support and more features. Dashlane 2.0 is is not as robust, but includes a user-friendly interface. F-Secure Key is a free, one-device version of these top competitors. F-Secure Key is for exclusive use on an installed device, so password safe retention is dependent on proprietary use of the device itself. The application can be upgraded for a small annual fee.

Password Manager App Cross-Portability
F-Secure Key syncs with Mac, PC Android, and iOS devices simultaneously. A transient code is generated on mobile devices, in addition to the two-factor authentication default of the F-Secure Key master password security product.

Password capture and replay in case of lost credentials is made possible with a password manager. Integration of a password manager app with a browser allows a user to capture login credentials, and replay on revisit to a site. Dashlane, LastPass, Norton Identity Safe, Password Genie 4.0 offer continuous detection and management of password change events, automatically capturing credentials each time a new Web-based, service registration sign up is completed.

Other applications like F-Secure Key, KeePass, and My1login replay passwords via a bookmarklet, supported by any Java-equipped browser. KeePass ups the ante for would be keyloggers, with a unique replay technology.

Personal Data and Auto-Fill Forms
Most password managers fill username and password credentials into login forms automatically. Password managers also retain personal data for form fill interfaces with applications, and other HTML forms online. The RoboForm app is one of the most popular for its flexibility in multi-form password and personal data management, but the others also capture and reuse at least a portion of what has been entered in a form manually.

The 1Password app for Windows stores the most types of personal data for use to fill out forms. Dashlane, LastPass, and Password Genie store the various types of ID data used for form fill-in, like passport and driver's license numbers and other key details to HTML acknowledgement of discretionary password and personal information.

The Cost of Protection
LastPass Premium and Password Box are the lowest monthly password manager plans on the market, going for $1 a month. Annual plans offered by other password manager sources vary according to internal plan: Dashlane $20, F-Secure Key $16, and Password Genie, $15.
All password manager companies and their products may not be alike in the end.

Security checks on security products like password managers have become more sophisticated in response to product cross-portability and open source app interface volatility. Norton, RoboForm, KeePass, generate strong, random passwords on-demand. Some security procedures now require three-factor authentication, which involves possession of a physical token and a password, used in conjunction with biometricdata, such as finger-scanningor a voiceprint.

What are the best languages for getting into functional programming?

Computer Programming as a Career?

The original article was posted by Michael Veksler on Quora

A very well known fact is that code is written once, but it is read many times. This means that a good developer, in any language, writes understandable code. Writing understandable code is not always easy, and takes practice. The difficult part, is that you read what you have just written and it makes perfect sense to you, but a year later you curse the idiot who wrote that code, without realizing it was you.

The best way to learn how to write readable code, is to collaborate with others. Other people will spot badly written code, faster than the author. There are plenty of open source projects, which you can start working on and learn from more experienced programmers.

Readability is a tricky thing, and involves several aspects:

1. Never surprise the reader of your code, even if it will be you a year from now. For example, don’t call a function max() when sometimes it returns the minimum().
2. Be consistent, and use the same conventions throughout your code. Not only the same naming conventions, and the same indentation, but also the same semantics. If, for example, most of your functions return a negative value for failure and a positive for success, then avoid writing functions that return false on failure.
3. Write short functions, so that they fit your screen. I hate strict rules, since there are always exceptions, but from my experience you can almost always write functions short enough to fit your screen. Throughout my carrier I had only a few cases when writing short function was either impossible, or resulted in much worse code.
4. Use descriptive names, unless this is one of those standard names, such as i or it in a loop. Don’t make the name too long, on one hand, but don’t make it cryptic on the other.
5. Define function names by what they do, not by what they are used for or how they are implemented. If you name functions by what they do, then code will be much more readable, and much more reusable.
6. Avoid global state as much as you can. Global variables, and sometimes attributes in an object, are difficult to reason about. It is difficult to understand why such global state changes, when it does, and requires a lot of debugging.
7. As Donald Knuth wrote in one of his papers: “Early optimization is the root of all evil”. Meaning, write for readability first, optimize later.
8. The opposite of the previous rule: if you have an alternative which has similar readability, but lower complexity, use it. Also, if you have a polynomial alternative to your exponential algorithm (when N > 10), you should use that.

Use standard library whenever it makes your code shorter; don’t implement everything yourself. External libraries are more problematic, and are both good and bad. With external libraries, such as boost, you can save a lot of work. You should really learn boost, with the added benefit that the c++ standard gets more and more form boost. The negative with boost is that it changes over time, and code that works today may break tomorrow. Also, if you try to combine a third-party library, which uses a specific version of boost, it may break with your current version of boost. This does not happen often, but it may.

Don’t blindly use C++ standard library without understanding what it does - learn it. You look at std::vector::push_back() documentation at it tells you that its complexity is O(1), amortized. What does that mean? How does it work? What are benefits and what are the costs? Same with std::map, and with std::unordered_map. Knowing the difference between these two maps, you’d know when to use each one of them.

Never call new or delete directly, use std::make_unique and [cost c++]std::make_shared[/code] instead. Try to implement usique_ptr, shared_ptr, weak_ptr yourself, in order to understand what they actually do. People do dumb things with these types, since they don’t understand what these pointers are.

Every time you look at a new class or function, in boost or in std, ask yourself “why is it done this way and not another?”. It will help you understand trade-offs in software development, and will help you use the right tool for your job. Don’t be afraid to peek into the source of boost and the std, and try to understand how it works. It will not be easy, at first, but you will learn a lot.

Know what complexity is, and how to calculate it. Avoid exponential and cubic complexity, unless you know your N is very low, and will always stay low.

Learn data-structures and algorithms, and know them. Many people think that it is simply a wasted time, since all data-structures are implemented in standard libraries, but this is not as simple as that. By understanding data-structures, you’d find it easier to pick the right library. Also, believe it or now, after 25 years since I learned data-structures, I still use this knowledge. Half a year ago I had to implemented a hash table, since I needed fast serialization capability which the available libraries did not provide. Now I am writing some sort of interval-btree, since using std::map, for the same purpose, turned up to be very very slow, and the performance bottleneck of my code.

Notice that you can’t just find interval-btree on Wikipedia, or stack-overflow. The closest thing you can find is Interval tree, but it has some performance drawbacks. So how can you implement an interval-btree, unless you know what a btree is and what an interval-tree is? I strongly suggest, again, that you learn and remember data-structures.

These are the most important things, which will make you a better programmer. The other things will follow.