Pencarian Artikel Jurnal & Majalah

Menampilkan keseluruhan arsip dokumen (Halaman 1124 dari 34197, Total: 341964 data)

Object-Based Constraint Knowledge Propagation

Nama Pengarang : -
Nama Majalah/Jurnal : Jurnal ilmu komputer dan teknologi informasi
Volume / Nomor Edisi : 3 (No. 1)
Nomor Halaman : 19-26
Abstraksi Narasi : Planning problems are non-deterministic in nature because they involve many considerations and interacting factors. The complexity of the problem is the real challenge. This work implements an inference mechanism within a constraint network by deducing plans through the relationships between objects. The relationships between objects model the links between structural and behavioural properties of the planning entities. This paper explains the uses of constraint knowledge which is incorporated into objects and how to propagate such constraints over the network of objects. This paper also elaborates how the combination of the deductive process and abductive knowledge works together.

Research and Education in Computational Science and Engineering

Nama Pengarang : Karen Willcox,Lois Curfman Mclnnes,Hans De Sterck
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 60 (No. 3)
Nomor Halaman : 707-754
Abstraksi Narasi : This report presents challenges, opportunities, and directions for computational science and engineering (CSE) research and education for the next decade. Over the past two decades the field of CSE has penetrated both basic and applied research in academia, industry, and laboratories to advance discovery, optimize systems, support decision-makers, and educate the scientific and engineering workforce. Informed by centuries of theory and experiment, CSE performs computational experiments to answer questions that neither theory nor experiment alone is equipped to answer. CSE provides scientists and engineers with algorithmic inventions and software systems that transcend disciplines and scales. CSE brings the power of parallelism to bear on troves of data. Mathematics-based advanced computing has become a prevalent means of discovery and innovation in essentially all areas of science, engineering, technology, and society, and the CSE community is at the core of this transformation. However, a combination of disruptive developments---including the architectural complexity of extreme-scale computing, the data revolution and increased attention to data-driven discovery, and the specialization required to follow the applications to new frontiers---is redefining the scope and reach of the CSE endeavor. With these many current and expanding opportunities for the CSE field, there is a growing demand for CSE graduates and a need to expand CSE educational offerings. This need includes CSE programs at both the undergraduate and graduate levels, as well as continuing education and professional development programs, exploiting the synergy between computational science and data science. Yet, as institutions consider new and evolving educational programs, it is essential to consider the broader research challenges and opportunities that provide the context for CSE education and workforce development.

Algorithmic Trading, Stochastic Control, and Mutually Exciting Processes

Nama Pengarang : -
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 60 (No. 3)
Nomor Halaman : 673-703
Abstraksi Narasi : We develop a high frequency (HF) trading strategy where the HF trader uses her superior speed to process information and to post limit sell and buy orders. By introducing a multifactor mutually exciting process, we allow for feedback effects in market buy and sell orders and the shape of the limit order book (LOB). Our model accounts for the arrival of market orders that influence activity, trigger one-sided and two-sided clustering of trades, and induce temporary changes in the shape of the LOB. We also model the impact that market orders have on the short-term drift of the midprice (short-term-alpha). We show that HF traders who do not include predictors of short-term-alpha in their strategies are driven out of the market because they are adversely selected by better-informed traders and because they are not able to profit from directional strategies.

Fast Tree Inference With Weighted Fusion Penalties

Nama Pengarang : -
Nama Majalah/Jurnal : Journal of Computational and Graphical Statistics
Volume / Nomor Edisi : 26 (No. 1)
Nomor Halaman : 205-216
Abstraksi Narasi : Given a dataset with many features observed In a large number of conditions, it is desirable to fuse and aggregate conditions that are similar to ease the interpretation and extract the main characteristics of the data. This article presents a multidimensional fusion penalty framework to address this question when the number of conditions are large. If the fusion penalty is encoded by an -norm, we prove for uniform weights that the path of solutions is a tree that Is suitable for interpretc1bility. For the, and norms the path is piecewise linear and we derive a homotopy algorithm to recover exactly the whole tree structure. For weighted -fusion penalties, we demonstrate that distance-decreasing weights lead to balanced tree structures. For a subclass of these weights that we call "exponentially adaptive,"we derive an O(n log(n)) homotopy algorithm and we prove an asymptotic oracle property. This guarantees that we recover the underlying structure of the data efficiently both from a statistical and a computational point of view. We provide a fast implementation of the homotopy algorithm for the single feature case, as well as an efficient embedded cross-validation procedure that takes advantage of the tree structure of the path of solutions. Our proposal outperforms its competing procedures on simulations both in terms of timings and prediction accuracy. As an example we consider phenotypic data: given one or several traits, we reconstruct a balanced tree structure an<;! assess its agreement with the known taxonomy. Supplementary materials for this article are available online.

