A new geometric computing theory was proposed. On the definition level of geometric elements, using the Cartesian coordinates ideology as reference, 2D and 3D ″geometric algebra elements″ (or ″geometric elements″ ...
详细信息
A new geometric computing theory was proposed. On the definition level of geometric elements, using the Cartesian coordinates ideology as reference, 2D and 3D ″geometric algebra elements″ (or ″geometric elements″ for short, which could construct an upper-level element in the solving sequence) were constructed by geometry algebraization methods. On the processing level of geometries, geometric problems were solved with geometry methods, by which a geometric element solving sequence could be constructed. Directional property was introduced into geometries in this theory and geometries were represented in a unified format. They help to simplify the processing of finding the geometric element solving sequence for a geometry problem. The paper also tried to theoretically find out an integrated solution for geometry ambiguity issues, and established a unified, standardized geometry computing architecture. The Leibniz's mind-to process geometric objects with geometric language-was implemented in an indirect way!
Solving the Hamilton-Jacobi-Isaacs (HJI) equation, commonly used in H_(infinity) optimal control, is often referred to as a two-player differential game where one player tries to minimize the cost function while the o...
详细信息
ISBN:
(纸本)9781424477456
Solving the Hamilton-Jacobi-Isaacs (HJI) equation, commonly used in H_(infinity) optimal control, is often referred to as a two-player differential game where one player tries to minimize the cost function while the other tries to maximize it. In this paper, the HJI equation is formulated online and forward-in-time using a novel single online approximator (SOLA)-based scheme to achieve optimal regulation and tracking control of affine nonlinear continuous-time systems. The SOLA-based adaptive approach is designed to learn the infinite horizon HJI equation, the corresponding optimal control input, and the worst case disturbance. A novel parameter tuning algorithm is derived which not only achieves the optimal cost function, control input, and the disturbance, but also ensures the system states remain bounded during the online learning. Lyapunov methods are used to show that all signals are uniformly ultimately bounded (UUB) while ensuring the approximated signals approach their optimal values with small bounded error. In the absence of OLA reconstruction errors, asymptotic convergence to the optimal signals is demonstrated, and simulation results illustrate the effectiveness of the approach.
Using the multiple-parameter Monte Carlo method, the effectiveness of the dual threshold voltage technique (DTV) in low power domino logic design is analyzed. Simulation results indicate that under significant tempe...
详细信息
Using the multiple-parameter Monte Carlo method, the effectiveness of the dual threshold voltage technique (DTV) in low power domino logic design is analyzed. Simulation results indicate that under significant temperature and process fluctuations, DTV is still highly effective in reducing the total leakage and active power consumption for domino gates with speed loss. Also, regarding power and delay characteristics, different structure domino gates with DTV have different robustness against temperature and process fluctuation.
We investigate a four-level superradiant laser whose intensity is proportional to N2 and whose linewidth scales as 1/N2. In the absence of spontaneous emissions, we derive the stationary solutions of the atomic full c...
详细信息
We investigate a four-level superradiant laser whose intensity is proportional to N2 and whose linewidth scales as 1/N2. In the absence of spontaneous emissions, we derive the stationary solutions of the atomic full cooperativity, analyze their stabilities, and find the corresponding irreducible representation based on group U(4). We also investigate the spectra of the phase and amplitude fluctuations of the fields inside and outside the cavity and find that the amplitude fluctuations of the output fields cannot be squeezed in the low-frequency limit, which is completely different from the three-level superradiant laser system. Finally, we consider the stationary solutions corresponding to the partial cooperativity due to the symmetry breaking of U(4) induced by the atomic spontaneous emissions.
This paper presents a new interface framework which has been added to Easy Java Simualtions' environment in order to improve its graphical features for 3D modeling. These new 3D capabilities provide users a set of...
详细信息
This paper presents a new interface framework which has been added to Easy Java Simualtions' environment in order to improve its graphical features for 3D modeling. These new 3D capabilities provide users a set of new view elements which can be used to develop models with a high degree of reality. In this way, Easy Java Simulations becomes a powerful tool to easily and quickly create 3D realistic simulations.
The reproduction of the movements of a ship by automated platforms, without the use of sensors providing exact data related to the numeric variables involved, is a non-trivial matter. The creation of an artificial vis...
详细信息
ISBN:
(纸本)9781424478149
The reproduction of the movements of a ship by automated platforms, without the use of sensors providing exact data related to the numeric variables involved, is a non-trivial matter. The creation of an artificial vision system that can follow the cadence of said ship, in six axes of freedom, is the goal of this research. Considering that a real time response is a requisite in this case, it was decided to adopt a Boolean artificial neural network system that could identify and follow arbitrary interest points that could define, as a group, a model of the movement of an observed vessel. This paper describes the development of a prototype based on the Boolean perceptron model WiSARD (Wilkie, Stonham and Aleksander's Recognition Device), that is being implemented in the C programming language on a desktop computer using a regular webcam as input.
Robust scheduling is an effective way to solve job-shop scheduling problem (JSP) under a dynamic and stochastic environment with uncertainties, which may lead to numerous schedule disruptions. Maintaining the optimiza...
详细信息
Robust scheduling is an effective way to solve job-shop scheduling problem (JSP) under a dynamic and stochastic environment with uncertainties, which may lead to numerous schedule disruptions. Maintaining the optimization obtained, the robust schedule is more stable in execution. The vast majority of the researches on robust scheduling concentrate on the development of the robustness and stabilization with an optimization target that minimizes makespan. However, other optimization targets are needed in reality, and in this paper, we introduce another optimization target that maximizes the payload of the machine, which can reflect the capacity of machine. This work applies a two-step way to achieve a robust schedule. A baseline schedule in the deterministic environment is generated first, which pursues standard optimization criterions, and then the temporal buffers are inserted into the baseline schedule which make the schedule absorb some level of unexpected disruption without rescheduling. According to the payload of each machine which should be close to the maximum at any time in execution, we can get each size of the temporal buffers inserted into the different operations. An extensive experiment is used to show the relative performance of the proposed robust schedule. It is shown that the schedule is robust and stable under the stochastic disturbance coupling with minimal makespan tardiness and symmetry payload.
作者:
Selamat, AliLim, Pei-Geok
Department of Software Engineering Faculty of Computer Science and Information System Malaysia
The rapid growth of computer technologies and the advent of the World Wide Web have increased the amount and the complexity of multimedia information. A content-based image retrieval (CBIR) system has been developed a...
详细信息
ISBN:
(纸本)9781424438853
The rapid growth of computer technologies and the advent of the World Wide Web have increased the amount and the complexity of multimedia information. A content-based image retrieval (CBIR) system has been developed as an efficient image retrieval tool, whereby the user can provide their query to the system to allow it to retrieve the user's desired image from the image database. However, the traditional relevance feedback of CBIR has some limitations that will decrease the performance of the CBIR system, such as the imbalance of training-set problem, classification problem, limited information from user problem, and insufficient training-set problem. Therefore, in this study, we proposed an enhanced relevance-feedback method to support the user query based on the representative image selection and weight ranking of the images retrieved. The support vector machine (SVM) has been used to support the learning process to reduce the semantic gap between the user and the CBIR system. From these experiments, the proposed learning method has enabled users to improve their search results based on the performance of CBIR system. In addition, the experiments also proved that by solving the imbalance training set issue, the performance of CBIR could be improved.
The problem of access control across multiple security domains in data sharing environment is addressed and a rule-based algorithm for role mapping across multi-domains is presented. The algorithm resolves efficiently...
详细信息
The problem of access control across multiple security domains in data sharing environment is addressed and a rule-based algorithm for role mapping across multi-domains is presented. The algorithm resolves efficiently the conflicts of cyclic inheritance and separation of duties, and the problem of regression inheritance. The algorithm takes the “Least privilege theorem” into account and prohibits accesses from illegal domains. Further more, the algorithm makes the establishment of role mapping across multi-domains more efficiently by preserving historical information of role mapping paths established successfully before, and satisfies preferably the access control requirement across dynamic multi-domains in data sharing environment. Evaluation by access instances shows the efficiency of our algorithm.
Moving horizon estimation for discrete-time nonlinear systems is addressed by using fast optimization algorithms for which stability results under general conditions are ensured. The solution of the on-line moving hor...
Moving horizon estimation for discrete-time nonlinear systems is addressed by using fast optimization algorithms for which stability results under general conditions are ensured. The solution of the on-line moving horizon estimation problem is obtained by using the sampling time to solve a reference problem with model-predicted measurements while waiting for the next measurement. In order to correct the resulting solution, a quick nonlinear programming sensitivity calculation is accomplished as soon as the new measurement becomes available. The stability properties of such moving horizon estimation algorithm is proved under general conditions, which make the overall approach suitable for real settings with strong nonlinearities.
暂无评论