The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
It is a common demand to solve regional limited problem in Internet of Vehicles (IoV) system with restricted time and storage requirements. In this paper, we present a fast point-in-area algorithm to tackle this problem. In the preprocessing phase, non-uniform grids are constructed by length thresholds and each row of the grids is viewed as a scan-line. The scan-lines scan area from top to bottom...
Design pattern is an effective way to describe software architecture. But with the increasing size and complexity of the software, it is difficult to recognize design patterns are used in software. In order to comprehend and maintain software system, a lot of detecting design pattern algorithms were proposed. In this paper, we proposed an algorithm to discovery design patterns more efficient by automatic...
Problem-based learning is particularly suitable to a multidimensional software engineering course. This paper describes the use of problem-based learning in a course ??Advanced Software Engineering?? given at Xiamen University, P. R. China. This approach is conducted a blended learning environment, a combination of a face-to-face learning environment and ELearning environment. A learning manage system...
A new approach to the problem of graph isomorphism detection base on decision tree is proposed. It is based on the approach proposed by B. T. Messmer and H. Bunke. If the time needed for preprocessing is neglected, the computational complexity of their approach is only polynomial in the number of input graph vertices. However, the decision tree is of exponential size. It's not practical for the graphs...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.