On pairs of commuting nilpotent matrices

On pairs of commuting nilpotent matrices
On pairs of commuting nilpotent matrices

a r

X

i

v

:07

1

2

.

2

8

1

3

v

3

[

m

a

t h

.

A C

]

2

2

M

a

y

2

8

ON PAIRS OF COMMUTING NILPOTENT MATRICES TOMA ˇZ KO ˇSIR AND POLONA OBLAK Abstract.Let B be a nilpotent matrix and suppose that its Jordan canonical form is determined by a partition λ.Then it is known that its nilpotent commutator N B is an irreducible variety and that there is a unique partition μsuch that the intersection of the orbit of nilpotent matrices corresponding to μwith N B is dense in N B .We prove that map D given by D (λ)=μis an idempotent map.This answers a question of Basili and Iarrobino [9]and gives a partial answer to a question of Panyushev [18].In the proof,we use the fact that for a generic matrix A ∈N B the algebra generated by A and B is a Gorenstein algebra.Thus,a generic pair of commuting nilpotent matrices generates a Gorenstein algebra.We also describe D (λ)in terms of λif D (λ)has at most two parts.1.Introduction We denote by M n (F )the algebra of all n ×n matrices over an algebraically closed ?eld F and by N the variety of all nilpotent matrices in M n (F ).Let B ∈N be a nilpotent matrix and suppose that its Jordan canonical form is determined by a partition λ.We denote by O B =O λthe orbit of B under the GL n (F )action on N and by N B the nilpotent commutator of B ,i.e.the set of all A ∈N such that AB =BA .It is known that N B is an irreducible variety (see Basili [2]).So there is a unique partition μof n such that O μ∩N B is dense in N B .Following Basili and Iarrobino [9],and Panyushev [18]we de?ne a map on the set of all partitions of n by D (λ)=μ.(We note that in [3,9]this map is denoted by Q .)As in [18]we say that B or its orbit O λis self-large if D (λ)=λ.According to [3,9],a partition λis called stable if D (λ)=λ.The work presented in this paper was initially stimulated by a question if the partition D (λ)is stable,i.e.if D is an idempotent map,that was posed by Basili and Iarrobino in their conference notes [9].It was later brought to our attention that Panyushev in [18,Problem 2]stated the same question in a more general setup of simple Lie algebras.The general question in the theory of nilpotent orbits of semisimple Lie algebras is similar to the question described above.Suppose that g is a semisimple Lie algebra and G its adjoint group.If x ∈g is a nilpotent element and z g (x )its centralizer in g ,then there is

a unique maximal nilpotent G -orbit,say Gy ,meeting z g (x ).It was pointed out to us by a referee that the latter follows from the fact that the set N h of all nilpotent elements of an algebraic Lie algebra h is irreducible,which in turn can be deduced from the existence of the Levi decomposition and the irreducibility of N h in the reductive case,which was proved already by Kostant [10,§3].The question is then if the largest nilpotent orbit meeting z g (y )is Gy itself [18,Problem 2].A nilpotent orbit Gy is said to be self-large ,if

it is the largest nilpotent orbit meeting z g(y).Thus,the question is if the largest nilpotent

orbit meeting z g(x)is necessarily self-large.

Our main result is the proof of the fact that D is an idempotent map on nilpotent orbits

of M n(F).This answers the original question of Basili and Iarrobino and hence also a

special s l n case of Panyushev’s question.In the proof we use an extension of a lemma of

Baranovsky[1].We prove that a generic pair of commuting nilpotent matrices generates a

Gorenstein algebra(in fact,a complete intersection[5,Cor.21.20]).Moreover,a generic

matrix A∈N B and B generate a Gorenstein algebra.Then we use Macaulay’s Theorem

on the Hilbert function of the intersection of two plane curves[12](see also[8])together

with some results of[3]to prove that D is an idempotent.It appears that an answer to

the general question posed by Panyushev[18,Problem2]requires methods di?erent from

ours.We see no immediate generalization of our proof to the general setup of simple Lie

algebras.

It is an interesting question[18,Problem1]to describe D(λ)in terms of partitionλ. We would like to mention that some partial results to this question were obtained by the

second author in[14,15].The main result of[14](see also[4])gives the answer in the

case when D(λ)has at most two parts.We discuss this in the last section.

Panyushev’s work[18]was motivated by Premet’s results on the nilpotent commuting

variety[21]of a simple Lie algebra.For other results on special pairs of nilpotent com-

muting elements in these varieties see[6,17].Some of other references for the theory of

commuting varieties are[16,19,20,22,23].

This paper is an extension of our unpublished note[11].

2.Gorenstein pairs are dense

In this section we prove that a generic pair of commuting nilpotent matrices generates

a Gorenstein(local artinian)algebra.

Suppose that B∈N and that A∈N B.Then we denote by A=A(A,B)the unital subalgebra of M n(F)generated by matrices A and B,and by A T=A(A T,B T)the unital subalgebra generated by the transposed matrices A T and B T.The algebra A is a

commutative local artinian algebra.Such an algebra is Gorenstein if its socle Soc(A)is a

simple A-module(see[5,Prop.21.5]);i.e.,if dim F(Soc(A))=1,where Soc(A)=(0:m)

is the annihilator of the maximal ideal m of A.

We write N2?M n(F)×M n(F)for the variety of all commuting pairs of nilpotent

matrices.Note that the subset U?N2×F n×F n of all quadruples(A,B,v,w)such that v is a cyclic vector for(A,B)∈N2and w cyclic for(A T,B T)is an open subset.The fact that U is open follows since its complement is given by a set of polynomial conditions

det X=0and det Y=0,where X runs over all square matrices with columns of the form A i B j v and Y over all square matrices with the columns of the form A T i B T j w. Here it is certainly enough to take0≤i,j≤n?1.The same argument shows that also

U B={(A,v,w);(A,B,v,w)∈U}is an open subset of N B×F n×F n.

Lemma2.1.Suppose that(A,B)∈N2.Then there is a third nilpotent matrix C and

vectors v,w∈F n such that:

(i)C commutes with B,

(ii)any linear combinationαA+βC is nilpotent,

(iii)v is a cyclic vector for(C,B),

2

(iv)w is a cyclic vector for (C T ,B T ).

Proof.The proof is an extension of the proof of Baranovsky

[1,Lem.3].Let λ= λr 11,λr 22...,λr l l ,where λ1>λ1>···>λl >0and r i ≥1for all i be the partition corresponding to B .As in the proof of [1,Lem.3]there is a Jordan basis

{e ijk :1≤i ≤l,1≤j ≤r i ,1≤k ≤λi }

for B such that

(1)Be ijk =e ij,k +1if k <λi and Be ijλi =0,

