Search

To improve the performance of laser triangulation method for the silicon melt level detection, firstly, a voting mechanism based laser line coordinates calculation method is proposed in this paper. We take the vote according to the vertical coordinates of the laser spots, which are composed of the laser line affected by liquid surface fluctuation in the liquid level measurement image, to estimate the actual coordinate of the laser line. Secondly, A parallel cost-reference particle filter method is used to filter the coordinates, and a linear conversion is used to obtain the true value of the liquid level. Finally, the experimental results for the measurement data of the liquid level show that the proposed method can avoid the occurrence of impulse noise, and improve the robustness of the liquid level system effectively. Moreover, the proposed filter method is introduced to correct the liquid level measurement data.

Complex network spectra features are proposed to be used by the classifier to classify atrial fibrillation (AF) and normal sinus rhythm (NSR). This novel complex network construction method utilizes the fuzzy symbolic dynamics (FSD) and recurrence complex network to analyze the synchronization of cardiac electrical activity. Firstly, the multi-lead epicardial signals recorded from dogs are transformed into the FSD plot to construct a complex network by using the recurrence complex network theory. Then, network spectra features are extracted. Finally, epicardium signals are classified into AF and NSR patterns by using the fuzzy c-means algorithm (FCM). The method is validated with three sample sets from dogs A, B and C. The samples are NSR and AF segments which are all from dog experiments. The sensitivity (SE), specificity (SP) and accuracy (AC) of the identification for set A are 98.2%, 98.9% and 98.6% respectively, 96.1%, 98.6%, 97.5% for set B, and 97.7%, 98.7%, 98.4% for set C. The experiments indicate that this approach is effective in AF detection.

Taking the uncertainty existing in edge weights of networks into consideration, finding shortest path in such fuzzy weighted networks has been widely studied in various practical applications. In this paper, an amoeboid algorithm is proposed, combing fuzzy sets theory with a path finding model inspired by an amoeboid organism, Physarum polycephalum. With the help of fuzzy numbers, uncertainty is well represented and handled in our algorithm. What's more, biological intelligence of Physarum polycephalum has been incorporate into the algorithm. A numerical example on a transportation network is demonstrated to show the efficiency and flexibility of our proposed amoeboid algorithm.

It is necessary to cluster the information according to their sources when analyzing multi-source information. In this paper, a new evidential clustering method is proposed. In the proposed method, pairwise distance between BPAs have been introduced to form a matrix for clustering. The clustering method is based on vector which is transformed from distance matrix. Illustrative example with several sets demonstrate the validity of the proposed method as compared to other methods.

The slime mold Physarum polycephalum has been used to find the shortest path between the source and target point in a given labyrinth. However, the classical algorithm can't deal with the shortest path problem in directed graphs. In this paper, a modified model is proposed to solve the shortest path problem in directed graphs using the true slime mold Physarum polycephalum. Some numerical examples are illustrated the efficiency of the proposed method.

A set of embedded communication network system is constructed according to the reality requirement of quantum cryptography communication to achieve dynamic data transmission. The software and hardware synergy design method is adopted to construct network communications system based on MicroBlaze with EDK and FPGA board as embedded Web server. Furthermore, Gauss random number IP core is designed to generate random number. Such system could be used for high speed and long-distance data transmission on two PC machines and FPGA board to achieve data coordination in quantum cryptography communication.

Oxygen is one of the prominent parameters characterized the quality of water, how to detect the precise content of oxygen is paid much attention nowadays. Lately the method of fluorescence quenching has been the hotspot practice to detect the oxygen in the international. This paper based on the principle of fluorescence quenching has designed the DO(dissolved oxygen)detecting system. Through choosing dissolved oxygen sensing head and photoelectric receiving devices rationally and determining appropriate circuit parameters after experiment, it can realize the detecting of the DO preliminarily, laying the foundation for the instrumentation of the system.

A relative significance factor of an impact category is the external weight of the impact category and plays an important role in life cycle assessment(LCA). Many multiattribute decision-making (MADM) methods such as analytical hierarchy process(AHP), the rank-order centroid method and the fuzzy method are proposed to determine the relative significance factor of an impact category. However, in previous research, it is shown that, the AHP approach is difficult for experts rendering consistent judgment when the number of pairwise comparisons increases, the rank-order method has some insurmountable shortcomings, the key issue to use fuzzy set theory is its complexity. In order to address this problem, a new simple and efficient method is proposed to determine relative significance factor in a more efficient manner. An example to determine relative significance factor of impact categories is shown to illustrate the efficiency of the proposed method.

Timetabling problems are a process of assigning a given set of events and resources to the limited space and time under hard constraints which are rigidly enforced and soft constraints which are satisfied as nearly as possible. As a kind of timetabling problems, university course timetabling is a very important administrative activity for a wide variety of schools. Genetic algorithm is an advanced heuristic method which is very effective in many fields. In this paper, genetic algorithm is used to solve university course timetabling problem. At first, a model of problem to be solved is defined. Then, the genetic representation is determined and a fitness function is established according to the constraints. Finally, a case of university course timetabling from real-world is discussed and solved. It is demonstrated that the method proposed in this paper is feasible and efficient.

For image denoising and edge keeping, an adaptive diffusion coefficient scheme based on the traditional P-M model is proposed in this paper. The edge detection operator which reflects the edge information is introduced to obtain the optimum gradient threshold, not as same as using the constant value K in the classical diffusion coefficient equation. Experimental results either from the ideal images or form the practical two-photon microscopic images have shown that the proposed approach for image denoising is better than the fixed value K in the diffusion coefficient function both at edge preserving and noise removing.

In some public places such as super market and School, increasing people became too crowed sometime. In this paper, we find a solution to monitor the video and analyze the data automatically. It helps to get warnings before the people becoming too crowded. In order to acquire the real-time images to analysis the people’s movement trends, system sends the warning to administrator in time by calculating and analyzing certain parameters of pre-movement.

The standard digital signature scheme can be easily subject to key exposure problem In order to overcome this problem; a feasible and effective approach is employed by key-evolving signature scheme. In this paper, we study key-evolving signature within the UC framework and propose an appropriate ideal functionality that captures the basic security requirements of key-evolving signature. Then, we present a generic way to transform a key-evolving signature scheme into a real-life protocol. Finally, we show that UC definition of security is equivalent to previous definition of security which is termed as EUF-ACMA security.

In this paper, we formulate and realize a definition of security for three-party key distribution within the universally composable (UC) framework. That is, an appropriate ideal functionality that captures the basic security requirements of three-party key distribution is formulated. We show that UC definition of security for three-party key distribution protocol is strictly more stringent than a previous definition of security which is termed AKE-security. Finally, we present a real-life protocol that securely realizes the formulated ideal functionality with respect to non-adaptive adversaries