Search

In this paper, we focus on Brauer's height zero conjecture, Robinson's conjecture, and Olsson's conjecture regarding the direct product of finite groups and give relative versions of these conjectures by restricting them to the algebraic concept of the anchor group of an irreducible character. Consider G to be a finite simple group. We prove that the anchor group of the irreducible character of G with degree p is the trivial group, where p is an odd prime. Additionally, we introduce the relative version of the Green correspondence theorem with respect to this group. We then apply the relative versions of these conjectures to suitable examples of simple groups. Classical and standard theories on the direct product of finite groups, block theory, and character theory are used to achieve these results. [ABSTRACT FROM AUTHOR]

We consider G to be a finite group and p as a prime number. We fix ψ to be an irreducible character of G with its restriction to all p-regular elements of G and ψ 0 to be an irreducible Brauer character. The main aim of this paper is to describe and investigate the relationship between cyclic anchor group of ψ and the defect group of a p-block which contains ψ. Our methods are to study and generalize some facts for the cyclic defect groups of a p-block B to the case of a cyclic anchor group of irreducible characters which belong to B. We establish and prove a criteria for an irreducible character to have a cyclic anchor group. [ABSTRACT FROM AUTHOR]

In this paper, we introduce codes equipped with pomset block metric. A Singleton type bound for pomset block codes is obtained. Code achieving the Singleton bound, called a maximum distance separable code (for short, MDS ( P , π )-code) is also investigated. We extend the concept of I-perfect codes and r-perfect codes to pomset block metric. The relation between I-perfect codes and MDS (P , π) -codes is also considered. When all blocks have the same dimension, we prove the duality theorem for codes and study the weight distribution of MDS pomset block codes when the pomset is a chain. [ABSTRACT FROM AUTHOR]

Congenitally corrected transposition of the great arteries (ccTGA) is a rare congenital anomaly defined by double discordance – atrioventricular and ventricular-arterial. ccTGA frequently has associated lesions, which influence long-term survival. The management of patients with ccTGA regarding the closure of defects and pacing strategies is often very challenging. Moreover, tricuspid valve regurgitation and its impact on the systemic right ventricle requires close monitoring and potentially timely interventions. In this paper, we present and discuss the management challenges raised by a patient with situs inversus totalis, dextrocardia, ccTGA, Ebstein anomaly of the tricuspid valve, atrial septal defect, and complete atrioventricular block. [ABSTRACT FROM AUTHOR]

Let G be a vertex-colored graph. A vertex cut S of G is called a monochromatic vertex cut if the vertices of S are colored with the same color. A graph G is monochromatically vertex-disconnected if any two nonadjacent vertices of G have a monochromatic vertex cut separating them. The monochromatic vertex disconnection number of G , denoted by m v d (G) , is the maximum number of colors that are used to make G monochromatically vertex-disconnected. In this paper, the connection between the graph parameters are studied: m v d (G) , connectivity and block decomposition. We determine the value of m v d (G) for some well-known graphs, and then characterize G when n − 5 ≤ m v d (G) ≤ n and all blocks of G are minimally 2-connected triangle-free graphs. We obtain the maximum size of a graph G with m v d (G) = k for any k. Finally, we study the Erdős-Gallai-type results for m v d (G) , and completely solve them. [ABSTRACT FROM AUTHOR]

As the feature size of integrated circuit decreases, semiconductor devices become more susceptible to Single-Event-Upset (SEU) effect. This paper proposes a radiation hardened latch for Triple-Node-Upset (TNU) tolerance, which can block any triple node upset. Compared with previous radiation hardened TNU Tolerant (TNUT) latches, the proposed Low power-consumption TNUT (LTNUT) latch has the lowest power consumption. When compared with TNU Hardened Latch (TNUHL), TNUT Latch, TNU Completely Tolerant latch (TNUCT), Single-event Multiple-Node Upset Tolerant latch (SMNUT), TNU self-Recoverable Latch (TNURL), Low Cost and TNU-self-Recoverable Latch (LCTNURL) and Quadruple Dual Interlocked Storage Cell (Quadruple-DICE), the proposed LTNUT latch achieves reduction in power consumption by 30.77%, 17.11%, 40%, 20.25%, 20.25%, 27.59% and 64%, respectively. The proposed LTNUT latch achieves reduction in delay by 94.98%, 98.33%, 54.19%, 70.63% and 66.59% when compared with TNUHL, TNUT Latch, SMNUT, TNURL, LCTNURL, respectively, and introduces rise in delay by 3.38% and 5.52%, respectively, when compared with TNUCT and Quadruple-DICE. The proposed LTNUT latch has the lowest power consumption and second smallest delay. The proposed latch is not severely sensitive to temperature and voltage variations. [ABSTRACT FROM AUTHOR]

