Computations of the Advection-Diffusion Equation in the Channel Flow Computations of the Ad

More informationQuantum Computing for Computer ScientistsThe multidisciplinaryfield of quantum computing strives to exploit someof the uncanny aspects of quantum mechanics to expand our computa-tional horizons.Quantum Computing for Computer Scientists takes read-ers on a tour of this fascinating area of cutting-edge research.Writtenin an accessible yet rigorous fashion,this book employs ideas and tech-niques familiar to every student of computer science.The reader is notexpected to have any advanced mathematics or physics background.Af-ter presenting the necessary prerequisites,the material is organized tolook at different aspects of quantum computing from the specific stand-point of computer science.There are chapters on computer architecture,algorithms,programming languages,theoretical computer science,cryp-tography,information theory,and hardware.The text has step-by-stepexamples,more than two hundred exercises with solutions,and program-ming drills that bring the ideas of quantum computing alive for today’scomputer science students and researchers.Noson S.Yanofsky,PhD,is an Associate Professor in the Departmentof Computer and Information Science at Brooklyn College,City Univer-sity of New York and at the PhD Program in Computer Science at TheGraduate Center of CUNY.Mirco A.Mannucci,PhD,is the founder and CEO of HoloMathics,LLC,a research and development company with a focus on innovative mathe-matical modeling.He also serves as Adjunct Professor of Computer Sci-ence at George Mason University and the University of Maryland.QUANTUM COMPUTING FORCOMPUTER SCIENTISTSNoson S.YanofskyBrooklyn College,City University of New YorkandMirco A.MannucciHoloMathics,LLCMore informationMore informationcambridge university pressCambridge,New York,Melbourne,Madrid,Cape Town,Singapore,S˜ao Paulo,DelhiCambridge University Press32Avenue of the Americas,New York,NY10013-2473,USAInformation on this title:/9780521879965C Noson S.Yanofsky and Mirco A.Mannucci2008This publication is in copyright.Subject to statutory exceptionand to the provisions of relevant collective licensing agreements,no reproduction of any part may take place withoutthe written permission of Cambridge University Press.First published2008Printed in the United States of AmericaA catalog record for this publication is available from the British Library.Library of Congress Cataloging in Publication dataYanofsky,Noson S.,1967–Quantum computing for computer scientists/Noson S.Yanofsky andMirco A.Mannucci.p.cm.Includes bibliographical references and index.ISBN978-0-521-87996-5(hardback)1.Quantum computers.I.Mannucci,Mirco A.,1960–II.Title.QA76.889.Y352008004.1–dc222008020507ISBN978-0-521-879965hardbackCambridge University Press has no responsibility forthe persistence or accuracy of URLs for external orthird-party Internet Web sites referred to in this publicationand does not guarantee that any content on suchWeb sites is,or will remain,accurate or appropriate.More informationDedicated toMoishe and Sharon Yanofskyandto the memory ofLuigi and Antonietta MannucciWisdom is one thing:to know the tho u ght by which all things are directed thro u gh allthings.˜Heraclitu s of Ephe s u s(535–475B C E)a s quoted in Dio g ene s Laertiu s’sLives and Opinions of Eminent PhilosophersBook IX,1. More informationMore informationContentsPreface xi1Complex Numbers71.1Basic Definitions81.2The Algebra of Complex Numbers101.3The Geometry of Complex Numbers152Complex Vector Spaces292.1C n as the Primary Example302.2Definitions,Properties,and Examples342.3Basis and Dimension452.4Inner Products and Hilbert Spaces532.5Eigenvalues and Eigenvectors602.6Hermitian and Unitary Matrices622.7Tensor Product of Vector Spaces663The Leap from Classical to Quantum743.1Classical Deterministic Systems743.2Probabilistic Systems793.3Quantum Systems883.4Assembling Systems974Basic Quantum Theory1034.1Quantum States1034.2Observables1154.3Measuring1264.4Dynamics1294.5Assembling Quantum Systems1325Architecture1385.1Bits and Qubits138viiMore informationviii Contents5.2Classical Gates1445.3Reversible Gates1515.4Quantum Gates1586Algorithms1706.1Deutsch’s Algorithm1716.2The Deutsch–Jozsa Algorithm1796.3Simon’s Periodicity Algorithm1876.4Grover’s Search Algorithm1956.5Shor’s Factoring Algorithm2047Programming Languages2207.1Programming in a Quantum World2207.2Quantum Assembly Programming2217.3Toward Higher-Level Quantum Programming2307.4Quantum Computation Before Quantum Computers2378Theoretical Computer Science2398.1Deterministic and Nondeterministic Computations2398.2Probabilistic Computations2468.3Quantum Computations2519Cryptography2629.1Classical Cryptography2629.2Quantum Key Exchange I:The BB84Protocol2689.3Quantum Key Exchange II:The B92Protocol2739.4Quantum Key Exchange III:The EPR Protocol2759.5Quantum Teleportation27710Information Theory28410.1Classical Information and Shannon Entropy28410.2Quantum Information and von Neumann Entropy28810.3Classical and Quantum Data Compression29510.4Error-Correcting Codes30211Hardware30511.1Quantum Hardware:Goals and Challenges30611.2Implementing a Quantum Computer I:Ion Traps31111.3Implementing a Quantum Computer II:Linear Optics31311.4Implementing a Quantum Computer III:NMRand Superconductors31511.5Future of Quantum Ware316Appendix A Historical Bibliography of Quantum Computing319 by Jill CirasellaA.1Reading Scientific Articles319A.2Models of Computation320More informationContents ixA.3Quantum Gates321A.4Quantum Algorithms and Implementations321A.5Quantum Cryptography323A.6Quantum Information323A.7More Milestones?324Appendix B Answers to Selected Exercises325Appendix C Quantum Computing Experiments with MATLAB351C.1Playing with Matlab351C.2Complex Numbers and Matrices351C.3Quantum Computations354Appendix D Keeping Abreast of Quantum News:QuantumComputing on the Web and in the Literature357by Jill CirasellaD.1Keeping Abreast of Popular News357D.2Keeping Abreast of Scientific Literature358D.3The Best Way to Stay Abreast?359Appendix E Selected Topics for Student Presentations360E.1Complex Numbers361E.2Complex Vector Spaces362E.3The Leap from Classical to Quantum363E.4Basic Quantum Theory364E.5Architecture365E.6Algorithms366E.7Programming Languages368E.8Theoretical Computer Science369E.9Cryptography370E.10Information Theory370E.11Hardware371Bibliography373Index381More informationPrefaceQuantum computing is a fascinating newfield at the intersection of computer sci-ence,mathematics,and physics,which strives to harness some of the uncanny as-pects of quantum mechanics to broaden our computational horizons.This bookpresents some of the most exciting and interesting topics in quantum computing.Along the way,there will be some amazing facts about the universe in which we liveand about the very notions of information and computation.The text you hold in your hands has a distinctflavor from most of the other cur-rently available books on quantum computing.First and foremost,we do not assumethat our reader has much of a mathematics or physics background.This book shouldbe readable by anyone who is in or beyond their second year in a computer scienceprogram.We have written this book specifically with computer scientists in mind,and tailored it accordingly:we assume a bare minimum of mathematical sophistica-tion,afirst course in discrete structures,and a healthy level of curiosity.Because thistext was written specifically for computer people,in addition to the many exercisesthroughout the text,we added many programming drills.These are a hands-on,funway of learning the material presented and getting a real feel for the subject.The calculus-phobic reader will be happy to learn that derivatives and integrals are virtually absent from our text.Quite simply,we avoid differentiation,integra-tion,and all higher mathematics by carefully selecting only those topics that arecritical to a basic introduction to quantum computing.Because we are focusing onthe fundamentals of quantum computing,we can restrict ourselves to thefinite-dimensional mathematics that is required.This turns out to be not much more thanmanipulating vectors and matrices with complex entries.Surprisingly enough,thelion’s share of quantum computing can be done without the intricacies of advancedmathematics.Nevertheless,we hasten to stress that this is a technical textbook.We are not writing a popular science book,nor do we substitute hand waving for rigor or math-ematical precision.Most other texts in thefield present a primer on quantum mechanics in all its glory.Many assume some knowledge of classical mechanics.We do not make theseassumptions.We only discuss what is needed for a basic understanding of quantumxiMore informationxii Prefacecomputing as afield of research in its own right,although we cite sources for learningmore about advanced topics.There are some who consider quantum computing to be solely within the do-main of physics.Others think of the subject as purely mathematical.We stress thecomputer science aspect of quantum computing.It is not our intention for this book to be the definitive treatment of quantum computing.There are a few topics that we do not even touch,and there are severalothers that we approach briefly,not exhaustively.As of this writing,the bible ofquantum computing is Nielsen and Chuang’s magnificent Quantum Computing andQuantum Information(2000).Their book contains almost everything known aboutquantum computing at the time of its publication.We would like to think of ourbook as a usefulfirst step that can prepare the reader for that text.FEATURESThis book is almost entirely self-contained.We do not demand that the reader comearmed with a large toolbox of skills.Even the subject of complex numbers,which istaught in high school,is given a fairly comprehensive review.The book contains many solved problems and easy-to-understand descriptions.We do not merely present the theory;rather,we explain it and go through severalexamples.The book also contains many exercises,which we strongly recommendthe serious reader should attempt to solve.There is no substitute for rolling up one’ssleeves and doing some work!We have also incorporated plenty of programming drills throughout our text.These are hands-on exercises that can be carried out on your laptop to gain a betterunderstanding of the concepts presented here(they are also a great way of hav-ing fun).We hasten to point out that we are entirely language-agnostic.The stu-dent should write the programs in the language that feels most comfortable.Weare also paradigm-agnostic.If declarative programming is your favorite method,gofor it.If object-oriented programming is your game,use that.The programmingdrills build on one another.Functions created in one programming drill will be usedand modified in later drills.Furthermore,in Appendix C,we show how to makelittle quantum computing emulators with MATLAB or how to use a ready-madeone.(Our choice of MATLAB was dictated by the fact that it makes very easy-to-build,quick-and-dirty prototypes,thanks to its vast amount of built-in mathematicaltools.)This text appears to be thefirst to handle quantum programming languages in a significant way.Until now,there have been only research papers and a few surveyson the topic.Chapter7describes the basics of this expandingfield:perhaps some ofour readers will be inspired to contribute to quantum programming!This book also contains several appendices that are important for further study:Appendix A takes readers on a tour of major papers in quantum computing.This bibliographical essay was written by Jill Cirasella,Computational SciencesSpecialist at the Brooklyn College Library.In addition to having a master’s de-gree in library and information science,Jill has a master’s degree in logic,forwhich she wrote a thesis on classical and quantum graph algorithms.This dualbackground uniquely qualifies her to suggest and describe further readings.More informationPreface xiii Appendix B contains the answers to some of the exercises in the text.Othersolutions will also be found on the book’s Web page.We strongly urge studentsto do the exercises on their own and then check their answers against ours.Appendix C uses MATLAB,the popular mathematical environment and an es-tablished industry standard,to show how to carry out most of the mathematicaloperations described in this book.MATLAB has scores of routines for manip-ulating complex matrices:we briefly review the most useful ones and show howthe reader can quickly perform a few quantum computing experiments with al-most no effort,using the freely available MATLAB quantum emulator Quack.Appendix D,also by Jill Cirasella,describes how to use online resources to keepup with developments in quantum computing.Quantum computing is a fast-movingfield,and this appendix offers guidelines and tips forfinding relevantarticles and announcements.Appendix E is a list of possible topics for student presentations.We give briefdescriptions of different topics that a student might present before a class of hispeers.We also provide some hints about where to start looking for materials topresent.ORGANIZATIONThe book begins with two chapters of mathematical preliminaries.Chapter1con-tains the basics of complex numbers,and Chapter2deals with complex vectorspaces.Although much of Chapter1is currently taught in high school,we feel thata review is in order.Much of Chapter2will be known by students who have had acourse in linear algebra.We deliberately did not relegate these chapters to an ap-pendix at the end of the book because the mathematics is necessary to understandwhat is really going on.A reader who knows the material can safely skip thefirsttwo chapters.She might want to skim over these chapters and then return to themas a reference,using the index and the table of contents tofind specific topics.Chapter3is a gentle introduction to some of the ideas that will be encountered throughout the rest of the ing simple models and simple matrix multipli-cation,we demonstrate some of the fundamental concepts of quantum mechanics,which are then formally developed in Chapter4.From there,Chapter5presentssome of the basic architecture of quantum computing.Here one willfind the notionsof a qubit(a quantum generalization of a bit)and the quantum analog of logic gates.Once Chapter5is understood,readers can safely proceed to their choice of Chapters6through11.Each chapter takes its title from a typical course offered in acomputer science department.The chapters look at that subfield of quantum com-puting from the perspective of the given course.These chapters are almost totallyindependent of one another.We urge the readers to study the particular chapterthat corresponds to their favorite course.Learn topics that you likefirst.From thereproceed to other chapters.Figure0.1summarizes the dependencies of the chapters.One of the hardest topics tackled in this text is that of considering two quan-tum systems and combining them,or“entangled”quantum systems.This is donemathematically in Section2.7.It is further motivated in Section3.4and formallypresented in Section4.5.The reader might want to look at these sections together.xivPrefaceFigure 0.1.Chapter dependencies.There are many ways this book can be used as a text for a course.We urge instructors to find their own way.May we humbly suggest the following three plans of action:(1)A class that provides some depth might involve the following:Go through Chapters 1,2,3,4,and 5.Armed with that background,study the entirety of Chapter 6(“Algorithms”)in depth.One can spend at least a third of a semester on that chapter.After wrestling a bit with quantum algorithms,the student will get a good feel for the entire enterprise.(2)If breadth is preferred,pick and choose one or two sections from each of the advanced chapters.Such a course might look like this:(1),2,3,4.1,4.4,5,6.1,7.1,9.1,10.1,10.2,and 11.This will permit the student to see the broad outline of quantum computing and then pursue his or her own path.(3)For a more advanced class (a class in which linear algebra and some mathe-matical sophistication is assumed),we recommend that students be told to read Chapters 1,2,and 3on their own.A nice course can then commence with Chapter 4and plow through most of the remainder of the book.If this is being used as a text in a classroom setting,we strongly recommend that the students make presentations.There are selected topics mentioned in Appendix E.There is no substitute for student participation!Although we have tried to include many topics in this text,inevitably some oth-ers had to be left out.Here are a few that we omitted because of space considera-tions:many of the more complicated proofs in Chapter 8,results about oracle computation,the details of the (quantum)Fourier transforms,and the latest hardware implementations.We give references for further study on these,as well as other subjects,throughout the text.More informationMore informationPreface xvANCILLARIESWe are going to maintain a Web page for the text at/∼noson/qctext.html/The Web page will containperiodic updates to the book,links to interesting books and articles on quantum computing,some answers to certain exercises not solved in Appendix B,anderrata.The reader is encouraged to send any and all corrections tonoson@Help us make this textbook better!ACKNOLWEDGMENTSBoth of us had the great privilege of writing our doctoral theses under the gentleguidance of the recently deceased Alex Heller.Professor Heller wrote the follow-ing1about his teacher Samuel“Sammy”Eilenberg and Sammy’s mathematics:As I perceived it,then,Sammy considered that the highest value in mathematicswas to be found,not in specious depth nor in the overcoming of overwhelmingdifficulty,but rather in providing the definitive clarity that would illuminate itsunderlying order.This never-ending struggle to bring out the underlying order of mathematical structures was always Professor Heller’s everlasting goal,and he did his best to passit on to his students.We have gained greatly from his clarity of vision and his viewof mathematics,but we also saw,embodied in a man,the classical and sober ideal ofcontemplative life at its very best.We both remain eternally grateful to him.While at the City University of New York,we also had the privilege of inter-acting with one of the world’s foremost logicians,Professor Rohit Parikh,a manwhose seminal contributions to thefield are only matched by his enduring com-mitment to promote younger researchers’work.Besides opening fascinating vis-tas to us,Professor Parikh encouraged us more than once to follow new directionsof thought.His continued professional and personal guidance are greatly appre-ciated.We both received our Ph.D.’s from the Department of Mathematics in The Graduate Center of the City University of New York.We thank them for providingus with a warm and friendly environment in which to study and learn real mathemat-ics.Thefirst author also thanks the entire Brooklyn College family and,in partic-ular,the Computer and Information Science Department for being supportive andvery helpful in this endeavor.1See page1349of Bass et al.(1998).More informationxvi PrefaceSeveral faculty members of Brooklyn College and The Graduate Center were kind enough to read and comment on parts of this book:Michael Anshel,DavidArnow,Jill Cirasella,Dayton Clark,Eva Cogan,Jim Cox,Scott Dexter,EdgarFeldman,Fred Gardiner,Murray Gross,Chaya Gurwitz,Keith Harrow,JunHu,Yedidyah Langsam,Peter Lesser,Philipp Rothmaler,Chris Steinsvold,AlexSverdlov,Aaron Tenenbaum,Micha Tomkiewicz,Al Vasquez,Gerald Weiss,andPaula Whitlock.Their comments have made this a better text.Thank you all!We were fortunate to have had many students of Brooklyn College and The Graduate Center read and comment on earlier drafts:Shira Abraham,RachelAdler,Ali Assarpour,Aleksander Barkan,Sayeef Bazli,Cheuk Man Chan,WeiChen,Evgenia Dandurova,Phillip Dreizen,C.S.Fahie,Miriam Gutherc,RaveHarpaz,David Herzog,Alex Hoffnung,Matthew P.Johnson,Joel Kammet,SerdarKara,Karen Kletter,Janusz Kusyk,Tiziana Ligorio,Matt Meyer,James Ng,SeverinNgnosse,Eric Pacuit,Jason Schanker,Roman Shenderovsky,Aleksandr Shnayder-man,Rose B.Sigler,Shai Silver,Justin Stallard,Justin Tojeira,John Ma Sang Tsang,Sadia Zahoor,Mark Zelcer,and Xiaowen Zhang.We are indebted to them.Many other people looked over parts or all of the text:Scott Aaronson,Ste-fano Bettelli,Adam Brandenburger,Juan B.Climent,Anita Colvard,Leon Ehren-preis,Michael Greenebaum,Miriam Klein,Eli Kravits,Raphael Magarik,JohnMaiorana,Domenico Napoletani,Vaughan Pratt,Suri Raber,Peter Selinger,EvanSiegel,Thomas Tradler,and Jennifer Whitehead.Their criticism and helpful ideasare deeply appreciated.Thanks to Peter Rohde for creating and making available to everyone his MAT-LAB q-emulator Quack and also for letting us use it in our appendix.We had a gooddeal of fun playing with it,and we hope our readers will too.Besides writing two wonderful appendices,our friendly neighborhood librar-ian,Jill Cirasella,was always just an e-mail away with helpful advice and support.Thanks,Jill!A very special thanks goes to our editor at Cambridge University Press,HeatherBergman,for believing in our project right from the start,for guiding us through thisbook,and for providing endless support in all matters.This book would not existwithout her.Thanks,Heather!We had the good fortune to have a truly stellar editor check much of the text many times.Karen Kletter is a great friend and did a magnificent job.We also ap-preciate that she refrained from killing us every time we handed her altered draftsthat she had previously edited.But,of course,all errors are our own!This book could not have been written without the help of my daughter,Hadas-sah.She added meaning,purpose,and joy.N.S.Y.My dear wife,Rose,and our two wondrous and tireless cats,Ursula and Buster, contributed in no small measure to melting my stress away during the long andpainful hours of writing and editing:to them my gratitude and love.(Ursula is ascientist cat and will read this book.Buster will just shred it with his powerful claws.)M.A.M.。