(2)Ae ijk is in the linear span of vectors e fgh ,where either

?f >i and g,h arbitrary,or

?f =i and g >j and h arbitrary,or

?f =i and g =j and h >k .

To simplify our expressions we assume that e ijk =0if the three indices i,j,k do not satisfy the conditions 1≤i ≤l,1≤j ≤r i and 1≤k ≤λi .We also use the di?erence sequence of λ;we write δi =λi ?λi ?1for i =2,3...,l .Now we de?ne C by Ce ijk =e i,j +1,k if j

To illustrate the actions of B and C we include an example.We consider the case λ=(42,32,2,12).To indicate the actions of B and C we draw a directed graph whose vertices correspond to the vectors of the Jordan basis {e ijk }and the edges to the nonzero elements of B and C .In the graph in Figure 1the dashed directed edges correspond to

e 111

e 121Figure 1.

the action of matrix B and the nondashed ones correspond to the action of matrix C .Note that the graph indicating the action of B T and C T is obtained by reversing all the edges in the graph corresponding to B and C .Note that vector e 111is cyclic and vector e 124cocyclic,i.e.,cyclic for B T and C T .

Let us continue with the proof.It is easy to show that BC =CB ;we prove directly that BCe ijk =CBe ijk for all i,j,k .The property (ii)follows from (2)and the de?nition of C .

Next we show that e 111is a cyclic vector for (C,B )and e 1r 1λ1is a cyclic vector for

(C T ,B T ).We denote by A the unital subalgebra of M n (F )generated by B and C and by A T the unital subalgebra generated by the transposed matrices B T and C T .We show by induction on i that each e ijk is in the subspace A e 111.For i =1we have

3

e1jk=B k?1C j?1e111.We denote by W i the linear span of all vectors e tjk with t≤i. To prove the inductive step,we have to show that e i+1,j,k∈A W i.This follows since

e i+1,j,k?B k?1C j e i,r

i,1∈A W i.

Before we prove that e1r

1λ1is a cyclic vector for(C T,B T)observe that B T e ijk=e ij,k?1

and that C T e ijk=e i,j?1,k if j>1and C T e i1k=e i?1,r

i?1,k +e i+1,r

i+1,k?δi+1

.Again we

proceed to prove that e1r

1λ1

is cyclic by induction on i.

For i=1we have e1jk= B T λ1?k C T r1?j e1r1λ1.The inductive step follows since e i+1,j,k? B T λi?k C T r i?j e ir iλi∈A T W i. Proposition2.2.The subset U is dense in N2×F n×F n and the subset U B is dense in N B×F n×F n.

Proof.Consider a quadruple(A,B,v,w)∈N2×F n×F n.By Lemma2.1we can?nd a matrix C and vectors v′,w′such that(C,B,v′,w′)∈U.Then the a?ne line L of all the points(αA+α′C,B,αv+α′v′,αw+α′w′),whereα∈F is arbitrary andα′=1?α,has nonempty intersection with U.Hence L∩U is dense in L and(A,B,v,w)is in the closure of U.

The same argument shows that also U B is dense in N B×F n×F n. Next we give a proof of a known result which we could not?nd stated in the literature. Proposition2.3.A commutative subalgebra R of M n(F)is Gorenstein if both R and R T have a cyclic vector,i.e.,the action of R is cyclic and cocyclic.

Proof.By Lemma2.5,parts(1)and(2),of[13]the subalgebra R is cyclic if and only if F n and R are isomorphic as R-modules,and the subalgebra R T is cyclic if and only if F n and R T are isomorphic R-modules.Then our assumptions imply that R and its dual module are isomorphic R-modules,and thus R is Gorenstein by the de?nition[5,pp. 525-526]. We denote byπ:N2×F n×F n→N2andπB:N B×F n×F n→N B the projections to the?rst factor.Then,it follows by Proposition2.3thatπ(U)is the set of pairs(A,B) of nilpotent matrices such that the unital algebra A generated by A and B is Gorenstein of(vector space)dimension n.Moreover,such an A is a complete intersection since its embedding dimension is at most two[5,Cor.21.20].Similarly,πB(U B)is the set of all A∈N B such that A(A,B)is Gorenstein of dimension n.

As a consequence of Proposition2.2we obtain the main results of this section: Corollary2.4.The subsetπ(U)of those pairs in N2that generate a Gorenstein algebra of(vector space)dimension n is dense in N2.

Corollary2.5.The subsetπB(U B)is dense in N B.So,the unital subalgebra A generated by a nilpotent matrix B and a generic matrix A in N B is Gorenstein;moreover,it is a complete intersection.Equivalently,both A and A T have a cyclic vector,i.e.,the action of A is cyclic and cocyclic.

3.D is an idempotent map

A pair of commuting nilpotent matrices(A,B)generates a(unital)local artinian algebra A.We denote its maximal ideal by m.The associated graded algebra of A is

gr A=⊕k i=0m i/m i+1,

4

where m0=A and k is such that m k=0and m k+1=0.The Hilbert function H(A)of A is the sequence(h0,h1,...,h k),where

h i=dim F m i/m i+1.

We have k i=0h i=dim F A.If A is Gorenstein then h k=1.Furthermore,Macaulay’s Theorem on the Hilbert function of the intersection of two plane curves[12](see Iar-robino[7]or[8,p.23])says that the Hilbert function H(A)of an artinian local complete intersection of the embedding dimension at most2satis?es

H(A)=(1,2,...,d,h d,h d+1,...,h i,...,h k),

where h d?1=d≥h d≥h d+1≥...≥1and h i?1?h i≤1for all i=d,d+1,...,k and h k=1.

In the rest of the paper,we writeλ=(λ1,λ2,...,λl),whereλ1≥λ2≥···≥λl≥1. (Compare with the proof of Lemma2.1,where we used di?erent,’power type’,notation for parts of partitionλ.)We assume thatλj=0for j>l.

The set of all partitionsΛ(n)of n has a partial order given byλ?μif j i=1λi≤ j i=1μi for j=1,2,....To each partitionλwe associate its Ferrers diagram,a diagram withλi boxes in the i-th row.We denote byλ(H)the partition,which has the i-th part equal to the number of elements in the sequence H=(h1,h2,...,h k)such that h j≥i.

Example3.1.If H=(1,2,3,2,1)thenλ(H)=(5,3,1)and if H=(1,2,3,3,1)then λ(H)=(5,3,2).

Here we recall two results of Basili and Iarrobino[3]that we use in the proof below. They proved[3,Thm.2.21]that the Hilbert functions of the algebras A(A,B),A∈N B, determine D(λ):

(1)D(λ)=sup{λ(H(A));A=A(A,B),A∈N B,such that dim A=n}.

