Aplikasi Geolistrik 3-dimensi Untuk Mengetahui Sebaran Limbah Rco (Rubber Compound Oils) Di Kabupaten Kendal

Teknologi pengolahan limbah ban karet bekas hingga menghasilkan minyak bakar RCO (Rubber Compound Oils) merupakan solusi menumpuknya ban bekas tidak terpakai. Namun limbah pembuatan minyak bakar RCO yang dibuang langsung berakibat pada pencemaran lingkungan. Tujuan dari penelitian ini adalah mengetahui nilai resistivitas dan pola sebaran 3-dimensi limbah industri RCO di daerah pabrik pengolahan ban bekas Kecamatan Boja, Kabupaten Kendal. Pengambilan data menggunakan metode geolistrik tahanan jenis konfigurasi Wenner dengan spasi antar elektroda lima meter. Data nilai resistivitas limbah industri minyak bakar RCO diolah menggunakan software IPI2Win, kemudian distribusi resistivitas digambarkan dalam bentuk 3-dimensi menggunakan software Res2dinv, Res3dinv, Slicer Dicer. Hasil interpretasi 3-dimensi menyimpulkan bahwa limbah industri minyak bakar RCO telah menyebar lebih dari 43,75 meter ke arah timur pabrik, lebih dari 20 meter ke arah utara dan kedalaman lebih dari 12 meter dengan nilai resistivitas 11-20 ohm.m. Limbah diduga tersebar pada lapisan tanah dengan struktur batuan lempung dan pasir. {0>Teknologi pengolahan limbah ban karet bekas hingga menghasilkan minyak bakar RCO (Rubber Compound Oils) merupakan solusi menumpuknya ban bekas tidak terpakai.<}0{>Waste treatment technology of used rubber tires to produce RCO (Rubber Compound Oils) fuel oil is a solution of the accumulatoin of abandoned used tires.<0} {0>Namun limbah pembuatan minyak bakar RCO yang dibuang langsung berakibat pada pencemaran lingkungan.<}0{>However, the oil conversion of dumped RCO wastes might cause environmental pollution.<0} {0>Tujuan dari penelitian ini adalah mengetahui nilai resistivitas dan pola sebaran 3-dimensi limbah industri RCO di daerah pabrik pengolahan ban bekas Kecamatan Boja, Kabupaten Kendal.<}0{>The purpose of this study was to determine the resistivity value and the pattern of 3D distribution of industrial RCO wastes in a treatment plant, subdistrict of Boja, District of Kendal.<0} {0>Pengambilan data menggunakan metode geolistrik tahanan jenis konfigurasi Wenner dengan spasi antar elektroda lima meter.<}0{>Data were collected using geoelectric resistivity tool with Wenner configuration with inter-electrode space of 5 meters.<0} {0>Data nilai resistivitas limbah industri minyak bakar RCO diolah menggunakan software IPI2Win, kemudian distribusi resistivitas digambarkan dalam bentuk 3-dimensi menggunakan software Res2dinv, Res3dinv, Slicer Dicer.<}0{>Data of resistivity values of RCO industrial oil wastes were processed using IPI2Win software, subsequently the resistivity distribution was drawn into 3D graphs Res2dinv; Res3dinv; and Slicer Dicer software.<0} {0>Hasil interpretasi 3-dimensi menyimpulkan bahwa limbah industri minyak bakar RCO telah menyebar lebih dari 43,75 meter ke arah timur pabrik, lebih dari 20 meter ke arah utara dan kedalaman lebih dari 12 meter dengan nilai resistivitas 11-20 ohm.m. Limbah diduga tersebar pada lapisan tanah dengan struktur batuan lempung dan pasir.<}0{>Result of 3D interpretation suggested that the RCO oil waste have spread more than 43.75 meters eastward, more than 20 meters northward, and have penetrated the soil at the depth of 12 meters, with resistivity values of ranging from 11 to 20 Ωm. The RCO oil waste was supposedly to have spread on soil layers with a sandy loam rock structure.<0

A 2k2k-Vertex Kernel for Maximum Internal Spanning Tree

We consider the parameterized version of the maximum internal spanning tree problem, which, given an $n$-vertex graph and a parameter $k$, asks for a spanning tree with at least $k$ internal vertices. Fomin et al. [J. Comput. System Sci., 79:1-6] crafted a very ingenious reduction rule, and showed that a simple application of this rule is sufficient to yield a $3k$-vertex kernel. Here we propose a novel way to use the same reduction rule, resulting in an improved $2k$-vertex kernel. Our algorithm applies first a greedy procedure consisting of a sequence of local exchange operations, which ends with a local-optimal spanning tree, and then uses this special tree to find a reducible structure. As a corollary of our kernel, we obtain a deterministic algorithm for the problem running in time $4^k \cdot n^{O(1)}$

Polynomial Delay Algorithm for Listing Minimal Edge Dominating sets in Graphs

The Transversal problem, i.e, the enumeration of all the minimal transversals of a hypergraph in output-polynomial time, i.e, in time polynomial in its size and the cumulated size of all its minimal transversals, is a fifty years old open problem, and up to now there are few examples of hypergraph classes where the problem is solved. A minimal dominating set in a graph is a subset of its vertex set that has a non empty intersection with the closed neighborhood of every vertex. It is proved in [M. M. Kant\'e, V. Limouzy, A. Mary, L. Nourine, On the Enumeration of Minimal Dominating Sets and Related Notions, In Revision 2014] that the enumeration of minimal dominating sets in graphs and the enumeration of minimal transversals in hypergraphs are two equivalent problems. Hoping this equivalence can help to get new insights in the Transversal problem, it is natural to look inside graph classes. It is proved independently and with different techniques in [Golovach et al. - ICALP 2013] and [Kant\'e et al. - ISAAC 2012] that minimal edge dominating sets in graphs (i.e, minimal dominating sets in line graphs) can be enumerated in incremental output-polynomial time. We provide the first polynomial delay and polynomial space algorithm that lists all the minimal edge dominating sets in graphs, answering an open problem of [Golovach et al. - ICALP 2013]. Besides the result, we hope the used techniques that are a mix of a modification of the well-known Berge's algorithm and a strong use of the structure of line graphs, are of great interest and could be used to get new output-polynomial time algorithms.Comment: proofs simplified from previous version, 12 pages, 2 figure

Dynamical mass generation in quantum field theory : some methods with application to the Gross-Neveu model and Yang-Mills theory

We introduce some techniques to investigate dynamical mass generation. The Gross-Neveu model (GN) is used as a toy model, because the GN mass gap is exactly known, making it possible to check reliability of the various methods. Very accurate results are obtained. Also application to SU(N) Yang-Mills (YM) is discussed.Comment: 8 LaTeX2e pages, uses Kluwer class file crckbked.cls. Kluwer package included. To appear in: Proceedings of the NATO Advanced Research Workshop on "Confinement, Topology, and other Non-Perturbative Aspects of QCD", Stara Lesna, Slovakia, 21-27 jan 200

Wilson Expansion of QCD Propagators at Three Loops: Operators of Dimension Two and Three

In this paper we construct the Wilson short distance operator product expansion for the gluon, quark and ghost propagators in QCD, including operators of dimension two and three, namely, A^2, m^2, m A^2, \ovl{\psi} \psi and m^3. We compute analytically the coefficient functions of these operators at three loops for all three propagators in the general covariant gauge. Our results, taken in the Landau gauge, should help to improve the accuracy of extracting the vacuum expectation values of these operators from lattice simulation of the QCD propagators.Comment: 20 pages, no figure

Lower Bounds for the Graph Homomorphism Problem

The graph homomorphism problem (HOM) asks whether the vertices of a given $n$-vertex graph $G$ can be mapped to the vertices of a given $h$-vertex graph $H$ such that each edge of $G$ is mapped to an edge of $H$. The problem generalizes the graph coloring problem and at the same time can be viewed as a special case of the $2$-CSP problem. In this paper, we prove several lower bound for HOM under the Exponential Time Hypothesis (ETH) assumption. The main result is a lower bound $2^{\Omega\left( \frac{n \log h}{\log \log h}\right)}$. This rules out the existence of a single-exponential algorithm and shows that the trivial upper bound $2^{{\mathcal O}(n\log{h})}$ is almost asymptotically tight. We also investigate what properties of graphs $G$ and $H$ make it difficult to solve HOM$(G,H)$. An easy observation is that an ${\mathcal O}(h^n)$ upper bound can be improved to ${\mathcal O}(h^{\operatorname{vc}(G)})$ where $\operatorname{vc}(G)$ is the minimum size of a vertex cover of $G$. The second lower bound $h^{\Omega(\operatorname{vc}(G))}$ shows that the upper bound is asymptotically tight. As to the properties of the "right-hand side" graph $H$, it is known that HOM$(G,H)$ can be solved in time $(f(\Delta(H)))^n$ and $(f(\operatorname{tw}(H)))^n$ where $\Delta(H)$ is the maximum degree of $H$ and $\operatorname{tw}(H)$ is the treewidth of $H$. This gives single-exponential algorithms for graphs of bounded maximum degree or bounded treewidth. Since the chromatic number $\chi(H)$ does not exceed $\operatorname{tw}(H)$ and $\Delta(H)+1$, it is natural to ask whether similar upper bounds with respect to $\chi(H)$ can be obtained. We provide a negative answer to this question by establishing a lower bound $(f(\chi(H)))^n$ for any function $f$. We also observe that similar lower bounds can be obtained for locally injective homomorphisms.Comment: 19 page

Kernelization and Parameterized Algorithms for 3-Path Vertex Cover

A 3-path vertex cover in a graph is a vertex subset $C$ such that every path of three vertices contains at least one vertex from $C$. The parameterized 3-path vertex cover problem asks whether a graph has a 3-path vertex cover of size at most $k$. In this paper, we give a kernel of $5k$ vertices and an $O^*(1.7485^k)$-time and polynomial-space algorithm for this problem, both new results improve previous known bounds.Comment: in TAMC 2016, LNCS 9796, 201

Connective tissue disease related interstitial lung diseases and idiopathic pulmonary fibrosis: provisional core sets of domains and instruments for use in clinical trials

Rationale Clinical trial design in interstitial lung diseases (ILDs) has been hampered by lack of consensus on appropriate outcome measures for reliably assessing treatment response. In the setting of connective tissue diseases (CTDs), some measures of ILD disease activity and severity may be confounded by non-pulmonary comorbidities. Methods The Connective Tissue Disease associated Interstitial Lung Disease (CTD-ILD) working group of Outcome Measures in Rheumatology—a non-profit international organisation dedicated to consensus methodology in identification of outcome measures—conducted a series of investigations which included a Delphi process including >248 ILD medical experts as well as patient focus groups culminating in a nominal group panel of ILD experts and patients. The goal was to define and develop a consensus on the status of outcome measure candidates for use in randomised controlled trials in CTD-ILD and idiopathic pulmonary fibrosis (IPF). Results A core set comprising specific measures in the domains of lung physiology, lung imaging, survival, dyspnoea, cough and health-related quality of life is proposed as appropriate for consideration for use in a hypothetical 1-year multicentre clinical trial for either CTD-ILD or IPF. As many widely used instruments were found to lack full validation, an agenda for future research is proposed. Conclusion Identification of consensus preliminary domains and instruments to measure them was attained and is a major advance anticipated to facilitate multicentre RCTs in the field

Psychometric precision in phenotype definition is a useful step in molecular genetic investigation of psychiatric disorders

Affective disorders are highly heritable, but few genetic risk variants have been consistently replicated in molecular genetic association studies. The common method of defining psychiatric phenotypes in molecular genetic research is either a summation of symptom scores or binary threshold score representing the risk of diagnosis. Psychometric latent variable methods can improve the precision of psychiatric phenotypes, especially when the data structure is not straightforward. Using data from the British 1946 birth cohort, we compared summary scores with psychometric modeling based on the General Health Questionnaire (GHQ-28) scale for affective symptoms in an association analysis of 27 candidate genes (249 single-nucleotide polymorphisms (SNPs)). The psychometric method utilized a bi-factor model that partitioned the phenotype variances into five orthogonal latent variable factors, in accordance with the multidimensional data structure of the GHQ-28 involving somatic, social, anxiety and depression domains. Results showed that, compared with the summation approach, the affective symptoms defined by the bi-factor psychometric model had a higher number of associated SNPs of larger effect sizes. These results suggest that psychometrically defined mental health phenotypes can reflect the dimensions of complex phenotypes better than summation scores, and therefore offer a useful approach in genetic association investigations