Type Of Partition Research Articles

Unpacking Province Creation in The Philippines

To enhance service delivery and local democracy, legislators have tinkered with size or status of local governments in the Philippines. This elasticity in local borders has been more evident at the province level, the highest local government tier. Since 1987, a new province is birthed roughly every three years. As the determinants and mechanisms of contemporary province fragmentation are under-examined, this article investigates, at several policymaking levels and dimensions, attempts to redraw borders of Philippine provinces. Framed by an institutional framework and a case-study approach, and employing a veto-player analysis, heuristic cases of two provinces (Quezon and Zamboanga del Sur) were unpacked and compared. Findings reveal that there is a large and fragmented veto-player group in the area of territorial rescaling of provinces. Congruence of preferences among veto players was observed to be influenced by territorial leveraging, pivot on networks and reciprocity norm, and mirroring of preferences. The tenacity and strategic actions of reform agent or policy entrepreneur (usually the congressman), sometimes assisted by social movement, is likewise found crucial in the pathways leading to reform outcomes. In a simple cross-case analysis of recent reform attempts, findings also suggest that the provinces’ core-periphery location pattern, and proposed type of spatio-jurisdictional partition are associated with reform outcomes.

Low-complexity enhancement VVC encoder for vehicular networks

In intelligent transportation systems, real-time video streaming via vehicle networks has been seen as a vital difficulty. The goal of this paper is to decrease the computational complexity of the versatile video coding (VVC) encoder for VANETs. In this paper, a low-complexity enhancement VVC encoder is designed for vehicular communication. First, a fast coding unit (CU) partitioning scheme based on CU texture features is proposed in VVC, which aims to decide the final type of CU partition by calculating CU texture complexity and gray-level co-occurrence matrix (GLCM). Second, to reduce the number of candidate prediction mode types in advance, a fast chroma intra-prediction mode optimization technique based on CU texture complexity aims to combine intra-prediction mode features. Moreover, the simulation outcomes demonstrate that the overall approach may substantially reduce encoding time, while the loss of coding efficiency is reasonably low. The encoding time can be reduced by up to 53.29% when compared to the VVC reference model, although the average BD rate is only raised by 1.26%. The suggested VVC encoder is also hardware-friendly and has a minimal level of complexity for video encoders used in connected vehicle applications.

A new possible route of airborne transmission caused by the use of a physical partition

This study experimentally examines the effect of a physical partition on the risk of short-distance cross-infection in a densely occupied canteen. A human subject was employed to simulate an infected person and three thermal manikins were used to simulate the exposed persons, who sat around the same dining table. Four influential factors were examined, including the height and the type of physical partition (i.e., cross-partition and linear-partition), and the head posture and the activity (i.e., dining or not) of the infected person. The CO2 exhaled by the subject was used to simulate the exhaled air. The ratio of the CO2 concentration at the monitoring points to the background CO2 concentration in the canteen was defined as the exposure index. A partition that is not lower than the breathing level of the infected person by 3–5 cm can effectively block the horizontal development of the expiratory jet. Compared with no partition, the use of cross-partition and linear-partition results in an increase of the exposure index in the source compartment (i.e., the area facing the subject) by 97.2% and 25.5%, respectively. It takes, on average, 11 min for the CO2 concentration in the source compartment to decay back to the background concentration, after the subject completes dining and leaves the seat. This implies that a latter diner is possibly exposed to the high concentration of the expiratory air released by the former diner, presenting a new possible transmission route. The findings obtained in this study should contribute to an improved design and application of physical partitions.

Unlimited parity alternating partitions

We introduce a new type of partition that consists of partitions whose different parts alternate in parity (e.g., 3 + 2 + 2 + 1 + 1). Various properties of this partition function are studied. In particular, we obtain its asymptotic behavior by employing Ingham’s Tauberian theorem.

Gene Action and Combining Ability for Seed Yield and its Components in Eight Sesame Genotyps Diallel Crosses

