Hasil Pencarian  ::  Simpan CSV :: Kembali

"This unique textbook/​reference presents unified coverage of bioinformatics topics relating to both biological sequences and biological networks, providing an in-depth analysis of cutting-edge distributed algorithms, as well as of relevant sequential algorithms. In addition to introducing the latest algorithms in this area, more than fifteen new distributed algorithms are also proposed. Topics and features: Reviews a range of open challenges in biological sequences and networks, beginning with an informal description of the problem before defining it formally Describes in detail both sequential and parallel/​distributed algorithms for each problem, briefly discussing software packages if there are any available Suggests approaches for distributed algorithms as possible extensions to sequential algorithms, when the distributed algorithms for the topic are scarce Proposes a number of new distributed algorithms in each chapter, to serve as potential starting points for further research Concludes each chapter with self-test exercises, a summary of the key points, a comparison of the algorithms described, and a literature review This clearly-written and easy to follow work is ideal as a textbook for graduate and senior undergraduate students of computer science and biology, and as a self-study guide for any interested reader with a basic background in discrete mathematic s and algorithms. Researchers in bioinformatics will also find the book to be a useful reference on this subject. Dr. K. Erciyes is Rector of Izmir University, Turkey, where he also serves as a professor in the Computer Engineering Department. His other publications include the Springer title Distributed Graph Algorithms for Computer Networks."

"This book is essentially a guided tour of the fundamental concepts in digital signalprocessing (DSP) and analysis, in which the guide is not a theoretician of thevarious algorithms involved, but a user of them; a scientist that early in her lifestarted studying these techniques to apply them in a proper and fruitful way in herresearch work. Therefore the approach to the various topics is the approach of auser, more concerned about the way to best exploit the possibilities they offer,rather than their purely mathematical facets."

"Perkembangan ekonomi digital melahirkan tantangan regulasi baru bagi otoritas persaingan dan penyusun kebijakan. Penggunaan sistem algoritma mulai marak dimanfaatkan sebagai alat untuk melakukan tindakan anti persaingan, salah satunya digunakan dalam menetapkan harga. Di Indonesia belum ada regulasi yang mengatur secara khusus mengenai penggunaan algoritma dalam persaingan usaha, karenanya penting untuk diketahui apakah regulasi persaingan usaha yang dirumuskan untuk pasar konvensional tetap relevan dalam menangani risiko persaingan dengan menggunakan algoritma. Oleh karena itu, penelitian ini bertujuan untuk mengidentifikasi dan mengkaji potensi perjanjian penetapan harga yang mungkin ditimbulkan dengan digunakannya algoritma penetapan harga beserta relevansi penggunaan algoritma dalam penetapan harga pada hukum persaingan usaha di Indonesia. Metode penelitian yang digunakan adalah yuridis-normatif dengan menggunakan pendekatan peraturan perundang-undangan, pendekatan konseptual, serta pendekatan kasus. Bahwa penulis menemukan adanya potensi pelanggaran Pasal 5 UU Nomor 5 Tahun 1999 pada penggunaan algoritma dalam menetapkan harga. Selain itu, perkembangan teknologi dan ekonomi digital membuka kemungkinan untuk terjadi kasus pelanggaran persaingan usaha di sektor digital, terlebih dengan adanya ketidakpastian hukum yang mengatur persaingan di sektor digital. Karenanya, diperlukan adanya pengaturan persaingan usaha di sektor digital atau pedoman terkait batasan-batasan yang dikategorikan sebagai pelanggaran persaingan usaha dalam sektor digital, selain itu juga KPPU sebagai otoritas persaingan usaha di Indonesia perlu menambah sumber daya manusia yang memahami teknologi yang digunakan dalam perkembangan ekonomi digital guna menyesuaikan diri dengan digitalisasi.

---

The rise of the digital economy provides many regulatory challenges for competition authorities and policy makers. Algorithms are used as a tool for anti-competitive behavior, such as price fixing. In Indonesia, there are no regulation that specifically regulate the use of algorithms in competition and therefore it is important to know whether the current legal framework that made for brick-to-mortar market are still relevant in dealing the competition risk by using algorithms. This thesis aims to identify and examine the potential price fixing agreement that may arise from the use of algorithms in setting price along with the relevance to Indonesia’s competition law. The research methodology used in this research is juridical-normative by using statutory approach, conceptual approach, and case approach. Whereas the author found a potential violation of Article 5 of Law Number 5 Year 1999 in the use of pricing algorithms. In addition, the development of technology and digital economy bring the possibility for cases of violations of the competition law in digital sector, especially with the legal uncertainty in governing the competition in the digital sector. Therefore, it is necessary to regulate competition in the digital sector or guidelines regarding boundaries that are categorized as violations to the competition in the digital sector, besides that, KPPU needs to increase its human resources who understand the technology that are used in the development of the digital economy in order to adapt the digitization."

"This book constitutes the refereed proceedings of the 11th International Symposium on Experimental Algorithms, SEA 2012, held Bordeaux, France, in June 2012. The 31 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 64 submissions and present current research in the area of design, analysis, and experimental evaluation and engineering of algorithms, as well as in various aspects of computational optimization and its applications."

"This book constitutes the thoroughly refereed post-proceedings of the 9th International Workshop on Approximation and Online Algorithms, WAOA 2011, held in Saarbrücken, Germany, in September 2011. The 21 papers presented were carefully reviewed and selected from 48 submissions. The volume also contains an extended abstract of the invited talk of Prof. Klaus Jansen. The Workshop on Approximation and Online Algorithms focuses on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applications in a wide variety of fields. Topics of interest for WAOA 2011 were: algorithmic game theory, approximation classes, coloring and partitioning, competitive analysis, computational finance, cuts and connectivity, geometric problems, inapproximability results, mechanism design, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, parameterized complexity, randomization techniques and scheduling problems."

"In this brief the authors discuss some important subclasses of polynomial optimization models arising from various applications, with a focus on approximations algorithms with guaranteed worst case performance analysis. The brief presents a clear view of the basic ideas underlying the design of such algorithms and the benefits are highlighted by illustrative examples showing the possible applications."

"Describes a selection of important parallel algorithms for matrix computations. Reviews the current status and provides an overall perspective of parallel algorithms for solving problems arising in the major areas of numerical linear algebra, including (1) direct solution of dense, structured, or sparse linear systems, (2) dense or structured least squares computations, (3) dense or structured eigenvaluen and singular value computations, and (4) rapid elliptic solvers. The book emphasizes computational primitives whose efficient execution on parallel and vector computers is essential to obtain high performance algorithms. Consists of two comprehensive survey papers on important parallel algorithms for solving problems arising in the major areas of numerical linear algebra--direct solution of linear systems, least squares computations, eigenvalue and singular value computations, and rapid elliptic solvers, plus an extensive up-to-date bibliography (2,000 items) on related research."

"This symposium concerned research on the use, design, and analysis of efficient algorithms and data structures, and on the mathematical problems related to the development and analysis of discrete algorithms. The papers are based on the extent to which the results yield new insights for the design, use, or analysis of efficient algorithms. Performance analysis cover analytical and experimental, worst-case and average-case performance. The studies are both theoretical or based on real data sets, and address methodological issues involved in performance analysis. They cover the discrete mathematics and experimental and applied algorithms communities."