Can predicate-argument structures be used for contextual opinion retrieval from blogs?

We present the results of our investigation on the use of predicate-argument structures for contextual opinion retrieval. The use of predicate-argument structure for opinion retrieval is a novel approach that exploits the grammatical derivation of sentences to show contextual and subjective relevance. We do not use frequency of certain keywords as it is usually done in keyword-based opinion retrieval approaches. Rather, our novel solution is based on frequency of contextually relevant and subjective sentences. We use a linear relevance model that leverages semantic similarities among predicate-argument structures of sentences. Thus, this paper presents the evaluation results of the linear relevance model. The model does a linear combination of a popular relevance model, our proposed transformed terms similarity model, and the absolute value of a sentence subjectivity scoring scheme. The predicate-argument structures are derived from the grammatical derivations of natural language query topics and the well formed sentences from blog documents. The derived predicate-argument structures are then semantically compared to compute an opinion relevance score. Our scoring technique uses the highest frequency of semantically related predicate-argument structures enriched with the total subjectivity score from sentences. Evaluation and experimental results show that predicate-argument structures can indeed be used for contextual opinion retrieval as it improves performance of opinion retrieval task by 15% over the popular TREC baselines.     

A Coarse-Grained Parallel Algorithm for the All-Substrings Longest Common Subsequence Problem

Given two strings A and B of lengths n_a and n_b, respectively, the All-substrings Longest Common Subsequence (ALCS) problem obtains, for any substring B' of B, the length of the longest string that is a subsequence of both A and B'. The sequential algorithm for this problem takes O(n_a n_b) time and O(n_b) space. We present a parallel algorithm for the ALCS problem on the Coarse-Grained Multicomputer (BSP/CGM) model with p < √n_a processors, that takes O(n_a n_b/p) time, O(log p) communication rounds and O(n_b √n_a) space per processor. The proposed algorithm also solves the basic Longest Common Subsequence (LCS) problem that finds the longest string (and not only its length) that is a subsequence of both A and B. To our knowledge, this is the best BSP/CGM algorithm in the literature for the LCS and ALCS problems.     

An efficient microfluidic sorter: implementation of double meandering micro striplines for magnetic particles switching

The ability to trap, manipulate, and separate magnetic beads has become one of the key requirements in realizing an integrated magnetic lab-on-chip biosensing system. In this article, we present the design and fabrication of an integrated magneto-fluidic device for sorting magnetic particles with a sorting efficiency of up to 95%. The actuation and manipulation of magnetic beads are realized using microfabricated square meandering current-carrying micro striplines. The current is alternated between two neighboring micro striplines to switch the magnetic beads to either one of the two outlets. We performed a series of parametric study to investigate the effect of applied current, flow rate, and switching frequency on the sorting efficiency. Experimental results reveal that the sorting efficiency is proportional to the square of current applied to the stripline, and decreases with increasing buffer flow rate and switching frequency. Such phenomena agree well with our theoretical analysis and simulation result. The fastest switching rate, which is limited by the microchannel geometry and bead velocity, is 2 Hz.     

Characteristics and usage patterns of older people in a 3D online multi-user virtual environment

3D online multi-user virtual environments (MUVEs) have a lot of potential in supporting older people in their daily lives, yet little research has been conducted to explore how older people engage with this type of technology. This paper aims to investigate the characteristics, user groups and activity patterns (particularly social networks and gift giving behaviour) of older users within a 3D online multi-user virtual environment. Data from approximately 5000 online user profiles of older and younger users from a 3D MUVE, namely IMVU, was collected for analysis. Overall, we identified several distinct patterns of use (e.g. size of social ties, level of reciprocity, etc.) among older users when compared with younger users. We also found that despite the capabilities of 3D MUVEs to provide the users immersion in alternative realities, a feature well embraced by younger users in this study, older users seemed more interested in activities which serve as an extension to their physical life.     

The roles of user motivation to perform a task and decision support system (DSS) effectiveness and efficiency in DSS use