They also proved[3,Thm. 1.12]that if the parts in a partitionλdi?er by at least two thenλis stable,i.e.D(λ)=λ.

The following is the main result of our paper.

Theorem3.2.Assume that B is a nilpotent matrix andλthe corresponding partition. Then the partition D(λ)corresponding to the generic element A∈N B has decreasing parts di?ering by at least2and D(D(λ))=D(λ),i.e.D is idempotent.

Proof.Recall that D(λ)is given by(1).Corollary2.5implies that for a generic A∈N B the algebra A=A(A,B)is a complete intersection(therefore Gorenstein)of dimension n.Since N B is irreducible and since D(λ)is the partition corresponding to the generic A∈N B,it is enough to take in(1)the supremum over allλ(H(A)),where A is a complete intersection.The above stated Macaulay’s Theorem on the Hilbert function of the intersection of two plane curves then implies that the parts in D(λ)di?er by at least two.By[3,Thm.1.12]or[9,Cor1.5]it follows that D(D(λ))=D(λ).

4.Description of D(λ)when it has at most two parts

A partitionλis called a almost rectangular if the largest and the smallest part of λdi?er by at most one.(Note that in[3]the term string is used for almost rectangular partition.)We denote by r

B or rλthe smallest number r such thatλis a union of r almost

5

rectangular partitions.(Here B is a nilpotent matrix such that its Jordan canonical form is determined byλ.)Basili[2,Prop.2.4]proved that a generic A∈N B has rank n?r B, which is maximal possible in N B and that D(λ)has r B parts.

Example4.1.For instance,ifλ=(4,3,2,1)andμ=(7,7,6,4,4,3,2)then rλ=2and rμ=3.

It is an interesting and important question to describe D(λ)in terms ofλ(see[18,§3], in particular[18,Problem1]).Using[14,Thm.13]and[4,Cor.3.29]it is easy to answer this question when D(λ)has at most two parts,i. e.when r B≤2.Here we would like to remark that the proofs of Lemma11and Theorems12and13in[14]hold over any ?eld of characteristic0,while Basili and Iarrobino assume in[4]that the underlying?eld is algebraically closed of arbitrary characteristic.

Now,if r B=1then D(λ)=(n).If r B=2then it is enough to know the maximal index of nilpotency of an element of N B to describe D(λ),since D(λ)is the maximal partition among those corresponding to elements A∈N B[3,Lem.1.6].Applying the description of the maximal index of nilpotency given in[14,Thm.13]and[4,Cor.3.29],we have the following result.

Theorem4.2.Ifλ=(λ1,λ2,...,λl),λ1≥λ2≥...≥λl≥1is such that rλ=2then D(λ)=(iλ,n?iλ),where iλis the maximal index of nilpotency in N B given by iλ=max

{2(i?1)+λi+λi+1+...+λi+r;λi?λi+r≤1,λi?1≥2if i>1}.

1≤i

Example4.3.Suppose thatλ=(4,4,3,3,2)andμ=(5,5,3,3,2).Then we have D(λ)= (14,2)and D(μ)=(12,6).

Acknowledgement

The authors would like to thank Anthony Iarrobino for stimulating comments that improved the quality of the paper.We would also like to thank him and Roberta Basili for sharing with us early versions of their papers.We acknowledge?nancial support of the Research Agency of the Republic of Slovenia.

References

[1]V.Baranovsky.The variety of pairs of commuting nilpotent matrices is irreducible.Transform.

Groups6(2001),No.1,3–8.

[2]R.Basili.On the irreducibility of commuting varieties of nilpotent matrices.J.Algebra268

(2003),No.1,58–80.

[3]R.Basili and A.Iarrobino.Pairs of commuting nilpotent matrices,and Hilbert function.In

press,J.Algebra(2008),doi:10.1016/j.jalgebra.2008.03.006

[4]R.Basili and A.Iarrobino.An involution on N B,the nilpotent commutator of a nilpotent

Jordan matrix B.Preprint,Aug.2007.

[5]https://www.360docs.net/doc/718260376.html,mutative Algebra.With a View toward Algebraic Geometry.Springer-Verlag,

Berlin,New York,1995.

[6]V.Ginzburg.Principal nilpotent pairs in a semisimple Lie algebra1.Invent.Math.140(2000),

511–561.

[7]A.Iarrobino.Punctual Hilbert scheme.Memoirs Amer.Math.Soc.10(1977),No.188.

[8]A.Iarrobino.Associated graded algebra of a Gorenstein Artin algebra.Memoirs Amer.Math.

Soc.107(1994),No.514.

6

[9]A.Iarrobino jointly with R.Basili.Pairs of commuting nilpotent matrices and Hilbert func-

tions.Extended notes from a talk at the workshop”Algebraic Combinatorics Meets Inverse

Systems”,Montr′e al,Jan.19–21,2007.

[10]B.Kostant.Lie group representations on polynomial rings.Amer.J.Math.85(1963),327–

404.

[11]T.Koˇs ir and P.Oblak.Note on commuting pairs of nilpotent matrices.Preprint,Feb.2007.

[12]F.H.S.Macaulay.On a method for dealing with intersections of plane curves.Trans.Amer.

Math.Soc.5(1904),385–410.

[13]M.G.Neubauer and D.J.Saltman.Two-generated commutative subalgebras of M n(F).J.

Algebra164(1994),545–562.

[14]P.Oblak.The upper bound for the index of nilpotency for a matrix commuting with a given

nilpotent matrix.Lin.Multilin.Alg.,forthcoming articles,doi:10.1080/03081080701571083.

