Peningkatan Keterampilan Menulis Karangan Menggunakan Media Audio Visual Pembelajaran Bahasa Indonesia

Skilled Writing Upgrades Indonesian Learning by Using Media Audio Visual on Students This study aims to improve students ability to write a narrative. This research uses descriptive method, a form of research that is classroom action research, collaboratively, kind study is qualitative, the subjects in this study were students and teachers. The observation of teaching writing narrative using the media audio visual at each cycle has increased based on performance indicators. This is shown on cohesion, as well as spelling and punctuation in the first cycle and second cycle. This suggests that learning Indonesian Language using the media audio visual can improve the skilled to write a narrative

Exact ground state of finite Bose-Einstein condensates on a ring

The exact ground state of the many-body Schr\"odinger equation for $N$ bosons on a one-dimensional ring interacting via pairwise $\delta$-function interaction is presented for up to fifty particles. The solutions are obtained by solving Lieb and Liniger's system of coupled transcendental equations for finite $N$. The ground state energies for repulsive and attractive interaction are shown to be smoothly connected at the point of zero interaction strength, implying that the \emph{Bethe-ansatz} can be used also for attractive interaction for all cases studied. For repulsive interaction the exact energies are compared to (i) Lieb and Liniger's thermodynamic limit solution and (ii) the Tonks-Girardeau gas limit. It is found that the energy of the thermodynamic limit solution can differ substantially from that of the exact solution for finite $N$ when the interaction is weak or when $N$ is small. A simple relation between the Tonks-Girardeau gas limit and the solution for finite interaction strength is revealed. For attractive interaction we find that the true ground state energy is given to a good approximation by the energy of the system of $N$ attractive bosons on an infinite line, provided the interaction is stronger than the critical interaction strength of mean-field theory.Comment: 28 pages, 11 figure

Comparing the reliability of networks by spectral analysis

We provide a method for the ranking of the reliability of two networks with the same connectance. Our method is based on the Cheeger constant linking the topological property of a network with its spectrum. We first analyze a set of twisted rings with the same connectance and degree distribution, and obtain the ranking of their reliability using their eigenvalue gaps. The results are generalized to general networks using the method of rewiring. The success of our ranking method is verified numerically for the IEEE57, the Erd\H{o}s-R\'enyi, and the Small-World networks.Comment: 7 pages, 3 figure

Exact solution of a one-dimensional continuum percolation model

I consider a one dimensional system of particles which interact through a hard core of diameter \si and can connect to each other if they are closer than a distance $d$. The mean cluster size increases as a function of the density $\rho$ until it diverges at some critical density, the percolation threshold. This system can be mapped onto an off-lattice generalization of the Potts model which I have called the Potts fluid, and in this way, the mean cluster size, pair connectedness and percolation probability can be calculated exactly. The mean cluster size is S = 2 \exp[ \rho (d -\si)/(1 - \rho \si)] - 1 and diverges only at the close packing density \rho_{cp} = 1 / \si . This is confirmed by the behavior of the percolation probability. These results should help in judging the effectiveness of approximations or simulation methods before they are applied to higher dimensions.Comment: 21 pages, Late

Cluster Editing: Kernelization based on Edge Cuts

Kernelization algorithms for the {\sc cluster editing} problem have been a popular topic in the recent research in parameterized computation. Thus far most kernelization algorithms for this problem are based on the concept of {\it critical cliques}. In this paper, we present new observations and new techniques for the study of kernelization algorithms for the {\sc cluster editing} problem. Our techniques are based on the study of the relationship between {\sc cluster editing} and graph edge-cuts. As an application, we present an ${\cal O}(n^2)$-time algorithm that constructs a $2k$ kernel for the {\it weighted} version of the {\sc cluster editing} problem. Our result meets the best kernel size for the unweighted version for the {\sc cluster editing} problem, and significantly improves the previous best kernel of quadratic size for the weighted version of the problem

Robot-Assisted Retroperitoneal Partial Nephrectomy: Technique and Perioperative Results

Growing evidence supports the use of nephron-sparing techniques for the management of appropriately selected renal masses up to 7-cm. Compared with the surgical standard of open partial nephrectomy, minimally invasive approaches have demonstrated equivalent cancer control with reduced patient morbidity. Robot assistance has the potential to provide patients and physicians greater access to minimally invasive nephron-sparing surgery. We describe a robot-assisted retroperitoneal approach for the management of posterior renal masses. Our early results suggest reduced perioperative morbidity with the ability to manage more complex tumors.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/90442/1/end-2E2010-2E0481.pd

Computing in Additive Networks with Bounded-Information Codes

This paper studies the theory of the additive wireless network model, in which the received signal is abstracted as an addition of the transmitted signals. Our central observation is that the crucial challenge for computing in this model is not high contention, as assumed previously, but rather guaranteeing a bounded amount of \emph{information} in each neighborhood per round, a property that we show is achievable using a new random coding technique. Technically, we provide efficient algorithms for fundamental distributed tasks in additive networks, such as solving various symmetry breaking problems, approximating network parameters, and solving an \emph{asymmetry revealing} problem such as computing a maximal input. The key method used is a novel random coding technique that allows a node to successfully decode the received information, as long as it does not contain too many distinct values. We then design our algorithms to produce a limited amount of information in each neighborhood in order to leverage our enriched toolbox for computing in additive networks

A superadditivity and submultiplicativity property for cardinalities of sumsets

For finite sets of integers A1, . . . ,An we study the cardinality of the n-fold sumset A1 + · · · + An compared to those of (n − 1)-fold sumsets A1 + · · · + Ai−1 + Ai+1 + · · · + An. We prove a superadditivity and a submultiplicativity property for these quantities. We also examine the case when the addition of elements is restricted to an addition graph between the sets

Distributed Testing of Excluded Subgraphs

We study property testing in the context of distributed computing, under the classical CONGEST model. It is known that testing whether a graph is triangle-free can be done in a constant number of rounds, where the constant depends on how far the input graph is from being triangle-free. We show that, for every connected 4-node graph H, testing whether a graph is H-free can be done in a constant number of rounds too. The constant also depends on how far the input graph is from being H-free, and the dependence is identical to the one in the case of testing triangles. Hence, in particular, testing whether a graph is K_4-free, and testing whether a graph is C_4-free can be done in a constant number of rounds (where K_k denotes the k-node clique, and C_k denotes the k-node cycle). On the other hand, we show that testing K_k-freeness and C_k-freeness for k>4 appear to be much harder. Specifically, we investigate two natural types of generic algorithms for testing H-freeness, called DFS tester and BFS tester. The latter captures the previously known algorithm to test the presence of triangles, while the former captures our generic algorithm to test the presence of a 4-node graph pattern H. We prove that both DFS and BFS testers fail to test K_k-freeness and C_k-freeness in a constant number of rounds for k>4