Recently clustering techniques have been used to automatically discover typical user profiles. In general, it is a challenging problem to design effective similarity measure between the session vectors which are usual...Recently clustering techniques have been used to automatically discover typical user profiles. In general, it is a challenging problem to design effective similarity measure between the session vectors which are usually high-dimensional and sparse. Two approaches for mining typical user profiles, based on matrix dimensionality reduction, are presented. In these approaches, non-negative matrix factorization is applied to reduce dimensionality of the session-URL matrix, and the projecting vectors of the user-session vectors are clustered into typical user-session profiles using the spherical k -means algorithm. The results show that two algorithms are successful in mining many typical user profiles in the user sessions.展开更多
The environment modeling algorithm named rectangular decomposition, which is composed of cellular nodes and interleaving networks, is proposed. The principle of environment modeling is to divide the environment into i...The environment modeling algorithm named rectangular decomposition, which is composed of cellular nodes and interleaving networks, is proposed. The principle of environment modeling is to divide the environment into individual square sub-areas. Each sub-area is orientated by the central point of the sub-areas called a node. The rectangular map based on the square map can enlarge the square area side size to increase the coverage efficiency in the case of there being an adjacent obstacle. Based on this algorithm, a new coverage algorithm, which includes global path planning and local path planning, is introduced. In the global path planning, uncovered subspaces are found by using a special rule. A one-dimensional array P, which is used to obtain the searching priority of node in every direction, is defined as the search rule. The array P includes the condition of coverage towards the adjacent cells, the condition of connectivity and the priorities defined by the user in all eight directions. In the local path planning, every sub-area is covered by using template models according to the shape of the environment. The simulation experiments show that the coverage algorithm is simple, efficient and adapted for complex two- dimensional environments.展开更多
This paper presents truncation errors among Corrector Formula for left Rectangular rule and Corrector Formula for middle Rectangular rule respectively. It also displays an analysis on convergence order of compound cor...This paper presents truncation errors among Corrector Formula for left Rectangular rule and Corrector Formula for middle Rectangular rule respectively. It also displays an analysis on convergence order of compound corrector formulas for rectangular rule. Examples of numerical calculation have validated theoretical analysis.展开更多
To achieve high parallel efficiency for the global MASNUM surface wave model, the algorithm of an irregular quasirectangular domain decomposition and related serializing of calculating points and data exchanging schem...To achieve high parallel efficiency for the global MASNUM surface wave model, the algorithm of an irregular quasirectangular domain decomposition and related serializing of calculating points and data exchanging schemes are developed and conducted, based on the environment of Message Passing Interface(MPI). The new parallel version of the surface wave model is tested for parallel computing on the platform of the Sunway BlueLight supercomputer in the National Supercomputing Center in Jinan. The testing involves four horizontal resolutions, which are 1°×1°,(1/2)°×(1/2)°,(1/4)°×(1/4)°, and(1/8)°×(1/8)°. These tests are performed without data Input/Output(IO) and the maximum amount of processors used in these tests reaches to 131072. The testing results show that the computing speeds of the model with different resolutions are all increased with the increasing of numbers of processors. When the number of processors is four times that of the base processor number, the parallel efficiencies of all resolutions are greater than 80%. When the number of processors is eight times that of the base processor number, the parallel efficiency of tests with resolutions of 1°×1°,(1/2)°×(1/2)° and(1/4)°×(1/4)° is greater than 80%, and it is 62% for the test with a resolution of(1/8)°×(1/8)° using 131072 processors, which is the nearly all processors of Sunway BlueLight. When the processor's number is 24 times that of the base processor number, the parallel efficiencies for tests with resolutions of 1°×1°,(1/2)°×(1/2)°, and(1/4)°×(1/4)° are 72%, 62%, and 38%, respectively. The speedup and parallel efficiency indicate that the irregular quasi-rectangular domain decomposition and serialization schemes lead to high parallel efficiency and good scalability for a global numerical wave model.展开更多
This paper aims at developing a "local-global" approach for various types of finite dimensional algebras, especially those related to Hecke algebras. The eventual intention is to apply the methods and applic...This paper aims at developing a "local-global" approach for various types of finite dimensional algebras, especially those related to Hecke algebras. The eventual intention is to apply the methods and applications developed here to the cross-characteristic representation theory of finite groups of Lie type. We first review the notions of quasi-hereditary and stratified algebras over a Noetherian commutative ring. We prove that many global properties of these algebras hold if and only if they hold locally at every prime ideal. When the commutative ring is sufficiently good, it is often sufficient to check just the prime ideals of height at most one. These methods are applied to construct certain generalized q-Schur algebras, proving they are often quasi-hereditary(the "good" prime case) but always stratified. Finally, these results are used to prove a triangular decomposition matrix theorem for the modular representations of Hecke algebras at good primes. In the bad prime case, the generalized q-Schur algebras are at least stratified, and a block triangular analogue of the good prime case is proved, where the blocks correspond to Kazhdan-Lusztig cells.展开更多
文摘Recently clustering techniques have been used to automatically discover typical user profiles. In general, it is a challenging problem to design effective similarity measure between the session vectors which are usually high-dimensional and sparse. Two approaches for mining typical user profiles, based on matrix dimensionality reduction, are presented. In these approaches, non-negative matrix factorization is applied to reduce dimensionality of the session-URL matrix, and the projecting vectors of the user-session vectors are clustered into typical user-session profiles using the spherical k -means algorithm. The results show that two algorithms are successful in mining many typical user profiles in the user sessions.
基金The National Natural Science Foundation of China(No.50475076)the National High Technology Research and Development Pro-gram of China(863Program)(No.2006AA04Z234)
文摘The environment modeling algorithm named rectangular decomposition, which is composed of cellular nodes and interleaving networks, is proposed. The principle of environment modeling is to divide the environment into individual square sub-areas. Each sub-area is orientated by the central point of the sub-areas called a node. The rectangular map based on the square map can enlarge the square area side size to increase the coverage efficiency in the case of there being an adjacent obstacle. Based on this algorithm, a new coverage algorithm, which includes global path planning and local path planning, is introduced. In the global path planning, uncovered subspaces are found by using a special rule. A one-dimensional array P, which is used to obtain the searching priority of node in every direction, is defined as the search rule. The array P includes the condition of coverage towards the adjacent cells, the condition of connectivity and the priorities defined by the user in all eight directions. In the local path planning, every sub-area is covered by using template models according to the shape of the environment. The simulation experiments show that the coverage algorithm is simple, efficient and adapted for complex two- dimensional environments.
文摘This paper presents truncation errors among Corrector Formula for left Rectangular rule and Corrector Formula for middle Rectangular rule respectively. It also displays an analysis on convergence order of compound corrector formulas for rectangular rule. Examples of numerical calculation have validated theoretical analysis.
基金supported by National Basic Research Program of China (Grant Nos. 2010CB950300, 2010CB950500)Public Science and Technology Research Funds Projects of Ocean (Grant No. 201105019)+1 种基金Key Supercomputing Science-Technology Project of Shandong Province of China (Grant No. 2011YD01107)Scientific Research Foundation of the First Institute of Oceanography, State Oceanic Administration (Grant No. GY02-2010G22)
文摘To achieve high parallel efficiency for the global MASNUM surface wave model, the algorithm of an irregular quasirectangular domain decomposition and related serializing of calculating points and data exchanging schemes are developed and conducted, based on the environment of Message Passing Interface(MPI). The new parallel version of the surface wave model is tested for parallel computing on the platform of the Sunway BlueLight supercomputer in the National Supercomputing Center in Jinan. The testing involves four horizontal resolutions, which are 1°×1°,(1/2)°×(1/2)°,(1/4)°×(1/4)°, and(1/8)°×(1/8)°. These tests are performed without data Input/Output(IO) and the maximum amount of processors used in these tests reaches to 131072. The testing results show that the computing speeds of the model with different resolutions are all increased with the increasing of numbers of processors. When the number of processors is four times that of the base processor number, the parallel efficiencies of all resolutions are greater than 80%. When the number of processors is eight times that of the base processor number, the parallel efficiency of tests with resolutions of 1°×1°,(1/2)°×(1/2)° and(1/4)°×(1/4)° is greater than 80%, and it is 62% for the test with a resolution of(1/8)°×(1/8)° using 131072 processors, which is the nearly all processors of Sunway BlueLight. When the processor's number is 24 times that of the base processor number, the parallel efficiencies for tests with resolutions of 1°×1°,(1/2)°×(1/2)°, and(1/4)°×(1/4)° are 72%, 62%, and 38%, respectively. The speedup and parallel efficiency indicate that the irregular quasi-rectangular domain decomposition and serialization schemes lead to high parallel efficiency and good scalability for a global numerical wave model.
基金supported by a 2017 University of New South Wales Science Goldstar Grant(Jie Du)the Simons Foundation(Grant Nos. #359360(Brian Parshall) and #359363 (Leonard Scott))
文摘This paper aims at developing a "local-global" approach for various types of finite dimensional algebras, especially those related to Hecke algebras. The eventual intention is to apply the methods and applications developed here to the cross-characteristic representation theory of finite groups of Lie type. We first review the notions of quasi-hereditary and stratified algebras over a Noetherian commutative ring. We prove that many global properties of these algebras hold if and only if they hold locally at every prime ideal. When the commutative ring is sufficiently good, it is often sufficient to check just the prime ideals of height at most one. These methods are applied to construct certain generalized q-Schur algebras, proving they are often quasi-hereditary(the "good" prime case) but always stratified. Finally, these results are used to prove a triangular decomposition matrix theorem for the modular representations of Hecke algebras at good primes. In the bad prime case, the generalized q-Schur algebras are at least stratified, and a block triangular analogue of the good prime case is proved, where the blocks correspond to Kazhdan-Lusztig cells.
