Image Milnor number and 𝒜e-codimension for maps between weighted homogeneous irreducible curves

2020 ◽  
Vol 20 (3) ◽  
pp. 319-330
Author(s):  
D. A. H. Ament ◽  
J. J. Nuño-Ballesteros ◽  
J. N. Tomazella
Keyword(s):  
Milnor Number ◽  
Versal Deformation ◽  
Minimum Number ◽  
Vanishing Cycles ◽  
One To One

AbstractLet (X, 0) ⊂ (ℂn, 0) be an irreducible weighted homogeneous singularity curve and let f : (X, 0) → (ℂ2, 0) be a finite map germ, one-to-one and weighted homogeneous with the same weights of (X, 0). We show that 𝒜e-codim(X, f) = μI(f), where the 𝒜e-codimension 𝒜e-codim(X, f) is the minimum number of parameters in a versal deformation and μI(f) is the image Milnor number, i.e. the number of vanishing cycles in the image of a stabilization of f.

scholarly journals Conjectures on Stably Newton Degenerate Singularities

2021 ◽  
Author(s):  
Jan Stevens
Keyword(s):  
Characteristic Zero ◽  
Arbitrary Number ◽  
Milnor Number ◽  
Plane Curves ◽  
Newton Diagram ◽  
Finite Characteristic ◽  
Vanishing Cycles

AbstractWe discuss a problem of Arnold, whether every function is stably equivalent to one which is non-degenerate for its Newton diagram. We argue that the answer is negative. We describe a method to make functions non-degenerate after stabilisation and give examples of singularities where this method does not work. We conjecture that they are in fact stably degenerate, that is not stably equivalent to non-degenerate functions.We review the various non-degeneracy concepts in the literature. For finite characteristic, we conjecture that there are no wild vanishing cycles for non-degenerate singularities. This implies that the simplest example of singularities with finite Milnor number, $$x^p+x^q$$ x p + x q in characteristic p, is not stably equivalent to a non-degenerate function. We argue that irreducible plane curves with an arbitrary number of Puiseux pairs (in characteristic zero) are stably non-degenerate. As the stabilisation involves many variables, it becomes very difficult to determine the Newton diagram in general, but the form of the equations indicates that the defining functions are non-degenerate.

Total Digraphs

1966 ◽  
Vol 9 (2) ◽  
pp. 171-176 ◽  
Author(s):  
Gary Chartrand ◽  
M. James Stewart
Keyword(s):  
Chromatic Number ◽  
Line Graph ◽  
Minimum Number ◽  
One To One ◽  
Point Line

The line - graph of an ordinary graph G is that graph whose points can be put in one-to-one correspondence with the lines of G in such a way that two points of are adjacent if and only if the corresponding lines of G are adjacent. This concept originated with Whitney [ 5 ], has the property that its (point) chromatic number equals the line chromatic number of G, where the point (line) chromatic number of graph is the minimum number of colors required to color the points (lines) of the graph such that adjacent points (lines) are colored differently.

scholarly journals Deficiency of forests

2017 ◽  
Vol 15 (1) ◽  
pp. 1431-1439 ◽  
Author(s):  
Sana Javed ◽  
Mujtaba Hussain ◽  
Ayesha Riasat ◽  
Salma Kanwal ◽  
Mariam Imtiaz ◽  
...  
Keyword(s):  
Minimum Number ◽  
One To One

Abstract An edge-magic total labeling of an (n,m)-graph G = (V,E) is a one to one map λ from V(G) ∪ E(G) onto the integers {1,2,…,n + m} with the property that there exists an integer constant c such that λ(x) + λ(y) + λ(xy) = c for any xy ∈ E(G). It is called super edge-magic total labeling if λ (V(G)) = {1,2,…,n}. Furthermore, if G has no super edge-magic total labeling, then the minimum number of vertices added to G to have a super edge-magic total labeling, called super edge-magic deficiency of a graph G, is denoted by μs(G) [4]. If such vertices do not exist, then deficiency of G will be + ∞. In this paper we study the super edge-magic total labeling and deficiency of forests comprising of combs, 2-sided generalized combs and bistar. The evidence provided by these facts supports the conjecture proposed by Figueroa-Centeno, Ichishima and Muntaner-Bartle [2].

Information capacity and bandwidth limitations in the SEM

1989 ◽  
Vol 47 ◽  
pp. 84-85
Author(s):  
D. C. Joy ◽  
R. D. Bunn
Keyword(s):  
Signal To Noise Ratio ◽  
Critical Dimension ◽  
Information Capacity ◽  
Acquisition Time ◽  
Signal To Noise ◽  
Sem Image ◽  
Probe Size ◽  
Minimum Number ◽  
Noise Ratio ◽  
Signal Channel

The information available from an SEM image is limited both by the inherent signal to noise ratio that characterizes the image and as a result of the transformations that it may undergo as it is passed through the amplifying circuits of the instrument. In applications such as Critical Dimension Metrology it is necessary to be able to quantify these limitations in order to be able to assess the likely precision of any measurement made with the microscope.The information capacity of an SEM signal, defined as the minimum number of bits needed to encode the output signal, depends on the signal to noise ratio of the image - which in turn depends on the probe size and source brightness and acquisition time per pixel - and on the efficiency of the specimen in producing the signal that is being observed. A detailed analysis of the secondary electron case shows that the information capacity C (bits/pixel) of the SEM signal channel could be written as :

