Extended discrete KP hierarchy and its reductions from a geometric viewpoint
中国哲学简史英语

中国哲学简史英语Here is an essay on the topic of "A Brief History of Chinese Philosophy" with the length of over 1000 words, written in English without any extra punctuation marks in the body of the text.Chinese philosophy has a long and rich history dating back thousands of years. It has had a profound influence not only on China but also on the broader Asian region and, to some degree, the world at large. While Western philosophy is often characterized by its emphasis on logic rationality and the pursuit of universal truths Chinese philosophy tends to be more holistic contextual and focused on practical wisdom for living a good life.One of the earliest and most influential schools of Chinese philosophy is Confucianism founded by the philosopher Confucius who lived in the 6th century BCE. Confucianism emphasizes the importance of social harmony and the cultivation of moral virtues such as benevolence righteousness propriety and filial piety. The Confucian ideal is the junzi or gentleman a moral exemplar who embodies these virtues and acts as a model for others to emulate. Central to Confucianism is the concept of ren or humaneness which encompasses love compassion and concern for others. Confuciusbelieved that through the practice of ren and the fulfillment of one's social roles and responsibilities one could achieve personal and societal flourishing.Another major philosophical tradition in China is Daoism founded by the legendary figure Laozi. Daoism offers a radically different perspective from Confucianism emphasizing the importance of living in harmony with the natural world and the mysterious Dao or "Way" that underlies all of reality. Daoists believe that true wisdom lies in embracing the natural flow of life rather than trying to impose rigid social structures and norms. The Daoist ideal is the zhen ren or "authentic person" who embodies the qualities of spontaneity simplicity and effortless action. Daoism also places great emphasis on the cultivation of inner tranquility and the attainment of spiritual enlightenment.The philosophical tradition of Chinese Buddhism which was introduced to China in the 1st century CE also had a significant impact on Chinese thought. Drawing on the teachings of the Buddha Chinese Buddhism developed its own unique schools and practices such as Chan or Zen Buddhism. Chinese Buddhists emphasized the importance of achieving enlightenment through meditation and the direct experience of the true nature of reality. They also incorporated Daoist and Confucian elements into their teachings leading to a rich synthesis of philosophical and religious ideas.In addition to these major philosophical traditions China has also produced a number of other influential thinkers and schools of thought. The Mohists for example emphasized the importance of universal love and impartial care while the Legalists advocated a system of strict laws and harsh punishments to maintain social order. The School of Yin-Yang and the Five Elements developed a comprehensive cosmological system that sought to explain the workings of the natural world. The Neo-Confucianists of the Song and Ming dynasties meanwhile sought to revitalize and reinterpret Confucian teachings in light of Buddhist and Daoist influences.Despite the diversity of Chinese philosophy certain common themes and approaches can be identified. One is the emphasis on holistic thinking and the interconnectedness of all things. Chinese philosophers tended to see the world as a vast interconnected web of relationships and energies rather than a collection of discrete entities. They also placed great importance on the role of ritual propriety and hierarchy in maintaining social stability and harmony.Another key aspect of Chinese philosophy is its practical orientation. Rather than engaging in abstract metaphysical speculation Chinese thinkers were more concerned with developing practical wisdom for living a virtuous and fulfilling life. The goal was not simply to arrive at universal truths but to cultivate moral character and create aharmonious social order.At the same time Chinese philosophy has also grappled with deep metaphysical and existential questions. Thinkers like Laozi and the Buddhists developed sophisticated theories about the nature of reality the self and the ultimate ground of being. They explored profound questions about the meaning of life the causes of human suffering and the path to spiritual enlightenment.Overall the history of Chinese philosophy is a rich and complex tapestry. It encompasses a diverse array of schools of thought that have evolved and interacted with each other over thousands of years. While it has its own distinctive features Chinese philosophy also shares certain commonalities with Western philosophical traditions particularly in its emphasis on ethics practical wisdom and the cultivation of moral character.As China's influence on the global stage continues to grow the insights and perspectives of Chinese philosophy will likely become increasingly relevant and important for the rest of the world. Understanding the depth and breadth of this philosophical tradition can not only enrich our own intellectual and spiritual lives but also help us navigate the complex challenges of the 21st century. By engaging with Chinese philosophy we may discover new ways ofthinking about the human condition the natural world and our place in the cosmos.。
Baseband

An equivalent baseband signal or equivalent lowpass signal is – in analog and digital modulation methods with constant carrier frequency (for example ASK, PSK and QAM, but notFSK) – a complex valued representation of the modulated physical signal (the so-called passband signal or RF signal). The equivalent baseband signal is where is the inphase signal, the quadrature phase signal, and the imaginary unit. In a digital modulation method, the and signals of each modulation symbol are evident from the constellation diagram. The frequency spectrum of this signal includes negative as well as positive frequencies. The physical passband signal corresponds to
Digital baseband transmission [edit]
Main article: Line code Digital baseband transmission, also known as line coding,[3] aims at transferring a digital bit stream over baseband channel, typically an unfiltered wire, contrary to passbandtransmission, also known as carrier-modulated transmission.[4] Passband transmission makes communication possible over a bandpass filtered channel, such as the telephone network local-loop or a band-limited wireless channel. An unfiltered wire is intrinsically a low-pass transmission channel, while a line code is intrinsically a pulse wave signal that occupies a frequency spectrum of infinite bandwidth. According to the Nyquist theorem, error-free detection of the line code requires a channel bandwidth of at least the Nyquist rate, which is half the line code pulse rate.
Discrete Nonholonomic Lagrangian Systems on Lie Groupoids

and

and M. Uhlmann†
Potsdam Institute for Climate Impact Research, D-14412 Potsdam
October 31, 2002
Abstract We construct an orthogonal wavelet basis for the interval using a linear combination of Legendre polynomials. The coefficients are taken as appropriate roots of Chebyshev polynomials of the second kind. The one-dimensional transform is applied to analytical data and appropriate definitions of a scalogram as well as local and global spectra are presented. The transform is then extended to the multi-dimensional case. Analyses of one- and twodimensional data from a direct numerical simulation of turbulent channel flow demonstrate the potential of the method.
Orthonormal polynomial wavelets on the interval and applications to the analysis of turbulent flow fields
Official Journal of the European Communities

COMMISSION DECISIONof27June2002amending Annex II of Directive2000/53/EC of the European Parliament and of the Council onend-of-life vehicles(notified under document number C(2002)2238)Text withEEA relevance)(2002/525/EC)THE COMMISSION OF THE EUROPEAN COMMUNITIES,Having regard to the Treaty establishing the European Commu-nity,Having regard to Directive2000/53/EC of the European Parlia-ment and of the Council of18September2000on end-of-life vehicles(1),and in particular Article4(2)(b)thereof,Whereas:(1)Under Directive2000/53/EC the Commission is requiredto evaluate certain hazardous substances prohibited pur-suant to Article4(2)(a)of that Directive.(2)Having carried out the requisite technical and scientificassessments the Commission has reached a number ofconclusions.(3)Certain materials and components containing lead,mer-cury,cadmium or hexavalent chromium should be ex-empt or continue to be exempt from the prohibition,since the use of these hazardous substances in those spe-cific materials and components is still unavoidable.(4)Some exemptions from the prohibition for certain speci-fic materials or components should be limited in theirscope and temporal validity,in order to achieve a gra-dual phase-out of hazardous substances in vehicles,giventhat the use of those substances in such applications willbecome avoidable.(5)Cadmium in batteries for electrical vehicles should be ex-empt until31December2005since,in view of presentscientific and technical evidence and the overall environ-mental assessment undertaken,by that date,substituteswill be available and the availability of electrical vehicleswill be ensured.The progressive replacement of cad-mium should,however,continue to be analysed,takinginto account the availability of electrical vehicles.TheCommission will publishits findings and,if proven justi-fied by the results of the analysis,may propose an exten-sion of the expiry date for cadmium in batteries for elec-trical vehicles.(6)The exemption from the prohibition relating to lead forcoating inside petrol tanks should be deleted,since theuse of lead in these specific components is already avoid-able.(7)Since it is evident that a total avoidance of heavy metalsis in some instances impossible to achieve,certain con-centration values of lead,mercury,cadmium or hexava-lent chromium in specific materials and componentsshould be tolerated,provided that these hazardous sub-stances are not intentionally introduced.(8)Directive2000/53/EC should therefore be amended ac-cordingly.(9)The measures provided for in this Decision are in accor-dance with the opinion of the Committee established byArticle18of Council Directive75/442/EEC of15July1975on waste(2),as last amended by Commission Deci-sion96/350/EC(3),HAS ADOPTED THIS DECISION:Article1Annex II to Directive2000/53/EC is replaced by the text set out in the Annex to this Decision.Article2Member States shall ensure that cadmium in batteries for elec-trical vehicles is not put on the market after31December 2005.In the framework of the overall environmental assessment al-ready undertaken,the Commission shall continue to analyse the progressive substitution of cadmium,taking into account the need to maintain the availability of electrical vehicles.The Commission shall finalise and make public its findings by31 December2004at the latest and may make,if proven justified by the results of the analysis,a proposal to extend the deadline in accordance withArticle42)b)of Directive2000/53/EC.(1)OJ L269,21.10.2000,p.34.2p.39.(3)OJ L135,6.6.1996,p.32.Article3This Decision shall apply from1January2003.Article4This Decision is addressed to the Member States.Done at Brussels,27June2002.For the CommissionMargot WALLSTRÖMMember of the CommissionMaterials and componentsScope and expiry dateof the exemptionTo be labelled or made identifiablein accordance withArticle42)b)iv) ANNEX‘ANNEX IIMaterials and components exempt from Article4(2)(a)Lead as an alloying element1.Steel for machining purposes and galvanisedsteel containing up to0,35%lead by weight2.a)Aluminium for machining purposes with alead content up to2%by weight1July2005(1)b)Aluminium for machining purposes with alead content up to1%by weight1July2008(2)3.Copper alloy containing up to4%lead byweight4.Lead-bronze bearing shells and bushesLead and lead compounds in components5.Batteries X6.Vibration dampers X7.Wheel balance weights Vehicles type-approved before1July2003and wheelbalance weights intended forservicing of these vehicles:1July2005(3)X8.Vulcanising agents and stabilisers for elastomersin fluid handling and powertrain applications1July2005(4)9.Stabiliser in protective paints1July200510.Carbon brushes for electric motors Vehicles type-approved before1July2003and carbonbrushes for electric motorsintended for servicing of thesevehicles:1January200511.Solder in electronic circuit boards and otherelectric applicationsX(5)12.Copper in brake linings containing more than0,5%lead by weight Vehicles type-approved before1July2003and servicing onthese vehicles:1July2004X13.Valve seats Engine types developed before1July2003:1July2006Materials and components Scope and expiry dateof the exemptionTo be labelled or made identifiablein accordance withArticle42)b)iv)14.Electrical components which contain lead in aglass or ceramic matrix compound except glass in bulbs and glaze of spark plugs X(6)(for components other than piezo in engines)15.Glass in bulbs and glaze of spark plugs1January200516.Pyrotechnic initiators1July2007Hexavalent chromium17.Corrosion preventive coatings1July200718.Absorption refrigerators in motorcaravans XMercury19.Discharge lamps and instrument panel displays XCadmium20.Thick film pastes1July200621.Batteries for electrical vehicles After31December2005,theplacing on the market ofNiCd batteries shall only beallowed as replacement partsfor vehicles put on the marketbefore this date.X(1)By1January2005the Commission shall assess whether the phase-out time scheduled for this entry has to be reviewed in relation to theavailability of substitutes for lead,taking into account the objectives of Article4(2)(a).(2)See footnote1.(3)By1January2005,the Commission shall assess this exemption in relation to road safety aspects.(4)See footnote1.(5)Dismantling if,in correlation with entry14,an average threshold of60grams per vehicle is exceeded.For the application of this clause,electronic devices not installed by the manufacturer on the production line shall not be taken into account.(6)Dismantling if,in correlation with entry11,an average threshold of60grams per vehicle is exceeded.For the application of this clause,electronic devices not installed by the manufacturer on the production line shall not be taken into account.Notes:—a maximum concentration value up to0,1%by weight and per homogeneous material,for lead,hexavalent chromium and mercury and up to0,01%by weight per homogeneous material for cadmium shall be tolerated, provided these substances are not intentionally introduced(1),—a maximum concentration value up to0,4%by weight of lead in aluminium shall also be tolerated provided it is not intentionally introduced(2),—a maximum concentration value up to0,4%by weight of lead in copper intended for friction materials in brake linings shall be tolerated until1July2007provided it is not intentionally introduced(3),—the reuse of parts of vehicles which were already on the market at the date of expiry of an exemption is allowed without limitation since it is not covered by Article4(2)(a),—until1July2007,new replacement parts intended for repair(4)of parts of vehicles exempted from the provisions of Article4(2)(a)shall also benefit from the same exemptions.’(1)“Intentionally introduced”shall mean“deliberately utilised in the formulation of a material or component where its continuedpresence is desired in the final product to provide a specific characteristic,appearance or quality”.The use of recycled materials as feedstock for the manufacture of new products,where some portion of the recycled materials may contain amounts of regulated metals,is not to be considered as intentionally introduced.(2)See footnote1.(3)See footnote1.(4)This clause applies to replacement parts and not to components intended for normal servicing of vehicles.It does not apply towheel balance weights,carbon brushes for electric motors and brake linings as these components are covered in specific entries.。
MATRIXX 7.0软件发布说明说明书

