Perceptual image preview

Image preview is a convenient way to browse large or multiple images on small displays. However, current signal-level image resampling algorithms may remove many features of interest in the preview image. In this paper, we propose perceptual image preview which retains more perceptual features such that users can inspect features of interest by viewing the preview image only and without zooming in. This technology has two components, structure enhancement and perceptual feature visualization. Structure enhancement enhances the image structure while suppressing subtle details using a gradient modulation method, thus making the succedent perceptual features more apparent. For perceptual feature visualization, features of interest detected in the picture is visualized on the structure enhanced preview image. We demonstrate with two examples of most commonly used image quality features, image blur and noise. The effectiveness of the proposed method is validated by experimental results.     

Advanced product planning: a comprehensive process for systemic definition of new product requirements

This paper reports results of research into the definition of requirements for new consumer products––specifically, electro-mechanical products. The research dealt with the derivation of design requirements that are demonstrably aligned with stakeholder needs. The paper describes a comprehensive process that can enable product development teams to deal with statements of product requirements, as originally collected through market research activities, in a systematic and traceable manner from the early, fuzzy front end, stages of the design process. The process described has been based on principles of systems engineering. A case study from its application and evaluation drawn from the power sector is described in this paper. The case study demonstrates how the process can significantly improve product quality planning practices through revision of captured product requirements, analysis of stakeholder requirements and derivation of design requirements. The paper discusses benefits and issues from the use of the process by product development teams, and identifies areas for further research. Finally, the conclusions drawn from the reported research are presented.

Re-examining the causal structure of information technology impact research

About 20 years ago, Markus and Robey noted that most research on IT impacts had been guided by deterministic perspectives and had neglected to use an emergent perspective, which could account for contradictory findings. They further observed that most research in this area had been carried out using variance theories at the expense of process theories. Finally, they suggested that more emphasis on multilevel theory building would likely improve empirical reliability. In this paper, we reiterate the observations and suggestions made by Markus and Robey on the causal structure of IT impact theories and carry out an analysis of empirical research published in four major IS journals, Management Information Systems Quarterly (MISQ), Information Systems Research (ISR), the European Journal of Information Systems (EJIS), and Information and Organization (I&O), to assess compliance with those recommendations. Our final sample consisted of 161 theory-driven articles, accounting for approximately 21% of all the empirical articles published in these journals. Our results first reveal that 91% of the studies in MISQ, ISR, and EJIS focused on deterministic theories, while 63% of those in I&O adopted an emergent perspective. Furthermore, 91% of the articles in MISQ, ISR, and EJIS adopted a variance model; this compares with 71% from I&O that applied a process model. Lastly, mixed levels of analysis were found in 14% of all the surveyed articles. Implications of these findings for future research are discussed.     

Measuring information systems success: models,dimensions, measures,and interrelationships

Since DeLone and McLean (D&M) developed their model of IS success, there has been much research on the topic of success as well as extensions and tests of their model. Using the technique of a qualitative literature review, this research reviews 180 papers found in the academic literature for the period 1992–2007 dealing with some aspect of IS success. Using the six dimensions of the D&M model – system quality, information quality, service quality, use, user satisfaction, and net benefits – 90 empirical studies were examined and the results summarized. Measures for the six success constructs are described and 15 pairwise associations between the success constructs are analyzed. This work builds on the prior research related to IS success by summarizing the measures applied to the evaluation of IS success and by examining the relationships that comprise the D&M IS success model in both individual and organizational contexts.     

Test frame updating in CPM testing of Prolog programs

Category Partition Method (CPM) is a general approach to specification-based program testing, where test frame reduction and refinement are two important issues. Test frame reduction is necessary since too many test frames may be produced, and test frame refinement is important since during CPM testing new information about test frame generation may be achieved and considered incrementally. Besides the information provided by testers or users, implementation related knowledge offers alternative information for reducing and refining CPM test frames. This paper explores the idea by proposing a call patterns semantics based test frame updating method for Prolog programs, in which a call patterns analysis is used to collect information about the way in which procedures are used in a program. The updated test frames will be represented as constraints. The effect of our test frame updating is two-fold. On one hand, it removes “uncared” data from the original set of test frames; on the other hand, it refines the test frames to which we should pay more attention. The first effect makes the input domain on which a procedure must be tested a subset of the procedure’s input domain, and the latter makes testers stand more chance to find out the faults that are more likely to show their presence in the use of the program under consideration. Our test frame updating method preserves the effectiveness of CPM testing with respect to the detection of faults we care. The test case generation from the updated set of test frames is also discussed. In order to show the applicability of our method an approximation call patterns semantics is proposed, and the test frame updating on the semantics is illustrated by an example.

A methodology to incorporate product mix variations in cellular manufacturing

The identification of part families and machine groups that form the cells is a major step in the development of a cellular manufacturing system and, consequently, a large number of concepts, theories and algorithms have been proposed. One common assumption for most of these cell formation algorithms is that the product mix remains stable over a period of time. In today’s world, the market demand is being shaped by consumers resulting in a highly volatile market. This has given rise to a new class of products characterized by low volume and high variety. To incorporate product mix changes into an existing cellular manufacturing system many important issues have to be tackled. In this paper, a methodology to incorporate new parts and machines into an existing cellular manufacturing system has been presented. The objective is to fit the new parts and machines into an existing cellular manufacturing system thereby increasing machine utilization and reducing investment in new equipment.     

Stability and control of nonlinear systems described by retarded functional equations: a review of recent results

This paper reports on recent results in a series of the work of the authors on the stability and nonlinear control for general dynamical systems described by retarded functional differential and difference equations. Both internal and external stability properties are studied. The corresponding Lyapunov and Razuminkhin characterizations for input-to-state and input-to-output stabilities are proposed. Necessary and sufficient Lyapunov-like conditions are derived for robust nonlinear stabilization. In particular, an explicit controller design procedure is developed for a new class of nonlinear time-delay systems. Lastly, sufficient assumptions, including a small-gain condition, are presented for guaranteeing the input-to-output stability of coupled systems comprised of retarded functional differential and difference equations.     

Polarization discrimination between repeater false-target and radar target

High fidelity repeater false-target badly affects a radar system’s detecting, tracking, and data processing. It is an available approach of confronting false-target for radar that discriminates firstly and then eliminates. Whereas for the technique progress about the repeater false-target jam, it is more and more difficult to discriminate this jam in the time-domain, frequency-domain, or space-domain. The technique using polarization information to discriminate the target and false-target is discussed in th...     

Logic Programs,Compatibility and Forward Chaining Construction

Logic programming under the stable model semantics is proposed as a non-monotonic language for knowledge representation and reasoning in artificial intelligence. In this paper, we explore and extend the notion of compatibility and the Λ operator, which were first proposed by Zhang to characterize default theories. First, we present a new characterization of stable models of a logic program and show that an extended notion of compatibility can characterize stable submodels. We further propose the notion of weak auto-compatibility which characterizes the Normal Forward Chaining Construction proposed by Marek, Nerode and Remmel. Previously, this construction was only known to construct the stable models of FC-normal logic programs, which turn out to be a proper subclass of weakly auto-compatible logic programs. We investigate the properties and complexity issues for weakly auto-compatible logic programs and compare them with some subclasses of logic programs.