Pembuatan Tirex Burger Dari Jamur Tiram Putih (Pleurotus sp) Sebagai Alternatif Burger Bernilai Serat Tinggi

Nama Pengarang : -
Nama Majalah/Jurnal : Jurnal Saintifika Universitas Gadjah Mada
Volume / Nomor Edisi : II (No. 1)
Nomor Halaman : 62-67
Abstraksi Narasi : Jamur dikenal sebagai hidangan lezat sejak 3000 tahun silam, ketika menjadi hidangan populer para raja Mesir. Encyclopedia Americana membagi kategori jamur menjadi dua jenis, yaitu jamur edible dan non-edible. Jamur edible merupakan jamur yang relatif aman untuk dikonsumsi. Contoh jamur tiram, jamur kuping, dan jamur merang. Jamur non-edible adalah jamur yang umumnya tidak dikonsumsi. Dari sekian banyak jamur edible, jamur tiram (Pleurotus sp.) termasuk dalam kategori yang sering dikonsumsi. Berdasarkan hasil penelitian yang dilakukan Departemen Sains Kementerian Industri Thailand (Chazali, 2009), jamur tiram menjadi sumber protein alternatif karena mengandung 9 asam amino esensial. Usaha yang bisa dikembangkan dari olahan jamur adalah burger jamur. Dari dana hibah PKMK DIKTI sebesar Rp.6.999.000 kami mencoba membuat Tirex Burger dengan diversifikasinya seperti steak, sosis, sandwich. Tujuan dari invensi ini adalah meningkatkan nilai ekonomi, dan meningkatkan keanekaragaman olahan jamur tiram putih, serta meningkatkan jiwa kewirausahaan di kalangan mahasiswa sehingga dapat membuka lapangan kerja. Setelah berjalan selama kurang lebih 5,5 bulan, usaha ini mempunyai lima cabang usaha, empat cabang di Yogyakarta, dan satu cabang di Solo. Untuk menjaga ketersediaan bahan baku, kami membuat kumbung jamur yang pengelolaannya kami komersialkan. Omset yang kami peroleh dari usaha ini sebesar Rp. 158.000.000,00 dengan supporting staff 23 orang. Semua usaha ini di bawah naungan CV. Masruum Indonesia, perusahaan yang resmi kami dirikan pada tanggal 1 mei 2010. Satu hal yang menjadi nilai plus sekaligus kebanggaan kami adalah meskipun status kami masih mahasiswa, kami bisa membuka lapangan kerja untuk orang lain.  

Shanks Sequence Transformations and Anderson Acceleration

Nama Pengarang : Michela Redivo-Zaglia,Claude Brezinski
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 60 (No. 3)
Nomor Halaman : 646-669
Abstraksi Narasi : This paper presents a general framework for Shanks transformations of sequences of elements in a vector space. It is shown that Minimal Polynomial Extrapolation (MPE), Modified Minimal Polynomial Extrapolation (MMPE), Reduced Rank Extrapolation (RRE), the Vector Epsilon Algorithm (VEA), the Topological Epsilon Algorithm (TEA), and Anderson Acceleration (AA), which are standard general techniques designed to accelerate arbitrary sequences and/or solve nonlinear equations, all fall into this framework. Their properties and their connections with quasi-Newton and Broyden methods are studied. The paper then exploits this framework to compare these methods. In the linear case, it is known that AA and GMRES are “essentially” equivalent in a certain sense, while GMRES and RRE are mathematically equivalent. This paper discusses the connection between AA, the RRE, the MPE, and other methods in the nonlinear case.

Formalisasi dan Verifikasi Spesifikasi Sistem Pengendali Lalulintas Kereta Api di Stasiun dengan Rel Ganda

Nama Pengarang : Widijanto S. Nugroho,Belawati H. Widjaja,Eri Zuliarso
Nama Majalah/Jurnal : Jurnal ilmu komputer dan teknologi informasi
Volume / Nomor Edisi : 3 (No. 1)
Nomor Halaman : 8-18
Abstraksi Narasi : Sistem kontrol lalulintas kereta api di suatu stasiun harus memenuhi kriteria berupa kehandalan (reliable); dalam arti, untuk menjamin keamanan sistem, waktu respon dari sistem terhadap lingkungannya harus sesuai dengan yang disyaratkan. Kegagalan sistem dalam merespon lingkungan-nya dapat menyebabkan terjadinya struasi kritis yang dapat berakibat fatal bagi manusia atau lingkungannya. Dalam makalah ini dibuat aturan-aturan agar memenuhi persyaratan keamanan di stasiun kereta api yang terhubung dengan dua stasium yang lain melalui jalur ganda. Aturan-aturan ini menjamin tidak akan terjadi tabrakan kereta api atau kereta api keluar dari relnya. Aturan-aturan itu diwujudkan dalam bentuk pengaturan sinyal, pengaturan posisi wesel dan pengaturan ada tidaknya kereta api di suatu ruas jalur. Pengaturan yang ada memerlukan strategi-strategi kontrol yang perlu dikaji konsistensinya untuk menjamin bahwa pengaturan yang ada sudah berjalan sesuai dengan persyaratan keamanan. Untuk itu dilakukan pemodelan formal dari strategi control tersebut dengan menggunakan Kalkulus Durasi dan uji konsistensi dengan menggunakan Proof Checker/Duration Calculus.