Welcome to MATRIX X 7.0.Major new features include:sBetterState statechart component of SystemBuild ™with C and Ada code generation.sBlock diagram enhancements,including allowing pins to enter or exit from any side, flexible block name positioning, and expanded character set for labels.sIfThenElse blocks with output ports (pins) and a prolog section. sConfiguration management interface to commercial file and version control systems.sOptimized and restructured fixed-point functions achieving over 50% size reduction in some applications.sCode generation template for VxWorks ® 5.4.sXmath ® graphics function plot2d() providing access to plot() anduiplot() features plus multiple win-dows and data viewing.sImprovements to AutoCode ®, DocumentIt ™, and RealSim ™.SystemBuild with BetterStateSystemBuild 7.0 integrates BetterState seamlessly as an optional module so that BetterState charts can be used within SystemBuild models. The Bet-terState Editor appears as one of theSystemBuild editors (similar to the SuperBlock Editor). You can now sim-ulate your model with Sim, ISIM, and RealSim and generate code with Auto-Code capabilities for BetterStatecharts. Statechart models can be used to generate C or Ada code, and inter-active simulation enables theanimation of BetterState diagrams.BetterState,within SystemBuild,has the following new features:s Data Dictionary s Use of BlockScript s Enhanced Catalog Browser sA new BetterStateChart Blocks Improved block face and interfacessConfiguration management s Extended character set for labels sAda code generatorA new Data Dictionary window is accessible from the Statechart window.The Data Dictionary is used to declare and view BetterState variables, todisplay SystemBuild interfacearguments (pin numbers and data types), and also to define local or glo-bal variables for the BetterStatedomain.Each Data Dictionary window has a one-to-one correspondence to astatechart. You can view multiple data dictionaries at once.If you are using BetterState charts that were created in BetterState 5.2 orbefore, Wind River encourages you to enter any variables declared in vari-able boxes in the Data Dictionary.For more information about the Data Dictionary, see the BetterState User’s Guide .BlockScript,which provides a generalized programming capability for defining SystemBuild blocks for simulation and code generation, can now be accessed from BetterState.To define BetterState actions, you can specify them in BlockScript language or reference a procedural SuperBlock.7.0MATRIX XR E L E A S E N O T E S®Procedural SuperBlocks can be used in state on-entry actions, state during actions, state on-exit actions, and tran-sition actions.BlockScript provides the following new features:s Provides language-independent syntax (generates C or Ada code from the model without modifica-tion).s Is the SystemBuild BlockScript syn-tax for specifying conditions and actions.s Supports SystemBuild data types: float, integer, and logical.For more information about Block-Script, see the new BlockScript User’s Guide.BetterState now supports Ada code generation. When you complete your design, you can generate code for charts automatically to implement the design in Ada or C. With the Better-StateChart Block, event-driven and time-based subsystems can be mod-eled in SystemBuild. The BetterState-Chart Block is located on the BetterState palette of the SystemBuild Palette Browser and can be dragged and dropped into a SystemBuild dia-gram like any other SystemBuild block. Blocks can be multiple-instanced.Each SystemBuild use of a BetterState Block is a different instance of the statechart. The BetterStateChart Blockcan be asynchronously triggered fromwithin a continuous subsystem or runperiodically in a discrete subsystem.s Continuous – In a continuous sub-system, the procedural chart sectionof the BetterStateChart Block is notcalled. The block has one input perevent that exists in BetterState inaddition to the user-defined inputsand outputs. The event input pinsare made by connection to zero-crossing monitor signals and the Bet-terState chart is only called if one ofthe monitors is triggered. The correctevent procedure that corresponds tothe signal is called within Better-State.s Discrete – In a discrete subsystem, theBetterState chart is called at the rateof the parent subsystem and only theprocedural portion of the block isused.BetterStateChart Block has thesecharacteristics:s Enables you to provide multipleinstances of a chart.s Provides function call interface forBetterState charts.SystemBuildSystemBuild changes include CatalogBrowser enhancements, interfaceimprovements, configuration manage-ment, extended character set,IfThenElse block additions, signalsplitting, and engine and tire models.Catalog Browser has anenhanced Catalog pane, on the leftside of the SystemBuild CatalogBrowser, which has several new sec-tions under Main (Model, BetterStateCharts, Variables, and User Types) andnow lists Xmath Partitions.The SuperBlocks folder previously displayed the model hierarchy. With the integration of BetterState, System-Build now supports three hierarchical elements: SuperBlocks, BetterState Charts, and BetterState pages. The Model folder shows all three types, and the SuperBlock, BetterState, and State Diagrams folders each display a non-hierarchical list of elements.The BetterState Charts folder acts sim-ilar to the SuperBlocks folder. If you select this folder, the Contents pane shows a list of all BetterState charts in this scope of the catalog. If you expand this folder, the next level is the list of statecharts contained at this scope of the catalog. When you select a chart, the Contents pane shows all of the states on the root page of that chart, as well as any subpages to that root page. This folder is not expandable even if it has subpages.The Variables folder acts similar to the DataStores folder. When selected, the Contents pane displays all of the glo-bal variables defined at this scope of the catalog. Global variables are either SystemBuild global variables (refer-enced in variable blocks) or BetterState global variables (defined in the Data Dictionary).SystemBuild also imports and exports BetterState charts through the Catalog pane, displays user-defined datatypes, and now displays Xmath Partitions from the Catalog view.SystemBuild has interfaces that allow pins to enter or exit from any side (top, left, right, or bottom) for input or output pins. You can define ablock input face and a block outputface independently.You can rotate block names by using the rotation keyword (block and block name rotation are independent). You can use the new direction keyword to toggle the definitions of the block input and output faces. Block Diagram Enhancements SystemBuild 7.0 includes 4-way input/output face entry/exit. You can select a Left (existing), Right, Top, or Bottom entry or exit for a block from the Inputs or the Display tab. Configuration management(CM) feature of SystemBuild enhances the ability to manage data files in ClearCase™ 3.2.1, Merant PVCS™ 6.6, and Microsoft Visual SourceSafe™ 6.0 (for Windows only). CM, accessed from the Versioning menu and the FileView tab of the Catalog Browser, has the following features:s Provides a seamless interface to basic CM operations from within System-Build.s Defines a home file for each catalog item.s Provides a file view for viewing currently loaded files.s Tracks status on new, modified, moved, overwritten, and deleted items.For detailed information about the above and other CM features, see the SystemBuild User’s Guide.SystemBuild supports extended character set for block output labels and SuperBlock external input labels. This extended character set includes the !"#$%’*+,-./<=>?@^ characters and the rest of the standard ASCII 128 character set, except it excludes all control characters (ASCII 1–32) and (){}[]:;\‘|~&.The IfThenElse block has beenimproved with output ports (pins) anda prolog section.The IfThenElse block output ports areavailable from the face of the first con-dition block in the IfThenElse blockchain. You can connect to these portsas if they were the output ports of anyother standard block. Output fromeach of the block sections is connect-able to the output ports the same wayas the output of the content of a Super-Block is connected to its external out-put. With this capability, you nolonger need to use variable blocks andthe Sequencer with the IfThenElseblock.You can define default values for eachoutput channel in the prolog section.SystemBuild executes the prologsection before any other IfThenElsesections. This guarantees that all of theoutput has been defined.If any of the output of the IfThenElseblock is not connected in each sectionof the block structure, some outputmay not be assigned if that output isnot defined in the branch of the blockthat is being executed. This can causesome of the output to be undefinedunless you use the prolog section.This section appears as the uppermostsection in the block and is defined bytyping “prolog” in the Code tab of theIfThenElse Block Properties dialog.Signal splitting is now marked ina diagram. Signal splitting occurswhen one output is connected to theinput of multiple blocks. The markersare placed automatically on the Sys-temBuild diagram whenever two ormore connection lines (that share thesame path from the same source)branch off.The TNO Models section of thePalette Browser provides a selection ofTNO Automotive blocks, includingdynamo and tire subsections. Thedynamo subsection includes blocks fordiesel engines, combustion, turbo-chargers, manifolds, and fuel control.The tire subsection includes blocks forcreating models with tire specifica-tions. For additional information, seethe Dynamo User’s Guide.AutoCode and DocumentItAutoCode7.0 provides the followingnew features:s Fixed-point libraries have improvedsource code layering, reduced fixed-point object and image sizes, andautomatic standalone utility compi-lations Variable step-size solvers Code Generation template supportfor VxWorkss Name mangling reports makefile generation and the acmakecommands AutoCode SDK interface now part ofthe AutoCode productDocumentIt support for the Better-State code generator is limited toextracting comments from theBetterStateChart block dialog. Docu-mentation data cannot be extractedfrom within a BetterState chart.XmathXmath 7.0 introduces plot2d(), agraphics function that provides ashortcut to PGUI uiPlot() features forusers familiar with the plot function.plot2d() accepts the parameters andkeywords of both plot() and uiPlot().By converting plot() function calls toplot2d(), you can employ all uiPlot()functionality, including:s Multiple Plot Windows — You cancreate plots on multiple windowsfrom the Xmath Commands windowand address plot commands to anygiven existing plot window.sEnhanced Command Capability — You can specify and update all plot attributes with keywords issued from the Xmath Commands window.sInteractive Data Viewing—With the mouse, you can interactively display the x and y values of points along any plot line.sMultiple Y Axes — You can display multiple Y axis scales on a plot.sImproved Default Background and Line Colors —New default back-ground and line colors improve the visual presentation of plots.sImproved Plot Attributes — Grid line and tick mark spacings, as well as text font sizes, are determined rel-ative to the size of the plot.sPlot Legend Placement —You con-trol placement of plot legends with plot2d() command options.For more information about Xmath graphics, see the Xmath User’s Guide and the plot2d() discussion in MATRIXXHelp.RealSimRealSim 7.0 includes the following new features:sSupports AutoCode for BetterState charts, although back animation is not supported.s Improvements to data acquisition.s Automation of UserCode Block use.sIP-16DAC, IP-230DAC, and IP-235DAC board support for AC-1000, AC-104, and RealSim PCI-Pro con-trollers.sVMIVME 4150 board support for the AC-1000 controller.sDatel PC-420 arbitrary wave form generation board support for Real-Sim PCI-Pro systems.sFlex/104A board provides fully-ruggedized extended temperature support for AC-104.Documentation and SupportThe MATRIX X documentation CD provides a structured set of online books in portable document format (PDF). To view PDF documents, you must have Acrobat Reader 3.0 or later (with the search feature). The MATRIX X 7.0 documentation CD includes a copy of Acrobat Reader with Search 3.01. You can download the reader from or copy it from the CD to the Xmath installation directory (the recom-mended location). Acrobat 3.01 pro-vides full text search capability. The CD also has a master index to assist you in locating topics.The documentation CD covers all MATRIX X products including Xmath, SystemBuild, BetterState, AutoCode, DocumentIt, and RealSim. It also includes licensing documentation from GLOBEtrotter ® Software, anima-tion documentation from Altia, the Diab C/C++ compiler documentation, and the pSOSystem ™ PowerPC man-ual set. The Diab C/C++ compiler and PowerPC documents are supplied pri-marily for use with the RealSim AC-1000 controller.Hardcopy Documentation PDF files can be printed on anyPostScript printer. For more informa-tion on Adobe PDF format or related products, see Adobe’s website at . Also, MATRIX X Help can be printed from Netscape.MATRIX X provides a hypertext markup language (HTML) Help sys-tem. MATRIX X Help is a self-con-tained system with multiple hypertextlinks from one topic to another. To start MATRIX X Help and get instruc-tions on viewing, navigating, and printing topics, type help matrixx from the Xmath Commands window.MATRIX X runs on most UNIX and Windows platforms as follows:sThe software supports Windows NT ® 4.0, Windows ® 2000,Windows ME, Windows 98, Win-dows 95, and Solaris ® 2.7.sThe release 7.0 product CD includes RealSim, Altia ® Design 4.5, and Altia FacePlate 4.5.sThe MATRIX X 7.0 documentation CD includes online books in portable document format (PDF) and Adobe ® Acrobat ® Reader with Search 3.01. sThe MATRIX X Help system requires Netscape Navigator™ 3.0 or later. MATRIX X 7.0 includes the most recent version of Netscape Naviga-tor available at release time.Technical support information is available on the web at the following site:www /supportFrom this site select MATRIX X .The email address for support is ************************.An ASCII template is available in:MATRIXX /version/support.txt For additional contact information,please visit:。
Probing Universal Extra Dimensions through rare decays induced by $b to s$ transition

