Ik45/wikipedia_dataset_science_en_id huggingface dataset:
Creativity, past experience, a sense of what makes "good" software, and a commitment to quality are success factors for a competent design.
Daya cipta, pengalaman lama, pemahaman tentang apa yang membuat perangkat lunak "baik", dan komitmen terhadap kualitas merupakan faktor keberhasilan untuk rancangan yang cakap.
A software design can be compared to an architected plan for a house.
Model rancangan perangkat lunak dapat dibandingkan dengan rencana arsitektur untuk sebuah rumah.
High-level plans represent the totality of the house (e.g., a three-dimensional rendering of the house).
Rencana tingkat tinggi menggambarkan keseluruhan rumah (misalnya, rekacitra rumah dalam tiga dimensi).
Similarly, the software design model provides a variety of views of the proposed software solution.
Demikian pula, model rancangan perangkat lunak memberikan berbagai tampilan solusi perangkat lunak yang diusulkan.
The design can be created while coding, without a plan or requirements analysis, but for more complex projects this is less feasible.
Dimungkinkan pula perancangan perangkat lunak dalam proses pengkodean, tanpa rencana atau analisis persyaratan, tetapi untuk proyek yang lebih rumit hal ini kurang memungkinkan.
Software systems inherently deal with uncertainties, and the size of software components can significantly influence a system's outcomes, both positively and negatively.
Sistem perangkat lunak pada dasarnya menghadapi ketidakpastian, dan ukuran komponen perangkat lunak dapat memengaruhi hasil sistem secara kentara, baik secara positif maupun negatif.
Neal Ford and Mark Richards propose an iterative approach to address the challenge of identifying and right-sizing components.
Neal Ford dan Mark Richards mengusulkan pendekatan berulang (iterative) untuk mengatasi tantangan dalam mengidentifikasi dan menyesuaikan ukuran komponen.
Initial components are identified based on the established strategy.
Komponen awal diidentifikasi berdasarkan strategi yang ditetapkan.
Requirements are assigned to the identified components.
Persyaratan ditetapkan pada komponen yang diidentifikasi.
The roles and responsibilities of each component are analyzed to ensure clarity and minimize overlap.
Peran dan tanggung jawab setiap komponen dianalisis untuk memastikan kejelasan dan mengurangi tumpang tindih.
Architectural characteristics, such as scalability, fault tolerance, and maintainability, are evaluated.
Karakteristik arsitektur, seperti skalabilitas, daya tahan kesalahan, dan kemudahan perawatan, dinilai.
Components may be restructured based on feedback from development teams.
Komponen dapat disusun ulang berdasarkan umpan balik dari tim pengembangan.
Rapid Rapid application development (RAD) is a methodology which favors iterative development and the rapid construction of prototypes instead of large amounts of up-front planning.
Rapid Application Development (RAD) merupakan gabungan dari bermacam-macam teknik terstruktur dengan teknik prototyping dan teknik pengembangan joint application untuk mempercepat pengembangan sistem/aplikasi.
A unit of work is a behavioral pattern in software development.
Unit kerja adalah pola perilaku dalam pengembangan perangkat lunak.
A unit of work encapsulates one or more code repositories[de] and a list of actions to be performed which are necessary for the successful implementation of self-contained and consistent data change.
Unit kerja merangkum satu atau lebih repositori kode dan daftar tindakan yang harus dilakukan yang diperlukan untuk keberhasilan implementasi perubahan data yang terisolasi dan konsisten.
P is a process waiting for a message that was sent on a communication channel named c before proceeding as P , binding the name received to the name x.
P adalah sebuah proses yang menerima pesan dari saluran c sebelum kemudian menjadi P .
P }\langle y\rangle .P} describes that the name y is emitted on channel c before proceeding as P .
P }\langle y\rangle .P} adalah nama y dikirim lewat saluran c dan kemudian menjadi P .
replication, written !
replication, ditulis !
P , which may be seen as a process which can always create a new copy of P .
P , yaitu sebuah proses yang selalu membuat salinan baru dari dirinya sendiri.
the nil process, written 0 , is a process whose execution is complete and has stopped.
the nil process, ditulis 0, yaitu proses kosong yang telah berhenti bekerja.
0 (\nu x)&\;(\;0\\&\;|\;{\overline {z}}\langle x\rangle .\;x(y).\;0\;)\\&\;|\;z(v).\;{\overline {v}}\langle v\rangle .\;0\end{aligned}}} Note that the remaining y is not affected because it is defined in an inner scope.
y}}\langle x\rangle .\;x(y).\;0\;)\end{aligned}}\\|\;&z(v).\;{\overline {v}}\langle v\rangle .0\end{aligned}}}
.0 ) | z ( v ) .
x ( y ) . 0 ) | z ( v ) .
v ¯ ⟨ v ⟩ .0 → ( ν x ) ( 0 | z ¯ ⟨ x ⟩ .
Berikut adalah sebuah contoh: ( ν x ) ( x ¯ ⟨ z ⟩ . 0 | x ( y ) .
v ¯ ⟨ v ⟩ .0 → ( ν x ) ( 0 | x ( y )
Berikut adalah sebuah contoh: ( ν x ) ( x ¯ ⟨ z ⟩ . 0 | x ( y ) .
The full power of replication !
replication, ditulis !
The following programming languages implement the π-calculus or one of its variants: Business Process Modeling Language (BPML) occam-π Pict JoCaml (based on the Join-calculus) RhoLang Milner, Robin (1999).
Berikut adalah bahasa pemrograman yang didasarkan pada kalkulus π Business Process Modeling Language (BPML) Nomadic Pict occam-π JoCaml Robin Milner: Communicating and Mobile Systems: the Pi-Calculus, Cambridge Univ.
Logic and Algebra of Specification.
Logic and Algebra of Specification, 1993.
In 1980, Paul Benioff introduced the quantum Turing machine, which uses quantum theory to describe a simplified computer.
Komputasi kuantum dimulai pada tahun 1980 ketika fisikawan Paul Benioff mengusulkan model mekanika kuantum dari mesin Turing.
There are a number of technical challenges in building a large-scale quantum computer.
Saat ini ada sejumlah kendala signifikan untuk membangun komputer kuantum yang berguna.
Careful estimates show that at least 3 million physical qubits would factor 2,048-bit integer in 5 months on a fully error-corrected trapped-ion quantum computer.
Pada tahun 2015, studi Universitas Duke memperkirakan bahwa hampir 3 juta qubit komputer kuantum yang toleran terhadap kesalahan besar dapat memfaktorkan bilangan bulat 2.048-bit dalam lima bulan.
Quantum Computing: Progress and Prospects.
Perangkat yang melakukan komputasi kuantum dikenal sebagai komputer kuantum.
It often refers to quantum algorithms for machine learning tasks which analyze classical data, sometimes called quantum-enhanced machine learning.
Pemelajaran mesin kuantum (bahasa Inggris: quantum machine learning) adalah integrasi antara algoritma kuantum dan program pemelajaran mesin.
Furthermore, quantum algorithms can be used to analyze quantum states instead of classical data.
Selain itu, algoritma kuantum dapat digunakan untuk menganalisis keadaan kuantum alih-alih data klasik.
Furthermore, researchers investigate more abstract notions of learning theory with respect to quantum information, sometimes referred to as "quantum learning theory".
Hubungan lebih jauh lagi, para ilmuwan menyelidiki gagasan yang lebih abstrak tentang teori pemelajaran dengan informasi kuantum, yang kadang-kadang disebut sebagai "teori pemelajaran kuantum".
Quantum-enhanced machine learning refers to quantum algorithms that solve tasks in machine learning, thereby improving and often expediting classical machine learning techniques.
Pemelajaran mesin kuantum (bahasa Inggris: quantum machine learning) adalah integrasi antara algoritma kuantum dan program pemelajaran mesin.
Smullyan, Raymond (1994), Diagonalization and Self-Reference, Oxford Science Publications, ISBN 0-19-853450-7 Crabtree, Jonathan J. (2016), The Lost Logic of Elementary Mathematics and the Haberdasher who Kidnapped Kaizen, Proceedings of the Mathematical Association of Victoria (MAV) Annual Conference, 53, 98–106, ISBN 978-1-876949-60-0
Smullyan, Raymond (1994), Diagonalization and Self-Reference, Oxford Science Publications, ISBN 0-19-853450-7 Crabtree, Jonathan (2016), The Lost Logic of Elementary Mathematics and the Haberdasher who Kidnapped Kaizen, Proceedings of the Mathematical Association of Victoria (MAV) Annual Conference, 53, 98-106, ISBN 978-1-876949-60-0
Cyborg (Victor Stone) is a superhero appearing in American comic books published by DC Comics.
Cyborg adalah karakter pahlawan super dari dunia DC Comics.
The character was created by writer Marv Wolfman and artist George Pérez, and first appeared in an insert preview in DC Comics Presents #26 (October 1980).
Tokoh ini dibuat oleh penulis Marv Wolfman dan komikus George Pérez, dan pertama kali muncul pada komik DC Comics Presents #26 (Oktober 1980).
Friedrich Ludwig "Fritz" Bauer (10 June 1924 – 26 March 2015) was a German pioneer of computer science and professor at the Technical University of Munich.
Friedrich Ludwig Bauer (lahir 10 Juni 1924 di Regensburg) adalah seorang ilmuwan komputer asal Jerman dan seorang profesor emeritus di Munich University of Technology.
Since 1963, he worked as a professor of mathematics and (since 1972) computer science at the Technical University of Munich.
Sejak tahun 1963, dia bekerja sebagai profesor di bidang matematika dan mulai 1972 sebagai profesor di bidang ilmu komputer Universitas Teknologi München.
Bauer was a member of the committees that developed the imperative computer programming languages ALGOL 58, and its successor ALGOL 60, important predecessors to all modern imperative programming languages.
Bauer juga ikut bekerja dalam komite yang mengembangkan bahasa pemrograman imperatif Algol 60, salah satu pendahulu bahasa pemrograman modern saat ini.
He designed several programming languages, including Pascal, and pioneered several classic topics in software engineering.
Dia merancang beberapa bahasa pemrograman, termasuk Pascal, dan memelopori beberapa topik klasik dalam rekayasa perangkat lunak.
In 1984, he won the Turing Award, generally recognized as the highest distinction in computer science, "for developing a sequence of innovative computer languages".
Pada tahun 1984, ia memenangkan Turing Award, yang secara umum diakui sebagai penghargaan tertinggi dalam ilmu komputer, untuk mengembangkan serangkaian bahasa komputer yang inovatif.
From 1963 to 1967, Wirth served as assistant professor of computer science at Stanford University and again at the University of Zürich.
Pada rentang waktu 1963 - 1967 Wirth bekerja sebagai Assistant Professor di bidang ilmu komputer di Stanford University dan di University of Zurich.
The book Compiler Construction The book Algorithms and Data Structures The book Project Oberon: The Design of an Operating System and Compiler.
The book Compiler Construction The book Algorithms and Data Structures The book Project Oberon – The Design of an Operating System and Compiler.
The PDF file has an additional appendix "Ten Years After: From Objects to Components".
The PDF file has an additional appendix Ten Years After: From Objects to Components.
Frederick Phillips Brooks Jr. (April 19, 1931 – November 17, 2022) was an American computer architect, software engineer, and computer scientist, best known for managing development of IBM's System/360 family of mainframe computers and the OS/360 software support package, then later writing candidly about those experiences in his seminal book The Mythical Man-Month.
Frederick Phillips Brooks, Jr. (lahir 19 April 1931) adalah seorang software engineer dan ilmuwan komputer, yang dikenal sebagai orang yang mengelola pengembangan OS/360, dan kemudian menuliskan prosesnya secara samar dalam buku terkenal The Mythical Man-Month.
Born on April 19, 1931, in Durham, North Carolina, he attended Duke University, graduating in 1953 with a Bachelor of Science degree in physics, and he received a Ph.D. in applied mathematics (computer science) from Harvard University in 1956, supervised by Howard Aiken.
Lahir di Durham, North Carolina, belajar di Duke University (lulus 1953) dan kemudian dia menyelesaikan Ph.D. di bidang matematika terapan (ilmu komputer) di Universitas Harvard pada tahun 1956, dalam bimbingan Howard Aiken.
In addition to The Mythical Man-Month, Brooks is also known for the paper "No Silver Bullet – Essence and Accident in Software Engineering".
Selain buku The Mythical Man-Month, Brooks juga dikenal lewat tulisan No Silver Bullet, sebuah esai di bidang perangkat lunak.
In 1978, Rabin invented the Rabin signature algorithm, the first asymmetric cryptosystem whose security was proved equivalent to the intractability of integer factorization.
Pada tahun 1979, Rabin menemukan Sistem kripto Rabin, yang merupakan sistem kripto asimetrik pertama yang tingkat keamanannya terbukti ekivalen dengan kesulitan menentukan faktorisasi integer dari sebuah bilangan yang sangat besar.
In 1987, Rabin, together with Richard Karp, created one of the most well-known efficient string search algorithms, the Rabin–Karp string search algorithm, known for its rolling hash.
Pada tahun 1987, Rabin, bersama dengan Richard Karp, membuat algoritme pencarian string yang paling efisien dan dinamakan algoritme pencarian string Rabin-Karp.
In 1976, the Turing Award was awarded jointly to Rabin and Dana Scott for a paper written in 1959, the citation for which states that the award was granted: For their joint paper "Finite Automata and Their Decision Problems," which introduced the idea of nondeterministic machines, which has proved to be an enormously valuable concept.
Pada tahun 1976, ia dan Dana Scott menerima penghargaan Turing Award atas makalah yang ditulis pada tahun 1959 yang berjudul "Finite Automata and Their Decision Problem".
Leslie Barry Lamport (born February 7, 1941) is an American computer scientist and mathematician.
Leslie B. Lamport (lahir 7 Februari 1941 di Brooklyn) adalah seorang ilmuwan komputer dan matematikawan Amerika.
Lamport is best known for his seminal work in distributed systems, and as the initial developer of the document preparation system LaTeX and the author of its first manual.
Lamport terkenal karena karya seminalnya dalam sistem terdistribusi, dan sebagai pengembang awal sistem persiapan dokumen LaTeX dan penulis manual pertamanya.
He devised important algorithms and developed formal modeling and verification protocols that improve the quality of real distributed systems.
Dia menyusun algoritma penting dan mengembangkan pemodelan formal dan protokol verifikasi yang meningkatkan kualitas sistem terdistribusi nyata.
Lamport was born into a Jewish family in Brooklyn, New York, the son of Benjamin and Hannah Lamport (née Lasser).
Lamport lahir dalam keluarga Yahudi di Brooklyn, New York, putra Benjamin dan Hannah Lamport (Née Lasser).
His father was an immigrant from Volkovisk in the Russian Empire (now Vawkavysk, Belarus) and his mother was an immigrant from the Austro-Hungarian Empire, now southeastern Poland.
Ayahnya adalah seorang imigran dari Volkovisk di Kekaisaran Rusia (sekarang Vawkavysk, Belarusia) dan ibunya adalah seorang imigran dari Kekaisaran Austro-Hungaria, sekarang Polandia tenggara.
A graduate of Bronx High School of Science, Lamport received a B.S. in mathematics from the Massachusetts Institute of Technology in 1960, followed by M.A. (1963) and Ph.D. (1972) degrees in mathematics from Brandeis University.
Lulusan Bronx High School of Science, Lamport menerima gelar BS dalam matematika dari Institut Teknologi Massachusetts pada tahun 1960, diikuti oleh MA (1963) dan Ph.D. (1972) gelar di bidang matematika dari Universitas Brandeis.
He became the Professor of Computing Science at the Queen's University of Belfast in 1968, and in 1977 returned to Oxford as the Professor of Computing to lead the Programming Research Group in the Oxford University Computing Laboratory (now Department of Computer Science, University of Oxford), following the death of Christopher Strachey.
Hoare kemudian menjadi Profesor di bidang Computing Science di Queen's University, Belfast pada 1968, dan pada tahun 1977 kembali ke Oxford sebagai Professor of Computing dan memimpin Programming Research Group di Oxford University Computing Laboratory, setelah wafatnya Christopher Strachey.
He is now an Emeritus Professor there, and is also a principal researcher at Microsoft Research in Cambridge, England.
Saat ini dia menjabat sebagai Professor Emeritus di sana, dan juga sebagai peneliti senior di Microsoft Research Cambridge, Inggris.
Dahl, O.-J.; Dijkstra, E. W.; Hoare, C. A. R. (1972).
O.-J. Dahl, E. W. Dijkstra and C. A. R. Hoare (1972).
ISBN 978-0131532717 (hardback) or ISBN 978-0131532892 (paperback).
ISBN 0-13-153271-5 hardback or ISBN 0-13-153289-8 paperback.
Hoare, C. A. R.; Gordon, M. J. C. (1992).
C. A. R. Hoare and M. J. C. Gordon (1992).
Hoare, C. A. R.; He, Jifeng (1998).
C. A. R. Hoare and He Jifeng (1998).
Schneier has been involved in the creation of many cryptographic algorithms.
Schneier terlibat dalam pengembangan beberapa algoritma kriptografi.
ISBN 978-0-393-60888-5 Schneier, Bruce.
ISBN 978-0-393-24481-6 Schneier, Bruce.
ISBN 978-1119643012 Schneier, Bruce.
ISBN 978-1118790816 Schneier, Bruce.
Attack tree Failing badly Snake oil (cryptography)
Attack tree Failing badly Snake oil (kriptografi)
Milner received the ACM Turing Award in 1991.
Pada tahun 1991, Milner mendapat penghargaan Turing Award.
Proof, Language, and Interaction: Essays in Honour of Robin Milner, edited by Gordon Plotkin, Colin Stirling and Mads Tofte.
Proof, Language, and Interaction: Essays in Honour of Robin Milner Diarsipkan 2005-09-13 di Wayback Machine., edited by Gordon Plotkin, Colin Stirling and Mads Tofte.
Jörg-Rüdiger Wolfgang Sack (born in Duisburg, Germany) is a professor of computer science at Carleton University, where he holds the SUN–NSERC chair in Applied Parallel Computing.
Jörg-Rüdiger Wolfgang Sack (lahir di Duisburg, Jerman) adalah seorang profesor ilmu komputer di Universitas Carleton, tempat ia menduduki posisi ketua SUN-NSERC di bidang Komputer Paralel Terapan.
Sack received a master's degree from the University of Bonn in 1979 and a Ph.D. in 1984 from McGill University, under the supervision of Godfried Toussaint.
Sack menerima gelar master dari Universitas Bonn pada tahun 1979 dan gelar Ph.D. pada tahun 1984 dari Universitas McGill, di bawah bimbingan Godfried Toussaint.
He is co-editor-in-chief of the journal Computational Geometry: Theory and Applications, co-editor of the Handbook of Computational Geometry (Elsevier, 2000, ISBN 978-0-444-82537-7), and co-editor of the proceedings of the biennial Algorithms and Data Structures Symposium (WADS).
Theory and Applications dan Journal of Spatial Information Science, ketua editor bersama dari Handbook of Computational Geometry (Elsevier, 2000, ISBN 978-0-444-82537-7), dan ketua editor bersama dari acara dua tahunan Algorithms and Data Structures Symposium (WADS).
Sack's research interests include computational geometry, parallel algorithms, and geographic information systems.
Minat penelitian Sack meliputi geometri komputasi, algoritme paralel, dan sistem informasi geografis.
Raz, Ran; Safra, Shmuel (1997), "A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP", Proc.
Raz, Ran; Safra, Shmuel (1997), "A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP", Proc. STOC 1997, hlm.
475–484, CiteSeerX 10.1.1.34.6957, doi:10.1145/258533.258641, ISBN 978-0-89791-888-6, S2CID 15457604.
475–484, CiteSeerX 10.1.1.34.6957, doi:10.1145/258533.258641, ISBN 978-0-89791-888-6.
633–641, CiteSeerX 10.1.1.2.9694, doi:10.1145/1007352.1007353, ISBN 978-1-58113-852-8, S2CID 1297877.
633–641, CiteSeerX 10.1.1.2.9694, doi:10.1145/1007352.1007353, ISBN 978-1-58113-852-8.
Raz, Ran; Shpilka, Amir (2004), "Deterministic polynomial identity testing in non commutative models", Proc. CCC 2004, pp.
Raz, Ran; Shpilka, Amir (2004), "Deterministic polynomial identity testing in non commutative models", Proc. CCC 2004, hlm.
Dahl became a full professor at the University of Oslo in 1968 and was a gifted teacher as well as researcher.
Dahl menjadi profesor penuh di Universitas Oslo pada tahun 1968 dan merupakan seorang guru dan peneliti yang sangat berbakat.
Here he worked on Hierarchical Program Structures, probably his most influential publication, which appeared co-authored with C.A.R. Hoare in the influential book Structured Programming of 1972 by Dahl, Edsger Dijkstra, and Hoare, perhaps the best-known academic book concerning software in the 1970s.
Di sini dia mengerjakan struktur program hirarkis, yang mungkin merupakan publikasinya yang paling berpengaruh, yang dipublikasikan bersama C.A.R. Hoare dalam buku yang terkenal Structured Programming pada tahun 1972 oleh Dahl, Edsger Dijkstra dan Hoare, yang mungkin merupakan buku akademis yang terbaik tentang perangkat lunak pada tahun 1970-an.
As his career advanced, Dahl grew increasingly interested in the use of formal methods, to rigorously reason about object-orientation for example.
Ketika kariernya naik, Dahl menjadi semakin tertarik dengan penggunaan metode formal, untuk melakukan penalaran secara rigor terhadap orientasi objek.
Dahl and Nygaard were the first to develop the concepts of class, subclass (allowing implicit information hiding), inheritance, dynamic object creation, etc., all important aspects of the OO paradigm.
Dahl dan Nygaard adalah yang pertama kali mengembangkan konsep kelas, subkelas (yang memungkinkan penyembunyian informasi secara implisit), turunan, pembuatan objek dinamis, dsb., yang merupakan aspek penting dalam paradigma OO.
These are combined to form a complete system.
Kesemua ini dikombinasikan dan membentuk sistem yang lengkap.
The object-oriented approach is now pervasive in modern software development, including widely used imperative programming languages such as C++ and Java.
Pendekatan berorientasi objek kini banyak digunakan dalam pengembangan perangkat lunak modern, termasuk pula di dalamnya bahasa pemrograman yang sangat sering digunakan seperti Java dan C++.
The award is named after Alan Turing, also referred as "Father of Computer Science", who was a British mathematician and reader in mathematics at the University of Manchester.
Penghargaan ini dinamakan berdasarkan nama Alan Mathison Turing (1912–1954), seorang matematikawan dari Inggris yang dianggap sebagai salah satu bapak ilmu komputer modern.
MATLAB (Matrix Laboratory) is a proprietary multi-paradigm programming language and numeric computing environment developed by MathWorks.
MATLAB (Matrix Laboratory) adalah sebuah bahasa pemrograman tingkat tinggi yang secara khusus digunakan untuk komputasi numerik, pemrograman, dan visualisasi.
MATLAB allows matrix manipulations, plotting of functions and data, implementation of algorithms, creation of user interfaces, and interfacing with programs written in other languages.
MATLAB memungkinkan manipulasi matriks, pem-plot-an fungsi dan data, implementasi algoritme, pembuatan antarmuka pengguna, dan peng-antarmuka-an dengan program dalam bahasa lainnya.
An additional package, Simulink, adds graphical multi-domain simulation and model-based design for dynamic and embedded systems.
Sebuah paket tambahan, Simulink, menambahkan simulasi grafis multiranah dan Desain
MathWorks, Inc. was founded to develop the software and the MATLAB programming language was released.
Perusahaan yang bertanggung-jawab atas produk hasil pengembangan dari MATLAB ialah MathWorks.
The MATLAB application is built around the MATLAB programming language.
Aplikasi MATLAB dibangun oleh bahasa pemrograman MATLAB.
Common usage of the MATLAB application involves using the "Command Window" as an interactive mathematical shell or executing text files containing MATLAB code.
Cara kerja aplikasi biasanya dilakukan pada jendela perintah (command window) untuk melakukan komputasi atau menjalankan berkas teks yang berisi kode MATLAB.
Valid function names begin with an alphabetic character, and can contain letters, numbers, or underscores.
Nama fungsi yang valid dimulai dengan huruf, lalu dapat berisi huruf, angka, atau garis bawah.
MATLAB can call functions and subroutines written in the programming languages C or Fortran.
Aplikasi MATLAB dibangun oleh bahasa pemrograman MATLAB.