scholarly journals Locating Arrays with Mixed Alphabet Sizes

Mathematics ◽  
2020 ◽  
Vol 8 (5) ◽  
pp. 831
Author(s):  
Ce Shi ◽  
Hao Jin ◽  
Tatsuhiro Tsuchiya
Keyword(s):  
Lower Bound ◽  
Real Life ◽  
Single Fault ◽  
Interaction Faults ◽  
Recursive Constructions ◽  
Level 1 ◽  
Locating Arrays

Locating arrays (LAs) can be used to detect and identify interaction faults among factors in a component-based system. The optimality and constructions of LAs with a single fault have been investigated extensively under the assumption that all the factors have the same values. However, in real life, different factors in a system have different numbers of possible values. Thus, it is necessary for LAs to satisfy such requirements. We herein establish a general lower bound on the size of mixed-level ( 1 ¯ , t ) -locating arrays. Some methods for constructing LAs including direct and recursive constructions are provided. In particular, constructions that produce optimal LAs satisfying the lower bound are described. Additionally, some series of optimal LAs satisfying the lower bound are presented.

scholarly journals Lower bound for the cost of connecting tree with given vertex degree sequence

2019 ◽  
Vol 8 (2) ◽  
Author(s):  
Mikhail Goubko ◽  
Alexander Kuznetsov
Keyword(s):  
Lower Bound ◽  
Heuristic Algorithms ◽  
Degree Sequence ◽  
Real Life ◽  
Inequality Constraints ◽  
Topology Design ◽  
Semidefinite Optimization ◽  
Linear Matrix ◽  
Matrix Inequality ◽  
The Cost

Abstract The optimal connecting network problem generalizes many models of structure optimization known from the literature, including communication and transport network topology design, graph cut and graph clustering, etc. For the case of connecting trees with the given sequence of vertex degrees the cost of the optimal tree is shown to be bounded from below by the solution of a semidefinite optimization program with bilinear matrix inequality constraints, which is reduced to the solution of a series of convex programs with linear matrix inequality constraints. The proposed lower-bound estimate is used to construct several heuristic algorithms and to evaluate their quality on a variety of generated and real-life datasets.

eFAST for Pneumothorax: Real-Life Application in an Urban Level 1 Center by Trauma Team Members

2018 ◽  
Vol 84 (2) ◽  
pp. 220-224 ◽  
Author(s):  
Steven Maximus ◽  
Cesar Figueroa ◽  
Matthew Whealon ◽  
Jacqueline Pham ◽  
Eric Kuncir ◽  
...  
Keyword(s):  
Real Life ◽  
Standard Of Care ◽  
Trauma Team ◽  
Tube Thoracostomy ◽  
Trauma Patients ◽  
Team Members ◽  
X Ray ◽  
Chest X Ray ◽  
Level 1 ◽  
Clinically Significant

The focused assessment with sonography for trauma (FAST) examination has become the standard of care for rapid evaluation of trauma patients. Extended FAST (eFAST) is the use of ultra-sonography for the detection of pneumothorax (PTX). The exact sensitivity and specificity of eFAST detecting traumatic PTX during practical “real-life” application is yet to be investigated. This is a retrospective review of all trauma patients with a diagnosis of PTX, who were treated at a large level 1 urban trauma center from March 2013 through July 2014. Charts were reviewed for results of imaging, which included eFAST, chest X-ray, and CT scan. The requirement of tube thoracostomy and mechanism of injury were also analyzed. A total of 369 patients with a diagnosis of PTX were identified. A total of 69 patients were excluded, as eFASTwas either not performed or not documented, leaving 300 patients identified with PTX. A total of 113 patients had clinically significant PTX (37.6%), requiring immediate tube thoracostomy placement. eFAST yielded a positive diagnosis of PTX in 19 patients (16.8%), and all were clinically significant, requiring tube thoracostomy. Chest X-ray detected clinically significant PTX in 105 patients (92.9%). The literature on the utility of eFAST for PTX in trauma is variable. Our data show that although specific for clinically significant traumatic PTX, it has poor sensitivity when performed by clinicians with variable levels of ultrasound training. We conclude that CT is still the gold standard in detecting PTX, and clinicians performing eFAST should have adequate training.

Experimental Investigations of Single and Multi-Fault in Rotor System

2014 ◽  
Vol 541-542 ◽  
pp. 628-634
Author(s):  
S.P. Mogal ◽  
D.I. Lalwani
Keyword(s):  
Fourier Transform ◽  
Fast Fourier Transform ◽  
Real Life ◽  
Rotor System ◽  
Vibration Response ◽  
Experimental Investigations ◽  
Multiple Faults ◽  
Single Fault ◽  
Vibration Behavior ◽  
Combined Action

