This study proposes a novel approach to optimizing individual work schedules for book digitization using mixed-integer programming (MIP). By leveraging the power of MIP solvers, we aimed to minimize the overall digiti...This study proposes a novel approach to optimizing individual work schedules for book digitization using mixed-integer programming (MIP). By leveraging the power of MIP solvers, we aimed to minimize the overall digitization time while considering various constraints and process dependencies. The book digitization process involves three key steps: cutting, scanning, and binding. Each step has specific requirements and limitations such as the number of pages that can be processed simultaneously and potential bottlenecks. To address these complexities, we formulate the problem as a one-machine job shop scheduling problem with additional constraints to capture the unique characteristics of book digitization. We conducted a series of experiments to evaluate the performance of our proposed approach. By comparing the optimized schedules with the baseline approach, we demonstrated significant reductions in the overall processing time. In addition, we analyzed the impact of different weighting schemes on the optimization results, highlighting the importance of identifying and prioritizing critical processes. Our findings suggest that MIP-based optimization can be a valuable tool for improving the efficiency of individual work schedules, even in seemingly simple tasks, such as book digitization. By carefully considering specific constraints and objectives, we can save time and leverage resources by carefully considering specific constraints and objectives.展开更多
The numerical dispersion phenomenon in the finite-difference forward modeling simulations of the wave equation significantly affects the imaging accuracy in acoustic reflection logging.This issue is particularly prono...The numerical dispersion phenomenon in the finite-difference forward modeling simulations of the wave equation significantly affects the imaging accuracy in acoustic reflection logging.This issue is particularly pronounced in the reverse time migration(RTM)method used for shear-wave(S-wave)logging imaging.This not only affects imaging accuracy but also introduces ambiguities in the interpretation of logging results.To address this challenge,this study proposes the use of a least-squares difference coefficient optimization algorithm aiming to suppress the numerical dispersion phenomenon in the RTM of S-wave reflection imaging logging.By optimizing the difference coefficients,the high-precision finite-difference algorithm serves as an effective operator for both forward and backward RTM processes.This approach is instrumental in eliminating migration illusions,which are often caused by numerical dispersion.The effectiveness of this optimized algorithm is demonstrated through numerical results,which indicate that it can achieve more accurate forward imaging results across various conditions,including high-and low-velocity strata,and is effective in both large and small spatial grids.The results of processing real data demonstrate that numerical dispersion optimization effectively reduces migration artifacts and diminishes ambiguities in logging interpretations.This optimization offers crucial technical support to the RTM method,enhancing its capability for accurately modeling and imaging S-wave reflections.展开更多
Toric patch is a kind of rational multisided patch,which is associated with a finite integer lattice points set A.A set of weights is defined which depend on a parameter according to regular decomposition of A.When al...Toric patch is a kind of rational multisided patch,which is associated with a finite integer lattice points set A.A set of weights is defined which depend on a parameter according to regular decomposition of A.When all weights of the patch tend to infinity,we obtain the limiting form of toric patch which is called its regular control surface.The diferent weights may induce the diferent regular control surfaces of the same toric patch.It prompts us to consider that how many regular control surfaces of a toric patch.In this paper,we study the regular decompositions of A by using integer programming method firstly,and then provide the relationship between all regular decompositions of A and corresponding state polytope.Moreover,we present that the number of regular control surfaces of a toric patch associated with A is equal to the number of regular decompositions of A.An algorithm to calculate the number of regular control surfaces of toric patch is provided.The algorithm also presents a method to construct all of the regular control surfaces of a toric patch.At last,the application of proposed result in shape deformation is demonstrated by several examples.展开更多
Satellite Component Layout Optimization(SCLO) is crucial in satellite system design.This paper proposes a novel Satellite Three-Dimensional Component Assignment and Layout Optimization(3D-SCALO) problem tailored to en...Satellite Component Layout Optimization(SCLO) is crucial in satellite system design.This paper proposes a novel Satellite Three-Dimensional Component Assignment and Layout Optimization(3D-SCALO) problem tailored to engineering requirements, aiming to optimize satellite heat dissipation while considering constraints on static stability, 3D geometric relationships between components, and special component positions. The 3D-SCALO problem is a challenging bilevel combinatorial optimization task, involving the optimization of discrete component assignment variables in the outer layer and continuous component position variables in the inner layer,with both influencing each other. To address this issue, first, a Mixed Integer Programming(MIP) model is proposed, which reformulates the original bilevel problem into a single-level optimization problem, enabling the exploration of a more comprehensive optimization space while avoiding iterative nested optimization. Then, to model the 3D geometric relationships between components within the MIP framework, a linearized 3D Phi-function method is proposed, which handles non-overlapping and safety distance constraints between cuboid components in an explicit and effective way. Subsequently, the Finite-Rectangle Method(FRM) is proposed to manage 3D geometric constraints for complex-shaped components by approximating them with a finite set of cuboids, extending the applicability of the geometric modeling approach. Finally, the feasibility and effectiveness of the proposed MIP model are demonstrated through two numerical examples"and a real-world engineering case, which confirms its suitability for complex-shaped components and real engineering applications.展开更多
In this paper, we combine a split least-squares procedure with the method of characteristics to treat convection-dominated parabolic integro-differential equations. By selecting the least-squares functional properly, ...In this paper, we combine a split least-squares procedure with the method of characteristics to treat convection-dominated parabolic integro-differential equations. By selecting the least-squares functional properly, the procedure can be split into two independent sub-procedures, one of which is for the primitive unknown and the other is for the flux. Choosing projections carefully, we get optimal order H^1 （Ω） and L^2（Ω） norm error estimates for u and sub-optimal （L^2（Ω））^d norm error estimate for σ. Numerical results are presented to substantiate the validity of the theoretical results.展开更多
This study explored the application value of iterative decomposition of water and fatwith echo asymmetry and least-squares estimation(IDEAL-IQ)technology in the early diagnosis of ageing osteoporosis(OP).172 participa...This study explored the application value of iterative decomposition of water and fatwith echo asymmetry and least-squares estimation(IDEAL-IQ)technology in the early diagnosis of ageing osteoporosis(OP).172 participants were enrolled and underwentmagnetic resonance imaging(MRI)examinations on a 3.0T scanner.100 cases were included in the normal group(50 males and 50 females;mean age:45 years;age range:20e84 years).33 cases were included in the osteopenia group(17 males and 16 females;mean age:55 years;age range:43e83 years).39 caseswere includedintheOP group(19males and20females;meanage:58years;age range:48 e82 years).Conventional T1WI and T2WI were first obtained,followed by 3D-IDEAL-IQ-acqui-sition.Fat fraction(FF)and apparent transverse relaxation rate(R2*)resultswere automatically calculated from IDEAL-IQ-images on the console.Based on T1Wand T2W-images,300 ROIs for each participantweremanually delineated in L1-L5 vertebral bodies of five middle slices.In each age group of all normal subjects,each parameter was significantly correlated with gender.In male participants from the normal,osteopenia,and OP groups,statistical analysis revealed F values of 11319.292 and 180.130 for comparisons involving FF and R2*values,respectively(all p<0.0001).The sensitivity and specificity of FF values were 0.906 and 0.950,0.994 and 0.997,0.865 and 0.820,respectively.For R2*,they were 0.665 and 0.616,0.563 and 0.519,0.571 and 0.368,respectively.In female participants from the normal,osteopenia,and OP-groups,statis-tical analysis revealed F values of 12461.658 and 548.274 for comparisons involving FF and R2*values,respectively(all p<0.0001).The sensitivity and specificity of FF values were 0.985 and 0.991,0.996 and 0.996,0.581 and 0.678,respectively.For R2*,they were 0.698 and 0.730,0.603 and 0.665,0.622 and 0.525,respectively.Significant differences were indicated in the quanti-tative values among the three groups.FF value had good performance,while R2*value had poor performance indiscriminatingosteopenia andOP-groups.Overall,the IDEAL-IQ techniqueoffers specific reference indices that enable noninvasive and quantitative assessment of lumbar vertebrae bone metabolism,thereby providing diagnostic information for OP.展开更多
An improved method based on the Tikhonov regularization principle and the precisely known reference station coordinate is proposed to design the regularized matrix. The ill-conditioning of the normal matrix can be imp...An improved method based on the Tikhonov regularization principle and the precisely known reference station coordinate is proposed to design the regularized matrix. The ill-conditioning of the normal matrix can be improved by the regularized matrix. The relative floating ambiguity can be computed only by using the data of several epochs. Combined with the LAMBDA method, the new approach can correctly and quickly fix the integer ambiguity and the success rate is 100% in experiments. Through using measured data sets from four mediumlong baselines, the new method can obtain exact ambiguities only by the Ll-frequency data of three epochs. Compared with the existing methods, the improved method can solve the ambiguities of the medium-long baseline GPS network RTK only using L1-frequency GPS data.展开更多
A method for integer ambiguity resolution in the global positioning system （GPS） multi-reference station network real time kinematic （RTK） is proposed. First, the barycenter of the triangle of reference stations f...A method for integer ambiguity resolution in the global positioning system （GPS） multi-reference station network real time kinematic （RTK） is proposed. First, the barycenter of the triangle of reference stations for ambiguity resolution is taken as a reference point. The satellite which has the largest elevation angle with the reference point is selected as a reference satellite. The parameters for constructing the weight matrix of carrier phase observation and the criteria for checking the correctness of integer ambiguity resolution of a network are obtained. Then, the wide ambiguity is calculated by a linear combination method of dualband observation. And the LI ambiguity is obtained by a nonionosphere combination method. The Kalman filter is introduced to refine the floating-point solution of ambiguity and estimate the real-time tropospheric delay. Finally, the cofactor matrix of ambiguity is de-correlated by Z-transformation to reduce the searching space of the integer ambiguity solution and improve the efficiency of the least-squares ambiguity decorrelation adjustment （LAMBDA） algorithm. The experimental results show that this method can reliably obtain the integer ambiguity solution among multi-reference stations with 40 epochs.展开更多
Based on the analysis to the random sear ch algorithm of LUUS, a modified random directed integer search algorithm (MRDI SA) is given for first time. And a practical example is given to show that the adva ntage of th...Based on the analysis to the random sear ch algorithm of LUUS, a modified random directed integer search algorithm (MRDI SA) is given for first time. And a practical example is given to show that the adva ntage of this kind of algorithm is the reliability can’t be infuenced by the ini tial value X (0) and the start search domain R (0) . Besides, i t can be applied to solve the higher dimensional constrained nonlinear integer p rogramming problem.展开更多
A simplified integer overflow detection method based on path relaxation is described for avoiding buffer overflow triggered by integer overflow. When the integer overflow refers to the size of the buffer allocated dyn...A simplified integer overflow detection method based on path relaxation is described for avoiding buffer overflow triggered by integer overflow. When the integer overflow refers to the size of the buffer allocated dynamically, this kind of integer overflow is most likely to trigger buffer overflow. Based on this discovery, through lightly static program analysis, the solution traces the key variables referring to the size of a buffer allocated dynamically and it maintains the upper bound and lower bound of these variables. After the constraint information of these traced variables is inserted into the original program, this method tests the program with test cases through path relaxation, which means that it not only reports the errors revealed by the current runtime value of traced variables contained in the test case, but it also examines the errors possibly occurring under the same execution path with all the possible values of the traced variables. The effectiveness of this method is demonstrated in a case study. Compared with the traditional buffer overflow detection methods, this method reduces the burden of detection and improves efficiency.展开更多
An integer linear bilevel programming problem is firstly transformed into a binary linear bilevel programming problem, and then converted into a single-level binary implicit programming. An orthogonal genetic algorith...An integer linear bilevel programming problem is firstly transformed into a binary linear bilevel programming problem, and then converted into a single-level binary implicit programming. An orthogonal genetic algorithm is developed for solving the binary linear implicit programming problem based on the orthogonal design. The orthogonal design with the factor analysis, an experimental design method is applied to the genetic algorithm to make the algorithm more robust, statistical y sound and quickly convergent. A crossover operator formed by the orthogonal array and the factor analysis is presented. First, this crossover operator can generate a smal but representative sample of points as offspring. After al of the better genes of these offspring are selected, a best combination among these offspring is then generated. The simulation results show the effectiveness of the proposed algorithm.展开更多
A novel chaotic search method is proposed,and a hybrid algorithm combining particle swarm optimization(PSO) with this new method,called CLSPSO,is put forward to solve 14 integer and mixed integer programming problems....A novel chaotic search method is proposed,and a hybrid algorithm combining particle swarm optimization(PSO) with this new method,called CLSPSO,is put forward to solve 14 integer and mixed integer programming problems.The performances of CLSPSO are compared with those of other five hybrid algorithms combining PSO with chaotic search methods.Experimental results indicate that in terms of robustness and final convergence speed,CLSPSO is better than other five algorithms in solving many of these problems.Furthermore,CLSPSO exhibits good performance in solving two high-dimensional problems,and it finds better solutions than the known ones.A performance index(PI) is introduced to fairly compare the above six algorithms,and the obtained values of(PI) in three cases demonstrate that CLSPSO is superior to all the other five algorithms under the same conditions.展开更多
Byproduct gas is an important secondary energy in iron and steel industry, and its optimization is vital to cost reduction. With the development of iron and steel industry to be more eco-friendly, it is necessary to c...Byproduct gas is an important secondary energy in iron and steel industry, and its optimization is vital to cost reduction. With the development of iron and steel industry to be more eco-friendly, it is necessary to construct an integrated optimized system, taking economics, energy consumption and environment into consideration. Therefore, the environmental cost caused by pollutants discharge should be factored in total cost when optimizing byproduct gas distribution. A green mixed integer linear programming （MILP） model for the optimization of byproduct gases was established to reduce total cost, including both operation cost and environmental cost. The operation cost included penalty for gas deviation, costs of fuel and water consumption, holder booster trip penalty, and so forth; while the environmental cost consisted of penalties for both direct and indirect pollutants discharge. Case study showed that the proposed model brought an optimum solution and 2.2% of the total cost could be reduced compared with previous one.展开更多
The present paper proved that if λ1, λ2, λ3 are positive real numbers, λ1/λ2 is irrational. Then, the integer parts of λ1x12＋ λ2x22＋ λ3x34 are prime infinitely often for natural numbers x1, x2, x3.
The rapid development of data communication in modern era demands secure exchange of information. Steganography is an established method for hiding secret data from an unauthorized access into a cover object in such a...The rapid development of data communication in modern era demands secure exchange of information. Steganography is an established method for hiding secret data from an unauthorized access into a cover object in such a way that it is invisible to human eyes. The cover object can be image, text, audio,or video. This paper proposes a secure steganography algorithm that hides a bitstream of the secret text into the least significant bits（LSBs） of the approximation coefficients of the integer wavelet transform（IWT） of grayscale images as well as each component of color images to form stego-images. The embedding and extracting phases of the proposed steganography algorithms are performed using the MATLAB software. Invisibility, payload capacity, and security in terms of peak signal to noise ratio（PSNR） and robustness are the key challenges to steganography. The statistical distortion between the cover images and the stego-images is measured by using the mean square error（MSE） and the PSNR, while the degree of closeness between them is evaluated using the normalized cross correlation（NCC）. The experimental results show that, the proposed algorithms can hide the secret text with a large payload capacity with a high level of security and a higher invisibility. Furthermore, the proposed technique is computationally efficient and better results for both PSNR and NCC are achieved compared with the previous algorithms.展开更多
Simultaneous-source acquisition has been recog- nized as an economic and efficient acquisition method, but the direct imaging of the simultaneous-source data produces migration artifacts because of the interference of...Simultaneous-source acquisition has been recog- nized as an economic and efficient acquisition method, but the direct imaging of the simultaneous-source data produces migration artifacts because of the interference of adjacent sources. To overcome this problem, we propose the regularized least-squares reverse time migration method （RLSRTM） using the singular spectrum analysis technique that imposes sparseness constraints on the inverted model. Additionally, the difference spectrum theory of singular values is presented so that RLSRTM can be implemented adaptively to eliminate the migration artifacts. With numerical tests on a fiat layer model and a Marmousi model, we validate the superior imaging quality, efficiency and convergence of RLSRTM compared with LSRTM when dealing with simultaneoussource data, incomplete data and noisy data.展开更多
We present a method based on least-squares reverse time migration with plane-wave encoding （P-LSRTM） for rugged topography. Instead of modifying the wave field before migration, we modify the plane-wave encoding fun...We present a method based on least-squares reverse time migration with plane-wave encoding （P-LSRTM） for rugged topography. Instead of modifying the wave field before migration, we modify the plane-wave encoding function and fill constant velocity to the area above rugged topography in the model so that P-LSRTM can be directly performed from rugged surface in the way same to shot domain reverse time migration. In order to improve efficiency and reduce I/O （input/output） cost, the dynamic en- coding strategy and hybrid encoding strategy are implemented. Numerical test on SEG rugged topography model show that P-LSRTM can suppress migration artifacts in the migration image, and compensate am- plitude in the middle-deep part efficiently. Without data correction, P-LSRTM can produce a satisfying image of near-surface if we could get an accurate near-surface velocity model. Moreover, the pre-stack P- LSRTM is more robust than conventional RTM in the presence of migration velocity errors.展开更多
Production scheduling has a major impact on the productivity of the manufacturing process. Recently, scheduling problems with deteriorating jobs have attracted increasing attentions from researchers. In many practical...Production scheduling has a major impact on the productivity of the manufacturing process. Recently, scheduling problems with deteriorating jobs have attracted increasing attentions from researchers. In many practical situations,it is found that some jobs fail to be processed prior to the pre-specified thresholds,and they often consume extra deteriorating time for successful accomplishment. Their processing times can be characterized by a step-wise function. Such kinds of jobs are called step-deteriorating jobs. In this paper,parallel machine scheduling problem with stepdeteriorating jobs( PMSD) is considered. Due to its intractability,four different mixed integer programming( MIP) models are formulated for solving the problem under consideration. The study aims to investigate the performance of these models and find promising optimization formulation to solve the largest possible problem instances. The proposed four models are solved by commercial software CPLEX. Moreover,the near-optimal solutions can be obtained by black-box local-search solver LocalS olver with the fourth one. The computational results show that the efficiencies of different MIP models depend on the distribution intervals of deteriorating thresholds, and the performance of LocalS olver is clearly better than that of CPLEX in terms of the quality of the solutions and the computational time.展开更多
文摘This study proposes a novel approach to optimizing individual work schedules for book digitization using mixed-integer programming (MIP). By leveraging the power of MIP solvers, we aimed to minimize the overall digitization time while considering various constraints and process dependencies. The book digitization process involves three key steps: cutting, scanning, and binding. Each step has specific requirements and limitations such as the number of pages that can be processed simultaneously and potential bottlenecks. To address these complexities, we formulate the problem as a one-machine job shop scheduling problem with additional constraints to capture the unique characteristics of book digitization. We conducted a series of experiments to evaluate the performance of our proposed approach. By comparing the optimized schedules with the baseline approach, we demonstrated significant reductions in the overall processing time. In addition, we analyzed the impact of different weighting schemes on the optimization results, highlighting the importance of identifying and prioritizing critical processes. Our findings suggest that MIP-based optimization can be a valuable tool for improving the efficiency of individual work schedules, even in seemingly simple tasks, such as book digitization. By carefully considering specific constraints and objectives, we can save time and leverage resources by carefully considering specific constraints and objectives.
基金supported by Scientific Research and Technology Development Project of CNPC(2021DJ4002,2022DJ3908).
文摘The numerical dispersion phenomenon in the finite-difference forward modeling simulations of the wave equation significantly affects the imaging accuracy in acoustic reflection logging.This issue is particularly pronounced in the reverse time migration(RTM)method used for shear-wave(S-wave)logging imaging.This not only affects imaging accuracy but also introduces ambiguities in the interpretation of logging results.To address this challenge,this study proposes the use of a least-squares difference coefficient optimization algorithm aiming to suppress the numerical dispersion phenomenon in the RTM of S-wave reflection imaging logging.By optimizing the difference coefficients,the high-precision finite-difference algorithm serves as an effective operator for both forward and backward RTM processes.This approach is instrumental in eliminating migration illusions,which are often caused by numerical dispersion.The effectiveness of this optimized algorithm is demonstrated through numerical results,which indicate that it can achieve more accurate forward imaging results across various conditions,including high-and low-velocity strata,and is effective in both large and small spatial grids.The results of processing real data demonstrate that numerical dispersion optimization effectively reduces migration artifacts and diminishes ambiguities in logging interpretations.This optimization offers crucial technical support to the RTM method,enhancing its capability for accurately modeling and imaging S-wave reflections.
基金Supported by the National Natural Science Foundation of China(12001327,12071057)。
文摘Toric patch is a kind of rational multisided patch,which is associated with a finite integer lattice points set A.A set of weights is defined which depend on a parameter according to regular decomposition of A.When all weights of the patch tend to infinity,we obtain the limiting form of toric patch which is called its regular control surface.The diferent weights may induce the diferent regular control surfaces of the same toric patch.It prompts us to consider that how many regular control surfaces of a toric patch.In this paper,we study the regular decompositions of A by using integer programming method firstly,and then provide the relationship between all regular decompositions of A and corresponding state polytope.Moreover,we present that the number of regular control surfaces of a toric patch associated with A is equal to the number of regular decompositions of A.An algorithm to calculate the number of regular control surfaces of toric patch is provided.The algorithm also presents a method to construct all of the regular control surfaces of a toric patch.At last,the application of proposed result in shape deformation is demonstrated by several examples.
基金supported by the National Natural Science Foundation of China(No.92371206)the Postgraduate Scientific Research Innovation Project of Hunan Province,China(No.CX2023063).
文摘Satellite Component Layout Optimization(SCLO) is crucial in satellite system design.This paper proposes a novel Satellite Three-Dimensional Component Assignment and Layout Optimization(3D-SCALO) problem tailored to engineering requirements, aiming to optimize satellite heat dissipation while considering constraints on static stability, 3D geometric relationships between components, and special component positions. The 3D-SCALO problem is a challenging bilevel combinatorial optimization task, involving the optimization of discrete component assignment variables in the outer layer and continuous component position variables in the inner layer,with both influencing each other. To address this issue, first, a Mixed Integer Programming(MIP) model is proposed, which reformulates the original bilevel problem into a single-level optimization problem, enabling the exploration of a more comprehensive optimization space while avoiding iterative nested optimization. Then, to model the 3D geometric relationships between components within the MIP framework, a linearized 3D Phi-function method is proposed, which handles non-overlapping and safety distance constraints between cuboid components in an explicit and effective way. Subsequently, the Finite-Rectangle Method(FRM) is proposed to manage 3D geometric constraints for complex-shaped components by approximating them with a finite set of cuboids, extending the applicability of the geometric modeling approach. Finally, the feasibility and effectiveness of the proposed MIP model are demonstrated through two numerical examples"and a real-world engineering case, which confirms its suitability for complex-shaped components and real engineering applications.
基金The NSF(11101431 and 11201485)of Chinathe NSF(ZR2010AL020)of Shandong Province
文摘In this paper, we combine a split least-squares procedure with the method of characteristics to treat convection-dominated parabolic integro-differential equations. By selecting the least-squares functional properly, the procedure can be split into two independent sub-procedures, one of which is for the primitive unknown and the other is for the flux. Choosing projections carefully, we get optimal order H^1 （Ω） and L^2（Ω） norm error estimates for u and sub-optimal （L^2（Ω））^d norm error estimate for σ. Numerical results are presented to substantiate the validity of the theoretical results.
基金supported by the Planned Project Grant(Grant No.3502Z20199064)from the Science and Technology Bureau of Xiamen(CN)the training project(Grant No.2020GGB067)of the youth and middle-aged talents of Fujian Provincial Health Commission(CN).
文摘This study explored the application value of iterative decomposition of water and fatwith echo asymmetry and least-squares estimation(IDEAL-IQ)technology in the early diagnosis of ageing osteoporosis(OP).172 participants were enrolled and underwentmagnetic resonance imaging(MRI)examinations on a 3.0T scanner.100 cases were included in the normal group(50 males and 50 females;mean age:45 years;age range:20e84 years).33 cases were included in the osteopenia group(17 males and 16 females;mean age:55 years;age range:43e83 years).39 caseswere includedintheOP group(19males and20females;meanage:58years;age range:48 e82 years).Conventional T1WI and T2WI were first obtained,followed by 3D-IDEAL-IQ-acqui-sition.Fat fraction(FF)and apparent transverse relaxation rate(R2*)resultswere automatically calculated from IDEAL-IQ-images on the console.Based on T1Wand T2W-images,300 ROIs for each participantweremanually delineated in L1-L5 vertebral bodies of five middle slices.In each age group of all normal subjects,each parameter was significantly correlated with gender.In male participants from the normal,osteopenia,and OP groups,statistical analysis revealed F values of 11319.292 and 180.130 for comparisons involving FF and R2*values,respectively(all p<0.0001).The sensitivity and specificity of FF values were 0.906 and 0.950,0.994 and 0.997,0.865 and 0.820,respectively.For R2*,they were 0.665 and 0.616,0.563 and 0.519,0.571 and 0.368,respectively.In female participants from the normal,osteopenia,and OP-groups,statis-tical analysis revealed F values of 12461.658 and 548.274 for comparisons involving FF and R2*values,respectively(all p<0.0001).The sensitivity and specificity of FF values were 0.985 and 0.991,0.996 and 0.996,0.581 and 0.678,respectively.For R2*,they were 0.698 and 0.730,0.603 and 0.665,0.622 and 0.525,respectively.Significant differences were indicated in the quanti-tative values among the three groups.FF value had good performance,while R2*value had poor performance indiscriminatingosteopenia andOP-groups.Overall,the IDEAL-IQ techniqueoffers specific reference indices that enable noninvasive and quantitative assessment of lumbar vertebrae bone metabolism,thereby providing diagnostic information for OP.
文摘An improved method based on the Tikhonov regularization principle and the precisely known reference station coordinate is proposed to design the regularized matrix. The ill-conditioning of the normal matrix can be improved by the regularized matrix. The relative floating ambiguity can be computed only by using the data of several epochs. Combined with the LAMBDA method, the new approach can correctly and quickly fix the integer ambiguity and the success rate is 100% in experiments. Through using measured data sets from four mediumlong baselines, the new method can obtain exact ambiguities only by the Ll-frequency data of three epochs. Compared with the existing methods, the improved method can solve the ambiguities of the medium-long baseline GPS network RTK only using L1-frequency GPS data.
基金The National Key Technology R&D Program of Chinaduring the11th Five-Year Plan Period (No2008BAJ11B05)
文摘A method for integer ambiguity resolution in the global positioning system （GPS） multi-reference station network real time kinematic （RTK） is proposed. First, the barycenter of the triangle of reference stations for ambiguity resolution is taken as a reference point. The satellite which has the largest elevation angle with the reference point is selected as a reference satellite. The parameters for constructing the weight matrix of carrier phase observation and the criteria for checking the correctness of integer ambiguity resolution of a network are obtained. Then, the wide ambiguity is calculated by a linear combination method of dualband observation. And the LI ambiguity is obtained by a nonionosphere combination method. The Kalman filter is introduced to refine the floating-point solution of ambiguity and estimate the real-time tropospheric delay. Finally, the cofactor matrix of ambiguity is de-correlated by Z-transformation to reduce the searching space of the integer ambiguity solution and improve the efficiency of the least-squares ambiguity decorrelation adjustment （LAMBDA） algorithm. The experimental results show that this method can reliably obtain the integer ambiguity solution among multi-reference stations with 40 epochs.
文摘Based on the analysis to the random sear ch algorithm of LUUS, a modified random directed integer search algorithm (MRDI SA) is given for first time. And a practical example is given to show that the adva ntage of this kind of algorithm is the reliability can’t be infuenced by the ini tial value X (0) and the start search domain R (0) . Besides, i t can be applied to solve the higher dimensional constrained nonlinear integer p rogramming problem.
基金The National Natural Science Foundation of China (No.60873050,60703086)the Opening Foundation of State Key Laboratory of Software Engineering in Wuhan University (No.SKLSE20080717)
文摘A simplified integer overflow detection method based on path relaxation is described for avoiding buffer overflow triggered by integer overflow. When the integer overflow refers to the size of the buffer allocated dynamically, this kind of integer overflow is most likely to trigger buffer overflow. Based on this discovery, through lightly static program analysis, the solution traces the key variables referring to the size of a buffer allocated dynamically and it maintains the upper bound and lower bound of these variables. After the constraint information of these traced variables is inserted into the original program, this method tests the program with test cases through path relaxation, which means that it not only reports the errors revealed by the current runtime value of traced variables contained in the test case, but it also examines the errors possibly occurring under the same execution path with all the possible values of the traced variables. The effectiveness of this method is demonstrated in a case study. Compared with the traditional buffer overflow detection methods, this method reduces the burden of detection and improves efficiency.
基金supported by the Fundamental Research Funds for the Central Universities(K50511700004)the Natural Science Basic Research Plan in Shaanxi Province of China(2013JM1022)
文摘An integer linear bilevel programming problem is firstly transformed into a binary linear bilevel programming problem, and then converted into a single-level binary implicit programming. An orthogonal genetic algorithm is developed for solving the binary linear implicit programming problem based on the orthogonal design. The orthogonal design with the factor analysis, an experimental design method is applied to the genetic algorithm to make the algorithm more robust, statistical y sound and quickly convergent. A crossover operator formed by the orthogonal array and the factor analysis is presented. First, this crossover operator can generate a smal but representative sample of points as offspring. After al of the better genes of these offspring are selected, a best combination among these offspring is then generated. The simulation results show the effectiveness of the proposed algorithm.
基金Projects(50275150,61173052) supported by the National Natural Science Foundation of ChinaProject(14FJ3112) supported by the Planned Science and Technology of Hunan Province,ChinaProject(14B033) supported by Scientific Research Fund Education Department of Hunan Province,China
文摘A novel chaotic search method is proposed,and a hybrid algorithm combining particle swarm optimization(PSO) with this new method,called CLSPSO,is put forward to solve 14 integer and mixed integer programming problems.The performances of CLSPSO are compared with those of other five hybrid algorithms combining PSO with chaotic search methods.Experimental results indicate that in terms of robustness and final convergence speed,CLSPSO is better than other five algorithms in solving many of these problems.Furthermore,CLSPSO exhibits good performance in solving two high-dimensional problems,and it finds better solutions than the known ones.A performance index(PI) is introduced to fairly compare the above six algorithms,and the obtained values of(PI) in three cases demonstrate that CLSPSO is superior to all the other five algorithms under the same conditions.
基金Sponsored by Beijing Social Science Foundation of China(14JGC110)Social Science Research Common Program of Beijing Municipal Commission of Education of China(SM201510038011)CUEB Foundation of China(2014XJG005)
文摘Byproduct gas is an important secondary energy in iron and steel industry, and its optimization is vital to cost reduction. With the development of iron and steel industry to be more eco-friendly, it is necessary to construct an integrated optimized system, taking economics, energy consumption and environment into consideration. Therefore, the environmental cost caused by pollutants discharge should be factored in total cost when optimizing byproduct gas distribution. A green mixed integer linear programming （MILP） model for the optimization of byproduct gases was established to reduce total cost, including both operation cost and environmental cost. The operation cost included penalty for gas deviation, costs of fuel and water consumption, holder booster trip penalty, and so forth; while the environmental cost consisted of penalties for both direct and indirect pollutants discharge. Case study showed that the proposed model brought an optimum solution and 2.2% of the total cost could be reduced compared with previous one.
文摘The present paper proved that if λ1, λ2, λ3 are positive real numbers, λ1/λ2 is irrational. Then, the integer parts of λ1x12＋ λ2x22＋ λ3x34 are prime infinitely often for natural numbers x1, x2, x3.
文摘The rapid development of data communication in modern era demands secure exchange of information. Steganography is an established method for hiding secret data from an unauthorized access into a cover object in such a way that it is invisible to human eyes. The cover object can be image, text, audio,or video. This paper proposes a secure steganography algorithm that hides a bitstream of the secret text into the least significant bits（LSBs） of the approximation coefficients of the integer wavelet transform（IWT） of grayscale images as well as each component of color images to form stego-images. The embedding and extracting phases of the proposed steganography algorithms are performed using the MATLAB software. Invisibility, payload capacity, and security in terms of peak signal to noise ratio（PSNR） and robustness are the key challenges to steganography. The statistical distortion between the cover images and the stego-images is measured by using the mean square error（MSE） and the PSNR, while the degree of closeness between them is evaluated using the normalized cross correlation（NCC）. The experimental results show that, the proposed algorithms can hide the secret text with a large payload capacity with a high level of security and a higher invisibility. Furthermore, the proposed technique is computationally efficient and better results for both PSNR and NCC are achieved compared with the previous algorithms.
基金financial support from the National Natural Science Foundation of China (Grant Nos. 41104069, 41274124)National Key Basic Research Program of China (973 Program) (Grant No. 2014CB239006)+2 种基金National Science and Technology Major Project (Grant No. 2011ZX05014-001-008)the Open Foundation of SINOPEC Key Laboratory of Geophysics (Grant No. 33550006-15-FW2099-0033)the Fundamental Research Funds for the Central Universities (Grant No. 16CX06046A)
文摘Simultaneous-source acquisition has been recog- nized as an economic and efficient acquisition method, but the direct imaging of the simultaneous-source data produces migration artifacts because of the interference of adjacent sources. To overcome this problem, we propose the regularized least-squares reverse time migration method （RLSRTM） using the singular spectrum analysis technique that imposes sparseness constraints on the inverted model. Additionally, the difference spectrum theory of singular values is presented so that RLSRTM can be implemented adaptively to eliminate the migration artifacts. With numerical tests on a fiat layer model and a Marmousi model, we validate the superior imaging quality, efficiency and convergence of RLSRTM compared with LSRTM when dealing with simultaneoussource data, incomplete data and noisy data.
基金jointly financial support of the National 973 Project of China(Nos.2014CB239006,2011CB202402)the National Natural Science Foundation of China(Nos.41104069,41274124)+1 种基金the Shandong Natural Science Foundation of China(No.ZR2011DQ016)the Fundamental Research Funds for the Central Universities of China(No.R1401005A)
文摘We present a method based on least-squares reverse time migration with plane-wave encoding （P-LSRTM） for rugged topography. Instead of modifying the wave field before migration, we modify the plane-wave encoding function and fill constant velocity to the area above rugged topography in the model so that P-LSRTM can be directly performed from rugged surface in the way same to shot domain reverse time migration. In order to improve efficiency and reduce I/O （input/output） cost, the dynamic en- coding strategy and hybrid encoding strategy are implemented. Numerical test on SEG rugged topography model show that P-LSRTM can suppress migration artifacts in the migration image, and compensate am- plitude in the middle-deep part efficiently. Without data correction, P-LSRTM can produce a satisfying image of near-surface if we could get an accurate near-surface velocity model. Moreover, the pre-stack P- LSRTM is more robust than conventional RTM in the presence of migration velocity errors.
基金National Natural Science Foundation of China(No.51405403)the Fundamental Research Funds for the Central Universities,China(No.2682014BR019)the Scientific Research Program of Education Bureau of Sichuan Province,China(No.12ZB322)
文摘Production scheduling has a major impact on the productivity of the manufacturing process. Recently, scheduling problems with deteriorating jobs have attracted increasing attentions from researchers. In many practical situations,it is found that some jobs fail to be processed prior to the pre-specified thresholds,and they often consume extra deteriorating time for successful accomplishment. Their processing times can be characterized by a step-wise function. Such kinds of jobs are called step-deteriorating jobs. In this paper,parallel machine scheduling problem with stepdeteriorating jobs( PMSD) is considered. Due to its intractability,four different mixed integer programming( MIP) models are formulated for solving the problem under consideration. The study aims to investigate the performance of these models and find promising optimization formulation to solve the largest possible problem instances. The proposed four models are solved by commercial software CPLEX. Moreover,the near-optimal solutions can be obtained by black-box local-search solver LocalS olver with the fourth one. The computational results show that the efficiencies of different MIP models depend on the distribution intervals of deteriorating thresholds, and the performance of LocalS olver is clearly better than that of CPLEX in terms of the quality of the solutions and the computational time.
