1,726,670 research outputs found
Tindak pidana perusakan kafe salsa di daerah Kemang Jakarta Selatan oleh organisasi masyarakat (front pembela Islam) / oleh Erfan Hidayat Syar
No full textabstrak (A) Erfan Hidayat Syar (NIM: 205000052) (B) Judul Skripsi: Tindak Pidana Perusakan Kafe Salsa di Daerah Kemang ? Jakarta Selatan oleh Organisasi Masyarakat Front Pembela Islam (C) Halaman vi + 87 + 16 + 2007 (D) Kata Kunci : Tindak Pidana Perusakan, Front Pembela Islam (E) Isi: Aparat penegak hukum yang pertama menangani tindak pidana yang terjadi dimasyarakat adalah polisi. Selaku penegak hukum polisi mempunyai tugas pokok yaitu : Memelihara keamanan dan ketertiban masyarakat., menegakan hukum , memberikan perlindungan, pengayoman dan pelayanan kepada masyarakat. Dalam melaksanakan tugasnya Polisi melakukan penyelidikan dan penyidikan untuk mengungkap dan menangkap pelaku tindak pidana perusakan. Untuk mengungkap suatu tindak pidana Polisi melakukan tindakan-tindakan, penangkapan, penahanan, penyitaan dan meminta keterangan para saksi dan tersangka. Tindakan tersebut bertujuan untuk membuat terang tentang tindak pidana yang terjadi dan guna menemukan tersangkanya. Penanganan tindak pidana perusakan Kafe Salsa, Kemang Jakarta Selatan oleh Front Pembela Islam yang dilakukan penyidik Polda Metro Jaya tidak sesuai dengan ketentuan Undang ? Undang yang berlaku ( KUHAP), karena dilakukan secara lisan melalui telepon dan pemanggilan dilakukan pada hari libur. (F) Daftar acuan : 16 (1980-2004) (G) Dosen Pembimbing : Yuwono Prianto, S.H, M.H (H) Penulis : Erfan Hidayat Sya
(Im)possibilty results in Proof Complexity and Arithmetic
No full textTitle: (Im)possibilty results in Proof Complexity and Arithmetic Author: Erfan Khaniki Department: Department of Algebra Supervisor: Prof. RNDr. Pavel Pudl'ak, DrSc Abstract: We study various problems in proof complexity, bounded arithmetic, and intuitionistic arithmetic. We focus on topics such as lower bounds for different proof systems, connections between proof complexity generators and models of arithmetic, jump operators in proof complexity, and the non-locality of certain Kripke models of Heyting arithmetic. Keywords: Proof complexity, Lower bounds, Bounded arithmetic, Independence, Heyt- ing arithmetic, Kripke models
Výsledky o (ne)možnostech v důkazové složitosti a aritmetice
No full textTitle: (Im)possibilty results in Proof Complexity and Arithmetic Author: Erfan Khaniki Department: Department of Algebra Supervisor: Prof. RNDr. Pavel Pudl'ak, DrSc Abstract: We study various problems in proof complexity, bounded arithmetic, and intuitionistic arithmetic. We focus on topics such as lower bounds for different proof systems, connections between proof complexity generators and models of arithmetic, jump operators in proof complexity, and the non-locality of certain Kripke models of Heyting arithmetic. Keywords: Proof complexity, Lower bounds, Bounded arithmetic, Independence, Heyt- ing arithmetic, Kripke models 1Názov práce: Výsledky o (ne)možnostech v důkazové složitosti a aritmetice Autor: Erfan Khaniki Katedra: Katedra Algebry Vedúci dizertačnej práce: Prof. RNDr. Pavel Pudlák, DrSc Abstrakt: Zabýváme se problémy v důkazové složitosti, omezené aritmetice a intu- icionistické aritmetice. Soustředíme se na témata jako dolní odhady pro různé důkazové systémy, souvislosti mezi generátory v důkazové složitosti a modely ar- itmetiky, operátory skoku v důkazové složitosti a nelokalitou určitých Kripkeho modelů v Heytingově aritmetice. Klíčová slova: důkazová složitost, dolní odhady, omezenená aritmetika, nezávislost, Heytin- gova aritmetika, Kripkeho modely 1Faculty of Mathematics and PhysicsMatematicko-fyzikální fakult
Mahasiswa PBA Presentasi di Seminar Tahunan Lingustik (SETALI) 2016
No full textMahasiswi PBA Fitria Rifatul Azizah bersama Dosen Pembimbing Erfan Gazali menjadi peserta aktif sebagai presenter di kegiatan Seminar tahunan Linguistik (SETALI) 2016
mereka mempresentasikan makalah berjudul PEMIKIRAN IBNU KHALDUN (1332 M – 1406 M) DAN DIRECT METHOD DALAM PEMBELAJARAN BAHASA ASIN
Nisan-Wigderson Generators in Proof Complexity: New Lower Bounds
No full textA map g:{0,1}ⁿ → {0,1}^m (m > n) is a hard proof complexity generator for a proof system P iff for every string b ∈ {0,1}^m ⧵ Rng(g), formula τ_b(g) naturally expressing b ∉ Rng(g) requires superpolynomial size P-proofs. One of the well-studied maps in the theory of proof complexity generators is Nisan-Wigderson generator. Razborov [A. A. {Razborov}, 2015] conjectured that if A is a suitable matrix and f is a NP∩CoNP function hard-on-average for /poly, then NW_{f, A} is a hard proof complexity generator for Extended Frege. In this paper, we prove a form of Razborov’s conjecture for AC⁰-Frege. We show that for any symmetric NP∩CoNP function f that is exponentially hard for depth two AC⁰ circuits, NW_{f,A} is a hard proof complexity generator for AC⁰-Frege in a natural setting. As direct applications of this theorem, we show that:
1) For any f with the specified properties, τ_b(NW_{f,A}) (for a natural formalization) based on a random b and a random matrix A with probability 1-o(1) is a tautology and requires superpolynomial (or even exponential) AC⁰-Frege proofs.
2) Certain formalizations of the principle f_n ∉ (NP∩CoNP)/poly requires superpolynomial AC⁰-Frege proofs. These applications relate to two questions that were asked by Krajíček [J. {Krajíček}, 2019]
Going Beyond Counting First Authors in Author Co-citation Analysis
No full textThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Pengaruh Kualitas Pelayanan Jasa Terhadap Kepuasan Pelanggan Pada Zona Futsal Jember
No full textPerkembangan bisnis penyewaan lapangan futsal yang semakin pesat, membuat pelaku bisnis penyedia jasa penyewaan lapangan futsal saling bersaing dengan para kompetitornya. Persaingan yang semakin pesat, mengharuskan perusahaan penyedia jasa penyewaan lapangan futsal melakukan pemasaran yang efektif. Upaya yang dapat dilakukan untuk bersaing dan dapat bertahan dari kompetitornya yaitu dengan memperhatikan kualitas pelayanan yang diberikan. Kualitas pelayanan yang maksimal akan menciptakan kepuasan pelanggan, karena pelayanan yang diberikan perusahaan sesuai dengan apa yang diharapkan pelanggan. Pelanggan yang merasa puas, maka pelanggan tersebut akan datang kembali secara terus menerus dan menjadi pelanggan tetap. Lima aspek penting yang harus diperhatikan dalam kualitas pelayanan jasa menurut Parasuraman (1990), yaitu bukti fisik (Tangibles), keandalan (Reliability), daya tanggap (Responsiveness), jaminan (Assurance), dan empati (Emphaty)
- …
