Pencarian Artikel Jurnal & Majalah

Menampilkan keseluruhan arsip dokumen (Halaman 157 dari 34194, Total: 341939 data)

Studi pengelompokan ranking SMU untuk mendukung pengambilan keputusan pada penerimaan mahasiswa baru Universitas Surabaya melalui Jalur Penelusuran Minat dan Kemampuan (JPMK)

Nama Pengarang : -
Nama Majalah/Jurnal : Jurnal Teknologi Industri dan Informasi
Volume / Nomor Edisi : 1 (No. 1)
Nomor Halaman : 56-70
Abstraksi Narasi : The University of Surabaya offers place for new students through the Academic Capability and Interest-based Selection Program by considering their senior high school accreditation rating, their academic records and their academic ranks in senior high schools. In reality, schools with the same accreditation rating may have a different quality in education practices. This paper studies the difference of quality among high schools. It is found that JPMK students could be divided into two groups based on their grade point average (GPA). Furthermore, it is identified that the group of students with high GPA came from certain high schools.

Tanda tangan elektronik: Sebuah studi kepustakaan dan prediksi masa depan

Nama Pengarang : -
Nama Majalah/Jurnal : Jurnal Teknologi Industri dan Informasi
Volume / Nomor Edisi : 1 (No. 1)
Nomor Halaman : 50-55
Abstraksi Narasi : Advances in electronics and telecommunications fields have provided an easy solution to the communication problem by the introduction of electronic mail systems. With this open solution, an electronic transaction can also be performed, and a digital signature mechanism need to be used to sign a document and prove its legality. This paper describes about digital signatures and several algorithms that can be used to perform them. In the sequel, a future prediction based on the existing research will be given, together with another possibility of extending the existing solution.

Perencanaan produktivitas perusahaan menggunakan Productivity Evaluation Tree (PET) model

Nama Pengarang : Lianto, Benny
Nama Majalah/Jurnal : Jurnal Teknologi Industri dan Informasi
Volume / Nomor Edisi : 1 (No. 1)
Nomor Halaman : 41-49
Abstraksi Narasi : Planning phase is an important phase in the productivity improvement program. Through a good planning, a company can identify and examine all kinds of possible alternatives to increase the productivity level in the future so that the company can prepare the productivity improvement steps. This paper presents Productivity Evaluation Tree (PET) model that can be used to develop a productivity planning in the short run. At the end ofthe report, this paper demonstrates PET application with a hypothetical example.

Designing a quality cost system in a stationery company

Nama Pengarang : -
Nama Majalah/Jurnal : Jurnal Teknologi Industri dan Informasi
Volume / Nomor Edisi : 1 (No. 1)
Nomor Halaman : 31-40
Abstraksi Narasi : CV 'B' is a parent company of two companies, BP and BS. BP produces basic material paper for BS, while BS produces the final paper product. The bad quality material that has been sent from BP creates a lot of quality cost in BS production process. Unfortunately, BS assumes that their losses in quality cost is not as big as that, due to their quality attention which is only as an inspection activity. Under intensive consultation, the BS management finally agree that the new quality system must be designed to replace the old system and change the old quality culture before getting ISO certification. Considering some constraints, COC-CONC (Cost Of Conformance-Cost Of Non Conformance) model has been chosen to build the new quality cost system. Of course some additional aspects must be placed, for example the cost of quality reward and the new commitment to be rather preventing than inspecting the quality. As the result, the right improvement should be taken immediately by using a careful analysis of actual cost and synthetic cost, and strongly supported by some statistical descriptive diagrams. Some comments are risen from this experience. Most of them show that it is not simple to assure the quality beyond ISO certification, mainly if a company has the problem with quality cost.

Sustainable resource management in coastal areas: A genuine progress perspective for Thailand

Nama Pengarang : -
Nama Majalah/Jurnal : Jurnal Teknologi Industri dan Informasi
Volume / Nomor Edisi : 1 (No. 1)
Nomor Halaman : 13-30
Abstraksi Narasi : This study presents an alternative framework for sustainable natural resource management in coastal areas. To operationalize the notion of sustainability for natural resources, conventional economic and ecological approaches to natural resources management are synthesized in the concept of genuine progress capability (GPC). The GPC concept proposes that safe minimum levels of environmental assets are required to counterbalance short-term efficiency criteria. A range of GPC-indicators are suggested to assess the sustainability of production systems in coastal areas., both of renewable and non-renewable resources for eight main natural resource categories prevalent in the coastal areas of Thailand.

Synchronising buyer supplier operations strategies in supply chains

