It is still a laborious work to consult massive multidisciplinary geological maps which are scattered in different geological departments,and hard to give full play to the potential application value of geological map...It is still a laborious work to consult massive multidisciplinary geological maps which are scattered in different geological departments,and hard to give full play to the potential application value of geological map. Along with the network,the development of communication and computer technology,especially with the Web2.0 technology arisen,provides opportunities to the web for sharing of geological maps. Web fast sharing platform of massive geological maps( WSPGM) is based on the Flex technology development,using B/S architecture,with map navigation,search,display,security and other functions of the software system. Through the map pretreatment and asynchronous communication the system can display any size of geological map,and through the range limits,rights management,sharing system and watermark logo to take effective security on geological map. On the basis of this system,with the Jilin University web sharing system of geological map,the system can greatly improve the efficiency of using geological map. for research.展开更多
Factor graph, so named because it graphically represents function factorization, with which and its sum-product algorithm the iterative algorithm can be derived clearly. An iterative multiuser receiver based on factor...Factor graph, so named because it graphically represents function factorization, with which and its sum-product algorithm the iterative algorithm can be derived clearly. An iterative multiuser receiver based on factor graph for asynchronous coded CDMA system is proposed. In this paper, the a posteriori probability of users information bits conditioned on the noise-whitening filters output is represented by factor graphs, after numbers of iterations with the sum-product algorithm the information bits are estimated. The authors also propose a reduced complexity algorithm. Simulation results show that with this proposed receiver, near-single-user performance can be achieved, and small performance degradation for the reduced complexity algorithm with significant complexity reduction.展开更多
文摘It is still a laborious work to consult massive multidisciplinary geological maps which are scattered in different geological departments,and hard to give full play to the potential application value of geological map. Along with the network,the development of communication and computer technology,especially with the Web2.0 technology arisen,provides opportunities to the web for sharing of geological maps. Web fast sharing platform of massive geological maps( WSPGM) is based on the Flex technology development,using B/S architecture,with map navigation,search,display,security and other functions of the software system. Through the map pretreatment and asynchronous communication the system can display any size of geological map,and through the range limits,rights management,sharing system and watermark logo to take effective security on geological map. On the basis of this system,with the Jilin University web sharing system of geological map,the system can greatly improve the efficiency of using geological map. for research.
基金the National Science Foundation of China and Key Subject Project of the Ministry of Education.
文摘Factor graph, so named because it graphically represents function factorization, with which and its sum-product algorithm the iterative algorithm can be derived clearly. An iterative multiuser receiver based on factor graph for asynchronous coded CDMA system is proposed. In this paper, the a posteriori probability of users information bits conditioned on the noise-whitening filters output is represented by factor graphs, after numbers of iterations with the sum-product algorithm the information bits are estimated. The authors also propose a reduced complexity algorithm. Simulation results show that with this proposed receiver, near-single-user performance can be achieved, and small performance degradation for the reduced complexity algorithm with significant complexity reduction.