Let G = (V (G), E(G)) be a simple undirected graph. A block of G is a maximal connected subgraph of G that contains no cut-vertices [11]. The family of vertex sets of blocks of G generates a unique topology. In this paper, we formally define the topology generated by the family of blocks in a graph called the block topological space. Moreover, we characterize and describe some special attributes of the block topological space. Finally, we associate a corresponding graph from a given block topological space by defining the block topological graph. [ABSTRACT FROM AUTHOR]

This paper describes high-frequency nerve block experiments carried out on rat sciatic nerves to measure the speed of recovery of A fibres from block carryover. Block carryover is the process by which nerve excitability remains suppressed temporarily after High Frequency Alternative (HFAC) block is turned off following its application. In this series of experiments 5 rat sciatic nerves were extracted and prepared for ex-vivo stimulation and recording in a specially designed perfusion chamber. For each nerve repeated HFAC block and concurrent stimulation trials were carried out to observe block carryover after signal shutoff. The nerve was allowed to recover fully between each trial. Time to recovery from block was measured by monitoring for when relative nerve activity returned to within 90% of baseline levels measured at the start of each trial. HFAC block carryover duration was found to be dependent on accumulated dose by statistical test for two different HFAC durations. The carryover property of HFAC block on A fibres could enable selective stimulation of autonomic nerve fibres such as C fibres for the duration of carryover. Block carryover is particularly relevant to potential chronic clinical applications of block as it reduces power requirements for stimulation to provide the blocking effect. This work characterizes this process toward the creation of a model describing its behavior. [ABSTRACT FROM AUTHOR]

Flexible surface treatment for exterior pavement applications and the particular requirement to be specific pedestrian walkway design and parking areas are the fundamental feature of paver block identification. The use of conventional materials such as cement, aggregate, and sand is no longer such a priority. Under those circumstances, the production of research-based pavers block has been done to ensure the sustainability and usability of new building materials is expanded. Henceforth, this research is conducted to study and investigate the potential of using waste materials as a partial substitute for aggregate in producing concrete paving block (CPB). In essence, the application of waste materials in concrete paver blocks is highly potential. The innovations in recycling technologies expanded the usage of waste materials to produce paver block products. On the whole, in the manufacturing of concrete, the paper improves and enhances the usability of waste materials. The application of various waste materials such as plastic, steel slag, and crumb rubber is excellent. Compressive strength of paver blocks with different rates of waste steel aggregates and utilizing elastic cushions shows paver blocks give up to 50% more strength quality than customary paver blocks. In terms of the use of industrial waste materials, as a substitute material by reducing the percentage amount of the weight of the cement with the composition ratio varies based on the comparative volume category of the paving block aggregate such as 0%, 5%, 10%, 15%, 20%, and 25% are more applicable. [ABSTRACT FROM AUTHOR]

The concept of a tolerance relation, shortly called tolerance, was studied on various algebras since the seventies of the twentieth century by B. Zelinka and the first author (see e.g. [6] and the monograph [1] and the references therein). Since tolerances need not be transitive, their blocks may overlap and hence in general the set of all blocks of a tolerance cannot be converted into a quotient algebra in the same way as in the case of congruences. However, G. Czédli ([7]) showed that lattices can be factorized by means of tolerances in a natural way, and J. Grygiel and S. Radeleczki ([8]) proved some variant of an Isomorphism Theorem for tolerances on lattices. The aim of the present paper is to extend the concept of a tolerance on a lattice to posets in such a way that results similar to those obtained for tolerances on lattices can be derived. [ABSTRACT FROM AUTHOR]

