Computational AutoGnomics

2007 ◽  
pp. 287-310 ◽  
Author(s):  
Jon Ray Hamann
Keyword(s):  
New Method ◽  
Commercial Application ◽  
Theory Formation ◽  
Theory Of Intelligence ◽  
The Given ◽  
Theory Of Theory ◽  
Meta Theory

This chapter introduces an approach to understanding the “origin” and nature of Mind via a new method of integrated inquiry/inference/intuition. The method is concomitantly applicable to the foundations notions (philosophically, formally, and theoretically) which themselves subtend a theory of theory formation. An approach is posited regarding the formalization of an order and its derivative calculus, the latter taken as a formulation of the disorder experientially related to the given order, which also implies a reorder(ing) format that, within a Nonseparable System of order/disorder/reorder Relations, suggests The Form of a meta theory of theory formation. The Form will, in turn, be invoked in formulating a Theory of Intelligence/Mind and its technological implementations as Synthetic Intelligence/Mind, i.e. the AutoGnome, a semiotic machine interpreting C.S. Peirce. The key commercial application of the AutoGnome reported here is that of the IntelliSite (an Intelligent Website generically branded as TrueThinker.com) and its derivative implementations.

scholarly journals A New Method for Inextensible Flows of Timelike Curves in Minkowski Space-Time E14

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Talat Körpinar
Keyword(s):  
Partial Differential Equations ◽  
Differential Equations ◽  
Minkowski Space ◽  
Space Time ◽  
New Method ◽  
Frenet Frame ◽  
Partial Differential ◽  
Minkowski Space Time ◽  
Inextensible Flows ◽  
The Given

We construct a new method for inextensible flows of timelike curves in Minkowski space-time E14. Using the Frenet frame of the given curve, we present partial differential equations. We give some characterizations for curvatures of a timelike curve in Minkowski space-time E14.

Complete Force Balancing of Spatial Linkages

1971 ◽  
Vol 93 (2) ◽  
pp. 620-626 ◽  
Author(s):  
Roger E. Kaufman ◽  
George N. Sandor
Keyword(s):  
Center Of Mass ◽  
Time Dependent ◽  
New Method ◽  
Operator Equations ◽  
Spatial Linkages ◽  
The Given

A new method permits the complete force balancing of spatial linkages such as the RSSR and RSSP mechanisms. Operator equations are written describing the location of the center of mass for the given mechanism. The coefficients of the time-dependent terms are set to zero by properly locating the mass centers of selected links. As a result, the location of the total center of mass is invariant and there is no resultant shaking force.

scholarly journals Intersect a quartic to extract its roots

2017 ◽  
Vol 16 (1) ◽  
pp. 73-76
Author(s):  
Raghavendra G. Kulkarni
Keyword(s):  
Quadratic Polynomial ◽  
New Method ◽  
Quadratic Equations ◽  
Quartic Polynomial ◽  
Root Term ◽  
The Given

AbstractIn this note we present a new method for determining the roots of a quartic polynomial, wherein the curve of the given quartic polynomial is intersected by the curve of a quadratic polynomial (which has two unknown coefficients) at its root point; so the root satisfies both the quartic and the quadratic equations. Elimination of the root term from the two equations leads to an expression in the two unknowns of quadratic polynomial. In addition, we introduce another expression in one unknown, which leads to determination of the two unknowns and subsequently the roots of quartic polynomial.

Innovative Genetic Algorithmic Approach to Select Potential Patches Enclosing Real and Complex Zeros of Nonlinear Equation

2021 ◽  
pp. 223-243
Author(s):  
Vijaya Lakshmi V. Nadimpalli ◽  
Rajeev Wankar ◽  
Raghavendra Rao Chillarige
Keyword(s):  
Genetic Algorithm ◽  
Nonlinear Equation ◽  
Search Space ◽  
Regions Of Interest ◽  
New Method ◽  
Real Numbers ◽  
Algorithmic Approach ◽  
Space Reduction ◽  
Complex Zeros ◽  
The Given

In this article, an innovative Genetic Algorithm is proposed to find potential patches enclosing roots of real valued function f:R→R. As roots of f can be real as well as complex, the function is reframed on to complex plane by writing it as f(z). Thus, the problem now is transformed to finding potential patches (rectangles in C) enclosing z such that f(z)=0, which is resolved into two components as real and imaginary parts. The proposed GA generates two random populations of real numbers for the real and imaginary parts in the given regions of interest and no other initial guesses are needed. This is the prominent advantage of the method in contrast to various other methods. Additionally, the proposed ‘Refinement technique' aids in the exhaustive coverage of potential patches enclosing roots and reinforces the selected potential rectangles to be narrow, resulting in significant search space reduction. The method works efficiently even when the roots are closely packed. A set of benchmark functions are presented and the results show the effectiveness and robustness of the new method.

"MIDDLE" PERIODIC ORBIT AND ITS APPLICATION TO CHAOS CONTROL

2002 ◽  
Vol 12 (08) ◽  
pp. 1869-1876
Author(s):  
LING YANG ◽  
ZENGRONG LIU ◽  
YONGAI ZHENG
Keyword(s):  
Periodic Orbit ◽  
Topological Entropy ◽  
Chaotic Attractor ◽  
Chaos Control ◽  
Initial Point ◽  
New Method ◽  
Controlling Chaos ◽  
The Given

