Modeling enterprise service-oriented architectural styles

Modern enterprise consists of complicate business processes and systems. The Enterprise Service-Oriented Architecture (ESOA) becomes an important architectural style that defines the principles for coping with the complexity of designing and implementing business systems. This paper classifies ESOA styles to six substyles and proposes a generic and abstract model for ESOA styles. The model consists of seven sets: services, service consumers, service data, infrastructure, processes, management and quality attributes. This paper formally defines each set and their relationships in ESOA style model, and discusses the roles of these sets. The model can be applied to specify various ESOA styles. As case studies, the definition of instance of ESOA style is applied to analyze and evaluate a Java component-based ESOA-style architecture and several other ESOA-style architectures. Finally, this paper concludes by comparing the proposed model with related ESOA models.     

2DVTE: A two-directional videotext extractor for rapid and elaborate design

In video indexing and summarization, videotext is the very compact and accurate information. Most videotext detection and extraction methods only deal with the static videotext on video frames. Few methods can handle motion videotext efficiently since motion videotext is hardly extracted well. In this paper, we propose a two-directional videotext extractor, called 2DVTE. It is developed as an integrated system to detect, localize and extract the scrolling videotexts. First, the detection method is carried out by edge information to classify regions into text and non-text regions. Second, referring to the localization on scrolling videotext, we propose the two-dimensional projection profile method with horizontal and vertical edge map information. Considering the characteristics of Chinese text, the vertical edge map is used to localize the possible text region and horizontal edge map is used to refine the text region. Third, the extraction method consists of dual mode adaptive thresholding and multi-seed filling algorithm. In the dual mode adaptive thresholding, it produces the non-rectangle pattern to divide the background and foreground more precisely. Referring to the multi-seed filling algorithm, it is based on the consideration of the minimum and maximum length and four directions of the stroke while the previous method only considers the minimum length and two directions of the stroke. With this multi-seed exploitation on strokes, precise seeds are obtained to produce more sophisticated videotext. Considering high throughput and the low complexity issue, we can achieve a real-time system on detecting, localizing, and extracting the scrolling videotexts with only one frame usage instead of multi-frame integration in other literatures. According to the experiment results on various video sequences, all of the horizontal and vertical scrolling videotexts can be extracted precisely. We also make comparisons with other methods. In our analysis, the performance of our algorithm is superior to other existing methods in speed and quality.     

Applying web-enabled self-regulated learning and problem-based learning with initiation to involve low-achieving students in learning

Vocational degree earners represent a major portion of the work force in Taiwan. However, vocational education in Taiwan is highly competitive in that it must attract sufficient student enrollment in an environment with a rapidly increasing number of schools. In this context, many vocational students tend to have lower levels of academic achievement. Under such constraints but moving toward more practical orientation, the authors conducted a quasi-experiment to examine the effects of applying web-based self-regulated learning (SRL), web-based problem-based learning (PBL) with initiation, and their combination to help these low-achieving students be involved positively in their learning. Four classes in successive years, with a total of 177 third-year students, were divided into 2 (SRL vs. non-SRL) × 2 (PBL with initiation vs. PBL without initiation) experimental groups. Results were generally positive. The authors further discuss the implications for schools, particularly vocational schools, and for scholars and teachers concerned about e-learning.     

The research on mechanism of color management system based on iCAM color appearance model

Since color recording and color representing abilities of various media are very different, color information is often lost or misrepresented in the process of image transmission and reproduction. A Color Management System (CMS) based on iCAM color appearance model is presented in this paper. It can be used either in computer operation system software or application software for obtaining color consistency across different software applications, imaging devices, imaging media and viewing conditions.     

A personal Web page tailoring toolkit for mobile devices

It is common to browse web pages via mobile devices. However, most of the web pages were designed for desktop computers equipped with big screens. When browsing on mobile devices, a user has to scroll up and down to find the information they want because of the limited screen size. Some commercial products reformat web pages. However, the result pages still contain irrelevant information. We propose a system to personalize users’ mobile web pages. A user can determine which blocks in a web page should be retained. The sequence of these blocks can also be altered according to individual preferences.     

Roaming across wireless local area networks using SIM-based authentication protocol