An adaptive force model is proposed to achieve better performance between the accuracy and the speed of cloth simulation in three-dimensional (3D) space. The proposed force model can be expressed with a general mathematical form demonstrated by the distance between the clothing and the human body. This paper defines how a continuous adaptive area can be established with a shape "block". It is clarified that, within a specific block, a force model is expressed with the gravity of the clothing, the forces of the adjacent blocks and the anti-force of the human body to the block. In this manner, the force model of the desired clothing can be obtained through a general mathematical expression. The simulations and experimental results demonstrate that the acceptable clothing simulation in 3D space can be achieved with higher speed by saving about 20.2% runtime, and the efficiency of the proposed scheme can be verified. [ABSTRACT FROM AUTHOR]

The goal of spatio-temporal data mining is to discover previously unknown but useful patterns from the spatial and temporal data. However, explosive growth of the spatiotemporal data emphasizes the need for developing novel computationally efficient methods for large-scale data mining applications. Since lots of spatiotemporal data mining problems can be converted to an optimization problem, in this paper, we propose an efficient parameter-level parallel optimization algorithm for large-scale spatiotemporal data mining. In detail, most of previous optimization methods are based on gradient descent methods, which iteratively update the model and provide model-level convergence control for all parameters. Namely, they treat all parameters equally and keep updating all parameters until every parameter has converged. However, we find that during the iterative process, the convergence rates of model parameters are different from each other. This may cause redundant computation and reduce the performance. To solve this problem, we propose a parameter-level stochastic gradient descent (plpSGD), in which the convergence of each parameter is considered independently and only unconvergent parameters are updated in each iteration. Moreover, the updating of model parameters are parallelized in plpSGD to further improve the performance of SGD. We have conducted extensive experiments to evaluate the performance of plpSGD. The experimental results show that compared to previous SGD methods, plpSGD can significantly accelerate the convergence of SGD and achieve the excellent scalability with little sacrifice of the solution accuracy. [ABSTRACT FROM AUTHOR]

Smartphone sensors are widely used in the development of fitness, running, workout, or health applications (apps). However, smartphone sensors may increase the risk of privacy leakage when they bring convenience to users. Traditional access control mechanisms, such as Android Permission, cannot prevent authorized malicious apps from abusing sensor resources. In this paper, a novel behavior-based sensor access control scheme is presented. This scheme can further regulate the behavior of an app after it is authorized, so that it can only access sensor resources with secure behavior patterns (SBPs), and sensor-based privacy leakage may thereby be blocked. On the basis of user interface (UI) operation tracking and tagging, this scheme implements the dynamic perception of app sensor access behaviors. With a temporal logic known as temporal logic of causal knowledge (TLCK), we developed a method to construct the secure sensor access behavior pattern. Every sensor may be given a SBP. By comparing the dynamic sensor access behavior of an app with SBP, we can determine if the sensor access is secure. Moreover, by supervising the call stack of the app's sensor access application programming interface (API), we may timely block a sensor access when it is not secure. In this report, we also describe the implementation of a prototype defense system to analyze the effectiveness and efficiency of the scheme. The experimental results show that this scheme can effectively block the abnormal sensor access of an app with a performance overhead of about 10%. [ABSTRACT FROM AUTHOR]

This paper addresses the two-dimensional strip-packing (2DSP) problem of placing a set of rectangular pieces onto a fixed-width rectangular sheet to minimize the total length used. We propose a Block-Based Heuristic Search Algorithm (BBHSA) to solve 2DSP problems with guillotine cut constraints. Initially, it converts the 2DSP problem into a series of 2D rectangular packing problems (2DRP), where the size of the sheet is fixed. In the BBHSA, rectangular pieces are aggregated into blocks, which are partial solutions without residual space. These blocks provide the ingredients for a good layout and are basic components in a tree-based constructive search process. Two basic operations, called placing & splitting and approximate binary search are used in the search process. Furthermore, several block-based placement rules are explored to speed up the search process and improve solution quality. To verify the performance of our proposed algorithm, we conducted extensive experiments using the zero-waste benchmark and non-zero-waste benchmark instances. The results show that BBHSA demonstrates computational effectiveness, particularly in zero-waste cases, achieving optimal solutions for almost all zero-waste benchmark instances reported in the existing literature. [ABSTRACT FROM AUTHOR]

