The most convenient media for learning are printed materials and mobile phones, but these require a sophisticated instructional strategy, a well-defined finite framework and procedure for developing high-quality learning. Different types of knowledge representations and four stages – metaphor, image, model and proposition – implementing instructional technology are introduced in this paper.

Two decades of clinical research have resulted in survival improvements for advanced non-small cell lung cancer. These results have been established by multiple randomized trials completed by meta-analyses such as by the review conducted by the Non-Small Cell Lung Cancer Collaborative Group [1]. Chemotherapy, combined with radiotherapy in locally advanced disease, has indeed been shown to reduc...

With recent technological advances in remote sensing, very high-dimensional (hyperspectral) data are available for a better discrimination among different complex land-cover classes having similar spectral signatures. However, this large number of bands makes very complex the task of automatic data analysis. In the real application, it is difficult and expensive for the expert to acquire enough...

A minimum feedback arc set of a digraph is a smallest sized set of arcs that when reversed makes the resulting digraph acyclic. Given an acyclic digraph D, we seek a smallest sized tournament T that has D as a minimum feedback arc set. The reversing number of a digraph was defined by Barthélemy et. al. to be r(D) = |V (T )| − |V (D)|. We will completely determine the reversing number for a disj...

We investigate the state complexity of union and intersection for finite languages. Note that the problem of obtaining the tight bounds for both operations was open. First we compute upper bounds using structural properties of minimal deterministic finite-state automata for finite languages. Then, we show that the upper bounds are tight if we have a variable sized alphabet that can depend on th...

In this paper, we consider the two-dimensional variable-sized bin packing problem (2DVSBPP) with guillotine constraint. 2DVSBPP is a well-known NP-hard optimization problem which has several real applications. A mixed bin packing algorithm (MixPacking) which combines a heuristic packing algorithm with the Best Fit algorithm is proposed to solve the single bin problem, and then a backtracking al...

We present a polynomial-sized linear program (LP) for the n-city TSP drawing upon “complex flow” modeling ideas by the first two authors who used an O(n)×O(n) model*. Here we have only O(n) variables and O(n) constraints. We do not model explicit cycles of the cities, and our modeling does not involve the city-to-city variables-based, traditional TSP polytope referred to in the literature as “T...

The solution methods based on semidefinite programming (SDP) relaxations for sensor network localization (SNL) problems can not handle very large-sized SNL problems. We present a continuation method using the gradient descent method to efficiently solve large-sized SNL problems. We first formulate the problem as an unconstrained optimization problem and then apply the continuation on the distan...

Detection of text from documents in which text is embedded in complex colored and textured backgrounds is a very challenging problem. In this paper, we propose a simple texture-based approach based on edge information for this task. The performance of our method is compared to that obtained by a method based on the discrete cosine transform which was recently proposed by Zhong et al. [12] for t...

This paper presents iterated local search and great deluge trajectory metaheuristics for the linear ordering problem (LOP). Both metaheuristics are based on the TREE local search method introduced in Sakuraba and Yagiura, 2010 (Efficient local search algorithms for the linear ordering problem, International Transactions in Operational Research 17, pp. 711–737) that is the only method ever appli...