Wireless local area networks provide high speed data transferring rate to a mobile device. And it is crucial to integrate together two critical issues, the authentication and roaming in heterogeneous networks. For this, Tsai and Chang proposed a SIM-based authentication mechanism for wireless local area networks in 2006. Tsai and Chang's scheme provides an integration method of mobile cellular networks and wireless local area networks. Unfortunately, we found that there are some weaknesses existing in their scheme. In this paper, we propose an improved version for a user roaming in heterogeneous networks. Besides, we also proposed a mobile IP model to provide a better efficiency for a mobile user in WLAN environment.     

Tool support for learning Büchi automata and linear temporal logic

We introduce a graphical interactive tool, named GOAL, that can assist the user in understanding Büchi automata, linear temporal logic, and their relation. Büchi automata and linear temporal logic are closely related and have long served as fundamental building blocks of linear-time model checking. Understanding their relation is instrumental in discovering algorithmic solutions to model checking problems or simply in using those solutions, e.g., specifying a temporal property directly by an automaton rather than a temporal formula so that the property can be verified by an algorithm that operates on automata. One main function of the GOAL tool is translation of a temporal formula into an equivalent Büchi automaton that can be further manipulated visually. The user may edit the resulting automaton, attempting to optimize it, or simply run the automaton on some inputs to get a basic understanding of how it operates. GOAL includes a large number of translation algorithms, most of which support past temporal operators. With the option of viewing the intermediate steps of a translation, the user can quickly grasp how a translation algorithm works. The tool also provides various standard operations and tests on Büchi automata, in particular the equivalence test which is essential for checking if a hand-drawn automaton is correct in the sense that it is equivalent to some intended temporal formula or reference automaton. Several use cases are elaborated to show how these GOAL functions may be combined to facilitate the learning and teaching of Büchi automata and linear temporal logic. This work was partially supported by the National Science Council, Taiwan (R.O.C.) under grants NSC94-2213-E-002-089, NSC95-2221-E-002-127, NSC95-3114-P-001-001-Y02 (iCAST 2006), NSC96-3114-P-001-002-Y (iCAST 2007), and NSC97-2221-E-002-074-MY3.     

Femtosecond laser-induced silicon surface morphology in water confinement

This article investigates the use of femtosecond laser induced surface morphology on silicon wafer surface in water confinement. Unlike irradiation of silicon surfaces in the air, there are no laser induced periodic structures, but irregular roughness is formed when the silicon wafer is ablated under water. The unique discovery of a smoothly processed silicon surface in water confinement under certain laser parameter combinations may help improve laser direct micromachining surface quality in industrial applications.     

Improving peer-to-peer search performance through intelligent social search

As a large amount of information is added onto the Internet on a daily basis, the efficiency of peer-to-peer (P2P) search has become increasingly important. However, how to quickly discover the right resource in a large-scale P2P network without generating too much network traffic remains highly challenging. In this paper, we propose a novel P2P search method, by applying the concept of social grouping and intelligent social search; we derive peers into social groups in a P2P network to improve search performance. Through a super-peer-based architecture, we establish and maintain virtual social groups on top of a P2P network. The interactions between the peers in the P2P network are used to incrementally build the social relationships between the peers in the associated social groups. In such a P2P network, a search query is propagated along the social groups in the overlay social network. Our preliminary experiments have demonstrated that our method can significantly shorten search routes and result in a higher peer search performance. In addition, our method also enhances the trustworthiness of search results because searches go through trusted peers.     

A time-efficient pattern reduction algorithm for k-means clustering

This paper presents an efficient algorithm, called pattern reduction (PR), for reducing the computation time of k-means and k-means-based clustering algorithms. The proposed algorithm works by compressing and removing at each iteration patterns that are unlikely to change their membership thereafter. Not only is the proposed algorithm simple and easy to implement, but it can also be applied to many other iterative clustering algorithms such as kernel-based and population-based clustering algorithms. Our experiments—from 2 to 1000 dimensions and 150 to 10,000,000 patterns—indicate that with a small loss of quality, the proposed algorithm can significantly reduce the computation time of all state-of-the-art clustering algorithms evaluated in this paper, especially for large and high-dimensional data sets.