In building stones, discontinuities, non-uniformity, and irregular shape are among the problems that reduce the quality of products. Stone blocks, slabs, and tiles are the main products of quarries and stone processing plants. Quantifying the quality is a key factor in valuation of these products. This paper proposes a quality factor formula to determine the quality of stone blocks (three-dimensional) and products from stone processing plants (two-dimensional). This factor, which shows the uniformity and esthetic index of a piece of stone, is determined based on the shape quality (α), number, size, and esthetic quality (β) of the pieces and the discontinuity factor (γ) that separates the pieces. The quality factor is defined in a way that each previously mentioned characteristic of a piece is involved in the quality factor formula calculation. The quality factor ranges between 0 and 1 and can be expressed as a percentage. The proposed quality factor was calculated for a number of different stone blocks, slabs, and tiles to examine the validity of the quality factor formula. The results showed that the shape quality is the most significant parameter in determining the quality of stone blocks in quarries. Moreover, in processing plant products the esthetic quality and the number of stone pieces in a product are the key factors for determination of their quality. The discontinuity factor is a parameter that reduces the quality of stone products significantly. Furthermore, the quality factor formula can be used as a convenient tool for classifying the products of quarries and stone processing plants. [ABSTRACT FROM AUTHOR]

The UV irradiation method provides us a new way of preparing resorcinol-formaldehyde (RF) aerogel. In this paper, water soluble, neutral photo-initiator 659 was used to synthesize RF aerogel by using free radical UV initiator. Incorporation of the UV initiators during the sol-gel stage usually decreases the gel-time. On changing the performed time and initiators quantities in synthesizing RF aerogel, The results will be discussed that gel-time of the RF aerogel definitely depends on the polymerization time and initiators quantities. The paper will also be discussed the RF aerogel developed for UV irradiation method and Sol-gel method by IR spectrum, Scanning electron microscopy, N adsorption/desorption to show that light initiator does not play any role in the formation of the aerogel skeleton; The RF aerogel using UV irradiation method still maintain a high pore structure, shorter gel-time and the three-dimensional size block. [ABSTRACT FROM AUTHOR]

Abstract The lesser occipital nerve (LON) has one of the most variations among occipital nerves. We aimed to investigate morphological and morphometric features of LON. A total of 24 cadavers, 14 males (58%) and 10 females (42%), were dissected bilaterally. LON was classified into 3 types. The number of branches and the perpendicular distances of the point where LON emerged from the posterior border of sternocleidomastoid muscle to vertical and transverse lines passing through external occipital protuberance were determined. The shortest distance between LON and great auricular nerve (GAN), and linear distance of LON to its branching point were measured. The most common variant was Type 1 (30 sides, 62.5%), followed by Type 2 (12 sides, 25%) and Type 3 (6 sides, 12.5%), respectively. In males, Type 1 (22 sides, 78.6%) was the most common, while Type 1 (8 sides, 40%) and Type 2 (8 sides, 40%) were equally common and the most common in females. On 48 sides, 2–9 branches of LON were observed. The perpendicular distance of said point to vertical and transverse lines was meanly 63.69 ± 11.28 mm and 78.83 ± 17.21 mm, respectively. The shortest distance between LON and GAN was meanly 16.62 ± 10.59 mm. The linear distance of LON to its branching point was meanly 31.24 ± 15.95 mm. The findings reported in this paper may help clinicians in estimating the location of the nerve and/or its branches for block or decompression surgery as well as preservation of LON during related procedures.

Three dimensional packing is a major problem occurring in the transportation sector. It is also a challenging problem to overcome the limitations of existing businesses. This research studies the problem for packing items of Thailand Post (local branches) which provide delivery service to customers and arrange to pack items by staff for delivery to the distribution center. Moreover, the staff want to arrange and pack items into limited roll pallets which must be delivered within the specified period. In this paper, we analyze the problem under the limitations of different types of items and the number of roll pallets and developed an algorithm for sorting and packing items to minimize the amount of items left at the branch when limited roll pallets are available. Moreover, this algorithm can reduce the number of items left at the branch and serve as a guideline for staff. [ABSTRACT FROM AUTHOR]