阅读理解真题考研英语阅读理解真题考研英语1Text 3Any fair-minded assessment of the dangers of the deal between Britain's National Health Service (NHS) and DeepMind must start by acknowledging that both sides mean well. DeepMind is one of the leading artificial intelligence (AI) panies in the world. The potential of this work applied to healthcare is very great, but it could also lead to further concentration of power in the tech giants. It Is against that background that the information missioner, Elizabeth Denham, has issued her damning verdict against the Royal Free hospital trust under the NHS, which handed over to DeepMind the records of 1.6 million patients In 20XX on the basis of a vague agreement which took far too little account of the patients' rights and their expectations of privacy.DeepMind has almost apologized. The NHS trust has mended its ways. Further arrangements- and there may be many-between the NHS and DeepMind will becarefully scrutinised to ensure that all necessary permissions have been asked of patients and all unnecessary data has been cleaned. There are lessons about informed patient consent to learn. But privacy is not the only angle in this case and not even the most important. Ms Denham chose to concentrate theblame on the NHS trust, since under existing law it “controlled” the data and DeepMind merely “processed" it. But this distinction misses thepoint that it is processing and aggregation, not the mere possession of bits, that gives the data value.The great question is who should benefit from the analysis of all the data that our lives now generate. Privacy law builds on the concept of damage to an individual from identifiable knowledge about them. That misses the way the surveillance economy works. The data of an individual there gains its value only when it is pared with the data of countless millions more.The use of privacy law to curb the tech giants in this instance feels slightly maladapted. Thispractice does not address the real worry. It is not enough to say that the algorithms DeepMind developswill benefit patients and save lives. What matters is that they will belong to a private monopoly which developed them using public resources. If software promises to save lives on the scale that dugs now can, big data may be expected to behave as a big pharm has done. We are still at the beginning of thisrevolution and small choices now may turn out to have gigantic consequences later. A long struggle will be needed to avoid a future of digital feudalism. Ms Denham's report is a wele start.31.Wha is true of the agreement between the NHSand DeepMind ?[A] It caused conflicts among tech giants.[B] It failed to pay due attention to patient’s rights.[C] It fell short of the latter's expectations[D] It put both sides into a dangerous situation.32. The NHS trust responded to Denham's verdict with[A] empty promises.[B] tough resistance.[C] necessary adjustments.[D] sincere apologies.33.The author argues in Paragraph 2 that[A] privacy protection must be secured at all costs.[B] leaking patients' data is worse than selling it.[C] making profits from patients' data is illegal.[D] the value of data es from the processing of it34.According to the last paragraph, the real worry arising from this deal is[A] the vicious rivalry among big pharmas.[B] the ineffective enforcement of privacy law.[C] the uncontrolled use of new software.[D] the monopoly of big data by tech giants.35.The author's attitude toward the application of AI to healthcare is[A] ambiguous.[B] cautious.[C] appreciative.[D] contemptuous.阅读理解真题考研英语2Text 3The rough guide to marketing success used to be that you got what you paid for. No longer. While traditional “paid” media – such as television mercials and print advertisements – still play a major role， panies today can exploit manyalternative forms of media. Consumers passionate about a product may create “owned” media by sending e-mail alerts about products and sales to customers registered with its Web site. The way consumers now approach the broad range of factors beyond conventional paid media.Paid and owned media are controlled by marketers promoting their own products. For earned media ，such marketers act as the initiator forusers‘ responses. But in some cases， onemarketer’s owned media bee another marketer‘s paid media – for instance， when an e-merce retailersells ad space on its Web site. We define such sold media as owned media whose traffic is so strong that other organizations place their content or e-merce engines within that environment. This trend ，which we believe is still in its infancy， effectively began with retailers and travel providers such as airlines and hotels and will no doubt go further. Johnson & Johnson， for example， has created BabyCenter， a stand-alone media property that promotes plementary and even petitive products. Besides generating ine， the presence of other marketers makes the site seem objective， gives panies opportunities to learn valuable information about the appeal of other panies’ marketing， and may help expand user traffic for all panies concerned.The same dramatic technological changes that have provided marketers with more (and more diverse) munications choices have also increased the risk that passionate consumers will voice their opinions in quicker， more visible， and much more damaging ways. Such hijacked media are the opposite of earned media： an asset or campaign bees hostage to consumers， other stakeholders， or activists who make negative allegations about a brand or product. Members of social networks， for instance， arelearning that they can hijack media to apply pressure on the businesses that originally created them.If that happens， passionate consumers would try to persuade others to boycott products， putting the reputation of the target pany at risk. In such a case，the pany‘s response may not be sufficiently quick or thoughtful， and the learning curve has been steep. Toyota Motor， for example， alleviated some of the damage from its recall crisis earlier this year with a relatively quick and well-orchestrated social-media response campaign， which included efforts to engage with consumers directly on sites such as Twitter and the social-news site Digg.31.Consumers may create “earned” media when they are[A] obscssed with online shopping at certain Web sites.[B] inspired by product-promoting e-mails sent to them.[C] eager to help their friends promote quality products.[D] enthusiastic about remending their favorite products.32. According to Paragraph 2，sold media feature[A] a safe business environment.[B] random petition.[C] strong user traffic.[D] flexibility in organization.33. The author indicates in Paragraph 3 that earned media[A] invite constant conflicts with passionate consumers.[B] can be used to produce negative effects in marketing.[C] may be responsible for fiercer petition.[D] deserve all the negative ments about them.34. Toyota Motor‘s experience is cited as an example of[A] responding effectively to hijacked media.[B] persuading customers into boycotting products.[C] cooperating with supportive consumers.[D] taking advantage of hijacked media.35. Which of the following is the text mainly about ?[A] Alternatives to conventional paid media.[B] Conflict between hijacked and earned media.[C] Dominance of hijacked media.[D] Popularity of owned media.阅读理解真题考研英语3Text 3Now utopia has grown unfashionable, as we have gained a deeper appreciation of the range of threats facing us, from asteroid strike to pandemic flu to climate change. You might even be tempted to assume that humanity has little future to look forward to.But such gloominess is misplaced. The fossil record shows that many species have endured for millions of years - so why shouldn't we? Take a broader look at our species' place in the universe, and it bees clear that we have an excellent chance of surviving for tens, if not hundreds, of thousands of years (see "100,000 AD: Living in the deep future"). Look up Homo sapiens in the IUCN's "Red List" of threatened species, and you will read: "Listed as Least Concern as the species is very widely distributed, adaptable, currently increasing, and there are no major threats resulting in an overall population decline."So what does our deep future hold? A growing number of researchers and organisations are now thinking seriously about that question. For example, the Long Now Foundation, based in San Francisco, has created a forum where thinkers and scientists are invited to project the implications of their ideas over very long timescales. Its flagship project is amechanical clock, buried deep inside a mountain in Texas, that is designed to still be marking time thousands of years hence.Then there are scientists who are giving serious consideration to the idea that we should recognise a new geological era: the Anthropocene. They, too, are pulling the camera right back and asking whathumanity's impact will be on the planet - in the context of stratigraphic time.Perhaps perversely, it may be easier to thinkabout such lengthy timescales than about the more immediate future. The potential evolution of today's technology, and its social consequences, isdazzlingly plicated, and it's perhaps best left to science-fiction writers and futurologists to explore the many possibilities we can envisage. That's one reason why we have launched Arc, a new publication dedicated to the near future.But take a longer view and there is a surprising amount that we can say with considerable assurance.As so often, the past holds the key to the future: we have now identified enough of the long-term patterns shaping the history of the planet, and our species,to make evidence-based forecasts about the situations in which our descendants will find themselves.This long perspective makes the pessimistic viewof our prospects seem more likely to be a passing fad. To be sure, the future is not all rosy: while ourspecies may flourish, a great many individuals may not. But we are now knowledgeable enough to mitigate many of the risks that threatened the existence of earlier humans, and to improve the lot of those to e. Thinking about our place in deep time is a good wayto focus on the challenges that confront us today, and to make a future worth living in.31. Our vision of the future used to be inspired by[A] our desire for ares of fulfillment[B] our faith in science and teched[C] our awareness of potential risks[D] our bdief in equal opportunity32. The IUCN“Rod List”suggest that human beings on[A] a sustained species[B] the word’s deminant power[C] a threat to the environment[D] a misplaced race33. Which of the following is true according to Paragraph 5?[A] Arc helps limit the scope of futurological studies.[B] Technology offers solutions to social problem.[C] The interest in science fiction is on the rise.[D] Our Immediate future is hard to conceive.34. To ensure the future of mankind, it is crucial to[A] explore our planet’s abundant resources.[B] adopt an optimistic view of the world.[C] draw on our experience from the past.[D] curb our ambition to reshape history.35. Which of the following would be the best title for the text?[A] Uncertainty about Our Future[B] Evolution of the Human Species[C] The Ever-bright Prospects of Mankind.[D] Science, Technology and Humanity.阅读理解真题考研英语4Text 3The US$3-million Fundamental physics prize is indeed an interesting experiment, as Alexander Polyakov said when he accepted this year’s award in March. And it is far from the only one of its type. As a News Feature article in Nature discusses, astring of lucrative awards for researchers havejoined the Nobel Prizes in recent years. Many, like the Fundamental Physics Prize, are funded from the telephone-number-sized bank accounts of Internet entrepreneurs. These benefactors have succeeded in their chosen fields, they say, and they want to use their wealth to draw attention to those who have succeeded in science.What’s not to like? Quite a lot, according to a handful of scientists quoted in the News Feature. You cannot buy class, as the old saying goes, and these upstart entrepreneurs cannot buy their prizes the prestige of the Nobels, The new awards are an exercise in self-promotion for those behind them, say scientists. They could distort the achievement-based system of peer-review-led research. They could cement the status quo of peer-reviewed research. They do not fund peer-reviewed research. They perpetuate the myth of the lone genius.The goals of the prize-givers seem as scattered as the criticism.Some want to shock, others to draw people into science, or to better reward those who have made their careers in research.As Nature has pointed out before, there are some legitimate concerns about how science prizes—both new and old—are distributed. The Breakthrough Prize in Life Sciences, launched this year, takes an unrepresentative view of what the life sciences include.But the Nobel Foundation’s limit of threerecipients per prize, each of whom must still be living, has long been outgrown by the collaborative nature of modern research—as will be demonstrated by the inevitable row over who is ignored when it es to acknowledging the discovery of the Higgs boson. The Nobels were, of course,themselves set up by a very rich individual who had decided what he wanted to do with his own money. Time, rather than intention, has given them legitimacy.As much as some scientists may plain about the new awards, two things seem clear. First, most researchers would accept such a prize if they were offered one. Second, it is surely a good thing that the money and attention e to science rather than go elsewhere, It is fair to criticize and question the mechanism—that is the culture of research, after all—but it is the prize-givers’ money to do with as they please. It is wise to take such gifts with gratitude and grace.31.The Fundamental Physical Prize is seen as[A]a sy mbol of the entrepreneurs’s wealth.[B]a possible replacement of the Nobel Prize.[C]an example of bankers’ investment.[D]a handsome reward for researchers.32.The phrase “to sign on”(Line 3,Para.2) most probably means[A]the profit-oriented scientists.[B]the founders of the new award.[C]the achievement-based system.[D]peer-review-led research.33.What promoted the chancellor to develop his scheme?[A]controversies over the recipients’ status.[B]the joint effort of modern researchers.[C]legitimate concerns over the new prize.[D]the demonstration of research findings.34.According to Paragraph 3, being unemployed makes one one feel[A]Their endurance has done justice to them.[B]Their legitimacy has long been in dispute.[C]They are the most representative honor.[D]History has never cast doubt on them.35.To which of the following would the author most probably agree?[A]acceptable despite the criticism.[B]harmful to the culture of research.[C]subject to undesirable changes.[D]unworthy of public attention.。

