Miracle-dz/UniFAR-FTUs huggingface dataset:
Pengawasan dan Kontrol Komunikasi Melalui Aplikasi Telegram Security and Safety (SAS) di PT. Telkom Witel

Perkembangan teknologi informasi dan komunikasi saat ini sangat berkembang pesat. Komunikasi yang tadinya membutuhkan waktu yang cukup lama untuk sampai kepada penerima pesan namun setelah adanya internet segalanya dapat diakses dengan mudah dan cepat. Salah satu hal yang dimudahkan dengan adanya internet dan aplikasi adalah komunikasi dalam suatu kantor atau organisasi. Telegram adalah salah satu aplikasi yang memiliki banyak kelebihan terutama jika digunakan sebagai media komunikasi untuk mengontrol dan mangawasi kegiatan karyawan. Penelitian ini bertujuan untuk menganalisis pengawasan dan kontrol komunikasi melalui aplikasi telegram Security and Safety (SAS) di PT. Telkom Witel Makassar. Metode pengumpulan data yang digunakan adalah observasi, wawancara dan dokumentasi. Hasil penelitian menunjukkan bahwa PT. Telkom Witel Makassar memberikan tugas kepada unit Security and Safate untuk melakukan pegawasan dan kontrol kepada Security. SAS sebagai pihak pertama dalam melaksanakan pengawasan dan kontrol terhadap tugas-tugas pengamanan yang dilakukan anggota serta kegiatan pelaksanaan pengamanan secara umum. Seperti kondisi yang menunjukan seluruh asset barang maupun personel perusahaan terbebas dari adanya gangguan, ancaman dan bentuk kerusakan lainnya yang merugikan pihak PT. Telkom Witel Makassar. Pengawasan dan kontrol terdapat Security melalui Aplikasi Telegram merupakan komunikasi berupa dialog singkat, padat dan jelas.
Mean Field Models of Message Throughput in Dynamic Peer-to-Peer Systems

The churn rate of a peer-to-peer system places direct limitations on the rate at which messages can be effectively communicated to a group of peers. These limitations are independent of the topology and message transmission latency. In this paper we consider a peer-to-peer network, based on the Engset model, where peers arrive and depart independently at random. We show how the arrival and departure rates directly limit the capacity for message streams to be broadcast to all other peers, by deriving mean field models that accurately describe the system behavior. Our models cover the unit and more general k buffer cases, i.e. where a peer can buffer at most k messages at any one time, and we give results for both single and multi-source message streams. We define coverage rate as peer-messages per unit time, i.e. the rate at which a number of peers receive messages, and show that the coverage rate is limited by the churn rate and buffer size. Our theory introduces an Instantaneous Message Exchange (IME) model and provides a template for further analysis of more complicated systems. Using the IME model, and assuming random processes, we have obtained very accurate equations of the system dynamics in a variety of interesting cases, that allow us to tune a peer-to-peer system. It remains to be seen if we can maintain this accuracy for general processes and when applying a non-instantaneous model.
Pengaruh Kualitas Produk, Brand Image, dan Harga Terhadap Keputusan Pembelian Konsumen (Studi pada Pelanggan Warung Sop Bang Rio Cabang Demang Lebar Daun – Palembang)