The purposes of this study are to: (1) obtain measures of actual decision support system (DSS) use that include the three elements of DSS use proposed by Burton-Jones and Straub (Burton-Jones, A., & Straub, D.W., Jr., (2006). Reconceptualizing system usage: An approach and empirical test. Information Systems Research, 17(3), 228–246), and (2) identify an important psychological construct – a user’s motivation to perform a task – and examine how it interacts with two DSS characteristics – effectiveness and efficiency – to affect actual DSS use. As predicted, the findings indicated that individuals who used a more effective DSS to work on a task that they were motivated in increased usage of the DSS, while DSS use did not differ between individuals who used either a more or less effective DSS to complete a task that they were less motivated in. The results also showed significant difference for two measures of DSS use (i.e., STEP and TIME) and no significant difference for one measure of DSS use (i.e., USE) between individuals who used either a more or less efficient DSS to perform a task that they were more motivated in. As expected, significant differences were found for individuals who used either a more or less efficient DSS to complete a task that they were less motivated in. Finally, the results showed that DSS use increased when perceived ease of use and perceived usefulness of the DSS were high; therefore, these results corroborate the findings of prior research in the context of actual DSS use.     

IT2000: A critical appraisal of Singapore's state-wide strategic planning process for information technology

In April 1992, the Singapore Government announced its information technology (IT) vision and plan for the next 15 years to turn Singapore into ‘an intelligent island’, providing a strategic regional switching centre for expertise, goods, services and information. At the heart of this plan is a national information infrastructure that would capitalize on information as a key factor of production and an important ingredient for enhancing the quality of life of its people. Code named ‘IT2000’, the plan was developed by 60 senior managers at the National Computer Board in 1991 with participation and inputs from about 200 business and industry leaders, domain experts and academics. This paper describes the background of Singapore's drive into the information age, the IT2000 planning process, the roles of various participants and the main recommendations of the plan. An evaluation of IT2000 is made in terms of its objectives, its unanticipated results and its impacts on industry participants. Implications and lessons are drawn for strategic IT planning at the national or sectoral level.     

Universal approximation using incremental constructive feedforward networks with random hidden nodes

According to conventional neural network theories, single-hidden-layer feedforward networks (SLFNs) with additive or radial basis function (RBF) hidden nodes are universal approximators when all the parameters of the networks are allowed adjustable. However, as observed in most neural network implementations, tuning all the parameters of the networks may cause learning complicated and inefficient, and it may be difficult to train networks with nondifferential activation functions such as threshold networks. Unlike conventional neural network theories, this paper proves in an incremental constructive method that in order to let SLFNs work as universal approximators, one may simply randomly choose hidden nodes and then only need to adjust the output weights linking the hidden layer and the output layer. In such SLFNs implementations, the activation functions for additive nodes can be any bounded nonconstant piecewise continuous functions g:R/spl rarr/R and the activation functions for RBF nodes can be any integrable piecewise continuous functions g:R/spl rarr/R and /spl int//sub R/g(x)dx/spl ne/0. The proposed incremental method is efficient not only for SFLNs with continuous (including nondifferentiable) activation functions but also for SLFNs with piecewise continuous (such as threshold) activation functions. Compared to other popular methods such a new network is fully automatic and users need not intervene the learning process by manually tuning control parameters.     

A pictorial index mechanism for model-based matching

We are currently developing unified query processing strategies for image databases. To perform this task, model-based representations of images by content are being used, as well as a hierarchical generalization of a relatively new object-recognition technique called data-driven indexed hypotheses. As the name implies, it is index-based, from which its efficiency derives. Earlier approaches to data-driven model-based object recognition techniques were not capable of handling complex image data containing overlapping, partially visible, and touching objects due to the limitations of the features used for building models. Recently, a few data-driven techniques capable of handling complex image data have been proposed. In these techniques, as in traditional databases, iconic index structures are employed to store the image and shape representation in such a way that searching for a given shape or image feature can be conducted efficiently. Some of these techniques handle the insertion and deletion of shapes and/or image representations very efficiently and with very little influence on the overall system performance. However, the main disadvantage of all previous data-driven implementations is that they are main memory based. In the present paper, we describe a secondary memory implementation of data-driven indexed hypotheses along with some performance studies we have conducted.     

Color image segmentation using adaptive unsupervised clustering approach

This paper presents the Region Splitting and Merging-Fuzzy C-means Hybrid Algorithm (RFHA), an adaptive unsupervised clustering approach for color image segmentation, which is important in image analysis and in understanding pattern recognition and computer vision field. Histogram thresholding technique is applied in the formation of all possible cells, used to split the image into multiple homogeneous regions. The merging technique is applied to merge perceptually close homogeneous regions and obtain better initialization for the Fuzzy C-means clustering approach. Experimental results have demonstrated that the proposed scheme could obtain promising segmentation results, with 12% average improvement in clustering quality and 63% reduction in classification error compared with other existing segmentation approaches.