In order to study the combining ability, type of gene action and partition the components of the genetic variance to its constituents of additive and dominance gene effects using half diallel cross for eight genotypes to produce twenty eight sesame crosses. Two field experiments were carried out during two summer growing seasons 2016 and 2017 at Arab El-Awammer Research Station, Assuit, Agricultural Research Center. Results showed that mean squares due to both general (GCA) and specific (SCA) combining ability were highly significant for all characters, indicating the importance of both additive and non-additive gene effects in the inheritance of studied traits. The ratio of GCA/SCA indicated that the largest part of the total genetic variability due to the additive and additive x additive was very important than the non-additive gene effects in the genetic variability for all studied traits. Estimates of GCA for eight parents revealed that P8 was good combiner for plant height, length of fruiting zone, seed yield/plot and number of days to 50% flowering, while P1, P2 was good combiner for number of capsules/plant, seed yield/plant and 1000-seed weight. Significant SCA effects were observed for some crosses, cross (P1xP5), (P1xP7) and (P2xP3) were the best ones for seed yield/plant. Additive D and dominance (H1 and H2) genetic variation were significant for plant height and seed yield/plot. The D parameter estimating the additive effect was highly significant and was larger in magnitude than the dominance parameters (H1 and H2) in the all studied traits indicating that the type of gene action is partial dominance. The positive and negative alleles were unequally distributed among the parents. All studied traits had a high values for the broad sense than the narrow sense heritability. Graphical analysis revealed that the regression lines cuts Wr axis above origin point, indicating partial dominance for all the studied characters.

ГИДРОДИНАМИКА И СТРУКТУРА ПОТОКА В ЩЕЛЕВОЙ ФИЛЬТРУЮЩЕЙ ПЕРЕГОРОДКЕ

The purpose is to study the influence of the structural characteristics of the slit filter partition on the hydrodynamics and structure of the gas flow in the channels of the partition, which is necessary to develop a method for calculating the hydraulic resistance and creating the most energy-efficient conditions of the slit filter. To study the flow structure in the slit channels, a mathematical description of the flow in the channel model for the corridor and staggered slit partitions is developed, which allows to determine the local flow rate at any point of the channel of the filtering partition, to construct velocity profiles in any cross-section of the channel depending on the type of the slit partition. The modeling of velocity profiles in the channels of the corridor and staggered structure of slit partitions for different wire diameters and the number of its layers, depending on the filtration rate, is performed. It was found that for slit filter walls with a wire diameter from 0.5 to 1.4 mm, the number of layers from 2 to 7 at a filtration rate within 0.05-0.2 m/s during the flow occurs in laminar mode, and the flow around the wire turns during the transition mode. It is established that the stabilization of the velocity distribution over the cross section of the channel in the slit partition occurs after the fourth layer of turns. The mathematical dependence for the calculation of the hydraulic resistance of the slit filter partition taking into account its structural characteristics and the hydrodynamic regime of the gas flow is proposed.

A Visual Distance Approach for Multicamera Deployment With Coverage Optimization

This paper proposes a visual distance approach for a multicamera deployment through parallel coverage optimization over three-dimensional (3-D) space to inspect 3-D objects. The key idea is the proposal of a new “visual distance” between a single camera and a scene point, which takes into account multiple coverage criteria. Specifically, the effective visual sensing area of a single camera is expressed by a 4-D geometric object, which is composed of a 3-D visual frustum and an extra dimension for the acceptable view angle. An anisotropic projective transformation is applied to transform this 4-D geometric object into a 4-D unit cube, based on which a new visual coverage measure called “visual distance” is proposed using the infinity norm. It is shown that this new measure is capable of characterizing the coverage level of a task point in a quantitative way. Based on the visual distance, a coverage strength model and a new type of scene partition, called visual Voronoi partition, are established, and then a parallel gradient optimization approach is developed to achieve optimal coverage performance of a multicamera network. Comparative simulation and experimental results are provided to show the effectiveness and superior performance of the proposed approach.

Natural materials in housing construction in view of the current requirements of technical conditions - the content of Primary Energy Input