Copyright of Retos: Nuevas Perspectivas de Educación Física, Deporte y Recreación is the property of Federacion Espanola de Asociaciones de Docentes de Educacion Fisica and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Colloidal Gas Aphron as a mobility control in enhanced oil recovery is becoming attractive; it is also designed to block porous media with micro-bubbles. In this paper, the effects of surfactant concentration, polymer concentration, temperature and salinity on the bubble size of the Colloidal Gas Aphron were studied. Effects of injection rates, Colloidal Gas Aphron fluid composition, heterogeneity of reservoir on the resistance to the flow of Colloidal Gas Aphron fluid through porous media were investigated. Effects of Colloidal Gas Aphron fluid composition and temperature on residual oil recovery were also studied. The results showed that bubble growth rate decreased with increasing surfactant concentration, polymer concentration, and decreasing temperature, while it decreased and then increased slightly with increasing salinity. The obvious increase of injection pressure was observed as more Colloidal Gas Aphron fluid was injected, indicating that Colloidal Gas Aphron could block the pore media effectively. The effectiveness of the best blend obtained through homogeneous sandpack flood tests was modestly improved in the heterogeneous sandpack. The tertiary oil recovery increased 26.8 % by Colloidal Gas Aphron fluid as compared to 20.3 % by XG solution when chemical solution of 1 PV was injected into the sandpack. The maximum injected pressure of Colloidal Gas Aphron fluid was about three times that of the XG solution. As the temperature increased, the Colloidal Gas Aphron fluid became less stable; the maximum injection pressure and tertiary oil recovery of Colloidal Gas Aphron fluid decreased. [ABSTRACT FROM AUTHOR]

Let k be an algebraically closed field of characteristic 2, let G be a finite group and let B be the principal 2-block of kG with a dihedral or a generalised quaternion defect group P. Let also T (B) denote the group of splendid Morita auto-equivalences of B. We show that T (B) ≅OutP (A) × Out(P,F), where Out(P,F) is the group of outer automorphisms of P which stabilize the fusion system F of G on P and OutP (A) is the group of algebra automorphisms of a source algebra A of B fixing P modulo inner automorphisms induced by (AP)×. [ABSTRACT FROM AUTHOR]

The paper points to the position and role of block techniques in traditional and modern sport karate. The realization of blocks in traditional and modern sports karate is essentially different, and those differences represent the focus of this paper. An in-depth analysis underlines those differences not only in terms of execution, but also in terms of training methodology. Understanding the essential differences in the execution of blocks in traditional karate on one side and modern sport karate on the other side can be of crucial importance when it comes to achieving maximum sports results, especially among top athletes. Comprehending the technical differences between blocks, i.e. their implementation in traditional and modern sport karate holds essential importance for the preparation of competitors in modern sport karate, above all for fights. Rejecting the given fact would most certainly have a negative impact in shape of the absence of sports achievements in fights in modern sport karate.

Differential privacy (DP) is a promising scheme for releasing the results of statistical queries on sensitive data. This paper focuses on top-k frequent columns publication on sensitive data, with high result utility under differential privacy. Existing works directly select frequent columns from all columns (called one-phase scheme), which is far from ideal due to the large privacy consumption or misjudgments for columns with frequencies close to the frequency of the k th frequent column (called near-k-fluctuation-column). This paper presents a new solution Two Phase Selection (TPS) to carefully choose frequent columns in two phases. The main idea is to classify columns into two distinct categories based on whether it is one near-k-fluctuation-column or not. Frequent columns are chosen from the two categories using different techniques, which is totally different from existing solutions without classifying. Furthermore, by analyzing the distribution of near-k-fluctuation-columns, we introduce a block-centric column-choosing method privacy-free-mechanism (PFM). By partitioning columns into blocks, PFM makes the privacy consumption proportional to the number of blocks, instead of frequent columns. Extensive experiments on real datasets show that our proposals outperform the state-of-the-art techniques for top-k column publication.

