ACCU Home page ACCU Conference Page
Search Contact us ACCU at Flickr ACCU at GitHib ACCU at Google+ ACCU at Facebook ACCU at Linked-in ACCU at Twitter Skip Navigation

Programming Topics

Options:
View Article Map
View Archives
The Open–Closed Principle (OCP)
Description : Changing requirements and environments can require cascading changes through software. Nan Wang demonstrates how the Open-Closed principle can minimise changes.
Category: [ Overload Journal #113 - February 2013 ]
Secrets of Testing WCF Services
Description : WCF services provide middleware for applications but can be hard to test. Steve Love describes a way to develop a testable app.
Category: [ Overload Journal #113 - February 2013 ]
Web Annotation with Modified-Yarowsky and Other Algorithms
Description : Annotating text automatically requires word disambiguation. Silas Brown introduces the Yarowsky algorithm to help.
Category: [ Internet Topics | Overload Journal #112 - December 2012 ]
Complex Logic in the Member Initialiser List
Description : The syntactic form of the member initialiser list restricts the logic that it contains. Cassio Neri presents some techniques to overcome these constraints.
Category: [ Overload Journal #112 - December 2012 ]
-640K- 2^256 Bytes of Memory is More than Anyone Would Ever -Need- Get
Description : How fast can computers get? Sergey Ignatchenko provides us with some upper limits.
Category: [ Overload Journal #112 - December 2012 ]
Footprint on Modify
Description : Tracking history can be done in a variety of ways. Andy Balaam describes one technique with many advantages.
Category: [ Overload Journal #112 - December 2012 ]
Valgrind Part 5 – Massif
Description : Poor performance can be caused by memory usage. Paul Floyd introduces Valgrind’s heap memory profiling tool Massif.
Category: [ Overload Journal #112 - December 2012 ]
Valgrind Part 4: Cachegrind and Callgrind
Description : When your application is slow, you need a profiler. Paul Floyd shows us how callgrind and cachegrind can help.
Category: [ Overload Journal #111 - October 2012 ]
Universal References in C++11
Description : C++11 provides a new reference syntax, T&&. Scott Meyers explains that it doesn’t always mean ‘rvalue reference’.
Category: [ Overload Journal #111 - October 2012 ]
A DSEL for Addressing the Problems Posed by Parallel Architectures
Description : Programming parallel algorithms correctly is hard. Jason McGuiness and Colin Egan demonstrate how a C++ DESEL can make it simpler.
Category: [ Overload Journal #111 - October 2012 ]
Keep It Simple, Singleton!
Description : Naïve assumptions sound like a bad idea. Sergey Ignatchenko discusses how to spot good assumptions in the face of changing requirements.
Category: [ Overload Journal #111 - October 2012 ]
Valgrind Part 3: Advanced memcheck
Description : Valgrind provides several mechanisms to locate memory problems in your code. Paul Floyd shows us how to use them.
Category: [ Overload Journal #110 - August 2012 ]
Black-Scholes in Hardware
Description : The Black-Scholes model is a financial model. Wei Wang outlines its design and implementation for those who want to understand how algorithms can be implemented in hardware.
Category: [ Overload Journal #110 - August 2012 ]
Replace User, Strike Any Key?
Description : There is a common perception in the IT industry that the user is the primary source of all the problems. Sergey Ignatchenko asks if this is true.
Category: [ Overload Journal #110 - August 2012 ]
Simple Mock Objects for C++11
Description : New C++11 features can be used to implement mock objects for unit tests. Michael Rüegg shows us how he does this in Mockator.
Category: [ Overload Journal #110 - August 2012 ]
Large Objects and Iterator Blocks
Description : Arrays can cause memory issues in .Net. Frances Buontempo shows how iterator blocks can help to relieve the pressure.
Category: [ Overload Journal #110 - August 2012 ]
Programming Darwinism
Description : Have you ever thought your software had a life of its own? Sergey Ignatchenko wonders whether you might be right.
Category: [ Overload Journal #109 - June 2012 ]
What’s a Good Date?
Description : Implementing a data type seems simple at first glance. Björn Fahller investigates why you might choose a representation.
Category: [ Overload Journal #109 - June 2012 ]
Tail Call Optimisation in C++
Description : Stack based languages can be very powerful, but often can’t deal with arbitrary recursion. Andy Balaam finds a way around this limitation.
Category: [ Overload Journal #109 - June 2012 ]
All About XOR
Description : Boolean operators are the bedrock of computer logic. Michael Lewin investigates a common one and shows there’s more to it than meets the eye.
Category: [ Overload Journal #109 - June 2012 ]

  |<   <<   11   12   13   14   15   16   17   18   19   20   >>   >|
Sort by Date Title