The study of tourist activities and the mapping of their routes in space and time has become an important issue in tourism management. Here we represent space-time paths for the tourism industry by visualizing individ...
详细信息
The study of tourist activities and the mapping of their routes in space and time has become an important issue in tourism management. Here we represent space-time paths for the tourism industry by visualizing individual tourist activities and the paths followed using a 3D Geographic Information System (GIS). Considerable attention has been devoted to the measurement of accessibility to shopping, eating, walking and other services at the tourist destination. I turns out that GIS is a useful tool for studying the spatial behaviors of tourists in the area. The value of GIS is especially advantageous for space-time potential path area measures, especially for the accurate visualization of possible paths through existing city road networks. This study seeks to apply space-time concepts with a detailed street network map obtained from Google Maps to measure tourist paths both spatially and temporally. These paths are further determined based on data obtained from map questionnaires regarding the trip activities of 40 individuals. The analysis of the data makes it possible to determining the locations of the more popular paths. The results can be visualized using 3D GIS to show the areas and potential activity opportunities accessible to tourists during their travel time.
Text categorization (TC) is an important component in many information organization and information management tasks. Two key issues in TC are feature coding and classifier design. The Euclidean distance is usually ch...
详细信息
Text categorization (TC) is an important component in many information organization and information management tasks. Two key issues in TC are feature coding and classifier design. The Euclidean distance is usually chosen as the similarity measure in K-nearest neighbor classification algorithm. All the features of each vector have different functions in describing samples. So we can decide different function of every feature by using feature weight learning. In this paper text categorization via K-nearest neighbor algorithm based on feature weight learning is described. The numerical experiments prove the validity of this learning algorithm.
Traditional iris location algorithms that have drawbacks of slow locating and partial occlusion influences such as eyelids, eyelashes and so on, the paper presented a preconditioning voting circle detection algorithm ...
详细信息
Traditional iris location algorithms that have drawbacks of slow locating and partial occlusion influences such as eyelids, eyelashes and so on, the paper presented a preconditioning voting circle detection algorithm based on preconditioning voting and circle geometry property. In additional, in order to reduce the computation and effect by partial occlusion, such as eyelid, eyelashes etc, the iris boundaries are localized, using a coarse-to-fine strategy, in regions of interest. In experiments, the proposed method is compared with the integral-differential operator and Hough transform algorithm based on JLU-IRIS iris database. From the experiment results, the proposed method is faster and better than the other two methods.
We study a problem of optimal scheduling and lot-sizing a number of products on m unrelated parallel machines to satisfy given demands, minimizing the makespan criterion. A sequence dependent setup time is required be...
详细信息
We study a problem of optimal scheduling and lot-sizing a number of products on m unrelated parallel machines to satisfy given demands, minimizing the makespan criterion. A sequence dependent setup time is required between lots of different products. The products are assumed to be all continuously divisible or all discrete. The problem is motivated by the real-life scheduling applications in multi-product plants. We derive properties of optimal solutions, NP -hardness proof, enumeration and dynamic programming algorithms for various special cases of the problem. A greedy-type heuristic is proposed and tested in computational experiment.
This work is a part of the research focused on the creation of modelling platform based on the Digital Material Representation (DMR) [1]. Particular attention is put on development of the automatic image analysis meth...
详细信息
Finite words and their overlap properties are considered in this paper. Let w be a finite word of length n with period p and where the maximum length of its unbordered factors equals k. A word is called unbordered if ...
详细信息
ISBN:
(纸本)3540857796
Finite words and their overlap properties are considered in this paper. Let w be a finite word of length n with period p and where the maximum length of its unbordered factors equals k. A word is called unbordered if it possesses no proper prefix that is also a suffix of that word. Suppose ki , with two different letters a and b and i1, and b i occurs exactly once in w. This answers a conjecture by Harju and the second author of this paper about a structural property of maximum Duval extensions. Moreover, we show here that i
This paper presents an approach in which a multi-objective evolutionary algorithm (MOEA) is coupled to a surrogate method in order to explore the search space in an efficient manner. A small comparative study among th...
详细信息
ISBN:
(纸本)9781605581309
This paper presents an approach in which a multi-objective evolutionary algorithm (MOEA) is coupled to a surrogate method in order to explore the search space in an efficient manner. A small comparative study among three surrogate methods is conducted: an artificial neural network (ANN), a radial basis function (RBF) and a support vector machine (SVM). The winner in this comparative study was the SVM. However, our results indicated that the spread of solutions achieved by our surrogate-based MOEA was poor. Thus, we decided to introduce a second phase to the algorithm in which it is hybridized with the rough sets in order to improve the spread of solutions and help to reach the true Pareto front. We show that our proposed hybrid approach only requires 2,000 fitness function evaluations in order to solve test problems with up to 30 decision variables.
This NSF-funded community-building (CB) project brings together Michigan State University (MSU), Lansing Community College (LCC), and the Corporation for a Skilled Workforce (CSW) to design and implement a process to ...
详细信息
ISBN:
(纸本)9781424419692
This NSF-funded community-building (CB) project brings together Michigan State University (MSU), Lansing Community College (LCC), and the Corporation for a Skilled Workforce (CSW) to design and implement a process to create a collaboratively-defined undergraduate computing education within the engineering and technology fields in alignment with the computational problem-solving abilities needed to transform mid-Michigan's economy and workforce. In this WIP we outline the process we are developing to ensure that a wide variety of stakeholders - business, community leaders and post secondary educators collaborate to identify workforce computational skills, define how these skills can be integrated across a curriculum, and develop revised curricula that integrate computational problem-solving across engineering departmental courses. By documenting, evaluating and making the process explicit, this process can serve as a model for national efforts to revitalize undergraduate computing education in engineering, and should be extensible to other computing education reform efforts.
This paper focuses on personalized information retrieval which is a research focus in Web Information Service,and it's the key technology of enhance retrieval quality. As a user concept map composed of some concep...
详细信息
暂无评论