diffusion model 的模型假设。

一、介绍diffusion model模型结构diffusion model模型是一种模拟和描述分子扩散的数学模型，它在物理学、化学、生物学等多个领域都有重要的应用。

这种模型可以用来研究分子在不同温度、浓度和距离条件下的扩散规律，对于理解和预测分子在空间中的分布和传播具有重要意义。

二、基本假设1.分子是无限小的，可以看作点状粒子；2.分子之间不存在相互作用力，即分子之间的碰撞是弹性碰撞；3.分子的运动是完全随机的，不受外界偏导。

三、模型运动规律1.分子在三维空间中的运动可以用随机游走模型表示，即分子随机朝不同方向移动；2.分子的速率服从正态分布，服从细胞自由扩散的统计规律；3.在一定时间范围内，分子的扩散距离与时间成正比，符合Einstein公式。

四、模型参数1.扩散系数：表示分子在单位时间内扩散的距离，是描述分子扩散速率的重要参数；2.初始浓度：反映分子在初始状态下的分布情况；3.扩散时间：表示扩散过程的时间长度。

五、模型求解1.通过使用随机过程模拟分子的随机游走路径；2.利用数值计算方法求解扩散方程，得到分子在空间中的浓度分布；3.通过计算统计量如均方位移等来描述分子在空间中的扩散规律。

