On bucket increasing trees, clustered increasing trees and increasing diamonds

In this work we analyse bucket increasing tree families. We introduce two simple stochastic growth processes, generating random bucket increasing trees of size n, complementing the earlier result of Mahmoud and Smythe (1995, Theoret. Comput. Sci.144 221–249.) for bucket recursive trees. On the combinatorial side, we define multilabelled generalisations of the tree families d-ary increasing trees and generalised plane-oriented recursive trees. Additionally, we introduce a clustering process for ordinary increasing trees and relate it to bucket increasing trees. We discuss in detail the bucket size two and present a bijection between such bucket increasing tree families and certain families of graphs called increasing diamonds, providing an explanation for phenomena observed by Bodini et al. (2016, Lect. Notes Comput. Sci.9644 207–219.). Concerning structural properties of bucket increasing trees, we analyse the tree parameter $K_n$ . It counts the initial bucket size of the node containing label n in a tree of size n and is closely related to the distribution of node types. Additionally, we analyse the parameters descendants of label j and degree of the bucket containing label j, providing distributional decompositions, complementing and extending earlier results (Kuba and Panholzer (2010), Theoret. Comput. Sci.411(34–36) 3255–3273.).

An Efficient Technique for Virtual Machine Clustering and Communications Using Task-Based Scheduling in Cloud Computing

Cloud computing models use virtual machine (VM) clusters for protecting resources from failure with backup capability. Cloud user tasks are scheduled by selecting suitable resources for executing the task in the VM cluster. Existing VM clustering processes suffer from issues like preconfiguration, downtime, complex backup process, and disaster management. VM infrastructure provides the high availability resources with dynamic and on-demand configuration. The proposed methodology supports VM clustering process to place and allocate VM based on the requesting task size with bandwidth level to enhance the efficiency and availability. The proposed clustering process is classified as preclustering and postclustering based on the migration. Task and bandwidth classification process classifies tasks with adequate bandwidth for execution in a VM cluster. The mapping of bandwidth to VM is done based on the availability of the VM in the cluster. The VM clustering process uses different performance parameters like lifetime of VM, utilization of VM, bucket size, and task execution time. The main objective of the proposed VM clustering is that it maps the task with suitable VM with bandwidth for achieving high availability and reliability. It reduces task execution and allocated time when compared to existing algorithms.

Manajemen Jaringan Internet di Dinas Kesehatan Provinsi Bali Dengan Menggunakan Hierarchical Token Bucket

Era digital 4.0 membawa perubahan dalam pemanfaatan jaringan internet. Kebutuhan akan internet tidak lagi menjadi kebutuhan sekunder melainkan menjadi kebutuhan primer. Pemanfaatan jaringan internet di Dinas Kesehatan Provinsi Bali sering kali tidak digunakan secara bijak dimana berdampak pada akses dan konektivitas menjadi terhambat dan mengganggu pelayanan kepada masyarakat. Manajemen jaringan internet juga belum dikelola dengan baik. Hierarchical Token Bucket (HTB) merupakan cara manajemen jaringan internet melalui penjadwalan paket seperti pengaturan bandwith kepada masing-masing client. Penerapan HTB mampu memaksimalkan bandwidth yang tidak terpakai, sehingga dapat meningkatkan kualitas layanan menjadi lebih baik Implementasi HTB dengan MikroTik pada Dinas Kesehatan Provinsi Bali menghasilkan pembagian bandwith secara merata berdasarkan bucket size, priority, nilai CIR dan MIR. Pembagian tersebut juga tidak mengganggu akses dan konektivitas pada tiap-tiap bagian/bidang.

Optimization of Shovel-Truck Productivity in Quarries

In open pit operations, the loading equipment drives production but the haulage fleet drives costs. Most quarries in Malawi face challenges in shovel-truck productivity due to factors which require optimization of mine operations. The case of Njuli quarry is used to come up with a model that can be applied by quarries in Malawi. Loading and haulage costs account as much as 50 – 60 % of a company’s total operation cost hence it is necessary to maintain an efficient shovel-truck system. This research optimized the shovel-truck productivity per day, applied the queuing theory to the haul cycle, and suggested ways to improve the efficiency of materials handling operations. Examining a match between truck body size and shovel bucket size yielded the size of the load, cycle time and number of trips in an hour. The cycle time depended on the weight of the equipment, the horsepower of the engine, haul distance, and condition of the road plus dump area. Quarry companies in Malawi will apply this new knowledge to improve equipment selection and maximize the tonnage of aggregates produced per day to meet production targets.

AES-GCTR Mode-based Efficient Hybrid Encryption Scheme in Cloud-CCTV Service Environment

In the environment of Cloud-CCTV surveillance, encryption of images for the protection of privacy is essential. Yet, the existing encryption method has overhead regarding the management of mass data and streaming processing. As encrypted vectors are created and applied in a bucket unit in the proposed method, it has more efficient performance in the process of encryption and decoding compared to AES-CTR mode, and it makes an analysis attack difficult according to the randomness of a bucket size. In this paper, AES-GCTR mode that has improved the existing AES-CTR operation mode was suggested. In this process, encryption of CCTV image data is required. Yet, overhead of encryption itself exists in quality, so an efficient encryption method proper for mass data is necessary. The proposed method can make encryption and decoding performance more efficient, and is expected to be easily applied to the image surveillance system based on CCTVs that demands high capacity processing and real-time streaming.

