Tabular Algorithm Research Articles

Traveling-wave fault location algorithms in hybrid multi-terminal networks with a tree-like structure

Traveling-wave methods of the fault location prove their practical efficiency for the power transmission lines (TL) with an arbitrary configuration of any voltage class. This paper formulates algorithms to automate the process of the fault location in the TLs with a tree-like structure. The error of the simplified traveling-wave fault location (TWFL) algorithm based on the average propagation velocity of the transient signals (TS) is analyzed. A tabular algorithm for TWFL, which considers different propagation velocities of the TS in different segments of a hybrid network is proposed. An adaptive TWFL algorithm that considers the registration of the TSs with known places of their occurrence is proposed, to reduce the impact of the inaccuracy of the initial different network segments’ lengths and TS’s propagation velocity determination.

Special nursing care of patients with orthotopic bladder in the postoperative period

Bladder cancer is one of the main problems in urology in terms of diagnosis and treatment, due to its high in­cidence and its course of development. Bladder cancer ranks fifth as the cause of death from malignant cancer (1.2% for women and 4.0% for men). Radical cystectomy has become the primary method for the treatment of invasive bladder cancer. AIM : The aim of this paper is using the general experience, to make tabular algorithm of early and late postop­erative urological nursing care of patients with radical cystectomy and orthotopic substitution MATERIALS AND METHODS : Our research is based on: Olivia Herdiman et al. and the Clinic of Urology at the St. Anna University Hospital, Varna for the period 2012-2016. Our methods include: a documentary meth­od, observation, and analysis conclusions. Referring to the presented special urological nursing care of the postoperative period of orthopic bladder in the report we can arrive at the conclusion that: Special urological care is intensive and patients need overall treatment. An educated and observant urologic nurse can avoid much of the postoperative complications with timely and quality health care. After cystectomy and orthotopic replacement patients need psychological, family and social support. After cystectomy, patients need to be trained by a urologic nurse to monitor urination, fluid intake and ad­here to a proper diet. The instructions include involving a relative to have as a support outside the hospital. Advantages of the algorithm for early and late postoperative complications: contributes to the analytical and clinical way of thinking of urologic nurses; reduces the period of hospitalization of the patient; reduces the cost of postoperative recovery; provides quality health care; increases confidence in the team; increases the trust of the patient.

Reliability of fuzzy systems evaluation methodology using different types of vague sets

Purpose. Development of the reliability calculating methodology of fuzzy systems with components, reliability parameters of which are described by the membership functions of various kinds. Methodology. Systematic analysis of the known approaches to the assessment of the reliability of fuzzy systems with vague boundaries and different kinds of membership functions. Findings. A unified description and the new tabular algorithm of various arithmetic operations run between the various types of fuzzy sets are proposed and tabular methods of reliability analysis of the basic structures of fuzzy systems are developed. Originality. A generalized description of triangular and trapezoid-shaped accessory functions of fuzzy boundaries in a special tuples is introduced, analytical expressions for the formation of tabular schedules of their functions and the calculation of the reliability of fuzzy systems with complex structures are obtained: sequential, redundant - parallel, serial-parallel, parallel-serial. The practical value.The obtained models and tabular algorithms simplify the calculations of the reliability of complex electro-mechanical human-machine automation systems with fuzzy parameters and vague boundaries.

Evaluating measurement and process capabilities using tabular algorithm procedure with three quality measures

In a normal quality improvement activity, the measurement system analysis (MSA) is assessed prior to process capability analysis (PCA). The tabular algorithm is widely applied for MSA. This research extends the use of the tabular algorithm for concurrent MSA and PCA. In practice, several indices are used to judge the capability of the measurement system, including precision-to-tolerance ( PTR), percentage repeatability, and repeatability and reproducibly (% R& R), number of distinct categories ( NDC), whereas the most common index for assessing the capability of manufacturing process is the potential process capability index, C p. In order to assess the capabilities of a measurement system and manufacturing concurrently, these indices are combined into two proposed capabilities assessment procedures. The first procedure adopts the PTR, % R& R and C p, while the second procedure employs the PTR, NDC and C p. Three previously conducted case studies are utilized for illustration. The results showed that the tabular algorithm with either capabilities assessment procedure effectively judged the capabilities of the measurement system and manufacturing process, which may save considerable engineering efforts. In conclusion, the tabular algorithm combined with the proposed assessment procedures can provide valuable guidelines that can be easily understood and applied by practitioners in a wide range of industrial applications.

MINIMIZING A LINEAR OBJECTIVE FUNCTION SUBJECT TO FUZZY RELATION EQUATIONS CONSTRAINTS WITH MAX-HAMACHER PRODUCT COMPOSITION

In this paper, an optimization model with a linear objective function subject to a system of fuzzy relation equations, using max-Hamacher product composition operator, is presented. Since its nonempty feasible solution set is in general a nonconvex set, conventional linear programming methods are not suitable to solve such a problem, so an efficient solution procedure for such problems is necessary. In this paper, the feasible solution set of this problem is studied at first. Then, one efficient algorithm (i.e. tabular method algorithm) is proposed in order to solve the problem. Some procedures are also presented to reduce the original problem. Then, the reduced problem is decomposed (if possible) into several sub-problems with smaller dimensions, so solving them becomes very easier by the algorithm. By combining the algorithm and these procedures, another more efficient algorithm is suggested in order to obtain the optimal solution of the original problem. Some numerical examples are also given to illustrate the algorithms.

