Many communication systems use the cyclic redundancy code （CRC） technique for protecting key data fields from transmission errors by enabling both single-bit error correction and multi-bit error detection. The look-...Many communication systems use the cyclic redundancy code （CRC） technique for protecting key data fields from transmission errors by enabling both single-bit error correction and multi-bit error detection. The look-up table design is very important for the error-correction implementation. This paper presents a CRC look-up table optimization method for single-bit error correction. The optimization method minimizes the address length of the pre-designed look-up table while satisfying certain restrictions. The circuit implementation is also presented to show the feasibility of the method in the application specific integrated circuit design. An application of the optimization method in the generic framing procedure protocol is implemented using field programmable gatearrays. The result shows that the memory address length has been minimized, while keeping a very simple circuit implementation.展开更多
The current exact Rayleigh scattering calculation of ocean color remote sensing uses the look-up table （LUT）, which is usually created for a special remote sensor and cannot be applied to other sensors. For practica...The current exact Rayleigh scattering calculation of ocean color remote sensing uses the look-up table （LUT）, which is usually created for a special remote sensor and cannot be applied to other sensors. For practical application, a general purpose Rayleigh scattering LUT which can be applied to all ocean color remote sensors is generated. An adding-doubling method to solve the vector radiative transfer equation in the plane-parallel atmosphere is deduced in detail. Compared with the exact Rayleigh scattering radiance derived from the MODIS exact Rayleigh scattering LUT, it is proved that the relative error of Rayleigh scattering calculation with the adding-doubling method is less than 0.25%, which meets the required accuracy of the atmospheric correction of ocean color remote sensing. Therefore, the adding-doubling method can be used to generate the exact Rayleigh scattering LUT for the ocean color remote sensors. Finally, the general purpose exact Rayleigh scattering LUT is generated using the adding-doubling method. On the basis of the general purpose LUT, the calculated Rayleigh scattering radiance is tested by comparing with the LUTs ofMODIS, SeaWiFS and the other ocean color sensors, showing that the relative errors are all less than 0.5%, and this general purpose LUT can be applied to all ocean color remote sensors.展开更多
The BeiDou software receiver uses the fast Fourier transform(FFT)to perform the acquisition.The Doppler shift estimation accuracy should be less than 500 Hz to ensure satellite signals to enter a locked state in the t...The BeiDou software receiver uses the fast Fourier transform(FFT)to perform the acquisition.The Doppler shift estimation accuracy should be less than 500 Hz to ensure satellite signals to enter a locked state in the tracking loop.Since the frequency step is usually 500 Hz or larger,the Doppler shift estimation accuracy cannot guarantee that satellite signals are brought into a stable tracking state.The straightforward solutions consist in increasing the sampling time and using zero-padding to improve the frequency resolution of the FFT.However,these solutions intensify the complexity and amount of computation.The contradiction between the acquisition accuracy and the computational load leads us to research for a more simple and effective algorithm,which achieves fine acquisition by a look-up table.After coarse acquisition using the parallel frequency acquisition(PFA)algorithm,the proposed algorithm optimizes the Doppler shift estimation through the look-up table method based on the FFT results to improve the acquisition accuracy of the Doppler shift with a minimal additional computing load.When the Doppler shift is within the queryable range of the table,the proposed algorithm can improve the Doppler shift estimation accuracy to 50 Hz for the BeiDou B1I signal.展开更多
As far as the weight digraph is considered, based on the table instead of the weightdigraph, an optimal spanning tree method called the Table Operations Method (TOM) is proposed.And the optimality is proved and a nume...As far as the weight digraph is considered, based on the table instead of the weightdigraph, an optimal spanning tree method called the Table Operations Method (TOM) is proposed.And the optimality is proved and a numerical example is demonstrated.展开更多
Global look-up table strategy proposed recently has been proven to be an efficient method to accelerate the interpolation, which is the most time-consuming part in the iterative sub-pixel digital image correlation （...Global look-up table strategy proposed recently has been proven to be an efficient method to accelerate the interpolation, which is the most time-consuming part in the iterative sub-pixel digital image correlation （DIC） algorithms. In this paper, a global look-up table strategy with cubic B-spline interpolation is developed for the DIC method based on the inverse compositional Gauss-Newton （IC-GN） algorithm. The performance of this strategy, including accuracy, precision, and computation efficiency, is evaluated through a theoretical and experimental study, using the one with widely employed bicubic interpolation as a benchmark. The global look-up table strategy with cubic B-spline interpolation improves significantly the accuracy of the IC-GN algorithm-based DIC method compared with the one using the bicubic interpolation, at a trivial price of computation efficiency.展开更多
Computer-generated holography technology has been widely applied,and as research in this field deepens,the demand for memory and computational power in small AR and VR devices continues to increase.This paper presents...Computer-generated holography technology has been widely applied,and as research in this field deepens,the demand for memory and computational power in small AR and VR devices continues to increase.This paper presents a hologram generation method,i.e.,a symmetrically high-compressed look-up table method,which can reduce memory usage by50%.In offline computing,half of the basic horizontal and vertical modulation factors are stored,halving the memory requirements without affecting inline speed.Currently,its potential extends to various holographic applications,including the production of optical diffraction elements.展开更多
Obtaining the vertical distribution profile of trace gas is of great significance for studying the diffusion procedure of air pollution.In this article,a look-up table method based on multi-axis differential optical a...Obtaining the vertical distribution profile of trace gas is of great significance for studying the diffusion procedure of air pollution.In this article,a look-up table method based on multi-axis differential optical absorption spectroscopy(MAX-DOAS)technology is established for retrieving the tropospheric NO_(2) vertical distribution profiles.This method retrieves the aerosol extinction profiles with minimum cost function.Then,the aerosol extinction profiles and the atmospheric radiation transfer model(RTM)are employed to establish the look-up table for retrieving the NO_(2) vertical column densities(VCDs)and profiles.The measured NO_(2) differential slant column densities(DSCDs)are compared with the NO_(2) DSCDs simulated by the atmospheric RTM,and the NO_(2) VCDs,the weight factor of NO_(2) in the boundary layer,and the boundary layer height are obtained by the minimization process.The look-up table is established to retrieve NO_(2) VCDs based on MAX-DOAS measurements in Huaibei area,and the results are compared with the data from Copernicus Atmospheric Monitoring Service(CAMS)model.It is found that there are nearly consistent and the correlation coefficient R2 is more than 0.86.The results show that this technology provides a more convenient and accurate retrieval method for the stereoscopic monitoring of atmospheric environment.展开更多
To solve the hardware deployment problem caused by the vast demanding computational complexity of convolutional layers and limited hardware resources for the hardware network inference,a look-up table(LUT)-based convo...To solve the hardware deployment problem caused by the vast demanding computational complexity of convolutional layers and limited hardware resources for the hardware network inference,a look-up table(LUT)-based convolution architecture built on a field-programmable gate array using integer multipliers and addition trees is used.With the help of the Winograd algorithm,the optimization of convolution and multiplication is realized to reduce the computational complexity.The LUT-based operator is further optimized to construct a processing unit(PE).Simultaneously optimized storage streams improve memory access efficiency and solve bandwidth constraints.The data toggle rate is reduced to optimize power consumption.The experimental results show that the use of the Winograd algorithm to build basic processing units can significantly reduce the number of multipliers and achieve hardware deployment acceleration,while the time-division multiplexing of processing units improves resource utilization.Under this experimental condition,compared with the traditional convolution method,the architecture optimizes computing resources by 2.25 times and improves the peak throughput by 19.3 times.The LUT-based Winograd accelerator can effectively solve the deployment problem caused by limited hardware resources.展开更多
Shaking tables with moving platforms are widely used in laboratory testing of structural models and full-sized devices. In most cases, the platform＇s movement should reproduce real ground acceleration records. Howeve...Shaking tables with moving platforms are widely used in laboratory testing of structural models and full-sized devices. In most cases, the platform＇s movement should reproduce real ground acceleration records. However, the stroke of the platform, required for reproduction of real records, is usually rather large. This limitation does not allow an accurate realization of the ground motion by the shaking table. Commonly, in order to overcome this problem, original records are modified, which causes a significant change in the acceleration records＇ spectra. That is why structural responses to the original and to the modified records are different. A new method for modification of original acceleration records is proposed, in which the original record is corrected by an additional artificial one that changes the shaking platform＇s displacement. The corrected record is obtained as a sequence of impulses, The magnitude and duration of each impulse, as well as their location on the time scale, are obtained by an optimization procedure. The optimization is implemented according to a performance index, aimed to minimize the influence of the correcting acceleration record on the specmam of the original one. The proposed method has higher reproduction accuracy, compared to other known methods. Its effectiveness is demonstrated by comparison of response spectra and dynamic behaviors of three multi-story structures subjected to natural and modified seismic excitations.展开更多
As far as the weighted digraph is considered, an optimal directed spanning tree algorithm called table based algorithm (TBA) is proposed in the paper based on the table instead of the weighted digraph. The optimality ...As far as the weighted digraph is considered, an optimal directed spanning tree algorithm called table based algorithm (TBA) is proposed in the paper based on the table instead of the weighted digraph. The optimality is proved, and a numerical example is demonstrated.展开更多
Test points selection for integer-coded fault wise table is a discrete optimization problem. The global minimum set of test points can only be guaranteed by an exhaustive search which is eompurationally expensive. In ...Test points selection for integer-coded fault wise table is a discrete optimization problem. The global minimum set of test points can only be guaranteed by an exhaustive search which is eompurationally expensive. In this paper, this problem is formulated as a heuristic depth-first graph search problem at first. The graph node expanding method and rules are given. Then, rollout strategies are applied, which can be combined with the heuristic graph search algorithms, in a computationally more efficient manner than the optimal strategies, to obtain solutions superior to those using the greedy heuristic algorithms. The proposed rollout-based test points selection algorithm is illustrated and tested using an analog circuit and a set of simulated integer-coded fault wise tables. Computa- tional results are shown, which suggest that the rollout strategy policies are significantly better than other strategies.展开更多
In order to meet the polishing requirement of faucets and other products,a novel multi-station rotary polishing robot is designed,which is a PPPR + RR type of degree of freedom( DOF) distribution structure,and is simi...In order to meet the polishing requirement of faucets and other products,a novel multi-station rotary polishing robot is designed,which is a PPPR + RR type of degree of freedom( DOF) distribution structure,and is similar to dual-arm robot. Forward and inverse kinematic analysis is carried out by robot modeling. In order to make this robot structure more compact,first of all,X,Y and Z three moving degrees of freedom( DOF) limit stroke polishing need is calculated by using an artificial fish swarm algorithm,which analyzes dexterous workspace of this robot. Then,on the basis of the above analysis,the three DOF stroke is optimized. Simulation and polishing experimental results verify that this polishing robot with optimized stroke parameters can meet the polishing needs of faucets and other bathroom pieces.展开更多
Test points selection for integer-coded fault wise table is a discrete optimization problem. On one hand, traditional exhaustive search method is computationally expensive. On the other hand, the space complexity of t...Test points selection for integer-coded fault wise table is a discrete optimization problem. On one hand, traditional exhaustive search method is computationally expensive. On the other hand, the space complexity of traditional exhaustive is low. A tradeoff method between the high time complexity and low space complexity is proposed. At first, a new fault-pair table is constructed based on the integer-coded fault wise table. The fault-pair table consists of two columns： one column represents fault pair and the other represents test points set that can distinguish the corresponding faults. Then, the rows are arranged in ascending order according to the cardinality of corresponding test points set. Thirdly, test points in the top rows are selected one by one until all fault pair are isolated. During the test points selection process, the rows that contain selected test points are deleted and then the dimension of fault-pair table decreases gradually. The proposed test points selection algorithm is illustrated and tested using an integercoded fault wise table derived from a real analog circuit. Computational results suggest show policies are better than the exhaustive strategy.展开更多
The goal of railway rolling stock maintenance and replacement approaches is to reduce overall cost while increasing reliability which is multi objective op</span><span style="font-family:Verdana;"&g...The goal of railway rolling stock maintenance and replacement approaches is to reduce overall cost while increasing reliability which is multi objective op</span><span style="font-family:Verdana;">timization problem and a proper predictive maintenance scheduling table sh</span><span style="font-family:Verdana;">ould be adequately designed. We propose Breeding Particle Swarm Optimization (BPSO) model based on the concepts of Breeding Swarm and Genetic Algor</span><span style="font-family:Verdana;">ithm (GA) operators to design this table. The practical experiment shows th</span><span style="font-family:Verdana;">at our model reduces cost while increasing reliability compared to other models previously utilized.展开更多
Dynamic programming(DP) is an effective query optimization approach to select an appropriate join order for relational database management system(RDBMS) in multi-table joins. This method was extended and made availabl...Dynamic programming(DP) is an effective query optimization approach to select an appropriate join order for relational database management system(RDBMS) in multi-table joins. This method was extended and made available in distributed DBMS(D-DBMS). The structure of this optimal solution was firstly characterized according to the distributing status of tables and data, and then the recurrence relations between a problem and its sub-problems were recursively defined. DP in D-DBMS has the same time-complexity with that in centralized DBMS, while it has the capability to solve a much more sophisticated optimal problem of multi-table join in D-DBMS. The effectiveness of this optimal strategy has been proved by experiments.展开更多
One of the primary risk factors at junctions on urban roads is vehicle speed.To curb over-speeding and road crashes at intersections,traffic calming measures are introduced.Current research aims at studying the impact...One of the primary risk factors at junctions on urban roads is vehicle speed.To curb over-speeding and road crashes at intersections,traffic calming measures are introduced.Current research aims at studying the impact of different geometries of recently constructed speed tables on the operational speed over such intersections.Since these treatments have been widely used to regulate speed in other countries,evaluating their efficacy in the Indian context was required.This study utilises 6000 vehicle samples of four different vehicle classes(two-wheeler,three-wheeler,cars,and buses)from 12 speed tables in total.The speed and acceleration kinematics in addition to the high-quality trajectory data over long road segments were extracted from the video recordings of an unmanned aerial vehicle(UAV).Multi-factor response surface methodology(RSM)was utilized to optimize the geometric parameters(variables)of the speed tables to achieve the requisite operational speed(predictor)at the considered measure.The box plots are provided to indicate descriptives of the parameters regarding the 85th percentile speed.Multiple linear regression and analysis-of-variance(ANOVA)identified the variables that were significant and fit to devise the required optimization model.This study can help in identifying the influence zone,concerning physical characteristics of speed tables and their effect on the design speed at the approaches of intersections at urban arterials.The outcomes of the study will cater to enhance the current guidelines and standards in India regarding speed table geometry for urban road sections.展开更多
文摘Many communication systems use the cyclic redundancy code （CRC） technique for protecting key data fields from transmission errors by enabling both single-bit error correction and multi-bit error detection. The look-up table design is very important for the error-correction implementation. This paper presents a CRC look-up table optimization method for single-bit error correction. The optimization method minimizes the address length of the pre-designed look-up table while satisfying certain restrictions. The circuit implementation is also presented to show the feasibility of the method in the application specific integrated circuit design. An application of the optimization method in the generic framing procedure protocol is implemented using field programmable gatearrays. The result shows that the memory address length has been minimized, while keeping a very simple circuit implementation.
基金supported by the National Natural Science Foundation of China under contract No.40506036the High Tech Research and Development"863"Program of China under contract No.2003AA131160-04the Science and Technology Plan of Zhejiang Province of China under contract Nos 2004E60054 and 2004C13027.
文摘The current exact Rayleigh scattering calculation of ocean color remote sensing uses the look-up table （LUT）, which is usually created for a special remote sensor and cannot be applied to other sensors. For practical application, a general purpose Rayleigh scattering LUT which can be applied to all ocean color remote sensors is generated. An adding-doubling method to solve the vector radiative transfer equation in the plane-parallel atmosphere is deduced in detail. Compared with the exact Rayleigh scattering radiance derived from the MODIS exact Rayleigh scattering LUT, it is proved that the relative error of Rayleigh scattering calculation with the adding-doubling method is less than 0.25%, which meets the required accuracy of the atmospheric correction of ocean color remote sensing. Therefore, the adding-doubling method can be used to generate the exact Rayleigh scattering LUT for the ocean color remote sensors. Finally, the general purpose exact Rayleigh scattering LUT is generated using the adding-doubling method. On the basis of the general purpose LUT, the calculated Rayleigh scattering radiance is tested by comparing with the LUTs ofMODIS, SeaWiFS and the other ocean color sensors, showing that the relative errors are all less than 0.5%, and this general purpose LUT can be applied to all ocean color remote sensors.
基金the Open Project of State Key Laboratory of Automotive Simulation and Control,Jilin University(20161108)the National Natural Science Foundation of China(51505221)the Fundamental Research Funds for the Central Universities(NS2019022).
文摘The BeiDou software receiver uses the fast Fourier transform(FFT)to perform the acquisition.The Doppler shift estimation accuracy should be less than 500 Hz to ensure satellite signals to enter a locked state in the tracking loop.Since the frequency step is usually 500 Hz or larger,the Doppler shift estimation accuracy cannot guarantee that satellite signals are brought into a stable tracking state.The straightforward solutions consist in increasing the sampling time and using zero-padding to improve the frequency resolution of the FFT.However,these solutions intensify the complexity and amount of computation.The contradiction between the acquisition accuracy and the computational load leads us to research for a more simple and effective algorithm,which achieves fine acquisition by a look-up table.After coarse acquisition using the parallel frequency acquisition(PFA)algorithm,the proposed algorithm optimizes the Doppler shift estimation through the look-up table method based on the FFT results to improve the acquisition accuracy of the Doppler shift with a minimal additional computing load.When the Doppler shift is within the queryable range of the table,the proposed algorithm can improve the Doppler shift estimation accuracy to 50 Hz for the BeiDou B1I signal.
文摘As far as the weight digraph is considered, based on the table instead of the weightdigraph, an optimal spanning tree method called the Table Operations Method (TOM) is proposed.And the optimality is proved and a numerical example is demonstrated.
基金financially supported by the National Natural Science Foundation of China(11202081,11272124,and 11472109)the State Key Lab of Subtropical Building Science,South China University of Technology(2014ZC17)
文摘Global look-up table strategy proposed recently has been proven to be an efficient method to accelerate the interpolation, which is the most time-consuming part in the iterative sub-pixel digital image correlation （DIC） algorithms. In this paper, a global look-up table strategy with cubic B-spline interpolation is developed for the DIC method based on the inverse compositional Gauss-Newton （IC-GN） algorithm. The performance of this strategy, including accuracy, precision, and computation efficiency, is evaluated through a theoretical and experimental study, using the one with widely employed bicubic interpolation as a benchmark. The global look-up table strategy with cubic B-spline interpolation improves significantly the accuracy of the IC-GN algorithm-based DIC method compared with the one using the bicubic interpolation, at a trivial price of computation efficiency.
基金Project supported by the National Natural Science Foundation of China (Grant No.62205350)the Special Project of Central Government Guiding Local Science and Technology Development in Beijing 2020 (Grant No.Z20111000430000)the Guangxi Nanning Key R&D Program (Grant No.20233067)。
文摘Computer-generated holography technology has been widely applied,and as research in this field deepens,the demand for memory and computational power in small AR and VR devices continues to increase.This paper presents a hologram generation method,i.e.,a symmetrically high-compressed look-up table method,which can reduce memory usage by50%.In offline computing,half of the basic horizontal and vertical modulation factors are stored,halving the memory requirements without affecting inline speed.Currently,its potential extends to various holographic applications,including the production of optical diffraction elements.
基金the National Natural Science Foundation of China(Grant No.41875040)the Top-notch Talents Program in Universities of Anhui Province,China(Grant No.gxbjZD2020067)the Natural Science Research Projects of Universities in Anhui Province,China(Grant No.KJ2020A0029).
文摘Obtaining the vertical distribution profile of trace gas is of great significance for studying the diffusion procedure of air pollution.In this article,a look-up table method based on multi-axis differential optical absorption spectroscopy(MAX-DOAS)technology is established for retrieving the tropospheric NO_(2) vertical distribution profiles.This method retrieves the aerosol extinction profiles with minimum cost function.Then,the aerosol extinction profiles and the atmospheric radiation transfer model(RTM)are employed to establish the look-up table for retrieving the NO_(2) vertical column densities(VCDs)and profiles.The measured NO_(2) differential slant column densities(DSCDs)are compared with the NO_(2) DSCDs simulated by the atmospheric RTM,and the NO_(2) VCDs,the weight factor of NO_(2) in the boundary layer,and the boundary layer height are obtained by the minimization process.The look-up table is established to retrieve NO_(2) VCDs based on MAX-DOAS measurements in Huaibei area,and the results are compared with the data from Copernicus Atmospheric Monitoring Service(CAMS)model.It is found that there are nearly consistent and the correlation coefficient R2 is more than 0.86.The results show that this technology provides a more convenient and accurate retrieval method for the stereoscopic monitoring of atmospheric environment.
基金The Academic Colleges and Universities Innovation Program 2.0(No.BP0719013)。
文摘To solve the hardware deployment problem caused by the vast demanding computational complexity of convolutional layers and limited hardware resources for the hardware network inference,a look-up table(LUT)-based convolution architecture built on a field-programmable gate array using integer multipliers and addition trees is used.With the help of the Winograd algorithm,the optimization of convolution and multiplication is realized to reduce the computational complexity.The LUT-based operator is further optimized to construct a processing unit(PE).Simultaneously optimized storage streams improve memory access efficiency and solve bandwidth constraints.The data toggle rate is reduced to optimize power consumption.The experimental results show that the use of the Winograd algorithm to build basic processing units can significantly reduce the number of multipliers and achieve hardware deployment acceleration,while the time-division multiplexing of processing units improves resource utilization.Under this experimental condition,compared with the traditional convolution method,the architecture optimizes computing resources by 2.25 times and improves the peak throughput by 19.3 times.The LUT-based Winograd accelerator can effectively solve the deployment problem caused by limited hardware resources.
文摘Shaking tables with moving platforms are widely used in laboratory testing of structural models and full-sized devices. In most cases, the platform＇s movement should reproduce real ground acceleration records. However, the stroke of the platform, required for reproduction of real records, is usually rather large. This limitation does not allow an accurate realization of the ground motion by the shaking table. Commonly, in order to overcome this problem, original records are modified, which causes a significant change in the acceleration records＇ spectra. That is why structural responses to the original and to the modified records are different. A new method for modification of original acceleration records is proposed, in which the original record is corrected by an additional artificial one that changes the shaking platform＇s displacement. The corrected record is obtained as a sequence of impulses, The magnitude and duration of each impulse, as well as their location on the time scale, are obtained by an optimization procedure. The optimization is implemented according to a performance index, aimed to minimize the influence of the correcting acceleration record on the specmam of the original one. The proposed method has higher reproduction accuracy, compared to other known methods. Its effectiveness is demonstrated by comparison of response spectra and dynamic behaviors of three multi-story structures subjected to natural and modified seismic excitations.
基金the National Natural Science Foundation of China (No. 79870030).
文摘As far as the weighted digraph is considered, an optimal directed spanning tree algorithm called table based algorithm (TBA) is proposed in the paper based on the table instead of the weighted digraph. The optimality is proved, and a numerical example is demonstrated.
基金supported by Commission of Science Technology and Industry for National Defence of China under Grant No.A1420061264National Natural Science Foundation of China under Grant No.60934002General Armament Department under Grand No.51317040102)
文摘Test points selection for integer-coded fault wise table is a discrete optimization problem. The global minimum set of test points can only be guaranteed by an exhaustive search which is eompurationally expensive. In this paper, this problem is formulated as a heuristic depth-first graph search problem at first. The graph node expanding method and rules are given. Then, rollout strategies are applied, which can be combined with the heuristic graph search algorithms, in a computationally more efficient manner than the optimal strategies, to obtain solutions superior to those using the greedy heuristic algorithms. The proposed rollout-based test points selection algorithm is illustrated and tested using an analog circuit and a set of simulated integer-coded fault wise tables. Computa- tional results are shown, which suggest that the rollout strategy policies are significantly better than other strategies.
基金Supported by the Key Research and Development Project of Yangzhou--Industry Preview and Key Projects(No.YZ2015011)
文摘In order to meet the polishing requirement of faucets and other products,a novel multi-station rotary polishing robot is designed,which is a PPPR + RR type of degree of freedom( DOF) distribution structure,and is similar to dual-arm robot. Forward and inverse kinematic analysis is carried out by robot modeling. In order to make this robot structure more compact,first of all,X,Y and Z three moving degrees of freedom( DOF) limit stroke polishing need is calculated by using an artificial fish swarm algorithm,which analyzes dexterous workspace of this robot. Then,on the basis of the above analysis,the three DOF stroke is optimized. Simulation and polishing experimental results verify that this polishing robot with optimized stroke parameters can meet the polishing needs of faucets and other bathroom pieces.
基金supported by National Natural Science Foundation of China under Grant No.60934002General Armament Department under Grant No.51317040102
文摘Test points selection for integer-coded fault wise table is a discrete optimization problem. On one hand, traditional exhaustive search method is computationally expensive. On the other hand, the space complexity of traditional exhaustive is low. A tradeoff method between the high time complexity and low space complexity is proposed. At first, a new fault-pair table is constructed based on the integer-coded fault wise table. The fault-pair table consists of two columns： one column represents fault pair and the other represents test points set that can distinguish the corresponding faults. Then, the rows are arranged in ascending order according to the cardinality of corresponding test points set. Thirdly, test points in the top rows are selected one by one until all fault pair are isolated. During the test points selection process, the rows that contain selected test points are deleted and then the dimension of fault-pair table decreases gradually. The proposed test points selection algorithm is illustrated and tested using an integercoded fault wise table derived from a real analog circuit. Computational results suggest show policies are better than the exhaustive strategy.
文摘The goal of railway rolling stock maintenance and replacement approaches is to reduce overall cost while increasing reliability which is multi objective op</span><span style="font-family:Verdana;">timization problem and a proper predictive maintenance scheduling table sh</span><span style="font-family:Verdana;">ould be adequately designed. We propose Breeding Particle Swarm Optimization (BPSO) model based on the concepts of Breeding Swarm and Genetic Algor</span><span style="font-family:Verdana;">ithm (GA) operators to design this table. The practical experiment shows th</span><span style="font-family:Verdana;">at our model reduces cost while increasing reliability compared to other models previously utilized.
文摘Dynamic programming(DP) is an effective query optimization approach to select an appropriate join order for relational database management system(RDBMS) in multi-table joins. This method was extended and made available in distributed DBMS(D-DBMS). The structure of this optimal solution was firstly characterized according to the distributing status of tables and data, and then the recurrence relations between a problem and its sub-problems were recursively defined. DP in D-DBMS has the same time-complexity with that in centralized DBMS, while it has the capability to solve a much more sophisticated optimal problem of multi-table join in D-DBMS. The effectiveness of this optimal strategy has been proved by experiments.
文摘One of the primary risk factors at junctions on urban roads is vehicle speed.To curb over-speeding and road crashes at intersections,traffic calming measures are introduced.Current research aims at studying the impact of different geometries of recently constructed speed tables on the operational speed over such intersections.Since these treatments have been widely used to regulate speed in other countries,evaluating their efficacy in the Indian context was required.This study utilises 6000 vehicle samples of four different vehicle classes(two-wheeler,three-wheeler,cars,and buses)from 12 speed tables in total.The speed and acceleration kinematics in addition to the high-quality trajectory data over long road segments were extracted from the video recordings of an unmanned aerial vehicle(UAV).Multi-factor response surface methodology(RSM)was utilized to optimize the geometric parameters(variables)of the speed tables to achieve the requisite operational speed(predictor)at the considered measure.The box plots are provided to indicate descriptives of the parameters regarding the 85th percentile speed.Multiple linear regression and analysis-of-variance(ANOVA)identified the variables that were significant and fit to devise the required optimization model.This study can help in identifying the influence zone,concerning physical characteristics of speed tables and their effect on the design speed at the approaches of intersections at urban arterials.The outcomes of the study will cater to enhance the current guidelines and standards in India regarding speed table geometry for urban road sections.
