When signal-to-interference ratio is low, the energy of strong interference leaked from the side lobe of beam pattern will infect the detection of weak target. Therefore, the beam pattern needs to be op...When signal-to-interference ratio is low, the energy of strong interference leaked from the side lobe of beam pattern will infect the detection of weak target. Therefore, the beam pattern needs to be optimized. The existing Dolph-Chebyshev weighting method can get the lowest side lobe level under given main lobe width, but for the other non-uniform circular array and nonlinear array, the low side lobe pattern needs to be designed specially. The second order cone programming optimization （SOCP） algorithm proposed in the paper transforms the optimization of the beam pattern into a standard convex optimization problem. Thus there is a paradigm to follow for any array formation, which not only achieves the purpose of Dolph-Chebyshev weighting, but also solves the problem of the increased side lobe when the signal is at end fire direction The simulation proves that the SOCP algorithm can detect the weak target better than the conventional beam forming.展开更多
Interpretation results of RS images were taken as the foundation, ETM RS images of July 15, 2009 as the data source, ENVI was applied for the preprocessing, Arc GIS used to finish the interpretation, master data obtai...Interpretation results of RS images were taken as the foundation, ETM RS images of July 15, 2009 as the data source, ENVI was applied for the preprocessing, Arc GIS used to finish the interpretation, master data obtained, and VB used to complete program development. 12 representative landscape pattern indexes were selected, Excel data used to create Access database, and VB used to complete the program development. Selection of landscape pattern indexes, program development process and program usage were summarized, through comparing its results with Excel calculation results, it was found that calculation results of this program were correct, the usage was convenient, so needs of most users could be satisfied.展开更多
Detecting well-known design patterns in object-oriented program source code can help maintainers understand the design of a program. Through the detection, the understandability, maintainability, and reusability of ob...Detecting well-known design patterns in object-oriented program source code can help maintainers understand the design of a program. Through the detection, the understandability, maintainability, and reusability of object-oriented programs can be improved. There are automated detection techniques;however, many existing techniques are based on static analysis and use strict conditions composed on class structure data. Hence, it is difficult for them to detect and distinguish design patterns in which the class structures are similar. Moreover, it is difficult for them to deal with diversity in design pattern applications. To solve these problems in existing techniques, we propose a design pattern detection technique using source code metrics and machine learning. Our technique judges candidates for the roles that compose design patterns by using machine learning and measurements of several metrics, and it detects design patterns by analyzing the relations between candidates. It suppresses false negatives and distinguishes patterns in which the class structures are similar. As a result of experimental evaluations with a set of programs, we confirmed that our technique is more accurate than two conventional techniques.展开更多
A method is presented for incrementally computing success patterns of logic programs. The set of success patterns of a logic program with respect to an abstraction is formulated as the success set of an equational log...A method is presented for incrementally computing success patterns of logic programs. The set of success patterns of a logic program with respect to an abstraction is formulated as the success set of an equational logic program modulo an equality theory that is induced by the abstraction. The method is exemplified via depth and stump abstractions. Also presented are algorithms for computing most general unifiers modulo equality theories induced by depth and stump abstractions.展开更多
The cutting technic for thePinus elliottii plantation of the multi-benefit management pattern in the hilly region of Jiangxi Province was studied by establishing the model of growth progress according to Richards func...The cutting technic for thePinus elliottii plantation of the multi-benefit management pattern in the hilly region of Jiangxi Province was studied by establishing the model of growth progress according to Richards function and simulating the tending cutting on computer by use of dynamic programming. The results showed that the best time for the initial thinning was at tree age of 8–10 and final cutting was at tree age of 25. The optimal thinning project was 3 times of thinning cutting including the first thinning, and the thinning time was at tree ages of 8, 12 and 16, respectively. Their thinning intensities were separately 950, 700 and 300 trunks per hectare, and the preserved density was 550 trunks per hectare until the final cutting Keywords Pinus elliottir - Multi-benefit management pattern - Richards function - Cutting technic - Dynamic programming CLC number S757.4 Document code A Foundation item: This study was supported by Natural Science Foundation of Jiangxi Province (A grant 0330023)Biography: WANG Qing-chun (1970-), male, Ph. Doctor, Senior Engineer in Academy of Forest Inventory & Planning, Jiangxi, Nanchang 330046, P.R. China.Responsible editor: Song Funan展开更多
Flatness pattern recognition is the key of the flatness control. The accuracy of the present flatness pattern recognition is limited and the shape defects cannot be reflected intuitively. In order to improve it, a nov...Flatness pattern recognition is the key of the flatness control. The accuracy of the present flatness pattern recognition is limited and the shape defects cannot be reflected intuitively. In order to improve it, a novel method via T-S cloud inference network optimized by genetic algorithm(GA) is proposed. T-S cloud inference network is constructed with T-S fuzzy neural network and the cloud model. So, the rapid of fuzzy logic and the uncertainty of cloud model for processing data are both taken into account. What's more, GA possesses good parallel design structure and global optimization characteristics. Compared with the simulation recognition results of traditional BP Algorithm, GA is more accurate and effective. Moreover, virtual reality technology is introduced into the field of shape control by Lab VIEW, MATLAB mixed programming. And virtual flatness pattern recognition interface is designed.Therefore, the data of engineering analysis and the actual model are combined with each other, and the shape defects could be seen more lively and intuitively.展开更多
BACKGROUND Colorectal cancer is a common tumor with a quite high-related mortality.Despite the used curative treatments,patients will develop cancer recurrence in up to 50%of the cases and/or other primary neoplasms.A...BACKGROUND Colorectal cancer is a common tumor with a quite high-related mortality.Despite the used curative treatments,patients will develop cancer recurrence in up to 50%of the cases and/or other primary neoplasms.Although most of the recurrences are discovered within 3 years from the first treatment,a small percentage is found after 5 years.The early detection of recurrence is crucial to allow further therapies improving patients’survival.Several follow-up programs have been developed but the optimal one is far from being established.AIM To evaluation of potential prognostic factors for timing and patterns of recurrence in order to plan tailored follow-up programs.METHODS Perioperative and long-term data of all consecutive patients surgically treated with curative intent,from January 2006 to June 2009,for colorectal adenocarcinoma,were retrospectively reviewed to find potential prognostic factors associated with:(1)Recurrence incidence;(2)Incidence of an early(within 3 years from surgery)or late recurrence;and(3)Different sites of recurrence.In addition,the incidence of other primary neoplasms has been evaluated in a cohort of patients with a minimum potential follow-up of 10 years.RESULTS Our study included 234 patients.The median follow-up period has been 119±46.2 mo.The recurrence rate has been 25.6%.Patients with a higher chance to develop recurrence had also the following characteristics:Higher levels of preoperative glycemia and carcinoembryonic antigen,highest anaesthesiologists Score score,occlusion,received a complex operation performed with an open technique,after a longer hospital stay,and showed advanced tumors.The independent prognostic factors for recurrence were the hospital stay,N stage 2,and M stage 1(multivariate analysis).Younger ages were significantly associated with an early recurrence onset.Patients that received intermediate colectomies or segmental resections,having an N stage 2 or American Joint Committee on Cancer stage 3 tumors were also associated with a higher risk of liver recurrence,while metastatic diseases at diagnosis were linked with local recurrence.Neoadjuvant treatments showed lung recurrence.Finally,bigger tumors and higher lymph node ratio were associated with peritoneal recurrence(marginally significant).Thirty patients developed a second malignancy during the follow-up time.CONCLUSION Several prognostic factors should be considered for tailored follow-up programs,eventually,beyond 5 years from the first treatment.展开更多
The use of programming online judges(POJs)has risen dramatically in recent years,owing to the fact that the auto-evaluation of codes during practice motivates students to learn programming.Since POJs have greater numb...The use of programming online judges(POJs)has risen dramatically in recent years,owing to the fact that the auto-evaluation of codes during practice motivates students to learn programming.Since POJs have greater number of pro-gramming problems in their repository,learners experience information overload.Recommender systems are a common solution to information overload.Current recommender systems used in e-learning platforms are inadequate for POJ since recommendations should consider learners’current context,like learning goals and current skill level(topic knowledge and difficulty level).To overcome the issue,we propose a context-aware practice problem recommender system based on learners’skill level navigation patterns.Our system initially performs skill level navigation pattern mining to discover frequent skill level navigations in the POJ and tofind learners’learning goals.Collaborativefiltering(CF)and con-tent-basedfiltering approaches are employed to recommend problems in the cur-rent and next skill levels based on frequent skill level navigation patterns.The sequence similarity measure is used tofind the top k neighbors based on the sequence of problems solved by the learners.The experiment results based on the real-world POJ dataset show that our approach considering the learners’cur-rent skill level and learning goals outperforms the other approaches in practice problem recommender systems.展开更多
This paper intends to investigate the urban spatial patterns of Hubei Province and its evolution from three different perspectives: urban nodes, urban connections and urban clusters. The research adopts nighttime ligh...This paper intends to investigate the urban spatial patterns of Hubei Province and its evolution from three different perspectives: urban nodes, urban connections and urban clusters. The research adopts nighttime light imagery of cities in Hubei Province, the viewpoint of ′point-axis-area′ in the ′point-axis system′ theory, and employs light index model, gravity model and social network analysis. The findings are as follows: 1) In terms of urban nodes, the urbanization process of Hubei has been carried out mainly on the basis of external expansion rather than internal increasing. The polarization trend of urban connection network is strengthening. 2) As for urban connections, the estimation of urban connections using light index model is capable of containing various actual flow, and the connections are getting increasingly closer. 3) In regard to urban groups, seven urban groups of varying sizes have formed. On that basis, three stable and relatively independent urban groups as the centers, namely Wuchang, Yichang and Xiangyang emerge as well. But the structures of ′Wuhan Metropolitan Area′, ′Yichang-Jingzhou-Jingmen City Group′ and ′Xiangyang-Shiyen-Suizhou City Group′, which are defined by local development strategy in Hubei Province, are different from the above three urban groups.展开更多
Advancements in semiconductor technology are making gate-level test generation more challenging. This is because a large amount of detailed structural information must be processed in the search process of automatic t...Advancements in semiconductor technology are making gate-level test generation more challenging. This is because a large amount of detailed structural information must be processed in the search process of automatic test pattern generation (ATPG). In addition, ATPG needs to deal with new defects caused by process variation when IC is shrinking. To reduce the computation effort of ATPG, test generation could be started earlier at higher abstraction level, which is in line with top-down design methodology that has become more popular nowadays. In this research, we employ Chen’s high-level fault model in the high-level ATPG. Besides shorter ATPG time as shown in many previous works, our study showed that high-level ATPG also contributes to test compaction. This is because most of the high-level faults correlate with the gate-level collapsed faults especially at input/output of the modules in a circuit. The high-level ATPG prototype used in our work is mainly composed by constraint-driven test generation engine and fault simulation engine. Experimental result showed that more reduced/compact test set can be generated from the high-level ATPG.展开更多
To meet the development trend of multi-bar warp knit-ting machine towards high-speed,advanced technologyand computer control and the requirements of variousproducts with small quantity,there are many researcheson the ...To meet the development trend of multi-bar warp knit-ting machine towards high-speed,advanced technologyand computer control and the requirements of variousproducts with small quantity,there are many researcheson the computer-aided pattern design of multi-barwarp knitted fabrics.In terms of the special propertiesof the computer-aided pattern design of multi-barwarp knitted fabrics,the Object Oriented Program(OOP)programming-Object Windows class Library(OWL)programming is selected.According to thecharacters of the OWL programming,various functionsare defined.Pattern design and technical parameters canbe output,which offers a great convenience for the fac-tory.展开更多
Many search-based Automatic Program Repair(APR)techniques employ a set of repair patterns to generate candidate patches.Regarding repair pattern selection,existing search-based APR techniques either randomly select a ...Many search-based Automatic Program Repair(APR)techniques employ a set of repair patterns to generate candidate patches.Regarding repair pattern selection,existing search-based APR techniques either randomly select a repair pattern from the repair pattern set to apply or prioritize all repair patterns based on the bug's context information.In this paper,we introduce PatternNet,a multi-view feature f usion model capable of predicting the repair pattern for a reported software bug.To accomplish this task,PatternNet first extracts multiview features from the pair of buggy code and bug report using different models.Specifically,a transformer-based model(i.e.,UniXcoder)is utilized to obtain the bimodal feature representation of the buggy code and bug report.Additionally,an Abstract Syntax Tree(AST)-based neural model(i.e.,ASTNN)is employed to learn the feature representation of the buggy code.Second,a co-attention mechanism is adopted to capture the dependencies between the statement trees in the AST of the buggy code and the textual tokens of the reported bug,resulting in co-attentive features between statement trees and reported bug's textual tokens.Finally,these multi-view features are combined i nto a unified representation using a feature fusion network.We quantitatively demonstrate the effectiveness of PatternNet and the feature fusion network for predicting software bug repair patterns.展开更多
基金Special Item of National Major Scientific Apparatus Development(No.2013YQ140431)
文摘When signal-to-interference ratio is low, the energy of strong interference leaked from the side lobe of beam pattern will infect the detection of weak target. Therefore, the beam pattern needs to be optimized. The existing Dolph-Chebyshev weighting method can get the lowest side lobe level under given main lobe width, but for the other non-uniform circular array and nonlinear array, the low side lobe pattern needs to be designed specially. The second order cone programming optimization （SOCP） algorithm proposed in the paper transforms the optimization of the beam pattern into a standard convex optimization problem. Thus there is a paradigm to follow for any array formation, which not only achieves the purpose of Dolph-Chebyshev weighting, but also solves the problem of the increased side lobe when the signal is at end fire direction The simulation proves that the SOCP algorithm can detect the weak target better than the conventional beam forming.
基金Supported by Social Development Program of Lianyungang Bureau of Science and Technology,Jiangsu Province:RS-based Research on the Eco-environment Evolution of Coastal Regions in Lianyungang(SH0811)~~
文摘Interpretation results of RS images were taken as the foundation, ETM RS images of July 15, 2009 as the data source, ENVI was applied for the preprocessing, Arc GIS used to finish the interpretation, master data obtained, and VB used to complete program development. 12 representative landscape pattern indexes were selected, Excel data used to create Access database, and VB used to complete the program development. Selection of landscape pattern indexes, program development process and program usage were summarized, through comparing its results with Excel calculation results, it was found that calculation results of this program were correct, the usage was convenient, so needs of most users could be satisfied.
文摘Detecting well-known design patterns in object-oriented program source code can help maintainers understand the design of a program. Through the detection, the understandability, maintainability, and reusability of object-oriented programs can be improved. There are automated detection techniques;however, many existing techniques are based on static analysis and use strict conditions composed on class structure data. Hence, it is difficult for them to detect and distinguish design patterns in which the class structures are similar. Moreover, it is difficult for them to deal with diversity in design pattern applications. To solve these problems in existing techniques, we propose a design pattern detection technique using source code metrics and machine learning. Our technique judges candidates for the roles that compose design patterns by using machine learning and measurements of several metrics, and it detects design patterns by analyzing the relations between candidates. It suppresses false negatives and distinguishes patterns in which the class structures are similar. As a result of experimental evaluations with a set of programs, we confirmed that our technique is more accurate than two conventional techniques.
文摘A method is presented for incrementally computing success patterns of logic programs. The set of success patterns of a logic program with respect to an abstraction is formulated as the success set of an equational logic program modulo an equality theory that is induced by the abstraction. The method is exemplified via depth and stump abstractions. Also presented are algorithms for computing most general unifiers modulo equality theories induced by depth and stump abstractions.
基金Natural Science Foundation of Jiangxi Province (A grant 0330023)
文摘The cutting technic for thePinus elliottii plantation of the multi-benefit management pattern in the hilly region of Jiangxi Province was studied by establishing the model of growth progress according to Richards function and simulating the tending cutting on computer by use of dynamic programming. The results showed that the best time for the initial thinning was at tree age of 8–10 and final cutting was at tree age of 25. The optimal thinning project was 3 times of thinning cutting including the first thinning, and the thinning time was at tree ages of 8, 12 and 16, respectively. Their thinning intensities were separately 950, 700 and 300 trunks per hectare, and the preserved density was 550 trunks per hectare until the final cutting Keywords Pinus elliottir - Multi-benefit management pattern - Richards function - Cutting technic - Dynamic programming CLC number S757.4 Document code A Foundation item: This study was supported by Natural Science Foundation of Jiangxi Province (A grant 0330023)Biography: WANG Qing-chun (1970-), male, Ph. Doctor, Senior Engineer in Academy of Forest Inventory & Planning, Jiangxi, Nanchang 330046, P.R. China.Responsible editor: Song Funan
基金Project(LJRC013)supported by the University Innovation Team of Hebei Province Leading Talent Cultivation,China
文摘Flatness pattern recognition is the key of the flatness control. The accuracy of the present flatness pattern recognition is limited and the shape defects cannot be reflected intuitively. In order to improve it, a novel method via T-S cloud inference network optimized by genetic algorithm(GA) is proposed. T-S cloud inference network is constructed with T-S fuzzy neural network and the cloud model. So, the rapid of fuzzy logic and the uncertainty of cloud model for processing data are both taken into account. What's more, GA possesses good parallel design structure and global optimization characteristics. Compared with the simulation recognition results of traditional BP Algorithm, GA is more accurate and effective. Moreover, virtual reality technology is introduced into the field of shape control by Lab VIEW, MATLAB mixed programming. And virtual flatness pattern recognition interface is designed.Therefore, the data of engineering analysis and the actual model are combined with each other, and the shape defects could be seen more lively and intuitively.
文摘BACKGROUND Colorectal cancer is a common tumor with a quite high-related mortality.Despite the used curative treatments,patients will develop cancer recurrence in up to 50%of the cases and/or other primary neoplasms.Although most of the recurrences are discovered within 3 years from the first treatment,a small percentage is found after 5 years.The early detection of recurrence is crucial to allow further therapies improving patients’survival.Several follow-up programs have been developed but the optimal one is far from being established.AIM To evaluation of potential prognostic factors for timing and patterns of recurrence in order to plan tailored follow-up programs.METHODS Perioperative and long-term data of all consecutive patients surgically treated with curative intent,from January 2006 to June 2009,for colorectal adenocarcinoma,were retrospectively reviewed to find potential prognostic factors associated with:(1)Recurrence incidence;(2)Incidence of an early(within 3 years from surgery)or late recurrence;and(3)Different sites of recurrence.In addition,the incidence of other primary neoplasms has been evaluated in a cohort of patients with a minimum potential follow-up of 10 years.RESULTS Our study included 234 patients.The median follow-up period has been 119±46.2 mo.The recurrence rate has been 25.6%.Patients with a higher chance to develop recurrence had also the following characteristics:Higher levels of preoperative glycemia and carcinoembryonic antigen,highest anaesthesiologists Score score,occlusion,received a complex operation performed with an open technique,after a longer hospital stay,and showed advanced tumors.The independent prognostic factors for recurrence were the hospital stay,N stage 2,and M stage 1(multivariate analysis).Younger ages were significantly associated with an early recurrence onset.Patients that received intermediate colectomies or segmental resections,having an N stage 2 or American Joint Committee on Cancer stage 3 tumors were also associated with a higher risk of liver recurrence,while metastatic diseases at diagnosis were linked with local recurrence.Neoadjuvant treatments showed lung recurrence.Finally,bigger tumors and higher lymph node ratio were associated with peritoneal recurrence(marginally significant).Thirty patients developed a second malignancy during the follow-up time.CONCLUSION Several prognostic factors should be considered for tailored follow-up programs,eventually,beyond 5 years from the first treatment.
文摘The use of programming online judges(POJs)has risen dramatically in recent years,owing to the fact that the auto-evaluation of codes during practice motivates students to learn programming.Since POJs have greater number of pro-gramming problems in their repository,learners experience information overload.Recommender systems are a common solution to information overload.Current recommender systems used in e-learning platforms are inadequate for POJ since recommendations should consider learners’current context,like learning goals and current skill level(topic knowledge and difficulty level).To overcome the issue,we propose a context-aware practice problem recommender system based on learners’skill level navigation patterns.Our system initially performs skill level navigation pattern mining to discover frequent skill level navigations in the POJ and tofind learners’learning goals.Collaborativefiltering(CF)and con-tent-basedfiltering approaches are employed to recommend problems in the cur-rent and next skill levels based on frequent skill level navigation patterns.The sequence similarity measure is used tofind the top k neighbors based on the sequence of problems solved by the learners.The experiment results based on the real-world POJ dataset show that our approach considering the learners’cur-rent skill level and learning goals outperforms the other approaches in practice problem recommender systems.
基金Under the auspices of National Natural Science Foundation of China(No.41001100,41371183)Humanities and Social Sciences Foundation of Ministry of Education in China(No.15YJCZH174)+1 种基金Humanities Sciences Foundation of Ministry of Hubei Province(No.15YJCZH174)Fundamental Research Funds for the Central Universities(No.CCNU15A06069,CCNU15ZD001)
文摘This paper intends to investigate the urban spatial patterns of Hubei Province and its evolution from three different perspectives: urban nodes, urban connections and urban clusters. The research adopts nighttime light imagery of cities in Hubei Province, the viewpoint of ′point-axis-area′ in the ′point-axis system′ theory, and employs light index model, gravity model and social network analysis. The findings are as follows: 1) In terms of urban nodes, the urbanization process of Hubei has been carried out mainly on the basis of external expansion rather than internal increasing. The polarization trend of urban connection network is strengthening. 2) As for urban connections, the estimation of urban connections using light index model is capable of containing various actual flow, and the connections are getting increasingly closer. 3) In regard to urban groups, seven urban groups of varying sizes have formed. On that basis, three stable and relatively independent urban groups as the centers, namely Wuchang, Yichang and Xiangyang emerge as well. But the structures of ′Wuhan Metropolitan Area′, ′Yichang-Jingzhou-Jingmen City Group′ and ′Xiangyang-Shiyen-Suizhou City Group′, which are defined by local development strategy in Hubei Province, are different from the above three urban groups.
文摘Advancements in semiconductor technology are making gate-level test generation more challenging. This is because a large amount of detailed structural information must be processed in the search process of automatic test pattern generation (ATPG). In addition, ATPG needs to deal with new defects caused by process variation when IC is shrinking. To reduce the computation effort of ATPG, test generation could be started earlier at higher abstraction level, which is in line with top-down design methodology that has become more popular nowadays. In this research, we employ Chen’s high-level fault model in the high-level ATPG. Besides shorter ATPG time as shown in many previous works, our study showed that high-level ATPG also contributes to test compaction. This is because most of the high-level faults correlate with the gate-level collapsed faults especially at input/output of the modules in a circuit. The high-level ATPG prototype used in our work is mainly composed by constraint-driven test generation engine and fault simulation engine. Experimental result showed that more reduced/compact test set can be generated from the high-level ATPG.
文摘To meet the development trend of multi-bar warp knit-ting machine towards high-speed,advanced technologyand computer control and the requirements of variousproducts with small quantity,there are many researcheson the computer-aided pattern design of multi-barwarp knitted fabrics.In terms of the special propertiesof the computer-aided pattern design of multi-barwarp knitted fabrics,the Object Oriented Program(OOP)programming-Object Windows class Library(OWL)programming is selected.According to thecharacters of the OWL programming,various functionsare defined.Pattern design and technical parameters canbe output,which offers a great convenience for the fac-tory.
基金Partially supported by the National Natural Science Foundation of China(61802350)。
文摘Many search-based Automatic Program Repair(APR)techniques employ a set of repair patterns to generate candidate patches.Regarding repair pattern selection,existing search-based APR techniques either randomly select a repair pattern from the repair pattern set to apply or prioritize all repair patterns based on the bug's context information.In this paper,we introduce PatternNet,a multi-view feature f usion model capable of predicting the repair pattern for a reported software bug.To accomplish this task,PatternNet first extracts multiview features from the pair of buggy code and bug report using different models.Specifically,a transformer-based model(i.e.,UniXcoder)is utilized to obtain the bimodal feature representation of the buggy code and bug report.Additionally,an Abstract Syntax Tree(AST)-based neural model(i.e.,ASTNN)is employed to learn the feature representation of the buggy code.Second,a co-attention mechanism is adopted to capture the dependencies between the statement trees in the AST of the buggy code and the textual tokens of the reported bug,resulting in co-attentive features between statement trees and reported bug's textual tokens.Finally,these multi-view features are combined i nto a unified representation using a feature fusion network.We quantitatively demonstrate the effectiveness of PatternNet and the feature fusion network for predicting software bug repair patterns.
