Comput. Linguistics, 8:621–633, 2020. [54] P. A. Utama, X. X. Xxxxxxx, and I. Gurevych. Mind the trade-off: Debiasing NLU models without degrading the in-distribution performance. In ACL, pages 8717–8729. Association for Computational Linguistics, 2020. [55] P. A. Utama, X. X. Xxxxxxx, and I. Gurevych. Towards debiasing NLU models from unknown biases. In EMNLP, pages 7597–7610. Association for Computational Linguistics, 2020. [56] X. Xxxxxxx, X. Xxxxxxx, X. Xxxxxx, X. Xxxxxxxxx, X. Xxxxx, X. X. Xxxxx, X. Xxxxxx, and
Comput. Sci., 253(1):39–55. [Xxxxx Xxxxxx Xxx Wright, 1951] Xxxxx Xxxxxx Xxx Wright (1951). Deontic Logic. Mind, 60(237):1–15. [Governatori and Xxxxxxxxx, 2005] Governatori, G. and Xxxxxxxxx, Z. (2005). Dealing with contract violations: formalism and domain specific language. In EDOC Enterprise Computing Conference, Ninth IEEE Interna- tional, pages 46–57. IEEE Computer Society.
Comput load of atomic operations: (a) explicit X.509 certificates, PEM format; (b) explicit X.509 certificates, DER format; (c) implicit X.509 certificates. Horizon 2020 research and innovation programme under grant agreement 688156.
Comput. 26(5):1484–1509, 1997. Preliminary version in FOCS ’94. arXiv:quant-ph/9508027v2.
Comput. 33.3 (2004). Preliminary ver- sion in FOCS 2002, pages 738–760. [Reg09] Xxxx Xxxxx. On lattices, learning with errors, random linear codes, and cryptography. In: J. ACM 56.6 (2009). Preliminary version in STOC 2005, pages 1–40. [RV22] Xxxxxx Xxxxxxxx and Xxxxxx Xxxxxx. Approximate in Time-Now in Any Norm! In: Springer, 2022, pages 440– 453. [Sch03] Xxxxx-Xxxxx Xxxxxxx. Lattice Reduction by Random Sampling and Birthday Methods. In: STACS. 2003, pages 145–156. [Sch87] Xxxxx-Xxxxx Xxxxxxx. A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms. In: Theor. Comput. Sci. 53 (1987), pages 201–224. [Sch94] Xxxxx-Xxxxx Xxxxxxx. Block reduced lattice bases and successive minima. In: Combinatorics, Probability and Computing 3.4 (1994), pages 507–522. issn: 1469-2163. [SCM01] Xxxxxxx Xxxx, Xxxxx Xxxxxxx, and Xxxxx Xxxxxx. A lattice-based McEliece scheme for encryption and sig- nature. In: Electronic Notes in Discrete Mathematics 6 (2001), pages 402–411. [SE94] Xxxxx-Xxxxx Xxxxxxx and X. Xxxxxxx. Lattice basis re- duction: Improved practical algorithms and solving sub- set sum problems. In: Mathmatical Programming 66 (1994), pages 181–199. [Sen00] Xxxxxxx Xxxxxxxx. Finding the permutation between equivalent linear codes: The support splitting algorithm. In: IEEE Transactions on Information Theory 46.4 (2000), pages 1193–1203. [SFS09] Xxxxxxx Xxxxxx, Xxxx Xxxxx, and Xxxx Xxxxxx. Finding the closest lattice point by iterative slicing. In: SIAM Journal on Discrete Mathematics 23.2 (2009), pages 715–731. [SG10] Xxxxxxx Xxxxxxxxx and Xxxxxxx Xxxx. Darmstadt SVP Challenges. Accessed: 16-02-2022. 2010. [Sho94] Xxxxx X. Xxxx. Algorithms for quantum computation: discrete logarithms and factoring. In: FOCS. 1994, pages 124–134. [Sie45] Xxxx Xxxxxx Xxxxxx. A mean value theorem in geom- etry of numbers. In: Annals of Mathematics (1945), pages 340–347. issn: 0003-486X. [SSTX09] Xxxxxx Xxxxxx, Xxx Xxxxxxxxx, Xxxxxxx Xxxxxx, and Xxxxx Xxxxxx. Efficient Public Key Encryption Based on Ideal Lattices. In: Asiacrypt. 2009, pages 617–635. [SSV07] Xxxxxxx Xxxxxxx, Xxxxxx Xxxxxxxxx, and Xxxxx Xxxxxxxxx. Classification of eight-dimensional perfect forms. In: Electronic Research Announcements of the American Mathematical Society 13.3 (2007), pages 21–32. [Ste88] Xxxxxxx Xxxxx. A method for finding codewords of small weight. In: Springer, 1988, pages 106–113. [Szy03] Xxxxxxx Xxxxxx. Hypercubic lattice reduction and analy- sis of GGH and NTRU signatures. In: International Xxx- xxxxxx...
Comput. Sci. Inf. Technol., vol. 4, no. 2, pp. 61–68, 2019, doi: 10.11591/aptikom.j.csit.36. [8] X. Xxxxxxx and X. Xxxx, The Data Warehouse Toolkit - The Definitive Guide to Dimensional Modelling. 2013. [9] X. X. Xxxxxxxx, X. Xxxxxxxxxxx, and X. Husnaisa, “Visualisasi Data Terbuka Ketahanan Xxxxxx Provinsi Jawa Barat,” Komputa J. Ilm. Komput. xxx Inform., vol. 6, no. 1, pp. 16–23, 2017, doi: 10.34010/komputa.v6i1.2472. Xxxx Xxxxxxxxxxx lahir di Tangerang pada tanggal 3 Februari 1986. Lulus S1 Program Studi Sistem Informasi STMIK Nusa Mandiri pada tahun 2011. Lulus Magister Ilmu Komputer Program Pascasarjana STMIK Nusa Mandiri pada tahun 2014. Penulis buku pemrograman komputer dengan judul Sistem Informasi Pendaftaran Event Dengan PHP Untuk Panduan Skripsi. Penulis buku pemrograman komputer dengan judul Aplikasi
Comput. Sci., 366(1-2):98–120, 2006. [BM07] Xxxxx Xxxxxx Xxxxxxx and Xxx Xxxxxxxxx. Cc-pi: A constraint-based language for spec- ifying service level agreements. In ESOP, pages 18–32, 2007. [BMM11a] Xxxxxxx Xxxxx, Herna´n C. Melgratti, and Xxx Xxxxxxxxx. A connector algebra for P/T nets interactions. In CONCUR’11, volume 6901 of LNCS, pages 312–326. Springer, 2011. [BMM11b] Xxxxxxx Xxxxx, Herna´n C. Melgratti, and Xxx Xxxxxxxxx. Connector algebras, petri nets, and BIP. In Xxxxxx X. Xxxxxx, Xxxxx Virbitskaite, and Xxxxxx Xxxxxxxx, editors, Per- spectives of Systems Informatics - 8th International Xxxxxx Xxxxxx Memorial Conference, PSI 2011, Novosibirsk, Russia, June 27-July 1, 2011, Revised Selected Papers, volume 7162 of LNCS, pages 19–38. Springer, 2011. [BMM14] Xxxxxxx Xxxxx, Herna´n C. Melgratti, and Xxx Xxxxxxxxx. Behaviour, interaction and dy- namics. In Specification, Algebra, and Software - Essays Dedicated to Xxxxxxx Xxxxxxxxx, volume 8373 of LNCS, pages 382–401. Springer, 2014. [BMM15] Xxxxxxx Xxxxx, Herna´n C. Melgratti, and Xxx Xxxxxxxxx. A normal form for stateful connectors, 2015. Submitted. [BMMS13] Xxxxxxx Xxxxx, Herna´n C. Melgratti, Xxx Xxxxxxxxx, and Xxxxx Xxxxxxxxxx. Connector algebras for C/E and P/T nets’ interactions. Logical Methods in Computer Science, 9(3), 2013. [BMR97] X. Xxxxxxxxxx, X. Xxxxxxxxx, and X. Xxxxx. Semiring-based constraint satisfaction and optimization. Journal of ACM, 44(2):201–236, 1997. [BMS14] Xxxxxxx Xxxxx, Xxx Xxxxxxxxx, and Xxxxxx Xxxxxxxxxx. A coalgebraic semantics for causality in Petri nets. J. Log. Algebr. Program., 2014. Submitted. [BMS15a] Xxxxxxx Xxxxx, Xxx Xxxxxxxxx, and Xxxxxx Xxxxxxxxxx. Reconfigurable and Software- Defined Networks of Connectors and Components. In Xxxxxx Xxxxxxx, Xxxxxxxx Xx¨lzl, Xxxx Xxxx, and Xxxxxx Xxxxx, editors, Software Engineering for Collective Autonomic Systems: Results of the ASCENS Project, volume 8998 of Lecture Notes in Computer Science. Springer Verlag, Heidelberg, 2015. [BMS15b] Xxxxxxx Xxxxx, Xxx Xxxxxxxxx, and Xxxxxx Xxxxxxxxxx. Revisiting causality, coalge- braically. Acta Inf., 52(1):5–33, 2015. [BNG+13] Toma´sˇ Xxxxxˇ, Xxxxx Xx Xxxxxx, Xxxxx Gerostathopoulos, Xxxxxxx Xxxx, Michal Kit, Xxxx Xxxx, Xxxxxxx Xxxxxxxxx Monreale, Xxx Xxxxxxxxx, Xxxxxxx Xxxxxxxx, Xxxxxx Serbedz- ija, Xxxxxx Xxxxxxx, and Franco Zambonelli. A Life Cycle for the Development of Autonomic Systems: The e-Mobility Showcase. In Proceedings of the 3rd Workshop on Challenges for Achieving Self-Awareness ...
Comput. Sci., 366(1-2):98–120, 2006. [BM99] Xxxxxxx Xxxxx and Xxx Xxxxxxxxx. Cartesian closed double categories, their lambda- notation, and the pi-calculus. In LICS 1999, pages 246–265. IEEE Computer Society, 1999. [BM07] Xxxxx Xxxxxx Xxxxxxx and Xxx Xxxxxxxxx. Cc-pi: A constraint-based language for spec- ifying service level agreements. In ESOP 2007, volume 4421 of LNCS, pages 18–32. Springer, 2007. [BMM02] Xxxxxxx Xxxxx, Xxxx´ Xxxxxxxx, and Xxx Xxxxxxxxx. Symmetric monoidal and cartesian double categories as a semantic framework for tile logic. Mathematical Structures in Computer Science, 12(1):53–90, 2002. [BMM05] Xxxxxxx Xxxxx, Xxxxx´n X. Xxxxxxxxx, and Xxx Xxxxxxxxx. Theoretical foundations for compensations in flow composition languages. In Xxxx Xxxxxxxx and Mart´ın Abadi, edi- tors, POPL, pages 209–220. ACM, 2005. [BMM11a] Xxxxxxx Xxxxx, Xxxxx´n X. Xxxxxxxxx, and Xxx Xxxxxxxxx. A connector algebra for p/t nets interactions. In Xxxxx-Xxxxxx Xxxxxx and Xxxxxxx Xx¨nig, editors, CONCUR 2011, volume 6901 of Lecture Notes in Computer Science, pages 312–326. Springer, 2011. [BMM11b] Xxxxxxx Xxxxx, Xxxxx´n X. Xxxxxxxxx, and Xxx Xxxxxxxxx. Connector algebras, petri nets, and bip. In Xxxxxx X. Xxxxxx, Xxxxx Xxxxxxxxxxxx, and Xxxxxx Xxxxxxxx, editors, Ershov Memorial Conference 2011, volume 7162 of Lecture Notes in Computer Science, pages 19–38. Springer, 2011. [BMR97] X. Xxxxxxxxxx, X. Xxxxxxxxx, and X. Xxxxx. Semiring-based constraint solving and opti- mization. Journal of ACM, 44(2):201–236, 1997. [BMR01a] Xxxxxxx Xxxxxxxxxx, Xxx Xxxxxxxxx, and Xxxxxxxxx Xxxxx. Semiring-based contstraint logic programming: syntax and semantics. ACM Trans. Program. Lang. Syst., 23(1):1–29, 2001. [BMR01b] Xxxxxxx Xxxxx, Xxx Xxxxxxxxx, and Xxxxxxxxx Xxxxx. An interactive semantics of logic programming. XxXX, xx.LO/0107022, 2001. [BMR06] Xxxxxxx Xxxxxxxxxx, Xxx Xxxxxxxxx, and Xxxxxxxxx Xxxxx. Soft concurrent constraint pro- gramming. ACM Trans. Comput. Log., 7(3):563–589, 2006. [BMT10] Xxxxx Xxxxxx Xxxxxxx, Xxx Xxxxxxxxx, and Xxxxx Xxxxxx. Toward a game-theoretic model of grid systems. In Xxxxxx Xxxxxxx, Xxxxxx Xxxxxxx, and Xxxx Xxxxxxxxxxx, editors, TGC, volume 6084 of Lect. Notes Comput. Sci., pages 57–72. Springer, 2010. [BMT12] Xxxxx Xxxxxx Xxxxxxx, Xxx Xxxxxxxxx, and Xxxxx Xxxxxx. Analysis of grid job schedul- ing. Journal of Grid Computing, 10:501–519, 2012. [Bor09] Xxxxxxx Xxxxxxx. Weighted bisimulation in linear algebraic form. In CONCUR, volume 5710 of Lecture Notes in Comput...
Comput. Program., 55(1-3):161–183, 2005. [Hav98a] B. R. Haverkort. Performance of Computer Communication Systems: A Model-Based Approach. Xxxx Wiley & Sons, Inc., New York, NY, USA, 1998. [Hav98b] Xxxxxxxxx X. Xxxxxxxxx. Performance of Computer Communication Systems: A Model- Based Approach. Wiley, 1998.
Comput. 13(2), 631–644. [34] Xxxxxx, X. (1927) Ordinary Differential Equations, Springer, New York. [35] Xxxxxxx, X. & Xxxxxx, X. (2000) Biofilm – city of microbes (Minireview) X. Bacteriol. 182(10), 2675–2679. [36] Xxxxxxx, X., Xxxxx, X., He, M., Xxxxxxx, X. & Xxxx, X. (2009) Simultaneous nitrifica- tion/denitrification in a biofilm airlift suspension (BAS) reactor with biodegradable carrier material. Water Res. 43(18), 4461–4468. Appendix A Xxxxxxxxxx–Xxxxxx method Consider the initial value problem
