Synthesis of wiring signature-invariant equivalence class circuit mutants and applications to benchmarking

AbstractTheories of structured meanings are designed to generate fine-grained meanings, but they are also liable to overgenerate structures, thus drawing structural distinctions without a semantic difference. I recommend the proliferation of very fine-grained structures, so that we are able to draw any semantic distinctions we think we might need. But, in order to contain overgeneration, I argue we should insert some degree of individuation between logical equivalence and structural identity based on structural isomorphism. The idea amounts to forming an equivalence class of different structures according to one or more formal criteria and designating a privileged element as a representative of all the elements, i.e., a first among equals. The proposed method helps us to a cluster of notions of co-hyperintensionality. As a test case, I consider a recent objection levelled against the act theory of structured propositions. I also respond to an objection against my methodology.

Download Full-text

Minimal diagrams of free knots

Journal of Knot Theory and Its Ramifications ◽

10.1142/s0218216514500321 ◽

2014 ◽

Vol 23 (06) ◽

pp. 1450032

Author(s):

Tomas Boothby ◽

Allison Henrich ◽

Alexander Leaf

Keyword(s):

Equivalence Class ◽

Virtual Knots ◽

Knot Diagrams

Manturov recently introduced the idea of a free knot, i.e. an equivalence class of virtual knots where equivalence is generated by crossing change and virtualization moves. He showed that if a free knot diagram is associated to a graph that is irreducibly odd, then it is minimal with respect to the number of classical crossings. Not all minimal diagrams of free knots are associated to irreducibly odd graphs, however. We introduce a family of free knot diagrams that arise from certain permutations that are minimal but not irreducibly odd.

Download Full-text

Eigenvalues and strong orbit equivalence

Ergodic Theory and Dynamical Systems ◽

10.1017/etds.2015.26 ◽

2015 ◽

Vol 36 (8) ◽

pp. 2419-2440 ◽

Cited By ~ 1

Author(s):

MARÍA ISABEL CORTEZ ◽

FABIEN DURAND ◽

SAMUEL PETITE

Keyword(s):

Equivalence Class ◽

Quotient Group ◽

Additive Group ◽

Orbit Equivalence ◽

Dimension Group ◽

Torsion Free

We give conditions on the subgroups of the circle to be realized as the subgroups of eigenvalues of minimal Cantor systems belonging to a determined strong orbit equivalence class. Actually, the additive group of continuous eigenvalues $E(X,T)$ of the minimal Cantor system $(X,T)$ is a subgroup of the intersection $I(X,T)$ of all the images of the dimension group by its traces. We show, whenever the infinitesimal subgroup of the dimension group associated with $(X,T)$ is trivial, the quotient group $I(X,T)/E(X,T)$ is torsion free. We give examples with non-trivial infinitesimal subgroups where this property fails. We also provide some realization results.

Download Full-text

Penyu: Sistem Pendukung Keputusan untuk Penyewaan Ruko yang Strategis Menggunakan Metode Analytical Hierarchy Process(AHP)

JOURNAL OF APPLIED INFORMATICS AND COMPUTING ◽

10.30871/jaic.v4i1.2126 ◽

2020 ◽

Vol 4 (1) ◽

pp. 89-94

Author(s):

Fitra Ramadhan ◽

Maksum Ro’is Adin Saf

Keyword(s):

Equivalence Class ◽

Analytical Hierarchy Process ◽

Boundary Value ◽

Usability Testing ◽

Black Box ◽

Value Analysis ◽

Hierarchy Process

Pada perkembangan ekonomi di Indonesia yang sedang berkembang saat ini, usaha dalam penyewaan ruko sangatlah pesat, dan untuk menyewa ruko haruslah sesuai dengan target yang ingin dicapai, seperti lokasi yang ramai, lokasi yang mudah diakses, ataupun kelengkapan ruko untuk memaksimalkan pelayanan. Akan tetapi dari beberapa kriteria tersebut, kemungkinan terjadinya kesalahan penyewaan ruko dapat muncul karena kurangnya dan keterbatasan dalam mendapatkan informasi ruko. Dari permasalahan tersebut dibangunlah sebuah Sistem Pendukung Keputusan untuk Penyewaan Ruko yang Strategis. Metode yang digunakan adalah Analytical Hierarchy Process (AHP). Kemudian, dilakukan tiga buah pengujian terhadap sistem yaitu pengujian black box, usability testing dan perbandingan perhitungan manual dan sistem. Didapatkan hasil pengujian black box dengan teknik Equivalence Class Partitioning bahwa semua inputan berjalan, dan dengan teknik Boundary Value Analysis didapatkan nilai batas atas dan bawah tiap masukan. Berdasarkan hasil rekapitulasi kuesioner terhadap user, responden setuju dengan kepuasan dalam penggunaan sistem dengan rata-rata 75,31%. Kemudian Berdasarkan perbandingan perhitungan manual dan sistem, didapatkan hasil selisih perhitungan sebesar 0,03, akurasi dari perhitungan sistem sebesar 100% dan perhitungan metode AHP berhasil diterapkan.

