Encoding Two-Dimensional Range Top-k Queries

We consider the problem of encoding two-dimensional arrays, whose elements come from a total order, for answering $${\text{Top-}}{k}$$ Top- k queries. The aim is to obtain encodings that use space close to the information-theoretic lower bound, which can be constructed efficiently. For an $$m \times n$$ m × n array, with $$m \le n$$ m ≤ n , we first propose an encoding for answering 1-sided $${\textsf {Top}}{\text {-}}k{}$$ Top - k queries, whose query range is restricted to $$[1 \dots m][1 \dots a]$$ [ 1 ⋯ m ] [ 1 ⋯ a ] , for $$1 \le a \le n$$ 1 ≤ a ≤ n . Next, we propose an encoding for answering for the general (4-sided) $${\textsf {Top}}{\text {-}}k{}$$ Top - k queries that takes $$(m\lg {{(k+1)n \atopwithdelims ()n}}+2nm(m-1)+o(n))$$ ( m lg ( k + 1 ) n n + 2 n m ( m - 1 ) + o ( n ) ) bits, which generalizes the joint Cartesian tree of Golin et al. [TCS 2016]. Compared with trivial $$O(nm\lg {n})$$ O ( n m lg n ) -bit encoding, our encoding takes less space when $$m = o(\lg {n})$$ m = o ( lg n ) . In addition to the upper bound results for the encodings, we also give lower bounds on encodings for answering 1 and 4-sided $${\textsf {Top}}{\text {-}}k{}$$ Top - k queries, which show that our upper bound results are almost optimal.

SlimChain

Blockchain technology has emerged as the cornerstone of many decentralized applications operating among otherwise untrusted peers. However, it is well known that existing blockchain systems do not scale well. Transactions are often executed and committed sequentially in order to maintain the same view of the total order. Furthermore, it is necessary to duplicate both transaction data and their executions in every node in the blockchain network for integrity assurance. Such storage and computation requirements put significant burdens on the blockchain system, not only limiting system scalability but also undermining system security and robustness by making the network more centralized. To tackle these problems, in this paper, we propose SlimChain, a novel blockchain system that scales transactions through off-chain storage and parallel processing. Advocating a stateless design, SlimChain maintains only the short commitments of ledger states on-chain while dedicating transaction executions and data storage to off-chain nodes. To realize SlimChain, we propose new schemes for off-chain smart contract execution, on-chain transaction validation, and state commitment. We also propose optimizations to reduce network transmissions and a new sharding technique to improve system scalability further. Extensive experiments are conducted to validate the performance of the proposed SlimChain system. Compared with the existing systems, SlimChain reduces the on-chain storage requirements by 97% ~ 99%, while also improving the peak throughput by 1.4× ~ 15.6×.

Analisis Defect Produk Viro Core Collection dengan Metode Fault Tree Analysis, Analisis Faktor dan Perbandingan

PT. Polymindo Permata adalah perusahaan ekstrusi plastik yang memproduksi rotan sintetis. Salah satu produk fast moving andalannya adalah Viro Core Collection (VCC) yang menyumbang 50% dari total order. Defect produk VCC masih jauh lebih tinggi dari target 3%. Tujuan penelitian ini adalah untuk meningkatkan kualitas dan mengurangi waste dengan pendekatan sistematis menggunakan metode Fault Tree Analysis (FTA), analisis faktor dan analisis perbandingan. Hasil diagram Pareto menunjukan penyebab cacat tertinggi adalah warna belang mencapai 23.24 % dari total produk cacat. Hasil analisis FTA dan analisis faktor diketahui faktor penyebab defect warna belang disebabkan karena metode mixing material untuk mesin Co-extruder setiap Setter yang berbeda-beda, ekstrusi material IHMB menggunakan mesin Single Screw Extruder, sistem mesin Co-extruder tidak berfungsi maksimal, dan Heater tidak berfungsi maksimal. Setelah improvement diterapkan kemudian dilakukan analisis perbandingan Independent-Sample T-Test. Hasil penelitian menunjukkan bahwa metode mixing material untuk mesin Co-extruder setiap Setter yang berbeda-beda sebelum ada SOP dibanding setelah ada SOP berbeda signifikan, sehingga faktor ini adalah paling dominan untuk meningkatkan kualitas dan menurunkan defect.

Partial and total order relations on a set

PARTIAL and TOTAL ORDER relations and their underlying definitions are presented in this white paper (knowledge base).

Double Integral-Based Method for Ranking Intuitionistic Multiplicative Sets and Its Application in Selecting Logistics Transfer Station

Intuitionistic multiplicative sets can be applied in many practical situations, most of which are based on ranking of intuitionistic multiplicative numbers. This study develops an integral method for ranking intuitionistic multiplicative numbers based on the new definitions of multiplicative score function and accuracy function. The ranking method considers both the risk preference and infinitely many possible values in feasible region. Some reasonable properties of multiplicative score function and accuracy function are studied, respectively. We construct a total order relation on the set of intuitionistic multiplicative numbers. The multiplicative score function and accuracy function are utilized to select the optimal logistics transfer station. A comparison example is developed to highlight the advantage of the risk preference-based ranking method.

Assessment and Evaluation of the Production Merchandising of a Denim Pant

This study was designed to investigate the production merchandising of a denim pant. Denim pants are a significant prospect for the RMG sector in Bangladesh with a huge future. Without a doubt, pricing is the key important factor in the global competitive market. It is difficult to stay in the clothing market without spending the minimum on clothing. The research center on the whole factor which is directly involved to the FOB cost of basic denim pants where it includes textile cost, labor cost, and accessories cost, savings, charge making cost, washing and packing cost which are shown chronologically. With the aim that the total price spans can be contained as well as demonstrating the sum FOB cost. Merchandising means buying, producing, and selling any goods or products, or services for the local or international market. All activities related to the export purchase collection of any garment of a certain design for a certain quantity, production of the garment with precise attention to the garment level required for garment analysis, production of that quantity of garment required, and production timetable and exporting the samples within the fixed time frame, maybe called apparel merchandising. In production merchandising, a production merchandiser executed production-related all activities in the garments factory. In this study, basic 5 pocket denim pant (ladies) is used and the total order size was 23920pcs. The importer and Country name was Pizzaitalia-Italy.

Covering Small Subgraphs of (Hyper)Tournaments with Spanning Acyclic Subgraphs

While the edges of every tournament can be covered with two spanning acyclic subgraphs, this is not so if we set out to cover all acyclic $H$-subgraphs of a tournament with spanning acyclic subgraphs, even for very simple $H$ such as the $2$-edge directed path or the $2$-edge out-star. We prove new bounds for the minimum number of elements in such coverings and for some $H$ our bounds determine the exact order of magnitude. A $k$-tournament is an orientation of the complete $k$-graph, where each $k$-set is given a total order (so tournaments are $2$-tournaments). As opposed to tournaments, already covering the edges of a $3$-tournament with the minimum number of spanning acyclic subhypergraphs is a nontrivial problem. We prove a new lower bound for this problem which asymptotically matches the known lower bound of covering all ordered triples of a set.