Cloud Platform at Google I/O - new Big Data, Mobile and Monitoring products By Greg DeMichillie, Google Cloud Platform team Today at Google I/O, we are introducing new services that help developers build and optimize data pipelines, create mobile applications, and debug, trace, and monitor their cloud applications in production. Introducing Google Cloud Dataflow A decade ago, Google invented MapReduce to process massive datasets using distributed computing. Berkeley DB Java Edition Oracle Berkeley DB Java Edition is an open source, embeddable, transactional storage engine written entirely in Java. It takes full advantage of the Java environment to simplify development and deployment. The architecture of Oracle Berkeley DB Java Edition supports very high performance and concurrency for both read-intensive and write-intensive workloads.
PyLab - Currently this page reflects the vision of KeirMierle , and not necessarily the community as a whole. By integrating consensus from mailing list discussions, I will refine and polish this vision and form a plan of action such that the community can move the numpy+scipy+ipython+matplotlib ensemble closer to the vision outlined below. See the following post for further discussion of the difference between the vision for a new PyLab expressed on this page, and the existing pylab package which is part of matplotlib: To make PyLab an easy to use, well packaged, well integrated, and well documented, numeric computation environment so compelling that instead of having people go to Python and discovering that it is suitable for numeric computation,
Singleton in Java – the proper way « The guy who does not speak… Update after some comments: this post is not a discussion whether to use Singleton or not. It’s not a discussion on why Singleton might be an anti-pattern. It’s just an example on an alternative implementation of Singleton in Java. Just that. There are two classic ways to implement Singleton pattern in Java: public final instance field or static factory method to create/get instance. AllegroGraph RDFStore Web 3.0's Database Geospatial and Temporal Reasoning AllegroGraph stores geospatial and temporal data types as native data structures. Combined with its indexing and range query mechanisms, AllegroGraph lets you perform geospatial and temporal reasoning efficiently. Social Networking Analysis AllegroGraph includes an SNA library that treats a triple-store as a graph of relations, with functions for measuring importance and centrality as well as several families of search functions. Example algorithms are nodal-degree, nodal-neighbors, ego-group, graph-density, actor-degree-centrality, group-degree-centrality, actor-closeness-centrality, group-closeness-centrality, actor betweenness-centrality, group-betweenness-centrality, page-rank-centrality, and cliques. Geospatial and temporal primitives combined with SNA functions form an Activity Recognition framework for flexibly analyzing networks and events in large volumes of structured and unstructured data.
mrb: What Is Declarative Programming? What Is Declarative Programming? Van Roy and Haridi have a way with definitions in Concepts, Techniques, and Models of Computer Programming (CTM), but interestingly, declarative computation and declarative programming get thrown around a lot in Chapter 2 before they are properly or even pithily defined. This post provides this definition and also looks closely at declarative programming as a paradigm: its benefits, its limitations, and how it impacts professional developers. We will also see how declarativeness relates to what is commonly understood as functional programming, and consider ways in which we can reach for declarativeness as a tool in our otherwise imperative code. A Definitional and Observational View In Chapters 1 and 2, before the practical application and programming techniques of declarative programming are discussed, we learn the paradigm through the semantics of a simple kernel language which is defined by its ability to "evaluate functions over partial values
Titan: Distributed Graph Database Titan is a scalable graph database optimized for storing and querying graphs containing hundreds of billions of vertices and edges distributed across a multi-machine cluster. Titan is a transactional database that can support thousands of concurrent users executing complex graph traversals in real time. In addition, Titan provides the following features: Download Titan or clone from GitHub. Read the Titan documentation and join the mailing list. <dependency><groupId>com.thinkaurelius.titan</groupId><artifactId>titan-core</artifactId><version>1.0.0</version></dependency><! scalalab - A Matlab like environment for Scala Since Google disabled creating new downloads, new downloads can be available from: ScalaLab is migrated with Google's automatic exporter to Github: Project Summary The ScalaLab project aims to provide an efficient scientific programming environment for the Java Virtual Machine. The scripting language is based on the Scala programming language enhanced with high level scientific operators and with an integrated environment that provides a MATLAB-like working style.
GEF Current Status The original project components Draw2d 3.x, GEF (MVC) 3.x, and Zest 1.x are still maintained but will not be developed further. Our main development effort is currently spent on building up the next generation components in terms of GEF4. GEF is participating in the annual Eclipse Simultaneous Release. NoSQL GraphDB I received some constructive criticism regarding my previous blog in NoSQL patterns that I covered only the key/value store but have left out Graph DB. The Property Graph Model A property graph is a collection of Nodes and Directed Arcs. Each node represents an entity and has an unique id as well as a Node Type. CPU Cache Essentials This post came to my mind after watching the excellent presentation of Scott Meyers called "CPU Caches and Why You care". This post will try to summarize the ideas of the presentation so if you have some spare time you can just watch the presentation on video. To emphasize importance of cpu caches in our daily work we start with 2 examples: The first problem is a simple traversing of 2 dimensional array. The way we can do this in c-like language is by traversing the array row by row. Alternatively we can traverse it column by column.
Representing time dependent graphs in Neo4j · SocioPatterns/neo4j-dynagraph Wiki Background Large-scale data collection efforts using wearable sensors to mine for proximity of individuals (for example, the SocioPatterns project) produce time-varying social graphs, where nodes are individuals, edges represent proximity/contact relations of individuals, and the proximity graph changes over time. Both nodes and edges can have rich attributes. Data formats for exchanging the time-dependent graphs are available, see for instance the GEXF format. Home - jHepWork Freedom to choose a programming language. Freedom to choose an operating system. Freedom to share your code. Enjoy the freedom of SCaVis.