Download Full-text

On the Morita equivalence class of a finitely presented algebra

Categorical, Homological and Combinatorial Methods in Algebra - Contemporary Mathematics ◽

10.1090/conm/751/15118 ◽

2020 ◽

pp. 1-4

Author(s):

Adel Alahmadi ◽

Hamed Alsulami ◽

Efim Zelmanov

Keyword(s):

Equivalence Class ◽

Morita Equivalence ◽

Finitely Presented

Download Full-text

EFEKTIVITAS PELATIHAN SERTIFIKASI KOMPUTER DASAR MENGGUNAKAN TEORY ROUGH SET DAN PROGRAM ROSSETA

Jurnal Sistem Informasi ◽

10.21609/jsi.v13i2.553 ◽

2017 ◽

Vol 13 (2) ◽

pp. 97

Author(s):

Karmila Suryani

Keyword(s):

Equivalence Class ◽

Rough Set ◽

Power Point

Penelitian ini bertujuan untuk menentukan efektivitas pelatihan komputer dasar dengan teori Roughset. Melalui teori Roughset ditemukan rule dan knowledge baru guna mengambil sebuah keputusan mengenai efektivitas program pelatihan Desktop Office Training. Materi pelatihan terdiri dari penguasaan aplikasi Excel, Word dan Power point untuk pengolahan data perkantoran. Pelatihan ini dilaksanakan di program studi Pendidikan Teknik Informatika dan Komputer, FKIP Universitas Bung Hatta yang bekerjasama dengan Microsoft dan berstandar Internasional. Penelitian ini menggunakan metoda deskriptif yang disesuaikan dengan langkah-langkah teori Rough set. Sampel yang digunakan sebanyak 35 peserta. Hasil yang diperoleh dari 35 sampel didapat bahwa tingkat keefektifan pelatihan ini adalah 100%. Melalui proses equivalence class diperoleh 86 rule yang tereduksi menjadi 24 rule. Untuk simulasi sistem yang terbentuk diuji dengan program aplikasi Rosseta.

Download Full-text

Counting and Sampling Markov Equivalent Directed Acyclic Graphs

Proceedings of the AAAI Conference on Artificial Intelligence ◽

10.1609/aaai.v33i01.33017984 ◽

2019 ◽

Vol 33 ◽

pp. 7984-7991

Author(s):

Topi Talvitie ◽

Mikko Koivisto

Keyword(s):

Equivalence Class ◽

Computational Cost ◽

Chordal Graph ◽

Directed Acyclic Graphs ◽

Desktop Computer ◽

Bounded Degree ◽

Acyclic Orientations ◽

Uniform Sampling ◽

Acyclic Graphs ◽

Graph Size

Exploring directed acyclic graphs (DAGs) in a Markov equivalence class is pivotal to infer causal effects or to discover the causal DAG via appropriate interventional data. We consider counting and uniform sampling of DAGs that are Markov equivalent to a given DAG. These problems efficiently reduce to counting the moral acyclic orientations of a given undirected connected chordal graph on n vertices, for which we give two algorithms. Our first algorithm requires O(2nn4) arithmetic operations, improving a previous superexponential upper bound. The second requires O(k!2kk2n) operations, where k is the size of the largest clique in the graph; for bounded-degree graphs this bound is linear in n. After a single run, both algorithms enable uniform sampling from the equivalence class at a computational cost linear in the graph size. Empirical results indicate that our algorithms are superior to previously presented algorithms over a range of inputs; graphs with hundreds of vertices and thousands of edges are processed in a second on a desktop computer.

Download Full-text