Dataset classification is an essential fundament of computational intelligence in cyber-physical systems(CPS).Due to the complexity of CPS dataset classification and the uncertainty of clustering number,this paper foc...Dataset classification is an essential fundament of computational intelligence in cyber-physical systems(CPS).Due to the complexity of CPS dataset classification and the uncertainty of clustering number,this paper focuses on clarifying the dynamic behavior of acceleration dataset which is achieved from micro electro mechanical systems(MEMS)and complex image segmentation.To reduce the impact of parameters uncertainties with dataset classification,a novel robust dataset classification approach is proposed based on neighbor searching and kernel fuzzy c-means(NSKFCM)methods.Some optimized strategies,including neighbor searching,controlling clustering shape and adaptive distance kernel function,are employed to solve the issues of number of clusters,the stability and consistency of classification,respectively.Numerical experiments finally demonstrate the feasibility and robustness of the proposed method.展开更多
A hybrid carrier(HC) scheme based on weighted-type fractional Fourier transform(WFRFT) has been proposed recently.While most of the works focus on HC scheme's inherent characteristics, little attention is paid to...A hybrid carrier(HC) scheme based on weighted-type fractional Fourier transform(WFRFT) has been proposed recently.While most of the works focus on HC scheme's inherent characteristics, little attention is paid to the WFRFT modulation recognition.In this paper, a new theory is provided to recognize the WFRFT modulation based on higher order cumulants(HOC). First, it is deduced that the optimal WFRFT received order can be obtained through the minimization of 4 th-order cumulants, C_(42). Then, a combinatorial searching algorithm is designed to minimize C_(42).Finally, simulation results show that the designed scheme has a high recognition rate and the combinatorial searching algorithm is effective and reliable.展开更多
Artificial Searching Swarm Algorithm (ASSA) is a new optimization algorithm. ASSA simulates the soldiers to search an enemy’s important goal, and transforms the process of solving optimization problem into the proces...Artificial Searching Swarm Algorithm (ASSA) is a new optimization algorithm. ASSA simulates the soldiers to search an enemy’s important goal, and transforms the process of solving optimization problem into the process of searching optimal goal by searching swarm with set rules. This work selects complicated and highn dimension functions to deeply analyse the performance for unconstrained and constrained optimization problems and the results produced by ASSA, Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Artificial Fish-Swarm Algorithm (AFSA) have been compared. The main factors which influence the performance of ASSA are also discussed. The results demonstrate the effectiveness of the proposed ASSA optimization algorithm.展开更多
Two deficiencies in traditional iterative closest pointsimultaneous localization and mapping( ICP-SLAM) usually result in poor real-time performance. On one hand, relative position between current scan frame and globa...Two deficiencies in traditional iterative closest pointsimultaneous localization and mapping( ICP-SLAM) usually result in poor real-time performance. On one hand, relative position between current scan frame and global map cannot be previously known. As a result, ICP algorithm will take much amount of iterations to reach convergence. On the other hand,establishment of correspondence is done by global searching, which requires enormous computational time. To overcome the two problems,a fast ICP-SLAM with rough alignment and narrowing-scale nearby searching is proposed. As for the decrease of iterative times,rough alignment based on initial pose matrix is proposed. In detail,initial pose matrix is obtained by micro-electro-mechanical system( MEMS) magnetometer and global landmarks. Then rough alignment will be applied between current scan frame and global map at the beginning of ICP algorithm with initial pose matrix. As for accelerating the establishment of correspondence, narrowingscale nearby searching with dynamic threshold is proposed,where match-points are found within a progressively constrictive range.Compared to traditional ICP-SLAM,the experimental results show that the amount of iteration for ICP algorithm to reach convergence reduces to 92. 34% and ICP algorithm runtime reduces to 98. 86% on average. In addition,computational cost is kept in a stable level due to the eliminating of the accumulation of computational consumption. Moreover,great improvement can also been achieved in SLAM quality and robustness.展开更多
The current Grover quantum searching algorithm cannot identify the difference in importance of the search targets when it is applied to an unsorted quantum database, and the probability for each search target is equal...The current Grover quantum searching algorithm cannot identify the difference in importance of the search targets when it is applied to an unsorted quantum database, and the probability for each search target is equal. To solve this problem, a Grover searching algorithm based on weighted targets is proposed. First, each target is endowed a weight coefficient according to its importance. Applying these different weight coefficients, the targets are represented as quantum superposition states. Second, the novel Grover searching algorithm based on the quantum superposition of the weighted targets is constructed. Using this algorithm, the probability of getting each target can be approximated to the corresponding weight coefficient, which shows the flexibility of this algorithm. Finally, the validity of the algorithm is proved by a simple searching example.展开更多
A quantum image searching method is proposed based on the probability distributions of the readouts from the quantum measurements. It is achieved by using low computational resources which are only a single Hadamard g...A quantum image searching method is proposed based on the probability distributions of the readouts from the quantum measurements. It is achieved by using low computational resources which are only a single Hadamard gate combined with m + 1 quantum measurement operations. To validate the proposed method, a simulation experiment is used where the image with the highest similarity value of 0.93 to the particular test image is retrieved as the search result from 4 × 4 binary image database. The proposal provides a basic step for designing a search engine on quantum computing devices where the image in the database is retrieved based on its similarity to the test image.展开更多
Considering the characteristics of spatial straightness error, this paper puts forward a kind of evaluation method of spatial straightness error using Geometric Approximation Searching Algorithm (GASA). According to t...Considering the characteristics of spatial straightness error, this paper puts forward a kind of evaluation method of spatial straightness error using Geometric Approximation Searching Algorithm (GASA). According to the minimum condition principle of form error evaluation, the mathematic model and optimization objective of the GASA are given. The algorithm avoids the optimization and linearization, and can be fulfilled in three steps. First construct two parallel quadrates based on the preset two reference points of the spatial line respectively;second construct centerlines by connecting one quadrate each vertices to another quadrate each vertices;after that, calculate the distances between measured points and the constructed centerlines. The minimum zone straightness error is obtained by repeating comparing and reconstructing quadrates. The principle and steps of the algorithm to evaluate spatial straightness error is described in detail, and the mathematical formula and program flowchart are given also. Results show that this algorithm can evaluate spatial straightness error more effectively and exactly.展开更多
This paper discusses the approaches for automatical searching of control points in the NOAA AVHRR image on the basis of data rearrangement in the form of latitude and longitude grid. The vegetation index transformatio...This paper discusses the approaches for automatical searching of control points in the NOAA AVHRR image on the basis of data rearrangement in the form of latitude and longitude grid. The vegetation index transformation and multi-level matching strategies have been proven effective and successful as the experiments show while the control point database is established.展开更多
We propose an approach to prepare GHZ(Greenberger,Horne,Zeilinger)states of an arbitrary multi-particle system in terms of Grover's fast quantum searching algorithm.The approach can be used to produce other entang...We propose an approach to prepare GHZ(Greenberger,Horne,Zeilinger)states of an arbitrary multi-particle system in terms of Grover's fast quantum searching algorithm.The approach can be used to produce other entangled states with variou degrees of entanglement.展开更多
Bond valence method illustrates the relation between valence and length of a particular bond type. This theory has been used to predict structure information, but the effect is very limited. In this paper, two indexes...Bond valence method illustrates the relation between valence and length of a particular bond type. This theory has been used to predict structure information, but the effect is very limited. In this paper, two indexes, i.e., global instability index(GII) and bond strain index(BSI), are adopted as a judgment of a search-match program for prediction. The results show that with GII and BSI combined as judgment, the predicted atom positions are very close to real ones. The mechanism and validity of this searching program are also discussed. The GII & BSI distribution contour map reveals that the predicted function is a reflection of exponential feature of bond valence formula. This combined searching method may be integrated with other structure-determination method, and may be helpful in refining and testifying light atom positions.展开更多
Objective To propose a new dynamic extremum self searching method, which can be used in industrial processes extremum optimum control systems, to overcome the disadvantages of traditional method. Methods This algor...Objective To propose a new dynamic extremum self searching method, which can be used in industrial processes extremum optimum control systems, to overcome the disadvantages of traditional method. Methods This algorithm is based on correlation analysis. A pseudo random binary signal m sequence u(t) is added as probe signal in system input, construct cross correlation function between system input and output, the next step hunting direction is judged by the differential sign. Results Compared with traditional algorithm such as step forward hunting method, the iterative efficient, hunting precision and anti interference ability of the correlation analysis method is obvious over the traditional algorithm. The computer simulation experimental given illustrate these viewpoints. Conclusion The correlation analysis method can settle the optimum state point of device operating process. It has the advantage of easy condition , simple calculate process.展开更多
Geopolitically Kengtung region was located in a most strategic place in Myanmar. It shares borders with China on the north and Thailand on the east. Kengtung is a place which forms a significant historical site in the...Geopolitically Kengtung region was located in a most strategic place in Myanmar. It shares borders with China on the north and Thailand on the east. Kengtung is a place which forms a significant historical site in the easternmost part of Myanmar. From the geopolitical point of view, the region was located in a most strategic place. Its situation forced to safeguard the region. The town lies on a critical point of Myanmar’s defences. The restriction of exacting money as a yearly tribute did not concern for Kengtung. The tradition of paying homage was appeased to the King. The ruling Sawbwa which achieved the valuable return presents of the Burmese King. Kengtung came in the first class, and was the most important of the Myanmar’s possessions east of the Thanlwin River. Its position may be roughly judged by the tribute paid to the King and the contigent it was bound to supply to the royal army. Therefore, Kengtung was very important for the security of Myanmar’s eastern frontier during the Konbaung period. It was like a small Union within an Empire together with multinational races of Myanmar. A good deed of past events blanket over the town till today.展开更多
This paper presents a new scheme of flaw searching in surface modeling based on Euler Characteristic. This scheme can be applied to surface construction or reconstruction in computer. It is referred to as Euler Accomp...This paper presents a new scheme of flaw searching in surface modeling based on Euler Characteristic. This scheme can be applied to surface construction or reconstruction in computer. It is referred to as Euler Accompanying Test (EAT) algorithm in this paper. Two propositions in algebraic topology are presented, which are the foundation of the EAT algorithm. As the modeling is the first step for rendering in the animation and visualization, or computer-aided design (CAD) in related applications, the flaws can bring some serious problems in the final image or product, such as an artificial sense in animation rendering or a mistaken product in industry. To verify the EAT progressive procedure, a three-dimensional (3D) stamp model is constructed. The modeling process is accompanied by the EAT procedure. The EAT scheme is verified as the flaws in the stamp model are found and modified.展开更多
Searching the maximum bicliques or bipartite subgraphs in a graph is a tough question. We proposed a new and efficient method, Searching Quasi-Bicliques (SQB) algorithm, to detect maximum quasi-bicliques from protein-...Searching the maximum bicliques or bipartite subgraphs in a graph is a tough question. We proposed a new and efficient method, Searching Quasi-Bicliques (SQB) algorithm, to detect maximum quasi-bicliques from protein-protein interaction network. As a Divide-and-Conquer method, SQB consists of three steps: first, it divides the protein-protein interaction network into a number of Distance-2-Subgraphs;second, by combining top-down and branch-and-bound methods, SQB seeks quasi-bicliques from every Distance-2-Subgraph;third, all the redundant results are removed. We successfully applied our method on the Saccharomyces cerevisiae dataset and obtained 2754 distinct quasi-bicliques.展开更多
If you think that falling bank interestrates are paving the road to recovery forthe battered economies of Asia,think again.In China's Mainland and Hong Kong,rapidly falling prices have actually pushed upthe real c...If you think that falling bank interestrates are paving the road to recovery forthe battered economies of Asia,think again.In China's Mainland and Hong Kong,rapidly falling prices have actually pushed upthe real cost of capital despite successive re-ductions in bank interest rates in the past fewmonths.The impact of lower rates is surpris-ingly limited in Thailand,simply展开更多
Digital broadcasting is a novel paradigm for the next generation broadcasting. Its goal is to provide not only better quality of pictures but also a variety of services that is impossible in traditional airwaves broad...Digital broadcasting is a novel paradigm for the next generation broadcasting. Its goal is to provide not only better quality of pictures but also a variety of services that is impossible in traditional airwaves broadcasting. One of the important factors for this new broadcasting environment is the interoperability among broadcasting applications since the environment is distributed. Therefore the broadcasting metadata becomes increasingly important and one of the metadata standards for a digital broadcasting is TV-Anytime metadata. TV-Anytime metadata is defined using XML schema, so its instances are XML data. In order to fulfill interoperability, a standard query language is also required and XQuery is a natural choice. There are some researches for dealing with broadcasting metadata. In our previous study, we have proposed the method for efficiently managing the broadcasting metadata in a service provider. However, the environment of a Set-Top Box for digital broadcasting is limited such as low-cost and low-setting. Therefore there are some considerations to apply general approaches for managing the metadata into the Set-Top Box. This paper proposes a method for efficiently managing the broadcasting metadata based on the Set-Top Box and a prototype of metadata management system for evaluating our method. Our system consists of a storage engine to store the metadata and an XQuery engine to search the stored metadata and uses special index for storing and searching. Our two engines are designed independently with hardware platform therefore these engines can be used in any low-cost applications to manage broadcasting metadata.展开更多
The Liaoji Proterozoic rift is an inter-intracontinenatl rift developed from Archean granite-greenstone tectonic regime and contains many important mineral deposits of U, B, magnesite, Pb-Zn, Au, Ag, Co and P. These d...The Liaoji Proterozoic rift is an inter-intracontinenatl rift developed from Archean granite-greenstone tectonic regime and contains many important mineral deposits of U, B, magnesite, Pb-Zn, Au, Ag, Co and P. These deposits were formed as the result of late mobilization, transportation and concentfation of the previously enriched ore-forming mate- rials in several ore-bearing formations formed during the rift stage. So the metallogeny of these deposits in the rift shows both inheritance and new generation of the ore-forming materials. In future ore-searching practice, attentions should be paid on the studies of the ore-bearing formations in the rift, on the multiple stages of metallogeny and and on multiple derivations of the ore-forming materials.展开更多
The tiny searching step length and the satellite distribution density are the major factors to influence the efficiency of the satellite finder,so a scientific and reasonable method to calculate the tiny searching ste...The tiny searching step length and the satellite distribution density are the major factors to influence the efficiency of the satellite finder,so a scientific and reasonable method to calculate the tiny searching step length is proposed to optimize the satellite searching strategy. The pattern clustering and BP neural network are applied to optimize the tiny searching step length. The calculated tiny searching step length is approximately equal to the theoretic value for each satellite. In application,the satellite searching results will be dynamically added to the training samples to re-train the network to improve the generalizability and the precision. Experiments validate that the optimization of the tiny searching step length can avoid the error of locating target satellite and improve the searching efficiency.展开更多
Playing an increasingly important role in the security protection of the network information systems,the intrusion detection system(IDS) becomes a hotspot of research interest nowadays.However,this technology in the k...Playing an increasingly important role in the security protection of the network information systems,the intrusion detection system(IDS) becomes a hotspot of research interest nowadays.However,this technology in the kernel to many of these systems,namely string searching algorithm,has not received enough attention.By utilizing the concurrent mechanisms(multi-threading) provided by modern operation systems,such work can be divided symmetrically and thus improve the throughput of the corresponding application effectively.Presented in this work is a paralleled string searching algorithm-PBM,an algorithm based on the famous Boyer-Moore(BM) string searching algorithm.Taken as a dividable process,the string searching work is distributed between many cooperating threads of execution in the PBM algorithm,while each of them searches the target pattern in their respective share of the target strings.As compared with the traditional string searching algorithms,the PBM algorithm can do the pattern matching work faster by increasing the data processing throughput,thus adapting better to the drastic increase in the network band width.A simplification of the PBM algorithm that can be used as a multi-string searching algorithm is also suggested with supporting simulations,which is a promising approach when the number of target patterns is limited.展开更多
基金supported by National Natural Science Foundation of China(61403244,61304031)Key Project of Science and Technology Commission of Shanghai Municipality(14JC1402200)+3 种基金the Shanghai Municipal Commission of Economy and Informatization under Shanghai Industry-University-Research Collaboration(CXY-2013-71)the Science and Technology Commission of Shanghai Municipality under’Yangfan Program’(14YF1408600)National Key Scientific Instrument and Equipment Development Project(2012YQ15008703)Innovation Program of Shanghai Municipal Education Commission(14YZ007)
文摘Dataset classification is an essential fundament of computational intelligence in cyber-physical systems(CPS).Due to the complexity of CPS dataset classification and the uncertainty of clustering number,this paper focuses on clarifying the dynamic behavior of acceleration dataset which is achieved from micro electro mechanical systems(MEMS)and complex image segmentation.To reduce the impact of parameters uncertainties with dataset classification,a novel robust dataset classification approach is proposed based on neighbor searching and kernel fuzzy c-means(NSKFCM)methods.Some optimized strategies,including neighbor searching,controlling clustering shape and adaptive distance kernel function,are employed to solve the issues of number of clusters,the stability and consistency of classification,respectively.Numerical experiments finally demonstrate the feasibility and robustness of the proposed method.
基金supported by the National Natural Science Foundation of China(6127125061571460)
文摘A hybrid carrier(HC) scheme based on weighted-type fractional Fourier transform(WFRFT) has been proposed recently.While most of the works focus on HC scheme's inherent characteristics, little attention is paid to the WFRFT modulation recognition.In this paper, a new theory is provided to recognize the WFRFT modulation based on higher order cumulants(HOC). First, it is deduced that the optimal WFRFT received order can be obtained through the minimization of 4 th-order cumulants, C_(42). Then, a combinatorial searching algorithm is designed to minimize C_(42).Finally, simulation results show that the designed scheme has a high recognition rate and the combinatorial searching algorithm is effective and reliable.
文摘Artificial Searching Swarm Algorithm (ASSA) is a new optimization algorithm. ASSA simulates the soldiers to search an enemy’s important goal, and transforms the process of solving optimization problem into the process of searching optimal goal by searching swarm with set rules. This work selects complicated and highn dimension functions to deeply analyse the performance for unconstrained and constrained optimization problems and the results produced by ASSA, Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Artificial Fish-Swarm Algorithm (AFSA) have been compared. The main factors which influence the performance of ASSA are also discussed. The results demonstrate the effectiveness of the proposed ASSA optimization algorithm.
文摘Two deficiencies in traditional iterative closest pointsimultaneous localization and mapping( ICP-SLAM) usually result in poor real-time performance. On one hand, relative position between current scan frame and global map cannot be previously known. As a result, ICP algorithm will take much amount of iterations to reach convergence. On the other hand,establishment of correspondence is done by global searching, which requires enormous computational time. To overcome the two problems,a fast ICP-SLAM with rough alignment and narrowing-scale nearby searching is proposed. As for the decrease of iterative times,rough alignment based on initial pose matrix is proposed. In detail,initial pose matrix is obtained by micro-electro-mechanical system( MEMS) magnetometer and global landmarks. Then rough alignment will be applied between current scan frame and global map at the beginning of ICP algorithm with initial pose matrix. As for accelerating the establishment of correspondence, narrowingscale nearby searching with dynamic threshold is proposed,where match-points are found within a progressively constrictive range.Compared to traditional ICP-SLAM,the experimental results show that the amount of iteration for ICP algorithm to reach convergence reduces to 92. 34% and ICP algorithm runtime reduces to 98. 86% on average. In addition,computational cost is kept in a stable level due to the eliminating of the accumulation of computational consumption. Moreover,great improvement can also been achieved in SLAM quality and robustness.
基金the National Natural Science Foundation of China (60773065).
文摘The current Grover quantum searching algorithm cannot identify the difference in importance of the search targets when it is applied to an unsorted quantum database, and the probability for each search target is equal. To solve this problem, a Grover searching algorithm based on weighted targets is proposed. First, each target is endowed a weight coefficient according to its importance. Applying these different weight coefficients, the targets are represented as quantum superposition states. Second, the novel Grover searching algorithm based on the quantum superposition of the weighted targets is constructed. Using this algorithm, the probability of getting each target can be approximated to the corresponding weight coefficient, which shows the flexibility of this algorithm. Finally, the validity of the algorithm is proved by a simple searching example.
文摘A quantum image searching method is proposed based on the probability distributions of the readouts from the quantum measurements. It is achieved by using low computational resources which are only a single Hadamard gate combined with m + 1 quantum measurement operations. To validate the proposed method, a simulation experiment is used where the image with the highest similarity value of 0.93 to the particular test image is retrieved as the search result from 4 × 4 binary image database. The proposal provides a basic step for designing a search engine on quantum computing devices where the image in the database is retrieved based on its similarity to the test image.
文摘Considering the characteristics of spatial straightness error, this paper puts forward a kind of evaluation method of spatial straightness error using Geometric Approximation Searching Algorithm (GASA). According to the minimum condition principle of form error evaluation, the mathematic model and optimization objective of the GASA are given. The algorithm avoids the optimization and linearization, and can be fulfilled in three steps. First construct two parallel quadrates based on the preset two reference points of the spatial line respectively;second construct centerlines by connecting one quadrate each vertices to another quadrate each vertices;after that, calculate the distances between measured points and the constructed centerlines. The minimum zone straightness error is obtained by repeating comparing and reconstructing quadrates. The principle and steps of the algorithm to evaluate spatial straightness error is described in detail, and the mathematical formula and program flowchart are given also. Results show that this algorithm can evaluate spatial straightness error more effectively and exactly.
基金Project supported by the National Oommission of Defense Science and Technotocjy(No.Y96-10)
文摘This paper discusses the approaches for automatical searching of control points in the NOAA AVHRR image on the basis of data rearrangement in the form of latitude and longitude grid. The vegetation index transformation and multi-level matching strategies have been proven effective and successful as the experiments show while the control point database is established.
基金Supported by the National Natural Science Foundation of China under Grant No.19674013,Natural Science Foundation of Hu'nan Province(97JJY2051)Educational Committee Foundation of Hu5nan Province(98B028).
文摘We propose an approach to prepare GHZ(Greenberger,Horne,Zeilinger)states of an arbitrary multi-particle system in terms of Grover's fast quantum searching algorithm.The approach can be used to produce other entangled states with variou degrees of entanglement.
基金Project supported by the National Natural Science Foundation of China(Grant No.51272027)
文摘Bond valence method illustrates the relation between valence and length of a particular bond type. This theory has been used to predict structure information, but the effect is very limited. In this paper, two indexes, i.e., global instability index(GII) and bond strain index(BSI), are adopted as a judgment of a search-match program for prediction. The results show that with GII and BSI combined as judgment, the predicted atom positions are very close to real ones. The mechanism and validity of this searching program are also discussed. The GII & BSI distribution contour map reveals that the predicted function is a reflection of exponential feature of bond valence formula. This combined searching method may be integrated with other structure-determination method, and may be helpful in refining and testifying light atom positions.
文摘Objective To propose a new dynamic extremum self searching method, which can be used in industrial processes extremum optimum control systems, to overcome the disadvantages of traditional method. Methods This algorithm is based on correlation analysis. A pseudo random binary signal m sequence u(t) is added as probe signal in system input, construct cross correlation function between system input and output, the next step hunting direction is judged by the differential sign. Results Compared with traditional algorithm such as step forward hunting method, the iterative efficient, hunting precision and anti interference ability of the correlation analysis method is obvious over the traditional algorithm. The computer simulation experimental given illustrate these viewpoints. Conclusion The correlation analysis method can settle the optimum state point of device operating process. It has the advantage of easy condition , simple calculate process.
文摘Geopolitically Kengtung region was located in a most strategic place in Myanmar. It shares borders with China on the north and Thailand on the east. Kengtung is a place which forms a significant historical site in the easternmost part of Myanmar. From the geopolitical point of view, the region was located in a most strategic place. Its situation forced to safeguard the region. The town lies on a critical point of Myanmar’s defences. The restriction of exacting money as a yearly tribute did not concern for Kengtung. The tradition of paying homage was appeased to the King. The ruling Sawbwa which achieved the valuable return presents of the Burmese King. Kengtung came in the first class, and was the most important of the Myanmar’s possessions east of the Thanlwin River. Its position may be roughly judged by the tribute paid to the King and the contigent it was bound to supply to the royal army. Therefore, Kengtung was very important for the security of Myanmar’s eastern frontier during the Konbaung period. It was like a small Union within an Empire together with multinational races of Myanmar. A good deed of past events blanket over the town till today.
文摘This paper presents a new scheme of flaw searching in surface modeling based on Euler Characteristic. This scheme can be applied to surface construction or reconstruction in computer. It is referred to as Euler Accompanying Test (EAT) algorithm in this paper. Two propositions in algebraic topology are presented, which are the foundation of the EAT algorithm. As the modeling is the first step for rendering in the animation and visualization, or computer-aided design (CAD) in related applications, the flaws can bring some serious problems in the final image or product, such as an artificial sense in animation rendering or a mistaken product in industry. To verify the EAT progressive procedure, a three-dimensional (3D) stamp model is constructed. The modeling process is accompanied by the EAT procedure. The EAT scheme is verified as the flaws in the stamp model are found and modified.
文摘Searching the maximum bicliques or bipartite subgraphs in a graph is a tough question. We proposed a new and efficient method, Searching Quasi-Bicliques (SQB) algorithm, to detect maximum quasi-bicliques from protein-protein interaction network. As a Divide-and-Conquer method, SQB consists of three steps: first, it divides the protein-protein interaction network into a number of Distance-2-Subgraphs;second, by combining top-down and branch-and-bound methods, SQB seeks quasi-bicliques from every Distance-2-Subgraph;third, all the redundant results are removed. We successfully applied our method on the Saccharomyces cerevisiae dataset and obtained 2754 distinct quasi-bicliques.
文摘If you think that falling bank interestrates are paving the road to recovery forthe battered economies of Asia,think again.In China's Mainland and Hong Kong,rapidly falling prices have actually pushed upthe real cost of capital despite successive re-ductions in bank interest rates in the past fewmonths.The impact of lower rates is surpris-ingly limited in Thailand,simply
文摘Digital broadcasting is a novel paradigm for the next generation broadcasting. Its goal is to provide not only better quality of pictures but also a variety of services that is impossible in traditional airwaves broadcasting. One of the important factors for this new broadcasting environment is the interoperability among broadcasting applications since the environment is distributed. Therefore the broadcasting metadata becomes increasingly important and one of the metadata standards for a digital broadcasting is TV-Anytime metadata. TV-Anytime metadata is defined using XML schema, so its instances are XML data. In order to fulfill interoperability, a standard query language is also required and XQuery is a natural choice. There are some researches for dealing with broadcasting metadata. In our previous study, we have proposed the method for efficiently managing the broadcasting metadata in a service provider. However, the environment of a Set-Top Box for digital broadcasting is limited such as low-cost and low-setting. Therefore there are some considerations to apply general approaches for managing the metadata into the Set-Top Box. This paper proposes a method for efficiently managing the broadcasting metadata based on the Set-Top Box and a prototype of metadata management system for evaluating our method. Our system consists of a storage engine to store the metadata and an XQuery engine to search the stored metadata and uses special index for storing and searching. Our two engines are designed independently with hardware platform therefore these engines can be used in any low-cost applications to manage broadcasting metadata.
文摘The Liaoji Proterozoic rift is an inter-intracontinenatl rift developed from Archean granite-greenstone tectonic regime and contains many important mineral deposits of U, B, magnesite, Pb-Zn, Au, Ag, Co and P. These deposits were formed as the result of late mobilization, transportation and concentfation of the previously enriched ore-forming mate- rials in several ore-bearing formations formed during the rift stage. So the metallogeny of these deposits in the rift shows both inheritance and new generation of the ore-forming materials. In future ore-searching practice, attentions should be paid on the studies of the ore-bearing formations in the rift, on the multiple stages of metallogeny and and on multiple derivations of the ore-forming materials.
基金Supported by Academic Innovation Project of Beijing(201106149)
文摘The tiny searching step length and the satellite distribution density are the major factors to influence the efficiency of the satellite finder,so a scientific and reasonable method to calculate the tiny searching step length is proposed to optimize the satellite searching strategy. The pattern clustering and BP neural network are applied to optimize the tiny searching step length. The calculated tiny searching step length is approximately equal to the theoretic value for each satellite. In application,the satellite searching results will be dynamically added to the training samples to re-train the network to improve the generalizability and the precision. Experiments validate that the optimization of the tiny searching step length can avoid the error of locating target satellite and improve the searching efficiency.
基金This work is supported by National Science Foundatinon Grant60273035"Software Performance Assure and Recovery"
文摘Playing an increasingly important role in the security protection of the network information systems,the intrusion detection system(IDS) becomes a hotspot of research interest nowadays.However,this technology in the kernel to many of these systems,namely string searching algorithm,has not received enough attention.By utilizing the concurrent mechanisms(multi-threading) provided by modern operation systems,such work can be divided symmetrically and thus improve the throughput of the corresponding application effectively.Presented in this work is a paralleled string searching algorithm-PBM,an algorithm based on the famous Boyer-Moore(BM) string searching algorithm.Taken as a dividable process,the string searching work is distributed between many cooperating threads of execution in the PBM algorithm,while each of them searches the target pattern in their respective share of the target strings.As compared with the traditional string searching algorithms,the PBM algorithm can do the pattern matching work faster by increasing the data processing throughput,thus adapting better to the drastic increase in the network band width.A simplification of the PBM algorithm that can be used as a multi-string searching algorithm is also suggested with supporting simulations,which is a promising approach when the number of target patterns is limited.