Software

10 Shock Bundle Licenses Giveaway from ThemeShock

The popular open source project GraphLab received a major boost early this week when a new company comprised of its founding developers, raised funding to develop analytic tools for graph data sets. GraphLab Inc. will continue to use the open …

For more than one scenario, the developer might want to have access to the pictures stored in the device photo hub. That can be done in two ways - either by using PhotoChooserTask which is the most common way to retrieve the image content, given that the user himself will select the single entity that needs to be read, or with the help of MediaLibrary - an XNA sub-layer that allows direct access to the media directory.

Advertise here with BSA Creating a logo is one of the most difficult processes for a designer, because it must be able to find the right mix between graphic symbols and typographic that is able to identify a company or product in order to differentiate it from its competitors on the market. The design is not stops at the graphics, but it requires a study on a communicative level, because the logo should convey a message unique, safe and precise, but it must also be original, compact and adaptable. Here are 10 basic rules that I suggest you follow for the creation of an effective logo.

Please welcome another of my Infodev blogging comrades, Brenda, to the Oracle blogosphere. Check out her typewriter-girl-turned-into-technical-support post. [Read More]

The SaaS & Software Daily News is out!

As a heavy java programmer, most of the time I encounter a problem where I have two lists and need to find out the differences between these two. One of the ways I sometimes quickly find out the difference is: To print out the list and then use microsoft excel to compare the two columns. Upload the file to temporary database tables and the run SQL query to find out the difference As I started encountering the list compare more often, I thought of writing a tool that takes two lists and then simply print out the differences. Thus I coded the following simple piece of java program to achieve this. The following program: Can take an input of two ArrayLists presumably containing Strings, numbers of mix of both It then compares the two lists and then prints out all items from first list which are not in the second lists and also prints out the items in second lists which are not in the first list I can now use this program as often as I want and solves the hassle of me having to upload the data to database for compare or even import to excel to do the same. Most of the programs from my blog come from my real world working experience. They are simple programs but sometimes save your huge time. Feel free to copy and modify any of the programs for your own use. Everything is open sourced and free in my blog package com.kushal.tools; import java.util.ArrayList; import java.util.HashMap; import java.util.Iterator; import java.util.List; import java.util.Map; /** * @author Kushal Paudyal Last Modified On 2011-09-16 * * This simple utility compares two String or number lists or a list * that contains either strings or number and then prints out a list of * items that are in first list but not in the second list and also a * list of items that are in second list but not in the first list. */ public class ListCompare { public static void main(String args[]) { List listA = new ArrayList(); listA.add(1); listA.add(2); listA.add("Kushal"); listA.add("Madan"); listA.add("Pooja"); listA.add("Kripa"); List listB = new ArrayList(); listB.add(2); listB.add(3); listB.add("Kushal"); listB.add("Madan"); listB.add("Jenny"); listB.add("Betsy"); ListCompare listComp = new ListCompare(); listComp.compareLists(listA, listB); } public void compareLists(List firstList, List secondList) { Map mapForFirstList = new HashMap(); Map mapForSecondList = new HashMap(); Iterator firstListIterator = firstList.iterator(); Iterator secondListIterator = secondList.iterator(); while (firstListIterator.hasNext()) { String firstListKeyValue = firstListIterator.next().toString(); /** * Put the value from the list into the map, only if the same value * already does not exists. That means if there are duplicates, we * put only one instance into the hashmap. */ if (!mapForFirstList.containsKey(firstListKeyValue)) { mapForFirstList.put(firstListKeyValue, firstListKeyValue); } } while (secondListIterator.hasNext()) { String secondListKeyValue = secondListIterator.next().toString(); /** * Put the value from the list into the map, only if the same value * already does not exists. That means if there are duplicates, we * put only one instance into the hashmap. */ if (!mapForSecondList.containsKey(secondListKeyValue)) { mapForSecondList.put(secondListKeyValue, secondListKeyValue); } } compareAndPrintResults(mapForFirstList, mapForSecondList); } private void compareAndPrintResults(Map mapForFirstList, Map mapForSecondList) { /** Compare first map against the second one and print the difference **/ printItemsFromFirstListThatAreNotOnSecondList(mapForFirstList, mapForSecondList); /** Compare second map against the first and print the difference */ printItemsFromSecondListThatAreNotOnFirstList(mapForSecondList, map

This paper presents a method of iOS data recovery by extracting data image directly from low level NAND storage and analyzing the redundancy caused by its FTL behavior. An on-device brute-force method is adopted to address the passcode encryption issue which is identified as a block on current iOS forensic procedure. Further analysis on Garbage Collection Strategy adopted by iOS devices could provide certain guidance to iOS data recovery personnel.

Deploying muti-tier business, retail, financial or social networks on the computing cloud is a complex, expensive and challenging task. While frameworks such as Software as a Service (SaaS) or Platform as a Service (PaaS) appear to offer a pathway to rapid deployment, on closer examination these approaches are both language-specific and architecture-specific, and often tied to a vendor through use of predefined application templates. The authors propose a new approach to constructing, deploying and optimizing complex cloud-based applications in a language-independent and vendor-neutral manner, allowing rapid prototyping of business applications in a manner that assists targeted performance optimization. The proposed approach, Cloud Component Model (CCM), relies on logical functional decomposition of the application, utilizing loosely coupled components in a manner that realizes the promise of the cloud, while freeing the design from the restrictive constraints of a particular programming style or architectural pattern. Our experience using a complex e-Commerce benchmark provides describes CCM's application and resulting benefits in terms of reduction in prototyping time, testing cost, and performance.

I use RSS feeds to keep up with academic journals. Because of an undocumented and unexpected feature (bug?) in my (otherwise wonderful) free software newsreader NewBlur, many articles published over the last year were marked as having been read before I saw them. Over the last week, I caught up. I spent hours going through abstracts and downloading papers that looked interesting or relevant to my research. Because I did this for hundreds of articles, it gave me an unusual opportunity to reflect on my journal reading practices in a systematic way. On a number of occasions, there were potentially interesting articles in non-open access journals that neither MIT nor Harvard subscribes to and that were otherwise not accessible to me. In several cases where the research was obviously important to my work, I made an interlibrary request, emailed the papers’ authors for copies, or tracked down a colleague at an institution with access. Of course, articles that look potentially interesting from the title and abstract often end up being less relevant or well executed on closer inspection. I tend to cast a wide net, skim many articles, and put them aside when it’s clear that the study is not for me. This week, I downloaded many of these possibly relevant papers to, at least, give a skim. But only if I could download them easily. On three or four occasions, I found inaccessible articles at this margin of relevance. In these cases, I did not bother trying to track down the articles. Of course, what appear to be marginally relevant articles sometimes end up being a great match for my research and I will end up citing and building on the work. I found several suprisingly interesting papers last week. The articles that were locked up have no chance at this. When people suggest that open access hinders the spread of scholarship, a common retort is that the people who need the work have or can finagle access. For the papers we know we need, this might be true. As someone with access to two of the most well endowed libraries in academia who routinely requests otherwise inaccessible articles through several channels, I would have told you, a week ago, that locked-down journals were unlikely to keep me from citing anybody. So it was interesting watching myself do a personal cost calculation in a way that sidelined published scholarship — and that open access publishing would have prevented. At the margin of relevance to ones research, open access may make a big difference.