Tabular parsing and algebraic transformations

Tabular parsing is described by means of two homomorphic algebras. In this setting, the parsing problem is described as the computation of the inverse image of an input string with respect to the homomorphism. Tabulation is obtained by constructing a quotient of the first algebra and using a finite subalgebra of the second algebra. The valid parse items are the elements generated by the variable-free terms in the product of these two algebras. This yields an algebraic construction method for tabular algorithms. We demonstrate the method by constructing a tabular bottom-up head-corner algorithm for context-free grammars. We then use the algebraic description of this algorithm to construct a tabular algorithm for linear indexed grammars, using a correctness-preserving algebraic transformation. This transformation is a formalization of the idea of an efficient representation of the unbounded LIG stacks that is stated only informally in previous constructions of LIG algorithms. The main feature of this method is the modularity of the construction, by allowing simpler tabular algorithms to be reused for the construction of more complex ones.

A TABULAR ALGORITHM FOR TESTING THE ROBUST HURWITZ STABILITY OF CONVEX COMBINATIONS OF COMPLEX POLYNOMIALS

In this paper we present a tabular algorithm for testing the Hurwitz property of a segment of complex polynomials. The algorithm consists in constructing a parametric Routh-like array with polynomial entries and generating Sturm sequences for checking the absence of zeros of two real polynomials in the interval (0, 1). The presented algorithm is easy to implement. Moreover, it accomplishes the test in a finite number of arithmetic operations because it does not invoke any numerical root-finding procedure.

An improved stability test algorithm for two-dimensional digital filters

In this paper, we show that the tabular algorithm given by Jury (1991) for obtaining inner determinants with numerical entries is also valid for the case of polynomial entries. Based on this algorithm, the new stability criterion recently proposed by Yang et al. (1998) for two-dimensional (2-D) digital filters can be efficiently implemented. As compared with the tabular algorithm given by Yang et al., the proposed algorithm leads to a great reduction in the order of polynomial entries of the array from n/sub 2/2/sup n1-1/ to n/sub 1/n/sub 2/.

Interleaving natural language parsing and generation through uniform processing

We present a new model of natural language processing in which natural language parsing and generation are strongly interleaved tasks. Interleaving of parsing and generation is important if we assume that natural language understanding and production are not only performed in isolation but also work together to obtain subsentential interactions in text revision or dialog systems. The core of the model is a new uniform agenda-driven tabular algorithm, called UTA . Although uniformly defined, UTA is able to configure itself dynamically for either parsing or generation, because it is fully driven by the structure of the actual input—a string for parsing and a semantic expression for generation. Efficient interleaving of parsing and generation is obtained through item sharing between parsing and generation. This novel processing strategy facilitates the automatic exchange of items (i.e., partial results) computed in one direction to the other direction as well. The advantage of UTA in combination with the item sharing method is that we are able to extend the use of memorization techniques to the case of an interleaved approach. In order to demonstrate UTA 's utility for developing high-level performance methods, we present a new algorithm for incremental self-monitoring during natural language production.

A tabular simplex-type algorithm as a teaching aid for general LP models

The presentation of the simplex method, which solves linear programming (LP) problems, is not universal. In the U.S.A. instructors on the West coast enjoy solving the minimization problems, while in the East the maximization version is preferred. Even within each of these groups you will find differences in presenting the simplex rules. Consider an LP problem in which some constraints are in ( = ) or ( 2 ) forms with the right- hand side (R.H.S.) non-negative. For this type of problem the usual simplex algorithm (big M-method) requires additional variables (artificial variables) and introducing penalty terms in the objective function. Enough experience has been gained showing that some students, particularly non-mathematical majors, have difficulty in understanding the intuitive notion of this algorithm. This is the reason and the key factor in motivating some authors in trying to develop algorithms which do not involve any artificial variables and penalty terms. Recently, several new algorithms which generally avoid the use of artificial variables, for the sake of simplicity, appeared in some textbooks (see, for example, Refs 1, p. 302; 2, p. 2531 for such algorithms). Unfortunately, these algorithms are not for the general purpose of solving all types of LP problems and somehow mislead students. For example, in following all the steps given in these types of algorithms for the following problem: one never gets to the final tableau, in other words the algorithm never terminates. In Section 2 a new algorithm is presented which efficiently incorporates the regular and dual simplex algorithms. The strategy adapted for the new algorithm is summarized by the following two phases: Phase I. Phase II. Push toward a neighboring vertex of the optimal solution while trying to maintain feasibility. If pushed too far in Phase I, pull back toward the optimal vertex (if any).

Equivalence of the Present Worth and Revenue Requirements Methods of Capital Investment Analysis

Abstract The minimum revenue requirements method of capital investment analysis is widely used by investor-owned utilities. The present worth method is more familiar to graduates of industrial engineering curricula. This paper considers a particular variant of the minimum revenue requirements method and presents the assumptions that must be adopted to insure exact equivalence between the two methods. A numerical example is provided to illustrate the tabular computation algorithm commonly used by practitioners of both methods. Several models for computing revenue requirements are given, each based on a different view of the cost of capital. The results of these computations are compared to those obtained when the present worth method is used to treat borrowed funds both implicitly and explicitly. Theorems from Oso [13] are used to generalize the results. Additional theorems extend findings regarding the equivalence of the minimum revenue requirements and the present worth methods.