The article presents the reasons for using natural materials in former and contemporary housing construction. The possibilities of shaping contemporary housing architecture with the use of natural (unprocessed or low-processed) building materials in the light of the requirements of the Technical Conditions that should be met by buildings are discussed. The article discusses the results of calculating the U-value for different types of building partitions and the influence of the construction of the partition on the EU index and the cumulative value of Primary Energy Input in a given type of partition.

Toward a Practical Regularity-based Model

Most Hierarchical Real-time Scheduling (HiRTS) techniques have focused on temporal resource partitions in which time units are periodically distributed. Although such periodic partitions could provide great flexibility for the resource-level scheduling, engineers face significant obstacles when trying to determine the schedulability of real-time tasks running on them. The main reason is that periodic partitions fail to effectively bound the difference between the ideal and the actual resource allocation. To solve this problem, some researchers introduced the Regular Partition, a type of temporal resource partition that is almost evenly distributed. Recent research has shown that it achieves maximal transparency for task scheduling—some classical real-time scheduling problems on a regular partition can be easily transformed into equivalent problems on a dedicated single resource. However, the resource partitioning problem for regular partitions is much more complicated than the one for periodic partitions. Based on a practical two-layer HiRTS platform, this article introduces MulZ (Multiple Z-seqences), which is the first to solve this problem with a partitioned scheduling strategy. By using a more complicated approximation methodology, our experimental results show that MulZ outperforms the current best global scheduling algorithm on this problem. After that, it compares the overall performance of the periodic partition and the regular partition. We conclude that the regular partition is a better choice for the integration of real-time applications.

Partitioning Surfaces Into Quadrilateral Patches: A Survey

AbstractThe efficient and practical representation and processing of geometrically or topologically complex shapes often demands a partitioning into simpler patches. Possibilities range from unstructured arrangements of arbitrarily shaped patches on the one end, to highly structured conforming networks of all‐quadrilateral patches on the other end of the spectrum. Due to its regularity, this latter extreme of conforming partitions with quadrilateral patches, called quad layouts, is most beneficial in many application scenarios, for instance enabling the use of tensor‐product representations based on splines or Bézier patches, grid‐based multi‐resolution techniques and discrete pixel‐based map representations. However, this type of partition is also most complicated to create due to the strict inherent structural restrictions. Traditionally often performed manually in a tedious and demanding process, research in computer graphics and geometry processing has led to a number of computer‐assisted, semi‐automatic, as well as fully automatic approaches to address this problem more efficiently. This survey provides a detailed discussion of this range of methods, treats their strengths and weaknesses and outlines open problems in this field of research.

Partitioning the vertex set of $G$ to make $G\,\Box\, H$ an efficient open domination graph

A graph is an efficient open domination graph if there exists a subset of vertices whose open neighborhoods partition its vertex set. We characterize those graphs $G$ for which the Cartesian product $G \Box H$ is an efficient open domination graph when $H$ is a complete graph of order at least 3 or a complete bipartite graph. The characterization is based on the existence of a certain type of weak partition of $V(G)$. For the class of trees when $H$ is complete of order at least 3, the characterization is constructive. In addition, a special type of efficient open domination graph is characterized among Cartesian products $G \Box H$ when $H$ is a 5-cycle or a 4-cycle.

Transparent Real-Time Task Scheduling on Temporal Resource Partitions

The Hierarchical Real-Time Scheduling (HiRTS) technique helps improve overall resource utilization in real-time embedded systems. With HiRTS, a computation resource is divided into a group of temporal resource partitions, each of which accommodates multiple real-time tasks. Besides the computation resource partitioning problem, real-time task scheduling on resource partitions is also a major problem of HiRTS. The existing scheduling techniques for dedicated resources, like schedulability tests and utilization bounds, are unable to work without changes on temporal resource partitions in most cases. In this paper, we show how to achieve maximal transparency for task scheduling on Regular Partitions, a type of resource partition introduced by the Regularity-based Resource Partition (RRP) Model. We show that several classes of real-time scheduling problems on a regular partition can be transformed into equivalent problems on a dedicated single resource, such that comprehensive single-resource scheduling techniques provide optimal solutions. Furthermore, this transformation method could be applied to different types of real-time tasks such as periodic tasks, sporadic tasks and aperiodic tasks.

