Not getting any hits on your dating profile? It doesn’t mean you’re a loser. There are literally millions of computer dating profiles out there and dozens of free and paid websites to find a date. A dating profile is kind of like a resume for your personal life. To succeed, you have to learn a few tricks to stand out.

Tips to Improve Your Computer Dating Profile

1.  Make a Good First Impression

Filling out an online dating profile can be a daunting task. When you’re faced with all that blank space to write about yourself, it gets intimidating. The best way to improve your computer dating odds is to make a good first impression. Start with a good opening line such as a favorite quote or a personal motto you can easy build on.

Studying a functional programming language is a good way to discover new approaches to problems and different ways of thinking. Although functional programming has much in common with logic and imperative programming, it uses unique abstractions and a different toolset for solving problems. Likewise, many current mainstream languages are beginning to pick up and integrate various techniques and features from functional programming.

Many authorities feel that Haskell is a great introductory language for learning functional programming. However, there are various other possibilities, including Scheme, F#, Scala, Clojure, Erlang and others.

Haskell is widely recognized as a beautiful, concise and high-performing programming language. It is statically typed and supports various cool features that augment language expressivity, including currying and pattern matching. In addition to monads, the language support a type-class system based on methods; this enables higher encapsulation and abstraction. Advanced Haskell will require learning about combinators, lambda calculus and category theory. Haskell allows programmers to create extremely elegant solutions.

Scheme is another good learning language -- it has an extensive history in academia and a vast body of instructional documents. Based on the oldest functional language -- Lisp -- Scheme is actually very small and elegant. Studying Scheme will allow the programmer to master iteration and recursion, lambda functions and first-class functions, closures, and bottom-up design.

Supported by Microsoft and growing in popularity, F# is a multi-paradigm, functional-first programming language that derives from ML and incorporates features from numerous languages, including OCaml, Scala, Haskell and Erlang. F# is described as a functional language that also supports object-oriented and imperative techniques. It is a .NET family member. F# allows the programmer to create succinct, type-safe, expressive and efficient solutions. It excels at parallel I/O and parallel CPU programming, data-oriented programming, and algorithmic development.

Scala is a general-purpose programming and scripting language that is both functional and object-oriented. It has strong static types and supports numerous functional language techniques such as pattern matching, lazy evaluation, currying, algebraic types, immutability and tail recursion. Scala -- from "scalable language" -- enables coders to write extremely concise source code. The code is compiled into Java bytecode and executes on the ubiquitous JVM (Java virtual machine).

Like Scala, Clojure also runs on the Java virtual machine. Because it is based on Lisp, it treats code like data and supports macros. Clojure's immutability features and time-progression constructs enable the creation of robust multithreaded programs.

Erlang is a highly concurrent language and runtime. Initially created by Ericsson to enable real-time, fault-tolerant, distributed applications, Erlang code can be altered without halting the system. The language has a functional subset with single assignment, dynamic typing, and eager evaluation. Erlang has powerful explicit support for concurrent processes.

Computer Programming as a Career?

What little habits make you a better software engineer?

The name placard in your cube might not say anything about sales, but the truth is that everyone, employed as such or not, is a salesperson at some point every single day. In the traditional sense, this could mean something like pitching your company’s solutions to a client. In the less-traditional sense, it could mean convincing your child to eat their vegetables. Yet for those two drastically different examples and everything in between, there is a constant for successful sellers: unveiling the “Why.”

Spending time and energy making prospects understand why you do what you do instead of exactly what it is you do or how you do it is not a new concept. But I’m a firm believer that proven concepts, no matter how old and frequently referenced they are, can’t be repeated enough. This idea has recently and fervently been popularized by marketer, author, and thinker extraordinaire Simon Sinek via his 2009 book, Start With Why. You can learn about him here on Wikipedia or here on his site. To begin, let me suggest that you watch Sinek’s TED talk on Starting With Why here on YouTube before reading any further. I’ll let him take care of the bulk of explaining the basics, and then will offer some ideas of my own to back this up in the real world and explore the best ways to start thinking this way and apply it to your business.

First, a little on me. After all, if I were to practice what Sinek preaches, it would follow that I explain why it is I’m writing this piece so that you, the reader, not only have a good reason to pay attention but also understand what drives me on a deeper level. So, who am I? I’m an entrepreneur in the music space. I do freelance work in the realms of copywriting, business development, and marketing for artists and industry / music-tech folks, but my main project is doing all of the above for a project I’ve been on the team for since day one called Presskit.to. In short, Presskit.to builds digital portfolios that artists of all kinds can use to represent themselves professionally when pitching their projects to gatekeepers like label reps, casting directors, managers, the press, etc. This core technology is also applicable to larger entertainment industry businesses and fine arts education institutions in enterprise formats, and solves a variety of the problems they’re facing.

Not interesting? I don’t blame you for thinking so, if you did. That’s because I just gave you a bland overview of what we do, instead of why we do it. What if, instead, I told you that myself and everyone I work with is an artist of some sort and believes that the most important thing you can do in life is create; that our technology exists to make creators’ careers more easily sustainable. Or, another approach, that we think the world is a better place when artists can make more art, and that because our technology was built to help artists win more business, we’re trying our best to do our part. Only you can be the judge, but I think that sort of pitch is more compelling. It touches on the emotions responsible for decision making that Sinek outlines in his Ted Talk, rather than the practical language-based reasons like pricing, technicalities, how everything works to accomplish given goals, etc. These things are on the outside of the golden circle Sinek shows us for a reason – they only really matter if you’ve aligned your beliefs with a client’s first. Otherwise these kind of tidbits are gobbledygook, and mind-numbingly boring gobbledygook at that.

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 */