(See also slightly revised version with more examples on arXiv:math[math.AC:0701561]at

https://www.360docs.net/doc/718260376.html,.)

[15]P.Oblak.Jordan forms for mutually annihilating nilpotent pairs.Linear Algebra Appl.428

(2008),1476–1491.

[16]D.I.Panyushev.The Jacobian module of a representation of a Lie algebra and geometry of

commuting https://www.360docs.net/doc/718260376.html,positio Math.94(1994),181–199.

[17]D.I.Panyushev.Nilpotent pairs,dual pairs,and sheets.J.Algebra240(2001),635–664.

[18]D.I.Panyushev.Two results on centralisers of nilpotent elements.J.Pure Appl.Algebra212

(2008),774–779.

[19]D.I.Panyushev and O.Yakimova.Symmetric pairs and associated commuting varieties.Math.

Proc.Camb.Phil.Soc.143(2007),307–321.

[20]V.L.Popov.Irregular and singular loci of commuting varieties,in press,Transformation

Groups13(2008),Nos.3-4,the special issue commemorating Kostant’s80th birthday.

[21]A.Premet.Nilpotent commuting varieties of reductive Lie algebras.Invent.Math.154(2003),

653–683.

[22]https://www.360docs.net/doc/718260376.html,muting varieties of semisimple Lie algebras and algebraic https://www.360docs.net/doc/718260376.html,-

positio Math.38(1979),311–327.

[23]W.V.Vasconcelos.Arithmetic of Blowup Algebras.Cambridge Univ.Press,London Math.

Soc.Lect.Note Ser.195,1994.

T.Koˇs ir:Department of Mathematics,F aculty of Mathematics and Physics,University of Ljubljana,Jadranska19,SI-1000Ljubljana,Slovenia;e-mail:tomaz.kosir@fmf.uni-lj.si.

P.Oblak:Department of Mathematics,Institute of Mathematics,Physics,and Mechanics, Jadranska19,SI-1000Ljubljana,Slovenia;e-mail:polona.oblak@fmf.uni-lj.si.

Current address:University of Ljubljana,F aculty of Computer and Information Science, Trˇz aˇs ka cesta25,SI-1001Ljubljana,Slovenia.

7

on the contrary的解析

On the contrary Onthecontrary, I have not yet begun. 正好相反,我还没有开始。 https://www.360docs.net/doc/718260376.html, Onthecontrary, the instructions have been damaged. 反之,则说明已经损坏。 https://www.360docs.net/doc/718260376.html, Onthecontrary, I understand all too well. 恰恰相反,我很清楚 https://www.360docs.net/doc/718260376.html, Onthecontrary, I think this is good. ⑴我反而觉得这是好事。 https://www.360docs.net/doc/718260376.html, Onthecontrary, I have tons of things to do 正相反,我有一大堆事要做 Provided by jukuu Is likely onthecontrary I in works for you 反倒像是我在为你们工作 https://www.360docs.net/doc/718260376.html, Onthecontrary, or to buy the first good. 反之还是先买的好。 https://www.360docs.net/doc/718260376.html, Onthecontrary, it is typically american. 相反,这正是典型的美国风格。 222.35.143.196 Onthecontrary, very exciting.

恰恰相反,非常刺激。 https://www.360docs.net/doc/718260376.html, But onthecontrary, lazy. 却恰恰相反,懒洋洋的。 https://www.360docs.net/doc/718260376.html, Onthecontrary, I hate it! 恰恰相反,我不喜欢! https://www.360docs.net/doc/718260376.html, Onthecontrary, the club gathers every month. 相反,俱乐部每个月都聚会。 https://www.360docs.net/doc/718260376.html, Onthecontrary, I'm going to work harder. 我反而将更努力工作。 https://www.360docs.net/doc/718260376.html, Onthecontrary, his demeanor is easy and nonchalant. 相反,他的举止轻松而无动于衷。 https://www.360docs.net/doc/718260376.html, Too much nutrition onthecontrary can not be absorbed through skin. 太过营养了反而皮肤吸收不了. https://www.360docs.net/doc/718260376.html, Onthecontrary, I would wish for it no other way. 正相反,我正希望这样 Provided by jukuu Onthecontrary most likely pathological. 反之很有可能是病理性的。 https://www.360docs.net/doc/718260376.html, Onthecontrary, it will appear clumsy. 反之,就会显得粗笨。 https://www.360docs.net/doc/718260376.html,

图片与字节数组相互转换的方法

图片与字节数组相互转换的方法 图片与字节数组相互转换的方法 aspx.cs   using System;using System.IO; using System.Drawing; using System.Drawing.Imaging;public partial class _2Stream : System.Web.UI.Page { protected void Page_Load(object sender, EventArgs e) {}protected void FileToStream(object sender, EventArgs e) { //将JPG图片转化成字节数组 Image image = Image.FromFile("E:/1.jpg"); //或者使用Server.MapPath MemoryStream ms =

new MemoryStream(); image.Save(ms, ImageFormat.Jpeg); ms.Flush(); ms.Seek(0, SeekOrigin.Begin); byte[] buffer = new byte[ms.Length]; ms.Read(buffer, 0, (int)ms.Length);//遍历字节数组 for (int i = 0; i < buffer.LongLength; i++) { message.Text += buffer[i].ToString(); }//将字节数组转化成图像文件(自定义格式)并保存MemoryStream ms2 = new MemoryStream(buffer, 0, buffer.Length); ms2.Seek(0, SeekOrigin.Begin); Image image2 = Image.FromStream(ms2); image2.Save("E:\\2.gif", ImageFormat.Gif);

幼儿园大班语言教学案例

幼儿园大班语言教学案例《好饿的毛毛虫》 永清县养马庄中心小学王艳苓 教学目标: 1、引导幼儿感悟故事创意,获得阅读快乐,产生持续阅读的愿望,培养自主阅读能力。 2、引导幼儿尝试用图表的方式表达、迁移自己对作品的理解和想象,建立初步的读和写的信心,培养幼儿的书面表达能力。 活动准备: 1、故事录音《好饿的毛毛虫》。 2、毛毛虫吃过的实物图片一套,色彩标志与数字卡片一套。 3、《幼儿习得手册》下学期2册2——3页》。 活动一:多重阅读,初步认识作品 活动过程: 一、引题 (出示小毛毛虫图片)小朋友看,这是谁?(毛毛虫) 这只毛毛虫又瘦又小,它是一直好饿好饿的毛毛虫。小毛毛虫饿了,它会自己找吃的吗?它会吃什么?吃多少呢?小朋友们想不想知道呀? 二、猜想故事内容 幼儿翻看《幼儿习得手册》,提醒幼儿从前往后仔细观察画面,猜猜故事内容。S三、幼儿讨论故事内容 幼儿自由结组,和同伴一起看图,讨论故事内容。 三、集体阅读 老师引导幼儿仔细观察画面,图上画了什么?会是什么意思呢?是这样吗? 四、听故事录音 小朋友听故事录音,提醒幼儿边听边指相应的画面。 五、找对应画面 幼儿听故事指相对应画面。 六、讲故事 和幼儿一起看书,完整的讲一遍故事。 活动二理解作品,感悟故事创意 一、幼儿讲故事 请两名幼儿边指点画面,边讲故事内容。 二、分组讨论 讨论:从这个故事中,你发现了什么,或者认识了什么,学到了什么。老师参与到幼儿的讨论中去,倾听、鼓励、启发、指导。提醒幼儿把大家的发现及时地用图片或符号的形式记录下来。 三、集体讨论 各组代表发言,其他幼儿补充。同时,老师将幼儿发现按不同的线索,同于表的形式加以概括:1、从时间上说,故事从一个星期开始,到下一个星期日,又过了些天。 老师将故事发生的时间按顺序从上到下排成一列。 2、小毛毛虫的成长过程:一个小小的“蛋”——又小又饿的毛毛虫_-------………又肥又大的毛毛虫——茧——一只漂亮的蝴蝶。 老师可让一名幼儿到前面来,把相关的小图片按毛毛虫从小到大的顺序,从上到下对应

英语造句

一般过去式 时间状语:yesterday just now (刚刚) the day before three days ag0 a week ago in 1880 last month last year 1. I was in the classroom yesterday. I was not in the classroom yesterday. Were you in the classroom yesterday. 2. They went to see the film the day before. Did they go to see the film the day before. They did go to see the film the day before. 3. The man beat his wife yesterday. The man didn’t beat his wife yesterday. 4. I was a high student three years ago. 5. She became a teacher in 2009. 6. They began to study english a week ago 7. My mother brought a book from Canada last year. 8.My parents build a house to me four years ago . 9.He was husband ago. She was a cooker last mouth. My father was in the Xinjiang half a year ago. 10.My grandfather was a famer six years ago. 11.He burned in 1991

java整型数与网络字节序的 byte[] 数组转换关系

java整型数与网络字节序的byte[] 数组转换关系 工作项目需要在java和c/c++之间进行socket通信,socket通信是以字节流或者字节包进行的,socket发送方须将数据转换为字节流或者字节包,而接收方则将字节流和字节包再转换回相应的数据类型。如果发送方和接收方都是同种语言,则一般只涉及到字节序的调整。而对于java和c/c++的通信,则情况就要复杂一些,主要是因为java中没有unsigned类型,并且java和c在某些数据类型上的长度不一致。 本文就是针对这种情况,整理了java数据类型和网络字节流或字节包(相当于java的byte 数组)之间转换方法。实际上网上这方面的资料不少,但往往不全,甚至有些有错误,于是就花了点时间对java整型数和网络字节序的byte[]之间转换的各种情况做了一些验证和整理。整理出来的函数如下: public class ByteConvert { // 以下是整型数和网络字节序的byte[] 数组之间的转换 public static byte[] longToBytes(long n) { byte[] b = new byte[8]; b[7] = (byte) (n & 0xff); b[6] = (byte) (n >> 8 & 0xff); b[5] = (byte) (n >> 16 & 0xff); b[4] = (byte) (n >> 24 & 0xff); b[3] = (byte) (n >> 32 & 0xff); b[2] = (byte) (n >> 40 & 0xff); b[1] = (byte) (n >> 48 & 0xff); b[0] = (byte) (n >> 56 & 0xff); return b; } public static void longT oBytes( long n, byte[] array, int offset ){ array[7+offset] = (byte) (n & 0xff); array[6+offset] = (byte) (n >> 8 & 0xff); array[5+offset] = (byte) (n >> 16 & 0xff); array[4+offset] = (byte) (n >> 24 & 0xff); array[3+offset] = (byte) (n >> 32 & 0xff); array[2+offset] = (byte) (n >> 40 & 0xff); array[1+offset] = (byte) (n >> 48 & 0xff); array[0+offset] = (byte) (n >> 56 & 0xff); } public static long bytesToLong( byte[] array ) { return ((((long) array[ 0] & 0xff) << 56) | (((long) array[ 1] & 0xff) << 48)

幼儿园大班绘本教案:你是特别的 你是最好的

活动名称:诗歌:你是最好的活动目标: 1、欣赏诗歌,理解诗歌内容,学习用轻松和有力的语言有表情地朗读诗歌。 2、感知诗歌画面,结合自己的生活经验,尝试用“ⅹⅹⅹ没关系”的句型方便诗歌。 3、积极参与游戏,乐意在集体面前大胆地讲述自己的长处,增强自信心。活动准备: 1、幼儿用书人手一册,实物展示仪一台。 2、幼儿对自己有一定的认识,知道自己的长处。活动过程: 一、击鼓传花:我喜欢我自己,…… 1、教师:你喜欢你自己吗?你能用“我喜欢我自己,……”讲述喜欢自己的理由。 2、介绍游戏规则:大家击鼓传花,当鼓声停止时,红花就在谁的上,谁就在集体面前用“我喜欢我自己,……”的句型夸奖自己的长处,然后继续听鼓声传花。 3、游戏2~3遍。 二、欣赏诗歌,初步理解故事内容。 1、教师:我们每个小朋友都喜欢自己,因为我们每个小朋友都是最好的,虽然有一点小问题,但是没关系。下面。老师给小朋友念一首诗歌《你是最好的》 2、教师有感情地朗诵诗歌。 3、教师:你听见诗歌里说了什么? 三、展示诗歌画面,学习朗诵诗歌,并通过提问,感知理解诗歌。 1、引导幼儿观察幼儿用书诗歌画面,并请幼儿有表情地朗诵诗歌。 2、带领幼儿看图学习朗诵诗歌。 3、提问:为什么掉了一颗牙没关系?为什么个子太小了也没关系? 4、教师:在我们说没关系的时候,我们可以用怎样的声音朗诵? 5、教师带领幼儿有表情的朗诵诗歌。 四、采用多种方式念儿歌。 1、幼儿念诗歌的前四句,教师念最后一句。 2、请8为幼儿上台来,依次轮流念一句“没关系”全体幼儿念每段的最后一句。 五、启发幼儿想象并仿编诗歌。 1、教师:你觉得还有什么事没关系? 2、教师整理幼儿的讲述,并抓住诗歌里面的关键词,在黑板上画出简笔画。 3、引导幼儿看图标有表情的朗诵新的诗歌《你是最好的》。 活动反思:击鼓传花这个游戏很适合幼儿,活动中幼儿很积极、开心,特别是在说“我喜欢我自己,……”这句话,很多幼儿充满了自信。 “你是特别的,你是最好的”,这句话说起来很简单,但对于大班的孩子来说真的是那么自信,还是连他们自己都不知道呢?简单的几幅画面,孩子们解读出的却很多。每一幅让我们期待,而读完又若有所思。笑中思索,思索后讨论,不同于以前的画册。每个孩子都能用自己的方式认识自身、认识世界。缺少了自信和个性,都是很令人遗憾的事情,而读完这首诗歌,我觉得对于我来说也有一定的意义,真希望平时每个人(包括孩子、保育员、老师等)时刻都能充满自信。在提问“为什么掉了一颗牙没关系?为什么个子太小了也没关系?”等问题时,很多幼儿很不能理解,后来经过一番解释后幼儿方才有点懂。

C#数组、字节数组、转换等

C#数组、字节数组、转换等 在System名称空间里面有许多跟Array操作相关的类。其中System.Array 类里面就提供了以下常用的方法: BinarySearch: 使用二进制搜索算法在一维的排序Array中搜索值。 Copy: 将一个Array的一部分元素复制到另一个Array中,并根据需要执行类型强制转换和装箱。 CopyTo: 将当前一维Array的所有元素复制到指定的一维Array中。 Resize: 将数组的大小更改为指定的新大小。 Sort: 对一维Array对象中的元素进行排序。 与大多数类不同,Array提供CreateInstance方法,以便允许后期绑定访问,而不是提供公共构造函数。 Array.Copy方法不仅可在同一类型的数组之间复制元素,而且可在不同类型的标准数组之间复制元素;它会自动处理强制类型转换。有些方法,如CreateInstance、Copy、CopyTo、GetValue和SetValue,提供重载(接受64位整数作为参数),以适应大容量数组。LongLength和GetLongLength返回指示数组长度的64位整数。在执行需要对Array进行排序的操作(如BinarySearch)之前,必须对Array进行排序。

ArrayList跟Array不同,前者是集合对象,ArrayList的ToArray方法可以直接将ArrayList里面的全部元素导出到一个数组里,而不需用循环逐个元素地复制到一个数组。 ToArray的使用方法如下: ArrayList ay = new ArrayList(); ay.Add("sheep"); ay.Add("cat"); ay.Add("dog"); string[] al= (string[])ay.ToArray(typeof(string)); Console.WriteLine(al[0]); 关键的地方在于ToArray的参数,这里应该用反射中的typeof获取arraylist 里面元素的原始数据类型。 在数组中有一种比较特殊的: 字节数组,即byte[]。内存、文件中的数据都是以字节数组的形式储存的,如果程序需要对数据进行操作的话,或多或少都会使用到byte[]。 对于byte[]跟其他类型的相互转换问题,在C++中,使用Memorycopy函数即可完成,虽然在C#里面也有类似MemoryCopy的函数: Buffer.BlockCopy,但由于强类型的特性,在C#里它并实现不了字节数组跟其他类型转换的功能。 为了解决这个问题,需要手工写将其他类型的数据通过位运算和逻辑运算而得到字节数组。如下面的代码: //整型转换为字节数组 int i = ; //对应的十六进制是:0012D687

幼儿园大班绘本教案

幼儿园大班绘本教案:你是特别的你是最好的 活动目标: 1、欣赏诗歌,理解诗歌内容,学习用轻松和有力的语言有表情地朗读诗歌。 2、感知诗歌画面,结合自己的生活经验,尝试用“ⅹⅹⅹ没关系”的句型方便诗歌。 3、积极参与游戏,乐意在集体面前大胆地讲述自己的长处,增强自信心。 活动准备: 1、幼儿用书人手一册,实物展示仪一台。 2、幼儿对自己有一定的认识,知道自己的长处。 活动过程: 一、击鼓传花:我喜欢我自己,…… 1、教师:你喜欢你自己吗?你能用“我喜欢我自己,……”讲述喜欢自己的理由。 2、介绍游戏规则:大家击鼓传花,当鼓声停止时,红花就在谁的上,谁就在集体面前用“我喜欢我自己,……”的句型夸奖自己的长处,然后继续听鼓声传花。 3、游戏2~3遍。 二、欣赏诗歌,初步理解故事内容。 1、教师:我们每个小朋友都喜欢自己,因为我们每个小朋友都是最好的,虽然有一点小问题,但是没关系。下面。老师给小朋友念一首诗歌《你是最好的》 2、教师有感情地朗诵诗歌。 3、教师:你听见诗歌里说了什么? 三、展示诗歌画面,学习朗诵诗歌,并通过提问,感知理解诗歌。 1、引导幼儿观察幼儿用书诗歌画面,并请幼儿有表情地朗诵诗歌。 2、带领幼儿看图学习朗诵诗歌。 3、提问:为什么掉了一颗牙没关系?为什么个子太小了也没关系? 4、教师:在我们说没关系的时候,我们可以用怎样的声音朗诵? 5、教师带领幼儿有表情的朗诵诗歌。 四、采用多种方式念儿歌。 1、幼儿念诗歌的前四句,教师念最后一句。

2、请8为幼儿上台来,依次轮流念一句“没关系”全体幼儿念每段的最后一句。 五、启发幼儿想象并仿编诗歌。 1、教师:你觉得还有什么事没关系? 引导幼儿把它画下来,并仿编一句诗句。 2、教师整理幼儿的讲述,并抓住诗歌里面的关键词,在黑板上画出简笔画。 3、引导幼儿看图标有表情的朗诵新的诗歌《你是最好的》。 活动反思: 击鼓传花这个游戏很适合幼儿,活动中幼儿很积极、开心,特别是在说“我喜欢我自己,……”这句话,很多幼儿充满了自信。 “你是特别的,你是最好的”,这句话说起来很简单,但对于大班的孩子来说真的是那么自信,还是连他们自己都不知道呢?简单的几幅画面,孩子们解读出的却很多。每一幅让我们期待,而读完又若有所思。笑中思索,思索后讨论,不同于以前的画册。每个孩子都能用自己的方式认识自身、认识世界。缺少了自信和个性,都是很令人遗憾的事情,而读完这首诗歌,我觉得对于我来说也有一定的意义,真希望平时每个人(包括孩子、保育员、老师等)时刻都能充满自信。在提问“为什么掉了一颗牙没关系?为什么个子太小了也没关系?”等问题时,很多幼儿很不能理解,后来经过一番解释后幼儿方才有点懂。 大班语言:你是特别的,你是最好的 活动目标: 1、感知诗歌画面内容,尝试用语言和图画大胆的表达表现。 2、用自我欣赏的眼光,发现自己与众不同,分享自己的特别之处。 活动准备: 1、自制《我的书》诗歌ppt 3、视频笔和纸音乐 设计思路: 《纲要》中指出:要建构后继学习及终身发展的基础,培养好奇探究,勇敢自信的面向21世纪的儿童。结合大班幼儿的年龄特点,我选择了《你是特别的,你是最好的》这个绘本,意在透过言简意赅的文字与生动的图画,让孩子学会用自

学生造句--Unit 1

●I wonder if it’s because I have been at school for so long that I’ve grown so crazy about going home. ●It is because she wasn’t well that she fell far behind her classmates this semester. ●I can well remember that there was a time when I took it for granted that friends should do everything for me. ●In order to make a difference to society, they spent almost all of their spare time in raising money for the charity. ●It’s no pleasure eating at school any longer because the food is not so tasty as that at home. ●He happened to be hit by a new idea when he was walking along the riverbank. ●I wonder if I can cope with stressful situations in life independently. ●It is because I take things for granted that I make so many mistakes. ●The treasure is so rare that a growing number of people are looking for it. ●He picks on the weak mn in order that we may pay attention to him. ●It’s no pleasure being disturbed whena I settle down to my work. ●I can well remember that when I was a child, I always made mistakes on purpose for fun. ●It’s no pleasure accompany her hanging out on the street on such a rainy day. ●I can well remember that there was a time when I threw my whole self into study in order to live up to my parents’ expectation and enter my dream university. ●I can well remember that she stuck with me all the time and helped me regain my confidence during my tough time five years ago. ●It is because he makes it a priority to study that he always gets good grades. ●I wonder if we should abandon this idea because there is no point in doing so. ●I wonder if it was because I ate ice-cream that I had an upset student this morning. ●It is because she refused to die that she became incredibly successful. ●She is so considerate that many of us turn to her for comfort. ●I can well remember that once I underestimated the power of words and hurt my friend. ●He works extremely hard in order to live up to his expectations. ●I happened to see a butterfly settle on the beautiful flower. ●It’s no pleasure making fun of others. ●It was the first time in the new semester that I had burned the midnight oil to study. ●It’s no pleasure taking everything into account when you long to have the relaxing life. ●I wonder if it was because he abandoned himself to despair that he was killed in a car accident when he was driving. ●Jack is always picking on younger children in order to show off his power. ●It is because he always burns the midnight oil that he oversleeps sometimes. ●I happened to find some pictures to do with my grandfather when I was going through the drawer. ●It was because I didn’t dare look at the failure face to face that I failed again. ●I tell my friend that failure is not scary in order that she can rebound from failure. ●I throw my whole self to study in order to pass the final exam. ●It was the first time that I had made a speech in public and enjoyed the thunder of applause. ●Alice happened to be on the street when a UFO landed right in front of her. ●It was the first time that I had kept myself open and talked sincerely with my parents. ●It was a beautiful sunny day. The weather was so comfortable that I settled myself into the

byte数组转化成16进制字符串用法分析

byte数组转化成16进制字符串,C#中的overload,overwrite,override的区别 C++ 实现Single Sever Simulation AFNetworking 更改请求时间iOS chrome插件,二维码自动生成,C编程方式进行控制台输入 maven jar shade assembly配置[XML] Maven pom.xml public: double angle; QPen ang_info_pen; }; #endif [文件] MainWindow.cpp ~ 28KB [文件] MainWindow.h ~ 3KB //AngularJS 绑定鼠标左键、右键单击事件 //API权限设计总结系统sign验证规则 //Apriopri算法的简单实现 #ifndef __MAINWINDOW_H__ #define __MAINWINDOW_H__ #include "ui_MainWindow.h" #include "Shape.h" #include class CDockWin; class CDrawWin:public QMainWindow, public Ui_Mainwin { Q_OBJECT public: CDrawWin(QWidget *parent = NULL); // 画图状态定义 enum DRAW_STATUS{ // 无画图状态 DRAW_STATUS_NONE = 0, // 绘画当中 DRAW_STATUS_DRAWING, // 移动 DRAW_STATUS_DRAG, // 改变图元 DRAW_STATUS_CHANGE }; // 当前的菜单选择 enum MENU_STATUS{

幼儿园大班绘本故事教案

幼儿园大班绘本故事教 案 -CAL-FENGHAI-(2020YEAR-YICAI)_JINGBIAN

幼儿园大班绘本故事教案:老鼠娶新娘 活动目标: 1.理解故事内容,知道故事含义,明白任何事务、人物都不是完美的,是有缺点的。 2.喜欢自己的长处和别人的长处,承认自己的短处,学习取长补短。 3.体验婚嫁带来的喜悦气氛和抬轿子游戏带来的乐趣。 活动准备: 1.欢庆音乐一段。 2.《老鼠娶新娘》系列图画。 3.故事背景音乐一段。 4.汉字卡片:太阳------照;乌云------遮;风------吹;高墙------挡;老鼠--------打洞;猫-------抓; 取长补短 活动过程: 1、导入: (1)今天,我给大家带来了一段音乐,你来听听看在这段音乐里人们会在做些什么事? 幼儿讨论(高兴的事、结婚)都是高兴的事情,今天老鼠村也发生了一件高兴的事情! (2)_出示图片:花轿 提问:什么时候会坐轿子?今天老鼠美叮当也坐上欧陆花轿,当了新娘。 2、老鼠娶新娘 (1)美叮当要出嫁了,她要找一个世界上最强的新郎(出示循环图)她找到了太阳、云、风、高墙、老鼠小阿郎、猫。你们觉得他们中间谁是最强大的新郎呢为什么 (2)美叮当到底会嫁给谁呢?我们来听听故事。 讲故事(边讲边演示图片,故事背景音乐轻轻响起) 提问:你觉得在这个故事里谁是最强的新郎呢他有什么本领幼儿讲到谁就出示子卡。 小结:他们都有自己最强的地方,分别是……,但是没有人是最强的。

3.最强的你: 小朋友你们有最强的地方吗我们把最强的地方叫做长处,你知道自己的长处是什么吗每个人都有长处,有长处,可真好,因为长处会让我们很棒。 4.不强的你: 每个人都有自己最强的地方,但每个人也有不够强的地方,我们把不强的地方叫做短处,你知道你的短处是什么吗?请2—3个幼儿回答。你们能够知道自己的短处,真好,因为只有发现自己的不足,才能够进步! 5.朋友圈: 我们都有长处和短处,今天老师带你们来玩一个朋友圈的游戏(用你的长处去帮助别人,你的短处请别人来帮助你,这就是取长补短)出示子卡。 小结:每个人都有自己的长处和短处,当我们取长补短,互相帮助时,就会变得很强大。 6.美叮当的新郎。 世界上没有最强的人,那美叮当到底该找谁当新郎呢(可提示:找不到最强的,但可以找最喜欢的,谁最喜欢她呢)美叮当嫁给了老鼠小阿郎,他们结婚了!看图片(结婚音乐起) 7.游戏:《抬花轿》 美叮当坐着花轿结婚了,我们也来玩抬花轿的游戏。 游戏开始:选一个女孩子来当新娘,新娘抛绣球选新郎!请2个男生来抬花轿,迎亲队伍出发了! 推荐理由:我推荐此活动的理由是: 1、有效提问,让孩子正确的评价自己的能力和客观困难。 自信是确立自己能力,有把握去完成所承担的任务,敢于追求目标的情感体验。《老鼠娶新娘》,原本是一个带有浓浓气息的绘本故事,经过编者对教材的挖掘和设计,巧妙的寻找到了切入点,抓住绘本的中心思想及其精髓,通过几个有效提问,把“每个人都有自己的强项和弱项”的人性特点,通过这次教学活动让幼儿理解,让幼儿自豪的找出自己的强项。 2、积极合作,真诚欣赏他人的强项。 自信心强的孩子能在新的活动任务前不胆怯,能主动参加;讨论时能大胆发表意见,不轻易改变主意。活动中通过“抬花轿”这个游戏,让幼儿尝试与同伴积极合作,共同组队、讨论游戏的形式,提供了让幼儿理解人与人之间和谐共处的教育平台。

英语句子结构和造句

高中英语~词性~句子成分~语法构成 第一章节:英语句子中的词性 1.名词:n. 名词是指事物的名称,在句子中主要作主语.宾语.表语.同位语。 2.形容词;adj. 形容词是指对名词进行修饰~限定~描述~的成份,主要作定语.表语.。形容词在汉语中是(的).其标志是: ous. Al .ful .ive。. 3.动词:vt. 动词是指主语发出的一个动作,一般用来作谓语。 4.副词:adv. 副词是指表示动作发生的地点. 时间. 条件. 方式. 原因. 目的. 结果.伴随让步. 一般用来修饰动词. 形容词。副词在汉语中是(地).其标志是:ly。 5.代词:pron. 代词是指用来代替名词的词,名词所能担任的作用,代词也同样.代词主要用来作主语. 宾语. 表语. 同位语。 6.介词:prep.介词是指表示动词和名次关系的词,例如:in on at of about with for to。其特征:

介词后的动词要用—ing形式。介词加代词时,代词要用宾格。例如:give up her(him)这种形式是正确的,而give up she(he)这种形式是错误的。 7.冠词:冠词是指修饰名词,表名词泛指或特指。冠词有a an the 。 8.叹词:叹词表示一种语气。例如:OH. Ya 等 9.连词:连词是指连接两个并列的成分,这两个并列的成分可以是两个词也可以是两个句子。例如:and but or so 。 10.数词:数词是指表示数量关系词,一般分为基数词和序数词 第二章节:英语句子成分 主语:动作的发出者,一般放在动词前或句首。由名词. 代词. 数词. 不定时. 动名词. 或从句充当。 谓语:指主语发出来的动作,只能由动词充当,一般紧跟在主语后面。 宾语:指动作的承受着,一般由代词. 名词. 数词. 不定时. 动名词. 或从句充当. 介词后面的成分也叫介词宾语。 定语:只对名词起限定修饰的成分,一般由形容

字符串和字符数组之间的转换

字符串和字符数组之间的转换 2010-11-02 16:53:00| 分类: |举报|字号订阅 字符串类提供了一个void ToCharArray() 方法,该方法可以实现字符串到字符数组的转换。如下例: private void TestStringChars() { string str = "mytest"; char[] chars = (); = ""; "Length of \"mytest\" is " + + "\n"); "Length of char array is " + + "\n"); "char[2] = " + chars[2] + "\n"); } 例中以对转换转换到的字符数组长度和它的一个元素进行了测试,结果如下: Length of "mytest" is 6 Length of char array is 6 char[2] = t 可以看出,结果完全正确,这说明转换成功。那么反过来,要把字符数组转换成字符串又该如何呢? 我们可以使用类的构造函数来解决这个问题。类有两个构造函数是通过字符数组来构造的,即 String(char[]) 和String[char[], int, int)。后者之所以多两个参数,是因为可以指定用字符数组中的哪一部分来构造字符串。而前者则是用字符数组的全部元素来构造字符串。我们以前者为例, 在 TestStringChars() 函数中输入如下语句: char[] tcs = {'t', 'e', 's', 't', ' ', 'm', 'e'}; string tstr = new String(tcs); "tstr = \"" + tstr + "\"\n"); 运行结果输入 tstr = "test me",测试说明转换成功。 实际上,我们在很多时候需要把字符串转换成字符数组只是为了得到该字符串中的某个字符。如果只是为了这个目的,那大可不必兴师动众的去进行转换,我们

