Two-color hybridization with high complexity chromosome-specific probes and a degenerate alpha satellite probe DNA allows unambiguous discrimination between symmetrical and asymmetrical translocations

Chromosoma ◽  
1991 ◽  
Vol 100 (6) ◽  
pp. 371-376 ◽  
Author(s):  
Heinz-Ulrich G. Weier ◽  
Joe N. Lucas ◽  
Marilyn Poggensee ◽  
Richard Segraves ◽  
Daniel Pinkel ◽  
...  
Keyword(s):  
Alpha Satellite ◽  
High Complexity ◽  
Unambiguous Discrimination

ALGEBRA OF PREDICATES AND RELATED GEOMETRIC MODELS CREATION IN REGARDS OF UNIFIED STATE EXAM IN INFORMATICS (RUSSIAN EGE)

2019 ◽  
pp. 40-47
Author(s):  
E. A. Mironchik
Keyword(s):  
Geometric Model ◽  
Main Idea ◽  
Formal Logic ◽  
High Complexity ◽  
Geometric Models ◽  
Complexity Problem ◽  
Logical Expression ◽  
State Examination

The article discusses the method of solving the task 18 on the Unified State Examination in Informatics (Russian EGE). The main idea of the method is to write the conditions of the problem utilizing the language of formal logic, using elementary predicates. According to the laws of logic the resulting complex logical expression would be transformed into an expression, according to which a geometric model is supposed to be constructed which allows to obtain an answer. The described algorithm does allow high complexity problem to be converted into a simple one.

Challenges and Benefits of Product-Like SRAM in Technology Development

2011 ◽  
Author(s):  
Felix Beaudoin ◽  
Stephen Lucarini ◽  
Fred Towler ◽  
Stephen Wu ◽  
Zhigang Song ◽  
...  
Keyword(s):  
Technology Development ◽  
Random Access ◽  
Random Access Memory ◽  
Static Random Access Memory ◽  
Development Phase ◽  
High Complexity ◽  
Access Memory ◽  
Integration Schemes ◽  
Front End

Abstract For SRAMs with high logic complexity, hard defects, design debug, and soft defects have to be tackled all at once early on in the technology development while innovative integration schemes in front-end of the line are being validated. This paper presents a case study of a high-complexity static random access memory (SRAM) used during a 32nm technology development phase. The case study addresses several novel and unrelated fail mechanisms on a product-like SRAM. Corrective actions were put in place for several process levels in the back-end of the line, the middle of the line, and the front-end of the line. These process changes were successfully verified by demonstrating a significant reduction of the Vmax and Vmin nest array block fallout, thus allowing the broader development team to continue improving random defectivity.

Human α-satellite DNAs are not susceptible to undercondensation after 5-azacytidine treatment

1994 ◽  
Vol 65 (1-2) ◽  
pp. 92-94 ◽  
Author(s):  
J.L Fernández ◽  
V. Goyanes ◽  
C. López-Femández ◽  
J. Gosálvez
Keyword(s):  
Alpha Satellite ◽  
Satellite Dnas

scholarly journals Meta-Deflectors Made of Dielectric Nanohole Arrays with Anti-Damage Potential

Photonics ◽  
2021 ◽  
Vol 8 (4) ◽  
pp. 107
Author(s):  
Haichao Yu ◽  
Feng Tang ◽  
Jingjun Wu ◽  
Zao Yi ◽  
Xin Ye ◽  
...  
Keyword(s):  
Electric Field ◽  
Electric Fields ◽  
Laser Cutting ◽  
High Complexity ◽  
Damage Potential ◽  
Optical Components ◽  
Nanohole Arrays ◽  
Intense Light ◽  
Polarization Of Light ◽  
Air Hole

In intense-light systems, the traditional discrete optical components lead to high complexity and high cost. Metasurfaces, which have received increasing attention due to the ability to locally manipulate the amplitude, phase, and polarization of light, are promising for addressing this issue. In the study, a metasurface-based reflective deflector is investigated which is composed of silicon nanohole arrays that confine the strongest electric field in the air zone. Subsequently, the in-air electric field does not interact with the silicon material directly, attenuating the optothermal effect that causes laser damage. The highest reflectance of nanoholes can be above 99% while the strongest electric fields are tuned into the air zone. One presentative deflector is designed based on these nanoholes with in-air-hole field confinement and anti-damage potential. The 1st order of the meta-deflector has the highest reflectance of 55.74%, and the reflectance sum of all the orders of the meta-deflector is 92.38%. The optothermal simulations show that the meta-deflector can theoretically handle a maximum laser density of 0.24 W/µm2. The study provides an approach to improving the anti-damage property of the reflective phase-control metasurfaces for intense-light systems, which can be exploited in many applications, such as laser scalpels, laser cutting devices, etc.

scholarly journals On the Root Causes of the Fukushima Daiichi Disaster from the Perspective of High Complexity and Tight Coupling in Large-Scale Systems

Symmetry ◽  
2021 ◽  
Vol 13 (3) ◽  
pp. 414
Author(s):  
Atsuo Murata ◽  
Waldemar Karwowski
Keyword(s):  
Nuclear Power ◽  
Power Plants ◽  
Large Scale ◽  
High Complexity ◽  
Tight Coupling ◽  
Large Scale Systems ◽  
Safety Issues ◽  
Loss Of Coolant ◽  
Station Blackout ◽  
Fukushima Daiichi