Many papers on both theoretical aspects of bundle adjustment of oblique images and new operators for detecting tie points on oblique images have been written. However, only a few achievements presented in the literature were practically implemented in commercial software. In consequence often aerial triangulation is performed either for nadir images obtained simultaneously with oblique photos or bundle adjustment for separate images captured in different directions. The aim of this study was to investigate how the orientation of oblique images can be carried out effectively in commercial software based on the structure from motion technology. The main objective of the research was to evaluate the impact of the orientation strategy on both duration of the process and accuracy of photogrammetric 3D products. Two, very popular software: Pix4D and Agisoft Photoscan were tested and two approaches for image blocks were considered. The first approach based only on oblique images collected in four directions and the second approach included nadir images. In this study, blocks for three test areas were analysed. Oblique images were collected with medium-format cameras in maltan cross configuration with registration of GNSS and INS data. As a reference both check points and digital surface models from airborne laser scanning were used. [ABSTRACT FROM AUTHOR]

Co-saliency detection, an emerging research area in saliency detection, aims to extract the common saliency from the multi images. The extracted co-saliency map has been utilized in various applications, such as in co-segmentation, co-recognition and so on. With the rapid development of image acquisition technology, the original digital images are becoming more and more clearly. The existing co-saliency detection methods processing these images need enormous computer memory along with high computational complexity. These limitations made it hard to satisfy the demand of real-time user interaction. This paper proposes a fast co-saliency detection method based on the image block partition and sparse feature extraction method (BSFCoS). Firstly, the images are divided into several uniform blocks, and the low-level features are extracted from Lab and RGB color spaces. In order to maintain the characteristics of the original images and reduce the number of feature points as well as possible, Truncated Power for sparse principal components method are employed to extract sparse features. Furthermore, K-Means method is adopted to cluster the extracted sparse features, and calculate the three salient feature weights. Finally, the co-saliency map was acquired from the feature fusion of the saliency map for single image and multi images. The proposed method has been tested and simulated on two benchmark datasets: Co-saliency Pairs and CMU Cornell iCoseg datasets. Compared with the existing co-saliency methods, BSFCoS has a significant running time improvement in multi images processing while ensuring detection results. Lastly, the co-segmentation method based on BSFCoS is also given and has a better co-segmentation performance. [ABSTRACT FROM AUTHOR]

The unmanned airborne system (UAS) remote sensing using lightweight multi- and hyperspectral imaging sensors offer new possibilities for the environmental monitoring applications. Based on the accurate measurements of the way in which the object reflect and emit energy, wide range of affecting variables can be monitored. Condition for reliable applications is reliable and accurate input data. In many applications, installation of geometric and radiometric reference targets in the object area is challenging, for instance, in forest or water areas. On the other hand, UASs are often operated in very poor conditions, under clouds or under variable cloud cover. Our objective is to develop an autonomous hyperspectral UAS imaging system and data processing chain that does not require any ground reference targets. Prerequisites for this kind of a system are an appropriate sensor setup, stable and well-calibrated instruments and rigorous data processing. In this paper, we will describe the new hyperspectral UAS imaging system that is under development. Important applications for the proposed system include precision agriculture, forest monitoring and water quality monitoring. Finally, we will consider the use of the system in forest inventory application and present the first results of the summer 2014 campaigns. [ABSTRACT FROM AUTHOR]

Relational databases are still very often used as a data storage, even for the sensor oriented data. Each data tuple is logically stored in the table referenced by relationships between individual tables. From the physical point of view, data are stored in the data files delimited by the tablespaces. Files are block-oriented. When retrieving data, particular blocks must be identified and transferred into the memory for the evaluation and processing. This paper deals with storage principles and proposes own methods for effective data block location and identification if no suitable index for the query is present in the system. Thanks to that, the performance of the whole system is optimized, and the processing time and costs are significantly lowered. The proposed solution is based on the master index, which points just to the blocks with relevant data. Thus, no sequential block scanning is necessary for consuming many system resources. The paper analyzes the impact of block size, which can have a significant impact on sensor oriented data, as well. [ABSTRACT FROM AUTHOR]

