The Methods to Improve Quality of Service by Accounting Secure Parameters

A solution to the problem of ensuring quality of service, providing a greater number of services with higher efficiency taking into account network security is proposed. In this paper, experiments were conducted to analyze the effect of self-similarity and attacks on the quality of service parameters. Method of buffering and control of channel capacity and calculating of routing cost method in the network, which take into account the parameters of traffic multifractality and the probability of detecting attacks in telecommunications networks were proposed. The both proposed methods accounting the given restrictions on the delay time and the number of lost packets for every type quality of service traffic. During simulation the parameters of transmitted traffic (self-similarity, intensity) and the parameters of network (current channel load, node buffer size) were changed and the maximum allowable load of network was determined. The results of analysis show that occurrence of overload when transmitting traffic over a switched channel associated with multifractal traffic characteristics and presence of attack. It was shown that proposed methods can reduce the lost data and improve the efficiency of network resources.Comment: 10 pages, 1 figure, 1 equation, 1 table. arXiv admin note: text overlap with arXiv:1904.0520

Perancangan Expert System Untuk Troubleshooting Mesin Dengan Decision Table(studi Kasus Di PT. Adi Putro Wirasejati)

PT. Adi Putro Wirasejati merupakan salah satu karoseri yang bergerak dalam bidang pembentukan body kendaraan bus dan minibus. Perusahaan memiliki kendala yaitu terhambatnya proses produksi karena beberapa kali mesin produksi tidak dapat berfungsi dan harus dilakukan kegiatan perawatan. Departemen maintenance yang memiliki 11 karyawan menangani semua mesin dalam lini produksi yang berjumlah cukup besar. Hal ini menyebabkan terjadinya beberapa kesalahan diagnosa kerusakan yang menimbulkan kesalahan dalam pengambilan keputusan, sehingga menyebabkan adanya perhentian lini produksi akibat dari bottleneck mesin yang rusak. Dalam perawatan mesin, diperlukan tenaga ahli di bidang mesin yang harus siap sedia bila terjadi masalah atau kerusakan. Akan tetapi, pakar atau orang ahli di bidang mesin tidak selalu siap sedia 24 jam sehari. Oleh karena itu dibutuhkan prototype yang dapat menyimpan pengetahuan pakar dan melakukan konsultasi perbaikan mesin. Penelitian ini menggunakan metode Expert System sebagai penalaran untuk mencari rekomendasi perbaikan, dan Decision Table sebagai tools untuk menyimpan pengetahuan kerusakan mesin yang digunakan oleh expert system dalam mencari rekomendasi perbaikan. Tahap pertama yang dilakukan adalah melihat sistem troubleshooting yang bekerja pada departemen maintenance. Dilanjutkan identifikasi permasalahan lambatnya penanganan kerusakan mesin, selanjutnya merancang desain sistem baru yaitu expert system untuk membantu mencari rekomendasi perbaikan kerusakan mesin. Setelah merancang sistem maka dibuat program expert system sesuai yang dirancang.Setelah pembuatan program maka dapat disimpulkan konsultasi pada sistem expert system, kerusakan mesin mampu mempercepat performansi kinerja departemen maintenance dalam melaksanakan perbaikan kerusakan mesin. Bila sistem lama dalam mencari rekomendasi kerusakan mesin membutuhkan waktu antara 15-45 menit bahkan lebih, pada sistem baru akan memberikan rekomendasi dalam waktu kurang lebih 5 menit dengan rekomendasi kerusakan yang tepat sehingga tidak terjadi salah pendugaan. Pengetahuan pakar sudah tersimpan dalam sistem sehingga mempermudah kapan saja berkonsultasi, sistem dapat beroperasi selama 7 hari dalam seminggu dan 365 hari dalam setahun. Selain itu, prototype expert system kerusakan mesin mampu memberikan informasi basis pengetahuan tentang kerusakan mesin juga dapat digunakan sebagai pelatihan untuk menangani kerusakan mesin

An Algorithm for the Longest Common Subsequence and Substring Problem

In this note, we first introduce a new problem called the longest common subsequence and substring problem. Let $X$ and $Y$ be two strings over an alphabet $\Sigma$. The longest common subsequence and substring problem for $X$ and $Y$ is to find the longest string which is a subsequence of $X$ and a substring of $Y$. We propose an algorithm to solve the problem

Crystal Interpretation of Kerov-Kirillov-Reshetikhin Bijection II. Proof for sl_n Case

In proving the Fermionic formulae, combinatorial bijection called the Kerov--Kirillov--Reshetikhin (KKR) bijection plays the central role. It is a bijection between the set of highest paths and the set of rigged configurations. In this paper, we give a proof of crystal theoretic reformulation of the KKR bijection. It is the main claim of Part I (math.QA/0601630) written by A. Kuniba, M. Okado, T. Takagi, Y. Yamada, and the author. The proof is given by introducing a structure of affine combinatorial $R$ matrices on rigged configurations.Comment: 45 pages, version for publication. Introduction revised, more explanations added to the main tex

Affine crystal structure on rigged configurations of type D_n^(1)

Extending the work arXiv:math/0508107, we introduce the affine crystal action on rigged configurations which is isomorphic to the Kirillov-Reshetikhin crystal B^{r,s} of type D_n^(1) for any r,s. We also introduce a representation of B^{r,s} (r not equal to n-1,n) in terms of tableaux of rectangular shape r x s, which we coin Kirillov-Reshetikhin tableaux (using a non-trivial analogue of the type A column splitting procedure) to construct a bijection between elements of a tensor product of Kirillov-Reshetikhin crystals and rigged configurations.Comment: 26 pages, 3 figures. (v3) corrections in the proof reading. (v2) 26 pages; examples added; introduction revised; final version. (v1) 24 page

An Algorithm for the Constrained Longest Common Subsequence and Substring Problem

Let $\Sigma$ be an alphabet. For two strings $X$, $Y$, and a constrained string $P$ over the alphabet $\Sigma$, the constrained longest common subsequence and substring problem for two strings $X$ and $Y$ with respect to $P$ is to find a longest string $Z$ which is a subsequence of $X$, a substring of $Y$, and has $P$ as a subsequence. In this paper, we propose an algorithm for the constrained longest common subsequence and substring problem for two strings with a constrained string.Comment: arXiv admin note: text overlap with arXiv:2308.0092