An interactive whiteboard student survey: Development,validity and reliability

The interactive whiteboard (IWB) has become a popular technology for instructors over the last decade. Though research asserts that the IWBs facilitate learning in different ways, there is a lack of studies examining actual IWB use in classroom settings based on learners’ perspectives by means of valid instruments. The purpose of this study is to develop a valid and reliable interactive whiteboard student survey in order to evaluate the IWB use based on perceptions of students who have been taught with IWBs. In establishing the theoretical base of the survey, the Technology Acceptance Model (TAM) and constructivist learning theories were considered. In addition, with respect to IWB use in classrooms, a number of studies emanated from countries such as the UK, the USA, and Australia were examined, and similar research questionnaires and findings and also reflections of students about IWBs were utilized to create an item pool. A 39-item survey was conducted among middle school students (N = 263) from the city of Istanbul in Turkey. Collected data was exposed to exploratory factor analysis and resulted in a 26-item, three-factor survey, whose factors were named as the perceived efficiency of IWB, perceived learning contribution and motivation, and the perceived negative effects of IWB. The results of the analyses illustrated that this new IWB student scale, which explains 50% of the total variance with a good level of Cronbach’s Alpha coefficient (0.93) is a valid and reliable instrument designed specifically for measuring the use of IWBs in real classroom settings. Besides, theoretical foundations of interactive whiteboard use, the development process of the instrument, and results of validity and reliability analyses were discussed in detail.     

Control of underactuated planar pronking through an embedded spring-mass Hopper template

Autonomous use of legged robots in unstructured, outdoor settings requires dynamically dexterous behaviors to achieve sufficient speed and agility without overly complex and fragile mechanics and actuation. Among such behaviors is the relatively under-studied pronking (aka. stotting), a dynamic gait in which all legs are used in synchrony, usually resulting in relatively slow speeds but long flight phases and large jumping heights. Instantiations of this gait for robotic systems have been mostly limited to open-loop strategies, suffering from severe pitch instability for underactuated designs due to the lack of active feedback. However, both the kinematic simplicity of this gait and its dynamic nature suggest that the Spring-Loaded Inverted Pendulum model (SLIP) would be a good basis for the implementation of a more robust feedback controller for pronking. In this paper, we describe how template-based control, a controller structure based on the embedding of a simple dynamical “template” within a more complex “anchor” system, can be used to achieve very stable pronking for a planar, underactuated hexapod robot. In this context, high-level control of the gait is regulated through speed and height commands to the SLIP template, while the embedding controller ensures the stability of the remaining degrees of freedom. We use simulation studies to show that unlike existing open-loop alternatives, the resulting control structure provides explicit gait control authority and significant robustness against sensor and actuator noise.     

Rule extraction from artificial neural networks to discover causes of quality defects in fabric production

In this paper, a novel classification rule extraction algorithm which has been recently proposed by authors is employed to determine the causes of quality defects in a fabric production facility in terms of predetermined parameters like machine type, warp type etc. The proposed rule extraction algorithm works on the trained artificial neural networks in order to discover the hidden information which is available in the form of connection weights in them. The proposed algorithm is mainly based on a swarm intelligence metaheuristic which is known as Touring Ant Colony Optimization (TACO). The algorithm has a hierarchical structure with two levels. In the first level, a multilayer perceptron type neural network is trained and its weights are extracted. After obtaining the weights, in the second level, the TACO-based algorithm is applied to extract classification rules. The main purpose of the present work is to determine and analyze the most effective parameters on the quality defects in fabric production. The parameters and their levels which give the best quality results are tried to be discovered and evaluated by making use of the proposed algorithm. It is also aimed to compare the accuracy of proposed algorithm with several other rule-based algorithms in order to present its competitiveness.     

Use of center of gravity with the common vector approach in isolated word recognition

In this paper, the subspace based classifier, common vector approach (CVA), with the center of gravity (COG) method is used for isolated word recognition. Since the CVA classifier is sensitive to shifts through the time axis, endpoint detection becomes extremely important for the recognition of isolated words. The COG method eliminates the need for endpoint detection. The effects of the COG method and a classical endpoint detection algorithm on the recognition rates of isolated words are investigated. The experimental results show that the COG method yields slightly higher recognition rates than the endpoint detection method in the TI-digit database when CVA is used.     