Ranks of permutative matrices

Abstract A new type of matrix, termed permutative, is defined and motivated herein. The focus is upon identifying circumstances under which square permutative matrices are rank deficient. Two distinct ways, along with variants upon them are given. These are a special kind of grouping of rows and a type of partition in which the blocks are again permutative. Other, results are given, along with some questions and conjectures.

Robustness analysis of arbitrarily distributed data-based recommendation methods

Due to different shopping routines of people, rating preferences of many customers might be partitioned between two parties. Since two different e-companies might sell products from the same range to the identical set of customers, the type of data partition is called arbitrarily. In the case of arbitrarily distributed data, it is a challenge to produce accurate recommendations for those customers, because their ratings are split. Therefore, researchers propose methods for enabling data holders’ collaboration. In this scenario, privacy becomes a deterrent barrier for collaboration, accordingly, the introduced solutions include private protocols for protecting parties’ confidentiality. Although, private protocols encourage data owners to collaborate, they introduce a new drawback for partnership. Since, whole data is distributed and parties do not have full control of data, any malicious user, who knows that two parties collaborate, can easily insert shilling profiles to system by partitioning them between data holders. Parties can have trouble to find such profile injection attacks by employing existing detection methods because of they are arbitrarily distributed. Since profile injection attacks can easily performed on arbitrarily distributed data-based recommender systems, quality, and reliability of such systems decreases, and it causes angry customers. Therefore, in this paper, we try to describe aforementioned problems with arbitrarily distributed data-based recommender systems. As a first step, we analyze robustness of proposed arbitrarily distributed data-based recommendation methods against six well-known shilling attack types. Secondly, we explain why existing detection methods cannot detect malicious user profiles in distributed data. We perform experiments on a well-known movie data set, and according to our results, arbitrarily distributed data-based recommendation methods are vulnerable to shilling attacks.

Numerical algorithm for the determinant evaluation of cyclic pentadiagonal matrices with Toeplitz structure

Very recently, an efficient computational algorithm (DETQPT algorithm) for the determinant evaluation of general cyclic pentadiagonal Toeplitz matrices has been proposed by Y.L. Jiang and J.T. Jia (J. Math. Chem. 51: 2503-2513, 2013). In this paper, an explicit formula for the determinant of a cyclic pentadiagonal Toeplitz matrix is derived at first. Then, we present a more efficient numerical algorithm with the cost of 7n+O(logn)$7n+O(\log \ n)$ for evaluating n-th order cyclic pentadiagonal Toeplitz determinants. The algorithm is based on the use of a certain type of matrix reordering and matrix partition, and equalities involving the products of special kind of relevant matrices. Three numerical examples demonstrate the performance and effectiveness of the proposed algorithm and its competitiveness with other already existing algorithms.

Square-type-first inter-CU tree search algorithm for acceleration of HEVC encoder

In this paper, a fast inter-coding algorithm is proposed to reduce the computational load of HEVC encoders. The HEVC reference model (HM) employs the recursive depth-first-search (DFS) of the quad-tree search in terms of rate-distortion optimization in selecting the best coding modes for the best CU, PU, TU partitions, and many associated coding modes. The proposed algorithm evaluates the RD costs of the current CU only for its square-type PUs in the top-down search of the DFS. When the CU partition with the square-type PU is better than its sub-level CU partitions in terms of RD cost in bottom-up search of the DFS, the square type of current CU partition, along with its coding mode, is selected as the best partition. Otherwise, non-square-type PUs for the current CU level are evaluated. If the sub-partition is better than the CU with the non-square PUs, the sub-partition is finally selected as the optimum PU. Otherwise, the best non-square PU is selected as the best PU for the current level. Experimental results demonstrate that the proposed square-type-first inter-PU search can reduce the computational load in average encoding time by 66.7 % with 1---2 % BD loss over HM reference software. In addition, the proposed algorithm can yield an additional average time saving of 26.8---35.5 % against the three fast encoding algorithms adopted in HM.

