A wireless search system was integrated on Windows 2000 server.Based on the communication principle between wireless data and Internet,the object expression of search file,the automatic query of document information,t...A wireless search system was integrated on Windows 2000 server.Based on the communication principle between wireless data and Internet,the object expression of search file,the automatic query of document information,the segment browsing of result information,and the receiving and sending of user information were realized by using Active Server Page 3.0,VB Script,WML Script insert languages and object orient database technology.The requirement querying information of material processing through Internet by GPRS,WAP mobile handset and so on was accomplished.展开更多
It is argued that research on eye movements has now entered a fourth general era. Each of the four eras is briefly reviewed, and research findings related to eye movements during reading, scene perception, and visual ...It is argued that research on eye movements has now entered a fourth general era. Each of the four eras is briefly reviewed, and research findings related to eye movements during reading, scene perception, and visual search are discussed. Future directions for research in each of these areas and research in other domains involving eye movements are also discussed.展开更多
In this paper, we study the quasi-coordinated search technique for a lost target assumed to move randomly on one of two disjoint lines according to a random walk motion, where there are two searchers beginning their s...In this paper, we study the quasi-coordinated search technique for a lost target assumed to move randomly on one of two disjoint lines according to a random walk motion, where there are two searchers beginning their search from the origin on the first line and other two searchers begin their search from the origin on the second line. But the motion of the two searchers on the first line is independent from the motion of the other two searchers on the second line. Here we introduce a model of search plan and investigate the expected value of the first meeting time between one of the searchers and the lost target. Also, we prove the existence of a search plan which minimizes the expected value of the first meeting time between one of the searchers and the target.展开更多
A target is assumed to move according to a Brownian motion on the real line. The searcher starts from the origin and moves in the two directions from the starting point. The object is to detect the target. The purpose...A target is assumed to move according to a Brownian motion on the real line. The searcher starts from the origin and moves in the two directions from the starting point. The object is to detect the target. The purpose of this paper is to find the conditions under which the expected value of the first meeting time of the searcher and the target is finite, and to show the existence of a search plan which made this expected value minimum.展开更多
A target is assumed to move randomly on one of two disjoint lines L1 and L2 according to a stochastic process . We have two searchers start looking for the lost target from some points on the two lines separately. Eac...A target is assumed to move randomly on one of two disjoint lines L1 and L2 according to a stochastic process . We have two searchers start looking for the lost target from some points on the two lines separately. Each of the searchers moves continuously along his line in both directions of his starting point. When the target is valuable as a person lost on one of disjoint roads, or is serious as a car filled with explosives which moves randomly in one of disjoint roads, in these cases the search effort must be unrestricted and then we can use more than one searcher. In this paper we show the existence of a search plan such that the expected value of the first meeting time between the target and one of the two searchers is minimum.展开更多
Chinese word segmentation is the basis of natural language processing. The dictionary mechanism significantly influences the efficiency of word segmentation and the understanding of the user’s intention which is impl...Chinese word segmentation is the basis of natural language processing. The dictionary mechanism significantly influences the efficiency of word segmentation and the understanding of the user’s intention which is implied in the user’s query. As the traditional dictionary mechanisms can't meet the present situation of personalized mobile search, this paper presents a new dictionary mechanism which contains the word classification information. This paper, furthermore, puts forward an approach for improving the traditional word bank structure, and proposes an improved FMM segmentation algorithm. The results show that the new dictionary mechanism has made a significant increase on the query efficiency and met the user’s individual requirements better.展开更多
The concepts of ordered code-book and the priority of code-vector are proposedin this paper.The statistical properties of a signal are investigated through its coded sequence.Experimental results are presented which p...The concepts of ordered code-book and the priority of code-vector are proposedin this paper.The statistical properties of a signal are investigated through its coded sequence.Experimental results are presented which provide some insight into the statistical properties ofvector quantized sequences.Based on the given concepts and experimental results,a fast searchmethod for the vector quantization of correlated information sources,such as Gauss-Markovsources,is proposed and has shown its efficiency in simulation results.展开更多
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.展开更多
In this study, we use the respective advantages of the tabu search (TS) and the Web-based technologies to develop a Web-based decision support system (DSS) for cell formation (CF) problems considering alternative proc...In this study, we use the respective advantages of the tabu search (TS) and the Web-based technologies to develop a Web-based decision support system (DSS) for cell formation (CF) problems considering alternative process routings and machine sequences simultaneously. With the assistance of our developed Web-based system, the CF practitioners in the production departments can interact with the systems without knowing the details of algorithms and can get the best machine cells and part families with minimize the total intercellular movement wherever and whenever they may need it. To further verify the feasibility and effectiveness of the system developed, an example taken from the literature is ado- pted for illustrational purpose. Moreover, a set of test problems with various sizes drawn from the literature is used to test the performance of the proposed system. Corresponding results are compared to several well-known algorithms previously published. The results indicate that the proposed system improves the best results found in the literature for 67% of the test problems. These show that the proposed system should thus be useful to both practitioners and researchers.展开更多
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.展开更多
In this paper, a study and evaluation of the combination of GPS/GNSS techniques and advanced image processing algorithms for distressed human detection, positioning and tracking, from a fully autonomous Unmanned Aeria...In this paper, a study and evaluation of the combination of GPS/GNSS techniques and advanced image processing algorithms for distressed human detection, positioning and tracking, from a fully autonomous Unmanned Aerial Vehicle (UAV)-based rescue support system, </span><span style="font-family:Verdana;">are</span><span style="font-family:Verdana;"> presented. In particular, the issue of human detection both on terrestrial and marine environment under several illumination and background conditions, as the human silhouette in water differs significantly from a terrestrial one</span><span style="font-family:Verdana;">,</span><span style="font-family:Verdana;"> is addressed. A robust approach, including an adaptive distressed human detection algorithm running every N input image frames combined with a much faster tracking algorithm, is proposed. Real time or near-real-time distressed human detection rates achieved, using a single, low cost day/night NIR camera mounted onboard a fully autonomous UAV for Search and Rescue (SAR) operations. Moreover, the generation of our own dataset, for the image processing algorithms training is also presented. Details about both hardware and software configuration as well as the assessment of the proposed approach performance are fully discussed. Last, a comparison of the proposed approach to other human detection methods used in the literature is presented.展开更多
The flow shop scheduling problem with limited buffers( LBFSP) widely exists in manufacturing systems. A hybrid discrete harmony search algorithm is proposed for the problem to minimize total flow time. The algorithm p...The flow shop scheduling problem with limited buffers( LBFSP) widely exists in manufacturing systems. A hybrid discrete harmony search algorithm is proposed for the problem to minimize total flow time. The algorithm presents a novel discrete improvisation and a differential evolution scheme with the jobpermutation-based representation. Moreover,the discrete harmony search is hybridized with the problem-dependent local search based on insert neighborhood to balance the global exploration and local exploitation. In addition, an orthogonal experiment design is employed to provide a receipt for turning the adjustable parameters of the algorithm. Comparisons based on the Taillard benchmarks indicate the superiority of the proposed algorithm in terms of effectiveness and efficiency.展开更多
基金Item Sponsored by Doctoral Program of Higher Education of China(97014515)
文摘A wireless search system was integrated on Windows 2000 server.Based on the communication principle between wireless data and Internet,the object expression of search file,the automatic query of document information,the segment browsing of result information,and the receiving and sending of user information were realized by using Active Server Page 3.0,VB Script,WML Script insert languages and object orient database technology.The requirement querying information of material processing through Internet by GPRS,WAP mobile handset and so on was accomplished.
文摘It is argued that research on eye movements has now entered a fourth general era. Each of the four eras is briefly reviewed, and research findings related to eye movements during reading, scene perception, and visual search are discussed. Future directions for research in each of these areas and research in other domains involving eye movements are also discussed.
文摘In this paper, we study the quasi-coordinated search technique for a lost target assumed to move randomly on one of two disjoint lines according to a random walk motion, where there are two searchers beginning their search from the origin on the first line and other two searchers begin their search from the origin on the second line. But the motion of the two searchers on the first line is independent from the motion of the other two searchers on the second line. Here we introduce a model of search plan and investigate the expected value of the first meeting time between one of the searchers and the lost target. Also, we prove the existence of a search plan which minimizes the expected value of the first meeting time between one of the searchers and the target.
文摘A target is assumed to move according to a Brownian motion on the real line. The searcher starts from the origin and moves in the two directions from the starting point. The object is to detect the target. The purpose of this paper is to find the conditions under which the expected value of the first meeting time of the searcher and the target is finite, and to show the existence of a search plan which made this expected value minimum.
文摘A target is assumed to move randomly on one of two disjoint lines L1 and L2 according to a stochastic process . We have two searchers start looking for the lost target from some points on the two lines separately. Each of the searchers moves continuously along his line in both directions of his starting point. When the target is valuable as a person lost on one of disjoint roads, or is serious as a car filled with explosives which moves randomly in one of disjoint roads, in these cases the search effort must be unrestricted and then we can use more than one searcher. In this paper we show the existence of a search plan such that the expected value of the first meeting time between the target and one of the two searchers is minimum.
文摘Chinese word segmentation is the basis of natural language processing. The dictionary mechanism significantly influences the efficiency of word segmentation and the understanding of the user’s intention which is implied in the user’s query. As the traditional dictionary mechanisms can't meet the present situation of personalized mobile search, this paper presents a new dictionary mechanism which contains the word classification information. This paper, furthermore, puts forward an approach for improving the traditional word bank structure, and proposes an improved FMM segmentation algorithm. The results show that the new dictionary mechanism has made a significant increase on the query efficiency and met the user’s individual requirements better.
文摘The concepts of ordered code-book and the priority of code-vector are proposedin this paper.The statistical properties of a signal are investigated through its coded sequence.Experimental results are presented which provide some insight into the statistical properties ofvector quantized sequences.Based on the given concepts and experimental results,a fast searchmethod for the vector quantization of correlated information sources,such as Gauss-Markovsources,is proposed and has shown its efficiency in simulation results.
文摘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.
文摘In this study, we use the respective advantages of the tabu search (TS) and the Web-based technologies to develop a Web-based decision support system (DSS) for cell formation (CF) problems considering alternative process routings and machine sequences simultaneously. With the assistance of our developed Web-based system, the CF practitioners in the production departments can interact with the systems without knowing the details of algorithms and can get the best machine cells and part families with minimize the total intercellular movement wherever and whenever they may need it. To further verify the feasibility and effectiveness of the system developed, an example taken from the literature is ado- pted for illustrational purpose. Moreover, a set of test problems with various sizes drawn from the literature is used to test the performance of the proposed system. Corresponding results are compared to several well-known algorithms previously published. The results indicate that the proposed system improves the best results found in the literature for 67% of the test problems. These show that the proposed system should thus be useful to both practitioners and researchers.
文摘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.
文摘In this paper, a study and evaluation of the combination of GPS/GNSS techniques and advanced image processing algorithms for distressed human detection, positioning and tracking, from a fully autonomous Unmanned Aerial Vehicle (UAV)-based rescue support system, </span><span style="font-family:Verdana;">are</span><span style="font-family:Verdana;"> presented. In particular, the issue of human detection both on terrestrial and marine environment under several illumination and background conditions, as the human silhouette in water differs significantly from a terrestrial one</span><span style="font-family:Verdana;">,</span><span style="font-family:Verdana;"> is addressed. A robust approach, including an adaptive distressed human detection algorithm running every N input image frames combined with a much faster tracking algorithm, is proposed. Real time or near-real-time distressed human detection rates achieved, using a single, low cost day/night NIR camera mounted onboard a fully autonomous UAV for Search and Rescue (SAR) operations. Moreover, the generation of our own dataset, for the image processing algorithms training is also presented. Details about both hardware and software configuration as well as the assessment of the proposed approach performance are fully discussed. Last, a comparison of the proposed approach to other human detection methods used in the literature is presented.
基金National Natural Science Foundations of China(Nos.61174040,61104178)Shanghai Commission of Science and Technology,China(No.12JC1403400)the Fundamental Research Funds for the Central Universities,China
文摘The flow shop scheduling problem with limited buffers( LBFSP) widely exists in manufacturing systems. A hybrid discrete harmony search algorithm is proposed for the problem to minimize total flow time. The algorithm presents a novel discrete improvisation and a differential evolution scheme with the jobpermutation-based representation. Moreover,the discrete harmony search is hybridized with the problem-dependent local search based on insert neighborhood to balance the global exploration and local exploitation. In addition, an orthogonal experiment design is employed to provide a receipt for turning the adjustable parameters of the algorithm. Comparisons based on the Taillard benchmarks indicate the superiority of the proposed algorithm in terms of effectiveness and efficiency.
