An Iterative Method for Deciding SVM and Single Layer Neural Network Structures

We present two new classifiers for two-class classification problems using a new Beta-SVM kernel transformation and an iterative algorithm to concurrently select the support vectors for a support vector machine (SVM) and the hidden units for a single hidden layer neural network to achieve a better generalization performance. To construct the classifiers, the contributing data points are chosen on the basis of a thresholding scheme of the outputs of a single perceptron trained using all training data samples. The chosen support vectors are used to construct a new SVM classifier that we call Beta-SVN. The number of chosen support vectors is used to determine the structure of the hidden layer in a single hidden layer neural network that we call Beta-NN. The Beta-SVN and Beta-NN structures produced by our method outperformed other commonly used classifiers when tested on a 2-dimensional non-linearly separable data set.     

A PDE method for patchwise approximation of large polygon meshes

Three-dimensional (3D) representations of complex geometric shapes, especially when they are reconstructed from magnetic resonance imaging (MRI) and computed tomography (CT) data, often result in large polygon meshes which require substantial storage for their handling, and normally have only one fixed level of detail (LOD). This can often be an obstacle for efficient data exchange and interactive work with such objects. We propose to replace such large polygon meshes with a relatively small set of coefficients of the patchwise partial differential equation (PDE) function representation. With this model, the approximations of the original shapes can be rendered with any desired resolution at interactive rates. Our approach can directly work with any common 3D reconstruction pipeline, which we demonstrate by applying it to a large reconstructed medical data set with irregular geometry.     

A robust optimization approach for imprecise data envelopment analysis

Crisp input and output data are fundamentally indispensable in traditional data envelopment analysis (DEA). However, the input and output data in real-world problems are often imprecise or ambiguous. Some researchers have proposed interval DEA (IDEA) and fuzzy DEA (FDEA) to deal with imprecise and ambiguous data in DEA. Nevertheless, many real-life problems use linguistic data that cannot be used as interval data and a large number of input variables in fuzzy logic could result in a significant number of rules that are needed to specify a dynamic model. In this paper, we propose an adaptation of the standard DEA under conditions of uncertainty. The proposed approach is based on a robust optimization model in which the input and output parameters are constrained to be within an uncertainty set with additional constraints based on the worst case solution with respect to the uncertainty set. Our robust DEA (RDEA) model seeks to maximize efficiency (similar to standard DEA) but under the assumption of a worst case efficiency defied by the uncertainty set and it’s supporting constraint. A Monte-Carlo simulation is used to compute the conformity of the rankings in the RDEA model. The contribution of this paper is fourfold: (1) we consider ambiguous, uncertain and imprecise input and output data in DEA; (2) we address the gap in the imprecise DEA literature for problems not suitable or difficult to model with interval or fuzzy representations; (3) we propose a robust optimization model in which the input and output parameters are constrained to be within an uncertainty set with additional constraints based on the worst case solution with respect to the uncertainty set; and (4) we use Monte-Carlo simulation to specify a range of Gamma in which the rankings of the DMUs occur with high probability.     

The Effects of Survey Administration on Disclosure Rates to Sensitive Items Among Men: A Comparison of an Internet Panel Sample with a RDD Telephone Sample

Research using Internet surveys is an emerging field, yet research on the legitimacy of using Internet studies, particularly those targeting sensitive topics, remains under-investigated. The current study builds on the existing literature by exploring the demographic differences between Internet panel and RDD telephone survey samples, as well as differences in responses with regard to experiences of intimate partner violence perpetration and victimization, alcohol and substance use/abuse, PTSD symptomatology, and social support. Analyses indicated that after controlling for demographic differences, there were few differences between the samples in their disclosure of sensitive information, and that the online sample was more socially isolated than the phone sample. Results are discussed in terms of their implications for using Internet samples in research on sensitive topics.     

Integration of genetic fuzzy systems and artificial neural networks for stock price forecasting

Stock market prediction is regarded as a challenging task in financial time-series forecasting. The central idea to successful stock market prediction is achieving best results using minimum required input data and the least complex stock market model. To achieve these purposes this article presents an integrated approach based on genetic fuzzy systems (GFS) and artificial neural networks (ANN) for constructing a stock price forecasting expert system. At first, we use stepwise regression analysis (SRA) to determine factors which have most influence on stock prices. At the next stage we divide our raw data into k clusters by means of self-organizing map (SOM) neural networks. Finally, all clusters will be fed into independent GFS models with the ability of rule base extraction and data base tuning. We evaluate capability of the proposed approach by applying it on stock price data gathered from IT and Airlines sectors, and compare the outcomes with previous stock price forecasting methods using mean absolute percentage error (MAPE). Results show that the proposed approach outperforms all previous methods, so it can be considered as a suitable tool for stock price forecasting problems.     