六、模型应用1.在材料科学领域，可以利用扩散模型来预测材料中杂质的扩散行为，指导材料的制备和表征；2.在环境科学领域，可以用扩散模型来研究污染物在水体和大气中的扩散规律，预测污染的传播范围和影响；3.在生物学领域，可以利用扩散模型来模拟细胞内分子的扩散过程，研究细胞内信号传导和物质交换。

七、模型的优势和局限性1.优势：能够定量描述分子的扩散过程，为相关领域提供重要的理论支持和研究方法；2.局限性：模型中假设了多个简化条件，如忽略了分子之间的相互作用和外界的复杂影响，因此在实际应用中需要结合具体情况进行修正和拓展。

八、结论diffusion model模型是一种重要的描述和预测分子扩散规律的数学模型，在多个学科领域都有着广泛的应用前景。

半监督深度学习图像分类方法研究综述吕昊远+，俞璐，周星宇，邓祥陆军工程大学通信工程学院，南京210007+通信作者E-mail:*******************摘要：作为人工智能领域近十年来最受关注的技术之一，深度学习在诸多应用中取得了优异的效果，但目前的学习策略严重依赖大量的有标记数据。

在许多实际问题中，获得众多有标记的训练数据并不可行，因此加大了模型的训练难度，但容易获得大量无标记的数据。

半监督学习充分利用无标记数据，提供了在有限标记数据条件下提高模型性能的解决思路和有效方法，在图像分类任务中达到了很高的识别精准度。

首先对于半监督学习进行概述，然后介绍了分类算法中常用的基本思想，重点对近年来基于半监督深度学习框架的图像分类方法，包括多视图训练、一致性正则、多样混合和半监督生成对抗网络进行全面的综述，总结多种方法共有的技术，分析比较不同方法的实验效果差异，最后思考当前存在的问题并展望未来可行的研究方向。

关键词：半监督深度学习；多视图训练；一致性正则；多样混合；半监督生成对抗网络文献标志码：A中图分类号：TP391.4Review of Semi-supervised Deep Learning Image Classification MethodsLYU Haoyuan +,YU Lu,ZHOU Xingyu,DENG XiangCollege of Communication Engineering,Army Engineering University of PLA,Nanjing 210007,ChinaAbstract:As one of the most concerned technologies in the field of artificial intelligence in recent ten years,deep learning has achieved excellent results in many applications,but the current learning strategies rely heavily on a large number of labeled data.In many practical problems,it is not feasible to obtain a large number of labeled training data,so it increases the training difficulty of the model.But it is easy to obtain a large number of unlabeled data.Semi-supervised learning makes full use of unlabeled data,provides solutions and effective methods to improve the performance of the model under the condition of limited labeled data,and achieves high recognition accuracy in the task of image classification.This paper first gives an overview of semi-supervised learning,and then introduces the basic ideas commonly used in classification algorithms.It focuses on the comprehensive review of image classification methods based on semi-supervised deep learning framework in recent years,including multi-view training,consistency regularization,diversity mixing and semi-supervised generative adversarial networks.It summarizes the common technologies of various methods,analyzes and compares the differences of experimental results of different methods.Finally,this paper thinks about the existing problems and looks forward to the feasible research direction in the future.Key words:semi-supervised deep learning;multi-view training;consistency regularization;diversity mixing;semi-supervised generative adversarial networks计算机科学与探索1673-9418/2021/15(06)-1038-11doi:10.3778/j.issn.1673-9418.2011020基金项目：国家自然科学基金(61702543)。

Chapter 1 练习复习题1.定义一个基于图灵模型的计算机。

答：Turing proposed that all kinds of computation could be performed by a special kind of a machine. He based the model on the actions that people perform when involved in computation. He abstracted these actions into a model for a computational machine that has really changed the world. 图灵模型假设各种各样的运算都能够通过一种特殊的机器来完成，图灵机的模型是基于各种运算过程的。

图灵模型把运算的过程从计算机器中分离开来，这确实改变了整个世界。

2.定义一个基于冯·诺伊曼模型的计算机。

答：The von Neumann Model defines the components of a computer, which are memory, the arithmetic logic unit (ALU), the control unit and the input/output subsystems.冯·诺伊曼模型定义了计算机的组成，它包括存储器、算术逻辑单元、控制单元和输入/输出系统。

3.在基于图灵模型的计算机中，程序的作用是什么？答：Based on the Turing model a program is a set of instruction that tells the computer what to do.基于图灵模型的计算机中程序是一系列的指令，这些指令告诉计算机怎样进行运算。

4.在基于冯·诺伊曼模型的计算机中，程序的作用是什么？答：The von Neumann model states that the program must be stored in the memory. The memory of modern computers hosts both programs and their corresponding data.冯·诺伊曼模型的计算机中，程序必须被保存在存储器中，存储程序模型的计算机包括了程序以及程序处理的数据。

第6章光源和放大器在光纤系统，光纤光源产生的光束携带的信息。

激光二极管和发光二极管是两种最常见的来源。

他们的微小尺寸与小直径的光纤兼容，其坚固的结构和低功耗要求与现代的固态电子兼容。

在以下几个GHz的工作系统，大部分（或数Gb /秒），信息贴到光束通过调节输入电流源。

外部调制（在第4、10章讨论）被认为是当这些率超标。

我们二极管LED和激光研究，包括操作方法，转移特性和调制。

我们计划以获得其他好的或理念的差异的两个来源，什么情况下调用。

当纤维损失导致信号功率低于要求的水平，光放大器都需要增强信号到有效的水平。

通过他们的使用，光纤链路可以延长。

因为光源和光放大器，如此多的共同点，他们都是在这一章处理。

1.发光二极管一个发光二极管[1，2]是一个PN结的半导体发光时正向偏置。

图6.1显示的连接器件、电路符号，能量块和二极管关联。

能带理论提供了对一个）简单的解释半导体发射器（和探测器）。

允许能带通过的是工作组，其显示的宽度能在图中，相隔一禁止区域（带隙）。

在上层能带称为导带，电子不一定要到移动单个原子都是免费的。

洞中有一个正电荷。

它们存在于原子电子的地点已经从一个中立带走，留下的电荷原子与净正。

自由电子与空穴重新结合可以，返回的中性原子状态。

能量被释放时，发生这种情况。

一个n -型半导体拥有自由电子数，如图图英寸6.1。

p型半导体有孔数自由。

当一种P型和一种N型材料费米能级（WF）的P和N的材料一致，并外加电压上作用时，产生的能垒如显示的数字所示。

重参杂材料，这种情况提供许多电子传到和过程中需要排放的孔。

在图中，电子能量增加垂直向上，能增加洞垂直向下。

因此，在N地区的自由电子没有足够的能量去穿越阻碍而移动到P区。

同样，空穴缺乏足够的能量克服障碍而移动进入n区。

当没有外加电压时，由于两种材料不同的费米能级产生的的能量阻碍，就不能自由移动。

外加电压通过升高的N端势能，降低一侧的P端势能，从而是阻碍减小。

如果供电电压（电子伏特）与能级（工作组）相同，自由电子和自由空穴就有足够的能量移动到交界区，如底部的数字显示，当一个自由电子在交界区遇到了一个空穴，电子可以下降到价带，并与空穴重组。

advances in mathematics介绍Advances in mathematics refer to the progress made in the field of mathematics that has greatly impacted various areas of science, technology, engineering, and even everyday life. These advances include discoveries, theories, techniques, algorithms, and computational methods that have broadened the understanding and application of mathematical concepts.One significant advance in mathematics is the development of calculus by Sir Isaac Newton and Gottfried Wilhelm Leibniz in the 17th century. Calculus allows for the study of change and the analysis of various mathematical functions, making it essential in physics, engineering, economics, and other sciences.Another important advance is the creation of non-Euclidean geometries, such as hyperbolic and elliptic geometries. These non-Euclidean geometries challenge the traditional Euclidean geometry and have applications in fields like relativity, computer graphics, and cryptography.The introduction of number theory and abstract algebra has also been a significant advancement in mathematics. Number theory deals with the properties and relationships of numbers, while abstract algebra studiesalgebraic structures such as groups, rings, and fields. These areas of mathematics have paved the way for cryptography, coding theory, and other fields related to secure communication and data encryption.Advances in mathematical modeling and simulation have greatly impacted various scientific disciplines. Mathematical models help scientists and researchers understand complex phenomena and make predictions about real-world systems. Simulation techniques, such as Monte Carlo methods and numerical optimization, allow for the analysis of large datasets and the implementation of mathematical models into computer algorithms.Furthermore, the development of computational methods and algorithms has greatly expanded the capabilities of mathematical analysis. Techniques such as linear programming, network optimization, and numerical analysis have revolutionized fields such as operations research, data analysis, and computer science.Advances in mathematics have also led to breakthroughs in cryptography, data compression, image processing, machine learning, and artificial intelligence. These advancements have influenced various technological advancements, including the development of fastercomputers, improved data storage, and advanced algorithms.In summary, advances in mathematics have transformed various fields of science, technology, and everyday life by providing tools and concepts for understanding and solving complex problems. The continuous progress in mathematics continues to shape our understanding of the world and drive innovation in various disciplines.。

丘奇-图灵论题、超计算和人工智能如果我们认可丘奇-图灵论题和相似性原则，那么人就是图灵机。

所有目前的人工智能工作都是建立在这个认同之上的。

丘奇-图灵论题和洪加威相似性原则是战斗在第一线的研究者的工作假设。

丘奇-图灵论题说的是能行性（effectiveness），而相似性原则则是说的效率（efficiency）。

多依奇在他的科普著作里提到，他认为人类有史以来有4个伟大理论：达尔文进化论、波普尔证伪理论、量子理论和计算理论。

他的工作把量子理论和计算理论整合到一起。

但他不认为人脑是量子计算机，这点有别于彭罗斯。

自然科学和唯物论、经验论的关系要比唯心论、理性论的关系更近，背后都有一条归约主义路线图（reductionist），从生物到化学，再到物理。

一个有机体最终被归约到物理化学过程，一个活的、有意识的生物最终会被归约到神经网络过程。

这是自顶向下的思路。