六级单词解析造句记忆MNO

M A: Has the case been closed yet? B: No, the magistrate still needs to decide the outcome. magistrate n.地方行政官,地方法官,治安官 A: I am unable to read the small print in the book. B: It seems you need to magnify it. magnify vt.1.放大,扩大;2.夸大,夸张 A: That was a terrible storm. B: Indeed, but it is too early to determine the magnitude of the damage. magnitude n.1.重要性,重大;2.巨大,广大 A: A young fair maiden like you shouldn’t be single. B: That is because I am a young fair independent maiden. maiden n.少女,年轻姑娘,未婚女子 a.首次的,初次的 A: You look majestic sitting on that high chair. B: Yes, I am pretending to be the king! majestic a.雄伟的,壮丽的,庄严的,高贵的 A: Please cook me dinner now. B: Yes, your majesty, I’m at your service. majesty n.1.[M-]陛下(对帝王,王后的尊称);2.雄伟,壮丽,庄严 A: Doctor, I traveled to Africa and I think I caught malaria. B: Did you take any medicine as a precaution? malaria n.疟疾 A: I hate you! B: Why are you so full of malice? malice n.恶意,怨恨 A: I’m afraid that the test results have come back and your lump is malignant. B: That means it’s serious, doesn’t it, doctor? malignant a.1.恶性的,致命的;2.恶意的,恶毒的 A: I’m going shopping in the mall this afternoon, want to join me? B: No, thanks, I have plans already. mall n.(由许多商店组成的)购物中心 A: That child looks very unhealthy. B: Yes, he does not have enough to eat. He is suffering from malnutrition.