Many researchers dealt with single fault but in real life situations, combined action of two or more single faults are usually present. Multi-faults (two and three combinations) were studied by few researchers. Researchers have mostly studied the vibration behavior of a rotor with misalignment, unbalance and rub separately. This paper presents one such case, where multiple faults are considered together in a rotor system, i.e. misalignment, unbalance and rub. The objective of this paper is to experimentally investigate the vibration response of combined of three faults misalignment, unbalance and rub using Fast Fourier Transform (FFT). FFT spectrum of combination of three faults misalignment, unbalance and rub show 1 X and 2 X are predominant and many sub harmonics are generated.1X peak represent unbalance, 2X peak represents misalignment and sub harmonics shows rub fault.

Lower bound and construction of mixed-level locating arrays

2020 ◽  
pp. 1-11
Author(s):  
E. Chen ◽  
Zong-Feng Qi ◽  
Yu Tang
Keyword(s):  
Lower Bound ◽  
Locating Arrays

scholarly journals On the Information Ratio of Graphs with Many Leaves

2019 ◽  
Vol 73 (1) ◽  
pp. 97-108
Author(s):  
Máté Gyarmati ◽  
Péter Ligeti
Keyword(s):  
Lower Bound ◽  
Secret Sharing ◽  
Complete Graph ◽  
Upper Bounds ◽  
Entropy Method ◽  
The Other ◽  
Secret Sharing Schemes ◽  
Lower And Upper Bounds ◽  
Information Ratio ◽  
Recursive Constructions

Abstract We investigate the information ratio of graph-based secret sharing schemes. This ratio characterizes the efficiency of a scheme measured by the amount of information the participants must remember for each bits in the secret. We examine the information ratio of several systems based on graphs with many leaves, by proving non-trivial lower and upper bounds for the ratio. On one hand, we apply the so-called entropy method for proving that the lower bound for the information ratio of n-sunlet graphs composed of a 1-factor between the vertices of a cycle Cn and n independent vertices is 2. On the other hand, some symmetric and recursive constructions are given that yield the upper bounds. In particular, we show that the information ratio of every graph composed of a 1-factor between a complete graph Kn and at most 4 independent vertices is smaller than 2.

The Jargons of Clash of Clans Used by The Teenagers

LETS ◽  
2020 ◽  
Vol 1 (2) ◽  
pp. 91-98
Author(s):  
Yudhi Faizal Eka Putra ◽  
Serliah Nur ◽  
Rabiatul Adawiah ◽  
Nurfitrah
Keyword(s):  
Qualitative Research ◽  
Real Life ◽  
Online Games ◽  
The Other ◽  
Online Game ◽  
Town Hall ◽  
Life Context ◽  
Level 3 ◽  
Level 1 ◽  
Descriptive Method

Online Games are popular for Indonesian teenagers, and one of them is the Clash of Clans (COC). Each online game has specific terms. Those are known as jargon. This study is aimed to find jargons of Clash of Clans used by the teenagers. It is a qualitative research using descriptive method. The result shows that there are seventeen jargons used by three teenagers. They are Archer Troops, Barbarian Troops, Wall Level 3, Wall Level 1, Town Hall 3 Starts, Mortar, Golem, Hogs, Wars, Builder, Hidden Tesla, Clan Castle, Giant, Healer, and Elixir. Those jargons are used in the other contexts, out of that online game. the players use this jargon language by considering the things in the real life with all of the things in Clash of Clans. So the jargon language from the game is accidentally said by teenagers in their real life context.

Minimum variance lower bound estimation with Gaussian Process models

2017 ◽  
Vol 40 (6) ◽  
pp. 1799-1807 ◽  
Author(s):  
Mehdi Ghasemi Naraghi ◽  
Yousef Alipouri
Keyword(s):  
Lower Bound ◽  
Gaussian Process ◽  
Real Life ◽  
Predictive Distribution ◽  
Minimum Variance ◽  
Process Models ◽  
Estimation Uncertainty ◽  
Gaussian Process Models ◽  
Gp Model ◽  
Bound Estimation

In this paper, we utilize the probability density function of the data to estimate the minimum variance lower bound (MVLB) of a nonlinear system. For this purpose, the Gaussian Process (GP) model has been used. With this model, given a new input and based on past observations, we naturally obtained the variance of the predictive distribution of the future output, which enabled us to estimate MVLB as well as estimation uncertainty. Also, an advantage of the proposed method over others is its ability to estimate MVLB recursively. The application of this method to the real-life dynamic process (experimental four-tank process) indicates that this approach gives very credible estimates of the MVLB.