In this paper, a new method, by which any point in a chaotic attractor can be guided to any target periodic orbit, is proposed. The "Middle" periodic orbit is used to lead an initial point in a chaotic attractor to a neighborhood of the target orbit, and then controlling chaos can be achieved by the improved OGY method. The time needed in the method using "Middle" periodic orbit is less than that of the OGY method, and is inversely proportional to the square of the topological entropy of the given map. An example is used to illustrate the results.

Measurement for the Ship Noise with a Single Vector Sensor

2013 ◽  
Vol 303-306 ◽  
pp. 448-452
Author(s):  
Hua Lin Lan ◽  
Yun Fei Lv ◽  
Jun Jie Shi
Keyword(s):  
Yellow Sea ◽  
Doa Estimation ◽  
The Other ◽  
New Method ◽  
The Yellow Sea ◽  
Radiated Noise ◽  
Vector Sensor ◽  
Yellow Sea Of China ◽  
Measurement Efficiency ◽  
The Given

To suppress the interference of radiated noise from the other ship and improve the measurement efficiency, a new method of the measurement for the ship noise with a single vector sensor was proposed. The ship at different direction were classified via the DOA estimation with a single vector sensor, then the radiated noise from the special ship was accumulated. The experiment of measuring the ship noise with a single vector sensor was conducted in the Yellow sea of China in the summer of 2010. The results showed the validity of the given method.

scholarly journals A SAT Approach to Branchwidth

2017 ◽  
Author(s):  
Neha Lodha ◽  
Sebastian Ordyniak ◽  
Stefan Szeider
Keyword(s):  
Fixed Point ◽  
Heuristic Approach ◽  
New Method ◽  
The Core ◽  
Small Width ◽  
Sat Encoding ◽  
Branch Decompositions ◽  
The Given

Branch decomposition is a prominent method for structurally decomposing a graph, hypergraph or CNF formula. The width of a branch decomposition provides a measure of how well the object is decomposed. For many applications it is crucial to compute a branch decomposition whose width is as small as possible. We propose a SAT approach to finding branch decompositions of small width. The core of our approach is an efficient SAT encoding which determines with a single SAT-call whether a given hypergraph admits a branch decomposition of certain width. For our encoding we develop a novel partition-based characterization of branch decompositions. The encoding size imposes a limit on the size of the given hypergraph. In order to break through this barrier and to scale the SAT approach to larger instances, we develop a new heuristic approach where the SAT encoding is used to locally improve a given candidate decomposition until a fixed-point is reached. This new method scales now to instances with several thousands of vertices and edges.

A New Approach for Simplification of Logical Propositions with Two Propositional Variables Using Truth Tables

2020 ◽  
Vol 13 ◽  
Author(s):  
Maher Nabulsi ◽  
Nesreen Hamad ◽  
Sokyna Alqatawneh
Keyword(s):  
Digital Circuits ◽  
Truth Table ◽  
New Method ◽  
Alternative Methods ◽  
Discrete Mathematics ◽  
New Approach ◽  
Logical Proposition ◽  
The Given ◽  
First Time ◽  
Truth Tables

Background: Propositions simplification is a classic topic in discrete mathematics that is applied in different areas of science such as programs development and digital circuits design. Investigating alternative methods would assist in presenting different approaches that can be used to obtain better results. This paper proposes a new method to simplify any logical proposition with two propositional variables without using the logical equivalences. Methods: This method is based on constructing a truth table for the given proposition, and applying one of the following two concepts: the sum of Minterms or the product of Maxterms which has not been used previously in discrete mathematics, along with five new rules that are introduced for the first time in this work. Results: The proposed approach was applied to some examples, where its correctness was verified by applying the logical equivalences method. Applying the two methods showed that the logical equivalences method cannot give the simplest form easily; especially if the proposition cannot be simplified, and it cannot assist in determining whether the obtained solution represent the simplest form of this proposition or not. Conclusion: In comparison with the logical equivalences method, the results of all the tested propositions show that our method is outperforming the current used method, as it provides the simplest form of logical propositions in fewer steps, and it overcomes the limitations of logical equivalences method. Originality/value: This paper fulfils an identified need to provide a new method to simplify any logical proposition with two propositional variables.

A new method for inextensible flows of timelike curves in 4-dimensional LP-Sasakian manifolds

2015 ◽  
Vol 08 (04) ◽  
pp. 1550073 ◽  
Author(s):  
Talat Körpinar
Keyword(s):  
Tensor Field ◽  
Sasakian Manifold ◽  
New Method ◽  
Conformally Flat ◽  
Necessary And Sufficient Condition ◽  
Sasakian Manifolds ◽  
Practical Applications ◽  
Inextensible Flows ◽  
Necessary And Sufficient ◽  
The Given

Inextensible flows of timelike curves plays an important role in practical applications. In this paper, we construct a new method for inextensible flows of timelike curves in a conformally flat, quasi conformally flat and conformally symmetric 4-dimensional LP-Sasakian manifold. With this new representation, we derive the necessary and sufficient condition for the given curve to be the inextensible flow. By using curvature tensor field, we give some characterizations for curvatures of a timelike curve in a conformally flat, quasi conformally flat and conformally symmetric 4-dimensional LP-Sasakian manifold. Finally, we obtain flows of some associated curves of timelike curves.

Sign in / Sign up

Export Citation Format

Share Document