近来也有自底向上的思路，例如细胞自动机，利用很简单的几条规则，就可展示很复杂的行为。

沃尔夫勒姆在他的《新科学》（A New Kind of Science ）一书中提到的这种现象其实早就被数学家康韦（John Conway）观察到，他设计了《生命游戏》（Game of Life ），企图利用细胞自动机来说明确定性和自由意志的问题。

高德纳在评论康韦的工作时说：所有规则都是确定性的，但游戏的演进过程却给人一种自主性的感觉。

高老喜欢阅读英国女作家塞耶斯（Dorothy Sayers），她更偏爱写剧本而不是小说，她说剧本给了演员发挥再创作的机会，这个再创作就是自由意志。

高老说量子力学为自由意志提供了空间，也使得上帝可以操纵世界而不违反物理定律。

所谓“太阳底下没啥是新鲜的”，但几条简单规则展示的行为却无法解释。

如果考虑数学定理证明，我们可以说勾股定理不新鲜——毕竟从简单几何公理不用费太大力气就可证明。

但我们敢说黎曼猜想也不新鲜或者庞加莱猜想的证明也不新鲜因为所有结果不都是可以从起始点（那几条数论公理）推出吗？这似乎模糊了柏拉图主义（实在论）和构造主义的边界。

扩展巴科斯范式（转⾃维基）https:///wiki/%E6%89%A9%E5%B1%95%E5%B7%B4%E7%A7%91%E6%96%AF%E8%8C%83%E5%BC%8F扩展巴科斯范式[]维基百科，⾃由的百科全书扩展巴科斯-瑙尔范式(EBNF, Extended Backus–Naur Form)是表达作为描述计算机和的正规⽅式的的(metalanguage)符号表⽰法。

它是基本(BNF)元语法符号表⽰法的⼀种扩展。

它最初由开发，最常⽤的 EBNF 变体由标准，特别是 ISO-14977 所定义。

⽬录[隐藏]基本[]，如由即可视字符、数字、标点符号、空⽩字符等组成的的。

EBNF 定义了把各符号序列分别指派到的:digit excluding zero = "1" | "2" | "3" | "4" | "5" | "6" | "7" | "8" | "9" ;digit = "0" | digit excluding zero ;这个产⽣规则定义了在这个指派的左端的⾮终结符digit。

竖杠表⽰可供选择，⽽终结符被引号包围，最后跟着分号作为终⽌字符。

所以digit是⼀个 "0"或可以是 "1或2或3直到9的⼀个digit excluding zero"。

产⽣规则还可以包括由逗号分隔的⼀序列终结符或⾮终结符:twelve = "1" , "2" ;two hundred one = "2" , "0" , "1" ;three hundred twelve = "3" , twelve ;twelve thousand two hundred one = twelve , two hundred one ;可以省略或重复的表达式可以通过花括号 { ... } 表⽰:natural number = digit excluding zero , { digit } ;在这种情况下，字符串1, 2, ...,10,...,12345,... 都是正确的表达式。

计算机科学外文原版图书目录：Innovations in Robot Mobility and Control机器人灵活性与控制的革新Machine Learning and Robot Perception机器学习与机器人的感知Modelling and Optimization of Biotechnological Processes生物技术过程的建模与最优化：人工智能方法Advances in Multiresolution for Geometric Modelling几何建模的多分辨率进展Agent-based Modeling Meets Gaming Simulation基于主体的建模与博奕模拟相遇Algebraic Aspects of the Advanced Encryption Standard先进加密标准的代数方面Algebraic Geometry and Geometric Modeling代数几何学与几何建模All of Nonparametric Statistics 非参数统计大全An Annotated Timeline of Operations Research运筹学注解时限Classification —the Ubiquitous Challenge分类—随处存在的挑战Classification Algorithms for Codes and Designs代码与设计用分类算法Combinatorial Optimization in Communication Networks通信网络中的组合最优化Communication SystemsComponent Models and Systems for Grid Applications格应用的组件模型与系统会议录Computational Electromagnetics计算电磁学Computer Vision Beyond the Visible Spectrum可见光谱以外的计算机视觉Condition Monitoring and Control for Intelligent Manufacturing智能制造用状态监控Constraint Theory约束理论：多维数学模型管理Constraint-Based Verification基于约束的验证Continuous System Simulation连续系统模拟Control of Traffic Systems in Buildings建筑物中的运输系统控制：现代监视与最佳控制应用Coordinated Multiuser Communications协同多用户通信Data Quality数据质量：概念、方法论与技术Design and Performance of 3G Wireless Networks and Wireless Lans3G 无线网络与无线局域网的设计与性能Design of Embedded Control Systems嵌入式控制系统的设计Digital Economy and Social DesignDigital Economy and Social Design数字经济与社会设计E-government and Public Sector Process Rebuilding电子政务与公共部门过程重建E-Merging Media电子融合媒体Enabling Semantic Web Services促进语义网服务Enabling Technologies for Wireless E-Business无线电子商务用促动技术Engineering and Managing Software Requirements工程与管理软件要求Enterprise Collaboration 企业协作Enterprise Knowledge Infrastructures企业知识基础结构Enterprise Ontology企业本体结构分析：理论与方法学Enterprise Service Oriented ArchitecturesEnterprise Service Oriented Architectures面向企业服务的体系结构：概念、挑战、建议Essential Software Architecture基本软件架构Evolutionary Computation for Modeling and Optimization建模与优化的演化计算Formal Modelling in Electronic CommerceFormal Modelling in Electronic Commerce电子商务的形式建模Form-Oriented Analysis面向格式的分析：基于格式的应用建模新方法Free Convection Film Flows and Heat Transfer 自由对流薄膜流与传热Free Convection Film Flows and Heat Transfer自由对流薄膜流与传热Handbook on Quality and Standardisation in E-LearningHandbook on Quality and Standardisation in E-Learning电子商务中质量与标准化手册Inference in Hidden Markov Models隐马尔可夫模型中的推论Information and Communication Technologies in Tourism 2005Information and Communication Technologies in Tourism 2005旅游业的信息与通信技术2005会议录Information Technology AuditingInformation Technology Auditing信息技术审计：发展中的议程Innovations in Robot Mobility and Control机器人灵活性与控制的革新Integrated Information Management综合信息管理：成功产业概念在IT中的应用Intelligence and Security Informatics for International Security国际安全用智能与安全信息学：信息综合与数据挖掘Intelligent Algorithms in Ambient and Biomedical Computing生物医学计算中的智能算法Interorganisational Standards跨组织标准：柔性供应链用Web服务规格的管理Lattice Boltzmann Modeling点阵玻尔兹曼建模Mathematical Methods and Modelling in Hydrocarbon Exploration and Production烃类勘探与生产的数学方法和建模Mathematical Problems in Image Processing图像处理中的数学问题Medical Informatics医学信息学：生物医学中的知识管理与数据挖掘Metaheuristics for Hard OptimizationMetaheuristics for Hard Optimization超启发式优化方法与案例研究Metaheuristics for Hard Optimization超启发式优化：方法与案例研究Modeling and Simulation in Scilab Scicos基于ScilabScicos的建模与仿真Modeling and Simulation Tools for Emerging Telecommunication Networks电信网络用建模与仿真工具New Algorithms for Macromolecular Simulation大分子模拟的新算法New Developments in Parsing Technology句法分析技术新发展Numerical Optimization数值优化：理论与实践方面Numerical Solution of Partial Differential Equations on Parallel Computers并行计算机上的偏微分方程的数值解Optical Communication Theory and Techniques光通信理论与技术Optimized Bayesian Dynamic Advising优化贝叶斯动态咨询：理论与算法Routine Human-Competitive Machine Intelligence例行与人竞争的机器智能Search Methodologies搜索方法论：优化与判定支持技术Statistical and Inductive Inference by Minimum Message Length最小信息长度的统计与归纳推理Stochastic Ageing and Dependence for Reliability用于决策可靠性的随机老化与依赖The Core Test Wrapper HandbookIEEE 1500标准手册The Economics of Online Markets and ICT Networks在线市场与ICT网络经济学Theoretical and Experimental DNA Computation理论与实验DNA计算。

