As one of the commonly used queries in modern databases, skyline query has received extensive attention from database research community. The uncertainty of the data in wireless sensor networks makes the corresponding...As one of the commonly used queries in modern databases, skyline query has received extensive attention from database research community. The uncertainty of the data in wireless sensor networks makes the corresponding skyline uncertain and not unique. This paper investigates the Pr-Skyline problem, i.e., how to compute the skyline with the highest existence probability in a computational and energy-efficient way. We formulate the problem and prove that it is NP-Complete and cannot be approximated in a given expression. However, the proposed algorithm SKY-SEARCH with pruning techniques can guarantee the computational efficiency given relatively large input size, while the filter-based distributed optimization strategy significantly reduces the transmission cost and the required storage space of the sensor nodes. Extensive experiments verify the efficiency and scalability of SKY-SEARCH and the distributed optimizing strategy.展开更多
A defining characteristic of continuous queries over on-line data streams,possibly bounded by sliding windows,is the potentially infinite and time-evolving nature of their inputs and outputs.For different update patte...A defining characteristic of continuous queries over on-line data streams,possibly bounded by sliding windows,is the potentially infinite and time-evolving nature of their inputs and outputs.For different update patterns of continuous queries,suitable data structures bring great query processing efficiency.In this paper,we proposed a data structure suitable for weak nonmonotonic update pattern in which the lifetime of each tuple is known at generation time,but the length of lifetime is not necessarily the same.The new data structure combined the ladder queue with the feature of weak non-monotonic update pattern.The experiment results show that the new data structure performs much better than the traditional calendar queue in many cases.展开更多
Recently, new techniques to efficiently manage current and past location information of moving objects have received significant interests in the area of moving object databases and location based service systems. In ...Recently, new techniques to efficiently manage current and past location information of moving objects have received significant interests in the area of moving object databases and location based service systems. In this paper, we exploit query processing schemes for location management systems, which consist of multiple data processing nodes to handle massive volume of moving objects such as cellular phone users. To show the usefulness of the proposed schemes, some experimental results showing performance factors regarding distributed query processing are explained. In our experiments, we use two kinds of data set: one is generated by the extended GSTD simulator and another is generated by the real time data generator which generates location sensing reports of various types of users having different movement patterns.展开更多
Recently, attention has been focused on spatial query language which is used to query spatial databases. A design of spatial query language has been presented in this paper by extending the standard relational databas...Recently, attention has been focused on spatial query language which is used to query spatial databases. A design of spatial query language has been presented in this paper by extending the standard relational database query language SQL. It recognizes the significantly different requirements of spatial data handling and overcomes the inherent problems of the application of conventional database query languages. This design is based on an extended spatial data model, including the spatial data types and the spatial operators on them. The processing and optimization of spatial queries have also been discussed in this design. In the end, an implementation of this design is given in a spatial query subsystem.展开更多
With its untameable and traceable properties,blockchain technology has been widely used in the field of data sharing.How to preserve individual privacy while enabling efficient data queries is one of the primary issue...With its untameable and traceable properties,blockchain technology has been widely used in the field of data sharing.How to preserve individual privacy while enabling efficient data queries is one of the primary issues with secure data sharing.In this paper,we study verifiable keyword frequency(KF)queries with local differential privacy in blockchain.Both the numerical and the keyword attributes are present in data objects;the latter are sensitive and require privacy protection.However,prior studies in blockchain have the problem of trilemma in privacy protection and are unable to handle KF queries.We propose an efficient framework that protects data owners’privacy on keyword attributes while enabling quick and verifiable query processing for KF queries.The framework computes an estimate of a keyword’s frequency and is efficient in query time and verification object(VO)size.A utility-optimized local differential privacy technique is used for privacy protection.The data owner adds noise locally into data based on local differential privacy so that the attacker cannot infer the owner of the keywords while keeping the difference in the probability distribution of the KF within the privacy budget.We propose the VB-cm tree as the authenticated data structure(ADS).The VB-cm tree combines the Verkle tree and the Count-Min sketch(CM-sketch)to lower the VO size and query time.The VB-cm tree uses the vector commitment to verify the query results.The fixed-size CM-sketch,which summarizes the frequency of multiple keywords,is used to estimate the KF via hashing operations.We conduct an extensive evaluation of the proposed framework.The experimental results show that compared to theMerkle B+tree,the query time is reduced by 52.38%,and the VO size is reduced by more than one order of magnitude.展开更多
The sensory perception of food is a dynamic process,which is closely related to the release of flavor substances during oral processing.It’s not only affected by the food material,but also subjected to the individual...The sensory perception of food is a dynamic process,which is closely related to the release of flavor substances during oral processing.It’s not only affected by the food material,but also subjected to the individual oral environment.To explore the oral processing characteristics of soft-boiled chicken,the sensory properties,texture,particle size,viscosity,characteristic values of electronic nose and tongue of different chicken samples were investigated.The correlation analysis showed that the physical characteristics especially the cohesiveness,springiness,resilience of the sample determined oral processing behavior.The addition of chicken skin played a role in lubrication during oral processing.The particle size of the bolus was heightened at the early stage,and the fluidity was enhanced in the end,which reduced the chewing time to the swallowing point and raised the aromatic compounds signal of electronic nose.But the effect of chicken skin on chicken thigh with relatively high fat content,was opposite in electronic nose,which had a certain masking effect on the perception of umami and sweet taste.In conclusion,fat played a critical role in chicken oral processing and chicken thigh had obvious advantages in comprehensive evaluation of soft-boiled chicken,which was more popular among people.展开更多
[Objectives]To compare the effects of traditional processing and fresh processing on the quality of Polygonatum odoratum decoction piece.[Methods]The effects of fresh processing and traditional processing on the quali...[Objectives]To compare the effects of traditional processing and fresh processing on the quality of Polygonatum odoratum decoction piece.[Methods]The effects of fresh processing and traditional processing on the quality of P.odoratum decoction piece were compared and analyzed with appearance characteristics,total ash content,extract content,total polysaccharides content,and total flavonoids content as the evaluation indexes.[Results]Fresh processing method in different production areas has different effects on P.odoratum decoction piece.P.odoratum was dried in oven of 50℃.When moisture content was 41.44%-59.67%,it was cut.After complete drying at 50℃,the moisture content of dried P.odoratum was 8.94%-9.60%,and ethanol-soluble extract content was 77.29%-78.20%,and water-soluble extract was 77.7%-78.14%.At this time,the appearance characteristics of section of P.odoratum decoction piece were better than that of traditional processing,which was yellowish white.The total polysaccharide content was higher than that of traditional processing,and the content of total flavonoids was statistically significant different from that of traditional processing.[Conclusions]The quality of P.odoratum decoction piece by fresh processing is better than that of the traditional processing,and it is feasible to use fresh processing.展开更多
Nowadays,magnesium alloys are emerging in biomedical implants for their similar properties to natural bones.However,the rapid degradation of magnesium alloys in biological media hinders successful implantation.Refinem...Nowadays,magnesium alloys are emerging in biomedical implants for their similar properties to natural bones.However,the rapid degradation of magnesium alloys in biological media hinders successful implantation.Refinement of microstructure,as well as reinforcement particles can significantly improve the degradation rate.In this work,multi-pass friction stir processing(FSP)was proposed to synthesize WE43/nano-hydroxyapatite(n HA)surface composite,the microstructure,reinforced particle distribution,micro-hardness,corrosion behavior and in-vitro bioactivity were studied.The subsequent FSP passes of WE43 alloy and WE43/n HA composite refined the grain size which was reduced by 94.29%and 95.92%(2.63 and 1.88μm,respectively)compared to base metal after three passes.This resulted in increasing the microhardness by 120%(90.86 HV0.1)and 135%(105.59 HV0.1)for the WE43 and WE43-n HA,respectively.It is found that increasing FSP passes improved the uniform distribution of n HA particles within the composite matrix which led to improved corrosion resistance and less degradation rate.The corrosion rate of the FSPed WE43/n HA composite after three passes was reduced by 38.2%(4.13 mm/year)and the degradation rate was reduced by 69.7%(2.87 mm/y).This is attributed to secondary phase(Mg24Y5and Mg41Nd5)particle fragmentation and redistribution,as well as a homogeneous distribution of n HA.Additionally,the growing Ca-P and Mg(OH)2layer formed on the surface represented a protective layer that reduced the degradation rate.The wettability test revealed a relatively hydrophilic surface with water contact angle of 49.1±2.2°compared to 71.2±2.1°for base metal.Also,biomineralization test showed that apatite layer grew after immersion 7d in simulated body fluid with atomic ratio of Ca/P 1.60 approaching the stoichiometric ratio(1.67)indicating superior bioactivity of FSPed WE43/n HA composite after three passes.These results raise that the grain refinement by FSP and introduction of n HA particles significantly improved the degradation rate and in-vitro bioactivity of WE43 alloy for biomedical applications.展开更多
Food allergens are mainly naturally-occurring proteins with immunoglobulin E(IgE)-binding epitopes.Understanding the structural and immunogenic characteristics of allergenic proteins is essential in assessing whether ...Food allergens are mainly naturally-occurring proteins with immunoglobulin E(IgE)-binding epitopes.Understanding the structural and immunogenic characteristics of allergenic proteins is essential in assessing whether and how food processing techniques reduce allergenicity.We here discuss the impacts of food processing technologies on the modification of physicochemical,structural,and immunogenic properties of allergenic proteins.Detection techniques for characterizing changes in these properties of food allergens are summarized.Food processing helps to reduce allergenicity by aggregating or denaturing proteins,which masks,modifies,or destroys antigenic epitopes,whereas,it cannot eliminate allergenicity completely,and sometimes even improves allergenicity by exposing new epitopes.Moreover,most food processing techniques have been tested on purified food allergens rather than food products due to potential interference of other food components.We provide guidance for further development of processing operations that can decrease the allergenicity of allergenic food proteins without negatively impacting the nutritional profile.展开更多
In order to obtain Mg alloys with fine microstructures and high mechanical performances,a novel friction-based processing method,name as“constrained friction processing(CFP)”,was investigated.Via CFP,defect-free Mg-...In order to obtain Mg alloys with fine microstructures and high mechanical performances,a novel friction-based processing method,name as“constrained friction processing(CFP)”,was investigated.Via CFP,defect-free Mg-Zn-Ca rods with greatly refined grains and high mechanical properties were produced.Compared to the previous as-cast microstructure,the grain size was reduced from more than 1 mm to around 4μm within 3 s by a single process cycle.The compressive yield strength was increased by 350%while the ultimate compressive strength by 53%.According to the established material flow behaviors by“tracer material”,the plastic material was transported by shear deformation.From the base material to the rod,the material experienced three stages,i.e.deformation by the tool,upward flow with additional tilt,followed by upward transportation.The microstructural evolution was revealed by“stop-action”technique.The microstructural development at regions adjacent to the rod is mainly controlled by twinning,dynamic recrystallization(DRX)as well as particle stimulated nucleation,while that within the rod is related to DRX combined with grain growth.展开更多
In the process of production or processing of materials by various methods,there is a need for a large volume of water of the required quality.Today in many regions of the world,there is an acute problem of providing ...In the process of production or processing of materials by various methods,there is a need for a large volume of water of the required quality.Today in many regions of the world,there is an acute problem of providing industry with water of a required quality.Its solution is an urgent and difficult task.The water quality of surface water bodies is formed by a combination of a large number of both natural and anthropogenic factors,and is often significantly heterogeneous not only in the water area,but also in depth.As a rule,the water supply of large industrial enterprises is located along the river network.Mergers are the most important nodes of river systems.Understanding the mechanism of transport of pollutants at the confluence of rivers is critical for assessing water quality.In recent years,thanks to the data of satellite images,the interest of researchers in the phenomenon of mixing the waters of merging rivers has increased.The nature of the merger is influenced by the formation of transverse circulation.Within the framework of this work,a study of vorticity,as well as the width of the mixing zone,depending on the distance from the confluence,the speeds of the merging rivers and the angle of confluence was carried out.Since the consumer properties of water are largely determined by its chemical and physical indicators,the intensity of mixing,determined largely by the nature of the secondary circulation,is of fundamental importance for assessing the distribution of hydrochemical indicators of water quality in the mixing zone.These characteristics are important not only for organizing water intake for drinking and technical purposes with the best consumer properties,but also for organizing an effective monitoring system for confluence zones.展开更多
Unstructured and irregular graph data causes strong randomness and poor locality of data accesses in graph processing.This paper optimizes the depth-branch-resorting algorithm(DBR),and proposes a branch-alternation-re...Unstructured and irregular graph data causes strong randomness and poor locality of data accesses in graph processing.This paper optimizes the depth-branch-resorting algorithm(DBR),and proposes a branch-alternation-resorting algorithm(BAR).In order to make the algorithm run in parallel and improve the efficiency of algorithm operation,the BAR algorithm is mapped onto the reconfigurable array processor(APR-16)to achieve vertex reordering,effectively improving the locality of graph data.This paper validates the BAR algorithm on the GraphBIG framework,by utilizing the reordered dataset with BAR on breadth-first search(BFS),single source shortest paht(SSSP)and betweenness centrality(BC)algorithms for traversal.The results show that compared with DBR and Corder algorithms,BAR can reduce execution time by up to 33.00%,and 51.00%seperatively.In terms of data movement,the BAR algorithm has a maximum reduction of 39.00%compared with the DBR algorithm and 29.66%compared with Corder algorithm.In terms of computational complexity,the BAR algorithm has a maximum reduction of 32.56%compared with DBR algorithm and53.05%compared with Corder algorithm.展开更多
In recent years, the widespread adoption of parallel computing, especially in multi-core processors and high-performance computing environments, ushered in a new era of efficiency and speed. This trend was particularl...In recent years, the widespread adoption of parallel computing, especially in multi-core processors and high-performance computing environments, ushered in a new era of efficiency and speed. This trend was particularly noteworthy in the field of image processing, which witnessed significant advancements. This parallel computing project explored the field of parallel image processing, with a focus on the grayscale conversion of colorful images. Our approach involved integrating OpenMP into our framework for parallelization to execute a critical image processing task: grayscale conversion. By using OpenMP, we strategically enhanced the overall performance of the conversion process by distributing the workload across multiple threads. The primary objectives of our project revolved around optimizing computation time and improving overall efficiency, particularly in the task of grayscale conversion of colorful images. Utilizing OpenMP for concurrent processing across multiple cores significantly reduced execution times through the effective distribution of tasks among these cores. The speedup values for various image sizes highlighted the efficacy of parallel processing, especially for large images. However, a detailed examination revealed a potential decline in parallelization efficiency with an increasing number of cores. This underscored the importance of a carefully optimized parallelization strategy, considering factors like load balancing and minimizing communication overhead. Despite challenges, the overall scalability and efficiency achieved with parallel image processing underscored OpenMP’s effectiveness in accelerating image manipulation tasks.展开更多
Real-time capabilities and computational efficiency are provided by parallel image processing utilizing OpenMP. However, race conditions can affect the accuracy and reliability of the outcomes. This paper highlights t...Real-time capabilities and computational efficiency are provided by parallel image processing utilizing OpenMP. However, race conditions can affect the accuracy and reliability of the outcomes. This paper highlights the importance of addressing race conditions in parallel image processing, specifically focusing on color inverse filtering using OpenMP. We considered three solutions to solve race conditions, each with distinct characteristics: #pragma omp atomic: Protects individual memory operations for fine-grained control. #pragma omp critical: Protects entire code blocks for exclusive access. #pragma omp parallel sections reduction: Employs a reduction clause for safe aggregation of values across threads. Our findings show that the produced images were unaffected by race condition. However, it becomes evident that solving the race conditions in the code makes it significantly faster, especially when it is executed on multiple cores.展开更多
Recently,in the area of big data,some popular applications such as web search engines and recommendation systems,face the problem to diversify results during query processing.In this sense,it is both significant and e...Recently,in the area of big data,some popular applications such as web search engines and recommendation systems,face the problem to diversify results during query processing.In this sense,it is both significant and essential to propose methods to deal with big data in order to increase the diversity of the result set.In this paper,we firstly define the diversity of a set and the ability of an element to improve the overall diversity.Based on these definitions,we propose a diversification framework which has good performance in terms of effectiveness and efficiency.Also,this framework has theoretical guarantee on probability of success.Secondly,we design implementation algorithms based on this framework for both numerical and string data.Thirdly,for numerical and string data respectively,we carry out extensive experiments on real data to verify the performance of our proposed framework,and also perform scalability experiments on synthetic data.展开更多
Purpose-Resilient distributed processing technique(RDPT),in which mapper and reducer are simplified with the Spark contexts and support distributed parallel query processing.Design/methodology/approach-The proposed wo...Purpose-Resilient distributed processing technique(RDPT),in which mapper and reducer are simplified with the Spark contexts and support distributed parallel query processing.Design/methodology/approach-The proposed work is implemented with Pig Latin with Spark contexts to develop query processing in a distributed environment.Findings-Query processing in Hadoop influences the distributed processing with the MapReduce model.MapReduce caters to the works on different nodes with the implementation of complex mappers and reducers.Its results are valid for some extent size of the data.Originality/value-Pig supports the required parallel processing framework with the following constructs during the processing of queries:FOREACH;FLATTEN;COGROUP.展开更多
An extent join to compute path expressions containing parent-children and ancestor-descendent operations and two path expression optimization rules, path-shortening and path-complementing, are presented in this paper....An extent join to compute path expressions containing parent-children and ancestor-descendent operations and two path expression optimization rules, path-shortening and path-complementing, are presented in this paper. Path-shortening reduces the number of joins by shortening the path while path-complementing optimizes the path execution by using an equivalent complementary path expression to compute the original one.Experimental results show that the algorithms proposed are more efficient than traditional algorithms.展开更多
Recent development of wireless communication technologies and the popularity of smart phones are making location-based services (LBS) popular. However, requesting queries to LBS servers with users' exact locations...Recent development of wireless communication technologies and the popularity of smart phones are making location-based services (LBS) popular. However, requesting queries to LBS servers with users' exact locations may threat the privacy of users. Therefore, there have been many researches on generating a cloaked query region for user privacy protection. Consequently, an effcient query processing algorithm for a query region is required. So, in this paper, we propose k-nearest neighbor query (k-NN) processing algorithms for a query region in road networks. To effciently retrieve k-NN points of interest (POIs), we make use of the Island index. We also propose a method that generates an adaptive Island index to improve the query processing performance and storage usage. Finally, we show by our performance analysis that our k-NN query processing algorithms outperform the existing k-Range Nearest Neighbor (kRNN) algorithm in terms of network expansion cost and query processing time.展开更多
文摘As one of the commonly used queries in modern databases, skyline query has received extensive attention from database research community. The uncertainty of the data in wireless sensor networks makes the corresponding skyline uncertain and not unique. This paper investigates the Pr-Skyline problem, i.e., how to compute the skyline with the highest existence probability in a computational and energy-efficient way. We formulate the problem and prove that it is NP-Complete and cannot be approximated in a given expression. However, the proposed algorithm SKY-SEARCH with pruning techniques can guarantee the computational efficiency given relatively large input size, while the filter-based distributed optimization strategy significantly reduces the transmission cost and the required storage space of the sensor nodes. Extensive experiments verify the efficiency and scalability of SKY-SEARCH and the distributed optimizing strategy.
基金Funded by the Natural Science Foundation of China (No. 60873030)National High Technology Research and Development Program of China (No. 2007AA01Z309)Defense Pre-Research Foundation of China (No. 9140A04010209JW0504 and No. 9140A15040208JW0501)
文摘A defining characteristic of continuous queries over on-line data streams,possibly bounded by sliding windows,is the potentially infinite and time-evolving nature of their inputs and outputs.For different update patterns of continuous queries,suitable data structures bring great query processing efficiency.In this paper,we proposed a data structure suitable for weak nonmonotonic update pattern in which the lifetime of each tuple is known at generation time,but the length of lifetime is not necessarily the same.The new data structure combined the ladder queue with the feature of weak non-monotonic update pattern.The experiment results show that the new data structure performs much better than the traditional calendar queue in many cases.
基金This work is supported by the Ministry of Inform ation & Comm unicationsKoreaunder theInformation Technology Research Center(ITRC) Support Program.
文摘Recently, new techniques to efficiently manage current and past location information of moving objects have received significant interests in the area of moving object databases and location based service systems. In this paper, we exploit query processing schemes for location management systems, which consist of multiple data processing nodes to handle massive volume of moving objects such as cellular phone users. To show the usefulness of the proposed schemes, some experimental results showing performance factors regarding distributed query processing are explained. In our experiments, we use two kinds of data set: one is generated by the extended GSTD simulator and another is generated by the real time data generator which generates location sensing reports of various types of users having different movement patterns.
基金This work is supported by the National High Technology Research and Development Program ofChina(2 0 0 2 AA135 2 30 ) and the Major Project of National Natural Science Foundation of Beijing(4 0 110 0 2 ) .
文摘Recently, attention has been focused on spatial query language which is used to query spatial databases. A design of spatial query language has been presented in this paper by extending the standard relational database query language SQL. It recognizes the significantly different requirements of spatial data handling and overcomes the inherent problems of the application of conventional database query languages. This design is based on an extended spatial data model, including the spatial data types and the spatial operators on them. The processing and optimization of spatial queries have also been discussed in this design. In the end, an implementation of this design is given in a spatial query subsystem.
文摘With its untameable and traceable properties,blockchain technology has been widely used in the field of data sharing.How to preserve individual privacy while enabling efficient data queries is one of the primary issues with secure data sharing.In this paper,we study verifiable keyword frequency(KF)queries with local differential privacy in blockchain.Both the numerical and the keyword attributes are present in data objects;the latter are sensitive and require privacy protection.However,prior studies in blockchain have the problem of trilemma in privacy protection and are unable to handle KF queries.We propose an efficient framework that protects data owners’privacy on keyword attributes while enabling quick and verifiable query processing for KF queries.The framework computes an estimate of a keyword’s frequency and is efficient in query time and verification object(VO)size.A utility-optimized local differential privacy technique is used for privacy protection.The data owner adds noise locally into data based on local differential privacy so that the attacker cannot infer the owner of the keywords while keeping the difference in the probability distribution of the KF within the privacy budget.We propose the VB-cm tree as the authenticated data structure(ADS).The VB-cm tree combines the Verkle tree and the Count-Min sketch(CM-sketch)to lower the VO size and query time.The VB-cm tree uses the vector commitment to verify the query results.The fixed-size CM-sketch,which summarizes the frequency of multiple keywords,is used to estimate the KF via hashing operations.We conduct an extensive evaluation of the proposed framework.The experimental results show that compared to theMerkle B+tree,the query time is reduced by 52.38%,and the VO size is reduced by more than one order of magnitude.
基金supported by China Agriculture Research System of MOF and MARA(CARS-41)Wens Fifth Five R&D Major Project(WENS-2020-1-ZDZX-007)。
文摘The sensory perception of food is a dynamic process,which is closely related to the release of flavor substances during oral processing.It’s not only affected by the food material,but also subjected to the individual oral environment.To explore the oral processing characteristics of soft-boiled chicken,the sensory properties,texture,particle size,viscosity,characteristic values of electronic nose and tongue of different chicken samples were investigated.The correlation analysis showed that the physical characteristics especially the cohesiveness,springiness,resilience of the sample determined oral processing behavior.The addition of chicken skin played a role in lubrication during oral processing.The particle size of the bolus was heightened at the early stage,and the fluidity was enhanced in the end,which reduced the chewing time to the swallowing point and raised the aromatic compounds signal of electronic nose.But the effect of chicken skin on chicken thigh with relatively high fat content,was opposite in electronic nose,which had a certain masking effect on the perception of umami and sweet taste.In conclusion,fat played a critical role in chicken oral processing and chicken thigh had obvious advantages in comprehensive evaluation of soft-boiled chicken,which was more popular among people.
基金Supported by Guangxi Science and Technology Major Project(GUIKE AA22096020)Central Guidance for Local Scientific and Technological Development Funds(ZY20230102)+2 种基金Guilin City Science Research and Technology Development Plan Project(20220104-4,20210202-1,2020011203-1,2020011203-2)Open Project of Guangxi Key Laboratory of Tumor Immunology and Microenvironment Regulation(2022KF005)College Students Innovative Entrepreneurial Training Plan Program(202210601015).
文摘[Objectives]To compare the effects of traditional processing and fresh processing on the quality of Polygonatum odoratum decoction piece.[Methods]The effects of fresh processing and traditional processing on the quality of P.odoratum decoction piece were compared and analyzed with appearance characteristics,total ash content,extract content,total polysaccharides content,and total flavonoids content as the evaluation indexes.[Results]Fresh processing method in different production areas has different effects on P.odoratum decoction piece.P.odoratum was dried in oven of 50℃.When moisture content was 41.44%-59.67%,it was cut.After complete drying at 50℃,the moisture content of dried P.odoratum was 8.94%-9.60%,and ethanol-soluble extract content was 77.29%-78.20%,and water-soluble extract was 77.7%-78.14%.At this time,the appearance characteristics of section of P.odoratum decoction piece were better than that of traditional processing,which was yellowish white.The total polysaccharide content was higher than that of traditional processing,and the content of total flavonoids was statistically significant different from that of traditional processing.[Conclusions]The quality of P.odoratum decoction piece by fresh processing is better than that of the traditional processing,and it is feasible to use fresh processing.
基金supported by the University Malaya(Grant code:FRGS/1/2022/TK10/UM/02/6)the National Natural Science Foundation of China(Grant No.51275414,No.51605387)Deanship of Scientific Research at King Khalid University for funding this work through the Large Groups Project under grant number RGP.2/303/44。
文摘Nowadays,magnesium alloys are emerging in biomedical implants for their similar properties to natural bones.However,the rapid degradation of magnesium alloys in biological media hinders successful implantation.Refinement of microstructure,as well as reinforcement particles can significantly improve the degradation rate.In this work,multi-pass friction stir processing(FSP)was proposed to synthesize WE43/nano-hydroxyapatite(n HA)surface composite,the microstructure,reinforced particle distribution,micro-hardness,corrosion behavior and in-vitro bioactivity were studied.The subsequent FSP passes of WE43 alloy and WE43/n HA composite refined the grain size which was reduced by 94.29%and 95.92%(2.63 and 1.88μm,respectively)compared to base metal after three passes.This resulted in increasing the microhardness by 120%(90.86 HV0.1)and 135%(105.59 HV0.1)for the WE43 and WE43-n HA,respectively.It is found that increasing FSP passes improved the uniform distribution of n HA particles within the composite matrix which led to improved corrosion resistance and less degradation rate.The corrosion rate of the FSPed WE43/n HA composite after three passes was reduced by 38.2%(4.13 mm/year)and the degradation rate was reduced by 69.7%(2.87 mm/y).This is attributed to secondary phase(Mg24Y5and Mg41Nd5)particle fragmentation and redistribution,as well as a homogeneous distribution of n HA.Additionally,the growing Ca-P and Mg(OH)2layer formed on the surface represented a protective layer that reduced the degradation rate.The wettability test revealed a relatively hydrophilic surface with water contact angle of 49.1±2.2°compared to 71.2±2.1°for base metal.Also,biomineralization test showed that apatite layer grew after immersion 7d in simulated body fluid with atomic ratio of Ca/P 1.60 approaching the stoichiometric ratio(1.67)indicating superior bioactivity of FSPed WE43/n HA composite after three passes.These results raise that the grain refinement by FSP and introduction of n HA particles significantly improved the degradation rate and in-vitro bioactivity of WE43 alloy for biomedical applications.
基金supported by the National Natural Science Foundation of China (32102605)the Agricultural Science and Technology Innovation Program under Grant (CAAS-ASTIP-2020IAR)the Earmarked Fund for CARS (CARS-44)。
文摘Food allergens are mainly naturally-occurring proteins with immunoglobulin E(IgE)-binding epitopes.Understanding the structural and immunogenic characteristics of allergenic proteins is essential in assessing whether and how food processing techniques reduce allergenicity.We here discuss the impacts of food processing technologies on the modification of physicochemical,structural,and immunogenic properties of allergenic proteins.Detection techniques for characterizing changes in these properties of food allergens are summarized.Food processing helps to reduce allergenicity by aggregating or denaturing proteins,which masks,modifies,or destroys antigenic epitopes,whereas,it cannot eliminate allergenicity completely,and sometimes even improves allergenicity by exposing new epitopes.Moreover,most food processing techniques have been tested on purified food allergens rather than food products due to potential interference of other food components.We provide guidance for further development of processing operations that can decrease the allergenicity of allergenic food proteins without negatively impacting the nutritional profile.
基金the China Scholarship Council for the award of fellowship and funding(No.202006230137)。
文摘In order to obtain Mg alloys with fine microstructures and high mechanical performances,a novel friction-based processing method,name as“constrained friction processing(CFP)”,was investigated.Via CFP,defect-free Mg-Zn-Ca rods with greatly refined grains and high mechanical properties were produced.Compared to the previous as-cast microstructure,the grain size was reduced from more than 1 mm to around 4μm within 3 s by a single process cycle.The compressive yield strength was increased by 350%while the ultimate compressive strength by 53%.According to the established material flow behaviors by“tracer material”,the plastic material was transported by shear deformation.From the base material to the rod,the material experienced three stages,i.e.deformation by the tool,upward flow with additional tilt,followed by upward transportation.The microstructural evolution was revealed by“stop-action”technique.The microstructural development at regions adjacent to the rod is mainly controlled by twinning,dynamic recrystallization(DRX)as well as particle stimulated nucleation,while that within the rod is related to DRX combined with grain growth.
基金financial support from the Government of the Perm Territory within the Framework of Scientific Project No.S-26/828the Ministry of Science and High Education of Russia(Theme No.121031700169-1).
文摘In the process of production or processing of materials by various methods,there is a need for a large volume of water of the required quality.Today in many regions of the world,there is an acute problem of providing industry with water of a required quality.Its solution is an urgent and difficult task.The water quality of surface water bodies is formed by a combination of a large number of both natural and anthropogenic factors,and is often significantly heterogeneous not only in the water area,but also in depth.As a rule,the water supply of large industrial enterprises is located along the river network.Mergers are the most important nodes of river systems.Understanding the mechanism of transport of pollutants at the confluence of rivers is critical for assessing water quality.In recent years,thanks to the data of satellite images,the interest of researchers in the phenomenon of mixing the waters of merging rivers has increased.The nature of the merger is influenced by the formation of transverse circulation.Within the framework of this work,a study of vorticity,as well as the width of the mixing zone,depending on the distance from the confluence,the speeds of the merging rivers and the angle of confluence was carried out.Since the consumer properties of water are largely determined by its chemical and physical indicators,the intensity of mixing,determined largely by the nature of the secondary circulation,is of fundamental importance for assessing the distribution of hydrochemical indicators of water quality in the mixing zone.These characteristics are important not only for organizing water intake for drinking and technical purposes with the best consumer properties,but also for organizing an effective monitoring system for confluence zones.
基金the National Key R&D Program of China(No.2022ZD0119001)the National Natural Science Foundation of China(No.61834005)+3 种基金the Shaanxi Province Key R&D Plan(No.2022GY-027)the Key Scientific Research Project of Shaanxi Department of Education(No.22JY060)the Education Research Project of XUPT(No.JGA202108)the Graduate Student Innovation Fund of Xi'an University of Posts and Telecommunications(No.CXJJZL2022011)。
文摘Unstructured and irregular graph data causes strong randomness and poor locality of data accesses in graph processing.This paper optimizes the depth-branch-resorting algorithm(DBR),and proposes a branch-alternation-resorting algorithm(BAR).In order to make the algorithm run in parallel and improve the efficiency of algorithm operation,the BAR algorithm is mapped onto the reconfigurable array processor(APR-16)to achieve vertex reordering,effectively improving the locality of graph data.This paper validates the BAR algorithm on the GraphBIG framework,by utilizing the reordered dataset with BAR on breadth-first search(BFS),single source shortest paht(SSSP)and betweenness centrality(BC)algorithms for traversal.The results show that compared with DBR and Corder algorithms,BAR can reduce execution time by up to 33.00%,and 51.00%seperatively.In terms of data movement,the BAR algorithm has a maximum reduction of 39.00%compared with the DBR algorithm and 29.66%compared with Corder algorithm.In terms of computational complexity,the BAR algorithm has a maximum reduction of 32.56%compared with DBR algorithm and53.05%compared with Corder algorithm.
文摘In recent years, the widespread adoption of parallel computing, especially in multi-core processors and high-performance computing environments, ushered in a new era of efficiency and speed. This trend was particularly noteworthy in the field of image processing, which witnessed significant advancements. This parallel computing project explored the field of parallel image processing, with a focus on the grayscale conversion of colorful images. Our approach involved integrating OpenMP into our framework for parallelization to execute a critical image processing task: grayscale conversion. By using OpenMP, we strategically enhanced the overall performance of the conversion process by distributing the workload across multiple threads. The primary objectives of our project revolved around optimizing computation time and improving overall efficiency, particularly in the task of grayscale conversion of colorful images. Utilizing OpenMP for concurrent processing across multiple cores significantly reduced execution times through the effective distribution of tasks among these cores. The speedup values for various image sizes highlighted the efficacy of parallel processing, especially for large images. However, a detailed examination revealed a potential decline in parallelization efficiency with an increasing number of cores. This underscored the importance of a carefully optimized parallelization strategy, considering factors like load balancing and minimizing communication overhead. Despite challenges, the overall scalability and efficiency achieved with parallel image processing underscored OpenMP’s effectiveness in accelerating image manipulation tasks.
文摘Real-time capabilities and computational efficiency are provided by parallel image processing utilizing OpenMP. However, race conditions can affect the accuracy and reliability of the outcomes. This paper highlights the importance of addressing race conditions in parallel image processing, specifically focusing on color inverse filtering using OpenMP. We considered three solutions to solve race conditions, each with distinct characteristics: #pragma omp atomic: Protects individual memory operations for fine-grained control. #pragma omp critical: Protects entire code blocks for exclusive access. #pragma omp parallel sections reduction: Employs a reduction clause for safe aggregation of values across threads. Our findings show that the produced images were unaffected by race condition. However, it becomes evident that solving the race conditions in the code makes it significantly faster, especially when it is executed on multiple cores.
基金This paper was partially supported by NSFC(Grant Nos.U1509216,U1866602,61602129)and Microsoft Research Asia.
文摘Recently,in the area of big data,some popular applications such as web search engines and recommendation systems,face the problem to diversify results during query processing.In this sense,it is both significant and essential to propose methods to deal with big data in order to increase the diversity of the result set.In this paper,we firstly define the diversity of a set and the ability of an element to improve the overall diversity.Based on these definitions,we propose a diversification framework which has good performance in terms of effectiveness and efficiency.Also,this framework has theoretical guarantee on probability of success.Secondly,we design implementation algorithms based on this framework for both numerical and string data.Thirdly,for numerical and string data respectively,we carry out extensive experiments on real data to verify the performance of our proposed framework,and also perform scalability experiments on synthetic data.
文摘Purpose-Resilient distributed processing technique(RDPT),in which mapper and reducer are simplified with the Spark contexts and support distributed parallel query processing.Design/methodology/approach-The proposed work is implemented with Pig Latin with Spark contexts to develop query processing in a distributed environment.Findings-Query processing in Hadoop influences the distributed processing with the MapReduce model.MapReduce caters to the works on different nodes with the implementation of complex mappers and reducers.Its results are valid for some extent size of the data.Originality/value-Pig supports the required parallel processing framework with the following constructs during the processing of queries:FOREACH;FLATTEN;COGROUP.
文摘An extent join to compute path expressions containing parent-children and ancestor-descendent operations and two path expression optimization rules, path-shortening and path-complementing, are presented in this paper. Path-shortening reduces the number of joins by shortening the path while path-complementing optimizes the path execution by using an equivalent complementary path expression to compute the original one.Experimental results show that the algorithms proposed are more efficient than traditional algorithms.
基金supported by the Korea Institute of Science and Technology Information (KISTI)
文摘Recent development of wireless communication technologies and the popularity of smart phones are making location-based services (LBS) popular. However, requesting queries to LBS servers with users' exact locations may threat the privacy of users. Therefore, there have been many researches on generating a cloaked query region for user privacy protection. Consequently, an effcient query processing algorithm for a query region is required. So, in this paper, we propose k-nearest neighbor query (k-NN) processing algorithms for a query region in road networks. To effciently retrieve k-NN points of interest (POIs), we make use of the Island index. We also propose a method that generates an adaptive Island index to improve the query processing performance and storage usage. Finally, we show by our performance analysis that our k-NN query processing algorithms outperform the existing k-Range Nearest Neighbor (kRNN) algorithm in terms of network expansion cost and query processing time.