Online Preemptive Hierarchical Scheduling on Two Uniform Machines with Rejection

2015 ◽  
Vol 32 (04) ◽  
pp. 1550027
Author(s):  
Xiao Min ◽  
Jing Liu ◽  
Yanxia Dong ◽  
Ming Jiang
Keyword(s):  
Lower Bound ◽  
Online Algorithms ◽  
Upper Bound ◽  
Competitive Ratio ◽  
Scheduling Problem ◽  
Hierarchical Scheduling ◽  
Uniform Machines ◽  
Level 1

This paper studies the online hierarchical scheduling problem on two uniform machines with rejection. Two uniform machines M1, M2 run at the speeds of s ∈ (0, +∞), 1 separately; and they are provided with different capabilities. Each machine has a certain GOS level 1 or 2 and every job is also associated with a hierarchy 1 or 2. The job can only be assigned to the machine whose GOS level does not exceed the job's hierarchy. Preemption is permitted but idle is not introduced. Jobs come one by one over list. When a job arrives, it can be accepted and scheduled on some machine or rejected by paying its penalty. The objective is to minimize the sum of makespan yielded by accepted jobs and total penalties of all rejected jobs. For this problem, we propose a family of several online algorithms according to the range of s and the related lower bound is also obtained. These algorithms achieve optimal competitive ratio when s ∈ (0, 1) ∪ [1.618, +∞), but have a small gap between upper bound and lower bound in interval [1, 1.618).

scholarly journals 8th Grade Student’s Skill of Connecting Mathematics to Real Life

2017 ◽  
Vol 5 (10) ◽  
pp. 158 ◽  
Author(s):  
Mesture Kayhan Altay ◽  
Betül Yalvaç ◽  
Emel Yeltekin
Keyword(s):  
Survey Design ◽  
Real Life ◽  
Data Collection Tool ◽  
Mathematical Concepts ◽  
Life Scale ◽  
8Th Grade ◽  
Level 1 ◽  
Four Levels ◽  
Academic Year ◽  
Mathematical Connection

The purpose of this study is to examine 8th grade students’ skills of connecting mathematics to real life. This study uses survey design since it aims to determine existing situations regarding to students’ skills of connecting mathematics to real life. The study sample consists of 176 students in total, who are studying at a state school in the Etimesgut district of Ankara in the second semester of 2016-2017 academic year. “Connecting mathematics to real life scale” which is developed by the researchers, used as the data collection tool of this study. In this scale, students are provided with real life situations and then asked to connect these situations with mathematical concepts. During the data analysis, the responses of students examined in detail and subsequently general categories (levels) which identify students’ mathematical connection skill, were created and consequently four levels of connecting (Level 1, 2, 3 and 4) were defined. Study findings are showed that, participating 8th grade students’ skill of connecting mathematics to real life is not in sufficient level. It is observed that, most of the students can only connect mathematics in real life with numbers and shapes.

Ultrastructural study on the development of rat amygdaloid body

1990 ◽  
Vol 48 (3) ◽  
pp. 432-433
Author(s):  
A. Manolova ◽  
S. Manolov
Keyword(s):  
Nerve Cells ◽  
Amygdaloid Complex ◽  
Amygdaloid Body ◽  
Thin Ring ◽  
Morphological Criteria ◽  
Neural Processes ◽  
Abundant Cytoplasm ◽  
Level 1 ◽  
Few Data ◽  
Oval Shape

Relatively few data on the development of the amygdaloid complex are available only at the light microscopic level (1-3). The existence of just general morphological criteria requires the performance of other investigations in particular ultrastructural in order to obtain new and more detailed information about the changes in the amygdaloid complex during development.The prenatal and postnatal development of rat amygdaloid complex beginning from the 12th embrionic day (ED) till the 33rd postnatal day (PD) has been studied. During the early stages of neurogenesis (12ED), the nerve cells were observed to be closely packed, small-sized, with oval shape. A thin ring of cytoplasm surrounded their large nuclei, their nucleoli being very active with various size and form (Fig.1). Some cells possessed more abundant cytoplasm. The perikarya were extremely rich in free ribosomes. Single sacs of the rough endoplasmic reticulum and mitochondria were observed among them. The mitochondria were with light matrix and possessed few cristae. Neural processes were viewed to sprout from some nerve cells (Fig.2). Later the nuclei were still comparatively large and with various shape.

Sign in / Sign up

Export Citation Format

Share Document