a r X i v :0710.2212v 2 [h e p -p h ] 18 O c t 2007Probing Universal Extra Dimensions through rare decays induced by b →s transitionRossella FerrandesPhysics Department,University of Bari and INFN,Sezione di Bari,ItalyAbstract.A few B d ,s and Λb decays induced by b →s transition are studied in the Standard Model and in the framework of the Appelquist,Cheng and Dobrescu (ACD)model,which is a New Physics scenario where a single universal extra dimension is considered.In particular,we investigate the sensitivity of the observables to the radius R of the compactified extra dimension.Keywords:FCNC decays,Extra Dimensions PACS:12.60.-i,13.25.HwINTRODUCTIONAmong the ideas proposed to extend the SM,a lot of attention has recently been devoted to models including extra dimensions [1].An interesting model is that proposed by Appelquist,Cheng and Dobrescu with so-called universal extra dimensions (UED)[2],which means that all the SM fields may propagate in one or more compact extra dimensions.The compactification of the extra dimensions involves the appearance of an infinite discrete set of four dimensional fields which create the so-called KK particles,the masses of which are related to compactification radius according to the relationm 2n =m 20+n 2THE DECAYS B →K ∗γ,K ∗ν¯νAND B s →φγ,φν¯νIn the Standard Model the b →s γand b →s ν¯νtransitions are described by the effective ∆B =−1,∆S =1Hamiltonians H b →s γ=4G F 2V tb V ∗ts c 7O 7,H b →s ν¯ν=G F2α16π2m b (¯s L σµνb R )+m s (¯sR σµνb L )F µν,O L =¯s γµ(1−γ5)b ¯νγµ(1−γ5)ν.G F is the Fermi constant and V i j are elements of the CKM mixing matrix;moreover,b R ,L =1±γ54πis the electromagnetic constant,θW the Weinberg angle and F µνdenotes the electromagnetic field strength tensor.The function X (x t )(x t =m 2tM 2W,m n =n2b |B (p )>=i εµναβε∗νp αp ′β2T 1(q 2)++ ε∗µ(M 2B −M 2K ∗)−ε∗·q (p +p ′)µ T 2(q 2)+ε∗·q q µ−q 2M B +M K ∗−i ε∗µ(M B +M K ∗)A 1(q 2)−(ε∗·q )(p +p ′)µA 2(q 2)q 2A 3(q 2)−A 0(q 2) q µ ,where q =p −p ′,and εis the K ∗meson polarization vector.At zero value of q 2the condition T 1(0)=T 2(0)holds,so that the B →K ∗γdecay amplitude involves a single hadronic parameter,T 1(0).Furthermore,a relation holds the form factors A 1,A 2and A 3:A 3(q 2)=MB +M K ∗2M K∗A 2(q 2)together with A 3(0)=A 0(0).We use for the form factors two sets of results:the first one,denoted as set A,obtained by three-point QCD sum rules based on the short-distance expansion [10];the second one,denoted as set B,obtained by QCD sum rules based on the light-cone expansion [11].Let us consider the radiative mode B →K ∗γ.Its decay rate is given by:Γ(B →K ∗γ)=αG 2FM 2B3.(2)One can appreciate the consequences of the existence of a single universal extra dimen-sion considering Fig.1,where the branching fraction is plotted as a function of 1/R .Thehadronic uncertainty is evaluated comparing the two set of form factors and taking into account their errors.A comparison between experimental data [12](represented by the horizontal band in the Fig.1)and theoretical predictions allows to put a lower bound of 1/R ≥250GeV adopting set A,and a stronger bound of 1/R ≥400GeV for set B.1RGeV B R B K Γ 1051RGeV B R B K Γ 105FIGURE 1.B B →K ∗γversus 1/R using set A (left)and B (right)of form factors .The horizontal band corresponds to the experimental result.For the mode B →K ∗ν¯νit is interesting to consider the missing energy distribution.We define E miss the energy of the neutrino pair in the B rest frame and consider the dimensionless variable x =E miss /M B ,which varies in the range 1−r rwith r =M 2K ∗/M 2B.One can separately consider the missing energy distributions for longitudinally and transversely polarized K ∗:d ΓL24π3| p ′|M B +M K ∗| p ′|2A 2(q 2)2,(3)andd Γ±24π3|c L |22M B | p ′|d B R L ,T B K ΝΝd x 1041RGeV B R B K ΝΝ106FIGURE 2.Left:missing energy distribution in B →K ∗ν¯νfor a longitudinally polarized K ∗(lower curves)and a transversally polarized K ∗(upper curves)for set A.The dark region corresponds to SM,theintermediate one to 1/R =500GeV and the light one to 1/R =200GeV .Right:B B →K ∗ν¯νversus 1/R ,with set A of form factors.value of B B d →K ∗0γ:B B s →φγ=T B s →φ1(0)M B s3M 2B s−M 2φτB dB B d →K ∗0γ.(5)This equation shows that a crucial quantity to predict B B s →φγis the SU (3)F breaking parameter ˆr defined byT B s→φ1(0)The SM prediction for the branching ratio is B Bs→φν¯ν=(1.3±0.3)×10−5.It suggeststhat this mode is within the reach of future experiments,although the observation of a final state involving a neutrino-antineutrino pair is a challenging task.The dependence of B Bs→φν¯νon1/R is depicted in the right part of Fig.3.THE DECAYSΛb→ΛγANDΛb→Λν¯νIn the case ofΛb→Λtransitions the hadronic matrix elements of the operators O7and O L in eq.(1)involve a larger number of form factors.At present,a determination of such form factors is not available.However,it is possible to invoke heavy quark symmetries for the hadronic matrix elements involving an initial spin=12light baryon;the heavy quark symmetries reduce totwo the number of independent form factors.As a matter of fact,in the infinite heavy quark limit m Q→∞and for a generic Dirac matrixΓone can write[15]:<Λ(p′,s′)|¯sΓb|Λb(p,s)>=¯uΛ(p′,s′) F1(p′·v)+vF2(p′·v) ΓuΛb(v,s)(6)where uΛand uΛbare theΛandΛb spinors,and v=p2MΛb (for convenience we instead considerthem as functions of q2through this relation).A determination of F1and F2has been obtained by three-point QCD sum rules in the m Q→∞limit[16].In the following we use the expressions for the functions F1,F2 obtained by updating some of the parameters used in[16]:F1,2(q2)=F1,2(0)T B d→K∗0 1(0)2 1+MΛF1(0) 2 M B d M2Bd−M2K∗03τΛbThese results suggest that these processes are within the reach of LHC experiments.1 R GeVB R b Γ 1051 R GeVB R b ΝΝ106FIGURE 4.B Λb →Λγ(left)and B Λb →Λν¯ν(right)plotted as function of 1/R .The uncertainty shown bythe dark band is mainly due to the errors on the form factors of the model (7).CONCLUSIONSWe have studied how a single universal extra dimension could have an impact on severalloop induced B d ,s and Λb decays.For the B →K ∗γmode,the uncertainty related to the form factors does not obscure the sensitivity to the compactification radius.From the comparison between predictions and experimental data we obtain a lower bound of 1/R ≥300−400GeV .Then,we have found that hadronic uncertainties are not large in case of B s decays,whereas for Λb the situation is more uncertain.These results can be useful for the Physics programs at the hadron colliders.ACKNOWLEDGMENTSI acknowledge partial support from the EU contract No.MRTN-CT-2006-035482,"FLA VIAnet".REFERENCES1.I.Antoniadis,Phys.Lett.B 246,377(1990);K.R.Dienes,E.Dudas and T.Gherghetta,Phys.Lett.B 436,55(1998);N.Arkani-Hamed and M.Schmaltz,Phys.Rev.D 61,033005(2000).2.T.Appelquist,H.C.Cheng and B.A.Dobrescu,Phys.Rev.D 64,035002(2001).3.K.Agashe,N.G.Deshpande and G.H.Wu,Phys.Lett.B 514,309(2001).4. A.J.Buras,M.Spranger and A.Weiler,Nucl.Phys.B 660,225(2003);A.J.Buras,A.Poschenrieder,M.Spranger and A.Weiler,Nucl.Phys.B 678,455(2004).5.U.Haisch and A.Weiler,Phys.Rev.D 76,034014(2007).6.P.Colangelo,F.De Fazio,R.Ferrandes and T.N.Pham,Phys.Rev.D 73,115006(2006);Phys.Rev.D 74,115006(2006);arXiv:0709.2817[hep-ph].7.T.Inami and C.S.Lim,Prog.Theor.Phys.65,297(1981)[Erratum-ibid.65,1772(1981)].8.G.Buchalla and A.J.Buras,Nucl.Phys.B 400,225(1993);G.Buchalla,A.J.Buras and ut-enbacher,Rev.Mod.Phys.68,1125(1996).9.G.Buchalla and A.J.Buras,Nucl.Phys.B 548,309(1999).10.P.Colangelo,F.De Fazio,P.Santorelli and E.Scrimieri,Phys.Rev.D 53,3672(1996)[Erratum-ibid.D 57,3186(1998)].11.P.Ball and R.Zwicky,Phys.Rev.D 71,014015(2005);Phys.Rev.D 71,014029(2005).12.M.Nakao et al.[BELLE Collaboration],Phys.Rev.D 69,112001(2004);B.Aubert et al.[BABAR Collaboration],Phys.Rev.D 70,112006(2004).13.A.Drutskoy,arXiv:0710.1647[hep-ex].14.W.M.Yao et al.[Particle Data Group],J.Phys.G33,1(2006).15.T.Mannel,W.Roberts and Z.Ryzak,Nucl.Phys.B355,38(1991).16.C.S.Huang and H.G.Yan,Phys.Rev.D59,114022(1999)[Erratum-ibid.D61,039901(2000)].。
软考高级架构师系统设计40题

软考高级架构师系统设计40题1. In a system design, which of the following is the most important consideration for scalability?A. Hardware performanceB. Software architectureC. Network bandwidthD. User interface design答案:B。
解析:软件架构对于系统的可扩展性至关重要。
硬件性能在一定程度上影响,但不是最关键的。
网络带宽主要影响数据传输,对可扩展性的直接影响较小。
用户界面设计与系统的可扩展性关系不大。
2. When designing a system, which principle should be followed to ensure high availability?A. RedundancyB. Minimization of componentsC. Simple architectureD. Low cost答案:A。
解析:冗余是确保高可用性的重要原则。
减少组件可能会降低复杂性,但不一定能保证高可用性。
简单架构有助于理解和维护,但不是保证高可用性的关键。
低成本通常不是高可用性设计的首要考虑因素。
3. Which of the following is a key factor in determining theperformance of a system?A. The number of usersB. The algorithm usedC. The color scheme of the interfaceD. The brand of the hardware答案:B。
解析:算法的优劣直接决定了系统的性能。
用户数量会影响系统负载,但不是决定性能的根本因素。
界面的颜色方案与性能无关。
硬件品牌对性能有一定影响,但算法的影响更为关键。
Extended Press-Schechter theory and the density profiles of dark matter haloes

a r X i v :a s t r o -p h /0305300v 1 16 M a y 2003Mon.Not.R.Astron.Soc.000,1–9(2003)Printed 2February 2008(MN L A T E X style file v2.2)Extended Press-Schechter theory and the density profilesof dark matter haloesNicos Hiotelis ⋆†1st Experimental Lyceum of Athens,Ipitou 15,Plaka,10557,Athens,Greece,E-mail:hiotelis@ipta.demokritos.grAccepted ...............Received ................;in original form ...........ABSTRACTAn inside-out model for the formation of haloes in a hierarchical clustering scenario is studied.The method combines the picture of the spherical infall model and a mod-ification of the extended Press-Schechter theory.The mass accretion rate of a halo is defined to be the rate of its mass increase due to minor mergers.The accreted mass is deposited at the outer shells without changing the density profile of the halo inside its current virial radius.We applied the method to a flat ΛCDM Universe.The resulting density profiles are compared to analytical models proposed in the literature,and a very good agreement is found.A trend is found of the inner density profile becoming steeper for larger halo mass,that also results from recent N-body simulations.Addi-tionally,present-day concentrations as well as their time evolution are derived and it is shown that they reproduce the results of large cosmological N-body simulations.Key words:cosmology:theory –dark matter –galaxies:haloes –structure –for-mation1INTRODUCTIONNumerical studies (Quinn,Salmon &Zurek (1986);Frenk et al.(1988);Dubinski &Galberg (1991);Crone,Evrard &Richstone (1994);Navarro,Frenk &White (1997),here-after NFW;Cole &Lacey (1996);Huss,Jain &Steinmetz (1999);Fukushige &Makino (1997);Moore et al.(1998),hereafter MGQSL;Jing &Suto (2000),hereafter JS:Hern-quist (1990),hereafter H90,Kravtsov at al.(1998),Klypin at al.(2001))show that the density profiles of dark matter haloes are fitted by models of the formρf (r )=ρcd r=λ+µν(r/r s )µ2Nicos Hiotelisfor stydying the formation of structures.Recently,such a modified PS approximation was combined with a spherical infall model picture of formation by Manrique et al.(2003), MRSSS hereafter.Their results are in good agreement with those of N-body simulations.In this paper we use the formalism of MRSSS,with justified modifications,and the same model parameters as in BKPD.We compare the characteristics of the resulting structures with those in N-body results.In Section2, we discuss the modified PS theory and its application to the calculation of the density profile.In Section3,the characteristics of the resulting dark matter haloes are presented.A discussion is given in Section4.2EXTENDED AND MODIFIEDPRESS-SCHECHTER THEORYOne of the major goals of the spherical infall model is the PS approximation.It states that the comoving density of haloes with mass in the range M,M+d M at time t is given by the relation:N(M,t)d M= πδc(t)M e−δc2(t)d M|d M(3)whereσ(M)is the present-day rms massfluctuation on co-moving scale containing mass M and is related to the power spectrum P by the following relationσ2(M)=23πρb0R3=Ωm0H20d t=H i g13f i∆i(7) andΩΛ,i is the initial values of the quantityΩΛ(a)=Λ/(3H2(a)).Eq.7is derived under the assumption that the initial velocity v i of the shell is v i=H i r i−v pec,i where the initial peculiar velocity,v pec,i,is given according to the linear theory by the relation v pec,i=170[1−Ωm,i(1+Ωm,i)](Lahav et al.(1991)).The radius of the maximum expansion is r ta=s ta r i,where s ta is the root of the equation g(s)=0that corresponds to zero velocity(d s/d t=0).The sphere reaches its turn-around radius at timet ta=12(s)d s(8) and then collapses at time t c=2t ta.The scale factor a of the Universe obeys the equation: d a2(a)(9) whereX(a)=1+Ωm,0(a−1−1)+ΩΛ,0(a2−1)(10) and the subscript0denotes the present-day values of the parameters.However,the time and the scale factor a are related by the equationt=12(u)d u(11) Setting t=t c in the above equation and solving for a one finds the scale factor a c at the epoch of collapse.If we call δi,c(t)the initial overdensity required for the spherical region to collapse at that time t and take into account the linear theory for the evolution of the matter density contrastδ=δρ/ρ,we haveδ∝1a a0X−3/2(u)d u=D(a),(12) (Peebles1980),thenδc(t)is givenδc(t)=δi,c(t)D(t0)D(t i)D(t0)D(t)(14) whereδcrit(t)is the linear extrapolation of the initial over-density up to the time t of its collapse.In an Einstein-de Sitter universe(Ωm=1,ΩΛ=0)this value is independent on the time of collapse and isδcrit≈1.686.In other cos-mologies it has a weak dependence on the time of collapse (e.g.Eke,Cole&Frenk(1996)).In aflat universe it can beapproximated by the formulaδcrit(t)≈1.686Ω0.0055m,0(t).The PS mass function agrees relatively well with the results of N-body simulations(e.g.Efstathiou,Frenk& White(1985),Efstathiou&Rees(1988);White,Efstathiou &Frenk(1993),Lacey&Cole(1994);Gelb&Bertschinger (1994);Bond&Myers(1996))while it deviates in detail at both the high and low masses.Recent improvements(Sheth &Tormen(1999);Sheth,Mo&Tormen(2001),see also Jenkins et al.(2001))allow a better approximation involving some more parameters.The application of the above approx-imation to the model studied in this paper is a subject of future research.Lacey&Cole(1993)extended the PS theory using the idea of a Brownian random walk,and were able to calcu-late analytically tractable expressions for the mass function,c 2003RAS,MNRAS000,1–9Extended Press-Schechter theory and the density profiles of dark matter haloes3merger rates,and other properties.They show that the in-stantaneous transition rate at t from haloes with mass M to haloes with mass between M ′,M ′+d M ′is given byr (M →M ′,t )d M ′=2d t1d M ′1−σ2(M ′)21σ2(M )d M ′(15)This provides the fraction of the total number of haloeswith mass M at t ,which give rise per unit time to haloes with mass in the range M ′,M ′+d M ′through instantaneous mergers of any amplitude.An interesting modification of the extended PS theory is the distinction between minor and major mergers (Manrique &Salvador-Sol´e (1996);Kitayama &Suto (1996);Salvador-Sol´e et al.(1998);Percival,Miller &Peacock (2000),Cohn et al.(2001)).Mergers that produce a fractional increase below a given threshold ∆m are regarded as minor.This kind of mergers corresponds to an accretion.Consequently,the rate at which haloes increase their mass due to minor mergers is the in-stantaneous mass accretion rate and is given by the relationr a m (M,t )=M (1+∆m )M(M ′−M )r (M →M ′,t )d M ′(16)Thus the rate of the increase of halo’s mass due to the ac-cretion is d M (t )ρb (a )=1a i3(1+∆i )(18)where c f is the collapse factor of the sphere defined as the ratio of its final radius to its turnaround -hav et al.(1991)applied the virial theorem to the viri-alized final sphere assuming a flat overdensity and found the collapse factor to be c f ≈(1−n/2)/(2−n/2)wheren =(Λr 3ta )/(3GM ).For an Einstein-de Sitter Universe ∆vir (a )≈18π2at any time.For flat models with cosmolog-ical constant,significantly good analytical approximations of ∆vir exist.Bryan &Norman (1998)proposed for ∆vir the following approximation∆vir (a )≈(18π2−82x −39x 2)/Ωm (a )(19)where x ≡1−Ωm (a ).MRSSS considered the following picture of the forma-tion of a halo:At time t i an halo of virial mass M i and virial radius R i is formed and at later times it accretes mass ac-cording to the Eq.(17).Assuming that the accreted mass is deposited in an outer spherical shell without changing the density profile inside its current radius,then M vir (t )−M i =R vir (t )R i4πr 2ρ(r )d r(20)The current radius R vir contains a mass with mean den-sity ∆vir (a )times the mean density of the Universe ρb (t ).Therefore,R vir (t )=3M vir (t )r a m [M vir (t ),t ]d[ln[ρb (t )∆vir (t )]]8πG∆vir (a )×1+M vir (a )a −d ln[∆vir (a )]d a=H −10X −1/2(a )r am [M vir (t ),t ].(24)Integrating Eq.17and using Eqs.21and 23,we obtain the growth of virial mass and virial radius and,in a parametric form,the density profile of haloes.3DENSITY PROFILES OF DARK MATTERHALOESThe results described in this section are derived for a flat universe with Ωm,0=0.3and ΩΛ,0=0.7.We used two forms of power spectrum.The first one -named spect1-is the one proposed by Efstathiou,Bond &White (1992).It is based on the results of the COBE DMR experiment and is given by the relation:P spect 1(k )=Bk[1+a 1k 1/2+a 2k +a 3k 3/2+a 4k 2]b(26)The values for the parameters are:n =1,a 1=−1.5598,a 2=47.986,a 3=117.77,a 4=321.92and b =1.8606.We used the top-hat window function that has a Fourier transform given by:ˆW(kR )=3(sin(kR )−kR cos(kR ))4Nicos Hiotelis-4-22log (M/M unit )0.51l o g (M /M u n i t )σFigure 1.rms mass fluctuation as a function of mass.Solid line:for spect1,dotted line:for spect2are shown.It must be noted that we use a system of units with M unit =1012h −1M ⊙,R unit =h −1Mpc and t unit =1.515×107h −1years.In this system of units H 0/H unit =1.5276.3.1Present day structuresIn the approximation used in this paper,for given models of the Universe and power spectrum there is only one free pa-rameter,that is the value of the threshold ∆m (see Eq.16).We found that the resulting density profiles are sensitive to the value of ∆m .As an example,the density profiles of two systems with the same present-day mass 1012h −1M ⊙and different values of ∆m are plotted in Fig.2.Both den-sity profiles are derived from spect2.The solid line -shown in Fig.2-corresponds to the system derived for ∆m =0.21while the dotted line to the system for ∆m =0.5.The den-sity profile for smaller ∆m is steeper at both the inner and the outer regions.Additionally,for different ∆m the concen-trations of the haloes are different too (a detailed description of the way the concentration is calculated is given below).The system that results for ∆m =0.21has c vir =15.2,while the one for ∆m =0.5has c vir =8.7.In order to calculate the density profiles (that will be presented below),we used as a basic criterion the concentrations of the present-day struc-tures.In fact,we have chosen the values of ∆m =0.23and ∆m =0.21for spect1and spect2respectively,because the concentrations resulting from these values are close to the results of the toy-model of BKPD.This model is constructed by BKPD to reproduce the results of their N-body simula-tions and it is able to give the concentration c vir of a virial mass M vir at any scale factor a .First,the scale factor a c at the epoch of collapse is calculated,solving the following equation-2.5-2-1.5-1log R1234l o g ρFigure 2.For spect2:Density profiles for two haloes having the same mass 1012h −1M ⊙.Solid line:∆m =0.21.Dotted line:∆m =0.5σ[M ∗(a c )]=σ[F M vir (a )](28)where F =0.01and M ∗is the typical collapsing mass.Then,the concentration is calculated using the formulac vir ,BKPD [M vir (a ),a ]=Kaλ+µν−n1/µr s (31)This formula gives the radius r n at which the logarithmic slope equals to n .According to the model presented in this paper,haloes grow inside-out.Thus,the value of c vir repre-sents the way of halo growth.In Fig.3,the concentration isc2003RAS,MNRAS 000,1–9Extended Press-Schechter theory and the density profiles of dark matter haloes510101102M vir /M unit681012141618c Figure 3.Concentration as a function of present-day virial mass.From the top,the first pair of curves are for spect1and the second for spect2.Solid curves:our results.Dotted curves:BKPD toy-model results.plotted as a function of the present-day virial mass.From the top of the figure,the first pair of curves (solid and dot-ted)correspond to spect1and the second pair to spect2.Solid curves show our results while dotted curves depict the results of the toy-model of BKPD.A very good agreement between the values of the concentration is shown.In partic-ular,concentrations resulting from spect2are in agreement with those obtained for the model of BKPD for the whole range of mass presented.On the other hand,small differ-ences appear for very small and very large masses in the case of spect1.In Fig.4we present the density profiles of the re-sulting structures with present-day masses in the range of 0.2×1011h −1M ⊙to 8×1014h −1M ⊙.The left-hand side fig-ures (a1,b1,c1,d1,e1)have been produced using spect1,while the right-hand ones using spect2.Figures (a1)and (a2)correspond to mass 0.2×1011h −1M ⊙,(b1)and (b2)have mass 1012h −1M ⊙,(c1)and (c2)to mass 1013h −1M ⊙,(d1)and (d2)to mass 1014h −1M ⊙and (e1)and (e2)cor-respond to mass 8×1014h −1M ⊙.Solid lines represent the resulting density profiles while dotted lines are the fits using the general formula of Eq.1.It is shown that the fits using the general formula of Eq.1are exact.We also fit every halo density profile using the analytical models that have been proposed in the literature (H90,NFW,MGQSL,JS)and are described in Section 1.The best fit of these models to our resulting profiles is shown in Fig.4(circles).This best fit is found by the minimizing procedure described above,for λ,µand νconstants and equal to the proposed values,while ρc and r s are the only fitting parameters.Best fit for the result-ing density profile in (a1)is the H90model,in (a2)and (b2)the NFW model,in (b1),(c1)and (c2)the MGQSL model24l o g ()ρJS(d1)5JS(d2)-1.5-0.5log (R /R vir )024JS(e1)-1.5-0.5log (R /R vir )24JS(e2)-1.5-0.5024MGQSL(c2)24MGQSL(c1)024l o g ()MGQSLρ(b1)24NFW(b2)24H90(a1)24NFW(a2)Figure 4.Density profiles as a function of radius.Solid curves:re-sulting density profiles.Dotted curves:fits of the resulting densityprofiles using the formula of Eq.1.Circles:best bit to our results using models proposed in the literature (H90,NFW,MGQSL,JS).Left-hand side:spect1.Right-hand side:spect2and in (d1),(d2),(e1)and (e2)the JS model.Additionally,haloes of different mass are fitted well by different analytical models.This is due to the different inner and outer slopes of the density profiles.Inner slope,(defined as that at ra-dial distance r =10−2R vir ),is an increasing function of the virial mass of the halo.For example,in the case of spect2the inner slope varies from 1.43for M =1012h −1M ⊙to 1.65for M =8×1014h −1M ⊙.Additionally,outer slope -at r =R vir -is a decreasing function of the virial mass and it varies from 3.67to 2.64for the above range of masses.Although density profiles resulting in simulations seem to be similar,systematic trends that relate them with the power spectrum have been reported.For example,Subra-manian,Cen &Ostriker (2000)found in the results of their N-body simulations the following:for power spectra of the form P (k )∝k n the density profiles have steeper cores for larger n .Therefore,a dependence of the density profile on the power spectrum is expected.This dependence is shown in our results comparing the profiles of haloes with the samec2003RAS,MNRAS 000,1–96Nicos Hiotelis200400600800log (M vir /M unit )11.5λFigure 5.Exponent λas a function of present-day virial mass for both power spectra.It is shown that λis an increasing function of the virial mass.Solid curve:spect1.Dashed curve:spect2present day mass.It should be noted that the method stud-ied in this manuscript is applicable for the era of slow accre-tion when the infalling matter is in the form of small haloes that have mass less than ∆m times the mass of the parent halo.This kind of accretion occurs at the late stages of for-mation and thus determines the profile of the outer regions of the halo under study.However,the values of the inner slopes may be questionable.Real haloes have followed dif-ferent mass growth histories and thus their properties show a significant scatter about a mean value.Unfortunately,the method studied in this manuscript results one profile for a halo of given mass.Thus,its purpose is just to approximate the mean density profile of a large number of mass growth histories.Since the mass growth history resulting from the method is in good agreement with the mean growth his-tory resulting from N-body simulation -as it will be shown below-then the values of the inner slopes could be close to the ones of N-body simulations.A Monte Carlo analytic ap-proach based on the construction of a large number of mass accretion histories is under study.This study could answer to some of the above problems.In Fig.5the exponent λis plotted,that gives the asymptotic slope at R →0,derived by the general fit as a function of present-day virial mass for both power spec-tra.It is shown that the exponent λis an increasing function of virial mass.This trend of the inner density profile is also found in the results of recent N-body simulations (Ricotti (2002)).3.2Time evolutionIn Fig.6we plot mass growth curves.The curves show M vir (a )as a function of a in a logarithmic slope.The solidlines show our resulting structures and the dotted lines show the mass growth curves of the model proposed by Wech-sler et al.(2002).The curves of the left panel correspond to spect1while those of the right panel to spect2.From the top to the bottom,the curves correspond to masses 2×1011h −1M ⊙,1012h −1M ⊙,1013h −1M ⊙,1014h −1M ⊙and 8×1014h −1M ⊙respectively.It is obvious that massive haloes show substantial increase of their mass up to late times while the growth curves of less massive haloes tend to flatten out earlier.This behaviour of mass growth curves characterizes the hierarchical clustering scenario where small haloes are formed earlier than more massive ones.Addition-ally,it helps to define the term ”formation time”by a mea-surable way.Wechsler et al.(2002)define as formation scale factor ˜a c the scale factor when the logarithmic slope of mass growth,(d lnM (a )/d lna ),falls below some specified value,S .They use the value S =2.It should be noted that this def-inition of formation scale factor differs from a c ,defined by BKPD,since a c is the value of the scale factor at the epoch the typical collapsing mass is F times the virial mass of the halo.We found that the values of ˜a c and a c for F =0.01and S =2are different.This is also noticed in Wechsler et al.(2002)since they state that ˜a c and a c have similar values for S =2but for F =0.015.However,the use of the value F =0.015in the toy-model of BKPD changes the resulting concentrations and so our basic criterion for the choice of the threshold ∆m is not satisfied.Therefore,it is preferable to choose a different value of S for the definition of ˜a c ,that of S =1.5.In Fig.6,the dotted lines show the mass growth curves of the model proposed by Wechsler et al.(2002).In this model the mass growth is calculated using the relation:M vir (a )=M vir,0exp[−˜a c S (1/a −1)](32)where M vir,0is the present-day virial mass and the formation scale factor ˜a c is defined by the condition d lnM (a )/d lna =S with S =1.5.In Fig.6,a very satis-factory agreement is shown,particularly for the less massive haloes.We have to note that our model haloes grow inside-out.Therefore,in early enough times -when the slope of the density is smaller that 2all the way from the centre up to the current radius-it is meaningless to define c vir .Once the building of the halo has proceeded beyond the point with slope 2,the evolution of c vir is due to the growth of the virial radius and is given by c vir [M (a ),a ]=c vir (M 0)R vir [M (a )]Extended Press-Schechter theory and the density profiles of dark matter haloes 7-1-0.8-0.6-0.4-0.20log(a)-1-0.8-0.6-0.4-0.2l o g (M v i r /M 0)-1-0.8-0.6-0.4-0.20log(a)Figure 6.Mass growth curves as a function of scale factor a .Left panel,right panel:spect1,spect2respectively.From top to the bottom the curves correspond to masses 0.2×1011h −1M ⊙,1012h −1M ⊙,1013h −1M ⊙,1014h −1M ⊙and 8×1014h −1M ⊙respectively.0.50.60.70.80.91a024*********.50.60.70.80.91a2468101214161820c [M (a )]Figure 7.Concentration as a function of the scale factor a .Left panel:spect1.Right panel:spect2.Solid lines:our results.Dotted lines:the results of toy-model of BKPD.From top to the bottom the lines correspond to masses 0.2×1011h −1M ⊙,1012h −1M ⊙,1013h −1M ⊙,1014h −1M ⊙and 8×1014h −1M ⊙respectively.struction of analytical models requires a number of crucial assumptions.The model studied in this paper was proposed by MRSSS and assumes that(i)The rate of mass accretion is defined by the rate ofminor mergers(ii)Haloes grow inside-out.The accreted mass is de-posited at the outer shells without changing the density pro-file of the halo inside its current virial radiusc2003RAS,MNRAS 000,1–98Nicos HiotelisThefirst assumption indicates that structures presented in this paper formed by a gentle accretion of mass.The phys-ical process implied by the second assumption is that the infalling matter does not penetrate the current virial radius. This process requires an amount of non-radial motion.This amount has to be large enough so that the pericenter of the accreted mass is larger than the current virial radius.It should be noted that a density profile that results from a radial collapse has inner slope steeper than2.It is the pres-ence of non-radial motion during the collapse that leads to inner slopes shallower than2.(e.g.Nusser(2001),Hiotelis (2002),Subramanian,Cen&Ostriker(2000)).Non-radial motions are always present in the structures formed in N-body simulations.Despite the above assumptions,the results of the model studied in this paper are in good agreement with the results of N-body simulations.The summary of these results is as follows:(i)Density profiles of haloes are close to the analytical models proposed in the literature as goodfits to the results of N-body simulations.A trend of the inner slope of the density profile as an increasing function of the mass of the halo is also found,in agreement with recent results of N-body simulations.(ii)Concentration is a decreasing function of virial mass. Its values are in agreement with the results of numerical methods.(iii)Massive haloes increase their mass substantially up to late times.Growth curves of less massive haloes tend to flatten out earlier.The concentrations of less massive haloes evolve more rapidly while those of more massive haloes evolve slowly.Taking into account the number of assumptions and approx-imations used to build the model presented in this paper,we can conclude that the agreement with the results of N-body simulations is very good.Consequently,this model provides a very promising method to deal with the process of struc-ture formation.Further improvements to this model could help to understand better the physical picture during this process.5ACKNOWLEDGEMENTSI would like to thank the Empirikion Foundation for itsfi-nancial support.REFERENCESAvila-Reese V.,Firmani C.,Hern´a dez X.,1998,ApJ,505, 37Bond J.R.,Cole S.,Efstathiou G.,Kaiser N.,1991,ApJ, 379,440Bond J.R.,Myers S.,1996,ApJS,103,41Bower R.J.,1991,MNRAS,248,332Bryan G.,Norman M.,1998,ApJ,495,80.Bullock J.S.,Kolatt A.,Primack J.R.,Dekel A.,2001,MN-RAS,321,559(BKPD)Cohn J.D.,Bagla J.S.,White M.,2001MNRAS,325,1053 Cole S.,Lacey C.,1996,MNRAS,281,716Crone M.M.,Evrard A.E.,Richstone D.O.,1994,ApJ,434, 402Dubinski J.,Calberg R.,1991,ApJ,378,496.Efstathiou G.,Frenk C.S.,White S.D.M.,1985,ApJ,292, 371Efstathiou G.,Rees M.,1988,MNRAS,230,5 Efstathiou G.,Bond J.R.,White S.D.M.,1992,MNRAS, 258,1Eke V.R,Cole S.,Frenk C.S,1996,MNRAS,282,263 Frenk C.S,White S.D.M.,Davis M.,Efstathiou G.,1988, ApJ,327,507Fukushige T.,Makino J.,1997,ApJ,477,L9Gelb J.,Bertschinger E.,1994,ApJ,436,467Henriksen R.N.,Widrow L.M.,1999,MNRAS,302,321 Hernquist L.,1990,ApJ,356,359Hiotelis N.,2002,A&A,382,84Huss A.,Jain B.,Steinmetz M.,1999,MNRAS,308,1011 Jenkins A.,Frenk C.S.,White S.D.M.,Colberg J.M.,Cole S.,Evrard A.E.,Couchman H.M.P.,Yoshida N.,2001,MN-RAS,321,372Jing Y.P.,Suto Y.,2000,ApJ,529,L69(JS)Kitayama T.,Suto Y.,1996,MNRAS,280,638Kravtsov A.V.,Klypin A.A.,Bullock J.S.,Primack J.R., 1998,ApJ,502,48Klypin A.A.,Kravtsov A.V.,Bullock J.S.,Primack J.R., 2001,ApJ,554,903Kull A.,1999,ApJ,516,L5Lacey C.,Cole S.,1993,MNRAS,262,627Lacey C.,Cole S.,1994,MNRAS,271,676Lahav O.,Lilje P.B.,Primack J.R.,Rees M.J.,1991,MN-RAS,251,128Lokas E.L.,2000,MNRAS,311,423Manrique A.,Salvador-Sol´e E.,1996,ApJ,467,504 Manrique A.,Raig A.,Salvador-Sol´e E.,Sanchis T.,Solanes J.M.,2003,preprint(astro-ph/0304378)(MRSSS)Moore B.,Governato F.,Quinn T.,Stadel ke G.,1998, ApJ,499,L5(MGQSL)Navarro J.F.,Frenk C.S.White S.D.M.,1997,ApJ,490, 493(NFW)Nusser A.,Sheth R.,1999,MNRAS,303,685Nusser A.,2001,MNRAS,325,1397Peebles P.J.E.,1980,The Large-Scale Structure of the Uni-verse,Princeton Univ.Press,Princeton,NJPercival W.J.,Miller L.,Peacock J.A.,2000,MNRAS,318, 273Press W.H.,Schechter P.,1974,ApJ,187,425.Quinn P.J.,Salmon J.K.,Zurek W.H.,1986,Nature,322, 329Raig A.,Gonz´a lez-Casado G.,Salvador-Sol´e,1998,ApJ, 508,L129Ricotti M.,2002,preprint(astro-ph/0212146)Salvador-Sol´e E.,Solanes J.M.,Manrique A.,1998,ApJ, 499,542Sheth R.K.,Tormen G.,1999,MNRAS,308,119Sheth R.K.,Mo H.J.,Tormen G.,2001,MNRAS,323,1 Smith C.C.,Klypin A.,Gross M.A.K.,Primack J.R., Holtzman J.,1998,MNRAS,297,910Subramanian K.,Cen R.Y.,Ostriker J.P.,2000,ApJ,538, 528Syer D.,White S.D.M.,1988,MNRAS,293,337 Wechsler R.H.,Bullock J.S.,Primack J.R.,Kratsov A.V., Dekel A.,2002,ApJ,568,52c 2003RAS,MNRAS000,1–9Extended Press-Schechter theory and the density profiles of dark matter haloes9 White S.D.M.,Efstathiou G.,Frenk C.,1993,MNRAS,262,1023This paper has been typeset from a T E X/L A T E Xfile preparedby the author.c 2003RAS,MNRAS000,1–9。
可积系研究和组合计数方法

从上面的推导可以得出结论, 由递推式
算得的列 乃是KdV方程族的
无穷多个守恒密度. 而且其导数 给出KdV方程族
右边的表示式.
为了更好地了解Faulhaber多项式和KdV方程的关系,我们来推导 或 的一般 表达式. 换言之下面的任务就是求解下面的微分差分方程的明显表达式.
或在方程两边施以算子
KdV方程族守恒密度的一般表示式 上面我们推导出KdV方程实际上是KdV方程族中的一员。它们共有一组无穷多个守 恒密度。若将这组守恒密度规范化,将其最高阶导数项的系数取作1,则KdV 方程族可以写成
2000年Avramidi 和 Rainer:在文 A new explicit expression for the Korteweg-De Vries hierarchy, Math. Nachr. (219 (2000) 45{64), 中给出了一个G的一个很复杂 的所谓一般表达式
守恒密度G[u]的构造 Avramidi 和 Rainer还考察了微分多项式 G 的构造。他们提到G中次数最高而 阶数最低的项为
这里我们假设u(x,t)在x等于正负无穷时迅速递减至零。
KdV方程守恒量和Faulhaber多项式 上面的 成为守恒量是因为
使得
是所谓的守恒密度,也即存在 , 事实上我们有
Supervised by

a dissertation submitted to the department of computer science, faculty of science at the university of cape town in fulfillment of the requirements for the degree of master of science
By Justin George Templemore-Finlayson April 1998 Supervised by Prof P.S. Kritzinger
Abstract
This dissertation concerns the speci cation and description of complex communicating systems using Formal Description Techniques. Speci cally, it proposes a standard graphical representation for the Formal Description Techhnique Estelle, a well-developed textual language. A graphical notation would combine the advantages of a visually descriptive language with existing textually-based analysis tools. Existing graphical Estelle tools are surveyed and where possible, features of the syntaxes used are preserved in the proposed standard. Other graphical description techniques are also examined (and plundered!), particularly the similar Speci cation and Description Language, for accepted conceptual representations. Since formal descriptions are usually the basis of extensive computer-based analysis, it is useful to be able to store the graphical description in a processable electronic form. Consequently, part of the work of this thesis has been to develop an editor capable of interpreting speci cations in the graphical form. This editor maps the graphical description to the textual, which can be processed further by existing tools. The Estelle editor is described in detail, and a real-life protocol speci ced using the graphical notation and editor
The concave-convex procedure (CCCP

A.L.Yuille and Anand Rangarajan∗Smith-Kettlewell Eye Research Institute,2318Fillmore Street,San Francisco,CA94115,USA.Tel.(415)345-2144.Fax.(415)345-8455.Email yuille@∗Prof.Anand Rangarajan.Dept.of CISE,Univ.of Florida Room301,CSE Building Gainesville,FL32611-6120Phone:(352)3921507Fax:(352)3921220 e-mail:anand@cise.ufl.eduAbstractWe introduce the Concave-Convex procedure(CCCP)which con-structs discrete time iterative dynamical systems which are guar-anteed to monotonically decrease global optimization/energy func-tions.It can be applied to(almost)any optimization problem andmany existing algorithms can be interpreted in terms of CCCP.Inparticular,we prove relationships to some applications of Legendretransform techniques.We then illustrate CCCP by applications toPotts models,linear assignment,EM algorithms,and GeneralizedIterative Scaling(GIS).CCCP can be used both as a new way tounderstand existing optimization algorithms and as a procedure forgenerating new algorithms.1IntroductionThere is a lot of interest in designing discrete time dynamical systems for inference and learning(see,for example,[10],[3],[7],[13]).This paper describes a simple geometrical Concave-Convex procedure(CCCP)for constructing discrete time dynamical systems which can be guaranteed to decrease almost any global optimization/energy function(see technical conditions in sec-tion(2)).We prove that there is a relationship between CCCP and optimization techniques based on introducing auxiliary variables using Legendre transforms.We distinguish between Legendre min-max and Legendre minimization.In the former,see[6],the introduction of auxiliary variables converts the problem to a min-max problem where the goal is tofind a saddle point.By contrast,in Legendre minimization,see [8],the problem remains a minimization one(and so it becomes easier to analyzeconvergence).CCCP relates to Legendre minimization only and gives a geometrical perspective which complements the algebraic manipulations presented in[8]. CCCP can be used both as a new way to understand existing optimization algo-rithms and as a procedure for generating new algorithms.We illustrate this by giving examples from Potts models,EM,linear assignment,and Generalized It-erative Scaling.Recently,CCCP has also been used to construct algorithms to minimize the Bethe/Kikuchi free energy[13].We introduce CCCP in section(2)and relate it to Legendre transforms in sec-tion(3).Then we give examples in section(4).2The Concave-Convex Procedure(CCCP)The key results of CCCP are summarized by Theorems1,2,and3.Theorem1shows that any function,subject to weak conditions,can be expressed as the sum of a convex and concave part(this decomposition is not unique).This implies that CCCP can be applied to(almost)any optimization problem. Theorem1.Let E( x)be an energy function with bounded Hessian∂2E( x)/∂ x∂ x. Then we can always decompose it into the sum of a convex function and a concave function.Proof.Select any convex function F( x)with positive definite Hessian with eigen-values bounded below by >0.Then there exists a positive constantλsuch that the Hessian of E( x)+λF( x)is positive definite and hence E( x)+λF( x)is con-vex.Hence we can express E( x)as the sum of a convex part,E( x)+λF( x),and a concave part−λF( x).Figure1:Decomposing a function into convex and concave parts.The original func-tion(Left Panel)can be expressed as the sum of a convex function(Centre Panel) and a concave function(Right Panel).(Figure courtesy of James M.Coughlan). Our main result is given by Theorem2which defines the CCCP procedure and proves that it converges to a minimum or saddle point of the energy.Theorem2.Consider an energy function E( x)(bounded below)of form E( x)= E vex( x)+E cave( x)where E vex( x),E cave( x)are convex and concave functions of x respectively.Then the discrete iterative CCCP algorithm x t→ x t+1given by:∇E( x t+1)=− ∇E cave( x t),(1)vexis guaranteed to monotonically decrease the energy E( x)as a function of time and hence to converge to a minimum or saddle point of E( x).Proof.The convexity and concavity of E vex(.)and E cave(.)means that E vex( x2)≥E vex( x1)+( x2− x1)· ∇E vex( x1)and E cave( x4)≤E cave( x3)+( x4− x3)· ∇E cave( x3), for all x1, x2, x3, x4.Now set x1= x t+1, x2= x t, x3= x t, x4= x t+ing the algorithm definition(i.e. ∇E vex( x t+1)=− ∇E cave( x t))wefind that E vex( x t+1)+ E cave( x t+1)≤E vex( x t)+E cave( x t),which proves the claim.We can get a graphical illustration of this algorithm by the reformulation shown in figure(2)(suggested by James M.Coughlan).Think of decomposing the energy function E( x)into E1( x)−E2( x)where both E1( x)and E2( x)are convex.(This is equivalent to decomposing E( x)into a a convex term E1( x)plus a concave term −E2( x)).The algorithm proceeds by matching points on the two terms which have the same tangents.For an input x0we calculate the gradient ∇E2( x0)andfind the point x1such that ∇E1( x1)= ∇E2( x0).We next determine the point x2such that ∇E( x2)= ∇E2( x1),and repeat.1Figure2:A CCCP algorithm illustrated for Convex minus Convex.We want to minimize the function in the Left Panel.We decompose it(Right Panel)into a convex part(top curve)minus a convex term(bottom curve).The algorithm iterates by matching points on the two curves which have the same tangent vectors, see text for more details.The algorithm rapidly converges to the solution at x=5.0.We can extend Theorem2to allow for linear constraints on the variables x,for example i cµi x i=αµwhere the{cµi},{αµ}are constants.This follows directly because properties such as convexity and concavity are preserved when linear con-straints are imposed.We can change to new coordinates defined on the hyperplane defined by the linear constraints.Then we apply Theorem1in this coordinate system.Observe that Theorem2defines the update as an implicit function of x t+1.In many cases,as we will show,it is possible to solve for x t+1directly.In other cases we may need an algorithm,or inner loop,to determine x t+1from ∇E vex( x t+1).In these cases we will need the following theorem where we re-express CCCP in terms of minimizing a time sequence of convex update energy functions E t+1( x t+1)to obtain the updates x t+1(i.e.at the t th iteration of CCCP we need to minimize the energy E t+1( x t+1)).We include linear constraints in Theorem3.Theorem3.Let E( x)=E vex( x)+E cave( x)where x is required to satisfy the linear constraints i cµi x i=αµ,where the{cµi},{αµ}are constants.Then the update rule for x t+1can be formulated as minimizing a time sequence of convex update energyfunctions E t+1( x t+1):E t+1( x t+1)=E vex( x t+1)+ i x t+1i∂E con∂ y ( y)={∂F∂ x( x)={∂F∗∂ y}−1( x)we mean the value y such that∂F∗∂ x ( x t+1)=−∂g4Examples of CCCPWe now illustrate CCCP by giving four examples:(i)discrete time dynamical systems for the mean field Potts model,(ii)an EM algorithm for the elastic net,(iii)a discrete (Sinkhorn)algorithm for solving the linear assignment problem,and (iv)the Generalized Iterative Scaling (GIS)algorithm for parameter estimation.Example 1.Discrete Time Dynamical Systems for the Mean Field Potts Model.These attempt to minimize discrete energy functions of form E [V ]= i,j,a,b ˆT ijab V ia V jb + ia θia V ia ,where the {V ia }take discrete values {0,1}with linear constraints i V ia =1,∀a .Discussion.Mean field algorithms minimize a continuous effective energy E ef f [S ;T ]to obtain a minimum of the discrete energy E [V ]in the limit as T →0.The {S ia }are continuous variables in the range [0,1]and correspond to (approximate)estimates of the mean states of the {V ia }.As described in [12],to ensure that the minima of E [V ]and E ef f [S ;T ]all coincide (as T →0)it is sufficient that ˆT ijab be negative definite.Moreover,this can be attained by adding a term −K ia V 2ia to E [V ](for sufficiently large K )without altering the structure of the minima of E [V ].Hence,without loss of generality we can consider i,j,a,b ˆT ijab V ia V jb to be a concave function.We impose the linear constraints by adding a Lagrange multiplier term a p a { i V ia −1}to the energy where the {p a }are the Lagrange multipliers.The effective energy becomes:E ef f [S ]= i,j,a,b ˆT ijab S ia S jb + ia θia S ia +T ia S ia log S ia + a p a { iS ia −1}.(3)We can then incorporate the Lagrange multiplier term into the convex part.This gives:E vex [S ]=T ia S ia log S ia + a p a { i S ia −1}and E cave [S ]= i,j,a,b ˆT ijab S ia S jb + ia θia S ia .Taking derivatives yields:∂∂S ia E cave [S ]=2 j,b ˆT ijab S jb +θia .Applying CCCP by setting ∂E vex ∂S ia (S t )gives T {1+log S ia (t +1)}+p a =−2 j,b ˆT ijab S jb (t )−θia .We solve for the Lagrange multipliers {p a }by imposing the constraints i S ia (t +1)=1,∀a .This gives a discrete update rule:S ia (t +1)=e (−1/T ){2 j,b ˆT ijab S jb (t )+θia }β l ˆP (l )log P (f,l )+1variable and obtain a convex concave decomposition in the remaining variable(cf. Theorem4).We illustrate(b)for the elastic net[2].(See Yuille and Rangarajan, in preparation,for an illustration of(a)).Example2.The elastic net attempts to solve the Travelling Salesman Problem (TSP)byfinding the shortest tour through a set of cities at positions{ x i}.The elastic net is represented by a set of nodes at positions{ y a}with variables{S ia} that determine the correspondence between the cities and the nodes of the net.Let E ef f[S, y]be the effective energy for the elastic net,then the{ y}variables can be eliminated and the resulting E S[S]can be minimized using CCCP.(Note that the standard elastic net only enforces the second set of linear constraints). Discussion.The elastic net energy function can be expressed as[11]:E ef f[S, y]= ia S ia( x i− y a)2+γ a,b y a A ab y b+T i,a S ia log S ia,(5) where we impose the conditions a S ia=1,∀i and i S ia=1,∀a.The EM algorithm can be applied to estimate the{ y a}.Alternatively we can solve for the{ y a}variables to obtain y b= i,a P ab S ia x i where{P ab}={δab+2γA ab}−1. We substitute this back into E ef f[S, y]to get a new energy E S[S]given by:E S[S]=− i,j,a,b S ia S jb{P ba x i· x j}+T i,a S ia log S ia.(6)Once again this is a sum of a concave and a convex part(thefirst term is concave because of the minus sign and the fact that{P ba}and x i· x j are both positive semi-definite.)We can now apply CCCP and obtain the standard EM algorithm for this problem.(See Yuille and Rangarajan,in preparation,for more details).Ourfinal example is a discrete iterative algorithm to solve the linear assignment problem.This algorithm was reported by Kosowsky and Yuille in[5]where it was also shown to correspond to the well-known Sinkhorn algorithm[9].We now show that both Kosowsky and Yuille’s linear assignment algorithm,and hence Sinkhorn’s algorithm are examples of CCCP(after a change of variables).Example3.The linear assignment problem seeks tofind the permutation matrix { ia}which minimizes the energy E[ ]= ia ia A ia,where{A ia}is a set of assignment values.As shown in[5]this is equivalent to minimizing the(convex) E P[P]energy given by E P[P]= a p a+1b e−β(A ib+p t b),(7)and can be re-expressed as CCCP.Discussion.By performing the change of coordinatesβp a=−log r a∀a(for r a>0,∀a)we can re-express the E P[P]energy as:E r[r]=−1βilog a r a e−βA ia.(8)Observe that thefirst term of E r[r]is convex and the second term is concave(this can be verified by calculating the Hessian).Applying CCCP gives the update rule:1b e−βA ib r tb,(9)which corresponds to equation(7).Example4.The Generalized Iterative Scaling(GIS)Algorithm[1]for estimating parameters in parallel.Discussion.The GIS algorithm is designed to estimate the parameter λof a distri-bution P( x: λ)=e λ· φ( x)/Z[ λ]so that x P( x; λ) φ( x)= h,where h are observa-tion data(with components indexed byµ).It is assumed thatφµ( x)≥0,∀µ, x, hµ≥0,∀µ,and µφµ( x)=1,∀ x and µhµ=1.(All estimation problems of this type can be transformed into this form[1]).Darroch and Ratcliff[1]prove that the following GIS algorithm is guaranteed to converge to value λ∗that minimizes the(convex)cost function E( λ)=log Z[ λ]− λ· h and hence satisfies x P( x; λ∗) φ( x)= h.The GIS algorithms is given by:λt+1= λt−log h t+log h,(10) where h t= x P( x; λt) φ( x)(evaluate log h componentwise:(log h)µ=log hµ.)To show that GIS can be reformulated as CCCP,we introduce a new variable β=e λ(componentwise).We reformulate the problem in terms of minimizing the cost function Eβ[ β]=log Z[log( β)]− h·(log β).A straightforward calcula-tion shows that− h·(log β)is a convex function of βwithfirst derivative being − h/ β(where the division is componentwise).Thefirst derivative of log Z[log( β)]is (1/ β) x φ( x)P( x:logβ)(evaluated componentwise).To show that log Z[log( β)]is concave requires computing its Hessian and applying the Cauchy-Schwarz inequality using the fact that µφµ( x)=1,∀ x and thatφµ( x)≥0,∀µ, x.We can there-fore apply CCCP to Eβ[ β]which yields1/ βt+1=1/ βt×1/ h× h t(componentwise), which is GIS(by taking logs and using logβ= λ).5ConclusionCCCP is a general principle which can be used to construct discrete time iterative dynamical systems for almost any energy minimization problem.It gives a geomet-ric perspective on Legendre minimization(though not on Legendre min-max).We have illustrated that several existing discrete time iterative algorithms can be re-interpreted in terms of CCCP(see Yuille and Rangarajan,in preparation,for otherexamples).Therefore CCCP gives a novel way of thinking about and classifying ex-isting algorithms.Moreover,CCCP can also be used to construct novel algorithms. See,for example,recent work[13]where CCCP was used to construct a double loop algorithm to minimize the Bethe/Kikuchi free energy(which are generalizations of the meanfield free energy).There are interesting connections between our results and those known to mathe-maticians.After this work was completed we found that a result similar to Theorem 2had appeared in an unpublished technical report by D.Geman.There also are similarities to the work of Hoang Tuy who has shown that any arbitrary closed set is the projection of a difference of two convex sets in a space with one more dimension.(See http://www.mai.liu.se/Opt/MPS/News/tuy.html). AcknowledgementsWe thank James Coughlan and Yair Weiss for helpful conversations.Max Welling gave useful feedback on this manuscript.We thank the National Institute of Health (NEI)for grant number RO1-EY12691-01.References[1]J.N.Darroch and D.Ratcliff.“Generalized Iterative Scaling for Log-Linear Models”.The Annals of Mathematical Statistics.Vol.43.No.5,pp1470-1480.1972.[2]R.Durbin,R.Szeliski and A.L.Yuille.“An Analysis of an Elastic net Approach tothe Traveling Salesman Problem”.Neural Computation.1,pp348-358.1989.[3]I.M.Elfadel“Convex potentials and their conjugates in analog mean-field optimiza-tion”.Neural Computation.Volume7.Number5.pp.1079-1104.1995.[4]R.Hathaway.“Another Interpretation of the EM Algorithm for Mixture Distribu-tions”.Statistics and Probability Letters.Vol.4,pp53-56.1986.[5]J.Kosowsky and A.L.Yuille.“The Invisible Hand Algorithm:Solving the AssignmentProblem with Statistical Physics”.Neural Networks.,Vol.7,No.3,pp477-490.1994.[6] E.Mjolsness and C.Garrett.“Algebraic Transformations of Objective Functions”.Neural Networks.Vol.3,pp651-669.[7] A.Rangarajan,S.Gold,and E.Mjolsness.“A Novel Optimizing Network Architec-ture with Applications”.Neural Computation,8(5),pp1041-1060.1996.[8] A.Rangarajan,A.L.Yuille,S.Gold.and E.Mjolsness.”A Convergence Proof forthe Softassign Quadratic assignment Problem”.In Proceedings of NIPS’96.Denver.Colorado.1996.[9]R.Sinkhorn.“A Relationship Between Arbitrary Positive Matrices and DoublyStochastic Matrices”.Ann.Math.Statist..35,pp876-879.1964.[10] F.R.Waugh and R.M.Westervelt.“Analog neural networks with local competition:I.Dynamics and stability”.Physical Review E,47(6),pp4524-4536.1993.[11] A.L.Yuille.“Generalized Deformable Models,Statistical Physics and Matching Prob-lems,”Neural Computation,2pp1-24.1990.[12] A.L.Yuille and J.J.Kosowsky.“Statistical Physics Algorithms that Converge.”Neu-ral Computation.6,pp341-356.1994.[13] A.L.Yuille.“A Double-Loop Algorithm to Minimize the Bethe and Kikuchi FreeEnergies”.Neural Computation.In press.2002.。
Problem-solvingb...

Neurocomputing44–46(2002)735–742/locate/neucomProblem-solving behavior in a system modelof the primate neocortexAlan H.BondCalifornia Institute of Technology,Mailstop136-93,Pasadena,CA91125,USAAbstractWe show how our previously described system model of the primate neocortex can be extended to allow the modeling of problem-solving behaviors.Speciÿcally,we model di erent cognitive strategies that have been observed for human subjects solving the Tower of Hanoi problem. These strategies can be given a naturally distributed form on the primate neocortex.Further, the goal stacking used in some strategies can be achieved using an episodic memory module corresponding to the hippocampus.We can give explicit falsiÿable predictions for the time sequence of activations of di erent brain areas for each strategy.c 2002Published by Elsevier Science B.V.Keywords:Neocortex;Modular architecture;Perception–action hierarchy;Tower of Hanoi;Problem solving;Episodic memory1.Our system model of the primate neocortexOur model[4–6]consists of a set of processing modules,each representing a corti-cal area.The overall architecture is a perception–action hierarchy.Data stored in each module is represented by logical expressions we call descriptions,processing within each module is represented by sets of rules which are executed in parallel and which construct new descriptions,and communication among modules consists of the trans-mission of descriptions.Modules are executed in parallel on a discrete time scale, corresponding to20ms.During one cycle,all rules are executed once and all inter-module transmission of descriptions occurs.Fig.1depicts our model,as a set of cor-tical modules and as a perception–action hierarchy system diagram.The action of theE-mail address:***************.edu(A.H.Bond).0925-2312/02/$-see front matter c 2002Published by Elsevier Science B.V.PII:S0925-2312(02)00466-6736 A.H.Bond/Neurocomputing44–46(2002)735–742Fig.1.Our system model shown in correspondence with the neocortex,and as a perception–action hierarchy.system is to continuously create goals,prioritize goals,and elaborate the highest priority goals into plans,then detailed actions by propagating descriptions down the action hierarchy,resulting in a stream of motor commands.(At the same time,perception of the environment occurs in a ow of descriptions up the perception hierarchy.Perceived descriptions condition plan elaboration,and action descriptions condition perception.) This simple elaboration of stored plans was su cient to allow is to demonstrate simple socially interactive behaviors using a computer realization of our model.A.H.Bond/Neurocomputing44–46(2002)735–7427372.Extending our model to allow solution of the Tower of Hanoi problem2.1.Tower of Hanoi strategiesThe Tower of Hanoi problem is the most studied,and strategies used by human subjects have been captured as production rule systems[9,1].We will consider the two most frequently observed strategies—the perceptual strategy and the goal recursion strategy.In the general case,reported by Anzai and Simon[3],naive subjects start with an initial strategy and learn a sequence of strategies which improve their performance. Our two strategies were observed by Anzai and Simon as part of this learning sequence. Starting from Simon’s formulation[8],we were able to represent these two strategies in our model,as follows:2.2.Working goalsSince goals are created dynamically by the planning activity,we needed to extend our plan module to allow working goals as a description type.This mechanism was much better than trying to use the main goal module.We can limit the number of working goals.This would correspond to using aÿxed size store,corresponding to working memory.The module can thus create working goals and use the current working goals as input to rules.Working goals would be held in dorsal prefrontal areas,either as part of or close to the plan module.Main motivating topgoals are held in the main goal module corresponding to anterior cingulate.2.3.Perceptual tests and mental imageryThe perceptual tests on the external state,i.e.the state of the Tower of Hanoi apparatus,were naturally placed in a separate perception module.This corresponds to Kosslyn’s[7]image store.The main perceptual test needed is to determine whether a proposed move is legal.This involves(a)making a change to a stored perceived representation corresponding to making the proposed move,and(b)making a spatial comparison in this image store to determine whether the disk has been placed on a smaller or a larger one.With these two extensions,we were able to develop a representation of the perceptual strategy,depicted in Fig.2.3.Episodic memory and its use in goal stackingIn order to represent the goal recursion strategy,we need to deal with goal stacking, which is represented by push and pop operations in existing production rule represen-tations.Since we did not believe that a stack with push and pop operations within a module is biologically plausible,we found an equivalent approach using an episodic memory module.738 A.H.Bond/Neurocomputing44–46(2002)735–742Fig.2.Representation of the perceptual strategy on our brain model.This module creates associations among whatever inputs it receives at any given time, and it sends these associations as descriptions to be stored in contributing modules. In general,it will create episodic representations from events occurring in extended temporal intervals;however,in the current case we only needed simple association. In the Tower of Hanoi case,the episode was simply taken to be an association between the current working goal and the previous,parent,working goal.We assume that these two working goals are always stored in working memory and are available to the plan module.The parent forms a context for the working goal.The episode description is formed in the episodic memory module and transmitted to the plan module where it is stored.The creation of episodic representations can proceed in parallel with the problem solving process,and it can occur automatically or be requested by the plan module.Rules in the plan module can retrieve episodic descriptions usingA.H.Bond/Neurocomputing44–46(2002)735–742739the current parent working goal,and can replace the current goal with the current parent,and the current parent with its retrieved parent.Thus the working goal context can be popped.This representation is more general than a stack,since any stored episode could be retrieved,including working goals from episodes further in the past. Such e ects have,in fact,been reported by Van Lehn et al.[10]for human subjects. With this additional extension,we were able to develop a representation of the goal recursion strategy,depicted in Fig.3.Descriptions of episodes are of the form con-text(goal(G),goal context(C)).goal(G)being the current working goal and goal context(C)the current parent working goal.Theÿgure shows a slightly more general version,where episodes are stored both in the episodic memory module and the plan module.This allows episodes that have not yet been transferred to the cortex to be used.We are currently working on extending our model to allow the learning a sequence of strategies as observed by Anzai and Simon.This may result in a di erent representation of these strategies,and di erent performance.740 A.H.Bond/Neurocomputing44–46(2002)735–742during perceptual analysis during movementP MFig.4.Predictions of brain area activation during Tower of Hanoi solving.4.Falsiÿable predictions of brain area activationFor the two strategies,we can now generate detailed predictions of brain area acti-vation sequences that should be observed during the solution of the Tower of Hanoi ing our computer realization,we can generate detailed predictions of activa-tion levels for each time step.Since there are many adjustable parameters and detailed assumptions in the model,it is di cult toÿnd clearly falsiÿable predictions.However, we can also make a simpliÿed and more practical form of prediction by classifying brain states into four types,shown in Fig.4.Let us call these types of states G,E,P and M,respectively.Then,for example,the predicted temporal sequences of brain state types for3disks are:A.H.Bond/Neurocomputing44–46(2002)735–742741For the perceptual strategy:G0;G;E;P;G;E;P;G;E;P;E;M;P;G;E;P;G;E;P;E;M;P;G;E;P;G;E;P;E;M;P;G;E;P;E;M;P;G;E;P;G;E;P;E;M;P;G;E;P;E;M;P;G;E;P;E;M;P;G0:and for the goal recursion strategy:G0;G;E;P;G+;E;P;G+;E;P;E;M;P;G∗;E;P;E;M;P;G∗;E;P;G+;E;P;E;M;P;G∗;E;P;E;M;P;G;E;P;G+;E;P;E;M;P;G∗;E;P;E;M;E;G;E;P;E;M;P;G0: We can generate similar sequences for di erent numbers of disks and di erent strate-gies.The physical moves of disks occur during M steps.The timing is usually about 3:5s per physical move,but the physical move steps probably take longer than the average cognitive step.If a physical move takes1:5s,this would leave about300ms per cognitive step.The perceptual strategy used is an expert strategy where the largest disk is always selected.We assume perfect performance;when wrong moves are made,we need a theory of how mistakes are made,and then predictions can be generated.In the goal recursion strategy,we assume the subject is using perceptual tests for proposed moves, and is not working totally from memory.G indicates the creation of a goal,G+a goal creation and storing an existing goal(push),and G∗the retrieval of a goal(pop). Anderson et al.[2]have shown that pushing a goal takes about2s,although we have taken creation of a goal to not necessarily involve pushing.For us,pushing only occurs when a new goal is created and an existing goal has to be stored.G0is activity relating to the top goal.It should be noted that there is some redundancy in the model,so that,if a mismatch to experiment is found,it would be possible to make some changes to the model to bring it into better correspondence with the data.For example,the assignment of modules to particular brain areas is tentative and may need to be changed.However, there is a limit to the changes that can be made,and mismatches with data could falsify the model in its present form.AcknowledgementsThis work has been partially supported by the National Science Foundation,Informa-tion Technology and Organizations Program managed by Dr.Les Gasser.The author would like to thank Professor Pietro Perona for his support,and Professor Steven Mayo for providing invaluable computer resources.References[1]J.R.Anderson,Rules of the Mind,Lawrence Erlbaum Associates,Hillsdale,NJ,1993.[2]J.R.Anderson,N.Kushmerick,C.Lebiere,The Tower of Hanoi and Goal structures,in:J.R.Anderson(Ed.),Rules of the Mind,Lawrence Erlbaum Associates,Hillsdale,New Jersey,1993,pp.121–142.742 A.H.Bond/Neurocomputing44–46(2002)735–742[3]Y.Anzai,H.A.Simon,The theory of learning by doing,Psychol.Rev.86(1979)124–140.[4]A.H.Bond,A computational architecture for social agents,Proceedings of Intelligent Systems:ASemiotic Perspective,An International Multidisciplinary Conference,National Institute of Standards and Technology,Gaithersburg,Maryland,USA,October20–23,1996.[5]A.H.Bond,A system model of the primate neocortex,Neurocomputing26–27(1999)617–623.[6]A.H.Bond,Describing behavioral states using a system model of the primate brain,Am.J.Primatol.49(1999)315–388.[7]S.Kosslyn,Image and Brain,MIT Press,Cambridge,MA,1994.[8]H.A.Simon,The functional equivalence of problem solving skills,Cognitive Psychol.7(1975)268–288.[9]K.VanLehn,Rule acquisition events in the discovery of problem-solving strategies,Cognitive Sci.15(1991)1–47.[10]K.VanLehn,W.Ball,B.Kowalski,Non-LIFO execution of cognitive procedures,Cognitive Sci.13(1989)415–465.Alan H.Bond was born in England and received a Ph.D.degree in theoretical physics in1966from Imperial College of Science and Technology,University of London.During the period1969–1984,he was on the faculty of the Computer Science Department at Queen Mary College,London University,where he founded and directed the Artiÿcial Intelligence and Robotics Laboratory.Since1996,he has been a Senior Scientist and Lecturer at California Institute of Technology.His main research interest concerns the system modeling of the primate brain.。
Pyramid Hierarchy

BMCC CLIPMarch 22, 2023Assignment 3, Draft 5Pyramid HierarchyAccording to “Motivation and Needs” by Virginia Quinn, Abraham Maslow categorizes various human motivations and needs into a six-step pyramid (from bottom to top): survival needs, stimulation needs, safety and security needs, love and belongingness needs, esteem and self-esteem needs, and self-actualization needs. Based on their different conditions in life, people can be classified as having particular needs at particular steps in the pyramid; furthermore, the percentage of people who occupy the steps will decrease from bottom to top. I was particularly interested in the idea that people facing altered conditions in life can change stages in this pyramid. For instance, in a developed country, a citizen who normally lives in the esteem and self-esteem needs stage could fall to the survival needs stage because of war. In contrast, in a poor country, a wanderer who is usually focused on finding food could rise from the survival needs stage to the esteem and self-esteem stage because of winning a lottery.The first time I studied Maslow’s view of human motivation and needs was in my college psychology course. The professor assigned a test to classify us into a stage and analyzed the results according to the test in our class. The testing result showed that many of us were in the love and belongingness needs stage; however, some discrete cases were in the safety and security needs stage or at other levels. Definitely, students in college were still dependent on their parents and under their parents’ protection. They were satisfied with safety and security needs, and a lot of them seemed selfish because they were focused on achieving acceptance in friendship and love, occupying the stage of love and belongingness needs. But in a separate case, my classmate categorized himself into safety and security needs because a member of a gang had intimidatedhim by threatening to hit him one day. At this time, he urgently needed protection from the school office or security department. Therefore, through this experience, I realized that people in the same general circumstances could face different situations that could change their stage in Maslow’s motivations and needs.The war between Russia and Ukraine has been going on for a year, and many families have been destroyed. In Ukraine, citizens have had to hold weapons to defend their families and have looked to their country and international organizations to help them to end the war. It’s a tragedy in a peaceful generation. We can imagine that if a bomb was thrown into a city filled with happiness, then many of its residents would suddenly find themselves trapped in a miserable world. But this actually happened. Ukrainian citizens have been crushed under collapsed buildings, some died, and some had to await rescue. In this situation, they were eager to survive by securing water and food until rescue arrived. No matter how rich those people were or which stage they occupied, being in these conditions forced them down to the survival needs stage at the bottom of the pyramid. Therefore, which stage you are at in the pyramid depends on your surroundings, which can change. External conditions can push or pull you up or down to another need.When talking about M aslow’s theory in the CLIP class, we agreed that we all need esteem and self-esteem. We are from different countries and have different ages and genders. Before immigrating to America, somebody who had a massive business in his city needed self-actualization, and somebody who was in the war in Ukraine needs safety and security. We were in different conditions. But now that we have the same situation and are combined in the same class to study English, almost all of us need esteem and self-esteem. The next moment, after class, many of us will take a train to go home and worry about our safety. Indeed, we need safety and security at this moment because of the unsafe subways where there are frequent gunshots and robberies.When we arrive home, we are satisfied with our safety and security needs and back to the love and belongingness needs or other needs. Therefore, our needs will move in different stages based on various conditions which change every moment.In conclusion, I have tried to demonstrate that people in the same conditions can remain the same or change to a different stage in Maslow’s hierarchy because needs are dynamic and capable of shifting at any moment. Furthermore, Maslow’s motivations and needs theory looks relatively simple, but actually, it is a very complicated and giant study because everything is dynamic, and along with social development, the hierarchy will probably change into more levels. However, the theory is a very important foundation for many domains, and its purpose is to help people to walk forward.。
中国与外国的文化差异英语作文

中国与外国的文化差异英语作文Title: Embracing Cultural Diversity: Unveiling the Differences Between Chinese and Foreign CulturesIntroduction:Culture serves as the backbone of a society, shaping its values, beliefs, and practices. China, with its rich history spanning thousands of years, boasts a distinctive culture that sets it apart from other nations. While embracing globalization has led to the integration of cultures around the world, understanding the cultural differences between China and foreign countries is crucial for fostering harmony and effective communication. In this article, we will explore some prominent aspects that distinguish Chinese culture from foreign cultures.Body:1. Language:Language is not only a tool for communication but also reflects a culture's unique perspective. Mandarin Chineseis the most widely spoken language in China, while English predominates as an international language in many foreign countries. The tonal nature of Mandarin Chinese adds complexity to its pronunciation and communication style. Conversely, English relies heavily on word order and stresses discrete sounds rather than tones.2. Social Structure:China's long-standing tradition of Confucianism has deeply influenced its social structure. Respect for elders and maintaining harmonious relationships are highly valued in interpersonal interactions. On the contrary, Western societies prioritize individualism and personal freedom over hierarchy and collective identity.3. Food Culture:Cuisine reveals much about a culture's preferences and traditions. Chinese cuisine is celebrated for its diverse flavors, cooking techniques, and emphasis on communal dining experiences. Ingredients like rice, noodles, soybeans, and fresh vegetables take center stage in many dishes. In contrast, Western cuisine showcases a widevariety of ingredients but often places more emphasis on individual portions rather than communal sharing.4. Festivals and Customs:The celebration of festivals manifests significant differences between Chinese culture and foreign cultures. Traditional Chinese festivals such as Spring Festival (Chinese New Year) involve vibrant dragon dances, red lanterns symbolizing good fortune, firecrackers for warding off evil spirits, family reunions, and exchanging lucky red envelopes. In contrast, foreign cultures have their unique festivals like Christmas, Easter, or Thanksgiving, which hold distinctive customs such as gift-giving, decorating trees, and feasting.5. Communication Styles:Communication patterns differ significantly between China and foreign countries. The Chinese tend to be more indirect in their speech, often using implicit expressions and gestures to convey information. Foreign cultures may display a more direct communication style, expressing opinions explicitly while valuing open debate andindividual expression.6. Concept of Time:China's cultural concept of time is deeply rooted in its history and traditions. Punctuality is highly valued in modern China, but flexibility concerning time frames for important events remains prevalent. In contrast, many foreign cultures adhere strictly to schedules andprioritize efficiency.Conclusion:As our world becomes increasingly interconnected, recognizing and appreciating the cultural differences between China and foreign countries becomes imperative for meaningful exchanges and harmonious coexistence. By embracing diversity and seeking mutual understanding, we can bridge the gap between cultures while celebrating the richness each one brings to our global community.Word Count: (Approximately 467 words)。
ia英语作文

ia英语作文Ia is a fascinating and complex concept that has been explored by philosophers, linguists, and scholars across various disciplines. At its core, ia represents the fundamental interconnectedness of all things, a web of relationships and interdependence that underlies the fabric of our universe.From a philosophical perspective, ia can be understood as a holistic worldview that challenges the traditional Western notion of individuality and separateness. In this view, the self is not a discrete, autonomous entity, but rather a fluid and dynamic entity that is inextricably linked to the larger whole. This understanding of the self as a part of a greater whole has profound implications for our understanding of our place in the world and our relationships with others.One of the key aspects of ia is the idea of balance and harmony. In this worldview, the universe is seen as a delicate and intricate system, where all elements are in a state of dynamic equilibrium. Disruptions to this balance, whether through human actions or naturalphenomena, can have far-reaching consequences. The goal, then, is to cultivate a deep understanding of this interconnectedness and to strive for a harmonious coexistence with the natural world.This emphasis on balance and harmony is reflected in many aspects of traditional East Asian cultures, from the practice of feng shui in architecture to the principles of yin and yang in traditional Chinese medicine. In these traditions, the pursuit of ia is not just a philosophical or intellectual exercise, but a way of life that informs everything from daily routines to major life decisions.Linguistically, the concept of ia is often expressed through the use of specific terms and grammatical structures. In many East Asian languages, for example, the use of collective pronouns and collective nouns reflects a worldview that prioritizes the group over the individual. Similarly, the prevalence of honorific language and the emphasis on social hierarchy and respect for elders can be seen as expressions of the ia worldview.Beyond the realm of language, ia also has important implications for our understanding of cognition and consciousness. In this view, the mind is not a isolated entity, but rather a complex web of neural connections and interactions that are deeply influenced by the external environment. This understanding of the mind as a part of a larger system has led to the development of various contemplativepractices, such as meditation and mindfulness, which aim to cultivate a deeper awareness of this interconnectedness.Moreover, the concept of ia has important applications in fields such as ecology, systems theory, and complexity science. In these contexts, ia is seen as a fundamental principle that underlies the workings of complex systems, from the intricate networks of living organisms to the global economy. By understanding the principles of ia, researchers in these fields are able to develop more holistic and effective approaches to addressing the challenges facing our world.Despite the growing recognition of the importance of ia, however, there are still many challenges and misconceptions that must be addressed. One common misunderstanding is the idea that ia is a purely Eastern or Asian concept, when in fact, similar ideas can be found in various philosophical and spiritual traditions around the world. Additionally, there is often a tendency to romanticize or oversimplify the concept of ia, reducing it to a set of simplistic principles or practices.To truly engage with the depth and complexity of ia, it is important to approach the concept with a critical and nuanced perspective. This requires a willingness to grapple with the philosophical and theoretical complexities of the idea, as well as a deep engagement with the cultural and historical contexts in which it has beendeveloped and expressed.Ultimately, the concept of ia offers a powerful and compelling alternative to the dominant Western worldview that has shaped much of modern thought and culture. By embracing the fundamental interconnectedness of all things, we can develop a more holistic and sustainable approach to the challenges facing our world, and cultivate a deeper sense of our place within the larger tapestry of life. As we continue to explore and grapple with this profound and multifaceted concept, we may just find that the answers to some of our most pressing questions lie in the intricate web of relationships and interdependence that defines the very fabric of our existence.。
sections

sectionsSectionsIntroduction:In modern writing, the organization of a document plays a vital role in ensuring its readability and coherence. One of the key elements of a well-structured document is the use of sections. In this article, we will explore the concept of sections in writing and discuss their importance in creating a clear and organized document.I. Understanding Sections1. Definition:Sections refer to the logical divisions within a document that help to structure and organize its content. They are typically used to group related information and create a hierarchy of topics and subtopics.2. Purpose:The primary purpose of using sections is to enhance the clarity and readability of a document. By dividing the contentinto manageable chunks, sections make it easier for readers to navigate through the material and locate specific information.II. Types of Sections1. Main Sections:Main sections are the largest divisions within a document. They represent the primary topics or themes that the document covers. Each main section usually contains several subsections that provide more detailed information on specific aspects of the main topic.2. Subsections:Subsections are smaller divisions within a main section. They focus on specific subtopics or related aspects of the main topic. Subsections help to further organize the content and provide more granularity to the document's structure.III. Benefits of Using Sections1. Organization:Sections play a crucial role in organizing the content of a document. By clearly defining the main topics and subtopics, sections provide a logical structure that helps readers to understand and follow the flow of information.2. Readability:Sections contribute to the overall readability of a document. Breaking the content into smaller, discrete sections makes it easier for readers to navigate through the material, skim for specific information, and go directly to the sections of interest.3. Focus:Sections allow writers to focus on specific aspects of a topic. By dividing the content into sections, writers can delve into each subtopic in detail, ensuring a comprehensive coverage of the subject matter.4. Flexibility:Sections provide flexibility in terms of rearranging, adding, or removing content. If there is a need to reorganize the document or add new information, it can be easily done by rearranging the sections or inserting new ones.IV. Tips for Using Sections Effectively1. Clear Headings:Ensure that each section has a clear and descriptive heading. The headings should accurately reflect the content of the section and provide readers with a clear indication of what to expect.2. Consistency:Maintain consistency in terms of formatting and presentation across all sections. Use the same font, font size, indentation, and spacing throughout the document to create a unified and professional appearance.3. Logical Progression:Arrange the sections in a logical order, with the most important or introductory topics discussed first and the supporting or detailed topics following in a logical progression.4. Balance:Try to maintain a balance between the lengths of sections. Aim for sections of similar length to avoid one section overwhelming others or appearing less substantial.V. ConclusionIn conclusion, sections are an essential tool for organizing and structuring a document. By dividing the content into logical divisions, sections enhance the readability, clarity, and organization of a document. When used effectively, sections provide a clear roadmap for readers, making it easier for them to navigate through the material and locate the relevant information they seek.。
(extended abstract)

Providing Location Privacy in Automated Fare Collection Systems(extended abstract)Levente Butty´a n Tam´a s Holczer Istv´a n VajdaLaboratory of Cryptography and Systems Security(CrySyS)Department of TelecommunicationsBudapest University of Technology and Economics,Hungary{buttyan,holczer,vajda}@crysys.hu1.IntroductionIn many big cities around the world,public trans-port operators(PTOs)have introduced automated fare collection(AFC)systems,which greatly facilitate the collection and management of transactional data in their public transport systems.The benefits to the PTOs are clear:based on thefine grained data gath-ered on the usage of their services,they can optimize their transport systems,which may result in great sav-ings,and thus,higher profit.AFC systems offer some benefits to the passengers too.For instance,they can enable the deployment of dynamic pricing schemes,which may be advantageous for passengers.But AFC systems also present serious privacy risks.The problem stems from the fact that electronic tickets have unique andfixed identifiers.Be-sides making the processing of transactional data easier for the PTO,unique andfixed identifiers are also the basis for many fraud detection and prevention tech-niques(e.g.,blacklists).Unique andfixed ticket identifiers lead to at least two privacy problems.First,if the PTO can link par-ticular tickets to particular persons,then it can track the whereabouts of some passengers.This could be possible,because many tickets(especially those for long term usage)may have some personal data asso-ciated with them,such as discounting rights(granted for students,elderly people,or disabled persons).By pulling together these personal data and the traces of the ticket observed in the past,the PTO may identify links between particular tickets and particular persons with high probability.Second,in many modern AFC systems,tickets are implemented on contactless smart cards.These cards execute their transactions with card readers(e.g.,a ticket validating device)through wireless channels.Al-though the nominal range of typical contactless smart cards used in public transport applications is only a few centimeters,it has recently been demonstrated in[4]that they can be eavesdropped from a larger dis-tance of a few meters.Hence,it is possible to install eavesdropping equipment in an unnoticeable way at places of transactions(e.g.,at the entrance of metro stations),and collect transactional data,including the unique andfixed card identifers,for later off-line anal-ysis.In this abstract,we address the second problem.So-lutions to thefirst problem would require to substan-tially change the way AFC systems are engineered to-day,and PTOs would likely be reluctant to invest in that.On the other hand,the solutions that we pro-pose for the second problem require changes only at the lowest layer of the AFC system architecture(i.e., in the protocols used between the contactless smart cards and the card readers),and they do not affect the higher layers(i.e.,back-end processing).2.Design criteriaIn order to propose viable solutions to the problem described above,one needs to understand the opera-tion of AFC systems.Here,we focus on the usage of contactless smart cards.Smart cards are tiny computers that can store data and perform computations,including cryptographic operations.In addition to this,contactless smart cards can communicate wirelessly with card reader devices through an RF interface.In AFC systems,contactless smart cards store electronic tickets and execute ticket-ing transactions with card reader devices.Transactions are usually protected cryptographically.However,due to performance reasons,only symmetric key crypto-graphic algorithms,such as DES,are supported by 1smart cards(at least on the RF interface).Each card has its own symmetric key,which is created from the card identifier and a master key.This allows for card readers to store only the master key,and re-generate the card’s key locally in each transaction once the card has identified itself.This is very useful,because many card readers are off-line,thus,they cannot obtain card keys from a server.Based on this brief description,we can identify the following design criteria:•The solution should be based on symmetric key cryptography.Thus,the simple approach of en-crypting identification messages with the public key of the PTO is excluded.•Cards should not store global secrets,because in that case a single compromised card would com-promise the whole system.Thus,the simple ap-proach of having a common group key shared by every card and card reader is excluded.•The solution should not rely on state kept in the back-end system,because off-line card readers can-not access this state in a timely manner.•There is a strict upper bound on transaction exe-cution times,in order to avoid long queues of wait-ing passengers.3.Proposed solutionsKey-tree based approach:The problem of using symmetric key encryption to hide the identity of a smart card during identification is that the card reader does not know which symmetric key it should use to decrypt the encrypted identity.The reader may try to generate possible card keys until one of them prop-erly decrypts the encrypted identity,but this would increase the execution time if there are many cards in the system.Recently,Molnar and Wagner proposed an elegant solution to this problem in the context of RFID systems [3].Their solution is based on the concept of key-trees. We propose to adopt the key-tree based approach for private identification of smart cards in AFC systems, together with the optimization technique proposed in [1]that allows the PTO to determine the parameters of the key-tree such that the highest level of privacy is ensured while still respecting a given upper bound on the execution time.One-time identifiers:Our second solution is based on one-time identifiers(OTIs).In each transaction,an OTI is created by the card reader and passed to the card in an encrypted form using the session key of the transaction or the card key itself.Thus,only the card can obtain the OTI.The card then uses this OTI to identify itself in the next transaction.Due to the requirement of avoiding to keep state in the back-end system,the OTI cannot be a simple index in a table of real card identifiers,but it should be self-contained.This means that the card reader should be able to recover the card’s identifier from the OTI. An easy way to achieve this is to generate the OTI by encrypting the card’s identifier and some random element with a master key.Then,each card reader can decrypt any OTI to obtain the card’s identifier. The random element is needed to ensure that OTIs generated from the same card identifier are unlinkable.4.ConclusionIn this extended abstract,we identified privacy problems in AFC systems,and sketched two solutions. The full paper[2]contains more detailed descriptions. Our solutions require that the protocols currently used between the smart cards and the card readers are changed.However,once the card reader determined the real card identifier,everything can work in the same way as in today’s AFC systems.5.AcknowledgementThe work presented in this extended abstract has partially been supported by the Hungarian Scientific Research Fund(T046664)and the Mobile Innovation Center(www.mik.bme.hu).Thefirst author has been further supported by the Hungarian Ministry of Edu-cation(B¨O2003/70).References[1]L.Butty´a n,T.Holczer,and I.Vajda.Optimal Key-Trees for Tree-Based Private Authentication.Un-der submission,March2006.[2]L.Butty´a n,T.Holczer,and I.Vajda.Location pri-vacy in Automated Fare Collection systems.Tech-nical Report.BME CrySyS Lab,April2006. [3]D.Molnar and D.Wagner.Privacy and security inlibrary RFID:issues,practices,and architectures.In Proceedings of ACM CCS,2004.[4]K.Zetter.Feds rethinking RFID passport.WiredNews,26April2005.。
- 1、下载文档前请自行甄别文档内容的完整性,平台不提供额外的编辑、内容补充、找答案等附加服务。
- 2、"仅部分预览"的文档,不可在线预览部分如存在完整性等问题,可反馈申请退款(可完整预览的文档不适用该条件!)。
- 3、如文档侵犯您的权益,请联系客服反馈,我们会尽快为您处理(人工客服工作时间:9:00-18:30)。
svin9.tex; 8/02/2008; 19:20; p.1
2
ANDREI K. SVININ
reffered to, due to [3] as nth discrete KP hierarchy. In particular, in the case n = 1, (1) (or (2)) gives equations of ordinary discrete KP (Toda lattice) hierarchy. It was shown in [1], [3] that nth discrete KP in fact is equivalent to bi-infinite sequence of continuous KP hierarchy copies with corresponding ∂ (n) -Lax operators Qi glued together by compatible gauge transformations. From this we learn that the flows of nth discrete KP hierarchy commute with each other. The aim of this Letter is to discuss edKP hierarchy from geometric point of view which was proposed in a series of the papers [4]. The main inspiration of this work is the paper [2], where the authors exploiting the concept of Darboux covering (see also [5, 6]) unify many notions commonly used in KP theory. Among these are Miura and Darboux transformations, Krichever rational reductions etc.. In particular they showed that well known discrete KP hierarchy can be interpreted as a restriction of Darboux–KP (DKP) chain (4) on some invariant submanifold. In the present paper we generalize this result by showing more general class of invariant submanifolds of DKP chain phase-space. This allows us to give simple geometric interpretation of edKP hierarchy and its reductions. We show that multi-times t(1) , t(2) , ..., in fact, cor1 , S 2 , ... We believe that responds to different invariant submanifolds S0 0 geometrical point of view allows offer clearer interpretation of the role of different multi-times in definition of edKP hierarchy (1). The Letter is organized as follows. In Section 2, we prove theorem which provides us by a class of invariant submanifolds of DKP chain n corresponds to nth Sln . In Section 3, we show that submanifold S0 discrete KP. Finally, Section 4 is concerned with a class of reductions of edKP which are shown to be tantamount to intersections of some invariant submanifolds.
(n)
(2)
The collection of evolution parameters {tp , n ≥ 1, p ≥ 1} can (n) (n) be grouped into infinite sets t(n) ≡ (t1 ≡ x(n) , t2 , ...) — multitimes. Any subsystem of edKP hierarchy (1) corresponding to fixed n is
arXiv:nlin/0205066v3 [nlin.SI] 2 Oct 2004
Abstract. We interpret the recently suggested extended discrete KP (Toda lattice) hierarchy from a geometrical point of view. We show that the latter corresponds to n the union of invariant submanifolds S0 of the system which is a chain of infinitely ln−r n many copies of Darboux-KP hierarchy, while the intersections S0 ∩ Sl yield a −1 number of reductions to l-field lattices. Keywords: discrete KP hierarchy, invariant submanifold
k ≥1
hk (x)z −k
svin9.tex; 8/02/2008; 19:20; p.2
Extended discrete KP hierarhy
3
with z being considered as the point of unit circle and Fa` a di Bruno iterates h(k) constructed, starting from h(0) = 1, with the help of recurrence relation h(k+1) = ∂h(k) /∂x + hh(k) . Then one introduces negative iterates h(−1) , h(−2) , ... by solving recursively the equations ∂h(−1) + hh(−1) = 1, ∂x ∂h(−2) + hh(−2) = h(−1) ∂x and so on. Having in mind Fa` a di Bruno iterates, one defines polarization of Laurent series space L=
2. DKP chain To begin with, let us recall the notion of the KP hierarchy following along the lines suggested in [4]. The main idea behind this approach is in fact an outcome of bihamiltonian formalism of evolution equations defined on special infinite-dimensional Poisson manifold P . The points of P are parametrized by infinite sets of smooth scalar functions {hk (x), k ≥ 1} of spatial variable x ∈ I R. To every point of P one associates monic Laurent series h(z, x) = z +
Extended Discrete KP Hierarhy and its Reductions from a Geometric Viewpoint ∗
ANDREI K. SVININ
Institute of System Dynamics and Control Theory, Siberian Branch of Russian Academy of Sciences, P.O. Box 1233, 664033 Irkutsk, Russia
k ≥1
wk z k(n−1) Λ−kn : n ≥ 1}
where Λ is a shift operator acting as (Λf )(i) = f (i + 1). The flow on M (n) with respect to the parameter tp is defined by the equation of motion1 z (n−1)p ∂S ∂tp
1. Introduction In our previous work [1] we introduced a so-called extended discrete KP (edKP) hierarchy. Let us give a sketch of the picture of this within the framework of a Sato-like approach. One considers the phase-space M which consists of the entries of diagonal matrices wk = (wk (i))i∈Z , k ≥ 1. To each point of M, one associates an infinite set of “wave” operators {S (n) = I +