Automatic detection of breast cancers in mammograms using structured support vector machines

Breast cancer is one of the most common cancers diagnosed in women. Large margin classifiers like the support vector machine (SVM) have been reported effective in computer-assisted diagnosis systems for breast cancers. However, since the separating hyperplane determination exclusively relies on support vectors, the SVM is essentially a local classifier and its performance can be further improved. In this work, we introduce a structured SVM model to determine if each mammographic region is normal or cancerous by considering the cluster structures in the training set. The optimization problem in this new model can be solved efficiently by being formulated as one second order cone programming problem. Experimental evaluation is performed on the Digital Database for Screening Mammography (DDSM) dataset. Various types of features, including curvilinear features, texture features, Gabor features, and multi-resolution features, are extracted from the sample images. We then select the salient features using the recursive feature elimination algorithm. The structured SVM achieves better detection performance compared with a well-tested SVM classifier in terms of the area under the ROC curve.     

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.     

Efficient simulation of hard disk drive operational shock response using model order reduction

The complex structure, coupled mechanical and fluidic energy domains, and inherent nonlinearity of air bearing between slider and disk involved in the hard disk drive (HDD) are normally presented as a large scale problem which will result in very heavy computational costs in terms of intensive computation and time consuming for HDD research communities and industries to carry out the transient dynamic simulation for HDD design verification, performance analysis, and optimization by using the traditional full-order models, such as finite element model (FEM). This paper presents a method of application of model order reduction (MOR) technique to dramatically reduce the computation time for HDD transient shock performance analysis while capturing the behaviors of original problem faithfully. The reduced models are obtained by performing MOR directly to the FEMs through Krylov subspace and Arnoldi algorithm. The transient operational shock response results of the reduced models of a head suspension assembly (HSA) subjected to half-sine shock pulse demonstrate that the reduced models can dramatically reduce total computation by at least three orders and have very good agreement with those simulated from the original large problem by full-order FEM.     

Improving the generalization performance of RBF neural networks using a linear regression technique

In this paper we present a method for improving the generalization performance of a radial basis function (RBF) neural network. The method uses a statistical linear regression technique which is based on the orthogonal least squares (OLS) algorithm. We first discuss a modified way to determine the center and width of the hidden layer neurons. Then, substituting a QR algorithm for the traditional Gram–Schmidt algorithm, we find the connected weight of the hidden layer neurons. Cross-validation is utilized to determine the stop training criterion. The generalization performance of the network is further improved using a bootstrap technique. Finally, the solution method is used to solve a simulation and a real problem. The results demonstrate the improved generalization performance of our algorithm over the existing methods.     

Minimizing a nonlinear function under a fuzzy max-t-norm relational equation constraint

This work studies a nonlinear optimization problem subject to fuzzy relational equations with max-t-norm composition. Since the feasible domain of fuzzy relational equations with more than one minimal solution is non-convex, traditional nonlinear programming methods usually cannot solve them efficiently. This work proposes a genetic algorithm to solve this problem. This algorithm first locates the feasible domain through the maximum solution and the minimal solutions of the fuzzy relational equations, to significantly reduce the search space. The algorithm then executes all genetic operations inside this feasible domain, and thus avoids the need to check the feasibility of each solution generated. Moreover, it uses a local search operation to fine-tune each mutated solution. Experimental results indicate that the proposed algorithm can accelerate the searching speed and find the optimal solution.     

An integrated method for finding key suppliers in SCM

Association rule is a widely used data mining technique that searches through an entire data set for rules revealing the nature and frequency of relationships or associations between data entities. Supplier selection is a significant work in supply chain management. Often, there will be thousands of potential suppliers and identifying a subset of these suppliers can be a complex process of determining a satisfactory subset based on a number of factors. In this paper, the supplier selection can be viewed as the problem of mining a large database of shipment. The proposed method incorporates the extended association rule algorithm of data mining with that of set theory to find key suppliers. This research has employed a numerical example for the integrated method to develop suitable supplier clusters. The results show that the method is effective and applicable.     

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 wavelet-tree-based watermarking method using distance vector of binary cluster

This paper proposes a wavelet-tree-based watermarking method using distance vector of binary cluster for copyright protection. In the proposed method, wavelet trees are classified into two clusters using the distance vector to denote binary watermark bits. The two smallest wavelet coefficients in a wavelet tree are used to reduce distortion of a watermarked image. The distance vector, which is obtained from the two smallest coefficients of a wavelet tree, is quantized to decrease image distortion. The trees are classified into two clusters so that they exhibit a sufficiently large statistical difference based on the distance vector, which difference is then used for subsequent watermark extraction. We compare the statistical difference and the distance vector of a wavelet tree to decide which watermark bit is embedded in the embedding process. The experimental results show that the watermarked image looks visually identical to the original and the watermark can be effectively extracted upon image processing attacks.     

The evaluation of cluster policy by fuzzy MCDM: Empirical evidence from HsinChu Science Park

In the recent years, industrial clusters have received considerable attention from economists and industrial analysts, because they are seen as the main reason for economic growth and success of certain economic region. This study systematically reviews past researches of industrial cluster. The purpose of this paper is to contribute to the understanding of this issue regarding the driving forces for the growth of industrial cluster and find out the priority among these cluster policies. Taiwan HsinChu Science Park is a prime example for this paper, and its connection with the innovative participators. We begin with an examination of the literature on cluster about its driving forces and policies upon which we propose a conceptual framework. In doing so, we explore the cluster-based industrial system. Then this research adopts the Fuzzy Analytic Hierarchy Process as the analytical tool. The Fuzzy Analytic Hierarchy Process method is used to determine the weightings for evaluation dimension among decision makers. From our research results, the Factor Conditions is the most important driving force for advancing the industrial cluster performance. Moreover, the promotion of international linkages policy and broader framework policies rank the first two priorities for cluster policy. Overall, this paper concludes with some simulations of cluster policy alternatives confronting the industry and the Taiwanese government.     

Fault-tree analysis for liquefied natural gas terminal emergency shutdown system

Natural gas, one of the cleanest, most efficient and useful of all energy sources, is a vital component of the world’s supply of energy. To make natural gas more convenient for storage and transportation, it is refined and condensed into a liquid called liquefied natural gas (LNG). In a LNG site, safety is a long-team and critical issue. The emergency shutdown (ESD) system in the LNG receiving terminal is used to automatically stop the pumps and isolate the leakage section. Fault-tree analysis (FTA) has been widely used for providing logical functional relationships among subsystems and components of a system and identifying the root causes of the undesired failures in a system. In the conventional FTA for the ESD system, we usually assume that exact failure probabilities of events are collected. However, in most real applications, first, the FTA for the ESD system needs to be made at a early design or manufacturing stage, certain new components normally used without failure data; secondly, sometimes the environmental change in the system during the operation periods. This makes more difficult to gather past exact failures data for the FTA. To complete the FTA of the ESD system under these uncertain situations, we apply the intuitionistic fuzzy sets (IFS) theory to the FTA. We generate the intuitionistic fuzzy fault-tree interval, and the intuitionistic fuzzy reliability interval for the ESD system. We also present an algorithm to find the critical components in the system based on IFS–FTA and determine weak paths in the ESD system, where the key improvement must be made.