The characterization of artists' materials is of great importance for the conservation and restoration of 20th century paintings, and it provides information which is of art-historical interest. The identification...
详细信息
The characterization of artists' materials is of great importance for the conservation and restoration of 20th century paintings, and it provides information which is of art-historical interest. The identification of modern organic pigments by Raman spectroscopy is hampered by the large amount of different synthetic materials that exist. Therefore, an extended database of reference spectra is needed. Besides this spectral library, there is need for an accurate and fast-searching algorithm fur selecting the reference spectrum that best corresponds with the unknown spectrum. A principal components-based spectral searching algorithm is proposed that largely reduces the number of data points for each spectrum. By subsequent measurement of the Euclidian distance between the unknown and the reference spectra in the principal components space, the corresponding reference can be selected. The algorithm is tested by using the results of the Raman spectroscopic analysis of different colored pencils. Different qualities of matches for the identification protocol could be distinguished. The synthetic organic pigments in micro-samples of the painting "Fauhourg" by Paul Delvaux could be identified by the proposed algorithm.
Contrary to conventional protecting data such as cryptographic techniques which encrypt the data with a secret key, secret sharing takes an approach to ensure well protection of transmitted information by allowing a s...
详细信息
Contrary to conventional protecting data such as cryptographic techniques which encrypt the data with a secret key, secret sharing takes an approach to ensure well protection of transmitted information by allowing a secret message M to be divided into n pieces. Secret message M can be held by n participants to avoid the secret from incidentally or intentionally being lost. In a secret sharing scheme, secret information leaks from shadows, attack on shadow image, and large shadow image issues which has arisen when developing an algorithm. Although existing algorithms provide remedies for such problems, the computational complexity of existing algorithms is still questionable. Therefore, we propose a low computational complexity Quadri-Directional searching algorithm (QDSA) for secret image sharing. Experiment results show that the proposed algorithm ensures that generated shares are of high quality and no secret information is leaked from these shares, thus it guarantees high security of our scheme. (C) 2015 Elsevier Inc. All rights reserved.
The Logan plot is a powerful algorithm used to generate binding-potential images from dynamic positron emission tomography (PET) images in neuroreceptor studies. However, it requires arterial blood sampling and metabo...
详细信息
The Logan plot is a powerful algorithm used to generate binding-potential images from dynamic positron emission tomography (PET) images in neuroreceptor studies. However, it requires arterial blood sampling and metabolite correction to provide an input function, and clinically it is preferable that this need for arterial blood sampling be obviated. Estimation of the input function with metabolite correction using an intersectional searching algorithm (ISA) has been proposed. The ISA seeks the input function from the intersection between the planes spanned by measured radioactivity curves in tissue and their cumulative integrals in data space. However, the ISA is sensitive to noise included in measured curves, and it often fails to estimate the input function. In this paper, we propose a robust estimation of the cumulative integral of the plasma time-activity curve (pTAC) using ISA (robust EPISA) to overcome noise issues. The EPISA reduces noise in the measured PET data using averaging and clustering that gathers radioactivity curves with similar kinetic parameters. We confirmed that a little noise made the estimation of the input function extremely difficult in the simulation. The robust EPISA was validated by application to eight real dynamic [(11)C]TMSX PET data sets used to visualize adenosine A(2A) receptors and four real dynamic [(11)C]PIB PET data sets used to visualize amyloid-beta plaque. Peripherally, the latter showed faster metabolism than the former. The clustering operation improved the signal-to-noise ratio for the PET data sufficiently to estimate the input function, and the calculated neuroreceptor images had a quality equivalent to that using measured pTACs after metabolite correction. Our proposed method noninvasively yields an alternative input function for Logan plots, allowing the Logan plot to be more useful in neuroreceptor studies. (c) 2007 Elsevier Inc. All rights reserved.
Test data generation is the core and key of software testing. Program executing methods of test data overcome the problem that static methods limit tested procedure, which shows some advantages, but program executing ...
详细信息
ISBN:
(纸本)9781424435197
Test data generation is the core and key of software testing. Program executing methods of test data overcome the problem that static methods limit tested procedure, which shows some advantages, but program executing methods need support of searching algorithm. This paper presents a searching algorithm based on dynamic data, it judges speedy adjustment rang of variables of tested procedure and improves efficiency of test data generation.
The optimal Latin hypercube designs have been applied in many computer experiments as a basic method of experiment design. In this paper, we propose a novel criterion for constructing optimal Latin hypercube designs. ...
详细信息
ISBN:
(纸本)9781509033645
The optimal Latin hypercube designs have been applied in many computer experiments as a basic method of experiment design. In this paper, we propose a novel criterion for constructing optimal Latin hypercube designs. The corresponding foundation of the novel criterion ideas is that the each point of the uniform design should have approximately equal distance with adjacent points. It means if we count the average and variance of distance between each point of design with its adjacent points, then the minimum variance of those distance will be a new criterion for optimal Latin hypercube designs. Only limit adjacent distances has been chosen to count above variance for convenience. The criterion come from limit variance will have an effect on the uniformity of a design. So another criterion was proposed that is maximum average adjacent distance. The final criterions are synthesized by minimum variance and maximum average of the adjacent distance which are connected by a coefficient. A novel searching algorithms was also proposed that take advantage of the columnwise-pairwise algorithm and the simulated annealing algorithm. The novel searching algorithm only could be used to the criteria above mentioned because it use some special information connected with the adjacent distance deviation. A software has been programmed that can generate Latin hypercube designs with the proposed criteria and searching algorithm. The properties of different criterion and searching algorithm were compared by generating large quantity designs and count the statistical properties of criterion. The result from some case of designs can account that the proposed novel criterion and searching algorithm is better than other distance criterion and searching algorithm.
In the area of computer game, Amazons game is a relatively new one whose rules stand between the game of Chess and Go. Its move rule is simple but apt to generate tremendous move branches. Based on the UCT searching a...
详细信息
ISBN:
(纸本)9781424487363
In the area of computer game, Amazons game is a relatively new one whose rules stand between the game of Chess and Go. Its move rule is simple but apt to generate tremendous move branches. Based on the UCT searching algorithm, this paper presents an idea that the whole process of Amazons game can be divided into three phases, which are the Opening, Middle game and Endgame, then different strategies are applied to different phases according to their respective characteristics. Furthermore, a new Monte-Carlo simulation method applicable to Amazons game is proposed in this paper. The corresponding experiments are conducted to show the validation of the proposed algorithms.
Locating a resource or service efficiently in unstructured decentralized peer-to-peer systems is one of the most important issues for peer-to-peer applications. We propose a selective walk searching method for Gnutell...
详细信息
ISBN:
(纸本)9781424406661
Locating a resource or service efficiently in unstructured decentralized peer-to-peer systems is one of the most important issues for peer-to-peer applications. We propose a selective walk searching method for Gnutella systems, which is based on the random walk algorithm in conjunction with emphasis on the peers' selection criteria. The selection is based on several hints of neighboring peers, including the number of the shared files, the most recent succeeded queries and the specific peer that provided the answer. By using these hints, a peer selection mechanism is proposed. The searching source selects a set of neighbors according to the selection criteria. In addition, a flow control mechanism is adopted in order to avoid the overload of hotspots and message loss. The flow control is based on the rate limit and message priority. Simulation results show that the selective walk searching algorithm outperforms the pure random walk algorithm in most evaluation metrics especially query success rate.
Human face detection is a key technology in face information processing, the speed of which is very important during real-time face detection for input images or input video sequences. This paper presents a novel face...
详细信息
ISBN:
(纸本)9781424458981
Human face detection is a key technology in face information processing, the speed of which is very important during real-time face detection for input images or input video sequences. This paper presents a novel face window searching algorithm based on evolutionary agent when detecting faces in gray-scale images. It can quickly find the candidate face windows through the evolutionary computation of distributed agents, which represent different kind of windows. Experimental results show that the evolutionary agent-based searching algorithm can increase the detection speed by 5-7 times compared with the traditional exhaustive searching method used in some general algorithms.
Test data generation is key of software testing. Test data methods based on program executing overcomes the problem that static methods limit tested procedure, which shows some advantages, but program executing method...
详细信息
ISBN:
(纸本)9783037859162
Test data generation is key of software testing. Test data methods based on program executing overcomes the problem that static methods limit tested procedure, which shows some advantages, but program executing methods need support of searching algorithm. This paper presents the searching algorithm based on dynamic data, it judges speedily adjustment rang of variables of tested procedure, does not try to search step by step and improves efficiency of test data generation.
A searching algorithm was found to be effective in producing acutely needed results in the operation of data structures. searching is being performed as a common operation unlike other operations in various formats of...
详细信息
A searching algorithm was found to be effective in producing acutely needed results in the operation of data structures. searching is being performed as a common operation unlike other operations in various formats of algorithms. The binary and linear search book a room in most of the searching techniques. Going with each technique has its inbuilt limitations and explorations. The versatile approach of different techniques which is in practice helps in bringing out the hybrid search techniques around it. For any tree representation, the sorted order is expected to achieve the best performance. This paper exhibits the new technique named the biform tree approach for producing the sorted order of elements and to perform efficient searching.
暂无评论