This study explores the root causes of the Fukushima Daiichi disaster and discusses how the complexity and tight coupling in large-scale systems should be reduced under emergencies such as station blackout (SBO) to prevent future disasters. First, on the basis of a summary of the published literature on the Fukushima Daiichi disaster, we found that the direct causes (i.e., malfunctions and problems) included overlooking the loss of coolant and the nuclear reactor’s failure to cool down. Second, we verified that two characteristics proposed in “normal accident” theory—high complexity and tight coupling—underlay each of the direct causes. These two characteristics were found to have made emergency management more challenging. We discuss how such disasters in large-scale systems with high complexity and tight coupling could be prevented through an organizational and managerial approach that can remove asymmetry of authority and information and foster a climate of openly discussing critical safety issues in nuclear power plants.

scholarly journals Towards efficient verification of population protocols

2021 ◽  
Author(s):  
Michael Blondin ◽  
Javier Esparza ◽  
Stefan Jaax ◽  
Philipp J. Meyer
Keyword(s):  
Linear Constraints ◽  
Computational Power ◽  
High Complexity ◽  
Reachability Problem ◽  
Population Protocols ◽  
Finite State ◽  
State Agents ◽  
Efficient Verification ◽  
Primitive Recursive ◽  
Very High

AbstractPopulation protocols are a well established model of computation by anonymous, identical finite-state agents. A protocol is well-specified if from every initial configuration, all fair executions of the protocol reach a common consensus. The central verification question for population protocols is the well-specification problem: deciding if a given protocol is well-specified. Esparza et al. have recently shown that this problem is decidable, but with very high complexity: it is at least as hard as the Petri net reachability problem, which is -hard, and for which only algorithms of non-primitive recursive complexity are currently known. In this paper we introduce the class $${ WS}^3$$ WS 3 of well-specified strongly-silent protocols and we prove that it is suitable for automatic verification. More precisely, we show that $${ WS}^3$$ WS 3 has the same computational power as general well-specified protocols, and captures standard protocols from the literature. Moreover, we show that the membership and correctness problems for $${ WS}^3$$ WS 3 reduce to solving boolean combinations of linear constraints over $${\mathbb {N}}$$ N . This allowed us to develop the first software able to automatically prove correctness for all of the infinitely many possible inputs.

scholarly journals Distinguishing Planting Structures of Different Complexity from UAV Multispectral Images

Sensors ◽  
2021 ◽  
Vol 21 (6) ◽  
pp. 1994
Author(s):  
Qian Ma ◽  
Wenting Han ◽  
Shenjin Huang ◽  
Shide Dong ◽  
Guang Li ◽  
...  
Keyword(s):  
Remote Sensing ◽  
Confusion Matrix ◽  
Object Oriented ◽  
Low Complexity ◽  
Classification Model ◽  
Recursive Feature Elimination ◽  
Support Vector ◽  
Multispectral Images ◽  
High Complexity ◽  
Structure Complexity

This study explores the classification potential of a multispectral classification model for farmland with planting structures of different complexity. Unmanned aerial vehicle (UAV) remote sensing technology is used to obtain multispectral images of three study areas with low-, medium-, and high-complexity planting structures, containing three, five, and eight types of crops, respectively. The feature subsets of three study areas are selected by recursive feature elimination (RFE). Object-oriented random forest (OB-RF) and object-oriented support vector machine (OB-SVM) classification models are established for the three study areas. After training the models with the feature subsets, the classification results are evaluated using a confusion matrix. The OB-RF and OB-SVM models’ classification accuracies are 97.09% and 99.13%, respectively, for the low-complexity planting structure. The equivalent values are 92.61% and 99.08% for the medium-complexity planting structure and 88.99% and 97.21% for the high-complexity planting structure. For farmland with fragmentary plots and a high-complexity planting structure, as the planting structure complexity changed from low to high, both models’ overall accuracy levels decreased. The overall accuracy of the OB-RF model decreased by 8.1%, and that of the OB-SVM model only decreased by 1.92%. OB-SVM achieves an overall classification accuracy of 97.21%, and a single-crop extraction accuracy of at least 85.65%. Therefore, UAV multispectral remote sensing can be used for classification applications in highly complex planting structures.

The Complexity of Model-Checking Tail-Recursive Higher-Order Fixpoint Logic

2021 ◽  
Vol 178 (1-2) ◽  
pp. 1-30
Author(s):  
Florian Bruse ◽  
Martin Lange ◽  
Etienne Lozes
Keyword(s):  
Model Checking ◽  
Lower Bounds ◽  
Expressive Power ◽  
Higher Order ◽  
Order Logic ◽  
High Complexity ◽  
Transition Systems ◽  
Recursive Formulas ◽  
Second Order Logic ◽  
Monadic Second Order Logic

Higher-Order Fixpoint Logic (HFL) is a modal specification language whose expressive power reaches far beyond that of Monadic Second-Order Logic, achieved through an incorporation of a typed λ-calculus into the modal μ-calculus. Its model checking problem on finite transition systems is decidable, albeit of high complexity, namely k-EXPTIME-complete for formulas that use functions of type order at most k < 0. In this paper we present a fragment with a presumably easier model checking problem. We show that so-called tail-recursive formulas of type order k can be model checked in (k − 1)-EXPSPACE, and also give matching lower bounds. This yields generic results for the complexity of bisimulation-invariant non-regular properties, as these can typically be defined in HFL.

Sign in / Sign up

Export Citation Format

Share Document