Articles having tag: J2SE

String Searching Algorithms (Part III)

Boyer-Moore (BM) Overview According to Wikipedia, the Boyer-Moore algorithm "is an efficient string searching algorithm that is the standard benchmark for practical string search literature. It was developed by Robert S. Boyer and J Strother Moore...

Java or J2EE : the Name Matters

By larryjava

| 010 years ago, when we were decided to use Java technology to create a new application, for use at Amway Corp; we thought it was sufficient to say, "We are using Java!". We were wrong... We quickly realized that there was Java 2 Standard Edition and there...

String Searching Algorithms (Part II)

By potty

Knuth-Morris-Pratt (KMP) Overview According to Wikipedia, the Knuth-Morris-Pratt algorithm "searches for occurrences of a "word" W within a main "text string" S by employing the observation that when a mismatch occurs, the word itself embodies...

Easy-Cassandra 1.0.9: With annotations jpa and JPQL

By otaviojava

| 0Release the newest version of the framework to persist objects in Apache Cassandra in easy way. Among improvement is the JPA annotations, also JPQL. JCassandra jCassandra=persistence.createJCassandra("select * from Person");\xa0List<Person>...

String Searching Algorithms (Part I)

By potty

String searching algorithm (SSA) According to Wikipedia, string searching algorithms are "an important class of string algorithms that try to find a place where one or several strings (also called patterns) are found within a larger string or text". Some...

Building OpenJDK 7 on Ubuntu 11.10

By frank_ding

| 0 Building OpenJDK on Linux is fairly straight forward compared to Windows especially when Synaptic comes to help. My Linux is a Ubuntu 11.10 on VirtualBox. See output of uname $ uname -a Linux frank-VirtualBox 3.0.0-12-generic #20-Ubuntu...

Fibonacci (1000000000) Challenge

By kabutz

| 0We all know the standard Fibonacci recursive algorithm: public BigInteger f(int n) { if (n == 0) return BigInteger.ZERO; if (n == 1) return BigInteger.ONE; return f(n - 1).add(f(n - 2)); } Your challenge is to find the first 10...

Knowing more about Easy-Cassandra Project

By otaviojava

| 998 Easy-Cassandra is a framework ORM API and a high client for Apache Cassandra in java, with this is possible persist information from the Java Object in easy way. For this is only necessary...

Java Mind Gymnastics

By kabutz

| 0I like a good Java puzzle. The trickier the better. In this article I will tell you about a new set of puzzles by Wouter Coekaerts that will melt your Java brain. About five years ago, I was suckered into participating in a Java Black Belt competition...

Dealing with real-time data in UIs (and others)

By carcassi

5127 | 0I've been working for a number of years now in theNSLS-IIControl System group, creating tools that hook up to the control system. What I do is soft-real time stuff (I can drop data on the floor, I don't have hard latency requirements, etc.) mostly...