教学课程资源库 更多>>

关键词： Global Positioning System   Trajectory   Predictive models   Computer science   Public transportation   Internet of Things   Parking place   mobile-IoT   GPS trajectory   taxicab   transition tensor   tensor power method   eigentensor  

摘要： With the development of GPS technology, GPS-equipped taxicabs and users with GPS-enabled devices interact each other, and form a new mobile Internet of things (M-IoT). This paper proposes a M-IoT service framework to predict multiusers' mobility pattern by solving a cubical user-spatio-temporal probability map arising from heterogeneous sensor data. Then, the framework provides services for the traffic participants based on the prediction. To solve the stationary probability map, a novel tensor based iterative algorithm is proposed and proved to be convergent. Furthermore, the existence and uniqueness of the stationary probability is proved. The multivariate multistep transition tensor ((MT2)-T-2) model is proposed to merge massive sensor data from multisource, including time, space, and social network, so on. The eigentensor concept is proposed as the theoretical basis of the (MT2)-T-2 model. The context-aware (MT2)-T-2 model takes into account comprehensive context factors to improve the accuracy of prediction. In the end, extensive experiments based on real GPS data are conducted to evaluate efficiency of the proposed model. The results show that the propose model has highly improved the prediction accuracy.

关键词： Computer Aided Instruction   Computer Science Education   Physical Computing   Computer Science Education   Interactive Physical Systems   BBC Micro Bit   Programming   Computer Science Education   Hardware   Complexity Theory  

摘要： A recent growth area in computer science education is physical computing, which involves combining software and hardware to build interactive physical systems that sense and respond to the real world. This article provides an overview of physical computing and its value in the classroom, using the BBC micro:bit as an example.

关键词： Computer science   Binary image processing   Operation sequence   Multi-objective optimization   Evolutionary algorithms  

摘要： In binary image segmentation, the choice of the order of the operation sequence may yield to suboptimal results. In this work, we propose to tackle the associated optimization problem via multi-objective approach. Given the original image, in combination with a list of morphological, logical and stacking operations, the goal is to obtain the ideal output at the lowest computational cost. We compared the performance of two Multi-objective Evolutionary Algorithms (MOEAs): the Non-dominated Sorting Genetic Algorithm (NSGA-II) and the Strength Pareto Evolutionary Algorithm 2 (SPEA2). NSGA-II has better results in most cases, but the difference does not reach statistical significance. The results show that the similarity measure and the computational cost are objective functions in conflict, while the number of operations available and type of input images impact on the quality of Pareto set.

关键词： Computer Science Instruction   Cybersecurity Faculty   Faculty Development   Technology Management  

摘要： Many universities require end of course evaluations for all courses taught as tool for academic accreditation purposes. The reality is that often many academic departments either do not do anything or have no idea what to do when evaluations continue to be poor. As a result, students have fought back against this process to create their own on-line rating program, Rate My ***, which allows students to give other students insights into who is a quality professor and who is not. This paper explores this use of mock teaching simulations, which are also called Micro-teaching approaches, as a quality management tool to improve the way students are taught in Technology Management, Cybersecurity, and Computer Science degree and certificate programs.

关键词： Computer Science   Scriptio continua   Javanese manuscript   Syllables concatenation   Transliteration   Greedy  

摘要： Many Javanese manuscripts in Indonesia are stored in museums and libraries. Most of these manuscripts were written using local scripts that are rarely used in everyday life, and hence a software application that can help and improve the reading of these manuscripts is valuable. An essential step in automatic manuscript image transliteration is post-processing, which involves editing and concatenating syllables into words. The main problem of post-processing is that there exists no symbol for space between words in a sentence, which is called the scriptio-continua problem. This paper proposes methods based on the backtracking algorithm to solve the scriptio continua in the post-processing step of Javanese manuscript image transliteration. The proposed methods use a depth-first search in seeking relevant candidate words to determine whether to merge a new syllable or not. The results of the proposed methods to concatenate 17,687 syllables from the Hamong Tani book using a dictionary containing 49,801 words are found to be satisfactory in terms of computation and accuracy. The accuracy of the implemented greedy and brute-force methods is both 81.64%. However, the greedy-based method is more efficient and has a better performance than the brute-force method.

