期刊文献+
共找到9,903篇文章
< 1 2 250 >
每页显示 20 50 100
Event-Triggered Bipartite Consensus Tracking and Vibration Control of Flexible Timoshenko Manipulators Under Time-Varying Actuator Faults
1
作者 Xiangqian Yao Hao Sun +1 位作者 Zhijia Zhao Yu Liu 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2024年第5期1190-1201,共12页
For bipartite angle consensus tracking and vibration suppression of multiple Timoshenko manipulator systems with time-varying actuator faults,parameter and modeling uncertainties,and unknown disturbances,a novel distr... For bipartite angle consensus tracking and vibration suppression of multiple Timoshenko manipulator systems with time-varying actuator faults,parameter and modeling uncertainties,and unknown disturbances,a novel distributed boundary event-triggered control strategy is proposed in this work.In contrast to the earlier findings,time-varying consensus tracking and actuator defects are taken into account simultaneously.In addition,the constructed event-triggered control mechanism can achieve a more flexible design because it is not required to satisfy the input-to-state condition.To achieve the control objectives,some new integral control variables are given by using back-stepping technique and boundary control.Moreover,adaptive neural networks are applied to estimate system uncertainties.With the proposed event-triggered scheme,control inputs can reduce unnecessary updates.Besides,tracking errors and vibration states of the closed-looped network can be exponentially convergent into some small fields,and Zeno behaviors can be excluded.At last,some simulation examples are given to state the effectiveness of the control algorithms. 展开更多
关键词 VIBRATION satisfy bipartite
下载PDF
Bipartite consensus problems of Lurie multi-agent systems over signed graphs: A contraction approach
2
作者 张晓娇 吴祥 《Chinese Physics B》 SCIE EI CAS CSCD 2024年第7期137-145,共9页
This paper examines the bipartite consensus problems for the nonlinear multi-agent systems in Lurie dynamics form with cooperative and competitive communication between different agents. Based on the contraction theor... This paper examines the bipartite consensus problems for the nonlinear multi-agent systems in Lurie dynamics form with cooperative and competitive communication between different agents. Based on the contraction theory, some new conditions for the nonlinear Lurie multi-agent systems reaching bipartite leaderless consensus and bipartite tracking consensus are presented. Compared with the traditional methods, this approach degrades the dimensions of the conditions, eliminates some restrictions of the system matrix, and extends the range of the nonlinear function. Finally, two numerical examples are provided to illustrate the efficiency of our results. 展开更多
关键词 contraction theory virtual system bipartite consensus Lurie multi-agent systems
下载PDF
Perfect 1-k Matchings of Bipartite Graphs
3
作者 Wenduan Dai Yan Liu Yanfang Wu 《Open Journal of Discrete Mathematics》 2024年第4期43-53,共11页
Let k be a positive integer and G a bipartite graph with bipartition (X,Y). A perfect 1-k matching is an edge subset M of G such that each vertex in Y is incident with exactly one edge in M and each vertex in X is inc... Let k be a positive integer and G a bipartite graph with bipartition (X,Y). A perfect 1-k matching is an edge subset M of G such that each vertex in Y is incident with exactly one edge in M and each vertex in X is incident with exactly k edges in M. A perfect 1-k matching is an optimal semi-matching related to the load-balancing problem, where a semi-matching is an edge subset M such that each vertex in Y is incident with exactly one edge in M, and a vertex in X can be incident with an arbitrary number of edges in M. In this paper, we give three sufficient and necessary conditions for the existence of perfect 1-k matchings and for the existence of 1-k matchings covering | X |−dvertices in X, respectively, and characterize k-elementary bipartite graph which is a graph such that the subgraph induced by all k-allowed edges is connected, where an edge is k-allowed if it is contained in a perfect 1-k matching. 展开更多
关键词 bipartite Graph Semi-Matching Perfect 1-k Matching k-Elementary Graph
下载PDF
A New Proof on the Bipartite Turán Number of Bipartite Graphs
4
作者 Shiqian Wang 《Engineering(科研)》 2024年第9期301-308,共8页
The bipartite Turán number of a graph H, denoted by ex(m,n;H), is the maximum number of edges in any bipartite graph G=(A,B;E(G))with | A |=mand | B |=nwhich does not contain H as a subgraph. Whenmin{ m,n }>2t... The bipartite Turán number of a graph H, denoted by ex(m,n;H), is the maximum number of edges in any bipartite graph G=(A,B;E(G))with | A |=mand | B |=nwhich does not contain H as a subgraph. Whenmin{ m,n }>2t, the problem of determining the value of ex(m,n;Km−t,n−t)has been solved by Balbuena et al. in 2007, whose proof focuses on the structural analysis of bipartite graphs. In this paper, we provide a new proof on the value of ex(m,n;Km−t,n−t)by virtue of algebra method with the tool of adjacency matrices of bipartite graphs, which is inspired by the method using { 0,1 }-matrices due to Zarankiewicz [Problem P 101. Colloquium Mathematicum, 2(1951), 301]. 展开更多
关键词 bipartite Turán Number Adjacency Matrix Zarankiewicz Problem
下载PDF
Distributed Adaptive Predefined-Time Bipartite Containment Algorithm for Nonlinear Multi-Agent Systems with Actuator Faults
5
作者 Honghao Wu 《Journal of Electronic Research and Application》 2024年第6期15-25,共11页
Distributed adaptive predefined-time bipartite containment for a class of second-order nonlinear multi-agent systems are studied with actuator faults.The communication topology of multi-agent systems is fixed and dire... Distributed adaptive predefined-time bipartite containment for a class of second-order nonlinear multi-agent systems are studied with actuator faults.The communication topology of multi-agent systems is fixed and directed.To ensure that followers can reach the convex hull spanned by leaders under the conditions of actuator faults,the sliding mode method is introduced.Control protocol for multi-agent systems demonstrates its effectiveness.Finally,simulations are provided to verify the effectiveness of the proposed algorithm. 展开更多
关键词 Actuator faults Adaptive bipartite containment control Nonlinear multi-agent systems Predefined-time
下载PDF
Practical bipartite consensus for multi-agent systems:A barrier function-based adaptive sliding-mode control approach 被引量:3
6
作者 Boda Ning Qing-Long Han Xiaohua Ge 《Journal of Automation and Intelligence》 2023年第1期14-19,共6页
This paper is concerned with bipartite consensus tracking for multi-agent systems with unknown disturbances.A barrier function-based adaptive sliding-mode control(SMC)approach is proposed such that the bipartite stead... This paper is concerned with bipartite consensus tracking for multi-agent systems with unknown disturbances.A barrier function-based adaptive sliding-mode control(SMC)approach is proposed such that the bipartite steady-state error is converged to a predefined region of zero in finite time.Specifically,based on an error auxiliary taking neighboring antagonistic interactions into account,an SMC law is designed with an adaptive gain.The gain can switch to a positive semi-definite barrier function to ensure that the error auxiliary is constrained to a predefined neighborhood of zero,which in turn guarantees practical bipartite consensus tracking.A distinguished feature of the proposed controller is its independence on the bound of disturbances,while the input chattering phenomenon is alleviated.Finally,a numerical example is provided to verify the effectiveness of the proposed controller. 展开更多
关键词 Barrier functions Practical bipartite consensus Multi-agent systems Signed graphs Sliding-mode control
下载PDF
Cycle Multiplicity of Total Graph of Complete Bipartite Graph
7
作者 Ganghua Xie Yinkui Li 《Open Journal of Discrete Mathematics》 2023年第4期95-99,共5页
Cycle multiplicity of a graph G is the maximum number of edge disjoint cycles in G. In this paper, we determine the cycle multiplicity of and then obtain the formula of cycle multiplicity of total graph of complete bi... Cycle multiplicity of a graph G is the maximum number of edge disjoint cycles in G. In this paper, we determine the cycle multiplicity of and then obtain the formula of cycle multiplicity of total graph of complete bipartite graph, this generalizes the result for, which is given by M.M. Akbar Ali in [1]. 展开更多
关键词 Cycle Multiplicity Complete bipartite Graph Total Graph
下载PDF
Event-Triggered Asymmetric Bipartite Consensus Tracking for Nonlinear Multi-Agent Systems Based on Model-Free Adaptive Control
8
作者 Jiaqi Liang Xuhui Bu +1 位作者 Lizhi Cui Zhongsheng Hou 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2023年第3期662-672,共11页
In this paper,an asymmetric bipartite consensus problem for the nonlinear multi-agent systems with cooperative and antagonistic interactions is studied under the event-triggered mechanism.For the agents described by a... In this paper,an asymmetric bipartite consensus problem for the nonlinear multi-agent systems with cooperative and antagonistic interactions is studied under the event-triggered mechanism.For the agents described by a structurally balanced signed digraph,the asymmetric bipartite consensus objective is firstly defined,assigning the agents'output to different signs and module values.Considering with the completely unknown dynamics of the agents,a novel event-triggered model-free adaptive bipartite control protocol is designed based on the agents'triggered outputs and an equivalent compact form data model.By utilizing the Lyapunov analysis method,the threshold of the triggering condition is obtained.Subsequently,the asymptotic convergence of the tracking error is deduced and a sufficient condition is obtained based on the contraction mapping principle.Finally,the simulation example further demonstrates the effectiveness of the protocol. 展开更多
关键词 Asymmetric bipartite consensus tracking eventtriggered model-free adaptive control(MFAC) nonlinear systems signed digraph
下载PDF
The Evolving Bipartite Network and Semi-Bipartite Network Models with Adjustable Scale and Hybrid Attachment Mechanisms
9
作者 Peng Zuo Zhen Jia 《Open Journal of Applied Sciences》 2023年第10期1689-1703,共15页
The bipartite graph structure exists in the connections of many objects in the real world, and the evolving modeling is a good method to describe and understand the generation and evolution within various real complex... The bipartite graph structure exists in the connections of many objects in the real world, and the evolving modeling is a good method to describe and understand the generation and evolution within various real complex networks. Previous bipartite models were proposed to mostly explain the principle of attachments, and ignored the diverse growth speed of nodes of sets in different bipartite networks. In this paper, we propose an evolving bipartite network model with adjustable node scale and hybrid attachment mechanisms, which uses different probability parameters to control the scale of two disjoint sets of nodes and the preference strength of hybrid attachment respectively. The results show that the degree distribution of single set in the proposed model follows a shifted power-law distribution when parameter r and s are not equal to 0, or exponential distribution when r or s is equal to 0. Furthermore, we extend the previous model to a semi-bipartite network model, which embeds more user association information into the internal network, so that the model is capable of carrying and revealing more deep information of each user in the network. The simulation results of two models are in good agreement with the empirical data, which verifies that the models have a good performance on real networks from the perspective of degree distribution. We believe these two models are valuable for an explanation of the origin and growth of bipartite systems that truly exist. 展开更多
关键词 bipartite Networks Evolving Model Semi-bipartite Networks Hybrid Attachment Degree Distribution
下载PDF
Hybrid Duodenal Transit Bipartition: An Endoscopic and Laparoscopic Metabolic Procedure
10
作者 Paulo Reis Rizzo Esselin de Melo Anna Carolina Hoff +8 位作者 Ricardo Zorron Victor Ramos Mussa Dib Carlos Augusto Scussel Madalosso Rui Ribeiro Thonya Cruz Braga Fernando Reis Esselin Melo Paula Volpe Carlos Eduardo Domene Antonio Torres 《Surgical Science》 2024年第10期547-564,共18页
Obesity has been increasing significantly in Brazil and worldwide, becoming a major public health issue. Traditional prevention and treatment strategies, including behavioral interventions, nutritional modifications, ... Obesity has been increasing significantly in Brazil and worldwide, becoming a major public health issue. Traditional prevention and treatment strategies, including behavioral interventions, nutritional modifications, physical activity, pharmacotherapy, and metabolic/bariatric procedures, have proven insufficient to reverse this trend. Bariatric surgery is recognized as the most effective treatment for obesity and its comorbidities, but it carries potential long-term risks. Hybrid Duodenal Transit Bipartition is proposed as a minimally invasive “endobariatric” procedure combining endoscopic sleeve gastroplasty (ESG) with laparoscopic duodenoileal or distal duodenojejunal anastomosis. The main objective of this study is to demonstrate the importance of the intestinal metabolic component of hybrid duodenal transit bipartition. This intestinal component is responsible for optimizing and attempting to maintain weight loss and control comorbidities from an ESG through the incretin stimulus generated by the early arrival of food in the ileum or distal jejunum (duodenoileal or distal duodenojejunal anastomosis). Additionally, it is a minimally invasive procedure that preserves the entire digestive system and does not involve gastrointestinal exclusion, allowing for endoscopic and nutritional access. To date, only one patient has undergone the hybrid duodenal bipartition procedure, with satisfactory early postoperative results at 60 days and weight loss exceeding the scientific literature on patients who underwent isolated endoscopic sleeve gastroplasty. Further studies are needed to validate these results and assess the long-term metabolic benefits of this new approach. 展开更多
关键词 Duodenal Switch Duodenal Transit bipartition Bariatric Surgery Metabolic Surgery Endoscopic Gastroplasty Endobariatric
下载PDF
On the Dilemma of Contemporary Liberal Theory of Moral Rights for Penalty Justification——Exemplified by the Right to Personal Liberty
11
作者 ZHANG Fengming LIU Zuoyong 《The Journal of Human Rights》 2024年第4期951-975,共25页
Contemporary liberal theory on moral rights argues that moral rights associated with personal liberty constitute a strong constraint on the boundaries of state power.Therefore,the core issue of the penalty justificati... Contemporary liberal theory on moral rights argues that moral rights associated with personal liberty constitute a strong constraint on the boundaries of state power.Therefore,the core issue of the penalty justification is not the purpose of the penalty,but the reason for the penalty to refrain from infringing on the moral rights of individuals.In order to justify the penal system,scholars have explored solutions such as limiting the content of rights,waiving rights,and finally rights forfeiture.However,the concept of rights forfeiture cannot be reasonably integrated into the framework of the liberal theory of moral rights.The failure of these attempts stems from the patchwork understanding of rights presupposed by the liberal theory of moral rights.There is another systematic way of understanding rights that offers a better justification.Individual rights are not an independent non-derivative moral justification,and both individual rights and the penal power of the state are only part of a specific(realistic or ideal)system of rules that collectively serve certain values.The real question of penalty justification is not why the punishment does not infringe on the moral rights of individuals,but whether the overall institutional arrangements,including the penal system,are justifiable for all citizens,including the punished. 展开更多
关键词 moral rights penalty justification consent forfeiture DEPRIVATION
下载PDF
Vertex-distinguishing E-total Coloring of Complete Bipartite Graph K 7,n when7≤n≤95 被引量:14
12
作者 chen xiang-en du xian-kun 《Communications in Mathematical Research》 CSCD 2016年第4期359-374,共16页
Let G be a simple graph. A total coloring f of G is called an E-total coloring if no two adjacent vertices of G receive the same color, and no edge of G receives the same color as one of its endpoints.... Let G be a simple graph. A total coloring f of G is called an E-total coloring if no two adjacent vertices of G receive the same color, and no edge of G receives the same color as one of its endpoints. For an E-total coloring f of a graph G and any vertex x of G, let C(x) denote the set of colors of vertex x and of the edges incident with x, we call C(x) the color set of x. If C(u) ≠ C(v) for any two different vertices u and v of V (G), then we say that f is a vertex-distinguishing E-total coloring of G or a VDET coloring of G for short. The minimum number of colors required for a VDET coloring of G is denoted by Хvt^e(G) and is called the VDE T chromatic number of G. The VDET coloring of complete bipartite graph K7,n (7 ≤ n ≤ 95) is discussed in this paper and the VDET chromatic number of K7,n (7 ≤ n ≤ 95) has been obtained. 展开更多
关键词 GRAPH complete bipartite graph E-total coloring vertex-distinguishingE-total coloring vertex-distinguishing E-total chromatic number
下载PDF
K_(1,p)~k-FACTORIZATION OF COMPLETE BIPARTITE GRAPHS 被引量:3
13
作者 Du BeiliangDept.ofMath.,SuzhouUniv.,Suzhou215006.E-mail:dubl@pub.sz.jsinfo.ne 《Applied Mathematics(A Journal of Chinese Universities)》 SCIE CSCD 2001年第2期107-110,共4页
In this paper, it is shown that a sufficient condition for the existence of a K 1,p k factorization of K m,n , whenever p is a prime number and k is a positive integer, is (1) m≤p kn,(2... In this paper, it is shown that a sufficient condition for the existence of a K 1,p k factorization of K m,n , whenever p is a prime number and k is a positive integer, is (1) m≤p kn,(2) n≤p km,(3)p kn-m≡p km-n ≡0(mod( p 2k -1 )) and (4) (p kn-m)(p km-n) ≡0(mod( p k -1)p k×(p 2k -1)(m+n)) . 展开更多
关键词 bipartite graph FACTOR factorization.
下载PDF
ORTHOGONAL (g,f)-FACTORIZAFIONS OF BIPARTITE GRAPHS 被引量:3
14
作者 刘桂真 董鹤年 《Acta Mathematica Scientia》 SCIE CSCD 2001年第3期316-322,共7页
Let G be a bipartite graph with vertex set V(G) and edge set E(G), and let g and f be two positive integer-valued functions defined on V(G) such that g(x) ≤ f(x) for every vertex x of V(G). Then a (g, f)-factor of G ... Let G be a bipartite graph with vertex set V(G) and edge set E(G), and let g and f be two positive integer-valued functions defined on V(G) such that g(x) ≤ f(x) for every vertex x of V(G). Then a (g, f)-factor of G is a spanning subgraph H of G such that g(x) ≤ dH(x) 5 f(x) for each x ∈ V(H). A (g, f)-factorization of G is a partition of E(G) into edge-disjoint (g, f)-factors. Let F = {F1, F2,…… , Fm } and H be a factorization and a subgraph of G, respectively. If F, 1 ≤ i ≤ m, has exactly one edge in common with H, then it is said that ■ is orthogonal to H. It is proved that every bipartite (mg + m - 1, mf - m + 1 )-graph G has a (g, f)-factorization orthogonal to k vertex disjoint m-subgraphs of G if 2-k ≤ g(x) for all x ∈ V(G). Furthermore, it is showed that the results in this paper are best possible. 展开更多
关键词 bipartite graph (g f)-factor orthogonal factorization
下载PDF
Signed Roman (Total) Domination Numbers of Complete Bipartite Graphs and Wheels 被引量:4
15
作者 ZHAO YAN-CAI MIAO LIAN-YING Du Xian-kun 《Communications in Mathematical Research》 CSCD 2017年第4期318-326,共9页
A signed(res. signed total) Roman dominating function, SRDF(res.STRDF) for short, of a graph G =(V, E) is a function f : V → {-1, 1, 2} satisfying the conditions that(i)∑v∈N[v]f(v) ≥ 1(res.∑v∈N(v)f(v) ≥ 1) for ... A signed(res. signed total) Roman dominating function, SRDF(res.STRDF) for short, of a graph G =(V, E) is a function f : V → {-1, 1, 2} satisfying the conditions that(i)∑v∈N[v]f(v) ≥ 1(res.∑v∈N(v)f(v) ≥ 1) for any v ∈ V, where N [v] is the closed neighborhood and N(v) is the neighborhood of v, and(ii) every vertex v for which f(v) =-1 is adjacent to a vertex u for which f(u) = 2. The weight of a SRDF(res. STRDF) is the sum of its function values over all vertices.The signed(res. signed total) Roman domination number of G is the minimum weight among all signed(res. signed total) Roman dominating functions of G. In this paper,we compute the exact values of the signed(res. signed total) Roman domination numbers of complete bipartite graphs and wheels. 展开更多
关键词 signed Roman domination signed total Roman domination complete bipartite graph WHEEL
下载PDF
Two conditions for a bipartite graph to be a k-deleted graph
16
作者 杨宏晨 薛秀谦 《Journal of Southeast University(English Edition)》 EI CAS 2003年第2期197-199,共3页
A k-regular spanning subgraph of graph G is called a k-factor of G. Graph G is called a k-deleted graph if G-e has a k-factor for each edge e. A graph G=(X,Y) with bipartition (X,Y) is called a bipartite graph if ever... A k-regular spanning subgraph of graph G is called a k-factor of G. Graph G is called a k-deleted graph if G-e has a k-factor for each edge e. A graph G=(X,Y) with bipartition (X,Y) is called a bipartite graph if every edge of G has one endpoint in X and the other in Y.It is proved that a bipartite graph G=(X,Y) with X=Y is a k-deleted graph if and only if kS≤r 1+2r 2+...+k(r k+...+r Δ)-ε(S) for all SX. Using this result we give a sufficient neighborhood condition for a bipartite to be a k-deleted graph. 展开更多
关键词 bipartite graph K-FACTOR k-deleted graph
下载PDF
Vertex-distinguishing IE-total Colorings of Complete Bipartite Graphs K8,n 被引量:3
17
作者 SHI Jin CHEN Xiang-en 《Chinese Quarterly Journal of Mathematics》 2016年第2期147-154,共8页
Let G be a simple graph. An IE-total coloring f of G is a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color. For each vertex x of G, let C(x) be the set of colors of verte... Let G be a simple graph. An IE-total coloring f of G is a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color. For each vertex x of G, let C(x) be the set of colors of vertex x and edges incident to x under f. For an IE-total coloring f of G using k colors, if C(u) ≠ C(v) for any two different vertices u and v of G, then f is called a k-vertex-distinguishing IE-total-coloring of G or a k-VDIET coloring of G for short. The minimum number of colors required for a VDIET coloring of G is denoted by χ_(vt)^(ie) (G) and is called vertex-distinguishing IE-total chromatic number or the VDIET chromatic number of G for short. The VDIET colorings of complete bipartite graphs K_(8,n)are discussed in this paper. Particularly, the VDIET chromatic number of K_(8,n) are obtained. 展开更多
关键词 complete bipartite graphs IE-total coloring vertex-distinguishing IE-total coloring vertex-distinguishing IE-total chromatic number
下载PDF
THE MAXIMUM AND MINIMUM DEGREES OF RANDOM BIPARTITE MULTIGRAPHS 被引量:1
18
作者 陈爱莲 张福基 李皓 《Acta Mathematica Scientia》 SCIE CSCD 2011年第3期1155-1166,共12页
In this paper the authors generalize the classic random bipartite graph model, and define a model of the random bipartite multigraphs as follows:let m = m(n) be a positive integer-valued function on n and ζ(n,m;{... In this paper the authors generalize the classic random bipartite graph model, and define a model of the random bipartite multigraphs as follows:let m = m(n) be a positive integer-valued function on n and ζ(n,m;{pk}) the probability space consisting of all the labeled bipartite multigraphs with two vertex sets A ={a_1,a_2,...,a_n} and B = {b_1,b_2,...,b_m}, in which the numbers t_(ai),b_j of the edges between any two vertices a_i∈A and b_j∈ B are identically distributed independent random variables with distribution P{t_(ai),b_j=k}=pk,k=0,1,2,...,where pk ≥0 and ∞Σk=0 pk=1. They obtain that X_(c,d,A), the number of vertices in A with degree between c and d of G_(n,m)∈ζ(n, m;{pk}) has asymptotically Poisson distribution, and answer the following two questions about the space ζ(n,m;{pk}) with {pk} having geometric distribution, binomial distribution and Poisson distribution, respectively. Under which condition for {pk} can there be a function D(n) such that almost every random multigraph G_(n,m)∈ζ(n,m;{pk}) has maximum degree D(n)in A? under which condition for {pk} has almost every multigraph G(n,m)∈ζ(n,m;{pk}) a unique vertex of maximum degree in A? 展开更多
关键词 maximum degree minimum degree degree distribution random bipartite multigraphs
下载PDF
Quantum Correlations in a Family of Bipartite Qubit-Qutrit Separable States 被引量:2
19
作者 YE Biao-Liang LIU Yi-Min +1 位作者 LIU Xian-Song ZHANG Zhan-Jun 《Chinese Physics Letters》 SCIE CAS CSCD 2013年第2期20-23,共4页
Quantum correlations in a family of bipartite separable qubit-qutrit quantum-classical correlated states are investigated by using two popular measures,i.e.,the original quantum discord(OQD)method by Ollivier and Zure... Quantum correlations in a family of bipartite separable qubit-qutrit quantum-classical correlated states are investigated by using two popular measures,i.e.,the original quantum discord(OQD)method by Ollivier and Zurek[Phys.Rev.Lett.88(2001)017901]and the measurement-induced disturbance(MID)method by Luo[Phys.Rev.A 77(2008)022301].It is found that both of them are functions of a parameter partially characterizing the concerned states,however,quantum correlations evaluated via the convenient MID method are somewhat overestimated. 展开更多
关键词 QUANTUM bipartite concerned
下载PDF
Generation of a new bipartite coherent-entangled state and its applications 被引量:1
20
作者 张宝来 孟祥国 王继锁 《Chinese Physics B》 SCIE EI CAS CSCD 2012年第3期51-55,共5页
A new bipartite coherent-entangled state is introduced in the two-mode Fock space, which exhibits the properties of both a coherent state and an entangled state. The set of coherent-entangled states makes up a complet... A new bipartite coherent-entangled state is introduced in the two-mode Fock space, which exhibits the properties of both a coherent state and an entangled state. The set of coherent-entangled states makes up a complete and partly nonorthogonal representation. A simple experimental scheme to produce the coherent-entangled state using an asymmetric beamsplitter is proposed. Some applications of the coherent-entangled state in quantum optics are also oresented. 展开更多
关键词 bipartite coherent-entangled state asymmetric beamsplitter Einstein-Podolsky-Rosen entangled state squeezed state
下载PDF
上一页 1 2 250 下一页 到第
使用帮助 返回顶部