Nama Pengarang : Pujawan, I Nyoman
Nama Majalah/Jurnal : Jurnal Teknologi Industri dan Informasi
Volume / Nomor Edisi : 1 (No. 1)
Nomor Halaman : 1-12
Abstraksi Narasi : The concepts of lean and agile have been associated with operations strategies of individual manufacturing companies in the last decade. On the other hand, there is an increasing trend that trading partners in a supply chain work closely together toward partnerships models. To survive and prosper in today's severe competition, not only individual manufacturing companies need to follow a clear operating strategies, the supply chains do. This paper presents conceptual models on buyer supplier operations strategies in a supply chain and argues that synchronisation of such strategies are essential. It will be further argued that a lean or an agile supply chain does not necessarily have all its components operate based on the same strategy, but it all depends on the operating circumstances under which each channel member operates. Whatever the strategy is applied by each individual channel, synchronisation should be based on firm partnerships between trading partners to achieve a truly lean or agile supply chain.

Shuffles and Circuits (On Lower Bounds for Modern Parallel Computation)

Nama Pengarang : Tim Roughgarden, Sergei Vassilvitskii, Joshua R. Wang
Nama Majalah/Jurnal : Journal of the ACM
Volume / Nomor Edisi : 65 (No. 6)
Nomor Halaman : 1-24
Abstraksi Narasi : The goal of this article is to identify fundamental limitations on how efficiently algorithms implemented on platforms such as MapReduce and Hadoop can compute the central problems in motivating application domains, such as graph connectivity problems. We introduce an abstract model of massively parallel computation, where essentially the only restrictions are that the “fan-in” of each machine is limited to s bits, where s is smaller than the input size n, and that computation proceeds in synchronized rounds, with no communication between different machines within a round. Lower bounds on the round complexity of a problem in this model apply to every computing platform that shares the most basic design principles of MapReduce-type systems. We prove that computations in our model that use few rounds can be represented as low-degree polynomials over the reals. This connection allows us to translate a lower bound on the (approximate) polynomial degree of a Boolean function to a lower bound on the round complexity of every (randomized) massively parallel computation of that function. These lower bounds apply even in the “unbounded width” version of our model, where the number of machines can be arbitrarily large. As one example of our general results, computing any nontrivial monotone graph property—such as connectivity—requires a super-constant number of rounds when every machine receives only a subpolynomial (in n) number of input bits s. Finally, we prove that, in two senses, our lower bounds are the best one could hope for. For the unbounded-width model, we prove a matching upper bound. Restricting to a polynomial number of machines, we show that asymptotically better lower bounds would separate P from NC1.

Settling the Query Complexity of Non-adaptive Junta Testing

Nama Pengarang : Xi Chen, Rocco A. Servedio, Li-Yang Tan, Erik Waingarten, Jinyu Xie
Nama Majalah/Jurnal : Journal of the ACM
Volume / Nomor Edisi : 65 (No. 6)
Nomor Halaman : 1-18
Abstraksi Narasi : We prove that any non-adaptive algorithm that tests whether an unknown Boolean function f:{0,1}n→ {0,1} is a k-junta or ?-far from every k-junta must make Ω˜(k3/2) / ?) many queries for a wide range of parameters k and ?. Our result dramatically improves previous lower bounds and is essentially optimal since there is a known non-adaptive junta tester which makes Ω˜(k3/2) / ? queries. Combined with the known existence of an adaptive tester which makes O(klog k + k /?) queries, our result shows that adaptivity enables polynomial savings in query complexity for junta testing.

Indistinguishability Obfuscation from Functional Encryption

Nama Pengarang : Nir Bitansky, Vinod Vaikuntanathan
Nama Majalah/Jurnal : Journal of the ACM
Volume / Nomor Edisi : 65 (No. 6)
Nomor Halaman : 1-37
Abstraksi Narasi : Indistinguishability obfuscation (IO) is a tremendous notion, powerful enough to give rise to almost any known cryptographic object. Prior candidate IO constructions were based on specific assumptions on algebraic objects called multi-linear graded encodings. We present a generic construction of indistinguishability obfuscation from public-key functional encryption with succinct encryption circuits and subexponential security. This shows the equivalence of indistinguishability obfuscation and public-key functional encryption, a primitive that has previously seemed to be much weaker, lacking the power and the staggering range of applications of indistinguishability obfuscation. Our main construction can be based on functional encryption schemes that support a single functional key, and where the encryption circuit grows sub-linearly in the circuit-size of the function. We further show that sublinear succinctness in circuit-size for single-key schemes can be traded with sublinear succinctness in the number of keys (also known as the collusion-size) for multi-key schemes. We also show that, under the Learning with Errors assumption, our techniques imply that any indistinguishability obfuscator can be converted into one where the size of obfuscated circuits is twice that of the original circuit plus an additive overhead that is polynomial in its depth, input length, and the security parameter.

Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity

Nama Pengarang : James Aspnes, Hagit Attiya, Keren Censor-Hillel, Faith Ellen
Nama Majalah/Jurnal : Journal of the ACM
Volume / Nomor Edisi : 65 (No. 6)
Nomor Halaman : 1-2
Abstraksi Narasi : This is an erratum for the article “Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity” published in J. ACM 62(1): 3:1-3:22 (2015). The implementation of a MaxArrayk×h object in Algorithm 2 does not guarantee linearizability. We give here a simple correction to the algorithm and its correctness proof.
← Kembali ke Halaman Utama