关键词： Tuning   Task analysis   Heuristic algorithms   Optimization   Computer science   Measurement   Systematics   Automatic parameter tuning   metaheuristics   parameter setting   parameter tuning  

摘要： Parameter tuning, that is, to find appropriate parameter settings (or configurations) of algorithms so that their performance is optimized, is an important task in the development and application of metaheuristics. Automating this task, i.e., developing algorithmic procedure to address parameter tuning task, is highly desired and has attracted significant attention from the researchers and practitioners. During last two decades, many automatic parameter tuning approaches have been proposed. This paper presents a comprehensive survey of automatic parameter tuning methods for metaheuristics. A new classification (or taxonomy) of automatic parameter tuning methods is introduced according to the structure of tuning methods. The existing automatic parameter tuning approaches are consequently classified into three categories: 1) simple generate-evaluate methods;2) iterative generate-evaluate methods;and 3) high-level generate-evaluate methods. Then, these three categories of tuning methods are reviewed in sequence. In addition to the description of each tuning method, its main strengths and weaknesses are discussed, which is helpful for new researchers or practitioners to select appropriate tuning methods to use. Furthermore, some challenges and directions of this field are pointed out for further research.

关键词： Programming   Computer science education   Hardware   Complexity theory  

摘要： A recent growth area in computer science education is physical computing, which involves combining software and hardware to build interactive physical systems that sense and respond to the real world. This article provides an overview of physical computing and its value in the classroom, using the BBC micro:bit as an example. [ABSTRACT FROM AUTHOR]

关键词： Enterprise resource planning   ERP   Success model   Performance   Management learning   Information systems   Computer science   Human-centered computing   Education   Information science   Business  

摘要： Management learning poses some challenges, firstly students should identify all administration areas and secondly, they should understand the big picture of an organizational context, by integrating all the studied areas. Enterprise Resource Planning (ERP) systems are the backbone of any organization, in terms of information management systems integration. The usage of these systems is important in terms of management in any organization, and ERP's can facilitate the management learning process. The main objectives of this study are to understand if the ERP usage supports management learning, and to identify the main determinants of individual performance. This study presents a success model of ERP usage for learning management context. The model was validated empirically through a survey answered by university management students. The results show that system quality, process quality, and training play a determinant role in the students' performance.

关键词： Computers   Interviews   History   Computer science   Chemistry   Engineering profession   Mathematics  

摘要： In this interview, Mike Williams discusses his college career in Calgary, Alberta, Canada, where he first encountered computers, and in Glasgow, Scotland. In graduate school in Glasgow, he first became interested in computing history. He spent the rest of his professional career back in Calgary in the Department of Computer Science at the University of Calgary from which he retired many years later. In parallel with his academic career, Mike was involved in a variety of computing history activities with other institutions and with other computing historians. He also served in many positions with the IEEE Computer Society and the IEEE, including as 2007 President of the Computer Society.

关键词： Approximation algorithms   Optimization   Machine learning algorithms   Linear programming   Matrix decomposition   Cybernetics   Computer science   Feature correspondence   feature extraction   graph matching   image registration   image representation  

摘要： Graph matching is a fundamental problem in theoretical computer science and artificial intelligence, and lays the foundation for many computer vision and machine learning tasks. Approximate algorithms are necessary for graph matching due to its NP-complete nature. Inspired by the usage in network-related tasks, random walk is generalized to graph matching as a type of approximate algorithm. However, it may be inappropriate for the previous random walk-based graph matching algorithms to utilize continuous techniques without considering the discrete property. In this paper, we propose a novel random walk-based graph matching algorithm by incorporating both continuous and discrete constraints in the optimization process. Specifically, after interpreting graph matching by random walk, the continuous constraints are directly embedded in the random walk constraint in each iteration. Further, both the assignment matrix (vector) and the pairwise similarity measure between graphs are iteratively updated according the discrete constraints, which automatically leads the continuous solution to the discrete domain. Comparisons on both synthetic and real-world data demonstrate the effectiveness of the proposed algorithm.