This paper presents a predefined-time controller for Multiple Space transportation Robots System (MSRS), which can be applied in on-orbit assembly tasks to transport modules to pre-assembly configuration quickly. Firs...This paper presents a predefined-time controller for Multiple Space transportation Robots System (MSRS), which can be applied in on-orbit assembly tasks to transport modules to pre-assembly configuration quickly. Firstly, to simplify the analysis and design of predefined-time controller, a Predefined-time Stability Criterion is proposed in the form of Composite Lyapunov Function (CLF-PSC). Besides simplicity, the CLF-PSC also has the advantage of less conservativeness due to utilization of initial state information. Secondly, a concept of Lp-Norm-Normalized Sign Function (LPNNSF) is proposed based on the CLF-PSC. Different from traditional norm-normalized sign function, the Lp-norm of LPNNSF can be selected arbitrarily according to practical control task requirements, which means that the proposed LPNNSF is more generalized and more convenient for calculation. Thirdly, a predefined-time disturbance observer and predefined-time controller are designed based on the LPNNSF. The observer has the property of predefined-time convergence to achieve quicker and more accurate estimation of the lumped disturbance. The controller has less control input and chattering phenomenon than traditional predefined-time controller. In addition, by introducing the observer into the controller, the closed-loop system enjoys high precision and strong robustness. Finally, the effectiveness of the proposed controller is verified by numerical simulations. By employing the controller, the MSRS can carry assembly modules to the desired pre-assembly configuration accurately within predefined time.展开更多
Let G=(V,E) be a simple graph. For any real valued function f:V →R, the weight of f is f(V) = ∑f(v) over all vertices v∈V . A signed total dominating function is a function f:V→{-1,1} such ...Let G=(V,E) be a simple graph. For any real valued function f:V →R, the weight of f is f(V) = ∑f(v) over all vertices v∈V . A signed total dominating function is a function f:V→{-1,1} such that f(N(v)) ≥1 for every vertex v∈V . The signed total domination number of a graph G equals the minimum weight of a signed total dominating function on G . In this paper, some properties of the signed total domination number of a graph G are discussed.展开更多
Let G = （V, E） be a graph, and let f ： V →{-1, 1} be a two-valued function. If ∑x∈N（v） f（x） ≥ 1 for each v ∈ V, where N（v） is the open neighborhood of v, then f is a signed total dominating function on ...Let G = （V, E） be a graph, and let f ： V →{-1, 1} be a two-valued function. If ∑x∈N（v） f（x） ≥ 1 for each v ∈ V, where N（v） is the open neighborhood of v, then f is a signed total dominating function on G. A set {fl, f2,… fd} of signed d total dominating functions on G with the property that ∑i=1^d fi（x） ≤ 1 for each x ∈ V, is called a signed total dominating family （of functions） on G. The maximum number of functions in a signed total dominating family on G is the signed total domatic number on G, denoted by dt^s（G）. The properties of the signed total domatic number dt^s（G） are studied in this paper. In particular, we give the sharp bounds of the signed total domatic number of regular graphs, complete bipartite graphs and complete graphs.展开更多
Let G(V, E) be a finite connected simple graph with vertex set V(G). A function is a signed dominating function f : <em style="white-space:normal;">V<span style="white-space:normal;"&...Let G(V, E) be a finite connected simple graph with vertex set V(G). A function is a signed dominating function f : <em style="white-space:normal;">V<span style="white-space:normal;">(<em style="white-space:normal;">G<span style="white-space:normal;">)<span style="white-space:nowrap;">→{<span style="white-space:nowrap;"><span style="white-space:nowrap;">−1,1} if for every vertex v <span style="white-space:nowrap;">∈ V(G), the sum of closed neighborhood weights of v is greater or equal to 1. The signed domination number γ<sub>s</sub>(G) of G is the minimum weight of a signed dominating function on G. In this paper, we calculate the signed domination numbers of the Cartesian product of two paths P<sub>m</sub> and P<sub>n</sub> for m = 6, 7 and arbitrary n.展开更多
Let <img src="Edit_092a0db1-eefa-4bff-81a0-751d038158ad.png" width="58" height="20" alt="" /> be a graph. A function <img src="Edit_b7158ed5-6825-41cd-b7f0-5ab5e16...Let <img src="Edit_092a0db1-eefa-4bff-81a0-751d038158ad.png" width="58" height="20" alt="" /> be a graph. A function <img src="Edit_b7158ed5-6825-41cd-b7f0-5ab5e16fc53d.png" width="79" height="20" alt="" /> is said to be a Signed Dominating Function (SDF) if <img src="Edit_c6e63805-bcaa-46a9-bc77-42750af8efd4.png" width="135" height="25" alt="" /> holds for all <img src="Edit_bba1b366-af70-46cd-aefe-fc68869da670.png" width="42" height="20" alt="" />. The signed domination number <img src="Edit_22e6d87a-e3be-4037-b4b6-c1de6a40abb0.png" width="284" height="25" alt="" />. In this paper, we determine the exact value of the Signed Domination Number of graphs <img src="Edit_36ef2747-da44-4f9b-a10a-340c61a3f28c.png" width="19" height="20" alt="" /> and <img src="Edit_26eb0f74-fcc2-49ad-8567-492cf3115b73.png" width="19" height="20" alt="" /> for <img src="Edit_856dbcc1-d215-4144-b50c-ac8a225d664f.png" width="32" height="20" alt="" />, which is generalized the known results, respectively, where <img src="Edit_4b7e4f8f-5d38-4fd0-ac4e-dd8ef243029f.png" width="19" height="20" alt="" /> and <img src="Edit_6557afba-e697-4397-994e-a9bda83e3219.png" width="19" height="20" alt="" /> are denotes the k-th power graphs of cycle <img src="Edit_27e6e80f-85d5-4208-b367-a757a0e55d0b.png" width="21" height="20" alt="" /> and path <img src="Edit_70ac5266-950b-4bfd-8d04-21711d3ffc33.png" width="18" height="20" alt="" />.展开更多
Finite time blow up of the solutions to Boussinesq equation with linear restoring force and combined power nonlinearities is studied. Sufficient conditions on the initial data for nonexistence of global solutions are ...Finite time blow up of the solutions to Boussinesq equation with linear restoring force and combined power nonlinearities is studied. Sufficient conditions on the initial data for nonexistence of global solutions are derived. The results are valid for initial data with arbitrary high positive energy. The proofs are based on the concave method and new sign preserving functionals.展开更多
Three-dimensional(3D)modeling is an important topic in computer graphics and computer vision.In recent years,the introduction of consumer-grade depth cameras has resulted in profound advances in 3D modeling.Starting w...Three-dimensional(3D)modeling is an important topic in computer graphics and computer vision.In recent years,the introduction of consumer-grade depth cameras has resulted in profound advances in 3D modeling.Starting with the basic data structure,this survey reviews the latest developments of 3D modeling based on depth cameras,including research works on camera tracking,3D object and scene reconstruction,and high-quality texture reconstruction.We also discuss the future work and possible solutions for 3D modeling based on the depth camera.展开更多
Short time existence and uniqueness for the classical motion are studied by the function of the principal curvatures of a smooth surface and the Evans and Spruck's results are generalized.
This paper presents a handheld 3D vision-based scanner for small objects by using Kinect. It is different from the previous color-glove-based approaches which require segmenting the target object. First, we eliminate ...This paper presents a handheld 3D vision-based scanner for small objects by using Kinect. It is different from the previous color-glove-based approaches which require segmenting the target object. First, we eliminate the noises and the outliers caused by holding hands. Second, we apply Kinect-fusion algorithm and truncated signed distance function （TSDF） to represent 3D surfaces. Third, we propose a modified integration strategy to eliminate the hand effect. Fourth, we take advantage of the parallel computation of GPUs for real-time operation. The major contributions of this paper are （1） the registration precision is improved, （2） the oflline amendment and loop closure operation are not required, and （3） concave 3D object reconstruction is feasible.展开更多
Objective:To determine the risk factors for dehydration in elderly people in one of Elbehira Governorate’s villages.Methods:A descriptive correlational design was utilized in this study.The study was conducted at Eln...Objective:To determine the risk factors for dehydration in elderly people in one of Elbehira Governorate’s villages.Methods:A descriptive correlational design was utilized in this study.The study was conducted at Elnemaria village,Markaz Abo Elmatamir,Elbehira Governorate,Egypt.Data were collected using 3 tools:a structured interviewing questionnaire,a dehydration knowledge questionnaire,and a dehydration risk appraisal checklist.Results:The study found that 29.5%of the par ticipants were aged between 65 and 70.Males constituted 51%of the study par ticipants.The majority of the study participants regularly took anti-acids,anti-inflammatory drugs,and diuretics.Among the elderlies comprising the respondents,40%had a low level of knowledge regarding dehydration.More than half of the study subjects were at moderate risk for dehydration.Conclusions:The study showed that half of the par ticipants had diabetes and a medium level of information about dehydration.The study also showed in general that the elderly in the village are exposed to a moderate dehydration rate,and there is also a strong relationship between taking different types of medication and the occurrence of dehydration.展开更多
In this paper we obtain some lower bounds for minus and signed domination numbers. We also prove and generalize a conjecture on the minus domination number for bipartite graph of order n, which was proposed by Jean Du...In this paper we obtain some lower bounds for minus and signed domination numbers. We also prove and generalize a conjecture on the minus domination number for bipartite graph of order n, which was proposed by Jean Dunbar et al [1].展开更多
Let G be a finite connected simple graph with a vertex set V (G) and an edge set E(G). A total signed domination function of G is a function f : V (G) ∪ E(G) → {?1, 1}. The weight of f is w(f) = Σ x∈V(G)∪E(G) f(x...Let G be a finite connected simple graph with a vertex set V (G) and an edge set E(G). A total signed domination function of G is a function f : V (G) ∪ E(G) → {?1, 1}. The weight of f is w(f) = Σ x∈V(G)∪E(G) f(x). For an element x ∈ V (G) ∪ E(G), we define $f[x] = \sum\nolimits_{y \in N_T [x]} {f(y)} $ . A total signed domination function of G is a function f : V (G) ∪ E(G) → {?1, 1} such that f[x] ? 1 for all x ∈ V (G) ∪ E(G). The total signed domination number γ s * (G) of G is the minimum weight of a total signed domination function on G.In this paper, we obtain some lower bounds for the total signed domination number of a graph G and compute the exact values of γ s * (G) when G is C n and P n .展开更多
Let G = （V,E） be a graph.A function f ： E → {-1,1} is said to be a signed edge total dominating function （SETDF） of G if e ∈N（e） f（e ） ≥ 1 holds for every edge e ∈ E（G）.The signed edge total domination ...Let G = （V,E） be a graph.A function f ： E → {-1,1} is said to be a signed edge total dominating function （SETDF） of G if e ∈N（e） f（e ） ≥ 1 holds for every edge e ∈ E（G）.The signed edge total domination number γ st （G） of G is defined as γ st （G） = min{ e∈E（G） f（e）｜f is an SETDF of G}.In this paper we obtain some new lower bounds of γ st （G）.展开更多
Let G = （V, E） be a simple graph. A function f ： E → {＋1,-1} is called a signed cycle domination function （SCDF） of G if ∑e∈E（C） f（e） ≥ 1 for every induced cycle C of G. The signed cycle domination numbe...Let G = （V, E） be a simple graph. A function f ： E → {＋1,-1} is called a signed cycle domination function （SCDF） of G if ∑e∈E（C） f（e） ≥ 1 for every induced cycle C of G. The signed cycle domination number of G is defined as γ′sc（G） = min{∑e∈E f（e）｜ f is an SCDF of G}. This paper will characterize all maxima] planar graphs G with order n ≥ 6 and γ′sc（G） =n.展开更多
This paper studies the geometric boundary representations for Inverse Lax-Wendroff(ILW)method,aiming to develop a practical computer-aided engineering method without body-fitted meshes.We propose the signed distance f...This paper studies the geometric boundary representations for Inverse Lax-Wendroff(ILW)method,aiming to develop a practical computer-aided engineering method without body-fitted meshes.We propose the signed distance function(SDF)representation of the geometric boundary and design an extremely efficient algorithm for foot point calculation,which is particularly in line with the needs of ILW.Theoretical and numerical analyses demonstrate that the SDF representation of geometric boundary can satisfy ILW’s needs better than others.The effectiveness and robustness of our proposed method are verified by simulating initial boundary value computational physical problems of Euler equation for compressible fluids.展开更多
This article studies a new kind of stability judgment for dynamic systems, the definiteness Lyapunov derivative function approach based on the minimum function. The new results are described by introducing the normal ...This article studies a new kind of stability judgment for dynamic systems, the definiteness Lyapunov derivative function approach based on the minimum function. The new results are described by introducing the normal positivity. The article analyzes the relationship of a general system and a polynomial system, the judgment and measurement of positive definiteness, the polar coordinate approach, and constructing the algorithms for positive definite v·(x). Therefore, a new and systematic theory on stability judgment is clearly described.展开更多
基金co-supported by the National Natural Science Foundation of China(Nos.12372048,12102343)the Key Program of the National Natural Science Foundation of China(No.U2013206)+1 种基金the China Postdoctoral Science Foundation(No.2023M742835)the Guangdong Basic and Applied Basic Research Foundation,China(No.2023A1515011421).
文摘This paper presents a predefined-time controller for Multiple Space transportation Robots System (MSRS), which can be applied in on-orbit assembly tasks to transport modules to pre-assembly configuration quickly. Firstly, to simplify the analysis and design of predefined-time controller, a Predefined-time Stability Criterion is proposed in the form of Composite Lyapunov Function (CLF-PSC). Besides simplicity, the CLF-PSC also has the advantage of less conservativeness due to utilization of initial state information. Secondly, a concept of Lp-Norm-Normalized Sign Function (LPNNSF) is proposed based on the CLF-PSC. Different from traditional norm-normalized sign function, the Lp-norm of LPNNSF can be selected arbitrarily according to practical control task requirements, which means that the proposed LPNNSF is more generalized and more convenient for calculation. Thirdly, a predefined-time disturbance observer and predefined-time controller are designed based on the LPNNSF. The observer has the property of predefined-time convergence to achieve quicker and more accurate estimation of the lumped disturbance. The controller has less control input and chattering phenomenon than traditional predefined-time controller. In addition, by introducing the observer into the controller, the closed-loop system enjoys high precision and strong robustness. Finally, the effectiveness of the proposed controller is verified by numerical simulations. By employing the controller, the MSRS can carry assembly modules to the desired pre-assembly configuration accurately within predefined time.
文摘Let G=(V,E) be a simple graph. For any real valued function f:V →R, the weight of f is f(V) = ∑f(v) over all vertices v∈V . A signed total dominating function is a function f:V→{-1,1} such that f(N(v)) ≥1 for every vertex v∈V . The signed total domination number of a graph G equals the minimum weight of a signed total dominating function on G . In this paper, some properties of the signed total domination number of a graph G are discussed.
基金Project supported by the National Natural Science Foundation of China （Grant No.1057117）, and the Science Foundation of Shanghai Municipal Commission of Education （Grant No.05AZ04）.
文摘Let G = （V, E） be a graph, and let f ： V →{-1, 1} be a two-valued function. If ∑x∈N（v） f（x） ≥ 1 for each v ∈ V, where N（v） is the open neighborhood of v, then f is a signed total dominating function on G. A set {fl, f2,… fd} of signed d total dominating functions on G with the property that ∑i=1^d fi（x） ≤ 1 for each x ∈ V, is called a signed total dominating family （of functions） on G. The maximum number of functions in a signed total dominating family on G is the signed total domatic number on G, denoted by dt^s（G）. The properties of the signed total domatic number dt^s（G） are studied in this paper. In particular, we give the sharp bounds of the signed total domatic number of regular graphs, complete bipartite graphs and complete graphs.
文摘Let G(V, E) be a finite connected simple graph with vertex set V(G). A function is a signed dominating function f : <em style="white-space:normal;">V<span style="white-space:normal;">(<em style="white-space:normal;">G<span style="white-space:normal;">)<span style="white-space:nowrap;">→{<span style="white-space:nowrap;"><span style="white-space:nowrap;">−1,1} if for every vertex v <span style="white-space:nowrap;">∈ V(G), the sum of closed neighborhood weights of v is greater or equal to 1. The signed domination number γ<sub>s</sub>(G) of G is the minimum weight of a signed dominating function on G. In this paper, we calculate the signed domination numbers of the Cartesian product of two paths P<sub>m</sub> and P<sub>n</sub> for m = 6, 7 and arbitrary n.
文摘Let <img src="Edit_092a0db1-eefa-4bff-81a0-751d038158ad.png" width="58" height="20" alt="" /> be a graph. A function <img src="Edit_b7158ed5-6825-41cd-b7f0-5ab5e16fc53d.png" width="79" height="20" alt="" /> is said to be a Signed Dominating Function (SDF) if <img src="Edit_c6e63805-bcaa-46a9-bc77-42750af8efd4.png" width="135" height="25" alt="" /> holds for all <img src="Edit_bba1b366-af70-46cd-aefe-fc68869da670.png" width="42" height="20" alt="" />. The signed domination number <img src="Edit_22e6d87a-e3be-4037-b4b6-c1de6a40abb0.png" width="284" height="25" alt="" />. In this paper, we determine the exact value of the Signed Domination Number of graphs <img src="Edit_36ef2747-da44-4f9b-a10a-340c61a3f28c.png" width="19" height="20" alt="" /> and <img src="Edit_26eb0f74-fcc2-49ad-8567-492cf3115b73.png" width="19" height="20" alt="" /> for <img src="Edit_856dbcc1-d215-4144-b50c-ac8a225d664f.png" width="32" height="20" alt="" />, which is generalized the known results, respectively, where <img src="Edit_4b7e4f8f-5d38-4fd0-ac4e-dd8ef243029f.png" width="19" height="20" alt="" /> and <img src="Edit_6557afba-e697-4397-994e-a9bda83e3219.png" width="19" height="20" alt="" /> are denotes the k-th power graphs of cycle <img src="Edit_27e6e80f-85d5-4208-b367-a757a0e55d0b.png" width="21" height="20" alt="" /> and path <img src="Edit_70ac5266-950b-4bfd-8d04-21711d3ffc33.png" width="18" height="20" alt="" />.
基金partially supported by Grant No.DFNI I-02/9 of the Bulgarian Science Fund
文摘Finite time blow up of the solutions to Boussinesq equation with linear restoring force and combined power nonlinearities is studied. Sufficient conditions on the initial data for nonexistence of global solutions are derived. The results are valid for initial data with arbitrary high positive energy. The proofs are based on the concave method and new sign preserving functionals.
基金National Natural Science Foundation of China(61732016).
文摘Three-dimensional(3D)modeling is an important topic in computer graphics and computer vision.In recent years,the introduction of consumer-grade depth cameras has resulted in profound advances in 3D modeling.Starting with the basic data structure,this survey reviews the latest developments of 3D modeling based on depth cameras,including research works on camera tracking,3D object and scene reconstruction,and high-quality texture reconstruction.We also discuss the future work and possible solutions for 3D modeling based on the depth camera.
文摘Short time existence and uniqueness for the classical motion are studied by the function of the principal curvatures of a smooth surface and the Evans and Spruck's results are generalized.
基金supported by the Ministry of Science and Technology of Taiwan under Grant No.MOST103-2221-E-468-006–MY1
文摘This paper presents a handheld 3D vision-based scanner for small objects by using Kinect. It is different from the previous color-glove-based approaches which require segmenting the target object. First, we eliminate the noises and the outliers caused by holding hands. Second, we apply Kinect-fusion algorithm and truncated signed distance function （TSDF） to represent 3D surfaces. Third, we propose a modified integration strategy to eliminate the hand effect. Fourth, we take advantage of the parallel computation of GPUs for real-time operation. The major contributions of this paper are （1） the registration precision is improved, （2） the oflline amendment and loop closure operation are not required, and （3） concave 3D object reconstruction is feasible.
文摘Objective:To determine the risk factors for dehydration in elderly people in one of Elbehira Governorate’s villages.Methods:A descriptive correlational design was utilized in this study.The study was conducted at Elnemaria village,Markaz Abo Elmatamir,Elbehira Governorate,Egypt.Data were collected using 3 tools:a structured interviewing questionnaire,a dehydration knowledge questionnaire,and a dehydration risk appraisal checklist.Results:The study found that 29.5%of the par ticipants were aged between 65 and 70.Males constituted 51%of the study par ticipants.The majority of the study participants regularly took anti-acids,anti-inflammatory drugs,and diuretics.Among the elderlies comprising the respondents,40%had a low level of knowledge regarding dehydration.More than half of the study subjects were at moderate risk for dehydration.Conclusions:The study showed that half of the par ticipants had diabetes and a medium level of information about dehydration.The study also showed in general that the elderly in the village are exposed to a moderate dehydration rate,and there is also a strong relationship between taking different types of medication and the occurrence of dehydration.
基金Supported by the National Science Foundation of Jiangxi province(9911020).
文摘In this paper we obtain some lower bounds for minus and signed domination numbers. We also prove and generalize a conjecture on the minus domination number for bipartite graph of order n, which was proposed by Jean Dunbar et al [1].
基金the National Natural Science Foundation of China(Grant No.10471311)
文摘Let G be a finite connected simple graph with a vertex set V (G) and an edge set E(G). A total signed domination function of G is a function f : V (G) ∪ E(G) → {?1, 1}. The weight of f is w(f) = Σ x∈V(G)∪E(G) f(x). For an element x ∈ V (G) ∪ E(G), we define $f[x] = \sum\nolimits_{y \in N_T [x]} {f(y)} $ . A total signed domination function of G is a function f : V (G) ∪ E(G) → {?1, 1} such that f[x] ? 1 for all x ∈ V (G) ∪ E(G). The total signed domination number γ s * (G) of G is the minimum weight of a total signed domination function on G.In this paper, we obtain some lower bounds for the total signed domination number of a graph G and compute the exact values of γ s * (G) when G is C n and P n .
基金Supported by the National Natural Science Foundation of China (Grant No. 11061014)
文摘Let G = （V,E） be a graph.A function f ： E → {-1,1} is said to be a signed edge total dominating function （SETDF） of G if e ∈N（e） f（e ） ≥ 1 holds for every edge e ∈ E（G）.The signed edge total domination number γ st （G） of G is defined as γ st （G） = min{ e∈E（G） f（e）｜f is an SETDF of G}.In this paper we obtain some new lower bounds of γ st （G）.
基金Supported by Doctoral Scientific Research Fund of Harbin Normal University(Grant No.KGB201008)
文摘Let G = （V, E） be a simple graph. A function f ： E → {＋1,-1} is called a signed cycle domination function （SCDF） of G if ∑e∈E（C） f（e） ≥ 1 for every induced cycle C of G. The signed cycle domination number of G is defined as γ′sc（G） = min{∑e∈E f（e）｜ f is an SCDF of G}. This paper will characterize all maxima] planar graphs G with order n ≥ 6 and γ′sc（G） =n.
文摘This paper studies the geometric boundary representations for Inverse Lax-Wendroff(ILW)method,aiming to develop a practical computer-aided engineering method without body-fitted meshes.We propose the signed distance function(SDF)representation of the geometric boundary and design an extremely efficient algorithm for foot point calculation,which is particularly in line with the needs of ILW.Theoretical and numerical analyses demonstrate that the SDF representation of geometric boundary can satisfy ILW’s needs better than others.The effectiveness and robustness of our proposed method are verified by simulating initial boundary value computational physical problems of Euler equation for compressible fluids.
文摘This article studies a new kind of stability judgment for dynamic systems, the definiteness Lyapunov derivative function approach based on the minimum function. The new results are described by introducing the normal positivity. The article analyzes the relationship of a general system and a polynomial system, the judgment and measurement of positive definiteness, the polar coordinate approach, and constructing the algorithms for positive definite v·(x). Therefore, a new and systematic theory on stability judgment is clearly described.
