OPAC - Pencarian Artikel Jurnal & Majalah Library USD
Menampilkan semua artikel (Halaman 125 dari 34169, Total: 341690 data)
The utilization of intellectual property
klik untuk membaca file PDF
| Pengarang | : | Magpantay, Jose A. |
| Nama Majalah/Jurnal | : | Jurnal Teknologi Industri dan Informasi |
| Volume / Edisi | : | 1 (No. 2) |
| Halaman | : | 71-79 |
| Abstrak | : | There is a continuing debate about the impact of patent protection in the developing countries' perspective. This paper argues that patent protection is a necessary means of promoting innovation and invention. WTO and TRIPS agreement make it difficult for developing countries to hinder it. Therefore, developing countries should take deliberate steps to develop the capability to produce intellectual property. The steps are determining the knowledge gap, formulating a national strategy to narrow down the knowledge gap, undertaking a forecast and assessment of S&T, evaluating the various technological options and designing the programs that will address these knowledge gaps. University, which has advanced facilities and technical human resources, will play significant role in the creation and utilization of Intellectual Property in the science and technology areas. Setting up a technology park and a technology licensing office will be beneficial. |
Parallel Metric Tree Embedding Based on an Algebraic View on Moore-Bellman-Ford
| Pengarang | : | Stephan Friedrichs, Christoph Lenzen |
| Nama Majalah/Jurnal | : | Journal of the ACM |
| Volume / Edisi | : | 65 (No. 6) |
| Halaman | : | 1-55 |
| Abstrak | : | A metric tree embedding of expected stretch α ≥ 1 maps a weighted n-node graph G = (V, E, ω) to a weighted tree T = (VT, ET, ωT) with V ? VT such that, for all v,w ∈ V, dist(v, w, G) ≤ dist(v, w, T), and E[dist(v, w, T)] ≤ α dist(v, w, G). Such embeddings are highly useful for designing fast approximation algorithms as many hard problems are easy to solve on tree instances. However, to date, the best parallel polylog n)-depth algorithm that achieves an asymptotically optimal expected stretch of α ∈ O(log n) requires Ω (n2) work and a metric as input. |
Solving Optimization Problems with Diseconomies of Scale via Decoupling
| Pengarang | : | Konstantin Makarychev, Maxim Sviridenko |
| Nama Majalah/Jurnal | : | Journal of the ACM |
| Volume / Edisi | : | 65 (No. 6) |
| Halaman | : | 1-27 |
| Abstrak | : | We present a new framework for solving optimization problems with a diseconomy of scale. In such problems, our goal is to minimize the cost of resources used to perform a certain task. The cost of resources grows superlinearly, as xq, q≥ 1, with the amount x of resources used. We define a novel linear programming relaxation for such problems and then show that the integrality gap of the relaxation is Aq, where Aq is the q-th moment of the Poisson random variable with parameter 1. Using our framework, we obtain approximation algorithms for the Minimum Energy Efficient Routing, Minimum Degree Balanced Spanning Tree, Load Balancing on Unrelated Parallel Machines, and Unrelated Parallel Machine Scheduling with Nonlinear Functions of Completion Times problems. Our analysis relies on the decoupling inequality for nonnegative random variables. |
Studi pengelompokan ranking SMU untuk mendukung pengambilan keputusan pada penerimaan mahasiswa baru Universitas Surabaya melalui Jalur Penelusuran Minat dan Kemampuan (JPMK)
| Pengarang | : | - |
| Nama Majalah/Jurnal | : | Jurnal Teknologi Industri dan Informasi |
| Volume / Edisi | : | 1 (No. 1) |
| Halaman | : | 56-70 |
| Abstrak | : | 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
| Pengarang | : | - |
| Nama Majalah/Jurnal | : | Jurnal Teknologi Industri dan Informasi |
| Volume / Edisi | : | 1 (No. 1) |
| Halaman | : | 50-55 |
| Abstrak | : | 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
| Pengarang | : | Lianto, Benny |
| Nama Majalah/Jurnal | : | Jurnal Teknologi Industri dan Informasi |
| Volume / Edisi | : | 1 (No. 1) |
| Halaman | : | 41-49 |
| Abstrak | : | 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
| Pengarang | : | - |
| Nama Majalah/Jurnal | : | Jurnal Teknologi Industri dan Informasi |
| Volume / Edisi | : | 1 (No. 1) |
| Halaman | : | 31-40 |
| Abstrak | : | 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
| Pengarang | : | - |
| Nama Majalah/Jurnal | : | Jurnal Teknologi Industri dan Informasi |
| Volume / Edisi | : | 1 (No. 1) |
| Halaman | : | 13-30 |
| Abstrak | : | 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
| Pengarang | : | Pujawan, I Nyoman |
| Nama Majalah/Jurnal | : | Jurnal Teknologi Industri dan Informasi |
| Volume / Edisi | : | 1 (No. 1) |
| Halaman | : | 1-12 |
| Abstrak | : | 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)
| Pengarang | : | Tim Roughgarden, Sergei Vassilvitskii, Joshua R. Wang |
| Nama Majalah/Jurnal | : | Journal of the ACM |
| Volume / Edisi | : | 65 (No. 6) |
| Halaman | : | 1-24 |
| Abstrak | : | 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. |