The dorsal hand vein images captured by cross-device may have great differences in brightness, displacement, rotation angle and size. These deviations must influence greatly the results of dorsal hand vein recognition. To solve these problems, the method of dorsal hand vein recognition was put forward based on bit plane and block mutual information in this paper. Firstly, the input gray image of dorsal hand vein was converted to eight-bit planes to overcome the interference of brightness inside the higher bit planes and the interference of noise inside the lower bit planes. Secondly, the texture of each bit plane of dorsal hand vein was described by a block method and the mutual information between blocks was calculated as texture features by three kinds of modes to solve the problem of rotation and size. Finally, the experiments cross-device were carried out. One device was used to be registered, the other was used to recognize. Compared with the SIFT (Scale-invariant feature transform, SIFT) algorithm, the new algorithm can increase the recognition rate of dorsal hand vein from 86.60% to 93.33%. [ABSTRACT FROM AUTHOR]

We aim in this paper to investigate the connections between some properties of blocks and of their dominating blocks. We find conditions to verify that a block is inertial if and only if its dominating block is inertial. In some situations the equality of the factor fusion systems associated with a block and with its Brauer correspondent block give information about the hyperfocal subgroups. [ABSTRACT FROM AUTHOR]

Copyright of Informatica (03505596) is the property of Slovene Society Informatika and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The basic technical element that is a direct response to the opponent's attack is the block. Blocking is related to setting the starting position of the player and choosing the most effective way to move. The aim of this study was to evaluate the time of movement in the block depending on the difficulty of the task determined by a response to light signals. The study included 14 players (17.36 ± 1.18 years). Eight discs of the FITLIGHT TrainerTM device placed at different heights near the center of the volleyball court were used for the measurements. The player's task was to move as quickly as possible in a block after recognizing a light signal to take a specific action. Three types of tasks with different levels of difficulty were defined: reaction to the light signal on the player's side (S1), reaction to the light signal of the upper or lower discs placed vertically over the net (S2), and reaction to the color of the light signal of the upper or lower discs placed vertically over the net (S3). The following time measurements were analyzed: indirect time (TI), time of movement to the jumping point (TJP), and total time (TT) on the right and left sides. In all measurements (TI, TJP, TT), the differences in the times obtained in tasks S1 and S2 and tasks S1 and S3 were statistically significant (p ≤ 0.001) for both the right and left sides. The comparison of the task performance times for S2 and S3 showed a difference only in the TJP measurement for the left side. An analysis of the results indicates a significant role of signal recognition and decision-making process in the player's movement during blocking. The FITLIGHT TrainerTM device can be a useful tool for this purpose in coaching. [ABSTRACT FROM AUTHOR]

Let $ G $ be a vertex-colored graph. A vertex cut $ S $ of $ G $ is called a monochromatic vertex cut if the vertices of $ S $ are colored with the same color. A graph $ G $ is monochromatically vertex-disconnected if any two nonadjacent vertices of $ G $ have a monochromatic vertex cut separating them. The monochromatic vertex disconnection number of $ G $, denoted by $ mvd(G) $, is the maximum number of colors that are used to make $ G $ monochromatically vertex-disconnected. In this paper, the connection between the graph parameters are studied: $ mvd(G) $, connectivity and block decomposition. We determine the value of $ mvd(G) $ for some well-known graphs, and then characterize $ G $ when $ n-5\leq mvd(G)\leq n $ and all blocks of $ G $ are minimally 2-connected triangle-free graphs. We obtain the maximum size of a graph $ G $ with $ mvd(G) = k $ for any $ k $. Finally, we study the Erdős-Gallai-type results for $ mvd(G) $, and completely solve them.

