Condition Assessment of Power Transformers Based on Health Index Value

In electric power systems, health index algorithms are mostly used for evaluation of the transformer population. In this method, some assessment criteria are insensitive when it comes to judging the technical state of the edges of the age spectrum. This paper presents a new health index calculation method that aims to improve the overall effectiveness of the assessment. The proposed algorithm is based on regularly conducted oil diagnostics and easily available maintenance data to enable estimation and updating of the device’s health status in short intervals from an operational point of view. This method is compared to another health index algorithm built from the same parameters, but with different weights and an alternative result assessment philosophy. The two health index calculation methods are tested on a population of 96 power transformers and then compared to results obtained with an expert system, which is based on much more advanced diagnostic tests to determine the technical condition of the unit. The results of the experiment show that proper selection of weighting factors of the transformer’s technical condition parameters during health index calculation may help in simplifying its assessment while maintaining satisfactory accuracy in comparison to a highly advanced expert method.

Comparing Rule-Based Translation to Syntax Tree Diagram Translation

Machine translation has developed more effectively to be specified as modern linguistics characterization. It indicates the formalization of translating process by machine within humanly approaching. Recently, in order to help people communicate indirectly through written, machine translation has its own system to break and match the codes through comprehensive database of words pocket. In linguistics perspective, machine translation always be assisted by its definite performance through derivative computational system. The problem appears when users need to translate ambiguous sentence from English to Bahasa Indonesia or vice versa. The paper used rule-based system which contains particular parts in order to run the process of translating; starts from tokenization, pre-processing, reordering and morphological process which lead to output accuracy. And used syntactic diagram translation, which was carried out manually by generating sentences into small units. The result of this research showed that RBS runs by standard linguistics system; and the output of translating refer to basic translation without giving any alternative translation nor meaning. While using syntactic diagram, there are possibility to get alternative result not only by linguistics features but also based on signification meaning of both translations. Those techniques run by considering linguistics features in order to help users to get translation output better.

Scientific Approach: Model-Based Inquiry in Teaching Narrative

Curriculum 2013 is the latest curriculum created by the government to make the education in Indonesia better. Scientific approach offered in this curriculum is very remarkable to discuss, since almost all educators are talking about this approach. However, most of the educators get trouble and feel confused to apply this approach in teaching English, since it is usually applied in science class. Therefore, this study was written to show the steps of applying this approach in teaching English. This study, used library research, tried to offer new alternative vision to emerge the students’ critical thinking through Model-Based Inquiry, an activity which is able to engage the student to learn more deeply with content and embody of five characteristic of scientific knowledge in which the idea presented in the form of models are testable, revisable, explanatory, conjectural and generative. This study provided the example of teaching narrative text which might be able to be applied in the various final products which could be alternative result of this strategy.

Scientific Approach

Curriculum 2013 is the latest curriculum created by the government to make the education in Indonesia better. Scientific approach offered in this curriculum is very remarkable to discuss, since almost all educators are talking about this approach. However, most of the educators get trouble and feel confused to apply this approach in teaching English, since it is usually applied in science class. Therefore, this study was written to show the steps of applying this approach in teaching English. This study, used library research, tried to offer new alternative vision to emerge the students’ critical thinking through Model-Based Inquiry, an activity which is able to engage the student to learn more deeply with content and embody of five characteristic of scientific knowledge in which the idea presented in the form of models are testable, revisable, explanatory, conjectural and generative. This study provided the example of teaching narrative text which might be able to be applied in the various final products which could be alternative result of this strategy.

A Universal Approximation Theorem for Mixture-of-Experts Models

The mixture-of-experts (MoE) model is a popular neural network architecture for nonlinear regression and classification. The class of MoE mean functions is known to be uniformly convergent to any unknown target function, assuming that the target function is from a Sobolev space that is sufficiently differentiable and that the domain of estimation is a compact unit hypercube. We provide an alternative result, which shows that the class of MoE mean functions is dense in the class of all continuous functions over arbitrary compact domains of estimation. Our result can be viewed as a universal approximation theorem for MoE models. The theorem we present allows MoE users to be confident in applying such models for estimation when data arise from nonlinear and nondifferentiable generative processes.

An Algorithmic Friedman–Pippenger Theorem on Tree Embeddings and Applications

An $(n, d)$-expander is a graph $G = (V, E)$ such that for every $X \subseteq V$ with $|X| \leq 2n - 2$ we have $|\Gamma_G(X)| \geq (d+1)|X|$. A tree $T$ is small if it has at most $n$ vertices and has maximum degree at most $d$. Friedman and Pippenger (1987) proved that any $(n, d)$-expander contains every small tree. However, their elegant proof does not seem to yield an efficient algorithm for obtaining the tree. In this paper, we give an alternative result that does admit a polynomial time algorithm for finding the immersion of any small tree in subgraphs $G$ of $(N,D,\lambda)$-graphs $\Lambda$, as long as $G$ contains a positive fraction of the edges of $\Lambda$ and $\lambda/D$ is small enough. In several applications of the Friedman–Pippenger theorem, including the ones in the original paper of those authors, the $(n,d)$-expander $G$ is a subgraph of an $(N,D,\lambda)$-graph as above. Therefore, our result suffices to provide efficient algorithms for such previously non-constructive applications. As an example, we discuss a recent result of Alon, Krivelevich, and Sudakov (2007) concerning embedding nearly spanning bounded degree trees, the proof of which makes use of the Friedman–Pippenger theorem. We shall also show a construction inspired on Wigderson–Zuckerman expander graphs for which any sufficiently dense subgraph contains all trees of sizes and maximum degrees achieving essentially optimal parameters. Our algorithmic approach is based on a reduction of the tree embedding problem to a certain on-line matching problem for bipartite graphs, solved by Aggarwal et al. (1996).

Poincaré–Birkhoff results for Lagrangian systems with subquadratic potential

In this paper, using a recent generalisation of Morse Theory, we study the existence of periodic solutions of the Lagrangian equation (1.1) with subquadratic potential and asymptotically flat, nonconstant, time-dependent metric on ℝN. In Section 3, we get also an ‘alternative result’ about the minimal period or the existence of infinitely many solutions.