离散数学中英⽂名词对照表离散数学中英⽂名词对照表外⽂中⽂AAbel category Abel 范畴Abel group (commutative group) Abel 群(交换群)Abel semigroup Abel 半群accessibility relation 可达关系action 作⽤addition principle 加法原理adequate set of connectives 联结词的功能完备（全）集adjacent 相邻（邻接）adjacent matrix 邻接矩阵adjugate 伴随adjunction 接合affine plane 仿射平⾯algebraic closed field 代数闭域algebraic element 代数元素algebraic extension 代数扩域（代数扩张）almost equivalent ⼏乎相等的alternating group 三次交代群annihilator 零化⼦antecedent 前件anti symmetry 反对称性anti-isomorphism 反同构arboricity 荫度arc set 弧集arity 元数arrangement problem 布置问题associate 相伴元associative algebra 结合代数associator 结合⼦asymmetric 不对称的(⾮对称的)atom 原⼦atomic formula 原⼦公式augmenting digeon hole principle 加强的鸽⼦笼原理augmenting path 可增路automorphism ⾃同构automorphism group of graph 图的⾃同构群auxiliary symbol 辅助符号axiom of choice 选择公理axiom of equality 相等公理axiom of extensionality 外延公式axiom of infinity ⽆穷公理axiom of pairs 配对公理axiom of regularity 正则公理axiom of replacement for the formula Ф关于公式Ф的替换公式axiom of the empty set 空集存在公理axiom of union 并集公理Bbalanced imcomplete block design 平衡不完全区组设计barber paradox 理发师悖论base 基Bell number Bell 数Bernoulli number Bernoulli 数Berry paradox Berry 悖论bijective 双射bi-mdule 双模binary relation ⼆元关系binary symmetric channel ⼆进制对称信道binomial coefficient ⼆项式系数binomial theorem ⼆项式定理binomial transform ⼆项式变换bipartite graph ⼆分图block 块block 块图（区组）block code 分组码block design 区组设计Bondy theorem Bondy 定理Boole algebra Boole 代数Boole function Boole 函数Boole homomorophism Boole 同态Boole lattice Boole 格bound occurrence 约束出现bound variable 约束变量bounded lattice 有界格bridge 桥Bruijn theorem Bruijn 定理Burali-Forti paradox Burali-Forti 悖论Burnside lemma Burnside 引理Ccage 笼canonical epimorphism 标准满态射Cantor conjecture Cantor 猜想Cantor diagonal method Cantor 对⾓线法Cantor paradox Cantor 悖论cardinal number 基数Cartesion product of graph 图的笛卡⼉积Catalan number Catalan 数category 范畴Cayley graph Cayley 图Cayley theorem Cayley 定理center 中⼼characteristic function 特征函数characteristic of ring 环的特征characteristic polynomial 特征多项式check digits 校验位Chinese postman problem 中国邮递员问题chromatic number ⾊数chromatic polynomial ⾊多项式circuit 回路circulant graph 循环图circumference 周长class 类classical completeness 古典完全的classical consistent 古典相容的clique 团clique number 团数closed term 闭项closure 闭包closure of graph 图的闭包code 码code element 码元code length 码长code rate 码率code word 码字coefficient 系数coimage 上象co-kernal 上核coloring 着⾊coloring problem 着⾊问题combination number 组合数combination with repetation 可重组合common factor 公因⼦commutative diagram 交换图commutative ring 交换环commutative seimgroup 交换半群complement 补图(⼦图的余) complement element 补元complemented lattice 有补格complete bipartite graph 完全⼆分图complete graph 完全图complete k-partite graph 完全k-分图complete lattice 完全格composite 复合composite operation 复合运算composition (molecular proposition) 复合（分⼦）命题composition of graph (lexicographic product)图的合成（字典积）concatenation (juxtaposition) 邻接运算concatenation graph 连通图congruence relation 同余关系conjunctive normal form 正则合取范式connected component 连通分⽀connective 连接的connectivity 连通度consequence 推论（后承）consistent (non-contradiction) 相容性（⽆⽭盾性）continuum 连续统contraction of graph 图的收缩contradiction ⽭盾式（永假式）contravariant functor 反变函⼦coproduct 上积corank 余秩correct error 纠正错误corresponding universal map 对应的通⽤映射countably infinite set 可列⽆限集（可列集）covariant functor (共变)函⼦covering 覆盖covering number 覆盖数Coxeter graph Coxeter 图crossing number of graph 图的叉数cuset 陪集cotree 余树cut edge 割边cut vertex 割点cycle 圈cycle basis 圈基cycle matrix 圈矩阵cycle rank 圈秩cycle space 圈空间cycle vector 圈向量cyclic group 循环群cyclic index 循环（轮转）指标cyclic monoid 循环单元半群cyclic permutation 圆圈排列cyclic semigroup 循环半群DDe Morgan law De Morgan 律decision procedure 判决过程decoding table 译码表deduction theorem 演绎定理degree 次数,次(度)degree sequence 次(度)序列derivation algebra 微分代数Descartes product Descartes 积designated truth value 特指真值detect errer 检验错误deterministic 确定的diagonal functor 对⾓线函⼦diameter 直径digraph 有向图dilemma ⼆难推理direct consequence 直接推论（直接后承）direct limit 正向极限direct sum 直和directed by inclution 被包含关系定向discrete Fourier transform 离散 Fourier 变换disjunctive normal form 正则析取范式disjunctive syllogism 选⾔三段论distance 距离distance transitive graph 距离传递图distinguished element 特异元distributive lattice 分配格divisibility 整除division subring ⼦除环divison ring 除环divisor (factor) 因⼦domain 定义域Driac condition Dirac 条件dual category 对偶范畴dual form 对偶式dual graph 对偶图dual principle 对偶原则(对偶原理) dual statement 对偶命题dummy variable 哑变量（哑变元）Eeccentricity 离⼼率edge chromatic number 边⾊数edge coloring 边着⾊edge connectivity 边连通度edge covering 边覆盖edge covering number 边覆盖数edge cut 边割集edge set 边集edge-independence number 边独⽴数eigenvalue of graph 图的特征值elementary divisor ideal 初等因⼦理想elementary product 初等积elementary sum 初等和empty graph 空图empty relation 空关系empty set 空集endomorphism ⾃同态endpoint 端点enumeration function 计数函数epimorphism 满态射equipotent 等势equivalent category 等价范畴equivalent class 等价类equivalent matrix 等价矩阵equivalent object 等价对象equivalent relation 等价关系error function 错误函数error pattern 错误模式Euclid algorithm 欧⼏⾥德算法Euclid domain 欧⽒整环Euler characteristic Euler 特征Euler function Euler 函数Euler graph Euler 图Euler number Euler 数Euler polyhedron formula Euler 多⾯体公式Euler tour Euler 闭迹Euler trail Euler 迹existential generalization 存在推⼴规则existential quantifier 存在量词existential specification 存在特指规则extended Fibonacci number ⼴义 Fibonacci 数extended Lucas number ⼴义Lucas 数extension 扩充（扩张）extension field 扩域extension graph 扩图exterior algebra 外代数Fface ⾯factor 因⼦factorable 可因⼦化的factorization 因⼦分解faithful (full) functor 忠实（完满）函⼦Ferrers graph Ferrers 图Fibonacci number Fibonacci 数field 域filter 滤⼦finite extension 有限扩域finite field (Galois field ) 有限域（Galois 域）finite dimensional associative division algebra有限维结合可除代数finite set 有限（穷）集finitely generated module 有限⽣成模first order theory with equality 带符号的⼀阶系统five-color theorem 五⾊定理five-time-repetition 五倍重复码fixed point 不动点forest 森林forgetful functor 忘却函⼦four-color theorem(conjecture) 四⾊定理（猜想）F-reduced product F-归纳积free element ⾃由元free monoid ⾃由单元半群free occurrence ⾃由出现free R-module ⾃由R-模free variable ⾃由变元free-?-algebra ⾃由?代数function scheme 映射格式GGalileo paradox Galileo 悖论Gauss coefficient Gauss 系数GBN (G?del-Bernays-von Neumann system)GBN系统generalized petersen graph ⼴义 petersen 图generating function ⽣成函数generating procedure ⽣成过程generator ⽣成⼦（⽣成元）generator matrix ⽣成矩阵genus 亏格girth （腰）围长G?del completeness theorem G?del 完全性定理golden section number 黄⾦分割数（黄⾦分割率）graceful graph 优美图graceful tree conjecture 优美树猜想graph 图graph of first class for edge coloring 第⼀类边⾊图graph of second class for edge coloring 第⼆类边⾊图graph rank 图秩graph sequence 图序列greatest common factor 最⼤公因⼦greatest element 最⼤元（素）Grelling paradox Grelling 悖论Gr?tzsch graph Gr?tzsch 图group 群group code 群码group of graph 图的群HHajós conjecture Hajós 猜想Hamilton cycle Hamilton 圈Hamilton graph Hamilton 图Hamilton path Hamilton 路Harary graph Harary 图Hasse graph Hasse 图Heawood graph Heawood 图Herschel graph Herschel 图hom functor hom 函⼦homemorphism 图的同胚homomorphism 同态（同态映射）homomorphism of graph 图的同态hyperoctahedron 超⼋⾯体图hypothelical syllogism 假⾔三段论hypothese (premise) 假设(前提)Iideal 理想identity 单位元identity natural transformation 恒等⾃然变换imbedding 嵌⼊immediate predcessor 直接先⾏immediate successor 直接后继incident 关联incident axiom 关联公理incident matrix 关联矩阵inclusion and exclusion principle 包含与排斥原理inclusion relation 包含关系indegree ⼊次（⼊度）independent 独⽴的independent number 独⽴数independent set 独⽴集independent transcendental element 独⽴超越元素index 指数individual variable 个体变元induced subgraph 导出⼦图infinite extension ⽆限扩域infinite group ⽆限群infinite set ⽆限（穷）集initial endpoint 始端initial object 初始对象injection 单射injection functor 单射函⼦injective (one to one mapping) 单射（内射）inner face 内⾯inner neighbour set 内（⼊）邻集integral domain 整环integral subdomain ⼦整环internal direct sum 内直和intersection 交集intersection of graph 图的交intersection operation 交运算interval 区间invariant factor 不变因⼦invariant factor ideal 不变因⼦理想inverse limit 逆向极限inverse morphism 逆态射inverse natural transformation 逆⾃然变换inverse operation 逆运算inverse relation 逆关系inversion 反演isomorphic category 同构范畴isomorphism 同构态射isomorphism of graph 图的同构join of graph 图的联JJordan algebra Jordan 代数Jordan product (anti-commutator) Jordan乘积（反交换⼦）Jordan sieve formula Jordan 筛法公式j-skew j-斜元juxtaposition 邻接乘法Kk-chromatic graph k-⾊图k-connected graph k-连通图k-critical graph k-⾊临界图k-edge chromatic graph k-边⾊图k-edge-connected graph k-边连通图k-edge-critical graph k-边临界图kernel 核Kirkman schoolgirl problem Kirkman ⼥⽣问题Kuratowski theorem Kuratowski 定理Llabeled graph 有标号图Lah number Lah 数Latin rectangle Latin 矩形Latin square Latin ⽅lattice 格lattice homomorphism 格同态law 规律leader cuset 陪集头least element 最⼩元least upper bound 上确界（最⼩上界）left (right) identity 左（右）单位元left (right) invertible element 左（右）可逆元left (right) module 左（右）模left (right) zero 左（右）零元left (right) zero divisor 左（右）零因⼦left adjoint functor 左伴随函⼦left cancellable 左可消的left coset 左陪集length 长度Lie algebra Lie 代数line- group 图的线群logically equivanlent 逻辑等价logically implies 逻辑蕴涵logically valid 逻辑有效的（普效的）loop 环Lucas number Lucas 数Mmagic 幻⽅many valued proposition logic 多值命题逻辑matching 匹配mathematical structure 数学结构matrix representation 矩阵表⽰maximal element 极⼤元maximal ideal 极⼤理想maximal outerplanar graph 极⼤外平⾯图maximal planar graph 极⼤平⾯图maximum matching 最⼤匹配maxterm 极⼤项（基本析取式）maxterm normal form(conjunctive normal form) 极⼤项范式（合取范式）McGee graph McGee 图meet 交Menger theorem Menger 定理Meredith graph Meredith 图message word 信息字mini term 极⼩项minimal κ-connected graph 极⼩κ-连通图minimal polynomial 极⼩多项式Minimanoff paradox Minimanoff 悖论minimum distance 最⼩距离Minkowski sum Minkowski 和minterm (fundamental conjunctive form) 极⼩项（基本合取式）minterm normal form(disjunctive normal form)极⼩项范式（析取范式）M?bius function M?bius 函数M?bius ladder M?bius 梯M?bius transform (inversion) M?bius 变换（反演）modal logic 模态逻辑model 模型module homomorphism 模同态(R-同态)modus ponens 分离规则modus tollens 否定后件式module isomorphism 模同构monic morphism 单同态monoid 单元半群monomorphism 单态射morphism (arrow) 态射（箭）M?bius function M?bius 函数M?bius ladder M?bius 梯M?bius transform (inversion) M?bius 变换（反演）multigraph 多重图multinomial coefficient 多项式系数multinomial expansion theorem 多项式展开定理multiple-error-correcting code 纠多错码multiplication principle 乘法原理mutually orthogonal Latin square 相互正交拉丁⽅Nn-ary operation n-元运算n-ary product n-元积natural deduction system ⾃然推理系统natural isomorphism ⾃然同构natural transformation ⾃然变换neighbour set 邻集next state 下⼀个状态next state transition function 状态转移函数non-associative algebra ⾮结合代数non-standard logic ⾮标准逻辑Norlund formula Norlund 公式normal form 正规形normal model 标准模型normal subgroup (invariant subgroup) 正规⼦群（不变⼦群）n-relation n-元关系null object 零对象nullary operation 零元运算Oobject 对象orbit 轨道order 阶order ideal 阶理想Ore condition Ore 条件orientation 定向orthogonal Latin square 正交拉丁⽅orthogonal layout 正交表outarc 出弧outdegree 出次(出度)outer face 外⾯outer neighbour 外（出）邻集outerneighbour set 出(外)邻集outerplanar graph 外平⾯图Ppancycle graph 泛圈图parallelism 平⾏parallelism class 平⾏类parity-check code 奇偶校验码parity-check equation 奇偶校验⽅程parity-check machine 奇偶校验器parity-check matrix 奇偶校验矩阵partial function 偏函数partial ordering (partial relation) 偏序关系partial order relation 偏序关系partial order set (poset) 偏序集partition 划分,分划,分拆partition number of integer 整数的分拆数partition number of set 集合的划分数Pascal formula Pascal 公式path 路perfect code 完全码perfect t-error-correcting code 完全纠-错码perfect graph 完美图permutation 排列（置换）permutation group 置换群permutation with repetation 可重排列Petersen graph Petersen 图p-graph p-图Pierce arrow Pierce 箭pigeonhole principle 鸽⼦笼原理planar graph （可）平⾯图plane graph 平⾯图Pólya theorem Pólya 定理polynomail 多项式polynomial code 多项式码polynomial representation 多项式表⽰法polynomial ring 多项式环possible world 可能世界power functor 幂函⼦power of graph 图的幂power set 幂集predicate 谓词prenex normal form 前束范式pre-ordered set 拟序集primary cycle module 准素循环模prime field 素域prime to each other 互素primitive connective 初始联结词primitive element 本原元primitive polynomial 本原多项式principal ideal 主理想principal ideal domain 主理想整环principal of duality 对偶原理principal of redundancy 冗余性原则product 积product category 积范畴product-sum form 积和式proof (deduction) 证明（演绎）proper coloring 正常着⾊proper factor 真正因⼦proper filter 真滤⼦proper subgroup 真⼦群properly inclusive relation 真包含关系proposition 命题propositional constant 命题常量propositional formula(well-formed formula,wff)命题形式（合式公式）propositional function 命题函数propositional variable 命题变量pullback 拉回(回拖) pushout 推出Qquantification theory 量词理论quantifier 量词quasi order relation 拟序关系quaternion 四元数quotient (difference) algebra 商（差）代数quotient algebra 商代数quotient field (field of fraction) 商域（分式域）quotient group 商群quotient module 商模quotient ring (difference ring , residue ring) 商环（差环，同余类环）quotient set 商集RRamsey graph Ramsey 图Ramsey number Ramsey 数Ramsey theorem Ramsey 定理range 值域rank 秩reconstruction conjecture 重构猜想redundant digits 冗余位reflexive ⾃反的regular graph 正则图regular representation 正则表⽰relation matrix 关系矩阵replacement theorem 替换定理representation 表⽰representation functor 可表⽰函⼦restricted proposition form 受限命题形式restriction 限制retraction 收缩Richard paradox Richard 悖论right adjoint functor 右伴随函⼦right cancellable 右可消的right factor 右因⼦right zero divison 右零因⼦ring 环ring of endomorphism ⾃同态环ring with unity element 有单元的环R-linear independence R-线性⽆关root field 根域rule of inference 推理规则Russell paradox Russell 悖论Ssatisfiable 可满⾜的saturated 饱和的scope 辖域section 截⼝self-complement graph ⾃补图semantical completeness 语义完全的（弱完全的）semantical consistent 语义相容semigroup 半群separable element 可分元separable extension 可分扩域sequent ⽮列式sequential 序列的Sheffer stroke Sheffer 竖（谢弗竖）simple algebraic extension 单代数扩域simple extension 单扩域simple graph 简单图simple proposition (atomic proposition) 简单（原⼦）命题simple transcental extension 单超越扩域simplication 简化规则slope 斜率small category ⼩范畴smallest element 最⼩元（素）Socrates argument Socrates 论断（苏格拉底论断）soundness (validity) theorem 可靠性（有效性）定理spanning subgraph ⽣成⼦图spanning tree ⽣成树spectra of graph 图的谱spetral radius 谱半径splitting field 分裂域standard model 标准模型standard monomil 标准单项式Steiner triple Steiner 三元系⼤集Stirling number Stirling 数Stirling transform Stirling 变换subalgebra ⼦代数subcategory ⼦范畴subdirect product ⼦直积subdivison of graph 图的细分subfield ⼦域subformula ⼦公式subdivision of graph 图的细分subgraph ⼦图subgroup ⼦群sub-module ⼦模subrelation ⼦关系subring ⼦环sub-semigroup ⼦半群subset ⼦集substitution theorem 代⼊定理substraction 差集substraction operation 差运算succedent 后件surjection (surjective) 满射switching-network 开关⽹络Sylvester formula Sylvester公式symmetric 对称的symmetric difference 对称差symmetric graph 对称图symmetric group 对称群syndrome 校验⼦syntactical completeness 语法完全的（强完全的）Syntactical consistent 语法相容system ?3 , ?n , ??0 , ??系统?3 , ?n , ??0 , ??system L 公理系统 Lsystem ?公理系统?system L1 公理系统 L1system L2 公理系统 L2system L3 公理系统 L3system L4 公理系统 L4system L5 公理系统 L5system L6 公理系统 L6system ?n 公理系统?nsystem of modal prepositional logic 模态命题逻辑系统system Pm 系统 Pmsystem S1 公理系统 S1system T (system M) 公理系统 T(系统M)Ttautology 重⾔式（永真公式）technique of truth table 真值表技术term 项terminal endpoint 终端terminal object 终结对象t-error-correcing BCH code 纠 t -错BCH码theorem (provable formal) 定理（可证公式）thickess 厚度timed sequence 时间序列torsion 扭元torsion module 扭模total chromatic number 全⾊数total chromatic number conjecture 全⾊数猜想total coloring 全着⾊total graph 全图total matrix ring 全⽅阵环total order set 全序集total permutation 全排列total relation 全关系tournament 竞赛图trace (trail) 迹tranformation group 变换群transcendental element 超越元素transitive 传递的tranverse design 横截设计traveling saleman problem 旅⾏商问题tree 树triple system 三元系triple-repetition code 三倍重复码trivial graph 平凡图trivial subgroup 平凡⼦群true in an interpretation 解释真truth table 真值表truth value function 真值函数Turán graph Turán 图Turán theorem Turán 定理Tutte graph Tutte 图Tutte theorem Tutte 定理Tutte-coxeter graph Tutte-coxeter 图UUlam conjecture Ulam 猜想ultrafilter 超滤⼦ultrapower 超幂ultraproduct 超积unary operation ⼀元运算unary relation ⼀元关系underlying graph 基础图undesignated truth value ⾮特指值undirected graph ⽆向图union 并(并集)union of graph 图的并union operation 并运算unique factorization 唯⼀分解unique factorization domain (Gauss domain) 唯⼀分解整域unique k-colorable graph 唯⼀k着⾊unit ideal 单位理想unity element 单元universal 全集universal algebra 泛代数（Ω代数）universal closure 全称闭包universal construction 通⽤结构universal enveloping algebra 通⽤包络代数universal generalization 全称推⼴规则universal quantifier 全称量词universal specification 全称特指规则universal upper bound 泛上界unlabeled graph ⽆标号图untorsion ⽆扭模upper (lower) bound 上（下）界useful equivalent 常⽤等值式useless code 废码字Vvalence 价valuation 赋值Vandermonde formula Vandermonde 公式variery 簇Venn graph Venn 图vertex cover 点覆盖vertex set 点割集vertex transitive graph 点传递图Vizing theorem Vizing 定理Wwalk 通道weakly antisymmetric 弱反对称的weight 重（权）weighted form for Burnside lemma 带权形式的Burnside引理well-formed formula (wff) 合式公式(wff) word 字Zzero divison 零因⼦zero element (universal lower bound) 零元（泛下界）ZFC (Zermelo-Fraenkel-Cohen) system ZFC系统form)normal(Skolemformnormalprenex-存在正则前束范式(Skolem 正则范式)3-value proposition logic 三值命题逻辑。

4期李姝等:互联网新闻敏感信息识别方法的研究689machinesf J].Applied Stochastic Models in Business and Industry, 2005,21(2)：111-136.[5]Chen T,Guestrin C.XGBoost:a scalable tree boosting system[C]//Knowledge Discovery and Data Mining,2016：785-794.[6]R D Seeja,A Suresh.Deep learning based skin lesion segmentationand classification of melanoma using support vector machine (SVM),2019,20(5)：1555-1561.[7]Kim Y.Convolutional neural networks for sentence classification[C]//Empirical Methods in Natural Language Processing,2014:1746-1751.[8]Zhou P,Shi W,Tian J,et al.Attention-based bidirectional longshort-term memory networks for relation classification[C]//Meet­ing of the Association for Computational Linguistics,2016:207-212.[9]Hugo Crisdstomo de Castro Filho,Osmar Abflio de CarvalhoJunior,Osmar Luiz Ferreira de Carvalho,et al.Rice crop detection using LSTM,Bi-LSTM,and machine learning models from senti-nel-1time series[J].Remote Sensing,2020,12(16)：2655,doi:10.3390/rsl2162655.[10]Vaswani A,Shazeer N,Parmar N,et al.Attention is All you Need[C]//Neural Information Processing Sy s tems,2017：5998-6008.[11]Fenigstein,Allan.Self-consciousness,self-attention,and social in­teraction[J].Journal of Personality&Social Psychology,1979,37(1):75-86.[12]Devlin J,Chang M,Lee K,et al.BERT:pretraining of deep bidi­rectional transformers for language understanding[J].Computer Science,2018,arXiv：1810.04805vl.[13]Liu Y,Ott M,Goyal N,et al.RoBERTa:a robustly optimizedBERT pretraining approach[J].Computer Science,2019,arXiv：1907.11692vl.[14]Yang Z,Dai Z,Yang Y,et al.XLNet:generalized autoregressivepretraining for language understanding[J].Computer Science, 2019,arXiv：1906.08237.[15]Wang Kun,Zheng Yi,Fang Shu-ya,et al.Aspect-level sentiment a-nalysis of long text based on text filtering and improved BERT[J/ OL].Computer Applications:1-7[2020-09-02],http：//kns./kcms/detail/51.1307.TP.20200606.1018.002.html. [16]Yu Yang-wu,Wu Shun-xiang.Printing data acquisition systembased on keyword matching[J].Computer Engineering,2008(11):263-265.[17]Liu Kan,Yuan Yun-ying.Research on short text feature extractionand clustering based on autoencoder[J].Journal of Peking Univer­sity,2015,51(2)：282-288.[18]Wang Nan-ti.Research on improved text representation modelbased on BERT[D].Chongqing:Southwest University,2019. [19]Hochreiter S,Schmidhuber J.Long short-term memory[J].NeuralComputation,1997,9(8)：1735-1780.[20]Lin L,Luo H,Huang R,et al.Recurrent models of visual co-atten­tion for person re-identification[J].IEEE Access,2019,doi:10.1109/ACCESS.2018.2890394.《小型微型计算机系统》期刊简介《小型微型计算机系统》创刊于1980年，由中国科学院主管、中国科学院沈阳计算技术研究所主办,为中国计算机学会会刊.创刊40年来，该刊主要面向国内从事计算机研究和教学的科研人员与大专院校的教师，始终致力于传播我国计算机研究领域最新科研和应用成果，发表高水平的学术文章和高质量的应用文章,坚持严谨的办刊风格，因而受到计算机业界的普遍欢迎.《小型微型计算机系统》所刊登的内容涵盖了计算机学科的各个领域,包括计算机科学理论、体系结构、软件、数据库理论、网络（含传感器网络）、人工智能与算法、服务计算、计算机图形与图像等.在收录与检索方面，在国内入选为:《中文核心期刊要目总览》、《中国学术期刊文摘（中英文版）》、《中国科学引文数据库》（CSCD）、《中国科技论文统计源期刊》、《中国科技论文统计与分析》（RCCSE），并被中国科技论文与引文数据库、中国期刊全文数据库、中国科技期刊精品数据库、中国学术期刊综合评价数据库、中国核心期刊（遴选）数据库等收录.还被英国《科学文摘》（INSPEC）、俄罗斯《文摘杂志》（AJ）、美国《剑桥科学文摘）（CSA（NS）和CSA（T））、美国《乌利希期刊指南》（UPD）、日本《日本科学技术振兴机构中国文献数据库》（JST）和波兰《哥白尼索弓IXIC）收录.。