Penelitian ini bertujuan untuk mengetahui pengaruh kualitas produk, brand image, dan harga terhadap keputusan pembelian. Populasi dalam penelitian ini adalah semua konsumen Warung Sop Bang Rio Cabang Demang Lebar Daun. Metode sampling yang diterapkan pada penelitian ini adalah metode accidental sampling, konsumen yang memenuhi kriteria untuk menjadi sampel adalah 96 orang responden. Variabel yang digunakan yaitu sebanyak 4 variabel. Teknik analisis yang digunakan adalah analisis regresi linear berganda. Berdasarkan hasil penelitian dapat dilihat dari hasil persamaan regresi linier berganda Y = 11,745 + 0,199 X1 + 0,223 X2 + 0,869 X3 + e. Hal ini menunjukkan bahwa Kualitas Produk, Brand Image, dan Harga secara simultan dapat meningkatkan Keputusan Pembelian Konsumen Warung Sop Bang Rio Cabang Demang Lebar Daun. Dengan kata lain bahwa pengaruh Kualitas Produk, Brand Image, dan Harga memberikan dampak positif yang signifikan terhadap keputusan pembelian. Hal ini terbukti dari hasil analisis statistik yang dilakukan oleh peneliti menunjukkan hasil R Square (R2 ) sebesar 0,667 angka tersebut menggambarkan bahwa presentase sumbangan pengaruh variabel independen terhadap variabel dependen sebesar 66,7% sedangkan sisanya yaitu 33,7% dipengaruhi variabel lain yang tidak diteliti dalam penelitian ini, seperti kualitas pelayanan, sikap merek, harga produk, promosi, dan sebagainya. Hasil uji Hipotesis secara parsial menunjukkan bahwa Kualitas Produk berpengaruh positif dan signifikan terhadap Keputusan Pembelian Konsumen dengan nilai tsig = 0,017 < 0,05. Brand Image secara parsial berpengaruh positif dan signifikan terhadap Keputusan Pembelian Konsumen dengan nilai tsig = 0,029 < 0,05. Harga memiliki pengaruh secara parsial yang positif dan signifikan terhadap Keputusan Pembelian Konsumen dengan nilaii tsig = 0,000 < 0,05. Hasil uji Hipotesis secara simultan menunjukkan bahwa variabel Kualitas Produk, Brand Image, dan Harga secara bersama-sama mempengaruhi Keputusan Pembelian Konsumen Warung Sop Bang Rio. Hal ini ditunjukkan dengan nilai signifikansi F (0,000) < 0,05.
Characterization of CTX‐M‐type extended‐spectrum beta‐lactamase in clinical clones of Escherichia coli in Southwest China

The rapid and widespread dissemination of CTX‐M‐type extended‐spectrum beta‐lactamases (ESBLs) Escherichia coli in most of the provinces in China has been previously characterized; however, these enzymes have been rarely reported among minority regions. A prospective study using 180 E. coli clones from three hospitals in the minority district of Dali Bai was conducted between January 2009 and June 2010 to characterize the profiles of blaCTX‐M‐producing E. coli. Overall, 87 of the isolates (48.3%) encoded the resistance phenotypes of ESBLs. Among these 87 isolates, 56 (64.4%) exconjugants were successfully obtained. The genotypes of blaCTX‐M were evaluated by PCR and DNA sequencing. In total, 22 and 53 E. coli isolates possessed CTX‐M cluster 1 and CTX‐M cluster 9, respectively. Five blaCTX‐M subtypes were detected, namely, blaCTX‐M3 (n = 12), blaCTX‐M15 (n = 4), blaCTX‐M22 (n = 2), blaCTX‐M14 (n = 41), and blaCTX‐M9 (n = 8). The broth microdilution method was performed to determine the minimal inhibitory concentration of 13 antibiotics. Most CTX‐M producers were multiply resistant to both β‐lactam and non‐β‐lactam antibiotics. Imipenem showed excellent activity, and only one isolate harboring blaCTX‐M14+CTX‐M3 exhibited resistance to it. In conclusion, there seems to be great concern regarding the distribution and drug resistance of CTX‐M ESBL‐producing E. coli.
Characterizing feedback signal drop patterns in formal verification of networked control systems

In order to obtain resource efficient implementations of control loops on embedded platforms, recently there has been a renewed interest in studying stability and various other quality-of-control (QoC) metrics in the presence of control message drops. Towards this, different methods have been proposed to quantify the impact of message drops on stability and control performance. In this paper we will survey these techniques and clarify the relationship between them. Given a drop pattern that satisfies stability and specified QoC constraints, it is important to check whether an implementation platform satisfies this pattern. In other words, whether the control loop in question may be implemented on this platform. Given an architecture, we will also show how certain notions of expressing drop patterns are easier to verify compared to others.
Loading databases using dataflow parallelism

