Time filter

Source Type

Zhang J.,Jilin University | Zhang J.,Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education | Jia X.,Jilin University | Li J.,Jilin University
Journal of Intelligent and Fuzzy Systems

In order to detect lane rapidly and accurately, the integration of scanning and image processing algorithms (SIP) based on the fuzzy method is proposed. Further, combination of the proposed algorithm with an adaptive threshold value for image binarization, the least-square method and Bessel curve algorithm are proposed for detection and to fit the lane. The proposed SIP algorithm was evaluated by various tests. The experimental results indicate that the average time consumed for the detection of lane in each frame is 16.7639 ms, and the accuracy of lane detection is 95. The proposed algorithm demonstrates good robustness, and can be used as the core algorithm for further application in lane departure warning systems. © 2015 - IOS Press and the authors. All rights reserved. Source

Chen K.,Jilin University | Chen K.,Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education | Zhao J.,Zhengzhou University of Light Industry | Zuo W.,Jilin University | And 2 more authors.
Journal of Convergence Information Technology

This paper proposed a complex ontology evolution based method of extracting data, and also completely designed an extraction system, which consists of four important components: Resolver, Extractor, Consolidator and the ontology construction components. The system gives priority to the construction of mini-ontology. When the user submits query keywords to the deep web query interface, the returned result will pass through the prior three components; after that, the final execution result will be returned to user in a unified form. This paper adopted an extraction method that is different from the general ontology extraction. More specifically, the ontology used in extraction here is dynamic evolution, which can adapt various data source better. Experimental results proved that this method could effectively extract the data in the query result pages. Source

Chen Y.,Jilin University | Chen Y.,Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education | Zuo W.,Jilin University | He F.,Jilin University | Chen K.,Jilin University
Journal of Convergence Information Technology

Chip Multi-Processor (CMP) could support more than two threads to execute simultaneously, and some executing units are owned by each core. Because threads share various resources of CMP, such as L2-Cache, among many threads, CMP system is inherently different from multiprocessors system and, CMP is also different from simultaneously multithreading (SMT). In this paper a novel and complete approach on how to parallelism for relational database multithreaded query execution that strives for maximum resource utilization for both CPU and disk activities. The focus of this approach is on how to use the multithreaded parallel technique to optimize and process queries based on multi-core architecture. A set of algorithms for implementing and optimizing the best query plan, such as the algorithms for scheduling and parallel executing the query plan, the algorithms for allocating thread to sub-query and memory to the buffers between operations in pipelining execution, are proposed in this method. Additionally this paper analysis and optimize the implementation of parallel buffers and multithread. In the experiments, this paper evaluates performance of the parallel buffers and tests the coordination of the multithread. Source

Zhang J.,Jilin University | Zhang J.,Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education | Jia X.,Jilin University | Zhou Z.,Jilin University

To tackle the string stability problem of a vehicle platoon, an efficient collision prevention pre-compensation control algorithm called CPPC is proposed in this paper. In the algorithm, acceleration, speed, location, communication delay and spacing errors are introduced. The safe distance between vehicles is used to keep driving safety. We evaluate our algorithm experimentally using simulation method and compared it with the no string stability control algorithm. It reveals very encouraging simulation results indicate effectiveness of the proposed approach. © 2015 Elsevier GmbH. Source

Peng T.,Jilin University | Peng T.,University of Illinois at Urbana - Champaign | Peng T.,Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education | Liu L.,Jilin University | Liu L.,University of Illinois at Urbana - Champaign
Applied Soft Computing Journal

As a data mining method, clustering, which is one of the most important tools in information retrieval, organizes data based on unsupervised learning which means that it does not require any training data. But, some text clustering algorithms cannot update existing clusters incrementally and, instead, have to recompute a new clustering from scratch. In view of above, this paper presents a novel down-top incremental conceptual hierarchical text clustering approach using CFu-tree (ICHTC-CF) representation, which starts with each item as a separate cluster. Term-based feature extraction is used for summarizing a cluster in the process. The Comparison Variation measure criterion is also adopted for judging whether the closest pair of clusters can be merged or a previous cluster can be split. And, our incremental clustering method is not sensitive to the input data order. Experimental results show that the performance of our method outperforms k-means, CLIQUE, single linkage clustering and complete linkage clustering, which indicate our new technique is efficient and feasible. © 2014 Elsevier B.V. All rights reserved. Source

Discover hidden collaborations