萨丕尔－沃尔夫假设主要内容美国人萨丕尔及其弟子沃尔夫提出的有关语言与思维关系的假设是这个领域里至今为止最具争议的理论。

沃尔夫首先提出，所有高层次的思维都倚赖于语言。

说得更明白一些，就是语言决定思维，这就是语言决定论这一强假设。

由于语言在很多方面都有不同，沃尔夫还认为，使用不同语言的人对世界的感受和体验也不同，也就是说与他们的语言背景有关，这就是语言相对论。

Linguistic relativity stems from a question about the relationship between language and thought, about whether one's language determines the way one thinks. This question has given birth to a wide array of research within a variety of different disciplines, especially anthropology, cognitive science, linguistics, and philosophy. Among the most popular and controversial theories in this area of scholarly work is the theory of linguistic relativity(also known as the Sapir–Whorf hypothesis). An often cited "strong version" of the claim, first given by Lenneberg in 1953 proposes that the structure of our language in some way determines the way we perceive the world. A weaker version of this claim posits that language structure influences the world view adopted by the speakers of a given language, but does not determine it.[1]由萨丕尔－沃尔夫假设的这种强假设可以得出这样的结论：根本没有真正的翻译，学习者也不可能学会另一种文化区的语言，除非他抛弃了他自己的思维模式，并习得说目的语的本族语者的思维模式。