This paper describes a parallel database load prototype for Digital's Rdb database product. The prototype takes a dataflow approach to database parallelism. It includes an explorer that discovers and records the cluster configuration in a database, a client CUI interface that gathers the load job description from the user and from the Rdb catalogs, and an optimizer that picks the best parallel execution plan and records it in a web data structure. The web describes the data operators, the dataflow rivers among them, the binding of operators to processes, processes to processors, and files to discs and tapes. This paper describes the optimizer's cost-based hierarchical optimization strategy in some detail. The prototype executes the web's plan by spawning a web manager process at each node of the cluster. The managers create the local executor processes, and orchestrate startup, phasing, checkpoint, and shutdown. The execution processes perform one or more operators. Data flows among the operators are via memory-to-memory streams within a node, and via web-manager multiplexed tcp/ip streams among nodes. The design of the transaction and checkpoint/restart mechanisms are also described. Preliminary measurements indicate that this design will give excellent scaleups.
Expanded GDoF-optimality Regime of Treating Interference as Noise in the $M\times 2$ X-Channel

Treating interference as noise (TIN) as the most appropriate approach in dealing with interference and the conditions on its optimality has attracted the interest of researchers recently. However, our knowledge on necessary and sufficient conditions of TIN is restricted to a few setups with limited number of users. In this paper, we study the optimality of TIN in terms of the generalized degrees of freedom (GDoF) for a fundamental network, namely, the <inline-formula> <tex-math notation="LaTeX">$M\times 2$ </tex-math></inline-formula> X-channel. To this end, the achievable GDoF of TIN with power allocations at the transmitters is studied. It turns out that the transmit power allocation maximizing the achievable GDOF is given by on–off signaling as long as the receivers use TIN. This leads to two variants of TIN, namely, P2P-TIN and 2-IC-TIN. While in the first variant the <inline-formula> <tex-math notation="LaTeX">$M\times 2$ </tex-math></inline-formula> X-channel is reduced to a point-to-point (P2P) channel, in the second variant, the setup is reduced to a two-user interference channel in which the receivers use TIN. The optimality of these two variants is studied separately. To this end, novel genie-aided upper bounds on the capacity of the X-channel are established. The conditions on the optimality of P2P-TIN can be summarized as follows. P2P-TIN is GDoF-optimal if there exists a dominant multiple access channel or a dominant broadcast channel embedded in the X channel. Furthermore, the necessary and sufficient conditions on the GDoF-optimality of 2-IC-TIN are presented. Interestingly, it turns out that operating the <inline-formula> <tex-math notation="LaTeX">$M\times 2$ </tex-math></inline-formula> X-channel in the 2-IC-TIN mode might be still GDOF optimal, although the conditions given by Geng <italic>et al.</italic> are violated. However, 2-IC-TIN is sub-optimal if there exists a single interferer which causes sufficiently strong interference at both receivers. The comparison of the results with the state of the art shows that the GDOF optimality of TIN is expanded significantldy.
Efficient FPGA-Based Multipliers for F397 and F36.97

In this work, we present a new structure for multiplication in finite fields. This structure is based on a digit-level LFSR (Linear Feedback Shift Register) multiplier, in which the area of the digit-multipliers is reduced using the Karatsuba method. We compare our results with the other works of the literature for F397. Furthermore, we propose new formulas for multiplication in F36 97. These new formulas reduce the number of F397-multiplications from 18 to 15. The finite fields F397 and F36 97 are important fields for pairing based cryptography.
Peer-to-Peer Communication Across Network Address Translators

Network Address Translation (NAT) causes well-known difficulties for peer-to-peer (P2P) communication, since the peers involved may not be reachable at any globally valid IP address. Several NAT traversal techniques are known, but their documentation is slim, and data about their robustness or relative merits is slimmer. This paper documents and analyzes one of the simplest but most robust and practical NAT traversal techniques, commonly known as hole punching. Hole punching is moderately well-understood for UDP communication, but we show how it can be reliably used to set up peer-to-peer TCP streams as well. After gathering data on the reliability of this technique on a wide variety of deployed NATs, we nd that about 82% of the NATs tested support hole punching for UDP, and about 64% support hole punching for TCP streams. As NAT vendors become increasingly conscious of the needs of important P2P applications such as Voice over IP and online gaming protocols, support for hole punching is likely to increase in the future.
k-core (bootstrap) percolation on complex networks: Critical phenomena and nonlocal effects

