430 research outputs found
Tanggapan Industri Busana tentang Instrumen Penilaian Praktek Industri (PI) Mahasiswa Tata Busana Universitas Negeri Malang sebagai Penunjang SKPI
No full textRINGKASAN Nor, Fatwa Logic. 2018. Tanggapan Industri Busana tentang Instrumen Penilaian Praktek Industri (PI) Mahasiswa Tata Busana Universitas Negeri Malang sebagai Penunjang SKPI. Skripsi, Jurusan Teknologi Industri. Fakultas Teknik, Universitas Negeri Malang. Pembimbing (1) Dra. Nurul Aini, M.Pd, (II) Dr. Agus Hery Supadmi Irianti, M.Pd. Kata Kunci :Tanggapan, Industri Busana, Instrumen Penilaian Praktek Industri Penunjang SKPI Praktek industri (PI) merupakan salah satu mata kuliah yang wajib ditempuh dan dilaksanakan di lapangan usaha baik industri pembuatan suatu produk atau pun usaha jasa pelayanan konsumen. Kebutuhan saat ini bagi para lulusan Perguruan Tinggi adalah SKPI atau Surat Keterangan Pendamping Ijazah. SKPI merupakan dokumen yang menjelaskan kualifikasi kompetensi lulusan dalam bentuk uraian agar mudah dipahami oleh masyarakat umum atau pelaku industri lainnya. Manfaat SKPI adalah dapat menyediakan penjelasan terkait dengan kualifikasi lulusan yang lebih mudah dimengerti oleh masyarakat. Penelitian ini bertujuan untuk mendeskripsikan tanggapan industri busana tentang instrument penilaian Praktek industri (PI) mahasiswa Tata Busana Universitas Negeri Malang sebagai penunjang SKPI. Metode penelitian yang digunakan adalah deskriptif kuantitatif dengan teknik sampling jenuh. Populasi dan sampel yang diambil adalah industri busana yang berada di kota Malang yang dijadikan mahasiswa Tata Busana Universitas Negeri Malang sebagai tempat Praktek Industri (PI) pada tahun ajaran 2015-2016 dan 2016-2017. Instrumen yang digunakan adalah angket tertutup. Diperoleh hasil: (1) Tanggapan tentang aspek dan kriteria penilaian praktek industri dengan kebutuhan SKPI dengan persentase 53% menunjukkan sebagian besar industri busana menyatakan sangat setuju bahwa aspek dan kriteria penilaian praktek industri belum sesuai dengan kebutuhan SKPI yang memerlukan jabaran kompetensi mahasiswa selama melaksanakan praktek industri yang berarti instrumen penilaian tersebut tidak dapat menunjang SKPI, (2) Tanggapan tentang instrumen penilaian praktek industri sebagai alat mendeskripsikan kompetensi dengan presentase 70,5% menunjukkan sebagian besar industri busana menyatakan setuju bahwa instrumen penilaian praktek industri belum bisa dijadikan sebagai alat mendeskripsikan kompetensi mahasiswa selama melaksanakan praktek industri yang berarti instrumen penilaian tersebut tidak dapat menunjang SKPI. Kesimpulan dari penelitian ini berdasarkan rekapitulasi menunjukkan bahwa hampir setengahnya industri busana menyatakan setuju dan sebagian besar industri busana menyatakan sangat setuju terkait instrumen penilaian praktek industri mahasiswa Tata Busana Universitas Negeri Malang tidak dapat menunjang SKPI yang memerlukan jabaran deskripsi kometensi mahasiswa. Hendaknya penelitian ini dapat disempurnakan lagi dengan mengembangkan penelitian seperti rancangan deskriptor kompetensi penunjang SKPI
Uniform definability in propositional dependence logic
No full textBoth propositional dependence logic and inquisitive logic are expressively complete. As a consequence, every formula in the language of inquisitive logic with intuitionistic disjunction or intuitionistic implication can be translated equivalently into a formula in the language of propositional dependence logic without these two connectives. We show that although such a (noncompositional) translation exists, neither intuitionistic disjunction nor intuitionistic implication is uniformly definable in propositional dependence logic.</p
MECHATRONICS DESIGN FROM ZERO TO ONE (STRUCTURED LOGIC DESIGN TO PROGRAM LOGIC OF LADDER DIAGRAM FOR PLC)
Get PDFThe purpose of this work is to study and analyze the methods use to design logic of
ladder diagram for PLC-based controller in automated manufacturing systems. Previous
method employed to design the logic of ladder diagram does not show clearly on how it is
done step by step, widely based on the programmer's experience and their intuition. The
methods proposed namely method A and method G hopefully can help the programmer
especially the new programmer to design the ladder logic systematically and efficiently while
at the same time reduce the time consume to program it. This systematic logic design can help
the programmer to trace back their program for debug purpose. A step by step instruction is
provided in this paper for both method A and method G. Few basic sequence are tested
Finally, a case study on packaging process is provided to illustrate the design procedure of the
proposed methods. In the same time, author will also explore the capability of the Automation
Studio software
2-output spin wave programmable logic gate
No full textThis paper presents a 2-output Spin-Wave Programmable Logic Gate structure able to simultaneously evaluate any pair of AND, NAND, OR, NOR, XOR, and XNOR Boolean functions. Our proposal provides the means for fanout achievement within the Spin Wave computation domain and energy and area savings as two different functions can be simultaneously evaluated on the same input data. We validate our proposal by means of Object Oriented Micromagnetic Framework (OOMMF) simulations and demonstrate that by phase and magnetization threshold output sensing {AND, OR, NAND, NOR} and {XOR and XNOR} functionalities can be achieved, respectively. To get inside into the potential practical implications of our approach we use the proposed gate to implement a 3-input Majority gate, which we evaluate and compare with state of the art equivalent implementations in terms of area, delay, and energy consumptions. Our estimations indicate that the proposed gate provides 33% and 16% energy and area reduction, respectively, when compared with spin-wave counterpart and 42% energy reduction while consuming 12x less area when compared to a 15 nm CMOS implementation.Accepted author manuscriptComputer EngineeringQuantum & Computer Engineerin
Implementation of a noise-coexistence threshold logic architecture on a GaAs-based nanowire FET network
Get PDFToward reconfigurable and noise-coexistence information processing system utilizing nanostructures, we study a threshold logic circuit and a double threshold function using a GaAs-based nanowire field-effect transistor (FET) network. A noise coexistence capability is based on a noise-assisted state transition in a threshold function in a threshold logic element. We fabricate a circuit reconfigurable between NAND and NOR functions. A hysteresis transfer characteristic with double threshold is realized in the GaAs nanowire by using a silicon nitride (SiN) as the gate insulator. We introduce a unique inverter design using the SiN-gate FET as a load to achieve the transfer characteristic with clockwise hysteresis, similar to a Schmitt trigger
The inclusive-AND (Equivalence, Exclusive-NOR (EXNOR, XNOR)) and Exclusive-OR (EXOR, XOR) gates in mixed logic
No full textMixed logic notation simplifies the analysis and design of digital circuits and supports self-documenting gate level circuits. Additionally, it provides alternative Implementations which could result in reducing the number of gates. The current symbol of the Equivalence gate as an Exclusive OR with the output ASSERTED LOW (Exclusive NOR) is troubling when we want to think of the output ASSERTED HIGH. This had impeded extending the mixed logic approach to Exclusive OR. We suggest introducing an alternative distinct symbol for the Equivalence (inclusive-AND) gate to facilitate the application of the mixed logic concepts to both the Exclusive-OR and the inclusive-AND gates.ALMAINI AEA, 1989, ELECT LOGIC SYSTEMS; AWSCHALORN D, 2002, SEMICONDUCTOR SPINTR; Balasubramanian P., 2005, Proceedings of the 2005 International Conference on Emerging Technologies (IEEE Cat. No. 05EX1106), DOI 10.1109-ICET.2005.1558896; BRAND D, 1993, IEEE T COMPUT, V42, P568, DOI 10.1109-12.223676; BREEDING K, 1999, DIGITAL DESIGN FUNDA; Brown S., 1992, FIELD PROGRAMMABLE G; Bui HT, 2002, IEEE T CIRCUITS-II, V49, P25; de Silva AP, 2004, CHEM-EUR J, V10, P574, DOI 10.1002-chem.200305054; FLETCHER WI, 1980, ENG APPROACH DIGITAL; Goel S, 2006, IEEE T CIRCUITS-I, V53, P867, DOI 10.1109-TCSI.2005.860119; Green DH, 1996, INT J ELECTRON, V81, P15, DOI 10.1080-002072196136904; GREEN DH, 1994, IEE P-COMPUT DIG T, V141, P184, DOI 10.1049-ip-cdt:19941097; HUDSON HB, 1995, IEEE T EDUC, V38, P266; KAMPEL I, 1985, PRACTICAL INTRO NEW; PALMER J, 1993, SCHAUMS OUTLINE SERI; Roth Jr C.H., 2004, FUNDAMENTALS LOGIC D; Sasao T, 1997, IEEE T COMPUT, V46, P709, DOI 10.1109-12.600830; Shannon C.E., 1938, Transactions of the American Institute of Electrical Engineers, V57; SHE TC, 1994, IEEE PHOTONIC TECH L, V6, P712, DOI 10.1109-68.300171; Stankovic RS, 2001, IEEE T COMPUT AID D, V20, P1177, DOI 10.1109-43.945313; TINDER R, 1991, DIGITAL ENG DESIGN M; *WIK, LOG GAT0
Coinductive foundations of infinitary rewriting and infinitary equational logic
Get PDFWe present a coinductive framework for defining and reasoning about the infinitary analogues of equational logic and term rewriting in a uniform way. We define Equation found, the infinitary extension of a given equational theory =R, and →∞, the standard notion of infinitary rewriting associated to a reduction relation →R, as follows: (Formula Presented) Equation found Here μ and ν are the least and greatest fixed-point operators, respectively, and (Formula Presented) Equation found The setup captures rewrite sequences of arbitrary ordinal length, but it has neither the need for ordinals nor for metric convergence. This makes the framework especially suitable for formalizations in theorem provers.Energy and Industr
The Logic of the Whole Truth
No full textNote: The author holds the copyright, and there was no agreement, express or implied, not to use a facsimile PDF.
Using erotetic logic, the paper defines the "the whole truth" in a manner consistent with U.S. Supreme Court precedent. It cannot mean "the whole story," as witnesses in an adversary system are permitted /only/ to answer the questions put to them, nor are they permitted to speculate, add irrelevant material, etc. Nor can it mean not to add an admixture of falsity, as that is already included in "nothing but the truth," and, strictly speaking, in "the truth," as any such as admixture renders the whole thing false (given bivalence is presupposed) by &-introduction
The Logic of the Whole Truth
No full textNote: The author holds the copyright, and there was no agreement, express or implied, not to use a facsimile PDF.
Using erotetic logic, the paper defines the "the whole truth" in a manner consistent with U.S. Supreme Court precedent. It cannot mean "the whole story," as witnesses in an adversary system are permitted /only/ to answer the questions put to them, nor are they permitted to speculate, add irrelevant material, etc. Nor can it mean not to add an admixture of falsity, as that is already included in "nothing but the truth," and, strictly speaking, in "the truth," as any such as admixture renders the whole thing false (given bivalence is presupposed) by &-introduction
An argumentation framework for description logic ontology reasoning and management
No full textThis paper presents an argumentation framework for reasoning and management in (inconsistent or incoherent) description logic ontologies which contain conflicts. First, a new argumentation framework obtained by combining Besnard and Hunter's framework with binary argumentation is introduced to frame the inner relation over axioms in an ontology. A dialogue mechanism, based on this framework, is then presented to derive meaningful consequences from inconsistent ontologies. Three novel operators are developed to repair those axioms or assertions which cause inconsistency or incoherency of ontologies by using this framework. Within this framework, an inconsistency is neither directly assigned a contradictory value nor roughly removed but further analyzed and evaluated. Because of this, reasoning within it satisfies some important logical properties such as consistency-preserving and justifiability. Moreover, it provides an alternative scenario for maintaining consistency and coherency of ontologies with giving consideration to both semantics and syntax. Thus the repaired results by using the proposed framework not only keep the closer semantics but also preserve the syntactic structure of original ontologies.Computer Science, Artificial IntelligenceComputer Science, Information SystemsSCI(E)EI4ARTICLE3375-4034
- …
