ISSN 
2011 Vol. 40, No. 3
2011, 40(3): 322-332.
doi: 10.3969/j.issn.1001-0548.2011.03.001
Abstract:
This paper researches the service building and concurrency control in wireless sensor networks (WSNs). Due to the characteristic of limited resources such as energy, communication, computing and storage in WSNs, a WSN service management approach and a reasoning-based context-aware workflow to build WSN services are proposed. By abstracting the semantic information from sensor data, the loose couple between the upper business logic and lower sensor data can be achieved and the resource reuse can further realized. In addition, the traditional concurrency control methods are improved. With the help of repeat and collision detection, more effective WSN service concurrency control can be received.
This paper researches the service building and concurrency control in wireless sensor networks (WSNs). Due to the characteristic of limited resources such as energy, communication, computing and storage in WSNs, a WSN service management approach and a reasoning-based context-aware workflow to build WSN services are proposed. By abstracting the semantic information from sensor data, the loose couple between the upper business logic and lower sensor data can be achieved and the resource reuse can further realized. In addition, the traditional concurrency control methods are improved. With the help of repeat and collision detection, more effective WSN service concurrency control can be received.
2011, 40(3): 333-345.
doi: 10.3969/j.issn.1001-0548.2011.03.002
Abstract:
Hardware/software (HW/SW) partitioning is a critical step in the design of complex embedded system. The computing models and the corresponding algorithms for hardware/software partitioning reported in recent years are summarized. The HW/SW partitioning is modeled as a variety of knapsack problems with different constraints, where items in knapsack problems correspond to the blocks in partitioning problems, and the communication cost between blocks is considered. Both exact algorithms and heuristic ones are introduced based on different computing models. Some potential problems on research are listed for future work.
Hardware/software (HW/SW) partitioning is a critical step in the design of complex embedded system. The computing models and the corresponding algorithms for hardware/software partitioning reported in recent years are summarized. The HW/SW partitioning is modeled as a variety of knapsack problems with different constraints, where items in knapsack problems correspond to the blocks in partitioning problems, and the communication cost between blocks is considered. Both exact algorithms and heuristic ones are introduced based on different computing models. Some potential problems on research are listed for future work.
2011, 40(3): 346-351.
doi: 10.3969/j.issn.1001-0548.2011.03.003
Abstract:
For the moving target detection using the through wall radar, according to the fact that the Doppler signals of the human activities are nonlinear and non-stationary, the ensemble empirical mode decomposition (EEMD) and empirical mode decomposition (EMD) are used respectively to decompose five different activities Doppler signals into a set of instinct mode functions (IMF). The five different activities include the human standing still, standing with arms waving, stepping forward and backward, walking and running. A support vector machine (SVM) is trained using the energy ratio of each IMF to the total IMFs as the features to classify the activities. The relationship between the classification accuracy with the number of the features is analyzed and the classification accuracy comparison using two different decomposition methods is given. Because the EEMD can eliminate the mode mixing problem existed in EMD and each IMF obtained from the EEMD has a clear physical meaning, the classification accuracy using the EEMD is found to be more than 94%, higher than the one using the EMD.
For the moving target detection using the through wall radar, according to the fact that the Doppler signals of the human activities are nonlinear and non-stationary, the ensemble empirical mode decomposition (EEMD) and empirical mode decomposition (EMD) are used respectively to decompose five different activities Doppler signals into a set of instinct mode functions (IMF). The five different activities include the human standing still, standing with arms waving, stepping forward and backward, walking and running. A support vector machine (SVM) is trained using the energy ratio of each IMF to the total IMFs as the features to classify the activities. The relationship between the classification accuracy with the number of the features is analyzed and the classification accuracy comparison using two different decomposition methods is given. Because the EEMD can eliminate the mode mixing problem existed in EMD and each IMF obtained from the EEMD has a clear physical meaning, the classification accuracy using the EEMD is found to be more than 94%, higher than the one using the EMD.
2011, 40(3): 352-356.
doi: 10.3969/j.issn.1001-0548.2011.03.004
Abstract:
A novel symbol duration estimation for long code direct sequence spectrum spread (DS-SS) signal is proposed. The estimator consists of two steps. Firstly, a coarse estimation is obtained based on a higher-order autocorrelation statistics and maximizing corresponding autocorrelation coefficient. Secondly, based on the principle of differential pseudo-noise (PN) code despreading and second-order cyclic correlation function, a fine estimation is reached. The coarse estimation keeps robust under low signal-noise-ratio (SNR) and small sample size than the fine one, and given the latter a reliable estimation range, so that performance improvement is obtained for the latter. The differential PN despreading is exploited to eliminate the interference effect on the cyclic correlation function by the PN code. Compared with existing theory simulations show that the proposed method is irrelative to the PN codes and obtains significant performance improvement.
A novel symbol duration estimation for long code direct sequence spectrum spread (DS-SS) signal is proposed. The estimator consists of two steps. Firstly, a coarse estimation is obtained based on a higher-order autocorrelation statistics and maximizing corresponding autocorrelation coefficient. Secondly, based on the principle of differential pseudo-noise (PN) code despreading and second-order cyclic correlation function, a fine estimation is reached. The coarse estimation keeps robust under low signal-noise-ratio (SNR) and small sample size than the fine one, and given the latter a reliable estimation range, so that performance improvement is obtained for the latter. The differential PN despreading is exploited to eliminate the interference effect on the cyclic correlation function by the PN code. Compared with existing theory simulations show that the proposed method is irrelative to the PN codes and obtains significant performance improvement.
2011, 40(3): 357-362.
doi: 10.3969/j.issn.1001-0548.2011.03.005
Abstract:
A new supervised level set segmentation method based on statistics model for high-resolution synthetic aperture radar (SAR) images is proposed. The target and background scattering statistics characteristic of the high-resolution SAR images is modeled by Fisher and Gamma probability density function separately, and an energy functional with respect to level set adapted for SAR image is defined. Partial differential equations (PDE) of curve evolution are obtained by minimizing the energy functional. Meanwhile, the parameters of the Fisher and Gamma distribution are estimated by training data selected in advance. The segmentation of the SAR images is implemented by the solution of the PDE. The performance of the method is verified by real SAR images. Results show that the method can get faster segmentation speed and more rounded target segmentation for targets with strong reflectors of high-resolution SAR images if only the training data are selected suitably.
A new supervised level set segmentation method based on statistics model for high-resolution synthetic aperture radar (SAR) images is proposed. The target and background scattering statistics characteristic of the high-resolution SAR images is modeled by Fisher and Gamma probability density function separately, and an energy functional with respect to level set adapted for SAR image is defined. Partial differential equations (PDE) of curve evolution are obtained by minimizing the energy functional. Meanwhile, the parameters of the Fisher and Gamma distribution are estimated by training data selected in advance. The segmentation of the SAR images is implemented by the solution of the PDE. The performance of the method is verified by real SAR images. Results show that the method can get faster segmentation speed and more rounded target segmentation for targets with strong reflectors of high-resolution SAR images if only the training data are selected suitably.
2011, 40(3): 363-366.
doi: 10.3969/j.issn.1001-0548.2011.03.006
Abstract:
Time reversal mirror (TRM) technique is based on the principle of reciprocity. This technique perfectly caters to the demands of detection range and resolution in the complex environment. Therefore, it attracts more and more attention recently. This paper combines the TRM technique with SAR (synthetic aperture radar) imaging technique, and introduces it to the ultra-wideband ground penetrating radar (UWB-GPR) system through numerical simulation and theoretical analysis. For real applications, we consider the detection environment of rough surface and random electrical parameter. The corresponding TRM-SAR images are compared with these of back projection (BP) method. Results show that TRM technique can provides the UWB-GPR system with higher resolution image.
Time reversal mirror (TRM) technique is based on the principle of reciprocity. This technique perfectly caters to the demands of detection range and resolution in the complex environment. Therefore, it attracts more and more attention recently. This paper combines the TRM technique with SAR (synthetic aperture radar) imaging technique, and introduces it to the ultra-wideband ground penetrating radar (UWB-GPR) system through numerical simulation and theoretical analysis. For real applications, we consider the detection environment of rough surface and random electrical parameter. The corresponding TRM-SAR images are compared with these of back projection (BP) method. Results show that TRM technique can provides the UWB-GPR system with higher resolution image.
2011, 40(3): 367-369.
doi: 10.3969/j.issn.1001-0548.2011.03.007
Abstract:
Time-domain impulse generator is a very important unit in time-domain ultra-band radar systems. Most time-domain impulse antennas are symmetrically designed which require balanced output pulse generators in order to realize wideband matching. Aiming to solve the compatible problem of high voltage and balanced output, which commonly exists in high-voltage pulse generators, this paper designs a new pulse generator circuit, the cascade Marx circuit with balanced output. With this generator and a loaded bow-tie antenna, a 300 V nanosecond pulse was generated. The measured result validates the effectiveness of the proposed pulse generator.
Time-domain impulse generator is a very important unit in time-domain ultra-band radar systems. Most time-domain impulse antennas are symmetrically designed which require balanced output pulse generators in order to realize wideband matching. Aiming to solve the compatible problem of high voltage and balanced output, which commonly exists in high-voltage pulse generators, this paper designs a new pulse generator circuit, the cascade Marx circuit with balanced output. With this generator and a loaded bow-tie antenna, a 300 V nanosecond pulse was generated. The measured result validates the effectiveness of the proposed pulse generator.
2011, 40(3): 370-374.
doi: 10.3969/j.issn.1001-0548.2011.03.008
Abstract:
The full rate and full diversity could be achieved by Rate-2 space-time block code, whereas the decoding complexity is proportional to the square of the modulation order. A rate-2 space time block code with phase rotation is proposed in order to reduce the decoding complexity. Part of the transmitted signals is rotated by a certain angle, and the pairwise orthogonal between the transmitted signals is realized in the proposed scheme, so that the decoding complexity is proportional to the modulation order. Simulation results demonstrate the decoding complexity is reduced greatly by proposed code only with 7 bit feedback.
The full rate and full diversity could be achieved by Rate-2 space-time block code, whereas the decoding complexity is proportional to the square of the modulation order. A rate-2 space time block code with phase rotation is proposed in order to reduce the decoding complexity. Part of the transmitted signals is rotated by a certain angle, and the pairwise orthogonal between the transmitted signals is realized in the proposed scheme, so that the decoding complexity is proportional to the modulation order. Simulation results demonstrate the decoding complexity is reduced greatly by proposed code only with 7 bit feedback.
2011, 40(3): 375-378.
doi: 10.3969/j.issn.1001-0548.2011.03.009
Abstract:
A self-adapting Dither structure is proposed to solve the problem of the input signals' overflow when Dither is used in the pipelined ADC. It utilizes PN as wideband and large amplitude Dither and synchronizes analog signals without changing their dynamic range. It is proved that such a structure can reduce DNL errors and improve ADC's performance. The output codeword distribution is compared before and after Dither is added in experimental findings. The distinctive impacts on ADC's performance are reported as well when different amplitude Dithers are applied.
A self-adapting Dither structure is proposed to solve the problem of the input signals' overflow when Dither is used in the pipelined ADC. It utilizes PN as wideband and large amplitude Dither and synchronizes analog signals without changing their dynamic range. It is proved that such a structure can reduce DNL errors and improve ADC's performance. The output codeword distribution is compared before and after Dither is added in experimental findings. The distinctive impacts on ADC's performance are reported as well when different amplitude Dithers are applied.
Research on the Linear Complexity for a Family of Large Size of p-ary Sequences with Low Correlation
2011, 40(3): 379-382.
doi: 10.3969/j.issn.1001-0548.2011.03.010
Abstract:
Constructing a large family of p-ary sequences with large linear complexity and low correlation is very important for code division multiple access (CDMA) communication systems. By use of Klapper's method and d-form function, a large family S(r) of p-ary sequences with low correlation is constructed. Such family contains p2n sequences of period pn-1 with maximal nontrivial correlation value 4p(n)/(2)-1. The minimal and maximal linear complexity of the sequences family are proven to be 2(n)/(2)-2n and 3(n)/(2)-1×2(n)/(2)-2n for p > 5 and r=(pm-1-1)/(p-1), respectively. It is also proven that the maximal and minimal linearcomplexity of the sequences set are larger than 3(n)/(4)-1×2(n)/(4)-2n and 2(n)/(4)-2n for p=3, 5 and r=(pm-1-1)/(p-1), respectively. This sequences family can greatly improve the security of CDMA communication systems.
Constructing a large family of p-ary sequences with large linear complexity and low correlation is very important for code division multiple access (CDMA) communication systems. By use of Klapper's method and d-form function, a large family S(r) of p-ary sequences with low correlation is constructed. Such family contains p2n sequences of period pn-1 with maximal nontrivial correlation value 4p(n)/(2)-1. The minimal and maximal linear complexity of the sequences family are proven to be 2(n)/(2)-2n and 3(n)/(2)-1×2(n)/(2)-2n for p > 5 and r=(pm-1-1)/(p-1), respectively. It is also proven that the maximal and minimal linearcomplexity of the sequences set are larger than 3(n)/(4)-1×2(n)/(4)-2n and 2(n)/(4)-2n for p=3, 5 and r=(pm-1-1)/(p-1), respectively. This sequences family can greatly improve the security of CDMA communication systems.
2011, 40(3): 383-387.
doi: 10.3969/j.issn.1001-0548.2011.03.011
Abstract:
In the multiple-input multiple-output (MIMO) orthogonal frequency-division multiplexing based systems, interleaver and deinterleaver with multi-mode and high-speed are required. In this paper, a novel 36-mode interleaver fully compliant to IEEE 802.11n wireless local area network (WLAN) protocol is presented. Three design techniques are proposed:merging permutations, replacing arithmetic expressions with optimized circuits, and multiplexing interleaver/deinterleaver. The proposed design is implemented in both FPGA and ASIC. It achieves a reduction of silicon area and power consumption when compared with other similar works. In SMIC 0.13 μm CMOS technology, the maximal operating frequency is synthesized 400 MHz and the corresponding power dissipation is 10.8 mW. The core size is 0.066 7 mm2.
In the multiple-input multiple-output (MIMO) orthogonal frequency-division multiplexing based systems, interleaver and deinterleaver with multi-mode and high-speed are required. In this paper, a novel 36-mode interleaver fully compliant to IEEE 802.11n wireless local area network (WLAN) protocol is presented. Three design techniques are proposed:merging permutations, replacing arithmetic expressions with optimized circuits, and multiplexing interleaver/deinterleaver. The proposed design is implemented in both FPGA and ASIC. It achieves a reduction of silicon area and power consumption when compared with other similar works. In SMIC 0.13 μm CMOS technology, the maximal operating frequency is synthesized 400 MHz and the corresponding power dissipation is 10.8 mW. The core size is 0.066 7 mm2.
2011, 40(3): 388-391.
doi: 10.3969/j.issn.1001-0548.2011.03.012
Abstract:
In order to solve the reader collision problem in radio-frequency identification (RFID) networks, a collision avoidance asynchronous multi-channel medium access control (MAC) protocol is proposed. Each reader monitors the control channel, thus obtains the occupied channels and communication states of neighbor readers. Then, an unused channel is adaptively selected as the communication channel to transmit request to send (RTS) to its neighbor readers to broadcast this choice. Thus the non-collision communication is realized. To avoid the reader to tag interference, neighboring readers are forbidden to communicate with the same tag simultaneously. Therefore, the reader frequency interference can be avoided by adopting the multiple-channel communication mechanism as well as space-division multiplexing frequency.
In order to solve the reader collision problem in radio-frequency identification (RFID) networks, a collision avoidance asynchronous multi-channel medium access control (MAC) protocol is proposed. Each reader monitors the control channel, thus obtains the occupied channels and communication states of neighbor readers. Then, an unused channel is adaptively selected as the communication channel to transmit request to send (RTS) to its neighbor readers to broadcast this choice. Thus the non-collision communication is realized. To avoid the reader to tag interference, neighboring readers are forbidden to communicate with the same tag simultaneously. Therefore, the reader frequency interference can be avoided by adopting the multiple-channel communication mechanism as well as space-division multiplexing frequency.
2011, 40(3): 392-395.
doi: 10.3969/j.issn.1001-0548.2011.03.013
Abstract:
In Miller's algorithm, the loop length plays an important role. By analyzing the loop control polynomial, the lower bound for the degree of some class of control polynomial is derived. Based on the lower bound, the method for selecting proper curve parameters for constructing pairing-friendly elliptic curve is proposed. Finally, when irreducible polynomial is used to generate pairing-friendly elliptic curve, the necessary and sufficient condition for the loop length reaching the lower bound is presented.
In Miller's algorithm, the loop length plays an important role. By analyzing the loop control polynomial, the lower bound for the degree of some class of control polynomial is derived. Based on the lower bound, the method for selecting proper curve parameters for constructing pairing-friendly elliptic curve is proposed. Finally, when irreducible polynomial is used to generate pairing-friendly elliptic curve, the necessary and sufficient condition for the loop length reaching the lower bound is presented.
2011, 40(3): 396-400.
doi: 10.3969/j.issn.1001-0548.2011.03.014
Abstract:
A new key-sieving algorithm used in impossible differential attacks on advanced encryption standard (AES) is proposed. In the new algorithm, table look-up technique is firstly applied to eliminate some error keys, and then a divide-and-conquer technique is adopted to sieve the others. It is shown that the new algorithm gains some advantage over previously published key-sieving algorithms with respect to the time complexity when proper independent variables are chosen in the function of the time complexity. Moreover, we improve the impossible differential attacks on AES proposed in INDOCRYPT2008 by means of the new algorithm, meanwhile the curves of time complexity are drawn and the best points are obtained. The memory accesses of attacks on 7-round AES-128, 7-round AES-192, 7-round AES-256, and 8-round AES-256 are reduced to 2116.35, 2116.54, 2116.35, and 2228.21 from 2117.2, 2118.8, 2118.8, and 2229.7, respectively, and in the meanwhile the data complexity keeps unchanged.
A new key-sieving algorithm used in impossible differential attacks on advanced encryption standard (AES) is proposed. In the new algorithm, table look-up technique is firstly applied to eliminate some error keys, and then a divide-and-conquer technique is adopted to sieve the others. It is shown that the new algorithm gains some advantage over previously published key-sieving algorithms with respect to the time complexity when proper independent variables are chosen in the function of the time complexity. Moreover, we improve the impossible differential attacks on AES proposed in INDOCRYPT2008 by means of the new algorithm, meanwhile the curves of time complexity are drawn and the best points are obtained. The memory accesses of attacks on 7-round AES-128, 7-round AES-192, 7-round AES-256, and 8-round AES-256 are reduced to 2116.35, 2116.54, 2116.35, and 2228.21 from 2117.2, 2118.8, 2118.8, and 2229.7, respectively, and in the meanwhile the data complexity keeps unchanged.
Analysis and Verification of Energy Transmission Characteristic for Transient Electromagnetic Pulses
2011, 40(3): 401-405.
doi: 10.3969/j.issn.1001-0548.2011.03.015
Abstract:
The energy transmission characteristic of transient electromagnetic pulses is analysed and verified when Gaussian pulses are fed to antennas. The uniformly distributed circular current is simplified as a point radiation source according to the analysis and verification of energy transmission characteristic when far field of antenna is studied. On basis of this simplification for radiation source, the analysis and verification of energy transmission characteristic with arrayed elements have been completed. Transmission energy along z axis comes from superposition of transient electromagnetic waves rather than photon quantum characteristic of Maxwell equations for radiation sources.
The energy transmission characteristic of transient electromagnetic pulses is analysed and verified when Gaussian pulses are fed to antennas. The uniformly distributed circular current is simplified as a point radiation source according to the analysis and verification of energy transmission characteristic when far field of antenna is studied. On basis of this simplification for radiation source, the analysis and verification of energy transmission characteristic with arrayed elements have been completed. Transmission energy along z axis comes from superposition of transient electromagnetic waves rather than photon quantum characteristic of Maxwell equations for radiation sources.
2011, 40(3): 406-410.
doi: 10.3969/j.issn.1001-0548.2011.03.016
Abstract:
Handshaking expansion is a main procedure in the design of asynchronous circuits. At present, there is not description and definition for the refinement of handshaking expansion formality. Through investigating formal semantics of the handshaking expansion of asynchronous circuits, a refinement model for handshaking expansion is presented based on a powerful strategy of action refinement in the hierarchical design of concurrent systems. The proposed semantics employs wait event structures and then derives a true concurrency model with maximum parallelism. The refined system conforms to the original specification with respect to a vertical bisimulation relation. Furthermore, the refinement function preserves correctness and deadlock-freeness of the behavior in the refined system.
Handshaking expansion is a main procedure in the design of asynchronous circuits. At present, there is not description and definition for the refinement of handshaking expansion formality. Through investigating formal semantics of the handshaking expansion of asynchronous circuits, a refinement model for handshaking expansion is presented based on a powerful strategy of action refinement in the hierarchical design of concurrent systems. The proposed semantics employs wait event structures and then derives a true concurrency model with maximum parallelism. The refined system conforms to the original specification with respect to a vertical bisimulation relation. Furthermore, the refinement function preserves correctness and deadlock-freeness of the behavior in the refined system.
2011, 40(3): 411-417.
doi: 10.3969/j.issn.1001-0548.2011.03.017
Abstract:
Based on generalization of the Hermite-Biehler theorem, the stable regions of proportional gain of PID Controller can be determined by the inverse Nyquist plot of the time delay plant. In the integral and differential gain plane, an anti-clockwise rule of judgment method is proposed for more than a boundary line. It may quickly determine the parameter stable regions in this two-dimensional plane. Thus a new approach is given to determine the stable regions of PID controller parameter space for time delay systems. The given algorithm is suitable for software realization. The simulation examples demonstrate the validity of the proposed algorithm.
Based on generalization of the Hermite-Biehler theorem, the stable regions of proportional gain of PID Controller can be determined by the inverse Nyquist plot of the time delay plant. In the integral and differential gain plane, an anti-clockwise rule of judgment method is proposed for more than a boundary line. It may quickly determine the parameter stable regions in this two-dimensional plane. Thus a new approach is given to determine the stable regions of PID controller parameter space for time delay systems. The given algorithm is suitable for software realization. The simulation examples demonstrate the validity of the proposed algorithm.
2011, 40(3): 418-423.
doi: 10.3969/j.issn.1001-0548.2011.03.018
Abstract:
Based on creator terrain studio (CTS) and Vega Prime, this paper manages to build up the massive terrain 3D simulation system. By preprocessing database of ETM and DEM in Fujian, virtual texture and topographic pattern are generated by CTS. After texture mapping, a 3D massive terrain scene is created by using of Vega Prime and finally massive terrain 3D simulation system is realized based on MFC. The application of virtual texture, level of detail model, organization of massive terrain database, terrain texture mapping, large terrain collision detection, and large terrain dispatching technology is helpful in solving large scale image and terrain roaming.
Based on creator terrain studio (CTS) and Vega Prime, this paper manages to build up the massive terrain 3D simulation system. By preprocessing database of ETM and DEM in Fujian, virtual texture and topographic pattern are generated by CTS. After texture mapping, a 3D massive terrain scene is created by using of Vega Prime and finally massive terrain 3D simulation system is realized based on MFC. The application of virtual texture, level of detail model, organization of massive terrain database, terrain texture mapping, large terrain collision detection, and large terrain dispatching technology is helpful in solving large scale image and terrain roaming.
2011, 40(3): 424-428.
doi: 10.3969/j.issn.1001-0548.2011.03.019
Abstract:
The paper proposes an IPv6-address auto-configuration scheme for wireless sensor networks. In the scheme, one wireless sensor network is divided into a few clusters and the IPv6 address structures for a cluster head and a cluster member are proposed. By adopting Hash division method, IPv6 addresses for cluster heads and cluster members are allocated and the linear probing is used to solve address collision. The performance parameters of the proposed scheme, including duplicate address detection cost, address configuration cost, and address configuration delay time, are analyzed. The experimental results show that the proposed scheme is effectitve and efficient.
The paper proposes an IPv6-address auto-configuration scheme for wireless sensor networks. In the scheme, one wireless sensor network is divided into a few clusters and the IPv6 address structures for a cluster head and a cluster member are proposed. By adopting Hash division method, IPv6 addresses for cluster heads and cluster members are allocated and the linear probing is used to solve address collision. The performance parameters of the proposed scheme, including duplicate address detection cost, address configuration cost, and address configuration delay time, are analyzed. The experimental results show that the proposed scheme is effectitve and efficient.
2011, 40(3): 429-434.
doi: 10.3969/j.issn.1001-0548.2011.03.020
Abstract:
In this paper, we propose a method to solve the problem of geometry theorem proving based on ontology theory. We describe the process of ontology construction, the reasoning based on ontology and prolog rules, and an example of a geometry theorem proving. The result shows that theorem proving based on ontology is efficient. This approach has advantages such as avoiding determining the problem repeatedly, natural language more closely, expressing the domain knowledge and the concepts hierarchy clearly. In addition this method can execute reasoning of complex relationships, and ultimately accomplishes elementary geometry theorem proving on ontology and prolog rules.
In this paper, we propose a method to solve the problem of geometry theorem proving based on ontology theory. We describe the process of ontology construction, the reasoning based on ontology and prolog rules, and an example of a geometry theorem proving. The result shows that theorem proving based on ontology is efficient. This approach has advantages such as avoiding determining the problem repeatedly, natural language more closely, expressing the domain knowledge and the concepts hierarchy clearly. In addition this method can execute reasoning of complex relationships, and ultimately accomplishes elementary geometry theorem proving on ontology and prolog rules.
2011, 40(3): 435-439.
doi: 10.3969/j.issn.1001-0548.2011.03.021
Abstract:
Email worms have recently become the most serious security threat on the internet. In this paper, a contact-tracing chain based framework (CTCBF) is proposed to detect this worm through tracing the contact behaviors among peers. This framework uses the contact tracing chain to trace abnormal peers which are screened out by isolated monitoring, and develops "difference entropy" to group peers with the same abnormal behaviors. Peers are confirmed with infectious symptoms when the length of contact tracing chain which they belong to reaches the preset threshold. Through numerical simulations, we demonstrate that the proposed contact tracing framework can quickly detect the propagation of Email Worm.
Email worms have recently become the most serious security threat on the internet. In this paper, a contact-tracing chain based framework (CTCBF) is proposed to detect this worm through tracing the contact behaviors among peers. This framework uses the contact tracing chain to trace abnormal peers which are screened out by isolated monitoring, and develops "difference entropy" to group peers with the same abnormal behaviors. Peers are confirmed with infectious symptoms when the length of contact tracing chain which they belong to reaches the preset threshold. Through numerical simulations, we demonstrate that the proposed contact tracing framework can quickly detect the propagation of Email Worm.
2011, 40(3): 440-445.
doi: 10.3969/j.issn.1001-0548.2011.03.022
Abstract:
In this paper we present a novel approach for long-term prediction of the development trend of Web sentiment. For each class of social events, the class model library of the development trend of Web sentiment is established by cycle analysis and hierarchical clustering. Then the adaptive transform is applied to the already known development trend of a new social event, and the min-sum of MSE from the library is selected to predict the future development trend of web sentiment. Experiments show that, compared with the traditional methods, the approach presented in this paper yields a higher correlation in predicting the long-term development trend of web sentiment, and can predict the turning points of the development trend more effectively.
In this paper we present a novel approach for long-term prediction of the development trend of Web sentiment. For each class of social events, the class model library of the development trend of Web sentiment is established by cycle analysis and hierarchical clustering. Then the adaptive transform is applied to the already known development trend of a new social event, and the min-sum of MSE from the library is selected to predict the future development trend of web sentiment. Experiments show that, compared with the traditional methods, the approach presented in this paper yields a higher correlation in predicting the long-term development trend of web sentiment, and can predict the turning points of the development trend more effectively.
2011, 40(3): 446-450.
doi: 10.3969/j.issn.1001-0548.2011.03.023
Abstract:
A three-dimensional (3D) structure extraction algorithm based on a rectification method in 3D space for SHGC (straight homogeneous generalized cylinders) is designed in this paper. This algorithm resorts to the properties of SHGC and aims at the difficulties of the 3D information extraction from a single image. Different from the conventional algorithms of SHGC, a two-dimensional cross section which resemble the cross section of the original object is constructed in this algorithm. The cross section is placed into a 3D coordinates system with an additional z-axis, which is perpendicular to the 2D cross section. The interesting points on the constructed cross section are matched with those on the cross section of the object from the image. The affine imaging arguments pair (λ, θ) under the circumstance of the best matching solution are searched step by step through the rotation and transportation operated on the constructed cross section. With the best result pair (λ, θ), the 3D information of the cross section can be extracted quickly, and the whole 3D structure can be obtained at the next step if the contour is extracted by the meridian of the SHGC. The texture of the SHGC can be extracted and is pasted onto the 3D structure through a mass of triangular grids. The experiments show that the proposed algorithm is available and proper.
A three-dimensional (3D) structure extraction algorithm based on a rectification method in 3D space for SHGC (straight homogeneous generalized cylinders) is designed in this paper. This algorithm resorts to the properties of SHGC and aims at the difficulties of the 3D information extraction from a single image. Different from the conventional algorithms of SHGC, a two-dimensional cross section which resemble the cross section of the original object is constructed in this algorithm. The cross section is placed into a 3D coordinates system with an additional z-axis, which is perpendicular to the 2D cross section. The interesting points on the constructed cross section are matched with those on the cross section of the object from the image. The affine imaging arguments pair (λ, θ) under the circumstance of the best matching solution are searched step by step through the rotation and transportation operated on the constructed cross section. With the best result pair (λ, θ), the 3D information of the cross section can be extracted quickly, and the whole 3D structure can be obtained at the next step if the contour is extracted by the meridian of the SHGC. The texture of the SHGC can be extracted and is pasted onto the 3D structure through a mass of triangular grids. The experiments show that the proposed algorithm is available and proper.
2011, 40(3): 451-455.
doi: 10.3969/j.issn.1001-0548.2011.03.024
Abstract:
An algorithm of cryptographic hash function based on time-delay chaotic system is presented in this paper. In this algorithm, initial message is modulated into time-delay chaotic iteration, and the Hash value can be calculated by a HMAC-MD5 algorithm. Thus, every bit of this Hash value is correlative with initial message,and this Hash value is very sensitive to micro changes of the initial message or the initial condition of chaotic system. By theory analyses and simulations, we obtain that the Hash value has irregularity and diffusion properties, and the parameter space is augmented because of the properties of chaos. The nonlinear relation between hash value and initial message can be effectively against linear analysis. Therefore, this Hash function based on time-delay chaotic system can get better anti-attack and anti-collision capacity.
An algorithm of cryptographic hash function based on time-delay chaotic system is presented in this paper. In this algorithm, initial message is modulated into time-delay chaotic iteration, and the Hash value can be calculated by a HMAC-MD5 algorithm. Thus, every bit of this Hash value is correlative with initial message,and this Hash value is very sensitive to micro changes of the initial message or the initial condition of chaotic system. By theory analyses and simulations, we obtain that the Hash value has irregularity and diffusion properties, and the parameter space is augmented because of the properties of chaos. The nonlinear relation between hash value and initial message can be effectively against linear analysis. Therefore, this Hash function based on time-delay chaotic system can get better anti-attack and anti-collision capacity.
2011, 40(3): 456-460.
doi: 10.3969/j.issn.1001-0548.2011.03.025
Abstract:
In this paper, an improved safe intra-task voltage scheduling algorithm using scenario detection is proposed for the energy-efficient designs of the mobile embedded real-time systems. The ranges of few parameters in the program of the task are used to describe scenarios which are detected in the process of the task execution, and some of the remaining execution paths can accurately be predicted in the on-line mode which can optimize the voltage scheduling. Furthermore, the most reasonable points in the program to detect scenarios are searched out by the proposed scenario detection point positioning algorithm. The implementing method of the algorithm is presented and the effectiveness on reducing energy consumption of the task execution is validated through the simulation studies.
In this paper, an improved safe intra-task voltage scheduling algorithm using scenario detection is proposed for the energy-efficient designs of the mobile embedded real-time systems. The ranges of few parameters in the program of the task are used to describe scenarios which are detected in the process of the task execution, and some of the remaining execution paths can accurately be predicted in the on-line mode which can optimize the voltage scheduling. Furthermore, the most reasonable points in the program to detect scenarios are searched out by the proposed scenario detection point positioning algorithm. The implementing method of the algorithm is presented and the effectiveness on reducing energy consumption of the task execution is validated through the simulation studies.
2011, 40(3): 461-464.
doi: 10.3969/j.issn.1001-0548.2011.03.026
Abstract:
Attention deficit hyperactivity disorder (ADHD) is one of the most common mental disorders that develop in children. In this paper, a telemedicine system for ADHD based on multi-agent has been designed and implemented. A framework and collaborative model of multi-agent for telemedicine has been proposed. A evaluation system of multi-parameters based on multi-agent has been developed. Analytic hierarchy process is used for the decision-making of cooperative medicine and for the evaluation of ADHD. The ADHD patients were treated using an EEG biofeedback instrument at their home. The efficiency of the evaluation and therapy of ADHD is improved by using the telemedicine system.
Attention deficit hyperactivity disorder (ADHD) is one of the most common mental disorders that develop in children. In this paper, a telemedicine system for ADHD based on multi-agent has been designed and implemented. A framework and collaborative model of multi-agent for telemedicine has been proposed. A evaluation system of multi-parameters based on multi-agent has been developed. Analytic hierarchy process is used for the decision-making of cooperative medicine and for the evaluation of ADHD. The ADHD patients were treated using an EEG biofeedback instrument at their home. The efficiency of the evaluation and therapy of ADHD is improved by using the telemedicine system.
2011, 40(3): 465-469.
doi: 10.3969/j.issn.1001-0548.2011.03.027
Abstract:
During the study of brain mechanism of response inhibition using event-related potentials (ERP) under Go/NoGo experiment paradigm, traditional research results have shown that ERP following Go/NoGo tasks show two major differences between Go and NoGo trials at the prefrontal area. One is a negative deflection of N2 component in NoGo trials compared to Go trials, and the other is a positive deflection of P3 component in NoGo trials compared to Go trials. They are also named NoGo-N2 effect and P3 effect. The overlap of movement-related component deriving behavior response on Go trials may make true NoGo-N2 effect and P3 effect to be masked. In order to recover true NoGo-N2 effect and P3 effect, stimulus and response components decomposition method is applied to eliminate the influence of motor-related component in Go trials. Results show that NoGo-P3 effect is resulted from overlap of motor-related component and it may not relate to response inhibition processes, while NoGo-N2 effect is related to response inhibition processes.
During the study of brain mechanism of response inhibition using event-related potentials (ERP) under Go/NoGo experiment paradigm, traditional research results have shown that ERP following Go/NoGo tasks show two major differences between Go and NoGo trials at the prefrontal area. One is a negative deflection of N2 component in NoGo trials compared to Go trials, and the other is a positive deflection of P3 component in NoGo trials compared to Go trials. They are also named NoGo-N2 effect and P3 effect. The overlap of movement-related component deriving behavior response on Go trials may make true NoGo-N2 effect and P3 effect to be masked. In order to recover true NoGo-N2 effect and P3 effect, stimulus and response components decomposition method is applied to eliminate the influence of motor-related component in Go trials. Results show that NoGo-P3 effect is resulted from overlap of motor-related component and it may not relate to response inhibition processes, while NoGo-N2 effect is related to response inhibition processes.
2011, 40(3): 470-475.
doi: 10.3969/j.issn.1001-0548.2011.03.028
Abstract:
Since the constraints of various objective reasons and conditions, the lack of data exists in reliability engineering widely, especially in reliability-based design of aerospace. There is large amount subjective information exists in initialize data. Traditional reliability analysis method, such as probability-based method, can not handle the situation when both epistemic and aleatory uncertainties are presented in the system, the results acquired by probability-based method have large errors when used in practical engineering, sometimes may acquire a wrong result. This paper is aim at the spaceflight harmonic drive. After the sources of uncertainties and the method how to handle them are introduced, the mixture reliability analysis model of probability and non-probability are presented under both epistemic and aleatory uncertainties, and the reliability analysis model of harmonic drive is established while the sensitivity of parameters is given based on this reliability analysis model. Since the so called most probable point (MPP) search is not required, the proposed method is robust.
Since the constraints of various objective reasons and conditions, the lack of data exists in reliability engineering widely, especially in reliability-based design of aerospace. There is large amount subjective information exists in initialize data. Traditional reliability analysis method, such as probability-based method, can not handle the situation when both epistemic and aleatory uncertainties are presented in the system, the results acquired by probability-based method have large errors when used in practical engineering, sometimes may acquire a wrong result. This paper is aim at the spaceflight harmonic drive. After the sources of uncertainties and the method how to handle them are introduced, the mixture reliability analysis model of probability and non-probability are presented under both epistemic and aleatory uncertainties, and the reliability analysis model of harmonic drive is established while the sensitivity of parameters is given based on this reliability analysis model. Since the so called most probable point (MPP) search is not required, the proposed method is robust.
2011, 40(3): 476-480.
doi: 10.3969/j.issn.1001-0548.2011.03.029
Abstract:
A comprehensive introduction to a kind of optimum design for turning over motion of cooking robot, it is used to adjust the motion parameter of wok. Firstly, the paper introduces the mechanism of wok motion and realizing principle of wok's turning over. Secondly, kinematic and kinetic analysis for mass point m is accomplished and modeled. Thirdly, the optimum realized method of wok's turning over is obtained for the wok motion components. It solves the problem that the cooking robot simulate the special cooking motion made by chef. Great deals of experiments show that this method can accomplish the complex cooking motion such as great turning over and little turning over etc., and satisfy the requirements of wok motion of cooking robot.
A comprehensive introduction to a kind of optimum design for turning over motion of cooking robot, it is used to adjust the motion parameter of wok. Firstly, the paper introduces the mechanism of wok motion and realizing principle of wok's turning over. Secondly, kinematic and kinetic analysis for mass point m is accomplished and modeled. Thirdly, the optimum realized method of wok's turning over is obtained for the wok motion components. It solves the problem that the cooking robot simulate the special cooking motion made by chef. Great deals of experiments show that this method can accomplish the complex cooking motion such as great turning over and little turning over etc., and satisfy the requirements of wok motion of cooking robot.
