A small listener for heterogeneous mobile devices: a service enabler with a uniform Web object view
We recently developed "system on mobile devices" (SyD) middleware for rapidly developing and deploying collaborative distributed applications over a collection of autonomous Web objects and data-stores, independent of the underlying device, data, or network. SyDListener is a key component of SyD middleware. SyDListener provides a set of interfaces and classes that allows distributed SyD-based application components to communicate seamlessly in mobile environments. SyDListener provides a uniform object view of the underlying server application and enables client applications to remotely invoke those methods using XML messages. SyDListener is implemented as a multi-threaded wrapper with simple persistence management and asynchronous invocation functionality for J2ME mobile information device profile (MIDP) on connected limited device configuration (CLDL) devices. We discuss the functionality, architecture, implementation, and performance of SyDListener. We believe it is the first comprehensive working prototype of its kind for Java-enabled handhelds with a small footprint of 10 KB.

title: Measuring the meaning in time series clustering of text search queries
abstract: We use a combination of proven methods from time series analysis and machine learning to explore the relationship between temporal and semantic similarity in web query logs; we discover that the combination of correlation and cycles is a good, but not perfect, sign of semantic relationship.

title: Assigning Unique Keys to Chemical Compounds for Data Integration: Some Interesting Counter Examples
abstract: Integrating data involving chemical structures is simplified when unique identifiers (UIDs) can be associated with chemical structures. For example, these identifiers can be used as database keys. One common approach is to use the Unique SMILES notation introduced in . The Unique SMILES views a chemical structure as a graph with atoms as nodes and bonds as edges and uses a depth first traversal of the graph to generate the SMILES strings. The algorithm establishes a node ordering by using certain symmetry properties of the graphs. In this paper, we present certain molecular graphs for which the algorithm fails to generate UIDs. Indeed, we show that different graphs in the same symmetry class employed by the Unique SMILES algorithm have different Unique SMILES IDs. We tested the algorithm on the National Cancer Institute (NCI) database [7] and found several molecular structures for which the algorithm also failed. We have also written a python script that generates molecular graphs for which the algorithm fails.

title: Incremental Clustering Based on Swarm Intelligence
abstract: We propose methods for incrementally constructing a knowledge model for a dynamically changing database, using a swarm of special agents (ie an ant colony) and imitating their natural cluster-forming behavior. We use information-theoretic metrics to overcome some inherent problems of ant-based clustering, obtaining faster and more accurate results. Entropy governs the pick-up and drop behaviors, while movement is guided by pheromones. The primary benefits are fast clustering, and a reduced parameter set. We compared the method both with static clustering (repeatedly applied), and with the previous dynamic approaches of other authors. It generated clusters of similar quality to the static method, at significantly reduced computational cost, so that it can be used in dynamic situations where the static method is infeasible. It gave better results than previous dynamic approaches, with a much-reduced tuning parameter set. It is simple to use, and applicable to continuously- and batch-updated databases.

title: WBEM Based Distributed Network Monitoring
abstract: In the paper we identify the needs in efficient management of distributed networks and some problematic areas in the field. Then we introduce Web Based Enterprise Management (WBEM) to address the problem of providing a unified way to model all kinds of managed elements in a single information model in heterogeneous network environments. The advantages brought about by the use of WBEM in network management solve some critical problems existing in current network management. Based on the brief description of components of WBEM, we discuss in depth the basic WBEM instrumentation and multi-tiered WBEM enabled management infrastructure. We also apply this multi-tiered management infrastructure to a network management application scenario to monitor network activities for unexpected behaviors.

title: Research on Service-Oriented Workflow and Performance Evaluation
abstract: The advent of SOA and Grid technology has brought new challenges to workflow operation and performance evaluation. In this paper, the characteristics of service-oriented workflow are presented, based on which the service-oriented workflow performance evaluation model is described and the performance analysis methods are depicted. Finally the design and implementation of our prototype system are introduced briefly.

title: Selector: A Language Construct for Developing Dynamic Applications
abstract: Fitting algorithms to meet input data characteristics and/or a changing computing environment is a tedious and error prone task. Programmers need to deal with code instrumentation details and implement the selection of which algorithm best suits a given data set. In this paper we describe a set of simple programming constructs for C that allows programmers to specify and generate applications that can select at run-time the best of several possible implementations based on measured run-time performance and/or algorithmic input values. We describe the application of this approach to a realistic linear solver for an engineering crash analysis code. The preliminary experimental results reveal that this approach provides an effective mechanism for creating sophisticated dynamic application behavior with minimal effort.