博士生发一篇information fusion Information Fusion: Enhancing Decision-Making through the Integration of Data and KnowledgeIntroduction:Information fusion, also known as data fusion or knowledge fusion, is a rapidly evolving field in the realm of decision-making. It involves the integration and analysis of data and knowledge from various sources to generate meaningful and accurate information. In this article, we will delve into the concept of information fusion, explore its key components, discuss its application in different domains, and highlight its significance in enhancingdecision-making processes.1. What is Information Fusion?Information fusion is the process of combining data and knowledge from multiple sources to provide a comprehensive and accurate representation of reality. The goal is to overcome the limitations inherent in individual sources and derive improved insights and predictions. By assimilating diverse information,information fusion enhances situational awareness, reduces uncertainty, and enables intelligent decision-making.2. Key Components of Information Fusion:a. Data Sources: Information fusion relies on various data sources, which can include sensors, databases, social media feeds, and expert opinions. These sources provide different types of data, such as text, images, audio, and numerical measurements.b. Data Processing: Once data is collected, it needs to be processed to extract relevant features and patterns. This step involves data cleaning, transformation, normalization, and aggregation to ensure compatibility and consistency.c. Information Extraction: Extracting relevant information is a crucial step in information fusion. This includes identifying and capturing the crucial aspects of the data, filtering out noise, and transforming data into knowledge.d. Knowledge Representation: The extracted information needs to be represented in a meaningful way for integration and analysis.Common methods include ontologies, semantic networks, and knowledge graphs.e. Fusion Algorithms: To integrate the information from various sources, fusion algorithms are employed. These algorithms can be rule-based, model-based, or data-driven, and they combine multiple pieces of information to generate a unified and coherent representation.f. Decision-Making Processes: The ultimate goal of information fusion is to enhance decision-making. This requires the fusion of information with domain knowledge and decision models to generate insights, predictions, and recommendations.3. Applications of Information Fusion:a. Defense and Security: Information fusion plays a critical role in defense and security applications, where it improves intelligence analysis, surveillance, threat detection, and situational awareness. By integrating information from multiple sources, such as radars, satellites, drones, and human intelligence, it enables effective decision-making in complex and dynamic situations.b. Health Monitoring: In healthcare, information fusion is used to monitor patient health, combine data from different medical devices, and provide real-time decision support to medical professionals. By fusing data from wearables, electronic medical records, and physiological sensors, it enables early detection of health anomalies and improves patient care.c. Smart Cities: Information fusion offers enormous potential for the development of smart cities. By integrating data from multiple urban systems, such as transportation, energy, and public safety, it enables efficient resource allocation, traffic management, and emergency response. This improves the overall quality of life for citizens.d. Financial Markets: In the financial sector, information fusion helps in the analysis of large-scale and diverse datasets. By integrating data from various sources, such as stock exchanges, news feeds, and social media mentions, it enables better prediction of market trends, risk assessment, and investmentdecision-making.4. Significance of Information Fusion:a. Enhanced Decision-Making: Information fusion enables decision-makers to obtain comprehensive and accurate information, reducing uncertainty and improving the quality of decisions.b. Improved Situational Awareness: By integrating data from multiple sources, information fusion enhances situational awareness, enabling timely and informed responses to dynamic and complex situations.c. Risk Reduction: By combining information from diverse sources, information fusion improves risk assessment capabilities, enabling proactive and preventive measures.d. Resource Optimization: Information fusion facilitates the efficient utilization of resources by providing a holistic view of the environment and enabling optimization of resource allocation.Conclusion:In conclusion, information fusion is a powerful approach to enhance decision-making by integrating data and knowledge from multiple sources. Its key components, including data sources, processing, extraction, knowledge representation, fusion algorithms, and decision-making processes, together create a comprehensive framework for generating meaningful insights. By applying information fusion in various domains, such as defense, healthcare, smart cities, and financial markets, we can maximize the potential of diverse information sources to achieve improved outcomes.。

英语教资高中试题及答案一、单选题（每题2分，共20分）1. The book is said to have been written by Mark Twain, butI'm not sure ________.A. that it is trueB. if it is trueC. whether it is trueD. that it is false答案：C2. The teacher asked the students to stop ________ and listen to him.A. talkB. to talkC. talkingD. talked答案：C3. ________ the heavy rain, the match had to be put off.A. Because ofB. Owing toC. Due toD. In spite of答案：A4. The company has ________ a new policy to attract more young talents.A. introducedB. inventedC. createdD. developed答案：A5. She is ________ to be a good teacher because she is patient and knowledgeable.A. likelyB. probableC. possibleD. potential答案：A二、完形填空（每题1分，共10分）The story of the old man and the sea is a classic tale of perseverance and determination. Despite his age, the old man continues to fish every day, hoping to catch a big one. One day, he finally catches a huge fish, but it is a struggle to bring it in. The fish is so big that it takes him three days and three nights to reel it in. By the time he gets back to the shore, the fish is almost entirely eaten by sharks, but the old man is still proud of his accomplishment.6. The old man is determined to catch a big fish because________.A. he needs moneyB. he enjoys the challengeC. he is boredD. he wants to prove himself答案：B7. The old man's struggle with the fish is a symbol of ________.A. his old ageB. his strengthC. his willpowerD. his loneliness答案：C8. The sharks represent ________.A. the inevitability of lossB. the unpredictability of natureC. the cruelty of the seaD. the old man's enemies答案：A9. The old man's pride in his accomplishment shows that ________.A. he is vainB. he is satisfied with the outcomeC. he values the effort more than the resultD. he is delusional答案：C10. The story is a classic because ________.A. it is entertainingB. it is easy to readC. it has a universal themeD. it is based on a true story答案：C三、阅读理解（每题2分，共30分）Passage 1The role of technology in education has been a topic of debate for many years. Some argue that technology can enhance learning by providing students with access to a wealth of information and interactive tools. Others believe that too much reliance on technology can lead to a lack of critical thinking and social skills. This article will explore both sides of the argument and present evidence from recent studies.11. What is the main topic of the article?A. The benefits of technology in educationB. The drawbacks of technology in educationC. The role of technology in educationD. The future of education without technology答案：C12. What does the article aim to do?A. Convince readers of the benefits of technologyB. Present evidence from recent studiesC. Provide a balanced view of the debateD. Advocate for the complete removal of technology from education答案：CPassage 2In a recent study, researchers found that students who used digital devices for learning performed better in certain subjects, such as math and science, compared to those who did not. However, the same study also showed that these students had a harder time focusing on tasks that required sustained attention, such as reading a book or writing an essay.13. What was the finding of the recent study?A. Digital devices improve performance in all subjects.B. Students using digital devices had better focus.C. Digital devices enhance performance in math and science.D. Digital devices have no impact on learning.答案：C14. What was the negative effect of using digital devices according to the study?A. Decreased performance in math and scienceB. Difficulty in focusing on tasks requiring sustained attentionC. Increased reliance on technology for all tasksD. A decline in social skills答案：B四、写作题（共40分）15. Write an essay discussing the impact of social media on teenagers' mental health. Your essay should include the following points:- The prevalence of social media among teenagers- The potential benefits of social media for mental health - The potential risks of social。