Relational databases are still very often used as a data storage, even for the sensor oriented data. Each data tuple is logically stored in the table referenced by relationships between individual tables. From the physical point of view, data are stored in the data files delimited by the tablespaces. Files are block-oriented. When retrieving data, particular blocks must be identified and transferred into the memory for the evaluation and processing. This paper deals with storage principles and proposes own methods for effective data block location and identification if no suitable index for the query is present in the system. Thanks to that, the performance of the whole system is optimized, and the processing time and costs are significantly lowered. The proposed solution is based on the master index, which points just to the blocks with relevant data. Thus, no sequential block scanning is necessary for consuming many system resources. The paper analyzes the impact of block size, which can have a significant impact on sensor oriented data, as well.

The study of the forced convection in a channel has many practical applications. In this paper, the forced convection heat transfer from surface mounted blocks attached to the bottom wall of a horizontal channel with nanofluid is numerically studied by the second-order lattice Boltzmann method (LBM). The effects of Reynolds numbers and geometrical parameters of the blocks in different aspect ratios on the flow field and temperature distribution for various volume fractions of nanofluid (φ = 0, 0.01, 0.03 and 0.05) are analyzed. Also, the influence of these parameters is investigated on the local and average Nusselt numbers. It is concluded that heat transfer in channels can be enhanced by using the block on the walls and adding nanoparticles. There is a maximum value of 39.04% increase in average heat transfer coefficient for all the examined cases compared to the base fluid (i.e., water). [ABSTRACT FROM AUTHOR]

In this paper, we focus on Brauer’s height zero conjecture, Robinson’s conjecture, and Olsson’s conjecture regarding the direct product of finite groups and give relative versions of these conjectures by restricting them to the algebraic concept of the anchor group of an irreducible character. Consider G to be a finite simple group. We prove that the anchor group of the irreducible character of G with degree p is the trivial group, where p is an odd prime. Additionally, we introduce the relative version of the Green correspondence theorem with respect to this group. We then apply the relative versions of these conjectures to suitable examples of simple groups. Classical and standard theories on the direct product of finite groups, block theory, and character theory are used to achieve these results.

Superhydrophobic surfaces are fragile and are prone to failure in harsh outdoor environments. The preparation of robust superhydrophobic surfaces with stable performance and excellent properties can extend their application. In this paper, we report a simple and cost-effective method to prepare a superhydrophobic block using superhydrophobic zinc oxide powder and die pressing. The prepared sample has a contact angle of 163° and a sliding angle of 7°. Tests show that the superhydrophobic block can resist the impact of water flow, maintain its superhydrophobicity after friction or knife scraping, and quickly repair the destroyed surface by sandpaper abrasion. The sample exhibited excellent self-cleaning effect, robust mechanical property, and rapid repairability. This preparation method is also environmental-friendly and easy to operate. It will have a wide application prospect in many important fields. [ABSTRACT FROM AUTHOR]

The short circuit test of distributed power flow controller (DPFC) is still a blank in the world. In order to test the effectiveness and adaptability of DPFC in case of line failure, it is necessary to carry out short circuit tests in DPFC projects. Based on the Hu Zhou DPFC Project, this paper proposes the control and protect strategy of DPFC which is coordinated with the protect strategy of AC line, designs single phase short circuit grounding test scheme of the AC line where DPFC is located. In the application, the action logic of DPFC under single-phase grounding fault is verified, the single phase short circuit test of DPFC were completed for the first time, and the transient voltage and current were obtained. It provides technical support for the popularization and application of DPFC project.

We consider G to be a finite group and p as a prime number. We fix ψ to be an irreducible character of G with its restriction to all p-regular elements of G and ψ0 to be an irreducible Brauer character. The main aim of this paper is to describe and investigate the relationship between cyclic anchor group of ψ and the defect group of a p-block which contains ψ. Our methods are to study and generalize some facts for the cyclic defect groups of a p-block B to the case of a cyclic anchor group of irreducible characters which belong to B. We establish and prove a criteria for an irreducible character to have a cyclic anchor group.

We derive an asymptotic formula for the number of labeled connected series-parallel -cyclic graphs of a large order with a fixed number . With a uniform probability distribution, we find the probability that a random labeled connected -vertex -cyclic graph with a fixed as is a series-parallel graph. In addition, we determine the probability that, with a uniform probability distribution, a random labeled connected series-parallel -vertex -cyclic graph with a fixed as is a cactus. [ABSTRACT FROM AUTHOR]