A Support Program

1994 ◽  
Vol 25 (2) ◽  
pp. 112-114 ◽  
Author(s):  
Henna Grunblatt ◽  
Lisa Daar
Keyword(s):  
Hearing Aids ◽  
School Counselor ◽  
Support Program ◽  
Educational Audiology ◽  
Part Program ◽  
One To One

A program for providing information to children who are deaf about their deafness and addressing common concerns about deafness is detailed. Developed by a school audiologist and the school counselor, this two-part program is geared for children from 3 years to 15 years of age. The first part is an educational audiology program consisting of varied informational classes conducted by the audiologist. Five topics are addressed in this part of the program, including basic audiology, hearing aids, FM systems, audiograms, and student concerns. The second part of the program consists of individualized counseling. This involves both one-to-one counseling sessions between a student and the school counselor, as well as conjoint sessions conducted—with the student’s permission—by both the audiologist and the school counselor.

Applying Generalizability Theory to Optimize Analysis of Spontaneous Teacher Talk in Elementary Classrooms

2020 ◽  
Vol 63 (6) ◽  
pp. 1947-1957
Author(s):  
Alexandra Hollo ◽  
Johanna L. Staubitz ◽  
Jason C. Chow
Keyword(s):  
Special Education Teachers ◽  
Generalizability Theory ◽  
Child Outcomes ◽  
Elementary Classrooms ◽  
Teacher Talk ◽  
Group Instruction ◽  
Data Set ◽  
School Year ◽  
Minimum Number ◽  
Representative Samples

Purpose Although sampling teachers' child-directed speech in school settings is needed to understand the influence of linguistic input on child outcomes, empirical guidance for measurement procedures needed to obtain representative samples is lacking. To optimize resources needed to transcribe, code, and analyze classroom samples, this exploratory study assessed the minimum number and duration of samples needed for a reliable analysis of conventional and researcher-developed measures of teacher talk in elementary classrooms. Method This study applied fully crossed, Person (teacher) × Session (samples obtained on 3 separate occasions) generalizability studies to analyze an extant data set of three 10-min language samples provided by 28 general and special education teachers recorded during large-group instruction across the school year. Subsequently, a series of decision studies estimated of the number and duration of sessions needed to obtain the criterion g coefficient ( g > .70). Results The most stable variables were total number of words and mazes, requiring only a single 10-min sample, two 6-min samples, or three 3-min samples to reach criterion. No measured variables related to content or complexity were adequately stable regardless of number and duration of samples. Conclusions Generalizability studies confirmed that a large proportion of variance was attributable to individuals rather than the sampling occasion when analyzing the amount and fluency of spontaneous teacher talk. In general, conventionally reported outcomes were more stable than researcher-developed codes, which suggests some categories of teacher talk are more context dependent than others and thus require more intensive data collection to measure reliably.

Review of One to One: The Experience of Psychotherapy.

1989 ◽  
Vol 34 (10) ◽  
pp. 958-958
Author(s):  
No authorship indicated
Keyword(s):  
One To One

RGB Frequency Based Image Steganography

2020 ◽  
pp. 549-553
Author(s):  
Himanshu Kumar ◽  
Nitesh Kumar
Keyword(s):  
Image Steganography ◽  
Minimum Number

In this paper, we introduced a new RGB technique for image steganography. In this technique we introduced the idea of storing a different number of bits per channel (R, G or B) of a pixel based on the frequency of color values of pixel. The higher color frequency retains the maximum number of bits and lower color frequency stores the minimum number of bits.

On Number of Planes of Rearrangeably Nonblocking Optical Banyan Networks with Link Failures

2008 ◽  
Vol 1 (1) ◽  
pp. 43-54
Author(s):  
Basra Sultana ◽  
Mamun-ur-Rashid Khandker
Keyword(s):  
Optical Switching ◽  
Blocking Probability ◽  
Link Failure ◽  
Link Failures ◽  
Small Depth ◽  
Internal Link ◽  
Banyan Network ◽  
Minimum Number ◽  
Switch Design ◽  
Banyan Networks

Vertically stacked optical banyan (VSOB) networks are attractive for serving as optical switching systems due to the desirable properties (such as the small depth and self-routing capability) of banyan network structures. Although banyan-type networks result in severe blocking and crosstalk, both these problems can be minimized by using sufficient number of banyan planes in the VSOB network structure. The number of banyan planes is minimum for rearrangeably nonblocking and maximum for strictly nonblocking structure. Both results are available for VSOB networks when there exist no internal link-failures. Since the issue of link-failure is unavoidable, we intend to find the minimum number of planes required to make a VSOB network nonblocking when some links are broken or failed in the structure. This paper presents the approximate number of planes required to make a VSOB networks rearrangeably nonblocking allowing link-failures. We also show an interesting behavior of the  blocking  probability of a faulty VSOB networks that the blocking probability may not  always  increase monotonously with  the  increase  of  link-failures; blocking probability  decreases  for  certain range of  link-failures, and then increases again. We believe that such fluctuating behavior of blocking probability with the increase of link failure probability deserves special attention in switch design.  Keywords: Banyan networks; Blocking probability; Switching networks; Vertical stacking; Link-failures. © 2009 JSR Publications. ISSN: 2070-0237(Print); 2070-0245 (Online). All rights reserved. DOI: 10.3329/jsr.v1i1.1070

Sign in / Sign up

Export Citation Format

Share Document