An automatic diabetes diagnosis system based on LDA-Wavelet Support Vector Machine Classifier

In this paper, an automatic diagnosis system for diabetes on Linear Discriminant Analysis (LDA) and Morlet Wavelet Support Vector Machine Classifier: LDA–MWSVM is introduced. The structure of this automatic system based on LDA-MWSVM for the diagnosis of diabetes is composed of three stages: The feature extraction and feature reduction stage by using the Linear Discriminant Analysis (LDA) method and the classification stage by using Morlet Wavelet Support Vector Machine (MWSVM) classifier stage. The Linear Discriminant Analysis (LDA) is used to separate features variables between healthy and patient (diabetes) data in the first stage. The healthy and patient (diabetes) features obtained in the first stage are given to inputs of the MWSVM classifier in the second stage. Finally, in the third stage, the correct diagnosis performance of this automatic system based on LDA–MWSVM for the diagnosis of diabetes is calculated by using sensitivity and specificity analysis, classification accuracy, and confusion matrix, respectively. The classification accuracy of this system was obtained at about 89.74%.     

Single machine scheduling with unequal release date using neuro-dominance rule

A neuro-dominance rule (NDR) for single machine total weighted tardiness problem with unequal release date is presented by the author. To obtain the NDR, backpropagation artificial neural network (BPANN) has been trained using 10,000 data and also tested using 10,000 another data. Inputs of the trained BPANN are starting date of the first job (t), processing times (p_i and p_j), due dates (d_i and d_j), weights of the jobs (w_i and w_j) and r_i and r_j release dates of the jobs. Output of the BPANN is a decision of which job should precede. Training set and test set have been obtained using Adjusted Pairwise Interchange method. The proposed NDR provides a sufficient condition for local optimality. It has been proved that if any sequence violates the NDR then violating jobs are switched according to the total weighted tardiness criterion. The proposed NDR is compared to a number of competing heuristics (ATC, COVERT, EDD, SPT, LPT, WDD, WSPT, WPD, CR, FCFS) and meta heuristics (simulated annealing and genetic algorithms) for a set of randomly generated problems. The problem sizes have been taken as 50, 70, 100. NDR is applied 270,000 randomly generated problems. Computational results indicate that the NDR dominates the heuristics and meta heuristics in all runs. Therefore, the NDR can improve the upper and lower bounding schemes.     

A tabu-search based heuristic for the hub covering problem over incomplete hub networks

Hub location problems deal with finding the location of hub facilities and with the allocation of demand nodes to these located hub facilities. In this paper, we study the single allocation hub covering problem over incomplete hub networks and propose an integer programming formulation to this end. The aim of our model is to find the location of hubs, the hub links to be established between the located hubs, and the allocation of non-hub nodes to the located hub nodes such that the travel time between any origin–destination pair is within a given time bound. We present an efficient heuristic based on tabu search and test the performance of our heuristic on the CAB data set and on the Turkish network.     

Investigation of Ant System parameter interactions by using design of experiments for job-shop scheduling problems

In recent years, one of the most important and promising research fields has been metaheuristics to find optimal or near-optimal solutions for NP-hard combinatorial optimization problems. Improving the quality of the solution or the solution time is basic research area on metaheuristics. Modifications of the existing ones or creation of hybrid approaches are the focus of these efforts. Another area of improving the solution quality of metaheuristics is finding the optimal combination of algorithm control parameters. This is usually done by design of experiments or one-at-a-time approach in genetic algorithms, simulated annealing and similar metaheuristics. We observe that, in studies which use Ant Colonies Optimization (ACO) as an optimization technique; the levels of control parameters are determined by some non-systematic initial experiments and the interactions of the parameters are not studied yet.In this study, the parameters of Ant System have been investigated on different sized and randomly generated job-shop scheduling problems by using design of experiments. The effects and interactions of the parameters have been interpreted with the outputs of the experiments. Referring to the statistical analysis it is observed that none of the interactions between the Ant System parameters has a significant effect on makespan value. A specific fractional experimental design is suggested instead of the full factorial design. Depending on the findings from the benchmark problems it will be a reliable approach to use the suggested design for saving time and effort in experiments without sacrificing the solution quality.