Select
A Formal Research on User Needs and Functions of Products Based on Affair-element Theory
Li Wen-jun, Yang Chun-yan
Journal of Guangdong University of Technology. 2017, 34 (06): 1-8.
DOI: 10.12052/gdutxb.170133
A study is conducted into the process of getting customer demands during the process of product design and development finding the way of avoiding the missing information during investigating customer demands. Based on the theory of affair-element in Extenics, a formal research is made on the front-end process of product development from user "needs", that is, the sources of the user demands. The methods of acquiring user needs and setting up the affair-element models of user needs, the importance degree analysis methods and the calculation model of user needs, the method that user need models to map into the product function models, and so on. Through a formal research of user needs and products' functions, a good solution can be derived to the problem for the product development of information on the first floor, which will contribute to the product development team in developing new products meeting user demands.
Related Articles |
Metrics
Select
Convolutional Neural Network Algorithm and Case
Chen Xu, Zhang Jun, Chen Wen-wei, Li Shuo-hao
Journal of Guangdong University of Technology. 2017, 34 (06): 20-26.
DOI: 10.12052/gdutxb.170093
Convolutional neural network (CNN) is a deep learning model with strong expression and classification ability, and is currently widely used, but there are a variety of specific algorithms. In this paper, the realization of deep learning algorithm based on convolutional neural network CNN, including the function of convolution kernel, the role of pooling, the selection of activation function and the training process are discussed. And one example is explained, which facilitates the mastery of CNN. Finally, the future research direction of convolution neural network is summarized and forecasted.
Related Articles |
Metrics
Select
An Improved Recommendation Method Using Rating and Review Information
Zhang Wei, Huang Jian-hua, Liu Dong-ning, Teng Shao-hua, Liu Zi-ting
Journal of Guangdong University of Technology. 2017, 34 (06): 27-31,48.
DOI: 10.12052/gdutxb.170014
With the Internet technology and modern E-commerce becoming popular, the recommender system has been widely used, but two problems of most recommendation algorithms still remain, i.e. cold start and explanatory problem. Based on the HFT (Hidden Factors and Hidden Topics) model which combines the review and rating information, an improved HFT model is proposed. By adding the free vector in order to capture the review information not discussed in the HFT model, the two problems can be released and the model accuracy improved. At last, the two large datasets shows that the proposed model is better than the HFT model in accuracy, which can largely benefit the use of review information.
Related Articles |
Metrics
Select
An Improved FREAK Algorithm for Image Feature Point Matching
Ye Zhi-jian, Wang Fu-long
Journal of Guangdong University of Technology. 2017, 34 (06): 37-42.
DOI: 10.12052/gdutxb.170034
FREAK algorithm has the defects of not having scale invariance and single feature point matching strategy, and being prone to unsatisfactory results. Based on SIFT and RANSAC algorithm, an improved FREAK algorithm is proposed: SFREAK (SIFT and FREAK). First of all, in the generation of Gauss differential Pyramid image, the feature points are detected with scale invariance; then the feature points are described with FREAK descriptor, obtaining binary descriptor; finally, in the process of feature points matching using Hamming distance matching for coarse matching, the matching points are purified with RANSAC algorithm, and the feature points of two images are matched. The experimental results show that the proposed algorithm can effectively solve the FREAK not having scale invariance in image scaling, and SFREAK algorithm for feature point matching accuracy rate reached 95.7%, increased by 61.9% compared with FREAK. Therefore, compared with the traditional SIFT algorithm and FREAK algorithm, the improved algorithm shows better robustness.
Related Articles |
Metrics
Select
An Aspect-oriented Requirement Analysis Based on Formal Method
Qu Can, Zhang Li-chen
Journal of Guangdong University of Technology. 2017, 34 (06): 54-60,67.
DOI: 10.12052/gdutxb.160144
Aspect-Oriented Programming (AOP) can effectively solve the code-tangling and code-scattering caused by crosscutting attributes; however, much work is presented on the programming and the implementation phase, and little has addressed the early model stages. A research is conducted on the requirements engineering phase of software by using AOP technology. First in the requirements analysis phase, the functional requirements and non-functional requirements are identified by the separation of concerns, and the functional requirements with components and the non-functional requirements with aspects are realized. Then the components and aspects are represented by combining with the formal language Aspect-Z which has the characteristics of accurate description. As actions accompany conflicts while two or more aspects affect the same joint point synchronously, a method is proposed to solve by defining aspects' priority level. In the end, the properties and attributes of the described requirements are deduced by the theorem proving method, so as to achieve the purpose of formal verification of Aspect-Z specifications. Finally, an application example is given.
Related Articles |
Metrics
Select
Unit Commitment Optimization Based on Hybrid Crisscross Optimization Algorithm
Ma Liu-yang, Meng An-bo, Yin Hao
Journal of Guangdong University of Technology. 2017, 34 (06): 68-72,77.
DOI: 10.12052/gdutxb.160161
With regard to the characteristics of the unit commitment problem, a hybrid crisscross optimization algorithm (CSO) is proposed, discrete CSO and continuous CSO are used for the unit status scheduling and power economic dispatch, respectively. In the process of evolution, horizontal crossover performs crossover on the same dimension of different particles to guarantee the global convergence ability, and vertical crossover performs crossover on different dimensions of the same particle to overcome the local optimal convergence, and the perfect combination of the two crossovers by a competitive algorithm not only speeds up the convergence rate but also ensures the ability of the global constraints. The heuristic strategy is introduced to modify the constraint conditions, such as the minimum up and down time and the power balance, which can effectively improve the accuracy of the solution. The feasibility and superiority of the proposed algorithm are verified by the simulation of two examples and the comparison with other algorithms.
Related Articles |
Metrics