We develop the theory of the -core (bootstrap) percolation on uncorrelated random networks with arbitrary degree distributions. We show that the -core percolation is an unusual, hybrid phase transition with a jump emergence of the k-core as at a first order phase transition but also with a critical singularity as at a continuous transition. We describe the properties of the -core, explain the meaning of the order parameter for the k-core percolation, and reveal the origin of the specific critical phenomena. We demonstrate that a so-called "corona" of the k-core plays a crucial role (corona is a subset of vertices in the k-core which have exactly neighbors in the -core). It turns out that the k-core percolation threshold is at the same time the percolation threshold of finite corona clusters. The mean separation of vertices in corona clusters plays the role of the correlation length and diverges at the critical point. We show that a random removal of even one vertex from the k-core may result in the collapse of a vast region of the k-core around the removed vertex. The mean size of this region diverges at the critical point. We find an exact mapping of the k-core percolation to a model of cooperative relaxation. This model undergoes critical relaxation with a divergent rate at some critical moment.
Probabilistic Anonymity and Admissible Schedulers

When studying safety properties of (formal) protocol models, it is customary to view the scheduler as an adversary: an entity trying to falsify the safety property. We show that in the context of security protocols, and in particular of anonymizing protocols, this gives the adversary too much power; for instance, the contents of encrypted messages and internal computations by the parties should be considered invisible to the adversary. We restrict the class of schedulers to a class of admissible schedulers which better model adversarial behaviour. These admissible schedulers base their decision solely on the past behaviour of the system that is visible to the adversary. Using this, we propose a definition of anonymity: for all admissible schedulers the identity of the users and the observations of the adversary are independent stochastic variables. We also develop a proof technique for typical cases that can be used to proof anonymity: a system is anonymous if it is possible to `exchange' the behaviour of two users without the adversary `noticing'.
Cluster Variation Method in Statistical Physics and Probabilistic Graphical Models

The cluster variation method (CVM) is a hierarchy of approximate variational techniques for discrete (Ising-like) models in equilibrium statistical mechanics, improving on the mean-field approximation and the Bethe–Peierls approximation, which can be regarded as the lowest level of the CVM. In recent years it has been applied both in statistical physics and to inference and optimization problems formulated in terms of probabilistic graphical models. The foundations of the CVM are briefly reviewed, and the relations with similar techniques are discussed. The main properties of the method are considered, with emphasis on its exactness for particular models and on its asymptotic properties. The problem of the minimization of the variational free energy, which arises in the CVM, is also addressed, and recent results about both provably convergent and message-passing algorithms are discussed.
Performance versus Complexity Per Iteration for Low-Density Parity-Check Codes: An Information-Theoretic Approach

The paper is focused on the tradeoff between performance and decoding complexity per iteration for LDPC codes in terms of their gap (in rate) to capacity. The study of this tradeoff is done via information-theoretic bounds which also enable to get an indication on the sub-optimality of message-passing iterative decoding algorithms (as compared to optimal ML decoding). The bounds are generalized for parallel channels, and are applied to ensembles of punctured LDPC codes where both intentional and random puncturing are addressed. This work suggests an improvement in the tightness of some information-theoretic bounds which were previously derived by Burshtein et al. and by Sason and Urbanke.
Challenges and Opportunities of Evolutionary Robotics

Robotic hardware designs are becoming more complex as the variety and number of on-board sensors increase and as greater computational power is provided in ever-smaller packages on-board robots. These advances in hardware, however, do not automatically translate into better software for controlling complex robots. Evolutionary techniques hold the potential to solve many difficult problems in robotics which defy simple conventional approaches, but present many challenges as well. Numerous disciplines including artificial life, cognitive science and neural networks, rule-based systems, behavior-based control, genetic algorithms and other forms of evolutionary computation have contributed to shaping the current state of evolutionary robotics. This paper provides an overview of developments in the emerging field of evolutionary robotics, and discusses some of the opportunities and challenges which currently face practitioners in the field.
Immunosuppressive Treatment for Lupus Nephritis: Long-Term Results in 178 Patients

