19 results
Search Results
2. Adaptive Synthesis for Resonator-Coupled Filters Based on Particle Swarm Optimization.
- Author
-
Luo, Xun, Yang, Bingzheng, and Qian, Huizhen Jenny
- Subjects
PARTICLE swarm optimization ,BANDPASS filters ,MATHEMATICAL optimization ,SIMULATION methods & models ,BANDWIDTHS ,ALGORITHMS - Abstract
In this paper, an adaptive synthesis using the particle swarm optimization (PSO) for implementations of resonator-coupled filters is proposed. The coupling matrix of in-band filtering response is achieved and optimized by the PSO-based synthesis. Meanwhile, the stopband coupling matrix of the filter is predicted based on the combination of extra resonant nodes representing stopband spurious and parasitic effect of input/output ports. In addition, an enhanced accurate prediction of filter performance is calculated by the proposed approach, considering the practical fabrication tolerance on filter design. To verify principles mentioned earlier, various resonator-coupled filters are implemented. The calculation, EM-simulation, and measurement of filters show good agreements in both passband and stopband. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
3. A quantum particle swarm optimization driven urban traffic light scheduling model.
- Author
-
Hu, Wenbin, Wang, Huan, Qiu, Zhenyu, Nie, Cong, and Yan, Liping
- Subjects
TRAFFIC signal control systems ,PARTICLE swarm optimization ,TRAFFIC signs & signals ,TRAFFIC congestion ,ALGORITHMS ,SIMULATION methods & models ,MATHEMATICAL optimization - Abstract
Urban traffic congestion becomes a severe problem for many cities all around the world. How to alleviate traffic congestions in real cities is a challenging problem. Benefited from concise and efficient evolution rules, the Biham, Middleton and Levine (BML) model has a great potential to provide favorable results in the dynamic and uncertain traffic flows within an urban network. In this paper, an enhanced BML model (EBML) is proposed to effectively simulate the urban traffic where the timing scheduling optimization algorithm (TSO) based on the quantum particle swarm optimization is creatively introduced to optimize the timing scheduling of traffic light. The main contributions include that: (1) The actual urban road network with different two-way multi-lane roads is firstly mapped into the theoretical lattice space of BML. And the corresponding updating rules of each lattice site are proposed to control vehicle dynamics; (2) compared with BML, a much deeper insight into the phase transition and traffic congestions is provided in EBML. And the interference among different road capacities on forming traffic congestions is elaborated; (3) based on the scheduling simulation of EBML, TSO optimizes the timing scheduling of traffic lights to alleviate traffic congestions. Extensive comparative experiments reveal that TSO can achieve excellent optimization performances in real cases. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
4. A New Mutated Quantum-Behaved Particle Swarm Optimizer for Digital IIR Filter Design.
- Author
-
Wei Fang, Jun Sun, and Wenbo Xu
- Subjects
IMPULSE response ,DIGITAL electric filters ,PARTICLE swarm optimization ,DESIGN ,ALGORITHMS ,MATHEMATICAL optimization ,PARTICLES ,MATHEMATICAL functions ,SIMULATION methods & models - Abstract
Adaptive infinite impulse response (IIR) filters have shown their worth in a wide range of practical applications. Because the error surface of IIR filters is multimodal in most cases, global optimization techniques are required for avoiding local minima. In this paper, we employ a global optimization algorithm, Quantum-behaved particle swarm optimization (QPSO) that was proposed by us previously, and itsmutated version in the design of digital IIR filter. The mechanism inQPSO is based on the quantum behaviour of particles in a potential well and particle swarm optimization (PSO) algorithm. QPSO is characterized by fast convergence, good search ability, and easy implementation. The mutated QPSO (MuQPSO) is proposed in this paper by using a random vector in QPSO to increase the randomness and to enhance the global search ability. Experimental results on three examples show that QPSO andMuQPSO are superior to genetic algorithm (GA), differential evolution (DE) algorithm, and PSO algorithm in quality, convergence speed, and robustness. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
5. A Variable-Dimension Optimization Approach to Unit Commitment Problem.
- Author
-
Pappala, Venkata Swaroop and Erlich, Istvan
- Subjects
MATHEMATICAL optimization ,ALGORITHMS ,SWARM intelligence ,SIMULATION methods & models ,MATHEMATICAL programming - Abstract
This paper proposes a variable-dimension optimization approach to address the high dimensionality issues in solving the unit commitment problem. This method introduces the concept of adaptive search space dimension. The proposed approach is implemented in particle swarm optimization algorithm. The optimization process starts with an arbitrary problem dimension, adapts with respect to the swarm progress and finally selects the optimal dimensional space. The efficiency of this method is tested on a ten-unit test system. The results are compared with binary programming and fixed duty cycle approaches. The simulation results show that the proposed method results in considerable reduction of problem dimension, faster convergence and improved quality of the final solution. [ABSTRACT FROM AUTHOR]
- Published
- 2010
- Full Text
- View/download PDF
6. IMPROVED GRAY-ENCODED EVOLUTION ALGORITHM BASED ON CHAOS CLUSTER FOR PARAMETER OPTIMIZATION OF MOISTURE MOVEMENT.
- Author
-
Xiao-Hua YANG, Yu-Qi LI, Kai-Wen WANG, Bo-Yang SUN, Yi YE, and Mei-Shui LI
- Subjects
ALGORITHMS ,MATHEMATICAL optimization ,MOISTURE measurement ,PARTICLE swarm optimization ,SIMULATION methods & models - Abstract
To improve computational precision for parameter optimization of the van Genuchten model in simulating moisture movement in environment protection, an improved gray-encoded evolution algorithm based on chaos cluster is proposed, in which an initial population is generated by chaotic mapping, and the searching range is automatically renewed with the excellent individuals by chaos cluster operation. Its efficiency is verified experimentally. The results indicate that the absolute error by the improved gray-encoded evolution algorithm based on chaos cluster decreases by 7.52% and 40.40%, respectively, and the relative error decreases by 12.65% and 49.95%, respectively, compared to those by the standard binary-encoded evolution algorithm, and the particle swarm optimization algorithm. Improved gray-encoded evolution algorithm based on chaos cluster has higher precision and it is good for the global optimization in the practical parameter optimization in environment system. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
7. Cultural algorithm-based quantum-behaved particle swarm optimization.
- Author
-
Yang, Kaiqiao, Maginu, Kenjiro, and Nomura, Hirosato
- Subjects
PARTICLE swarm optimization ,ALGORITHMS ,MATHEMATICAL optimization ,SIMULATION methods & models ,SYSTEM analysis - Abstract
A hybrid quantum-behaved particle swarm optimization (QPSO) based on cultural algorithm (CA), which we call cultural QPSO, is proposed. Although QPSO is a promising algorithm for many optimization problems, it is apt to lose the diversity of the swarm in the later period of the search and prematurely converges to the local optimum. Inspired by the structure of human society, this paper uses the CA model to diversify the QPSO population and improve the QPSO's performance. In this model, the swarm is divided into two sub-swarms: the common particle and the elite particle sub-swarm. If a particle comes from a common sub-swarm, it will evolve according to the QPSO method, and during the evolvement, it will be affected not only by the other common particles but also by the elites. For the elites, the differential evolution (DE) method is adopted for evolvement. After each generation, the elites will be re-elected from the whole swarm according to fitness values. The simulation results on benchmark functions demonstrate that cultural QPSO outperforms the original QPSO for many problems. [ABSTRACT FROM AUTHOR]
- Published
- 2010
- Full Text
- View/download PDF
8. A new fuzzy adaptive particle swarm optimization for non-smooth economic dispatch
- Author
-
Niknam, Taher, Mojarrad, Hassan Doagou, and Nayeripour, Majid
- Subjects
- *
PARTICLE swarm optimization , *MATHEMATICAL economics , *HEURISTIC , *MATHEMATICAL optimization , *STOCHASTIC convergence , *FUZZY systems , *ALGORITHMS , *SIMULATION methods & models , *COST analysis - Abstract
Abstract: This paper proposes a novel method for solving the Non-convex Economic Dispatch (NED) problems, by the Fuzzy Adaptive Modified Particle Swarm Optimization (FAMPSO). Practical ED problems have non-smooth cost functions with equality and inequality constraints when generator valve-point loading effects are taken into account. Modern heuristic optimization techniques have been given much attention by many researchers due to their ability to find an almost global optimal solution for ED problems. PSO is one of modern heuristic algorithms, in which particles change place to get close to the best position and find the global minimum point. However, the classic PSO may converge to a local optimum solution and the performance of the PSO highly depends on the internal parameters. To overcome these drawbacks, in this paper, a new mutation is proposed to improve the global searching capability and prevent the convergence to local minima. Also, a fuzzy system is used to tune its parameters such as inertia weight and learning factors. In order to evaluate the performance of the proposed algorithm, it is applied to a system consisting of 13 and 40 thermal units whose fuel cost function is calculated by taking account of the effect of valve-point loading. Simulation results demonstrate the superiority of the proposed algorithm compared to other optimization algorithms presented in literature. [Copyright &y& Elsevier]
- Published
- 2010
- Full Text
- View/download PDF
9. Self Grey Particle Swarm Optimization Patterns Clustering Algorithm.
- Author
-
Ching-Yi Chen, Hsuan-Ming Feng, and Fun Ye
- Subjects
ALGORITHMS ,MATHEMATICAL optimization ,MATHEMATICAL analysis ,PARTICLES ,SIMULATION methods & models - Abstract
This paper presents a grey particle swarm optimization learning algorithms to self classify different input patterns as correct subgroups. In our learning stratagem, a grey relational analysis (GRA) is combined with Particle swarm optimization (PSO) to develop a classification system. In our research, the GRA is more effective and accurate than the common-used Euclidean norm measure. The evolutional PSO is a very powerful learning algorithm to optimize the classifying task for complex, irregular and high dimensional input patterns. Several artificial data clustering examples compared with k-means method is presented to demonstrate the robustness of the proposed grey particle swarm optimization clustering algorithm. A real image classifying problem is also provided with the grey particle swarm optimization clustering algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2005
10. Handling multi-objective optimization problems with a multi-swarm cooperative particle swarm optimizer
- Author
-
Zhang, Yong, Gong, Dun-wei, and Ding, Zhong-hai
- Subjects
- *
PARTICLE swarm optimization , *MATHEMATICAL optimization , *ALGORITHMS , *SWARM intelligence , *PARETO analysis , *SIMULATION methods & models , *EXPERT systems - Abstract
Abstract: This paper presents a new multi-objective optimization algorithm in which multi-swarm cooperative strategy is incorporated into particle swarm optimization algorithm, called multi-swarm cooperative multi-objective particle swarm optimizer (MC-MOPSO). This algorithm consists of multiple slave swarms and one master swarm. Each slave swarm is designed to optimize one objective function of the multi-objective problem in order to find out all the non-dominated optima of this objective function. In order to produce a well distributed Pareto front, the master swarm is developed to cover gaps among non-dominated optima by using a local MOPSO algorithm. Moreover, in order to strengthen the capability locating multiple optima of the PSO, several improved techniques such as the Pareto dominance-based species technique and the escape strategy of mature species are introduced. The simulation results indicate that our algorithm is highly competitive to solving the multi-objective optimization problems. [Copyright &y& Elsevier]
- Published
- 2011
- Full Text
- View/download PDF
11. Multi-dimensional particle swarm optimization in dynamic environments
- Author
-
Kiranyaz, Serkan, Pulkkinen, Jenni, and Gabbouj, Moncef
- Subjects
- *
PARTICLE swarm optimization , *BENCHMARKING (Management) , *STATICS & dynamics (Social sciences) , *STOCHASTIC convergence , *ALGORITHMS , *MATHEMATICAL optimization , *SIMULATION methods & models - Abstract
Abstract: Particle swarm optimization (PSO) was proposed as an optimization technique for static environments; however, many real problems are dynamic, meaning that the environment and the characteristics of the global optimum can change in time. In this paper, we adapt recent techniques, which successfully address several major problems of PSO and exhibit a significant performance over multi-modal and non-stationary environments. In order to address the pre-mature convergence problem and improve the rate of PSO’s convergence to the global optimum, Fractional Global Best Formation (FGBF) technique is used. FGBF basically collects all the best dimensional components and fractionally creates an artificial Global Best particle (aGB) that has the potential to be a better “guide” than the PSO’s native gbest particle. To establish follow-up of local optima, we then introduce a novel multi-swarm algorithm, which enables each swarm to converge to a different optimum and use FGBF technique distinctively. Finally for the multi-dimensional dynamic environments where the optimum dimension also changes in time, we utilize a recent PSO technique, the multi-dimensional (MD) PSO, which re-forms the native structure of the swarm particles in such a way that they can make inter-dimensional passes with a dedicated dimensional PSO process. Therefore, in a multi-dimensional search space where the optimum dimension is unknown, swarm particles can seek for both positional and dimensional optima. This eventually pushes the frontier of the optimization problems in dynamic environments towards a global search in a multi-dimensional space, where there exists a multi-modal problem possibly in each dimension. We investigated both standalone and mutual applications of the proposed methods over the moving peaks benchmark (MPB), which originally simulates a dynamic environment in a unique (fixed) dimension. MPB is appropriately extended to accomplish the simulation of a multi-dimensional dynamic system, which contains dynamic environments active in several dimensions. An extensive set of experiments show that in traditional MPB application domain, FGBF technique applied with multi-swarms exhibits an impressive speed gain and tracks the global peak with the minimum error so far achieved with respect to the other competitive PSO-based methods. When applied over the extended MPB, MD PSO with FGBF can find optimum dimension and provide the (near-) optimal solution in this dimension. [Copyright &y& Elsevier]
- Published
- 2011
- Full Text
- View/download PDF
12. Real-time particle swarm optimization based current harmonic cancellation
- Author
-
Liu, Wenxin, Chung, Il-Yop, Liu, Li, Leng, Siyu, and Cartes, David A.
- Subjects
- *
PARTICLE swarm optimization , *ALGORITHMS , *SIMULATION methods & models , *MATHEMATICAL optimization , *SWARM intelligence , *OPERATIONS research , *PARAMETER estimation - Abstract
Abstract: As a powerful optimization algorithm, particle swarm optimization (PSO) has been widely applied to power system researches. However, most existing applications of PSO can only be implemented offline. The difficulties of online implementation mainly come from the unavoidable lengthy simulation time to evaluate a candidate solution. Recently, PSO was implemented online that can identify parameters in a motor control systems. In this paper, the real-time PSO (RT-PSO) based identification technique is applied to cancel current harmonics in power systems. By transforming the identification problem to optimization problem, RT-PSO can simultaneously identify four parameters associated with fundamental current from measurement. In this way, there is no need to identify the fundamental frequency separately or construct fundamental signal from identified harmonic information. The identification algorithm can be applied to three-phases independently, even for unbalanced system or single-phase system. The identified fundamental signal is then used as the reference for current harmonics cancellation. The RT-PSO based harmonic cancellation is realized with an active filter and used to compensate harmonic current created by a nonlinear load. Simulation results demonstrate that the RT-PSO algorithm can provide accurate identification of the fundamental current which in turn will result in good harmonic cancellation performance. As a capable online optimization technique, RT-PSO can be extensively applied to many optimization and control problems. [ABSTRACT FROM AUTHOR]
- Published
- 2011
- Full Text
- View/download PDF
13. An improved quantum-behaved particle swarm optimization method for short-term combined economic emission hydrothermal scheduling
- Author
-
Lu, Songfeng, Sun, Chengfu, and Lu, Zhengding
- Subjects
- *
PARTICLE swarm optimization , *HYDROTHERMAL electric power systems , *COST control , *EMISSIONS (Air pollution) , *ALGORITHMS , *HEURISTIC , *SIMULATION methods & models , *MATHEMATICAL optimization , *STOCHASTIC convergence - Abstract
Abstract: This paper presents a modified quantum-behaved particle swarm optimization (QPSO) for short-term combined economic emission scheduling (CEES) of hydrothermal power systems with several equality and inequality constraints. The hydrothermal scheduling is formulated as a bi-objective problem: (i) minimizing fuel cost and (ii) minimizing pollutant emission. The bi-objective problem is converted into a single objective one by price penalty factor. The proposed method, denoted as QPSO-DM, combines the QPSO algorithm with differential mutation operation to enhance the global search ability. In this study, heuristic strategies are proposed to handle the equality constraints especially water dynamic balance constraints and active power balance constraints. A feasibility-based selection technique is also employed to meet the reservoir storage volumes constraints. To show the efficiency of the proposed method, different case studies are carried out and QPSO-DM is compared with the differential evolution (DE), the particle swarm optimization (PSO) with same heuristic strategies in terms of the solution quality, robustness and convergence property. The simulation results show that the proposed method is capable of yielding higher-quality solutions stably and efficiently in the short-term hydrothermal scheduling than any other tested optimization algorithms. [Copyright &y& Elsevier]
- Published
- 2010
- Full Text
- View/download PDF
14. Robust and Stable Hybrid Fuzzy Control of a Pendulum-Cart System with Particle Swarm Optimization.
- Author
-
Yeong-Hwa Chang, Chang, C. W., Chan, W. S., Taur, J. S., and Tao, C. W.
- Subjects
FUZZY systems ,ALGORITHMS ,DYNAMICS ,FEASIBILITY studies ,MATHEMATICAL optimization ,SIMULATION methods & models - Abstract
In this paper, a hybrid fuzzy controller with a real-time particle swarm optimization algorithm (PSO) is presented to swing up and to stabilize the pendulum-cart system. The designed PSO with a re-start mechanism is particularly suitable for dynamic environments and its feasibility is evaluated using the typical dynamic functions. The modified particle swarm optimization is performed to on-line tune the parameters of hybrid fuzzy controllers. Also, the stability of the control system is discussed for the PSO optimized stable fuzzy control system. Simulation results, compared to conventional fuzzy control, illustrate that the proposed optimization-based control scheme can provide better control performance subject to extra disturbances. [ABSTRACT FROM AUTHOR]
- Published
- 2010
15. Parameter optimization of a multi-pass milling process using non-traditional optimization algorithms.
- Author
-
Venkata Rao, R. and Pawar, P.J.
- Subjects
MATHEMATICAL optimization ,ALGORITHMS ,SIMULATION methods & models ,PARTICLE swarm optimization ,MACHINING ,MILLING-machines ,SIMULATED annealing - Abstract
Abstract: The effective optimization of machining process parameters affects dramatically the cost and production time of machined components as well as the quality of the final products. This paper presents optimization aspects of a multi-pass milling operation. The objective considered is minimization of production time (i.e. maximization of production rate) subjected to various constraints of arbor strength, arbor deflection, and cutting power. Various cutting strategies are considered to determine the optimal process parameters like the number of passes, depth of cut for each pass, cutting speed, and feed. The upper and lower bounds of the process parameters are also considered in the study. The optimization is carried out using three non-traditional optimization algorithms namely, artificial bee colony (ABC), particle swarm optimization (PSO), and simulated annealing (SA). An application example is presented and solved to illustrate the effectiveness of the presented algorithms. The results of the presented algorithms are compared with the previously published results obtained by using other optimization techniques. [Copyright &y& Elsevier]
- Published
- 2010
- Full Text
- View/download PDF
16. Improved performance of permanent-magnet synchronous motor by using particle swarm optimization techniques.
- Author
-
Elwer, A. S. and Wahsh, S. A.
- Subjects
- *
PARTICLE swarm optimization , *MATHEMATICAL optimization , *SYNCHRONOUS electric motors , *SIMULATION methods & models , *ALGORITHMS , *CONTROL theory (Engineering) - Abstract
This paper presents a modern approach of speed control for PMSM using Particle Swarm Optimization (PSO) algorithm to optimize the parameters of the PI- Controller. The overall system simulated under various operating conditions and an experimental setup is prepared Comparison between different controllers is achieved, using PI controller which is tuned by two methods, firstly manually and secondly using PSO technique. The system is tested under variable operating conditions. The simulation results showing good dynamic response with fast recovery time and good agreement with experimental one. [ABSTRACT FROM AUTHOR]
- Published
- 2009
17. Knowledge-based cooperative particle swarm optimization
- Author
-
Jie, Jing, Zeng, Jianchao, Han, Chongzhao, and Wang, Qinghua
- Subjects
- *
MATHEMATICAL optimization , *MATHEMATICAL analysis , *ALGORITHMS , *SIMULATION methods & models - Abstract
Abstract: Particle swarm optimization is a novel swarm-intelligence-based algorithm and a valid optimization technique. However, the algorithm suffers from the premature convergence problem when facing to complex optimization problem. In order to keep the balance between the global exploration and the local exploitation validly, the paper develops a knowledge-based cooperative particle swarm optimization (KCPSO). KCPSO mainly simulates the self-cognitive and self-learning process of evolutionary agents in special environment, and introduces a knowledge billboard to record varieties of search information. Moreover, KCPSO takes advantage of multi-swarm to maintain the swarm diversity and tries to guide their evolution by the shared information. Under the guide of the shared information, KCPSO manipulates each sub-swarm to go on with local exploitation in different local area, in which every particle follows a social learning behavior mode; at the same time, KCPSO carries out the global exploration through the escaping behavior and the cooperative behavior of the particles in different sub-swarms. KCPSO can maintain appropriate swarm diversity and alleviate the premature convergence validly. The proposed model was applied to some well-known benchmarks. The relative experimental results show KCPSO is a robust global optimization method for the complex multimodal functions. [Copyright &y& Elsevier]
- Published
- 2008
- Full Text
- View/download PDF
18. Optimization design for tandem cascades of compressors based on adaptive particle swarm optimization.
- Author
-
Song, Zhaoyun and Liu, Bo
- Subjects
PARTICLE swarm optimization ,COMPUTATIONAL fluid dynamics ,MATHEMATICAL optimization ,SIMULATION methods & models ,ALGORITHMS - Abstract
To improve the flow performance of tandem cascades on design and off design incidence angle and increase the stable operation range, an optimization system for tandem cascades was developed based on an adaptive particle swarm optimization (APSO-PDC). Firstly, APSO-PDC was proposed based on adaptive selection of particle roles and population diversity control. The adaptive selection of particle roles which combines the evolutionary state and dynamic particle state estimation (DPSE) method will sort the particles into three roles to help different particles execute different search tasks during optimization process. The population diversity control, which combines comprehensive learning strategy of the comprehensive learning particle swarm optimizer (CLPSO) with evolutionary state, pretty strengthens the exploration ability and avoids falling into the local optima. The performance of APSO-PDC is evaluated by 11 unimodal and multimodal functions. Compared with the other six PSOs, the results indicate APSO-PDC has better performance in terms of algorithm accuracy and algorithm reliability. In addition, APSO-PDC is validated by optimizing two large-turning tandem cascades, including low-dimension (5 optimization variables) and high-dimension problems (34 optimization variables). Compared with the other six PSOs, the optimization results demonstrate APSO-PDC has the fastest convergence speed and simultaneously controls well the population diversity. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
19. JADE: Adaptive Differential Evolution with Optional External Archive.
- Author
-
Zhang, Jingqiao and Sanderson, Arthur C.
- Subjects
ALGORITHMS ,EVOLUTIONARY computation ,MATHEMATICAL optimization ,PARTICLE swarm optimization ,SIMULATION methods & models - Abstract
A new differential evolution (DE) algorithm, JADE, is proposed to improve optimization performance by implementing a new mutation strategy "DE/current-to-pbest" with optional external archive and updating control parameters in an adaptive manner. The DE/current-to-pbest is a generalization of the classic "DE/current-to-best" while the optional archive operation utilizes historical data to provide information of progress direction. Both operations diversify the population and improve the convergence performance. The parameter adaptation automatically updates the control parameters to appropriate values and avoids a user's prior knowledge of the relationship between the parameter settings and the characteristics of optimization problems. It is thus helpful to improve the robustness of the algorithm. Simulation results show that JADE is better than, or at least comparable to, other classic or adaptive DE algorithms, the canonical particle swarm optimization, and other evolutionary algorithms from the literature in terms of convergence performance for a set of 20 benchmark problems. JADE with an external archive shows promising results for relatively high dimensional problems. In addition, it clearly shows that there is no fixed control parameter setting suitable for various problems or even at different optimization stages of a single problem. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.