An Augmented ADMM Algorithm With Application to the Generalized Lasso Problem

Nama Pengarang : -
Nama Majalah/Jurnal : Journal of Computational and Graphical Statistics
Volume / Nomor Edisi : 26 (No. 1)
Nomor Halaman : 195-204
Abstraksi Narasi : In this article, we present a fast and stable algorithm for solving a class of optimization problems that arise in many statistical estimation procedures, such as sparse fused lasso over a graph, convex clustering, and. trend filtering, among others. We propose. a so-call.ed augmented alternating direction methods of multlpliers (ADMM) algorithm to solve this class of problems. Compared to a standard ADMM algorithm, our proposal significantly reduces the,computational cost at each iteration while maintaining roughly the same overall convergence speed. We also consider a new varying penalty scheme for the ADMM algorithm, which could further accelerate the convergence, especially when solving a sequence of problems with tuning parameters-of different scales. Extensive numerical experiments on the sparse fused lasso problem show that the proposed algorithm is more efficient than the standard ADMM and two other existing state-of-the-art spedalized algorithms. Finally, we discuss a possible.extension and some interesting connections to two wellknown algorithms. Supplementary materials for the article are available online.

Efficient Computation of the Joint Sample Frequency Spectra for Multiple Populations

Nama Pengarang : -
Nama Majalah/Jurnal : Journal of Computational and Graphical Statistics
Volume / Nomor Edisi : 26 (No. 1)
Nomor Halaman : 182-194
Abstraksi Narasi : A wide range of studies in population genetics have employed the sample frequency spectrum (SFS), a summary statistic which describes the distribution of mutant alleles at a polymorphic site in a sample of DNA sequences and provides a highly efficient dimensional reduction of large-scale population genomic variation data. Recently, there has been much interest in analyzing the joint SFS data from multiple populations to infer parameters of complex demographic histories, including variable population sizes, population split times, migration rates, admixture proportions, and so on. SFS-based inference methods require accurate computation of the expected SFS under a given demographic model. Although much methodological progress has been made, existing methods suffer from numerical instability and high computational complexity when multiple populations are involved and the sample size is large. In this article, we present new analytic formulas and algorithms that enable accurate, efficient computation of the expected joint SFS for thousands of individuals sampled from hundreds of populations related by a complex demographic model with arbitrary population size histories (Including piecewise-exponential growth). Our results are implemented in a new software package called momi (MOran Models for Inference). Through an empirical study, we demonstrate our improvemerits to numerical stability and computational complexity.

Pattern Formation in a Reaction-Diffusion System with Space-Dependent Feed Rate

Nama Pengarang : Theodore Kolokolnikov,Juncheng Wei
Nama Majalah/Jurnal : Siam Review
Volume / Nomor Edisi : 60 (No. 3)
Nomor Halaman : 626-645
Abstraksi Narasi : We develop novel mathematical techniques to study spot patterns in reaction-diffusion systems with space-dependent feed rate. The techniques are illustrated on the Schnakenberg model, which is a prototypical model of spot formation. Previous works have mostly addressed spot formation assuming the feed rate A is a constant, in which case the spots are uniformly distributed throughout the domain. By contrast, the spatially dependent feed rate A(x) occurs naturally in applications, and very few studies exist in this case. In this work we determine analytically how this inhomogeneity affects spot creation, spot density, and spot death. We characterize the asymptotic density of spots and their heights for any spatially dependent feed rate A(x). We also demonstrate a novel phenomenon which only happens when the feed rate is sufficiently inhomogeneous in space. Namely, new spots are continuously created in regions of high feed rate, travel toward regions of lower feed rate, and are destroyed there. This “creation-destruction loop” is only possible in the presence of heterogeneity. A key new technique is the use of the Euler–Maclaurin formula to estimate the effective spike density. For a sufficiently large feed rate, we find that the effective spot density scales like A2/3 (x), whereas the spot mass scales like A1/3 (x). We derive asymptotic bounds for the existence of N spots. As the feed rate is increased, new spots are created through self-replication, whereas the spots are destroyed as the feed rate is decreased. The thresholds for both spike creation and spike death are computed asymptotically.
← Kembali ke Halaman Utama