This study examined spatial variations in the concentration,grain size and heavy mineral assemblages on Cedar Beach(Lake Erie,Canada).Magnetic studies of heavy mineral-enriched,dark-reddish sands present on the beac...This study examined spatial variations in the concentration,grain size and heavy mineral assemblages on Cedar Beach(Lake Erie,Canada).Magnetic studies of heavy mineral-enriched,dark-reddish sands present on the beach showed that magnetite(~150μm) is the dominant magnetic mineral.Surficial magnetic susceptibility values defined three zones:a lakeward region close to the water line(Zone 1),the upper swash zone(Zone 2) and the region landwards of the upper swash zone (Zone 3).Zone 2 showed the highest bulk and mass susceptibility(κ,χ) and the highest mass percentage of smaller grain-size(250μm) fractions in the bulk sand sample.Susceptibility(i.e.κandχ) values decreased and grain size coarsened from Zone 2 lakewards(into Zone 1) and landwards (into Zone 3),and correlated with the distribution of the heavy mineral assemblage,most probably reflecting preferential separation of large,less dense particles by waves and currents both along and across the beach.The eroded western section of Cedar Beach showed much higher concentrations of heavy minerals including magnetite,and finer sand grain sizes than the accreting eastern section, suggesting that magnetic techniques could be used as a rapid,cost-effective way of examining erosion along sensitive coastline areas.展开更多
Genome-scale data,while promising for illuminating phylogenetic relationships,frequently pose a conundrum by yielding conflicting topologies and highly variable gene tree distributions(Pease et al.,2016).This complexi...Genome-scale data,while promising for illuminating phylogenetic relationships,frequently pose a conundrum by yielding conflicting topologies and highly variable gene tree distributions(Pease et al.,2016).This complexity likely arises from the reticulate evolution observed in many taxa,where genetic information exchange occurs through diverse biological processes.展开更多
Multi-objective optimization of a purified terephthalic acid (PTA) oxidation unit is carried out in this paper by using a process modei that has been proved to describe industrial process quite well. The modei is a se...Multi-objective optimization of a purified terephthalic acid (PTA) oxidation unit is carried out in this paper by using a process modei that has been proved to describe industrial process quite well. The modei is a semi-empirical structured into two series ideal continuously stirred tank reactor (CSTR) models. The optimal objectives include maximizing the yield or inlet rate and minimizing the concentration of 4-carboxy-benzaldhyde, which is the main undesirable intermediate product in the reaction process. The multi-objective optimization algorithra applied in this study is non-dominated sorting genetic algorithm Ⅱ (NSGA-Ⅱ). The performance of NSGA-Ⅱ is further illustrated by application to the title process.展开更多
The successful confinement of the arc by the flux band depends on the welding process parameters for achieving single-pass,multi-layer, and ultra-narrow gap welding. The sidewall fusion depth, the width of the heat-af...The successful confinement of the arc by the flux band depends on the welding process parameters for achieving single-pass,multi-layer, and ultra-narrow gap welding. The sidewall fusion depth, the width of the heat-affected zone, and the line energy are utilized as comprehensive indications of the quality of the welded joint. In order to achieve well fusion and reduce the heat input to the base metal.Three welding process characteristics were chosen as the primary determinants, including welding voltage, welding speed, and wire feeding speed. The metamodel of the welding quality index was built by the orthogonal experiments. The metamodel and NSGA-Ⅱ(Non-dominated sorting genetic algorithm Ⅱ) were combined to develop a multi-objective optimization model of ultra-narrow gap welding process parameters. The results showed that the optimized welding process parameters can increase the sidewall fusion depth, reduce the width of the heataffected zone and the line energy, and to some extent improve the overall quality of the ultra-narrow gap welding process.展开更多
Proteolytic processing of the transmembrane amyloid precursor protein (APP) to aggregation-prone amyloid-β (Aβ) peptide underlies the development of Alzheimer’s disease.
Steady-state non-dominated sorting genetic algorithm (SNSGA), a new form of multi-objective genetic algorithm, is implemented by combining the steady-state idea in steady-state genetic algorithms (SSGA) and the fitnes...Steady-state non-dominated sorting genetic algorithm (SNSGA), a new form of multi-objective genetic algorithm, is implemented by combining the steady-state idea in steady-state genetic algorithms (SSGA) and the fitness assignment strategy of non-dominated sorting genetic algorithm (NSGA). The fitness assignment strategy is improved and a new self-adjustment scheme of is proposed. This algorithm is proved to be very efficient both computationally and in terms of the quality of the Pareto fronts produced with five test problems including GA difficult problem and GA deceptive one. Finally, SNSGA is introduced to solve multi-objective mixed integer linear programming (MILP) and mixed integer non-linear programming (MINLP) problems in process synthesis.展开更多
Based on the analysis of fault diagnosis knowledge of letter sorting machine, this paper proposes a processing method by which the fault diagnosis knowledge is divided into exact knowledge, inadequate knowledge and fu...Based on the analysis of fault diagnosis knowledge of letter sorting machine, this paper proposes a processing method by which the fault diagnosis knowledge is divided into exact knowledge, inadequate knowledge and fuzzy knowledge. Then their presenting and implementing form in fault diagnosis expert system is discussed and studied. It is proved that the expert system has good feasibility in the field of the diagnosis of letter sorting machine.展开更多
Ak-bitonic sort which generalizes the bitonic sort is proposed. The theorem of the bitonic sort, which merges two monotonic sequences into one order sequence, is extended into the theorem ofk-bitonic sort. Thek-bitoni...Ak-bitonic sort which generalizes the bitonic sort is proposed. The theorem of the bitonic sort, which merges two monotonic sequences into one order sequence, is extended into the theorem ofk-bitonic sort. Thek-bitonic sort merges (K (=2k or 2k?1) monotonic sequences into one order sequence in $\left\lceil {log_2 K} \right\rceil \left\lceil {log_2 N} \right\rceil - \tfrac{{\left\lceil {log_2 K} \right\rceil (\left\lceil {log_2 K} \right\rceil - 1)}}{2}$ steps, where $k = \left\lceil {\tfrac{K}{2}} \right\rceil $ is an integer andk≥1. Thek-bitonic sort is the Batcher's bitonic sort whenk=1.展开更多
A unilied vector sorting algorithm (VSA) is proposed, which sorts N arbitrary num-bers with clog. N-bits on an SIMD multi-processor system (SMMP) with processors and a composite interconnected network in time, where c...A unilied vector sorting algorithm (VSA) is proposed, which sorts N arbitrary num-bers with clog. N-bits on an SIMD multi-processor system (SMMP) with processors and a composite interconnected network in time, where c is an arbitrary positive constant. When is an arbitrary small posi-tive constant and u = log2 N, it is an O(logN) algorithm and when it is an optimal algorithm,pT = O(N log N)); where u = 1, c = 1 and e = 0.5 (a constant).展开更多
Due to sensor malfunctions and communication faults,multiple missing patterns frequently happen in wastewater treatment process(WWTP).Nevertheless,the existing missing data imputation works cannot stand multiple missi...Due to sensor malfunctions and communication faults,multiple missing patterns frequently happen in wastewater treatment process(WWTP).Nevertheless,the existing missing data imputation works cannot stand multiple missing patterns because they have not sufficiently utilized of data information.In this article,a double-cycle weighted imputation(DCWI)method is proposed to deal with multiple missing patterns by maximizing the utilization of the available information in variables and instances.The proposed DCWI is comprised of two components:a double-cycle-based imputation sorting and a weighted K nearest neighbor-based imputation estimator.First,the double-cycle mechanism,associated with missing variable sorting and missing instance sorting,is applied to direct the missing values imputation.Second,the weighted K nearest neighbor-based imputation estimator is used to acquire the global similar instances and capture the volatility in the local region.The estimator preserves the original data characteristics as much as possible and enhances the imputation accuracy.Finally,experimental results on simulated and real WWTP datasets with non-stationarity and nonlinearity demonstrate that the proposed DCWI produces more accurate imputation results than comparison methods under different missing patterns and missing ratios.展开更多
Accurate and fast detection of abnormal hydroponic lettuce leaves is primary technology for robotic sorting.Yellow and rotten leaves are main types of abnormal leaves in hydroponic lettuce.This study aims to demonstra...Accurate and fast detection of abnormal hydroponic lettuce leaves is primary technology for robotic sorting.Yellow and rotten leaves are main types of abnormal leaves in hydroponic lettuce.This study aims to demonstrate a feasibility of detecting yellow and rotten leaves of hydroponic lettuce by machine learning models,i.e.Multiple Linear Regression(MLR),K-Nearest Neighbor(KNN),and Support Vector Machine(SVM).One-way analysis of variance was applied to reduce RGB,HSV,and L*a*b*features number of hydroponic lettuce images.Image binarization,image mask,and image filling methods were employed to segment hydroponic lettuce from an image for models testing.Results showed that G,H,and a*were selected from RGB,HSV,and L*a*b*for training models.It took about 20.25 s to detect an image with 30244032 pixels by KNN,which was much longer than MLR(0.61 s)and SVM(1.98 s).MLR got detection accuracies of 89.48%and 99.29%for yellow and rotten leaves,respectively,while SVM reached 98.33%and 97.91%,respectively.SVM was more robust than MLR in detecting yellow and rotten leaves of hydroponic.Thus,it was possible for abnormal hydroponic lettuce leaves detection by machine learning methods.展开更多
The uniformity of appearance attributes of bell peppers is significant for consumers and food industries.To automate the sorting process of bell peppers and improve the packaging quality of this crop by detecting and ...The uniformity of appearance attributes of bell peppers is significant for consumers and food industries.To automate the sorting process of bell peppers and improve the packaging quality of this crop by detecting and separating the not likable low-color bell peppers,developing an appropriate sorting system would be of high importance and influence.According to standards and export needs,the bell pepper should be graded based on maturity levels and size to five classes.This research has been aimed to develop a machine vision-based system equipped with an intelligent modelling approach for in-line sorting bell peppers into desirable and undesirable samples,with the ability to predict the maturity level and the size of the desirable bell peppers.Multilayer perceptron(MLP)artificial neural networks(ANNs)as the nonlinear modelswere designed for that purpose.TheMLP modelswere trained and evaluated through five-fold cross-validation method.The optimum MLP classifier was compared with a linear discriminant analysis(LDA)model.The results showed that the MLP outperforms the LDA model.The processing time to classify each captured image was estimated as 0.2 s/sample,which is fast enough for in-line application.Accordingly,the optimum MLP model was integrated with a machine vision-based sorting machine,and the developed system was evaluated in the in-line phase.The performance parameters,including accuracy,precision,sensitivity,and specificity,were 93.2%,86.4%,84%,and 95.7%,respectively.The total sorting rate of the bell pepper was also measured as approximately 3000 samples/h.展开更多
Most traditional merging and merging-based sorting algorithms are based on 2 sorters or 2 comparators A new merging technique is developed, namely sloping-and-shaking multiway merging, and a corresponding mul-tiway so...Most traditional merging and merging-based sorting algorithms are based on 2 sorters or 2 comparators A new merging technique is developed, namely sloping-and-shaking multiway merging, and a corresponding mul-tiway sorting method based only on k-sorters is proposed The sloping-and-shaking merging algorithm merges k sorted lists into one, where k can be any prime number The merging process is not a series of recursive applications of 2-way morging It sorts the keys on the m × k plane in vertical and horizontal directions, then along sloping lines with various slope rates step by step Only k-sorters are needed in the merging or sorting process. The time needed to merge ksorted lists, with m of each, is ( k + [log2( m / k) ]) tk, and the time for sorting N keys is (1 + (p - 1) k + 1/2( p -1) (p - 2)[ log2k])tk, where p - logkN, and tk is the time to sort k keys. The proposed algorithms can be implemented either by hardwared sorting networks, or on general purpose parallel and vector machines The traditional odd-even merging can be viewed as a special case of the multiway merging proposed (when k is 2) While theoretically the proposed algorithms provide a new understanding of parallel merging and sorting processes, they may be used in prac-tice to construct sorting circuits fasler than 2-sorter based sorting methods.展开更多
基金supported by funding from the 111 Project B07011 of Ministry of Education of China,the China Scholarship Council(CSC) to SWZ (NCIS No.2007103928)an NSERC grant to MTC. D.Chevalier is thanked for her help in sampling. Laboratory assistance was provided bv K.Kawasaki and S.Joshi
文摘This study examined spatial variations in the concentration,grain size and heavy mineral assemblages on Cedar Beach(Lake Erie,Canada).Magnetic studies of heavy mineral-enriched,dark-reddish sands present on the beach showed that magnetite(~150μm) is the dominant magnetic mineral.Surficial magnetic susceptibility values defined three zones:a lakeward region close to the water line(Zone 1),the upper swash zone(Zone 2) and the region landwards of the upper swash zone (Zone 3).Zone 2 showed the highest bulk and mass susceptibility(κ,χ) and the highest mass percentage of smaller grain-size(250μm) fractions in the bulk sand sample.Susceptibility(i.e.κandχ) values decreased and grain size coarsened from Zone 2 lakewards(into Zone 1) and landwards (into Zone 3),and correlated with the distribution of the heavy mineral assemblage,most probably reflecting preferential separation of large,less dense particles by waves and currents both along and across the beach.The eroded western section of Cedar Beach showed much higher concentrations of heavy minerals including magnetite,and finer sand grain sizes than the accreting eastern section, suggesting that magnetic techniques could be used as a rapid,cost-effective way of examining erosion along sensitive coastline areas.
基金supported by the National Natural Science Foundation of China (grant no.32001085,31971392,31960319)。
文摘Genome-scale data,while promising for illuminating phylogenetic relationships,frequently pose a conundrum by yielding conflicting topologies and highly variable gene tree distributions(Pease et al.,2016).This complexity likely arises from the reticulate evolution observed in many taxa,where genetic information exchange occurs through diverse biological processes.
基金National Key Technologies Research and Development Program in the 10th Five-year Phan(No.2001BA204B01)National Outstanding Youth Science Foundation of China(No.60025308)
文摘Multi-objective optimization of a purified terephthalic acid (PTA) oxidation unit is carried out in this paper by using a process modei that has been proved to describe industrial process quite well. The modei is a semi-empirical structured into two series ideal continuously stirred tank reactor (CSTR) models. The optimal objectives include maximizing the yield or inlet rate and minimizing the concentration of 4-carboxy-benzaldhyde, which is the main undesirable intermediate product in the reaction process. The multi-objective optimization algorithra applied in this study is non-dominated sorting genetic algorithm Ⅱ (NSGA-Ⅱ). The performance of NSGA-Ⅱ is further illustrated by application to the title process.
基金Project was supported by National Natural Science Foundation of China(Grant No.62173170).
文摘The successful confinement of the arc by the flux band depends on the welding process parameters for achieving single-pass,multi-layer, and ultra-narrow gap welding. The sidewall fusion depth, the width of the heat-affected zone, and the line energy are utilized as comprehensive indications of the quality of the welded joint. In order to achieve well fusion and reduce the heat input to the base metal.Three welding process characteristics were chosen as the primary determinants, including welding voltage, welding speed, and wire feeding speed. The metamodel of the welding quality index was built by the orthogonal experiments. The metamodel and NSGA-Ⅱ(Non-dominated sorting genetic algorithm Ⅱ) were combined to develop a multi-objective optimization model of ultra-narrow gap welding process parameters. The results showed that the optimized welding process parameters can increase the sidewall fusion depth, reduce the width of the heataffected zone and the line energy, and to some extent improve the overall quality of the ultra-narrow gap welding process.
文摘Proteolytic processing of the transmembrane amyloid precursor protein (APP) to aggregation-prone amyloid-β (Aβ) peptide underlies the development of Alzheimer’s disease.
文摘Steady-state non-dominated sorting genetic algorithm (SNSGA), a new form of multi-objective genetic algorithm, is implemented by combining the steady-state idea in steady-state genetic algorithms (SSGA) and the fitness assignment strategy of non-dominated sorting genetic algorithm (NSGA). The fitness assignment strategy is improved and a new self-adjustment scheme of is proposed. This algorithm is proved to be very efficient both computationally and in terms of the quality of the Pareto fronts produced with five test problems including GA difficult problem and GA deceptive one. Finally, SNSGA is introduced to solve multi-objective mixed integer linear programming (MILP) and mixed integer non-linear programming (MINLP) problems in process synthesis.
文摘Based on the analysis of fault diagnosis knowledge of letter sorting machine, this paper proposes a processing method by which the fault diagnosis knowledge is divided into exact knowledge, inadequate knowledge and fuzzy knowledge. Then their presenting and implementing form in fault diagnosis expert system is discussed and studied. It is proved that the expert system has good feasibility in the field of the diagnosis of letter sorting machine.
基金Project supported by the National 863 Foundation of China (863-306-05-01-1) and the National Natural Science Foundation of China (Grant No. 69673037).
文摘Ak-bitonic sort which generalizes the bitonic sort is proposed. The theorem of the bitonic sort, which merges two monotonic sequences into one order sequence, is extended into the theorem ofk-bitonic sort. Thek-bitonic sort merges (K (=2k or 2k?1) monotonic sequences into one order sequence in $\left\lceil {log_2 K} \right\rceil \left\lceil {log_2 N} \right\rceil - \tfrac{{\left\lceil {log_2 K} \right\rceil (\left\lceil {log_2 K} \right\rceil - 1)}}{2}$ steps, where $k = \left\lceil {\tfrac{K}{2}} \right\rceil $ is an integer andk≥1. Thek-bitonic sort is the Batcher's bitonic sort whenk=1.
文摘A unilied vector sorting algorithm (VSA) is proposed, which sorts N arbitrary num-bers with clog. N-bits on an SIMD multi-processor system (SMMP) with processors and a composite interconnected network in time, where c is an arbitrary positive constant. When is an arbitrary small posi-tive constant and u = log2 N, it is an O(logN) algorithm and when it is an optimal algorithm,pT = O(N log N)); where u = 1, c = 1 and e = 0.5 (a constant).
基金supported by the National Key Research and Development Project(Grant No.2018YFC1900800-5)the National Natural Science Foundation of China(Grant Nos.61890930-5,61903010,62021003 and 62125301)+1 种基金Beijing Natural Science Foundation(Grant No.KZ202110005009)Beijing Outstanding Young Scientist Program(Grant No.BJJWZYJH 01201910005020)。
文摘Due to sensor malfunctions and communication faults,multiple missing patterns frequently happen in wastewater treatment process(WWTP).Nevertheless,the existing missing data imputation works cannot stand multiple missing patterns because they have not sufficiently utilized of data information.In this article,a double-cycle weighted imputation(DCWI)method is proposed to deal with multiple missing patterns by maximizing the utilization of the available information in variables and instances.The proposed DCWI is comprised of two components:a double-cycle-based imputation sorting and a weighted K nearest neighbor-based imputation estimator.First,the double-cycle mechanism,associated with missing variable sorting and missing instance sorting,is applied to direct the missing values imputation.Second,the weighted K nearest neighbor-based imputation estimator is used to acquire the global similar instances and capture the volatility in the local region.The estimator preserves the original data characteristics as much as possible and enhances the imputation accuracy.Finally,experimental results on simulated and real WWTP datasets with non-stationarity and nonlinearity demonstrate that the proposed DCWI produces more accurate imputation results than comparison methods under different missing patterns and missing ratios.
基金the Science and Technology Program in Yulin City of China(CXY-2020-076,CXY-2019-129)Youth Science and Technology Nova Program in Shaanxi Province of China(2021KJXX-94)+1 种基金Key Research and Development Program of Shaanxi(2021NY-135)Recruitment Program of High-End Foreign Experts of the State Administration of Foreign Experts Affairs,Ministry of Science and Technology,China(G20200027075)。
文摘Accurate and fast detection of abnormal hydroponic lettuce leaves is primary technology for robotic sorting.Yellow and rotten leaves are main types of abnormal leaves in hydroponic lettuce.This study aims to demonstrate a feasibility of detecting yellow and rotten leaves of hydroponic lettuce by machine learning models,i.e.Multiple Linear Regression(MLR),K-Nearest Neighbor(KNN),and Support Vector Machine(SVM).One-way analysis of variance was applied to reduce RGB,HSV,and L*a*b*features number of hydroponic lettuce images.Image binarization,image mask,and image filling methods were employed to segment hydroponic lettuce from an image for models testing.Results showed that G,H,and a*were selected from RGB,HSV,and L*a*b*for training models.It took about 20.25 s to detect an image with 30244032 pixels by KNN,which was much longer than MLR(0.61 s)and SVM(1.98 s).MLR got detection accuracies of 89.48%and 99.29%for yellow and rotten leaves,respectively,while SVM reached 98.33%and 97.91%,respectively.SVM was more robust than MLR in detecting yellow and rotten leaves of hydroponic.Thus,it was possible for abnormal hydroponic lettuce leaves detection by machine learning methods.
文摘The uniformity of appearance attributes of bell peppers is significant for consumers and food industries.To automate the sorting process of bell peppers and improve the packaging quality of this crop by detecting and separating the not likable low-color bell peppers,developing an appropriate sorting system would be of high importance and influence.According to standards and export needs,the bell pepper should be graded based on maturity levels and size to five classes.This research has been aimed to develop a machine vision-based system equipped with an intelligent modelling approach for in-line sorting bell peppers into desirable and undesirable samples,with the ability to predict the maturity level and the size of the desirable bell peppers.Multilayer perceptron(MLP)artificial neural networks(ANNs)as the nonlinear modelswere designed for that purpose.TheMLP modelswere trained and evaluated through five-fold cross-validation method.The optimum MLP classifier was compared with a linear discriminant analysis(LDA)model.The results showed that the MLP outperforms the LDA model.The processing time to classify each captured image was estimated as 0.2 s/sample,which is fast enough for in-line application.Accordingly,the optimum MLP model was integrated with a machine vision-based sorting machine,and the developed system was evaluated in the in-line phase.The performance parameters,including accuracy,precision,sensitivity,and specificity,were 93.2%,86.4%,84%,and 95.7%,respectively.The total sorting rate of the bell pepper was also measured as approximately 3000 samples/h.
基金Project supported by the National "863"High-Tech Program of China and the National Natural Science Foundation of China.
文摘Most traditional merging and merging-based sorting algorithms are based on 2 sorters or 2 comparators A new merging technique is developed, namely sloping-and-shaking multiway merging, and a corresponding mul-tiway sorting method based only on k-sorters is proposed The sloping-and-shaking merging algorithm merges k sorted lists into one, where k can be any prime number The merging process is not a series of recursive applications of 2-way morging It sorts the keys on the m × k plane in vertical and horizontal directions, then along sloping lines with various slope rates step by step Only k-sorters are needed in the merging or sorting process. The time needed to merge ksorted lists, with m of each, is ( k + [log2( m / k) ]) tk, and the time for sorting N keys is (1 + (p - 1) k + 1/2( p -1) (p - 2)[ log2k])tk, where p - logkN, and tk is the time to sort k keys. The proposed algorithms can be implemented either by hardwared sorting networks, or on general purpose parallel and vector machines The traditional odd-even merging can be viewed as a special case of the multiway merging proposed (when k is 2) While theoretically the proposed algorithms provide a new understanding of parallel merging and sorting processes, they may be used in prac-tice to construct sorting circuits fasler than 2-sorter based sorting methods.