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.
Membrane computing also called P system, seeks to discover new computational models from the study of cellular membranes. In this study, we reported our initial efforts to classify Macao visitor expenditure profile using a membrane computing approach. Specifically, we designed a novel P system including specific membrane structure and membrane rules to realize an improved k-medoids clustering algorithm...
Device-free localization (DFL) is expected to detect and locate a person by measuring the changes of received signals in wireless sensor networks without the need of any device. Fingerprint-based DFL in changeable environments has attracted wide attenuation in recent years. However, the accuracy of fingerprint-based localization could be improved further in changing environments. In this paper, we...
Airline fleet assignment problem, which means assigning right aircraft types to proper flights to make airlines' profit maximum, is an important part in airline production schedule and organization. Though analyzing the characteristic of chinese single hub and spoke network, we compose flight pairings by connecting the time and space associated flights. Then, according to the departure and complete...
An algorithm, TBCClustering, is presented in the paper for clustering GML documents using maximal frequent induced subtree patterns. TBCClustering mines the maximal frequent induced subtrees by using the structural information of GML documents, it can get the best minimum support automatically, and then chooses a set of subtree patterns to form the optimistic clustering features. Finally it uses CLOPE...
In data mining, SVD is a popular method that has been used for compressing high dimensional data. Binary matrix factorization (BMF) is a variant of SVD. There are two methods for binary factorization compression: the iterative heuristic and greedy algorithms. However, both of them are not perfect in applications. The iterative heuristic does not guarantee the convergence in most cases and greedy algorithms...
Based on adaptive rood pattern search (ARPS) algorithm, a new fast and efficient motion estimation algorithm called enhanced adaptive rood pattern search (E-ARPS) is proposed in this paper. Unlike ARPS, the E-ARPS utilizes spatial correlations to predict the initial search centre, then introduces a new initial search based on motion vector(MV) centre-biased distribution , and an adaptive unequal-arm...
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.