This paper elucidates the effectiveness of combining the Poincare-Lighthill-Kuo method (PLK method, for short) and symbolic computation. Firstly, the idea and history of the PLK method are briefly introduced. Then, th...This paper elucidates the effectiveness of combining the Poincare-Lighthill-Kuo method (PLK method, for short) and symbolic computation. Firstly, the idea and history of the PLK method are briefly introduced. Then, the difficulty of intermediate expression swell, often encountered in symbolic computation, is outlined. For overcoming the difficulty, a semi-inverse algorithm was proposed by the author, with which the lengthy ports of intermediate expressions are first frozen in the form of symbols till the Fnal stage of seeking perturbation solutions. Tn discuss the applications of the above algorithm, the related work of the author and his research group on nonlinear oscillations and waves is concisely reviewed. The computer-extended perturbation solution of the Duffing equation shows that the asymptotic solution obtained with the PLK method possesses the convergence radius of 1 and thus the range of validity of the solution is considerably enlarged. The studies on internal solitary waves in stratified fluid and on the head-on collision between two solitary waves in a hyperelastic rod indicate that by means of the presented methods, very complicated manipulation, unconceivable in hand calculation, can be conducted and thus result in higher-order evolution equations and asymptotic solutions. The examples illustrate that the algorithm helps to realize the symbolic computation on micro-commputers. Finally, it is concluded that,vith the aid of symbolic computation, the vitality of the PLK method is greatly. Strengthened and at least for the solutions to conservative systems of oscillations and waves, it is a powerful tool.展开更多
Fixed-point fast sweeping WENO methods are a class of efficient high-order numerical methods to solve steady-state solutions of hyperbolic partial differential equations(PDEs).The Gauss-Seidel iterations and alternati...Fixed-point fast sweeping WENO methods are a class of efficient high-order numerical methods to solve steady-state solutions of hyperbolic partial differential equations(PDEs).The Gauss-Seidel iterations and alternating sweeping strategy are used to cover characteristics of hyperbolic PDEs in each sweeping order to achieve fast convergence rate to steady-state solutions.A nice property of fixed-point fast sweeping WENO methods which distinguishes them from other fast sweeping methods is that they are explicit and do not require inverse operation of nonlinear local systems.Hence,they are easy to be applied to a general hyperbolic system.To deal with the difficulties associated with numerical boundary treatment when high-order finite difference methods on a Cartesian mesh are used to solve hyperbolic PDEs on complex domains,inverse Lax-Wendroff(ILW)procedures were developed as a very effective approach in the literature.In this paper,we combine a fifthorder fixed-point fast sweeping WENO method with an ILW procedure to solve steadystate solution of hyperbolic conservation laws on complex computing regions.Numerical experiments are performed to test the method in solving various problems including the cases with the physical boundary not aligned with the grids.Numerical results show highorder accuracy and good performance of the method.Furthermore,the method is compared with the popular third-order total variation diminishing Runge-Kutta(TVD-RK3)time-marching method for steady-state computations.Numerical examples show that for most of examples,the fixed-point fast sweeping method saves more than half CPU time costs than TVD-RK3 to converge to steady-state solutions.展开更多
Symbolic analysis has many applications in the design of analog circuits. Existing approaches rely on two forms of symbolic-expression representation: expanded sum-of-product form and arbitrarily nested form. Expanded...Symbolic analysis has many applications in the design of analog circuits. Existing approaches rely on two forms of symbolic-expression representation: expanded sum-of-product form and arbitrarily nested form. Expanded form suffers the problem that the number of product terms grows exponentially with the size of a circuit. Nested form is neither canonical nor amenable to symbolic manipulation. In this paper, we present a new approach to exact and canonical symbolic analysis by exploiting the sparsity and sharing of product terms. This algorithm, called totally coded method (TCM), consists of representing the symbolic determinant of a circuit matrix by code series and performing symbolic analysis by code manipulation. We describe an efficient code-ordering heuristic and prove that it is optimum for ladder-structured circuits. For practical analog circuits, TCM not only covers all advantages of the algorithm via determinant decision diagrams (DDD) but is more simple and efficient than DDD method.展开更多
In this paper, we provide an aggregate function homotopy interior point method to solve a class of Brouwer fixed-point problems. Compared with the homotopy method （proposed by Yu and Lin, Appl. Math. Comput., 74（199...In this paper, we provide an aggregate function homotopy interior point method to solve a class of Brouwer fixed-point problems. Compared with the homotopy method （proposed by Yu and Lin, Appl. Math. Comput., 74（1996）, 65）, the main adavantages of this method are as foUows： on the one hand, it can solve the Brouwer fixed-point problems in a broader class of nonconvex subsets Ω in R^n （in this paper, we let Ω={x∈ R^n ： gi（x） ≤0, i= 1,... , m}）; on the other hand, it can also deal with the subsets Ω with larger amount of constraints more effectively.展开更多
In this paper, we modify the homotopy method （proposed by Yu and Lin, Appl. Math. Comput., 74（1996）, 65） and hence make the modified method be able to solve Brouwer fixed-point problems in a broader class of nonco...In this paper, we modify the homotopy method （proposed by Yu and Lin, Appl. Math. Comput., 74（1996）, 65） and hence make the modified method be able to solve Brouwer fixed-point problems in a broader class of nonconvex subsets in Rn. In addition, a simple example is given to show the effectiveness of the modified method.展开更多
In this paper, a new extended complex tanh-function method is presented for constructing traveling wave, non-traveling wave, and coefficient functions＇ soliton-like solutions of nonlinear equations. This method is mo...In this paper, a new extended complex tanh-function method is presented for constructing traveling wave, non-traveling wave, and coefficient functions＇ soliton-like solutions of nonlinear equations. This method is more powerful than the complex tanh-function method [Chaos, Solitons and Fractals 20 （2004） 1037]. Abundant new solutions o[ （2q-1）-dimensional Hirota equation are obtained by using this method and symbolic computation system Maple.展开更多
In this paper, based on a new more general ansitz, a new algebraic method, named generalized Riccati equation rational expansion method, is devised for constructing travelling wave solutions for nonlinear evolution eq...In this paper, based on a new more general ansitz, a new algebraic method, named generalized Riccati equation rational expansion method, is devised for constructing travelling wave solutions for nonlinear evolution equations with nonlinear terms of any order. Compared with most existing tanh methods for finding travelling wave solutions, the proposed method not only recovers the results by most known algebraic methods, but also provides new and more general solutions. We choose the generalized Burgers-Fisher equation with nonlinear terms of any order to illustrate our method. As a result, we obtain several new kinds of exact solutions for the equation. This approach can also be applied to other nonlinear evolution equations with nonlinear terms of any order.展开更多
Vertical layered space-time codes have demonstrated the enormous potential to accommodate rapid flow data. Thus far, vertical layered space-time codes assumed that perfect estimates of current channel fading condition...Vertical layered space-time codes have demonstrated the enormous potential to accommodate rapid flow data. Thus far, vertical layered space-time codes assumed that perfect estimates of current channel fading conditions are available at the receiver. However, increasing the number of transmit antennas increases the required training interval and reduces the available time in which data may be transmitted before the fading coefficients change. In this paper, a vertical layered space-time code is proposed. By applying the subspace method to the layered space-time code, the symbols can be detected without training symbols and channel estimates at the transmitter or the receiver. Monte Carlo simulations show that performance can approach that of the detection method with the knowledge of the channel.展开更多
A method for determining symbolic and all numerical solutions in design optimization based on monotonicity analysis and solving polynomial systems is presented in this paper. Groebner Bases of the algebraic system equ...A method for determining symbolic and all numerical solutions in design optimization based on monotonicity analysis and solving polynomial systems is presented in this paper. Groebner Bases of the algebraic system equivalent to the subproblem of the design optimization is taken as the symbolic (analytical) expression of the optimum solution for the symbolic optimization, i.e. the problem with symbolic coefficients. A method based on substituting and eliminating for determining Groebner Bases is also proposed, and method for finding all numerical optimum solutions is discussed. Finally an example is given, demonstrating the strategy and efficiency of the method.展开更多
On the basis of analysis of various algorithms, an anti-aliasing algorithm called brush method was presented, which is suitable to map publishing symbol. After introducing the basic principle and implementation of bru...On the basis of analysis of various algorithms, an anti-aliasing algorithm called brush method was presented, which is suitable to map publishing symbol. After introducing the basic principle and implementation of brush method in detail, the result and efficiency were evaluated through experiments.展开更多
In the network technology era, the collected data are growing more and more complex, and become larger than before. In this article, we focus on estimates of the linear regression parameters for symbolic interval data...In the network technology era, the collected data are growing more and more complex, and become larger than before. In this article, we focus on estimates of the linear regression parameters for symbolic interval data. We propose two approaches to estimate regression parameters for symbolic interval data under two different data models and compare our proposed approaches with the existing methods via simulations. Finally, we analyze two real datasets with the proposed methods for illustrations.展开更多
Under investigation in this paper are two coupled integrable dispersionless (CID) equations modelingthe dynamics of the current-fed string within an external magnetic field.Through a set of the dependent variabletrans...Under investigation in this paper are two coupled integrable dispersionless (CID) equations modelingthe dynamics of the current-fed string within an external magnetic field.Through a set of the dependent variabletransformations, the bilinear forms for the CID equations are derived.Based on the Hirota method and symboliccomputation, the analytic N-soliton solutions are presented.Infinitely many conservation laws for the CID equationsare given through the known spectral problem.Propagation characteristics and interaction behaviors of the solitons areanalyzed graphically.展开更多
The paper is concerned with E. A. Poe＇s unique symbolic method as manifested in his tale The Masque of the Red Death. It offers a picture of the general state of critical treatment of the supposed opposition between ...The paper is concerned with E. A. Poe＇s unique symbolic method as manifested in his tale The Masque of the Red Death. It offers a picture of the general state of critical treatment of the supposed opposition between allegory and symbol. I present a historical overview of how the distinction between the literary terms arose, tracing the roots of the issue to the end of the 18th century and showing its development over the next two centuries. The second section of the paper is devoted to the analysis of The Masque in the light of the theoretical background provided in the opening section. The Masque is interpreted in terms of Poe＇s modulation of＂closed＂ and ＂open＂ symbolism by focusing on aspects of the story that relate to the use of numbers, colors, and time.展开更多
In this paper, the （2＋l）-dimensional generalization of shallow water wave equation, which may be used to describe the propagation of ocean waves, is analytically investigated. With the aid of symbolic computation, ...In this paper, the （2＋l）-dimensional generalization of shallow water wave equation, which may be used to describe the propagation of ocean waves, is analytically investigated. With the aid of symbolic computation, we prove that the （2＋ l）-dimensional generalization of shallow water wave equation possesses the Palnlev6 property under a certain condition, and its Lax pair is constructed by applying the singular manifold method. Based on the obtained Lax representation, the Darboux transformation （DT） is constructed. The first iterated solution, second iterated solution and a special N-soliton solution with an arbitrary function are derived with the resulting DT. Relevant properties are graphically illustrated, which might be helpful to understanding the propagation processes for ocean waves in shallow water.展开更多
Fixed-point fast sweeping methods are a class of explicit iterative methods developed in the literature to efficiently solve steady-state solutions of hyperbolic partial differential equations(PDEs).As other types of ...Fixed-point fast sweeping methods are a class of explicit iterative methods developed in the literature to efficiently solve steady-state solutions of hyperbolic partial differential equations(PDEs).As other types of fast sweeping schemes,fixed-point fast sweeping methods use the Gauss-Seidel iterations and alternating sweeping strategy to cover characteristics of hyperbolic PDEs in a certain direction simultaneously in each sweeping order.The resulting iterative schemes have a fast convergence rate to steady-state solutions.Moreover,an advantage of fixed-point fast sweeping methods over other types of fast sweeping methods is that they are explicit and do not involve the inverse operation of any nonlinear local system.Hence,they are robust and flexible,and have been combined with high-order accurate weighted essentially non-oscillatory(WENO)schemes to solve various hyperbolic PDEs in the literature.For multidimensional nonlinear problems,high-order fixed-point fast sweeping WENO methods still require quite a large amount of computational costs.In this technical note,we apply sparse-grid techniques,an effective approximation tool for multidimensional problems,to fixed-point fast sweeping WENO methods for reducing their computational costs.Here,we focus on fixed-point fast sweeping WENO schemes with third-order accuracy(Zhang et al.2006[41]),for solving Eikonal equations,an important class of static Hamilton-Jacobi(H-J)equations.Numerical experiments on solving multidimensional Eikonal equations and a more general static H-J equation are performed to show that the sparse-grid computations of the fixed-point fast sweeping WENO schemes achieve large savings of CPU times on refined meshes,and at the same time maintain comparable accuracy and resolution with those on corresponding regular single grids.展开更多
With the advent of the era of symbolic consumption, products＇ value of his ＂symbol＂ is getting more and more important. By discussing the meaning of the symbolic design of product, it puts forward the design method...With the advent of the era of symbolic consumption, products＇ value of his ＂symbol＂ is getting more and more important. By discussing the meaning of the symbolic design of product, it puts forward the design method of realizing symbolic design from the inspects of products＇ shape, material, color, and using ways, and constructs the symbolic value of commodity, and manifests the target users＇ emotion, identity, way of life, differences in value orientation, etc, to meet the high-level needs of people.展开更多
文摘This paper elucidates the effectiveness of combining the Poincare-Lighthill-Kuo method (PLK method, for short) and symbolic computation. Firstly, the idea and history of the PLK method are briefly introduced. Then, the difficulty of intermediate expression swell, often encountered in symbolic computation, is outlined. For overcoming the difficulty, a semi-inverse algorithm was proposed by the author, with which the lengthy ports of intermediate expressions are first frozen in the form of symbols till the Fnal stage of seeking perturbation solutions. Tn discuss the applications of the above algorithm, the related work of the author and his research group on nonlinear oscillations and waves is concisely reviewed. The computer-extended perturbation solution of the Duffing equation shows that the asymptotic solution obtained with the PLK method possesses the convergence radius of 1 and thus the range of validity of the solution is considerably enlarged. The studies on internal solitary waves in stratified fluid and on the head-on collision between two solitary waves in a hyperelastic rod indicate that by means of the presented methods, very complicated manipulation, unconceivable in hand calculation, can be conducted and thus result in higher-order evolution equations and asymptotic solutions. The examples illustrate that the algorithm helps to realize the symbolic computation on micro-commputers. Finally, it is concluded that,vith the aid of symbolic computation, the vitality of the PLK method is greatly. Strengthened and at least for the solutions to conservative systems of oscillations and waves, it is a powerful tool.
基金Research was supported by the NSFC Grant 11872210Research was supported by the NSFC Grant 11872210 and Grant No.MCMS-I-0120G01+1 种基金Research supported in part by the AFOSR Grant FA9550-20-1-0055NSF Grant DMS-2010107.
文摘Fixed-point fast sweeping WENO methods are a class of efficient high-order numerical methods to solve steady-state solutions of hyperbolic partial differential equations(PDEs).The Gauss-Seidel iterations and alternating sweeping strategy are used to cover characteristics of hyperbolic PDEs in each sweeping order to achieve fast convergence rate to steady-state solutions.A nice property of fixed-point fast sweeping WENO methods which distinguishes them from other fast sweeping methods is that they are explicit and do not require inverse operation of nonlinear local systems.Hence,they are easy to be applied to a general hyperbolic system.To deal with the difficulties associated with numerical boundary treatment when high-order finite difference methods on a Cartesian mesh are used to solve hyperbolic PDEs on complex domains,inverse Lax-Wendroff(ILW)procedures were developed as a very effective approach in the literature.In this paper,we combine a fifthorder fixed-point fast sweeping WENO method with an ILW procedure to solve steadystate solution of hyperbolic conservation laws on complex computing regions.Numerical experiments are performed to test the method in solving various problems including the cases with the physical boundary not aligned with the grids.Numerical results show highorder accuracy and good performance of the method.Furthermore,the method is compared with the popular third-order total variation diminishing Runge-Kutta(TVD-RK3)time-marching method for steady-state computations.Numerical examples show that for most of examples,the fixed-point fast sweeping method saves more than half CPU time costs than TVD-RK3 to converge to steady-state solutions.
文摘Symbolic analysis has many applications in the design of analog circuits. Existing approaches rely on two forms of symbolic-expression representation: expanded sum-of-product form and arbitrarily nested form. Expanded form suffers the problem that the number of product terms grows exponentially with the size of a circuit. Nested form is neither canonical nor amenable to symbolic manipulation. In this paper, we present a new approach to exact and canonical symbolic analysis by exploiting the sparsity and sharing of product terms. This algorithm, called totally coded method (TCM), consists of representing the symbolic determinant of a circuit matrix by code series and performing symbolic analysis by code manipulation. We describe an efficient code-ordering heuristic and prove that it is optimum for ladder-structured circuits. For practical analog circuits, TCM not only covers all advantages of the algorithm via determinant decision diagrams (DDD) but is more simple and efficient than DDD method.
文摘In this paper, we provide an aggregate function homotopy interior point method to solve a class of Brouwer fixed-point problems. Compared with the homotopy method （proposed by Yu and Lin, Appl. Math. Comput., 74（1996）, 65）, the main adavantages of this method are as foUows： on the one hand, it can solve the Brouwer fixed-point problems in a broader class of nonconvex subsets Ω in R^n （in this paper, we let Ω={x∈ R^n ： gi（x） ≤0, i= 1,... , m}）; on the other hand, it can also deal with the subsets Ω with larger amount of constraints more effectively.
文摘In this paper, we modify the homotopy method （proposed by Yu and Lin, Appl. Math. Comput., 74（1996）, 65） and hence make the modified method be able to solve Brouwer fixed-point problems in a broader class of nonconvex subsets in Rn. In addition, a simple example is given to show the effectiveness of the modified method.
基金The project supported by National Natural Science Foundation of China and the Natural Science Foundation of Shandong Province of China
文摘In this paper, a new extended complex tanh-function method is presented for constructing traveling wave, non-traveling wave, and coefficient functions＇ soliton-like solutions of nonlinear equations. This method is more powerful than the complex tanh-function method [Chaos, Solitons and Fractals 20 （2004） 1037]. Abundant new solutions o[ （2q-1）-dimensional Hirota equation are obtained by using this method and symbolic computation system Maple.
基金The project partially supported by the State Key Basic Research Program of China under Grant No. 2004CB318000
文摘In this paper, based on a new more general ansitz, a new algebraic method, named generalized Riccati equation rational expansion method, is devised for constructing travelling wave solutions for nonlinear evolution equations with nonlinear terms of any order. Compared with most existing tanh methods for finding travelling wave solutions, the proposed method not only recovers the results by most known algebraic methods, but also provides new and more general solutions. We choose the generalized Burgers-Fisher equation with nonlinear terms of any order to illustrate our method. As a result, we obtain several new kinds of exact solutions for the equation. This approach can also be applied to other nonlinear evolution equations with nonlinear terms of any order.
基金Partially supported by the National Natural Sciences Foundation (No.69872029) and the Research Fund for Doctoral Program of Higher Education (No.1999069808) of China
文摘Vertical layered space-time codes have demonstrated the enormous potential to accommodate rapid flow data. Thus far, vertical layered space-time codes assumed that perfect estimates of current channel fading conditions are available at the receiver. However, increasing the number of transmit antennas increases the required training interval and reduces the available time in which data may be transmitted before the fading coefficients change. In this paper, a vertical layered space-time code is proposed. By applying the subspace method to the layered space-time code, the symbols can be detected without training symbols and channel estimates at the transmitter or the receiver. Monte Carlo simulations show that performance can approach that of the detection method with the knowledge of the channel.
文摘A method for determining symbolic and all numerical solutions in design optimization based on monotonicity analysis and solving polynomial systems is presented in this paper. Groebner Bases of the algebraic system equivalent to the subproblem of the design optimization is taken as the symbolic (analytical) expression of the optimum solution for the symbolic optimization, i.e. the problem with symbolic coefficients. A method based on substituting and eliminating for determining Groebner Bases is also proposed, and method for finding all numerical optimum solutions is discussed. Finally an example is given, demonstrating the strategy and efficiency of the method.
基金Supported by Internal Fund of Institute of Surveying and Mapping (No.Y0506) .
文摘On the basis of analysis of various algorithms, an anti-aliasing algorithm called brush method was presented, which is suitable to map publishing symbol. After introducing the basic principle and implementation of brush method in detail, the result and efficiency were evaluated through experiments.
文摘In the network technology era, the collected data are growing more and more complex, and become larger than before. In this article, we focus on estimates of the linear regression parameters for symbolic interval data. We propose two approaches to estimate regression parameters for symbolic interval data under two different data models and compare our proposed approaches with the existing methods via simulations. Finally, we analyze two real datasets with the proposed methods for illustrations.
基金Supported by the National Natural Science Foundation of China under Grant No.60772023the Open Fund No.BUAA-SKLSDE-09KF-04+2 种基金Supported Project No.SKLSDE-2010ZX-07 of the State Key Laboratory of Software Development Environment,Beijing University of Aeronautics and Astronauticsthe National Basic Research Program of China (973 Program) under Grant No.2005CB321901 the Specialized Research Fund for the Doctoral Program of Higher Education under Grant No.200800130006,Chinese Ministry of Education
文摘Under investigation in this paper are two coupled integrable dispersionless (CID) equations modelingthe dynamics of the current-fed string within an external magnetic field.Through a set of the dependent variabletransformations, the bilinear forms for the CID equations are derived.Based on the Hirota method and symboliccomputation, the analytic N-soliton solutions are presented.Infinitely many conservation laws for the CID equationsare given through the known spectral problem.Propagation characteristics and interaction behaviors of the solitons areanalyzed graphically.
文摘The paper is concerned with E. A. Poe＇s unique symbolic method as manifested in his tale The Masque of the Red Death. It offers a picture of the general state of critical treatment of the supposed opposition between allegory and symbol. I present a historical overview of how the distinction between the literary terms arose, tracing the roots of the issue to the end of the 18th century and showing its development over the next two centuries. The second section of the paper is devoted to the analysis of The Masque in the light of the theoretical background provided in the opening section. The Masque is interpreted in terms of Poe＇s modulation of＂closed＂ and ＂open＂ symbolism by focusing on aspects of the story that relate to the use of numbers, colors, and time.
基金Supported by the National Natural Science Foundation of China under Grant No.61072145the Scientific Research Common Program of Beijing Municipal Commission of Education under Grant No.SQKM201211232016
文摘In this paper, the （2＋l）-dimensional generalization of shallow water wave equation, which may be used to describe the propagation of ocean waves, is analytically investigated. With the aid of symbolic computation, we prove that the （2＋ l）-dimensional generalization of shallow water wave equation possesses the Palnlev6 property under a certain condition, and its Lax pair is constructed by applying the singular manifold method. Based on the obtained Lax representation, the Darboux transformation （DT） is constructed. The first iterated solution, second iterated solution and a special N-soliton solution with an arbitrary function are derived with the resulting DT. Relevant properties are graphically illustrated, which might be helpful to understanding the propagation processes for ocean waves in shallow water.
文摘Fixed-point fast sweeping methods are a class of explicit iterative methods developed in the literature to efficiently solve steady-state solutions of hyperbolic partial differential equations(PDEs).As other types of fast sweeping schemes,fixed-point fast sweeping methods use the Gauss-Seidel iterations and alternating sweeping strategy to cover characteristics of hyperbolic PDEs in a certain direction simultaneously in each sweeping order.The resulting iterative schemes have a fast convergence rate to steady-state solutions.Moreover,an advantage of fixed-point fast sweeping methods over other types of fast sweeping methods is that they are explicit and do not involve the inverse operation of any nonlinear local system.Hence,they are robust and flexible,and have been combined with high-order accurate weighted essentially non-oscillatory(WENO)schemes to solve various hyperbolic PDEs in the literature.For multidimensional nonlinear problems,high-order fixed-point fast sweeping WENO methods still require quite a large amount of computational costs.In this technical note,we apply sparse-grid techniques,an effective approximation tool for multidimensional problems,to fixed-point fast sweeping WENO methods for reducing their computational costs.Here,we focus on fixed-point fast sweeping WENO schemes with third-order accuracy(Zhang et al.2006[41]),for solving Eikonal equations,an important class of static Hamilton-Jacobi(H-J)equations.Numerical experiments on solving multidimensional Eikonal equations and a more general static H-J equation are performed to show that the sparse-grid computations of the fixed-point fast sweeping WENO schemes achieve large savings of CPU times on refined meshes,and at the same time maintain comparable accuracy and resolution with those on corresponding regular single grids.
文摘With the advent of the era of symbolic consumption, products＇ value of his ＂symbol＂ is getting more and more important. By discussing the meaning of the symbolic design of product, it puts forward the design method of realizing symbolic design from the inspects of products＇ shape, material, color, and using ways, and constructs the symbolic value of commodity, and manifests the target users＇ emotion, identity, way of life, differences in value orientation, etc, to meet the high-level needs of people.