Anatomy of a crash repository

This work investigates the properties of crash reports collected from Ubuntu Linux users. Understanding crash reports is important to better store, categorize, prioritize, parse, triage, assign bugs to, and potentially synthesize them. Understanding what is in a crash report, and how the metadata and stack traces in crash reports vary will help solve, debug, and prevent the causes of crashes. 10 different aspects of 40,592 crash reports about 1,921 pieces of software submitted by users and developers to the Ubuntu project were analyzed, plotted, and statistical distributions were fitted to some of them. We investigated the structure and properties of crash reports. Crashes have many properties that seem to have distributions similar to standard statistical distributions, but with even longer tails than expected. These aspects of crash reports have not been analyzed statistically before. We found that many applications only had a single crash, while a few applications had a large number of crashes reported. Crash bucket size (clusters of similar crashes) also followed a Zipf-like distribution. The lifespan of buckets ranged from less than an hour to over four years. Some stack traces were short, and some were so long they were truncated by the tool that produced them. Many crash reports had no recursion, some contained recursion, and some displayed evidence of unbounded recursion. Linguistics literature hinted that sentence length follows a gamma distribution; this is not the case for function name length. Additionally, only two hardware architectures, and a few signals are reported for almost all of the crashes in the Ubuntu dataset. Many crashes were similar but there were also many unique crashes. This study of crashes from 1,921 projects will be valuable for anyone who wishes to: cluster or deduplicate crash reports, synthesize or simulate crash reports, store or triage crash reports, or data-mine crash reports.

Anatomy of a crash repository

This work investigates the properties of crash reports collected from Ubuntu Linux users. Understanding crash reports is important to better store, categorize, prioritize, parse, triage, assign bugs to, and potentially synthesize them. Understanding what is in a crash report, and how the metadata and stack traces in crash reports vary will help solve, debug, and prevent the causes of crashes. 10 different aspects of 40,592 crash reports about 1,921 pieces of software submitted by users and developers to the Ubuntu project were analyzed, plotted, and statistical distributions were fitted to some of them. We investigated the structure and properties of crash reports. Crashes have many properties that seem to have distributions similar to standard statistical distributions, but with even longer tails than expected. These aspects of crash reports have not been analyzed statistically before. We found that many applications only had a single crash, while a few applications had a large number of crashes reported. Crash bucket size (clusters of similar crashes) also followed a Zipf-like distribution. The lifespan of buckets ranged from less than an hour to over four years. Some stack traces were short, and some were so long they were truncated by the tool that produced them. Many crash reports had no recursion, some contained recursion, and some displayed evidence of unbounded recursion. Linguistics literature hinted that sentence length follows a gamma distribution; this is not the case for function name length. Additionally, only two hardware architectures, and a few signals are reported for almost all of the crashes in the Ubuntu dataset. Many crashes were similar but there were also many unique crashes. This study of crashes from 1,921 projects will be valuable for anyone who wishes to: cluster or deduplicate crash reports, synthesize or simulate crash reports, store or triage crash reports, or data-mine crash reports.

Kemampuan Tumbuhan Typha Angustifolia Dalam Sistem Subsurface Flow Constructed Wetland Untuk Pengolahan Limbah Cair Industri Kerupuk (Studi Kasus Limbah Cair Sentra Industri Kerupuk Desa Kenanga Kecamatan Sindang Kabupaten Indramayu Jawa Barat)

Industrial crackers centers at Kenanga Village has been able to lift the local economy,but that has been polluting the surrounding surface water contamination caused by wastewater discharged directly without any treatment in advance so that the water is black and smells foul . Therefore, the need of alternative wastewater treatment and in the study conducted by the artificial wetlands (constructed wetland) system Sub - surface Flow vertical flow with Typha angustifolia plant and use a medium sized sand 1 mm - 5 mm were previously washed first with media thickness of 30 cm and then operated intermittently using a peristaltic pump 6 times a day with the design of constructed wetlands construction made of wood coated with plastic and reactor dimensions 90 cm x 45 cm x 50 cm . As for the control (no treatment) using use the bucket size diameter 40 cm and height of 20 cm. This study aims to determine the ability of Subsurface Flow Constructed Wetland with Typha angustifolia plants in lowering the concentration of TSS , BOD5 , COD , ammonia (NH3 – N) and sulfide (H2S) at 5,10 and 15 days of processing . The results showed a decrease in the concentration efficiency at consecutive time 5 , 10 and 15 days in Subsurface Flow Constructed wetland with Typha angustifolia for TSS 73,78%; 77,18%; 84,71%; BOD5 85,83%; 90,33%; 94,17%; COD 86,94%; 90,65%; 94,87%; Ammonia 76,07%; 84,25%; 87,52%; sulfide 94,56%; 99,18%; 99,81 %.