This paper addresses conceptual modeling and automatic code generation for search engine integration with data intensive Web applications. We have analyzed the similarities (and differences) between IR and database systems to extend an existing domain specific language for data-driven Web applications. The extended Web modeling language specifies the search engine’s index schemas based on the d...

This paper summarises activities from the iCLEF 2009 task. As in 2008, the task was organised based on users participating in an interactive cross-language image search experiment. Organizers provided a default multilingual search system (Flickling) which accessed images from Flickr, with the whole iCLEF experiment run as an online game. Interaction by users with the system was recorded in log ...

Recently several robust control designs have been proposed to the load-frequency control (LFC) problem. However, the importance and difficulties in the selection of weighting functions of these approaches and the pole-zero cancellation phenomenon associated with it produces closed loop poles. Also the order of robust controllers is as high as the plant. This gives rise to complex structure of s...

This work describes the evaluation of several search algorithms , based on optimizing neural networks, as applied to a family of problems : the generation of block-designs. Given a set (v; b; u) of parameters (v rows, b columns and u ones), a block design is any v b-binary con guration that has the following properties: u ones, r ones per row, k ones per column, and correlation between pairs of...

Complex design problems are typically decomposed into smaller design problems that are solved by domain-specific experts who must then coordinate their solutions into a satisfactory system-wide solution. In set-based collaborative design, collaborating engineers coordinate themselves by communicating multiple design alternatives at each step of the design process. Previous research has demonstr...

Some new amicable orthogonal designs of order 8 are found as part of a complete search of the equivalence classes for orthogonal designs OD(8; 1, 1, 1, 1), OD(8; 1, 1, 1, 4), OD(8; 1, 1, 2, 2), OD(8; 1, 1, 1, 2), OD (8; 1, 1, 2, 4), OD(8; 1, 1, 1, 3), OD(8; 1, 1, 2, 3), OD(8; 1, 1, 1, 5) and OD(8; 1, 1, 3, 3). 2000 Mathematics subject classification (Amer. Math. Soc.): 05B30, 15A36.