Polynomial time approximation algorithms for proportionate open‐shop scheduling

This paper deals with the presentation of polynomial time (approximation) algorithms for a variant of open‐shop scheduling, where the processing times are only machine‐dependent. This variant of scheduling is called proportionate scheduling and its applications are used in many real‐world environments. This paper develops three polynomial time algorithms for the problem. First, we present a polynomial time algorithm that solves the problem optimally if , where n and m denote the numbers of jobs and machines, respectively. If, on the other hand, , we develop a polynomial time approximation algorithm with a worst‐case performance ratio of that improves the bound existing for general open‐shops. Next, in the case of , we take into account the problem under consideration as a master problem and convert it into a simpler secondary approximation problem. Furthermore, we formulate both the master and secondary problems, and compare their complexity sizes. We finally present another polynomial time algorithm that provides optimal solution for a special case of the problem where .     

A brain–computer interface for the Dasher alternative text entry system

To investigate whether the alternative text entry system, Dasher, is useful to physically and intellectually disabled students when controlled by a brain–computer interface (BCI) a new software tool was developed to allow subjects to type words onto a computer screen via Dasher using their thoughts. A case study approach was adopted. Subjects were selected based on their suitability for the experiment, and the potential benefit to them of this system, by their head teacher. Subjects entered literacy level-matched phrases onto a computer using QWERTY keyboard, Dasher-mouse and Dasher-BCI. A researcher recorded qualitative and quantitative data, including characters entered per minute and their system preferences. Informed written consent was given for seven subjects to participate (aged 14–19 years, five male, with a range of physical and intellectual disabilities). After a short training period, all subjects had some degree of control over the Dasher-BCI system. With regard to typing speed, Dasher-BCI performed relatively poorly (3.9 ± 1.5 characters per minute), and QWERTY keyboard performed the best (31.9 ± 21.9 characters per minute). Dasher-BCI was the most preferred method. Areas of weakness in Dasher and the BCI hardware were highlighted and suggestions for improvement given. BCI-based text entry is not yet ready to compete with more established methods for students with combined cognitive and physical disabilities. Although underpowered, this study suggests that for people whose predominant disability is physical (cerebral palsy), BCI technology shows great potential as a viable text entry alternative. Suggestions for further research are discussed.     

Adaptive full order sliding mode control for electronic throttle valve system with fixed time convergence using extreme learning machine

Neural Computing and Applications - This paper proposes a novel extreme learning machine (ELM)-based fixed time adaptive trajectory control for electronic throttle valve system with uncertain...     

An Efficient Medical Image Deep Fusion Model Based on Convolutional Neural Networks

Medical image fusion is considered the best method for obtaining one image with rich details for efficient medical diagnosis and therapy. Deep learning provides a high performance for several medical image analysis applications. This paper proposes a deep learning model for the medical image fusion process. This model depends on Convolutional Neural Network (CNN). The basic idea of the proposed model is to extract features from both CT and MR images. Then, an additional process is executed on the extracted features. After that, the fused feature map is reconstructed to obtain the resulting fused image. Finally, the quality of the resulting fused image is enhanced by various enhancement techniques such as Histogram Matching (HM), Histogram Equalization (HE), fuzzy technique, fuzzy type Π, and Contrast Limited Histogram Equalization (CLAHE). The performance of the proposed fusion-based CNN model is measured by various metrics of the fusion and enhancement quality. Different realistic datasets of different modalities and diseases are tested and implemented. Also, real datasets are tested in the simulation analysis.     

Congestion prevention in broadband wireless access systems: An economic approach

While the demand for mobile broadband wireless services continues to increase, radio resources remain scarce. Even with the substantial increase in the supported bandwidth in the next generation broadband wireless access systems (BWASs), it is expected that these systems will severely suffer from congestion, due to the rapid increase in demand of bandwidth-intensive multimedia services. Without efficient bandwidth management and congestion control schemes, network operators may not be able to meet the increasing demand of users for multimedia services, and hence they may suffer an immense revenue loss. In this paper, we propose an admission-level bandwidth management scheme consisting of call admission control (CAC) and dynamic pricing. The main aim of our proposed scheme is to provide monetary incentives to users to use the wireless resources efficiently and rationally, hence, allowing efficient bandwidth management at the admission level. By dynamically determining the prices of units of bandwidth, the proposed scheme can guarantee that the number of connection requests to the system are less than or equal to certain optimal values computed dynamically, hence, ensuring a congestion-free system. The proposed scheme is general and can accommodate different objective functions for the admission control as well as different pricing functions. Comprehensive simulation results with accurate and inaccurate demand modeling are provided to show the effectiveness and strengths of our proposed approach.     

Exploring creative thinking in graphically mediated synchronous dialogues

This paper reports on an aspect of the EC funded Argunaut project which researched and developed awareness tools for moderators of online dialogues. In this study we report on an investigation into the nature of creative thinking in online dialogues and whether or not this creative thinking can be coded for and recognized automatically such that moderators can be alerted when creative thinking is occurring or when it has not occurred after a period of time. We outline a dialogic theory of creativity, as the emergence of new perspectives from the interplay of voices, and the testing of this theory using a range of methods including a coding scheme which combined coding for creative thinking with more established codes for critical thinking, artificial intelligence pattern-matching techniques to see if our codes could be read automatically from maps and ‘key event recall’ interviews to explore the experience of participants. Our findings are that: (1) the emergence of new perspectives in a graphical dialogue map can be recognized by our coding scheme supported by a machine pattern-matching algorithm in a way that can be used to provide awareness indicators for moderators; (2) that the trigger events leading to the emergence of new perspectives in the online dialogues studied were most commonly disagreements and (3) the spatial representation of messages in a graphically mediated synchronous dialogue environment such as Digalo may offer more affordance for creativity than the much more common scrolling text chat environments. All these findings support the usefulness of our new account of creativity in online dialogues based on dialogic theory and demonstrate that this account can be operationalised through machine coding in a way that can be turned into alerts for moderators.     

Nadir compromise programming: A model for optimization of multi-objective portfolio problem

In problem of portfolio selection, financial Decision Makers (DMs) explain objectives and investment purposes in the frame of multi-objective mathematic problems which are more consistent with decision making realities. At present, various methods have introduced to optimize such problems. One of the optimization methods is the Compromise Programming (CP) method. Considering increasing importance of investment in financial portfolios, we propose a new method, called Nadir Compromising Programming (NCP) by expanding a CP-based method for optimization of multi-objective problems. In order to illustrate NCP performance and operational capability, we implement a case study by selecting a portfolio with 35 stock indices of Iran stock market. Results of comparing the CP method and proposed method under the same conditions indicate that NCP method results are more consistent with DM purposes.     

Parallel Iterator for Parallelizing Object-Oriented Applications

With the advent of multi-core processors, desktop application developers must finally face parallel computing and its challenges. A large portion of the computational load in a program rests within iterative computations. In object-oriented languages these are commonly handled using iterators which are inadequate for parallel programming. This paper presents a powerful Parallel Iterator concept to be used in object-oriented programs for the parallel traversal of a collection of elements. The Parallel Iterator may be used with any collection type (even those inherently sequential) and it supports several scheduling schemes which may even be decided dynamically at run-time. Some additional features are provided to allow early termination of parallel loops, exception handling and a solution for performing reductions. With a slight contract modification, the Parallel Iterator interface imitates that of the Java-style sequential iterator. All these features combine together to promote minimal, if any, code restructuring. Along with the ease of use, the results reveal negligible overhead and the expected inherent speedup.