Abstract: A method of outlier detection includes steps as follows. Distances from an input data point to a plurality of subspaces respectively are calculated. A minimum distance is selected from the distances to leave one or more remaining distances. The one or more remaining distances are utilized to normalize the minimum distance to obtain the normalized distance value. Whether the normalized distance value is greater than a threshold value is detected, so as to output a detection result.

Abstract: Methods for concurrent paging, in a cellular system having a number of users, where the users are paged to determine a location of each user, are disclosed. The paging from one cell to one of the users occurs within one of a number of time slots. The time slot in which one of the users is paged from one of the cells is a characteristic of that cell and that user. An array encompassing the totality of the characteristics time slots constitutes a search schedule. One method comprises minimizing a characteristic function of paging performance, the function depending on the search schedule and the probability of finding a user in a cell, and, determining, from the minimization of the characteristic function, the search schedule. Two other methods for determining a search schedule, which are more computationally efficient and which reduce the paging cost, the simple heuristic and the conditional probability heuristic, are disclosed.

Abstract: Methods for concurrent paging, in a cellular system having a number of users, where the users are paged to determine a location of each user, are disclosed. The paging from one cell to one of the users occurs within one of a number of time slots. The time slot in which one of the users is paged from one of the cells is a characteristic of that cell and that user. An array encompassing the totality of the characteristics time slots constitutes a search schedule. One method comprises minimizing a characteristic function of paging performance, the function depending on the search schedule and the probability of finding a user in a cell, and, determining, from the minimization of the characteristic function, the search schedule. Two other methods for determining a search schedule, which are more computationally efficient and which reduce the paging cost, the simple heuristic and the conditional probability heuristic, are disclosed.