Visualizing content from metadata stores

Last Friday with ALG and DITA people we put a brief presentation for NCSA’s cyberarch group on our common efforts to create a generic framework for querying and visualizing content stored in metadata stores. Mulgara, SOAP, XLSTs, and custom Java code to render content using Prefuse and JFreeChart. You can download the slides here.

Apr 15, 2007 · 1 min · 54 words · Xavier Llorà

Communication gap management for fertile community

by Naohiro Matsumura, David E. Goldberg, and Xavier Llorà (2006). Journal of Soft Computing, Volume 11 , Issue 8, pp. 791–798, ACM press. Link to the ACM portal. Initial work also available as IlliGAL TR No 2005001. Abstract In the paper, we first present an approach to extract social networks from message boards on the Internet. Then we propose communication gaps based on structural features of the social networks as an indicator of understanding the state of communication. After we classify 3,000 social networks into three types of communication, i.e., interactive communication, distributed communication, and soapbox communication, we suggest communication gap management to identify the types of communication, the roles of individuals, and important ties, all of which can be used for drawing up a plan for realizing fertile community. ...

Mar 24, 2007 · 1 min · 130 words · Xavier Llorà

Toward routine billion-variable optimization using genetic algorithms

by Goldberg, D. E., Sastry, K., and Llorà X. (2007). Complexity, 12(3), 27—29. Link to the PDF. Abstract: The push for better understanding and design of complex systems requires the solution of challenging optimization problems with large numbers of decision variables. This note presents principled results demonstrating the scalable solution of a difficult test function on instances over a billion variables using a parallel implementation of a genetic algorithm (GA). The problem addressed is a noisy, blind problem over a vector of binary decision variables. Noise is added equaling a tenth of the deterministic objective function variance of the problem, thereby making it difficult for simple hillclimbers to find the optimal solution. The genetic algorithm used - the compact GA - is able to find the optimum in the presence of noise quickly, reliably, and accurately, and the solution scalability follows known convergence theories. These results on noisy problem together with other results on problems involving varying modularity, hierarchy, and overlap foreshadow routine solution of billion-variable problems across the landscape of complexity science. ...

Jan 18, 2007 · 1 min · 173 words · Xavier Llorà

GECCO 2007 deadline extended

The 2007 Genetic and Evolutionary Computation Conference submission deadline has been extended from Wednesday, January 17 to WEDNESDAY JANUARY 31, 22:00 Pacific Standard Time.

Jan 16, 2007 · 1 min · 24 words · Xavier Llorà

CEC 2007 deadline

The deadline for the Congres on Evolutionary Computation (CEC 2007) deadline for paper submission is March 15, 2007.

Jan 14, 2007 · 1 min · 18 words · Xavier Llorà