Comparing Fuzzy, Probabilistic, and Possibilistic Partitions Using the Earth Mover’s Distance

A number of noteworthy techniques have been put forth recently in different research fields for comparing clusterings. Herein, we introduce a new method for comparing soft (fuzzy, probabilistic, and possibilistic) partitions based on the earth mover's distance (EMD) and the ordered weighted average (OWA). The proposed method is a metric, depending on the ground distance, for all but possibilistic partitions. It is extremely flexible due to its EMD formulation, OWA aggregation, and abstract concept of ground distance. In theory, our method is agnostic to the type (uncertainty) of soft partition, clustering algorithm, and distance measure used in the clustering algorithm(s), and it is applicable to the clustering of both object and relational data. Validation is performed theoretically, experimentally, as well as in terms of computational complexity. Emphasis is placed on the set of possibilistic partitions, specifically noise and coincident clusters, which are important cases that have received little to no attention to date in the comparing clustering literature. Improvements are reported in terms of metric properties and computational complexity over existing extended concordance/discordance (e.g., soft Rand and Jaccard) approaches and improved design and robustness in comparison with existing transportation problem-based approaches.

Computation of Balanced Equivalence Relations and Their Lattice for a Coupled Cell Network

A coupled cell network describes interacting (coupled) individual systems (cells). As in networks from real applications, coupled cell networks can represent inhomogeneous networks where different types of cells interact with each other in different ways, which can be represented graphically by different symbols, or abstractly by equivalence relations. Various synchronous behaviors, from full synchrony to partial synchrony, can be observed for a given network. Patterns of synchrony, which do not depend on specific dynamics of the network, but only on the network structure, are associated with a special type of partition of cells, termed balanced equivalence relations. Algorithms in Aldis [J. W. Aldis, Internat. J. Bifur. Chaos Appl. Sci. Engrg., 18 (2008), pp. 407--427] and Belykh and Hasler [I. Belykh and M. Hasler, Chaos, 21 (2011), 016106] find the unique pattern of synchrony with the fewest clusters. In this paper, we compute the set of all possible patterns of synchrony and show their hierarchy structure as a complete lattice. We represent the network structure of a given coupled cell network by a symbolic adjacency matrix encoding the different coupling types. We show that balanced equivalence relations can be determined by a matrix computation on the adjacency matrix which forms a block structure for each balanced equivalence relation. This leads to a computer algorithm to search for all possible balanced equivalence relations. Our computer program outputs the balanced equivalence relations, quotient matrices, and a complete lattice for user specified coupled cell networks. Finding the balanced equivalence relations of any network of up to 15 nodes is tractable, but for larger networks this depends on the pattern of synchrony with the fewest clusters.

Algorithmic Approach to Star Partition of the Graph

The purpose of this paper is to design an algorithm for star partitions of the graph. We shall now bring out a useful connection between the domination number of a graph and what we shall choose to call the ‘star partition number’ of the graph which is an invariant of the graph defined by a certain type of partition of its vertex set. We consider finite undirected graphs without loops or multiple edges

A SURVEY OF THE DIFFERENT TYPES OF VECTOR SPACE PARTITIONS

A vector space partition is here a collection [Formula: see text] of subspaces of a finite vector space V(n, q), of dimension n over a finite field with q elements, with the property that every non-zero vector is contained in a unique member of [Formula: see text]. Vector space partitions relate to finite projective planes, design theory and error correcting codes. In the first part of the paper I will discuss some relations between vector space partitions and other branches of mathematics. The other part of the paper contains a survey of known results on the type of a vector space partition, more precisely: the theorem of Beutelspacher and Heden on T-partitions, rather recent results of El-Zanati et al. on the different types that appear in the spaces V(n, 2), for n ≤ 8, a result of Heden and Lehmann on vector space partitions and maximal partial spreads including their new necessary condition for the existence of a vector space partition, and furthermore, I will give a theorem of Heden on the length of the tail of a vector space partition. Finally, I will also give a few historical remarks.