Lupus nephritis is one of the most severe Systemic Lupus Erythematosus features, defining treatment modality and prognosis. Our retrospective study, including 178 patients treated for lupus nephritis during 23 years with mostly cyclophosphamide-based initial regimens followed by azathioprine or mycophenolic acid, demonstrates 84.8% of renal response with 19.2% of flares, 15-year patient survival 78.7% and kidney survival 76.3%, and low damage accrual. Both patient and kidney survival significantly differ for subgroups that achieved complete or partial renal response and nonresponders: patient 15-year survival 95% versus 65% versus 35%; kidney 15-year survival 100% versus 58% versus 0%, respectively. 51% (24 out of 47) of patients evaluated at the end of the study period sustained complete renal response; however, only 9 of them had 0 disease activity according to SELENA SLEDAI scale, while 13 patients had scores 2–4 due to the serological abnormalities only. We conclude that (1) initial treatment with cyclophosphamide followed by azathioprine is effective and can be used in agreement with International Guidelines until the evidence for biological treatments benefits becomes available; (2) complete and even partial renal response have positive prognostic value, and failure to achieve renal response negatively influences kidney and patient survival; (3) the validity of complete renal response in SLE is questioned by the absence of conventional definition of SLE remission.
Some Linear-Time Algorithms for Systolic Arrays

We survey some results on linear-time algorithms for systolic arrays. In particular, we show how the greatest common divisor (GCD) of two polynomials of degree n over a finite field can be computed in time O(n) on a linear systolic array of O(n) cells; similarly for the GCD of two n-bit binary numbers. We show how n * n Toeplitz systems of linear equations can be solved in time O(n) on a linear array of O(n) cells, each of which has constant memory size (independent of n). Finally, we outline how a two-dimensional square array of O(n)* O(n) cells can be used to solve (to working accuracy) the eigenvalue problem for a symmetric real n* n matrix in time O(nS(n)). Here S(n) is a slowly growing function of n; for practical purposes S(n) can be regarded as a constant. In addition to their theoretical interest, these results have potential applications in the areas of error-correcting codes, symbolic and algebraic computations, signal processing and image processing.
Gathering Statistics to Aspectually Classify Sentences with a Genetic Algorithm

This paper presents a method for large corpus analysis to semantically classify an entire clause. In particular, we use cooccurrence statistics among similar clauses to determine the aspectual class of an input clause. The process examines linguistic features of clauses that are relevant to aspectual classification. A genetic algorithm determines what combinations of linguistic features to use for this task.
A secure traitor tracing scheme against key exposure

Copyright protection is a major issue in distributing digital content. On the other hand, improvements to usability are sought by content users. In this paper, we propose a secure traitor tracing scheme against key exposure (TTaKE) which contains the properties of both a traitor tracing scheme and a forward secure public key cryptosystem. Its structure fits current digital broadcasting systems and it may be useful in preventing traitors from making illegal decoders and in minimizing the damage from accidental key exposure. It can improve usability through these properties
A Machine Learning Approach to the Classification of Dialogue Utterances

The purpose of this paper is to present a method for automatic classification of dialogue utterances and the results of applying that method to a corpus. Superficial features of a set of training utterances (which we will call cues) are taken as the basis for finding relevant utterance classes and for extracting rules for assigning these classes to new utterances. Each cue is assumed to partially contribute to the communicative function of an utterance. Instead of relying on subjective judgments for the tasks of finding classes and rules, we opt for using machine learning techniques to guarantee objectivity.
Joint Source-Channel Coding Revisited: Information-Spectrum Approach

Given a general source with countably infinite source alphabet and a general channel with arbitrary abstract channel input/channel output alphabets, we study the joint source-channel coding problem from the information-spectrum point of view. First, we generalize Feinstein's lemma (direct part) and Verdu-Han's lemma (converse part) so as to be applicable to the general joint source-channel coding problem. Based on these lemmas, we establish a sufficient condition as well as a necessary condition for the source to be reliably transmissible over the channel with asymptotically vanishing probability of error. It is shown that our sufficient condition is equivalent to the sufficient condition derived by Vembu, Verdu and Steinberg, whereas our necessary condition is shown to be stronger than or equivalent to the necessary condition derived by them. It turns out, as a direct consequence, that separation principle in a relevantly generalized sense holds for a wide class of sources and channels, as was shown in a quite dfifferent manner by Vembu, Verdu and Steinberg. It should also be remarked that a nice duality is found between our necessary and sufficient conditions, whereas we cannot fully enjoy such a duality between the necessary condition and the sufficient condition by Vembu, Verdu and Steinberg. In addition, we demonstrate a sufficient condition as well as a necessary condition for the epsilon-transmissibility. Finally, the separation theorem of the traditional standard form is shown to hold for the class of sources and channels that satisfy the semi-strong converse property.