inputStream和String,Byte之间的转换

1.import java.io.ByteArrayInputStream; 2.import java.io.ByteArrayOutputStream; 3.import java.io.IOException; 4.import java.io.InputStream; 5. 6./** 7. * 8. * @author Andy.Chen 9. * @mail Chenjunjun.ZJ@https://www.360docs.net/doc/718260376.html, 10. * 11. */ 12.public class InputStreamUtils { 13. 14. final static int BUFFER_SIZE = 4096; 15. 16. /** 17. * 将InputStream转换成String 18. * @param in InputStream 19. * @return String 20. * @throws Exception 21. * 22. */ 23. public static String InputStreamTOString(InputStream in) throws Ex ception{ 24. 25. ByteArrayOutputStream outStream = new ByteArrayOutputStream(); 26. byte[] data = new byte[BUFFER_SIZE]; 27. int count = -1; 28. while((count = in.read(data,0,BUFFER_SIZE)) != -1) 29. outStream.write(data, 0, count); 30. 31.data = null; 32. return new String(outStream.toByteArray(),"ISO-8859-1"); 33. } 34. 35. /** 36. * 将InputStream转换成某种字符编码的String 37. * @param in 38. * @param encoding 39. * @return 40. * @throws Exception 41. */

相关文档
最新文档