Abstract: This paper uses the analytic hierarchy process to study the execution effect of the minimum purchase price of grain in different regions and various grain crops. Firstly, for different regions, five indicators including grain yield, grain sown area, gross agricultural production, grain consumption price index, and disposable income of rural residents were selected to construct an evaluation index system. We collect data of six provinces including Hebei Province, Heilongjiang Province and Shandong Province from 2006 to 2017. Then, the judgment matrix is constructed, and the hierarchical single ordering and consistency test are carried out to determine the scoring standard for the minimum purchase price of grain. The ranking of the execution effect from high to low is: Heilongjiang Province, Shandong Province, Hebei Province, Guizhou Province, Shaanxi Province, and Guangdong Province. Secondly, taking Shandong Province as an example, we collect the relevant data of sown area and yield of cereals, beans, potatoes and other crops from 2006 to 2017. The weight of area and yield index is determined by expert scoring method. And the average sown area and yield of cereals, beans and potatoes in 2006-2017 were calculated, respectively. On this basis, according to the sum of products of weights and mean values, the execution effects of different grain crops are determined. It turns out that among the cereals, the minimum purchase price had the best execution effect on paddy, followed by wheat and finally maize. Moreover, among major categories of crops, cereals perform best, followed by beans and finally potatoes. Lastly, countermeasures are proposed for different regions, various categories of crops, and different crops of the same category.
Abstract: In this paper, a frequency-dependent and tunable phase shifter is proposed and numerically analyzed. The key devices are the dual-polarization binary phase shift keying modulator (DP-BPSK) and the fiber Bragg grating (FBG). The phase-frequency response of the FBG is employed to determine the frequency-dependent phase shift. The simulation results show that a linear phase shift of the recovered output microwave signal which depends on the frequency of the input RF signal is achieved. In addition, by adjusting the power of the RF signal, the full range phase shift from 0° to 360° can be realized. This structure shows the spurious free dynamic range (SFDR) of 70.90 dB·Hz2/3 and 72.11 dB·Hz2/3 under different RF powers.
Abstract: Based on the conjugate gradient (CG) algorithm, the constrained matrix equation AXB=C and the associate optimal approximation problem are considered for the symmetric arrowhead matrix solutions in the premise of consistency. The convergence results of the method are presented. At last, a numerical example is given to illustrate the efficiency of this method.
Abstract: In this paper, according to the classical algorithm
LSQR for solving the least-squares problem, an iterative method is
proposed for least-squares solution of constrained matrix equation. By
using the Kronecker product, the matrix-form LSQR is presented to
obtain the like-minimum norm and minimum norm solutions in a
constrained matrix set for the symmetric arrowhead matrices. Finally,
numerical examples are also given to investigate the performance.
Abstract: The restrained construction zoning, an important part
in the urban master plan, is a necessary planning tool to control the city
sprawl, to guarantee the reservation implementation of the various
types of protective elements, and to realize the storage of the essential
urban spatial resources. Simultaneously, owing to the diverse
constitutes of restrained construction area and the various stakeholders
involved in, its planning requires an overall consideration of all
elements from the perspective of coordination+, balance and
practicability to deal with the problems and conflicts in this process.
Taking Yangzijin Ecological Restrained Construction Area in
Yangzhou as an example, this study analyzes all the potential actors,
agencies and stakeholders in this restrained construction area, as well
as the relevant conflicts between each other. Besides, this study tries to
build up a planning procedure based on the framework of governance
theory, and proposes a possible planning method that combines
"rigidity" and "flexibility" to protect the ecological limitation
boundary, to take every interest into account, and to promote economic
development in a harmonious society.
Abstract: An inversion-free iterative algorithm is presented for
solving nonlinear matrix equation with a stepsize parameter t. The
existence of the maximal solution is discussed in detail, and the
method for finding it is proposed. Finally, two numerical examples
are reported that show the efficiency of the method.
Abstract: By the real representation of the quaternionic matrix,
an iterative method for quaternionic linear equations Ax = b is
proposed. Then the convergence conditions are obtained. At last, a
numerical example is given to illustrate the efficiency of this method.
Abstract: Two optimized strategies were successfully established
to develop biomolecule-based magnetic nanoassemblies.
Streptavidin-coated and amine-coated magnetic nanoparticles were
chosen as model scaffolds onto which double-stranded DNA and
human immunoglobulin G were specifically conjugated in succession,
using biotin-streptavidin interaction or covalent cross-linkers. The
success of this study opens the prospect of developing selective and
sensitive nanoparticle-based structures for diagnostics or drug
delivery.
Abstract: Text similarity measurement is a fundamental issue in
many textual applications such as document clustering, classification,
summarization and question answering. However, prevailing approaches
based on Vector Space Model (VSM) more or less suffer
from the limitation of Bag of Words (BOW), which ignores the semantic
relationship among words. Enriching document representation
with background knowledge from Wikipedia is proven to be an effective
way to solve this problem, but most existing methods still
cannot avoid similar flaws of BOW in a new vector space. In this
paper, we propose a novel text similarity measurement which goes
beyond VSM and can find semantic affinity between documents.
Specifically, it is a unified graph model that exploits Wikipedia as
background knowledge and synthesizes both document representation
and similarity computation. The experimental results on two different
datasets show that our approach significantly improves VSM-based
methods in both text clustering and classification.
Abstract: An inverse problem of doubly center matrices is discussed. By translating the constrained problem into unconstrained problem, two iterative methods are proposed. A numerical example illustrate our algorithms.
Abstract: This paper addresses the controller synthesis problem of discrete-time switched positive systems with bounded time-varying delays. Based on the switched copositive Lyapunov function approach, some necessary and sufficient conditions for the existence of state-feedback controller are presented as a set of linear programming and linear matrix inequality problems, hence easy to be verified. Another advantage is that the state-feedback law is independent on time-varying delays and initial conditions. A numerical example is provided to illustrate the effectiveness and feasibility of the developed controller.
Abstract: Based on the classical algorithm LSQR for solving (unconstrained) LS problem, an iterative method is proposed for the least-squares like-minimum-norm symmetric solution of AXB+CYD=E. As the application of this algorithm, an iterative method for the least-squares like-minimum-norm biymmetric solution of AXB=E is also obtained. Numerical results are reported that show the efficiency of the proposed methods.
Abstract: Many exist studies always use Markov decision
processes (MDPs) in modeling optimal route choice in
stochastic, time-varying networks. However, taking many
variable traffic data and transforming them into optimal route
decision is a computational challenge by employing MDPs in
real transportation networks. In this paper we model finite
horizon MDPs using directed hypergraphs. It is shown that the
problem of route choice in stochastic, time-varying networks
can be formulated as a minimum cost hyperpath problem, and
it also can be solved in linear time. We finally demonstrate the
significant computational advantages of the introduced
methods.
Abstract: This paper attempts to discuss the evolution of the
retrieval techniques focusing on development, challenges and trends
of the image retrieval. It highlights both the already addressed and
outstanding issues. The explosive growth of image data leads to the
need of research and development of Image Retrieval. However,
Image retrieval researches are moving from keyword, to low level
features and to semantic features. Drive towards semantic features is
due to the problem of the keywords which can be very subjective and
time consuming while low level features cannot always describe high
level concepts in the users- mind.
Abstract: The real representation of the quaternionic matrix is
definited and studied. The relations between the positive (semi)define
quaternionic matrix and its real representation matrix are presented.
By means of the real representation, the relation between the positive
(semi)definite solutions of quaternionic matrix equations and those of
corresponding real matrix equations is established.
Abstract: The paper presents a detailed calculation of characteristic of five different topology permanent magnet machines for high performance traction including hybrid -electric vehicles using finite element analysis (FEA) method. These machines include V-shape single layer interior PM, W-shape single-layer interior PM, Segment interior PM and surface PM on the rotor and with distributed winding on the stator. The performance characteristics which include the back-emf voltage and its harmonic, magnet mass, iron loss and ripple torque are compared and analyzed. One of a 7.5kW IPM prototype was tested and verified finite-element analysis results. The aim of the paper is given some guidance and reference for machine designer which are interested in IPM machine selection for high performance traction application.
Abstract: This work proposes a novel market-based air traffic flow control model considering competitive airlines in air traffic network. In the flow model, an agent based framework for resources (link/time pair) pricing is described. Resource agent and auctioneer for groups of resources are also introduced to simulate the flow management in Air Traffic Control (ATC). Secondly, the distributed group pricing algorithm is introduced, which efficiently reflect the competitive nature of the airline industry. Resources in the system are grouped according to the degree of interaction, and each auctioneer adjust s the price of one group of resources respectively until the excess demand of resources becomes zero when the demand and supply of resources of the system changes. Numerical simulation results show the feasibility of solving the air traffic flow control problem using market mechanism and pricing algorithms on the air traffic network.
Abstract: A novel path planning approach is presented to solve
optimal path in stochastic, time-varying networks under priori traffic
information. Most existing studies make use of dynamic programming
to find optimal path. However, those methods are proved to
be unable to obtain global optimal value, moreover, how to design
efficient algorithms is also another challenge.
This paper employs a decision theoretic framework for defining
optimal path: for a given source S and destination D in urban transit
network, we seek an S - D path of lowest expected travel time
where its link travel times are discrete random variables. To solve
deficiency caused by the methods of dynamic programming, such as
curse of dimensionality and violation of optimal principle, an integer
programming model is built to realize assignment of discrete travel
time variables to arcs. Simultaneously, pruning techniques are also
applied to reduce computation complexity in the algorithm. The final
experiments show the feasibility of the novel approach.