在这篇文章中,我们讨论了数学模型1:maxf(x),x∈{x|x=(x_1,x_2,…,x_n),sum from j=1 to n a_(ij)x_j≤b_i,i=1,2,…,m,x_i≥1且为整数},其中f(x)={c_jx_j}且sum from j=1 to n aI(ij)≤b_i,并给出了模型1最大最优解的定义以及最大最优...在这篇文章中,我们讨论了数学模型1:maxf(x),x∈{x|x=(x_1,x_2,…,x_n),sum from j=1 to n a_(ij)x_j≤b_i,i=1,2,…,m,x_i≥1且为整数},其中f(x)={c_jx_j}且sum from j=1 to n aI(ij)≤b_i,并给出了模型1最大最优解的定义以及最大最优解的充分必要条件,根据该条件,我们介绍了求模型1的最大最优解的两个算法:Primal算法和Threshold算法。展开更多
The main method of casting coal spontaneous combustion is prediction of index gases, with carbon monoxide(CO) commonly used as an index gas. However, coal spontaneous combustion is not the sole source of CO evolution;...The main method of casting coal spontaneous combustion is prediction of index gases, with carbon monoxide(CO) commonly used as an index gas. However, coal spontaneous combustion is not the sole source of CO evolution; primal CO is generated through coalification, which can lead to forecasting mistakes. Through theoretical analysis, primal CO generation and emission from coal seams was determined.In this study, six coal samples were analyzed under six different experimental conditions. The results demonstrated the change in coal seam primal gas and concentration as functions of time, different coal samples, occurrence, various gas types and composition concentration, which are in agreement with the previous study on primal CO generation. Air charging impacts on primal gas emission. Analysis of the experimental data with SPSS demonstrates that the relationship between primal CO concentration and time shows a power exponent distribution.展开更多
In the present paper we present a class of polynomial primal-dual interior-point algorithms for semidefmite optimization based on a kernel function. This kernel function is not a so-called self-regular function due to...In the present paper we present a class of polynomial primal-dual interior-point algorithms for semidefmite optimization based on a kernel function. This kernel function is not a so-called self-regular function due to its growth term increasing linearly. Some new analysis tools were developed which can be used to deal with complexity ＂analysis of the algorithms which use analogous strategy in [5] to design the search directions for the Newton system. The complexity bounds for the algorithms with large- and small-update methodswere obtained, namely,O（qn^（p＋q/q（P＋1）log n/ε and O（q^2√n）log n/ε,respectlvely.展开更多
Dear editor,Primal-dual dynamics(PDD)and its variants are prominent first-order continuous-time algorithms to determine the primal and dual solutions of a constrained optimization problem(COP).Due to the simple struct...Dear editor,Primal-dual dynamics(PDD)and its variants are prominent first-order continuous-time algorithms to determine the primal and dual solutions of a constrained optimization problem(COP).Due to the simple structure,they have received widespread attention in various fields,such as distributed optimization[1],power systems[2],and wireless communication[3].In view of their wide applications,there are numerous theoretic studies on the convergence properties of PDD and its variants,including the exponential stability analysis[4]-[9].展开更多
A weakly 2-primal ring is a common generalization of a semicommutative ring, a 2-primal ring and a locally 2-primal ring. In this paper, we investigate Ore extensions over weakly 2-primal rings. Let α be an endomorph...A weakly 2-primal ring is a common generalization of a semicommutative ring, a 2-primal ring and a locally 2-primal ring. In this paper, we investigate Ore extensions over weakly 2-primal rings. Let α be an endomorphism and δ an α- derivation of a ring R. We prove that （1） If R is an （α, δ）-compatible and weakly 2-primal ring, then R[x; α, δ] is weakly semicommutative; （2） If R is （α, δ）-compatible, then R is weakly 2-primal if and only if R[x; α, δ] is weakly 2-primal.展开更多
Two existing methods for solving a class of fuzzy linear programming (FLP) problems involving symmetric trapezoidal fuzzy numbers without converting them to crisp linear programming problems are the fuzzy primal simpl...Two existing methods for solving a class of fuzzy linear programming (FLP) problems involving symmetric trapezoidal fuzzy numbers without converting them to crisp linear programming problems are the fuzzy primal simplex method proposed by Ganesan and Veeramani [1] and the fuzzy dual simplex method proposed by Ebrahimnejad and Nasseri [2]. The former method is not applicable when a primal basic feasible solution is not easily at hand and the later method needs to an initial dual basic feasible solution. In this paper, we develop a novel approach namely the primal-dual simplex algorithm to overcome mentioned shortcomings. A numerical example is given to illustrate the proposed approach.展开更多
In this paper, we propose a primal-dual interior point method for solving general constrained nonlinear programming problems. To avoid the situation that the algorithm we use may converge to a saddle point or a local ...In this paper, we propose a primal-dual interior point method for solving general constrained nonlinear programming problems. To avoid the situation that the algorithm we use may converge to a saddle point or a local maximum, we utilize a merit function to guide the iterates toward a local minimum. Especially, we add the parameter ε to the Newton system when calculating the decrease directions. The global convergence is achieved by the decrease of a merit function. Furthermore, the numerical results confirm that the algorithm can solve this kind of problems in an efficient way.展开更多
Prime integers and their generalizations play important roles in protocols for secure transmission of information via open channels of telecommunication networks. Generation of multidigit large primes in the design st...Prime integers and their generalizations play important roles in protocols for secure transmission of information via open channels of telecommunication networks. Generation of multidigit large primes in the design stage of a cryptographic system is a formidable task. Fermat primality checking is one of the simplest of all tests. Unfortunately, there are composite integers (called Carmichael numbers) that are not detectable by the Fermat test. In this paper we consider modular arithmetic based on complex integers;and provide several tests that verify the primality of real integers. Although the new tests detect most Carmichael numbers, there are a small percentage of them that escape these tests.展开更多
A primal-dual infeasible interior point algorithm for multiple objective linear programming(MOLP)problems was presented.In contrast to the current MOLP algorithm.moving through the interior of polytope but not confini...A primal-dual infeasible interior point algorithm for multiple objective linear programming(MOLP)problems was presented.In contrast to the current MOLP algorithm.moving through the interior of polytope but not confining the iterates within the feasible region in our proposed algorithm result in a solution approach that is quite different and less sensitive to problem size,so providing the potential to dramatically improve the practical computation effectiveness.展开更多
In Ovid’s story Cephisus,the river-god,forces the beautiful nymph,Liriope into love-making under the waves.She gets pregnant and gives birth to Narcissus.The mother asks seer Tiresias if her son will live to a full a...In Ovid’s story Cephisus,the river-god,forces the beautiful nymph,Liriope into love-making under the waves.She gets pregnant and gives birth to Narcissus.The mother asks seer Tiresias if her son will live to a full age;his answer is“If he doesn’t discover himself”.Narcissus reaching a fountain to drink,the mirror of the water enchants him.From this dramatic moment he cannot leave the spring.Narcissus is notable to grasp why he cannot reach the desperately desired image.In the mirror of the water he does not only see his own figure but in the waves he is confronted with the primal scene repeatedly.We argue that the image in the water reflects the coitus of his parents.It terrifies him while simultaneously he becomes envious.His discovery leads him to death.The paper is based on dreams and clinical material of a psychoanalytical case.Our concept is in accord with some of the insights about narcissism of Lacan,Kohut,and Kernberg.展开更多
In 1999, Kim and Kwak asked one question that ＂Is a ring R 2-primal if Op C P for each P ∈ mSpec（R）？＇. In this paper, we prove that if Op has the IFP for each P ∈ mSpec（N）, then OR C P for each P ∈ mSpec（N...In 1999, Kim and Kwak asked one question that ＂Is a ring R 2-primal if Op C P for each P ∈ mSpec（R）？＇. In this paper, we prove that if Op has the IFP for each P ∈ mSpec（N）, then OR C P for each P ∈ mSpec（N） if and only if N is a 2-primal near-ring and also we give characterization of 2-primal nearrings by using its minimal O-prime ideals.展开更多
To preserve the edges and details of the image,a new variational model for wavelet domain inpainting was proposed which contained a non-convex regularizer. The non-convex regularizer can utilize the local information ...To preserve the edges and details of the image,a new variational model for wavelet domain inpainting was proposed which contained a non-convex regularizer. The non-convex regularizer can utilize the local information of image and perform better than those usual convex ones. In addition, to solve the non-convex minimization problem,an iterative reweighted method and a primaldual method were designed. The numerical experiments show that the new model not only gets better visual effects but also obtains higher signal to noise ratio than the recent method.展开更多
Let R be an（α,δ）-compatible ring.It is proved that R is a 2-primal ring if and only if for every minimal prime ideal P in R[x;α,δ] there exists a minimal prime ideal P in R such that P = P [x;α,δ],and that f（...Let R be an（α,δ）-compatible ring.It is proved that R is a 2-primal ring if and only if for every minimal prime ideal P in R[x;α,δ] there exists a minimal prime ideal P in R such that P = P [x;α,δ],and that f（x） ∈ R[x;α,δ] is a unit if and only if its constant term is a unit and other coefficients are nilpotent.展开更多
This study was conducted with the objective to determine carcass traits, meat yield, and primal meat cuts of Arsi, Harar, Jersey*Horro crossbred, and Ogaden cattle breeds at Haramaya University, Ethiopia. A total of 1...This study was conducted with the objective to determine carcass traits, meat yield, and primal meat cuts of Arsi, Harar, Jersey*Horro crossbred, and Ogaden cattle breeds at Haramaya University, Ethiopia. A total of 12 bulls of four cattle breeds (3 Arsi, 3 Harar, 3 F1 Jersey*Horro crossbred and 3 Ogaden) with almost similar ages were randomly assigned to four treatments in a completely randomised design (CRD). Data on carcass traits, meat yield, and primal meat cuts were analyzed using the General Linear Model (GLM) of the Statistical Analysis Software (SAS) 9.4 version. The overall averages of live body weight, hot carcass weight, chilled carcass weight, dressing percentages based on hot carcass weight, and rib eye area of experimental cattle breeds were 215.58 kg, 102.93 kg, 99.56 kg, 47.61%, and 8.13 inch<sup>2</sup>, respectively. The hot carcass weight and chilled carcass weight of the Ogaden (136.57;133.30 kg, resp.) breed were higher (p < 0.01) compared to other experimental cattle breeds. Dressing percentages based on hot carcass weight were higher (p < 0.05) for the Ogaden (49.61%) and Arsi (49.82%) cattle breeds compared to Harar and Jersey*Horro crossbred (45.73%, 45.27%, resp.) cattle breeds. The average meat yield and proportion of meat yield of cattle breeds were 77.52 kg and 77.46%, respectively. With a linear regression coefficient of prediction (R<sup>2</sup>) ranging from 52.26% to 93.58%, primal meat cuts significantly (p dicted meat yield. In conclusion, the breed of cattle had a significant (p 0.05) influence on live body weight, hot and chilled carcass weight, dressing percentage, rib eye area, subcutaneous fat thickness, meat yield, and the weights of most primal meat cuts. The Ogaden cattle breed had a higher and better meat yield, carcass traits, and most primal meat cuts compared to other experimental cattle breeds. Furthermore, the inclusion of corn silage in the diet of fattening bulls improved the carcass and meat yield. Therefore, the performance of Ogaden cattle compared to other and previous studies suggests the possibility of using this breed for export purposes in addition to Borana and Harar cattle breeds in the future.展开更多
In this paper, we propose two new perturbation simplex variants. Solving linear programming problems without introducing artificial variables, each of the two uses the dual pivot rule to achieve primal feasibility, an...In this paper, we propose two new perturbation simplex variants. Solving linear programming problems without introducing artificial variables, each of the two uses the dual pivot rule to achieve primal feasibility, and then the primal pivot rule to achieve optimality. The second algorithm, a modification of the first, is designed to handle highly degenerate problems more efficiently. Some interesting results concerning merit of the perturbation are established. Numerical results from preliminary tests are also reported. [ABSTRACT FROM AUTHOR]展开更多
The training algorithm of classical twin support vector regression (TSVR) can be attributed to the solution of a pair of quadratic programming problems (QPPs) with inequality constraints in the dual space.However,this...The training algorithm of classical twin support vector regression (TSVR) can be attributed to the solution of a pair of quadratic programming problems (QPPs) with inequality constraints in the dual space.However,this solution is affected by time and memory constraints when dealing with large datasets.In this paper,we present a least squares version for TSVR in the primal space,termed primal least squares TSVR (PLSTSVR).By introducing the least squares method,the inequality constraints of TSVR are transformed into equality constraints.Furthermore,we attempt to directly solve the two QPPs with equality constraints in the primal space instead of the dual space;thus,we need only to solve two systems of linear equations instead of two QPPs.Experimental results on artificial and benchmark datasets show that PLSTSVR has comparable accuracy to TSVR but with considerably less computational time.We further investigate its validity in predicting the opening price of stock.展开更多
文摘在这篇文章中,我们讨论了数学模型1:maxf(x),x∈{x|x=(x_1,x_2,…,x_n),sum from j=1 to n a_(ij)x_j≤b_i,i=1,2,…,m,x_i≥1且为整数},其中f(x)={c_jx_j}且sum from j=1 to n aI(ij)≤b_i,并给出了模型1最大最优解的定义以及最大最优解的充分必要条件,根据该条件,我们介绍了求模型1的最大最优解的两个算法:Primal算法和Threshold算法。
基金provided by the National Natural Science Foundation of China(No.U1261214)
文摘The main method of casting coal spontaneous combustion is prediction of index gases, with carbon monoxide(CO) commonly used as an index gas. However, coal spontaneous combustion is not the sole source of CO evolution; primal CO is generated through coalification, which can lead to forecasting mistakes. Through theoretical analysis, primal CO generation and emission from coal seams was determined.In this study, six coal samples were analyzed under six different experimental conditions. The results demonstrated the change in coal seam primal gas and concentration as functions of time, different coal samples, occurrence, various gas types and composition concentration, which are in agreement with the previous study on primal CO generation. Air charging impacts on primal gas emission. Analysis of the experimental data with SPSS demonstrates that the relationship between primal CO concentration and time shows a power exponent distribution.
文摘In the present paper we present a class of polynomial primal-dual interior-point algorithms for semidefmite optimization based on a kernel function. This kernel function is not a so-called self-regular function due to its growth term increasing linearly. Some new analysis tools were developed which can be used to deal with complexity ＂analysis of the algorithms which use analogous strategy in [5] to design the search directions for the Newton system. The complexity bounds for the algorithms with large- and small-update methodswere obtained, namely,O（qn^（p＋q/q（P＋1）log n/ε and O（q^2√n）log n/ε,respectlvely.
文摘Dear editor,Primal-dual dynamics(PDD)and its variants are prominent first-order continuous-time algorithms to determine the primal and dual solutions of a constrained optimization problem(COP).Due to the simple structure,they have received widespread attention in various fields,such as distributed optimization[1],power systems[2],and wireless communication[3].In view of their wide applications,there are numerous theoretic studies on the convergence properties of PDD and its variants,including the exponential stability analysis[4]-[9].
基金The NSF(11071097,11101217)of Chinathe NSF(BK20141476)of Jiangsu Province
文摘A weakly 2-primal ring is a common generalization of a semicommutative ring, a 2-primal ring and a locally 2-primal ring. In this paper, we investigate Ore extensions over weakly 2-primal rings. Let α be an endomorphism and δ an α- derivation of a ring R. We prove that （1） If R is an （α, δ）-compatible and weakly 2-primal ring, then R[x; α, δ] is weakly semicommutative; （2） If R is （α, δ）-compatible, then R is weakly 2-primal if and only if R[x; α, δ] is weakly 2-primal.
文摘Two existing methods for solving a class of fuzzy linear programming (FLP) problems involving symmetric trapezoidal fuzzy numbers without converting them to crisp linear programming problems are the fuzzy primal simplex method proposed by Ganesan and Veeramani [1] and the fuzzy dual simplex method proposed by Ebrahimnejad and Nasseri [2]. The former method is not applicable when a primal basic feasible solution is not easily at hand and the later method needs to an initial dual basic feasible solution. In this paper, we develop a novel approach namely the primal-dual simplex algorithm to overcome mentioned shortcomings. A numerical example is given to illustrate the proposed approach.
文摘In this paper, we propose a primal-dual interior point method for solving general constrained nonlinear programming problems. To avoid the situation that the algorithm we use may converge to a saddle point or a local maximum, we utilize a merit function to guide the iterates toward a local minimum. Especially, we add the parameter ε to the Newton system when calculating the decrease directions. The global convergence is achieved by the decrease of a merit function. Furthermore, the numerical results confirm that the algorithm can solve this kind of problems in an efficient way.
文摘Prime integers and their generalizations play important roles in protocols for secure transmission of information via open channels of telecommunication networks. Generation of multidigit large primes in the design stage of a cryptographic system is a formidable task. Fermat primality checking is one of the simplest of all tests. Unfortunately, there are composite integers (called Carmichael numbers) that are not detectable by the Fermat test. In this paper we consider modular arithmetic based on complex integers;and provide several tests that verify the primality of real integers. Although the new tests detect most Carmichael numbers, there are a small percentage of them that escape these tests.
基金Supported by the Doctoral Educational Foundation of China of the Ministry of Education(20020486035)
文摘A primal-dual infeasible interior point algorithm for multiple objective linear programming(MOLP)problems was presented.In contrast to the current MOLP algorithm.moving through the interior of polytope but not confining the iterates within the feasible region in our proposed algorithm result in a solution approach that is quite different and less sensitive to problem size,so providing the potential to dramatically improve the practical computation effectiveness.
文摘In Ovid’s story Cephisus,the river-god,forces the beautiful nymph,Liriope into love-making under the waves.She gets pregnant and gives birth to Narcissus.The mother asks seer Tiresias if her son will live to a full age;his answer is“If he doesn’t discover himself”.Narcissus reaching a fountain to drink,the mirror of the water enchants him.From this dramatic moment he cannot leave the spring.Narcissus is notable to grasp why he cannot reach the desperately desired image.In the mirror of the water he does not only see his own figure but in the waves he is confronted with the primal scene repeatedly.We argue that the image in the water reflects the coitus of his parents.It terrifies him while simultaneously he becomes envious.His discovery leads him to death.The paper is based on dreams and clinical material of a psychoanalytical case.Our concept is in accord with some of the insights about narcissism of Lacan,Kohut,and Kernberg.
文摘In 1999, Kim and Kwak asked one question that ＂Is a ring R 2-primal if Op C P for each P ∈ mSpec（R）？＇. In this paper, we prove that if Op has the IFP for each P ∈ mSpec（N）, then OR C P for each P ∈ mSpec（N） if and only if N is a 2-primal near-ring and also we give characterization of 2-primal nearrings by using its minimal O-prime ideals.
基金National Natural Science Foundations of China(Nos.61301229,61101208)Doctoral Research Funds of Henan University of Science and Technology,China(Nos.09001708,09001751)
文摘To preserve the edges and details of the image,a new variational model for wavelet domain inpainting was proposed which contained a non-convex regularizer. The non-convex regularizer can utilize the local information of image and perform better than those usual convex ones. In addition, to solve the non-convex minimization problem,an iterative reweighted method and a primaldual method were designed. The numerical experiments show that the new model not only gets better visual effects but also obtains higher signal to noise ratio than the recent method.
基金Supported by the Natural Foundation of Shandong Province in China(Grant No.ZR2013AL013)
文摘Let R be an（α,δ）-compatible ring.It is proved that R is a 2-primal ring if and only if for every minimal prime ideal P in R[x;α,δ] there exists a minimal prime ideal P in R such that P = P [x;α,δ],and that f（x） ∈ R[x;α,δ] is a unit if and only if its constant term is a unit and other coefficients are nilpotent.
文摘This study was conducted with the objective to determine carcass traits, meat yield, and primal meat cuts of Arsi, Harar, Jersey*Horro crossbred, and Ogaden cattle breeds at Haramaya University, Ethiopia. A total of 12 bulls of four cattle breeds (3 Arsi, 3 Harar, 3 F1 Jersey*Horro crossbred and 3 Ogaden) with almost similar ages were randomly assigned to four treatments in a completely randomised design (CRD). Data on carcass traits, meat yield, and primal meat cuts were analyzed using the General Linear Model (GLM) of the Statistical Analysis Software (SAS) 9.4 version. The overall averages of live body weight, hot carcass weight, chilled carcass weight, dressing percentages based on hot carcass weight, and rib eye area of experimental cattle breeds were 215.58 kg, 102.93 kg, 99.56 kg, 47.61%, and 8.13 inch<sup>2</sup>, respectively. The hot carcass weight and chilled carcass weight of the Ogaden (136.57;133.30 kg, resp.) breed were higher (p < 0.01) compared to other experimental cattle breeds. Dressing percentages based on hot carcass weight were higher (p < 0.05) for the Ogaden (49.61%) and Arsi (49.82%) cattle breeds compared to Harar and Jersey*Horro crossbred (45.73%, 45.27%, resp.) cattle breeds. The average meat yield and proportion of meat yield of cattle breeds were 77.52 kg and 77.46%, respectively. With a linear regression coefficient of prediction (R<sup>2</sup>) ranging from 52.26% to 93.58%, primal meat cuts significantly (p dicted meat yield. In conclusion, the breed of cattle had a significant (p 0.05) influence on live body weight, hot and chilled carcass weight, dressing percentage, rib eye area, subcutaneous fat thickness, meat yield, and the weights of most primal meat cuts. The Ogaden cattle breed had a higher and better meat yield, carcass traits, and most primal meat cuts compared to other experimental cattle breeds. Furthermore, the inclusion of corn silage in the diet of fattening bulls improved the carcass and meat yield. Therefore, the performance of Ogaden cattle compared to other and previous studies suggests the possibility of using this breed for export purposes in addition to Borana and Harar cattle breeds in the future.
文摘In this paper, we propose two new perturbation simplex variants. Solving linear programming problems without introducing artificial variables, each of the two uses the dual pivot rule to achieve primal feasibility, and then the primal pivot rule to achieve optimality. The second algorithm, a modification of the first, is designed to handle highly degenerate problems more efficiently. Some interesting results concerning merit of the perturbation are established. Numerical results from preliminary tests are also reported. [ABSTRACT FROM AUTHOR]
基金supported by the National Basic Research Program (973) of China(No.2013CB329502)the National Natural Science Foundation of China(No.61379101)the Fundamental Research Funds for the Central Universities,China(No.2012LWB39)
文摘The training algorithm of classical twin support vector regression (TSVR) can be attributed to the solution of a pair of quadratic programming problems (QPPs) with inequality constraints in the dual space.However,this solution is affected by time and memory constraints when dealing with large datasets.In this paper,we present a least squares version for TSVR in the primal space,termed primal least squares TSVR (PLSTSVR).By introducing the least squares method,the inequality constraints of TSVR are transformed into equality constraints.Furthermore,we attempt to directly solve the two QPPs with equality constraints in the primal space instead of the dual space;thus,we need only to solve two systems of linear equations instead of two QPPs.Experimental results on artificial and benchmark datasets show that PLSTSVR has comparable accuracy to TSVR but with considerably less computational time.We further investigate its validity in predicting the opening price of stock.