Efficient task scheduling for runtime reconfigurable systems

Recent research indicates the promising performance of employing reconfigurable systems to accelerate multimedia and communication applications. Nonetheless, they are yet to be widely adopted. One reason is the lack of efficient operating system support for these platforms. In this paper, we address the problem of runtime task scheduling as a main part of the operating systems. To do so, a new task replacement parameter, called Time-Improvement, is proposed for compiler assisted scheduling algorithms. In contrast with most related approach, we validate our approach using real application workload obtained from an application for multimedia test remotely taken by students. The proposed online task scheduling algorithm outperforms previous algorithms and accelerates task execution from 4% up to 20%.     

Deriving operating policies for multi-objective reservoir systems: Application of Self-Learning Genetic Algorithm

Optimal multi-reservoir operation is a multi-objective problem in nature and some of its objectives are nonlinear, non-convex and multi-modal functions. There are a few areas of application of mathematical optimization models with a richer or more diverse history than in reservoir systems optimization. However, actual implementations remain limited or have not been sustained.Genetic Algorithms (GAs) are probabilistic search algorithms that are capable of solving a variety of complex multi-objective optimization problems, which may include non-linear, non-convex and multi-modal functions. GA is a population based global search method that can escape from local optima traps and find the global optima. However GAs have some drawbacks such as inaccuracy of the intensification process near the optimal set.In this paper, a new model called Self-Learning Genetic Algorithm (SLGA) is presented, which is an improved version of the SOM-Based Multi-Objective GA (SBMOGA) presented by Hakimi-Asiabar et al. (2009) [45]. The proposed model is used to derive optimal operating policies for a three-objective multi-reservoir system. SLGA is a new hybrid algorithm which uses Self-Organizing Map (SOM) and Variable Neighborhood Search (VNS) algorithms to add a memory to the GA and improve its local search accuracy. SOM is a neural network which is capable of learning and can improve the efficiency of data processing algorithms. The VNS algorithm can enhance the local search efficiency in the Evolutionary Algorithms (EAs).To evaluate the applicability and efficiency of the proposed methodology, it is used for developing optimal operating policies for the Karoon-Dez multi-reservoir system, which includes one-fifth of Iran's surface water resources. The objective functions of the problem are supplying water demands, generating hydropower energy and controlling water quality in downstream river.     

Is information systems a discipline? Foucauldian and Toulminian insights

Following the Kleinian spirit, this study takes a critical view of the existing orthodoxy within information systems (IS) and reframes the ongoing discussion concerning the intellectual core, identity and disciplinary status of IS using the disciplinary analysis of Michel Foucault and Stephen Toulmin. Instead of limiting the discussion to specific paradigms, topics, subjects or content, it focuses on the characteristics, rules and goals of IS as an academic field. A disciplinary lens is used to frame what it means to be a field, discipline and science, and in the process the study uncovers four doxas that have shaped the development of the IS field: (1) the IS research community sees no difference between fields, disciplines or sciences; (2) IT changes so rapidly, and thus the IS field needs to change to remain relevant; (3) disciplines are by definition rigid, inflexible and uni-theoretical and (4) because IS is pluralistic, IS should not become a discipline. This study's analyses of the IS field's discursive formation and intellectual ideals offer novel perspectives that allow for the integration of the IS field's plurality and diversity. To transform the IS field from its multimodal existence into a vibrant, diverse, academically and socially relevant and influential discipline, the study proposes actionable strategies that include (1) agreeing on the intellectual ideals for IS, (2) focusing on conceptual formation, (3) focusing on theory construction, (4) erecting genealogical boundaries and (5) fostering the development of professional bodies.     

Theory and methodology on the global optimal solution to a General Reverse Logistics Inventory Model for deteriorating items and time-varying rates

In this paper, we present a unified general inventory model for integrated production of new items and remanufacturing of returned items for an infinite planning horizon. Our model considers a production environment that consists of three shops. The first shop is for remanufacturing returned items, the second shop is for manufacturing new items, while the third shop is for collecting returned items to be remanufactured in the first shop. The system is subject to joint production and remanufacturing options, the first one is to produce new items while the second one is to reproduce/recycle the returned items “as-good-as new”. Items deteriorate while they are in storage, and production, remanufacturing, demand, return, and deterioration rates are arbitrary functions of time. A closed form for the total relevant costs as well as a rigorous mathematical proof, which shows the global optimality of the solution to the underlying inventory system are introduced. Illustrative examples, which explain the application of the theoretical results as well as their numerical verifications, are also given.