Full Circle--Ubuntu社区杂志第9期

合集下载

PUGC模式下哔哩哔哩APP的用户体验与交互设计特性

摘要：文章旨在基于PUGC 模式对社区型视频平台哔哩哔哩的用户体验进行系统分析。

在剖析哔哩哔哩PUGC 模式的结构与特性基础上，引入CUBI 用户体验模型，从用户目标、商业模式、内容、交互四个维度对哔哩哔哩进行分析。

总结出“系统成长型”用户目标、“社区共创型”内容、“粉丝圈层型”商业模式三大用户体验特性，以及“双边互动情境化推动”“创作功能渐进式排布”“信息反馈情感化设计”三大交互设计特性。

该特性可扩展至其他社区型视频平台，为其用户体验及交互设计研究提供借鉴和参考。

关键词：PUGC 模式哔哩哔哩App 用户体验设计社区型视频平台交互设计中图分类号：TB472 文献标识码：A 文章编号：1003-0069（2023）07-0068-04Abstract：This paper aims to systematically analyze the user experience of Bilibili ，a community-based video platform ，based on PUGC mode.On the basis of analyzing the structure and characteristics of Bilibili PUGC mode ，CUBI user experience model is introduced.From the user experience dimension of PUGC mode ，Bilibili has summarized three major user experience characteristics of “system growth ”user goal ，“community co-creation ”content and “fan circle ”business model ，as well as three major interaction design characteristics of “contextualized interaction ”，“creation function progressive arrangement ”and “information feedback emotional design ”.These features can be extended to other community-based video platforms and provide references for their user experience and interaction design research.Keywords：PUGC mode Bilibili App User Experience Design Community video platform Interaction design江南大学设计学院周俏鲍懿喜引言在全民娱乐的社会文化环境下，视频平台行业蓬勃发展。

arulesViz 1.5-2 可视化关联规则和频繁项集的 R 包说明书

Package‘arulesViz’March7,2023Version1.5-2Date2023-03-07Title Visualizing Association Rules and Frequent ItemsetsDepends arules(>=1.6.0)Imports graphics,methods,utils,grDevices,stats,seriation,grid,vcd,igraph,scatterplot3d,ggplot2,ggraph,tibble,tidyr,dplyr,DT,plotly,visNetworkSuggests datasets,graph,Rgraphviz,tidygraph,shiny,shinythemes,htmlwidgetsDescription Extends package'arules'with various visualization techniques for associa-tion rules and itemsets.The package also includes several interactive visualizations for rule ex-ploration.Michael Hahsler(2017)<doi:10.32614/RJ-2017-047>.License GPL-3URL https:///mhahsler/arulesVizBugReports https:///mhahsler/arulesViz/issuesCopyright(C)2021Michael HahslerNeedsCompilation noAuthor Michael Hahsler[aut,cre,cph](<https:///0000-0003-2716-1405>),Giallanza Tyler[ctb],Sudheer Chelluboina[ctb]Maintainer Michael Hahsler<*****************.edu>Repository CRANDate/Publication2023-03-0716:50:02UTCR topics documented:associations2igraph (2)inspectDT (3)plot (4)ruleExplorer (11)rules2matrix (12)12associations2igraph Index15 associations2igraph Convert rules or itemsets into a graphDescriptionFunction to convert associations(rules,itemsets)into a igraph object and saves the graph in different formats(e.g.,GraphML,dimacs,dot).Usageassociations2igraph(x,associationsAsNodes=TRUE)saveAsGraph(x,file,format="graphml",...)Argumentsx an object of class"rules"or"itemsets".associationsAsNodesshould associations be translated into nodes or represented by edges?fileﬁle name.formatﬁle format(e.g.,"edgelist","graphml","dimacs","gml","dot").See write.graph in package igraph....further arguments are passed on to associations2igraph().DetailsAssociations are represented as nodes:All items in the associations are connected to the association node.For itemsets,the wdges are undirected,for rules,the edges are directed towards the rhsWhen associations are represented as edges:For rules,each item in the LHS is connected with a directed edge to the item in the RHS.For itemsets,undirected edges for each pair of item in the itemset are created.Valueassociations2igraph returns an igraph object.Author(s)Michael HahslerSee Alsoplot,write.graph in igraphinspectDT3Examplesdata("Groceries")rules<-apriori(Groceries,parameter=list(support=0.01,confidence=0.5))#convert rules into a graph with rules as nodeslibrary("igraph")g<-associations2igraph(rules)gplot(g)#convert the graph into a tidygraphlibrary("tidygraph")as_tbl_graph(g)#convert the generating itemsets of the rules into a graph with itemsets as edgesitemsets<-generatingItemsets(rules)itemsetsg<-associations2igraph(itemsets,associationsAsNodes=FALSE)gplot(g,layout=layout_in_circle)#save rules as a graph so they can be visualized using external toolssaveAsGraph(rules,"rules.graphml")##clean upunlink("rules.graphml")inspectDT Inspect Associations Interactively Using datatableDescriptionUses datatable to create a HTML table widget using the DataTables library.Rules can be interac-tivelyﬁltered and sorted.UsageinspectDT(x,...)Argumentsx an object of class"rules"or"itemsets"....additional arguments.precision controls the precision used to print the quality measures(defaults to2).All other arguments are passed on to datatable inpackage DT.4plot ValueA datatable htmlwidget.Author(s)Michael HahslerReferencesHahsler M(2017).arulesViz:Interactive Visualization of Association Rules with R.R Journal, 9(2):163-175.ISSN2073-4859.doi:10.32614/RJ2017047.See Alsodatatable in DT.Examples##Not run:data(Groceries)rules<-apriori(Groceries,parameter=list(support=0.005,confidence=0.5))rulesinspectDT(rules)#for more control on the data table,you can used DATAFRAME()to convert the rules.rules_df<-DATAFRAME(rules,setStart= ,setEnd= ,itemSep= + )rules_df$count<-NULLhead(rules_df)inspectDT(rules_df)#Save HTML widget as web pagep<-inspectDT(rules)htmlwidgets::saveWidget(p,"arules.html",selfcontained=FALSE)#Note:self-contained seems to make the browser slow.#inspect the widgetbrowseURL("arules.html")#clean upunlink(c("arules.html","arules_files"),recursive=TRUE)##End(Not run)plot Visualize Association Rules and Itemsetsplot5DescriptionMethods(S3)to visualize association rules and itemsets.Implemented are several popular visu-alization methods including scatter plots with shading(two-key plots),graph based visualizations, doubledecker plots,etc.Many plots can use different rendering engines including static standard plots(using base plots, ggplot2,grid),standard plots with interactive manipulation and interactive HTML widget-based visualizations.Usage##S3method for class rulesplot(x,method=NULL,measure="support",shading="lift",limit=NULL, interactive=NULL,engine="default",data=NULL,control=NULL,...)##S3method for class itemsetsplot(x,method=NULL,measure="support",shading=NULL,limit=NULL, interactive=NULL,engine="default",data=NULL,control=NULL,...)Argumentsx an object of class"rules"or"itemsets".method a string indicating the visualization method.Methods for rules include"scat-terplot","two-key plot","matrix","grouped matrix","graph","paracoord",etc.Specify"help"to get a complete list of available methods.Note that some meth-ods may only be available for rules or itemsets.measure measure(s)of interestingness(e.g.,"support","conﬁdence","lift","order")used in the visualization.Some visualization methods need one measure,others takea vector with two measures(e.g.,scatterplot).In some plots(e.g.,graphs)NAcan be used to suppress using a measure.shading measure of interestingness used for the color of the points/arrows/nodes(e.g., "support","conﬁdence","lift").The default is"lift".NULL can be often used tosuppress shading.limit A limit on the number of associations displayed.The top limit associations according to the measure speciﬁed in shading are chosen.interactive deprecated.See parameter engine below.engine a string indicating the plotting engine used to render the plot.The"default"engine uses(mostly)ggplot2.Other engines include"base"(base R plots),"grid","interactive","plotly","visnetwork","igraph","graphviz",and"html-widget"(which can be embedded in RMarkdown).Note that not all enginesare available for all methods.Specify"help"to get a complete list of availableengines for the selected visualization method.data the dataset(class"transactions")used to generate the rules/itemsets.Only"mo-saic"and"doubledecker"require the original data.control a list of control parameters for the plot.The available control parameters depend on the used visualization method and engine.Specify"help"to get a completelist of available control parameters and their default values....Further arguments are added for convenience to the control list.6plotDetailsMost visualization techniques are described by Bruzzese and Davino(2008),however,we added more color shading,reordering and interactive features(see Hahsler,2017).Many visualization methods take extra parameters as the control parameter list.Although,we have tried to keep control parameters consistent,the available control parameters vary from visualization method to visualization method.You can specift"help"for method,engine,or control to get a list of available settings.Note on HTML widgets:HTML widgets tend to get very slow or unresponsive for too many rules.To prevent this situation,the control parameter max sets a limit,and the user is warned if the limit is reached.The following visualization method are available:"scatterplot","two-key plot"This visualization method draws a two dimensional scatterplot with different measures of interestingness(parameter"measure")on the axes and a third measure (parameter"shading")is represented by the color of the points.There is a special value for shading called"order"which produces a two-key plot where the color of the points represents the length(order)of the rule."matrix"Arranges the association rules as a matrix with the itemsets in the antecedents on one axis and the itemsets in the consequents on the other.The measure of interestingness(ﬁrst element of measure)is either visualized by a color(darker means a higher value for the measure)or as the height of a bar(engine"3d").The control parameter reorder takes the values"none", "measure","support/confidence",or"similarity"and can be used to reorder LHS and RHS of the rules differntly.The default reordering average measure(typically lift)pushingthe rules with the highest lift value to the top-left corner of the plot."grouped matrix"Grouped matrix-based visualization(Hahsler and Karpienko,2016;Hahsler 2016).Antecedents(columns)in the matrix are grouped using clustering.Groups are rep-resented by the most interesting item(highest ratio of support in the group to support in all rules)in the group.Balloons in the matrix are used to represent with what consequent the antecedents are connected.Interactive manipulations(zooming into groups and identifying rules)are available.The list of control parameters for this method includes:"main"plot title"k"number of antecedent groups(default:20)"rhs_max"maximal number of RHSs to show.The rest are suppressed.(default:10)"lhs_items"number of LHS items shown(default:2)"aggr.fun"aggregation function can be any function computing a scalar from a vector(e.g., min,mean(default),median,sum,max).It is also used to reorder the balloons in the plot."col"color palette(default is100heat colors.)"graph"Represents the rules(or itemsets)as a graph with items as labeled vertices,and rules(or itemsets)represented as vertices connected to items using arrows.For rules,the LHS items are connected with arrows pointing to the vertex representing the rule and the RHS has an arrow pointing to the item."doubledecker","mosaic"Represents a single rule as a doubledecker or mosaic plot.Parameter data has to be speciﬁed to compute the needed contingency table.No interactive version is available.plot7 "paracoord"Represents the rules(or itemsets)as a parallel coordinate plot.Currently there is no interactive version available.ValueSeveral interactive plots return a set of selected rules/itemsets.Other plots might return other data structures.For example,graph-based plots return the graph(invisibly).Engine"htmlwidget"always returns an object of class htmlwidget.Author(s)Michael Hahsler and Sudheer Chelluboina.Some visualizations are based on the implementation by Martin V odenicharov.ReferencesHahsler M(2017).arulesViz:Interactive Visualization of Association Rules with R.R Journal, 9(2):163-175.ISSN2073-4859.doi:10.32614/RJ2017047.Bruzzese,D.and Davino,C.(2008),Visual Mining of Association Rules,in Visual Data Mining: Theory,Techniques and Tools for Visual Analytics,Springer-Verlag,pp.103-122.doi:10.1007/ 9783540710806Hahsler,M.and Karpienko,R.(2016),Visualizing Association Rules in Hierarchical Groups.Jour-nal of Business Economics,87(3):17-335.doi:10.1007/s1157301608228Hahsler,M.(2016),Grouping association rules using lift.In C.Iyigun,R.Moghaddess,and A.Oztekin,editors,11th INFORMS Workshop on Data Mining and Decision Analytics(DM-DA 2016).See Alsoscatterplot3d in scatterplot3d,plot.igraph and tkplot in igraph,seriate in seriationExamples#Note:To speed example execution,not all examples are not run when using example("plot").#Use example("plot",run.dontrun=TRUE)to run all examples.data(Groceries)rules<-apriori(Groceries,parameter=list(support=0.001,confidence=0.8))rules##Getting help#There are many method,plotting engines and all of them have different control e #"help"to get help.List available methods for the object rules:plot(rules,method="help")#List the available engines for method"scatterplot"plot(rules,method="scatterplot",engine="help")##Not run:#List control parameters for scatterplot with engine"ggplot2"8plot plot(rules,method="scatterplot",engine="ggplot2",control="help")##End(Not run)##Scatter plot#Display a scatter plot using two quality measuresplot(rules)#Scatter plot with custom measures and limiting the plot to the100with the#largest value for for the shading measure.plot(rules,measure=c("support","lift"),shading="confidence",limit=100)##Not run:#Custom color scale,labels,theme and no title(ggplot2)library(ggplot2)plot(rules,engine="ggplot2",main=NULL,limit=100)+scale_color_gradient2(low="red",mid="gray90",high="blue",midpoint=1,limits=c(0,12))+labs(x="Supp.",y="Conf.",color="Lift")+theme_classic()#Interactive scatter plot using the grid engine(selected rules are returned)if(interactive()){sel<-plot(rules,engine="interactive")#Create a html widget for interactive visualization(uses plotly)plot(rules,engine="htmlwidget")}##End(Not run)#Two-key plot(a scatter plot with shading="order")plot(rules,method="two-key plot",limit=100)##Matrix shading#Display rules as a matrix with RHS itemsets as rows and LHS itemsets as columns#works better with small sets of rulessubrules<-subset(rules,lift>5)subrules#2D matrix with shading(ggplot2).The LHS and RHS are reordered so#that rules with similar lift are displayed close to each other.plot(subrules,method="matrix")##Not run:#Interactive matrix plot#*Engine interactive:identify rules by clicking on them(click outside to end)#*Engine htmlwidget:hoover over rules to identifyif(interactive()){plot(subrules,method="matrix",engine="interactive")plot(subrules,method="matrix",engine="htmlwidget")plot9 }##End(Not run)##Grouped matrix plot#Default engine is ggplot2plot(rules,method="grouped matrix",k=5)##Not run:#Create a htmlwidgetplot(rules,method="grouped matrix",engine="htmlwidget")#Interactive grouped matrix plotif(interactive()){sel<-plot(rules,method="grouped matrix",engine="interactive")}##End(Not run)##Graph representation#Default engine is ggplot2with ggraph.Associations are represented as nodes.#We limit the number of rules to the10with the larges#lift(measure used for shading)plot(subrules,method="graph",limit=10)##Not run:#Circular layout(see?ggraph for the meaning of the arguments)plot(subrules,method="graph",layout= linear ,circular=TRUE,limit=10)#Use igraph layouts(algorithm is passes on as...to ggraph)plot(subrules,method="graph",layout= igraph ,ggraphdots=list(algorithm= graphopt ,spring.const=1,mass=10),limit=10)#Specify edge and node representationlibrary(ggplot2)plot(subrules,method="graph",control=list(edges=ggraph::geom_edge_link(end_cap=ggraph::circle(4,"mm"),start_cap=ggraph::circle(4,"mm"),color="black",arrow=arrow(length=unit(2,"mm"),angle=20,type="closed"),alpha=.2),nodes=ggraph::geom_node_point(aes_string(size="support",color="lift")),nodetext=ggraph::geom_node_label(aes_string(label="label"),alpha=.8,repel=TRUE) ),limit=10)+scale_color_gradient(low="yellow",high="red")+scale_size(range=c(2,10))#ggplot also can represent associations as edges.Here a rules is represented as a set of #arrows going from the LHS items to the RHS item.10plot plot(subrules,method="graph",asEdges=TRUE,limit=10)plot(subrules,method="graph",asEdges=TRUE,circular=FALSE,limit=10)##End(Not run)#Engine igraphplot(subrules,method="graph",engine="igraph",limit=10)plot(subrules,method="graph",engine="igraph",nodeCol=grey.colors(10),edgeCol=grey(.7),alpha=1,limit=10)#Use plot_options to alter any aspect of the graph#(see:https:///r/doc/mon.html)plot(subrules,method="graph",engine="igraph",plot_options=list(edge.lty=2,bel.cex=.6,margin=c(.1,.1,.1,.1),asp=.5),limit=10)#igraph layout generators can be used(see?igraph::layout_)plot(subrules,method="graph",engine="igraph",layout=igraph::in_circle(),limit=10)##Not run:#Graph rendering using engine graphvizplot(subrules,method="graph",engine="graphviz",limit=10)if(interactive()){#Default interactive plot(using igraph s tkplot)plot(subrules,method="graph",engine="interactive",limit=10)#Interactive graph as a html widget(using igraph layout)plot(subrules,method="graph",engine="htmlwidget",limit=10)plot(subrules,method="graph",engine="htmlwidget",igraphLayout="layout_in_circle",limit=10)}##End(Not run)##Parallel coordinates plotplot(subrules,method="paracoord",limit=10)##Doubledecker and mosaic plot#Uses functions in package vcd#Notes:doubledecker and mosaic plots only visualize a single rule#and the transaction set is needed.oneRule<-sample(rules,1)inspect(oneRule)plot(oneRule,method="doubledecker",data=Groceries)##Visualizing itemsetsdata(Groceries)itemsets<-eclat(Groceries,parameter=list(support=0.02,minlen=2))ruleExplorer11#default is a scatter plot with ggplot2plot(itemsets)plot(itemsets,method="graph",limit=10)##Not run:plot(itemsets,method="graph",asEdges=TRUE,limit=10)plot(itemsets,method="graph",asEdges=TRUE,circular=FALSE,limit=10)+theme(plot.margin=margin(10,10,30,20,"mm"))##End(Not run)plot(itemsets,method="paracoord",alpha=.5,limit=10)#Add more quality measures to use for the scatter plotquality(itemsets)<-interestMeasure(itemsets,transactions=Groceries)head(quality(itemsets))plot(itemsets,measure=c("support","allConfidence"),shading="lift")##Not run:#Save HTML widget as web pagep<-plot(rules,engine="html")htmlwidgets::saveWidget(p,"arules.html",selfcontained=FALSE)#Note:self-contained seems to make the browser slow.#inspect the widgetbrowseURL("arules.html")#clean upunlink(c("arules.html","arules_files"),recursive=TRUE)##End(Not run)ruleExplorer Explore Association Rules InteractivelyDescriptionExplore association rules using interactive manipulations and visualization using shiny.UsageruleExplorer(x,sidebarWidth=2,graphHeight= 600px )Argumentsx a set of rules,a transactions object or a data.frame.sidebarWidth width of the sidebar as a number between0(=0%of the display width)and12 (=100%of the display width).graphHeight height of the plots in pixels.Increase if you have a larger/higher resolution display.Valuereturns a shiny app.Author(s)Tyler Giallanza and Michael Hahsler.Adapted from functions originally created by Andrew Brooks.See https:///brooksandrew/Rsenal for the original code.ReferencesHahsler M(2017).arulesViz:Interactive Visualization of Association Rules with R.R Journal, 9(2):163-175.ISSN2073-4859.doi:10.32614/RJ2017047.See Alsoplot with engine="html",inspectDT,apriori.Examples##Not run:data(Groceries)#explore pre-mined rulesrules<-apriori(Groceries,parameter=list(support=0.001,confidence=0.8))rulesruleExplorer(rules)#mine and explore rules on the flydata(iris)ruleExplorer(iris)##End(Not run)rules2matrix Convert association rules into a matrixDescriptionConverts a set of association rules into a matrix with unique LHS itemsets as columns and unique RHS itemsets as rows.The matrix cells contain a quality measure.The LHS itemsets can be grouped.Usagerules2matrix(rules,measure="support",reorder="measure",...)rules2groupedMatrix(rules,measure="lift",measure2="support",k=10,aggr.fun=mean,lhs_label_items=2)Argumentsrules a rules object.measure quality measure put in the matrixreorder reorder rows and columns?Possible methods are:"none","measure"(default), "support/conﬁdence","similarity".measure2second quality measure(organized in the same way as measure).k number of LHS itemset groups.aggr.fun function to aggregate the quality measure for groups.lhs_label_itemsnumber of top items used to name LHS itemset groups(columns)....passed on to DATAFRAME.Valuerules2matrix returns a matrix with quality values.rules2groupedMatrix returns a list with elementsm the grouped matrix for measure.m2the grouped matrix for measure2.clustering_rulesvector with group assignment for each rule.Author(s)Michael HahslerReferencesMichael Hahsler and Radoslaw Karpienko.Visualizing association rules in hierarchical groups.Journal of Business Economics,87(3):317–335,May2016.doi:10.1007/s1157301608228.See Alsoplot for rules using method= matrix and method= grouped matrix .Examplesdata(Groceries)rules<-apriori(Groceries,parameter=list(support=0.001,confidence=0.8))rules##Matrixm<-rules2matrix(rules[1:10],measure="lift")mplot(rules[1:10],method="matrix")##Grouped matrix#create a matrix with LHSs grouped in k=10groupsgm<-rules2groupedMatrix(rules,k=10)gm$m#number of rules per grouptable(gm$clustering_rules)#get rules for group1inspect(rules[gm$clustering_rules==1])#create the corresponding grouped matrix plot by passing the grouped matrix as the groups parameter plot(rules,method="grouped matrix",groups=gm)Index∗ﬁleassociations2igraph,2∗hplotplot,4∗printinspectDT,3apriori,12associations2igraph,2DATAFRAME,13datatable,4datatable(inspectDT),3explore(ruleExplorer),11guide_edge_colourbar(plot),4igraph(associations2igraph),2inspect(inspectDT),3inspectDT,3,12plot,2,4,12,13plot.igraph,7plotly(plot),4ruleExplorer,11rules2groupedMatrix(rules2matrix),12 rules2matrix,12saveAsGraph(associations2igraph),2 scatterplot3d,7seriate,7tidygraph(associations2igraph),2tkplot,7write.graph,215。

DNV 全英文规范!不看别后悔

RULES FOR CLASSIFICATION OFD ET N ORSKE V ERITASVeritasveien 1, NO-1322 Høvik, Norway Tel.: +47 67 57 99 00 Fax: +47 67 57 99 11SHIPSNEWBUILDINGSSPECIAL EQUIPMENT AND SYSTEMSADDITIONAL CLASS PART 6 CHAPTER 1MISCELLANEOUS NOTATIONSJANUARY 2009CONTENTS PAGESec.1General Requirements (5)Sec.2Helicopter Installations (6)Sec.3Shipboard Cranes (16)Sec.4Diving Systems (17)Sec.5Deicing and Anti-Icing Systems (19)Sec.6Additional Oil Pollution Prevention Measures - Fuel Oil Systems (22)CHANGES IN THE RULESComments to the rules may be sent by e-mail to rules@For subscription orders or information about subscription terms, please use distribution@Comprehensive information about DNV and the Society's services is found at the Web site © Det Norske VeritasComputer Typesetting (Adobe FrameMaker) by Det Norske Veritas Printed in NorwayIf any person suffers loss or damage which is proved to have been caused by any negligent act or omission of Det Norske Veritas, then Det Norske Veritas shall pay compensation to such person for his proved direct loss or damage. However, the compensation shall not exceed an amount equal to ten times the fee charged for the service in question, provided that the maximum compen-sation shall never exceed USD 2 million.In this provision "Det Norske Veritas" shall mean the Foundation Det Norske Veritas as well as all its subsidiaries, directors, officers, employees, agents and any other acting on behalf of Det Norske Veritas.GeneralThe present edition of the rules includes amendments and additions decided by the Board as of December 2008 and supersedes the Janu-ary 2006 edition of the same chapter.The rule changes come into force as indicated below.This chapter is valid until superseded by a revised chapter. Supple-ments will not be issued except for an updated list of corrections pre-sented in Pt.0 Ch.1 Sec.3. Pt.0 Ch.1 is normally revised in January and July each year.Revised chapters will be forwarded to all subscribers to the rules.Buyers of reprints are advised to check the updated list of rule chap-ters printed in Pt.0 Ch.1 Sec.1 to ensure that the chapter is current.Main changes coming into force 1 July 2009•General—The notation (CAA-N) has been included (evaluation of helicop-ter deck for compliance with the Norwegian Civil Aviation Au-thorities helicopter operation regulations BSL D 5-1 governing Norwegian Continental Shelf operation).—Requirements taking into account "green sea" on pillars, support-ing helicopter decks located in the fore ship, have been added un-der Sec.2 B500.—Safety requirements based on “CAP 437 - offshore helicopterlanding areas - guidance on standards, January 2005 edition”(UK Civil Aviation Authorities Publications), and fire safety re-quirements for helicopter deck installations as required by SOLAS, have been incorporated.—Any references to naval standards have been removed.Corrections and ClarificationsIn addition to the above stated rule requirements, a number of correc-tions and clarifications have been made in the existing rule text.Rules for Ships, January 2009Pt.6 Ch.1 Contents – Page 3D ET N ORSKE V ERITASCONTENTSSEC. 1GENERAL REQUIREMENTS.......................... 5A.Classification.. (5)A 100Application........................................................................5A 200Class notations..................................................................5B.Definitions..............................................................................5B 100Symbols (5)C.Documentation (5)C 100General (5)SEC. 2HELICOPTER INSTALLATIONS................... 6A.General.. (6)A 100Classification.....................................................................6A 200Definitions.........................................................................6A 300Documentation..................................................................6A 400Materials ...........................................................................7A 500Steel and aluminium connections.....................................7B.Design Loads and Load Combinations. (8)B 100General..............................................................................8B 200Landing forces...................................................................8B 300Gravity and inertia forces(due to vessel motions and accelerations).........................8B 400Sea pressure.......................................................................8B 500Green sea...........................................................................8B 600Other loads........................................................................9C.Structural Strength (9)C 100General..............................................................................9C 200Deck plating and stiffeners...............................................9C 300Girders and supporting structures ofseparate platforms.............................................................9C 400Miscellaneous .................................................................10D.Miscellaneous.. (10)D 100Personnel safety..............................................................10D 200Tie-down points..............................................................11D 300Surface friction of helicopter deck..................................11E.Requirements for Vessel Safety (HELDK-S ) (11)E 100Fire-fighting - General....................................................11E 200Structural fire integrity....................................................11E 300Fire fighting equipment...................................................11E400Communication between helicopter and vessel (11)F.Requirements for Helicopter Safety(HELDK-SH ) (12)F 100Size of helicopter deck....................................................12F 200Location..........................................................................12F 300Height of obstacles..........................................................12F 400Daylight marking............................................................12F 500Night operation marking.................................................13F 600Instrumentation (13)G.Requirements for Helicopter Refuelling andHangar Facilities (HELDK-SHF ) (13)G 100Classification and application.........................................13G 200Helicopter refuelling area................................................13G 300Hangar.............................................................................13H.(CAA-N)................................................................................14H 100Application. (14)I.Certification and Testing (14)I 100General............................................................................14I 200Certification....................................................................14I 300Testing of landing area and hangar deck........................14I 400Testing of visual landing aids.. (14I)500Testing of fire protection (14)SEC. 3SHIPBOARD CRANES.................................... 16A.General.. (16)A 100Classification...................................................................16A 200Scope...............................................................................16A 300Documentation................................................................16B.Design Loads.......................................................................16B 100General (16)C.Overturning and Sliding (16)C 100Overturning.....................................................................16C 200Sliding.............................................................................16D.Testing.................................................................................16D 100General (16)E.Stability (16)E 100Stability requirements for heavy lift operations (16)SEC. 4DIVING SYSTEMS .......................................... 17A.General.. (17)A 100Classification...................................................................17A 200Scope...............................................................................17A 300Documentation................................................................17B.Position Keeping.................................................................17B 100General............................................................................17C.Diving System Arrangement Layout and Location.. (17)C 100General (17)D.Electrical Systems (17)D 100General (17)E.Fire Prevention, Detection and Extinction (18)E 100General (18)F.Sanitary Systems for DSV-BOUNCE andDSV-SAT systems (18)F 100General............................................................................18G.Testing.................................................................................18G 100General............................................................................18H.Stability and Floatability...................................................18H 100General. (18)I.Hyperbaric Evacuation Systems (18)I100General (18)SEC. 5DEICING AND ANTI-ICING SYSTEMS ..... 19A.General.. (19)A 100Application......................................................................19A 200Assumption.....................................................................19A 300Classification...................................................................19A 400Scope...............................................................................19A 500Definitions.......................................................................19A 600Documentation................................................................19A 700Testing.............................................................................19B.Stability and Watertight Integrity (19)B 100General............................................................................19B 200Icing stability (19)C.Anti-icing and Deicing Arrangements andEquipment (20)C 100General............................................................................20C 200Class notation DEICE - general.....................................20C 300Class notation DEICE - additional measures fortankers (gas, oil, chemical).............................................21C 400Class notation DEICE-C for supply vessels...................21C 500Class notation DEICE-C for tankers..............................21C 600Special equipment...........................................................21C700Power generator capacity (21)Rules for Ships, January 2009Pt.6 Ch.1 Contents – Page 4D ET N ORSKE V ERITASSEC. 6ADDITIONAL OIL POLLUTIONPREVENTION MEASURES -FUEL OIL SYSTEMS........................................ 22A.General.. (22)A 100Application......................................................................22A 200Classification...................................................................22A 300Documentation (22)A 400Definitions.......................................................................22B.Arrangement of Fuel Oil Tanks........................................22B 100General............................................................................22C.Sundry. (23)C 100General (23)Rules for Ships, January 2009Pt.6 Ch.1 Sec.1 – Page 5D ET N ORSKE V ERITASSECTION 1GENERAL REQUIREMENTSA. ClassificationA 100Application101 The rules in this chapter apply to vessels with various special equipment and or arrangements not covered by chap-ters dealing with particular equipment or types of vessel. The requirements shall be regarded as supplementary to those giv-en for the assignment of main class.A 200Class notations201 Vessels with equipment and or arrangements complying with relevant additional requirements of this chapter will be as-signed one of the class notations given in Table A1.B. DefinitionsB 100Symbols101 The following symbols are used:L =rule length (m)B =rule breadth (m)D =rule depth (m)T =rule draught (m)f 1 =material factor= 1.0 for NV-NS steel = 1.08 for NV-27 steel = 1.28 for NV-32 steel = 1.39 for NV-36 steel =1.47 for NV-40 steelFor details see Pt.3 Ch.1 Sec.2 B for normal steel and Pt.3 Ch.1Sec.2 C for alternative materials. Note remark on reduced yield stress in heat affected zones for aluminium.C. DocumentationC 100General101 Plans and particulars to be submitted for approval or in-formation are specified in the respective sections of this chap-ter.Table A1 Class notationsHELDK, HELDK-S , HELDK-SH orHELDK-SHF equipped with helicopter deck (See Sec.2)(CAA-N)implies that the helicopter facility has been evaluated for compliance with the Norwegian Civil Aviation Authorities helicopter operation regulations BSL D 5-1 governing Norwegian Continental Shelf operations CRANEequipped with shipboard crane (See Sec.3)DSV-SURFACE, DSV-BOUNCE or DSV-SATequipped with diving systems (See Sec.4)DEICE or DEICE-C equipped with de-icing / anti-icing systems (See Sec.5)OPP-Farranged and equipped with additional oil pollution prevention measures - fuel oil systems (See Sec.6)Rules for Ships, January 2009Pt.6 Ch.1 Sec.2 – Page 6D ET N ORSKE V ERITASSECTION 2HELICOPTER INSTALLATIONSA. GeneralA 100Classification101 The requirements in this section apply to vessels with an erected landing platform for helicopters or a landing area ar-ranged directly on the weather deck or on the top of deckhouse.These requirements shall be regarded as supplementary to those given for the assignment of main class.The requirements are not intended to apply to landing areas used for occasional or emergency operations as regulated by SOLAS Ch. II-2 Reg. 18.2.2.Guidance note:The non-structural requirements given to the helicopter deck notations are based on “CAP 437 - offshore helicopter landing areas - guidance on standards, January 2005 edition” (UK Civil Aviation Authorities Publications).---e-n-d---of---G-u-i-d-a-n-c-e---n-o-t-e---102 Class notation HELDK requires compliance with the re-quirements given in A, B, C and D.Guidance note 1:It will be necessary also to comply with statutory vessel safety regulations of the state in which the vessel is registered and hel-icopter safe operation demands by the operators or guidance in this respect by helicopter registry authorities or aviation authori-ties. This applies to for example:-size, location and marking of helicopter deck -obstacle free approach and take-off sectors -rescue and fire-fighting (RFF) equipment.If Det Norske Veritas is delegated to issue SOLAS Safety Con-struction and Safety Equipment Certificates, SOLAS Reg. II-2/18 will apply as a minimum requirement with respect to fire safe-ty.---e-n-d---of---G-u-i-d-a-n-c-e---n-o-t-e---Guidance note 2:The responsibility for meeting any national requirements not covered by these rules rests with the operator of the vessel on which the helicopter deck is arranged.---e-n-d---of---G-u-i-d-a-n-c-e---n-o-t-e---103 If the requirements given in A, B, C, D and E are satis-fied, the notation may be extended to HELDK-S .Guidance note:HELDK-S requirements represent minimum shipboard safety requirements according to CAP 437 and SOLAS with regard to fire safety and means of escape.---e-n-d---of---G-u-i-d-a-n-c-e---n-o-t-e---104 If the requirements given in A, B, C, D, E and F are sat-isfied, the notation may be extended to HELDK-SH .Guidance note:HELDK-SH requirements represent in addition to S, the mini-mum requirement to location and size of helicopter deck, height of obstacles, marking, lights and instrumentation for safe heli-copter operations with CAP 437 as basis for details given.---e-n-d---of---G-u-i-d-a-n-c-e---n-o-t-e---105 If the requirements given in A, B, C, D, E, F and G are satisfied, the notation may be extended to HELDK-SHF .Guidance note:HELDK-SHF provides requirements for on-board helicopter service facilities.---e-n-d---of---G-u-i-d-a-n-c-e---n-o-t-e---A 200Definitions201 The following terms and abbreviations are used:—Helideck is a purpose built helicopter landing area locatedon a ship including all structure, fire-fighting appliances and other equipment necessary for the safe operation of helicopters.—Helicopter facility is a helideck including any refuellingand hangar facilities.—Helicopter landing area means an area on a ship designedfor emergency landing of helicopters.—RAST means recovery assist, secure and traverse.—SHOLS means ship helicopter operations limitations.A 300Documentation301 For class notation HELDK the following documentation shall be submitted for approval:a)Structural design and details with scantlings and particu-lars of materials used.b)Tie-down points, type and location on helicopter deck.c)Details of steel and aluminium connections as given in 500where such connections are used.d)Details on safety net, including strength.e)Details on landing net/ rope net, where such net is used.f)Supporting hull structure shall be clearly shown on thesubmitted drawings and the reaction forces at the hull sup-ports shall be specified.g)For erected helicopter decks where the deck is built up byunconventional profiles, the capacity of the profiles shall be documented by load test(s).A load test procedure shall be submitted for review prior to the load test being carried out.The load test shall be witnessed by a DNV surveyor.A report documenting the test and its results shall be appraised by DNV.Requirements to the load test:1)The beam shall be load tested without any permanent de-flections with a load of 3 times the fraction of the maxi-mum take-off mass of helicopter, acting on the wheel(s)/part of tubular skid having the highest load.2)Length between the supports shall be equal to or biggerthan the maximum span that is used in the in the applicable design.3)The support of the beam(s) shall reflect the worst possiblesituation in the applicable design.4)The test load shall be distributed over an area equal to thecontact area during landing, as specified by the helicopter manufacturer.When simulating the contact area for the helicopter wheels,rubber pads, equivalent in size to the contact area, shall be fit-ted on the steel plate to which the force is applied.Rules for Ships, January 2009Pt.6 Ch.1 Sec.2 – Page 7D ET N ORSKE V ERITAS302 For class notation HELDK the following documentation shall be submitted for information:a)Plans showing arrangement of the helicopter deck.b)Structural strength calculations for helicopter deck andsupporting structure, including information on all relevant design loads. Helicopter wheel load distribution shall be specified.c)Type, overall length with rotors running and maximum to-tal mass of helicopter shall be specified. 303 Other plans, specifications or information may be re-quired depending on the arrangement and the equipment used in each separate case.See Pt.2, Pt.3, Pt.4 and Pt.5, as appropriate.304 For class notation HELDK-S the following additional documentation shall be submitted for approval:a)Arrangement plan showing:—escape routes—materials in helicopter deck and possible insulationtowards superstructure—location of rescue- and fire fighting equipment—if relevant, location of hatches in the helicopter deck.b)Details and capacity calculations for the fixed foam fireextinguishing.c)Drainage arrangement.d)Details on communication between helicopter and vessel.305 For class notation HELDK-SH the following documen-tation shall be submitted for approval in addition to what is re-quested under 301-305:a)Obstacle free sector, including height of all obstacles.b)Daylight and night operation marking, including wiringdiagram for lights.c)Details and position of wind indicator.d)Test report for fire test of aluminium helicopter deck if ap-plicable, see 505.306 For class notation HELDK-SHF the following docu-mentation shall be submitted for approval in addition to what is requested under 301-306 for refuelling areas:a)Arrangement of helicopter refuelling area and position inrelation to accommodation and embarkation areas.b)Area classification for re-fuelling area if fuel with flash-point below 60º is used.c)Details of drainage facilities in way of the refuelling area.d)Details of helicopter fuel storage tank including: materialspecification, inspection hatch, level indicator and ventila-tion and fastening of tank to ship structure.e)Piping system for refuelling including: pump, filters, flow-meter, delivery hose, bounding cable and emergency shut down arrangement from safe location.f)Additional fire extinguishers and foam applicator cover-ing the refuelling unit.307 For class notation HELDK-SHF the following docu-mentation shall be submitted for approval in addition to what is requested under 301-306 for hangar/service area:a)Detailed structural drawings of hangar and hangar door.Functional loads /design information e.g. horizontal com-ponent of the helicopter down wash on hangar to be spec-ified.b)Fire rating of bulkheads and decks, doors and closing ap-pliances.c)Ventilation arrangement of hangar.d)Helicopter hangar layout with drainage arrangements andrope nets and rapid securing or traversing system (recessed grid, rails and other arrangements).e)Particulars about non skid coating on the deck betweenlanding area and hangar and in the hangar. f)Tie-down points, type and location in hangar.g)Hangar layout including location of equipment.h)Specification and location of fixed fire extinguishing ar-rangements in the hangar, including equipment and calcu-lation of discharge capacities.i)Specification and location of fire detectors, alarm devicesand call points.j)Specification of electrical installation in defined gas haz-ardous areas in the hangar, in accordance with Pt.4 Ch.8Sec.11 B102.k)Escape routes from the hangar.308 For class notation (CAA-N) the following documenta-tion shall be submitted for information:a)Confirmation of documented turbulence condition for thehelicopter deck.A 400Materials401 The grades of steel and aluminium materials shall be in compliance with the requirements for hull materials given in Pt.3 Ch.1.A 500Steel and aluminium connections501 In sea exposed areas, to prevent galvanic corrosion, a non-hygroscopic insulation material shall be applied between steel and aluminium. Bolts with nuts and washers shall be of stainless steel.Guidance note:Stainless steel shim is considered applicable non-hygroscopic material.---e-n-d---of---G-u-i-d-a-n-c-e---n-o-t-e---502 Horizontal inertia forces in bolted connections may be required to be taken up by metal to metal stoppers with insula-tion tape in the gap.503 Aluminium superstructures, which are provided with in-sulating material between aluminium and steel, shall be earthed to the hull. See Pt.4 Ch.8.504 For welded connections, any bimetallic connection flats shall be delivered from approved manufacturer and with DNV certificate.505 These rules consider aluminium helicopter decks as be-ing equivalent to steel with respect to fire integrity when tested as outlined below.Test procedure:—Size of prototype helicopter deck 5x5 m.— A static load simulating actual helicopter weight to bepresent on the deck.—Helicopter fuel shall be continuously supplied to the deckfor 10 minutes, so that the deck is filled with fuel at all times during the test. At all times during the test should fuel be dripping from drainage arrangements while there is a fire on the deck.Acceptance criteria (visual observations of the deck and seal-ing):Rules for Ships, January 2009Pt.6 Ch.1 Sec.2 – Page 8D ET N ORSKE V ERITAS—The helicopter deck shall not collapse or be deformed.—No fuel leakage or flames shall be observed under thedeck. The test shall be witnessed by a recognized Society.Guidance note 1:This test does not consider other aspects like for instance rotor damage caused by an overturned helicopter. For class notation HELDK-S/SH/SHF , aluminium helicopter decks are required to be tested as outlined above.The test report is subject to DNV's approval.---e-n-d---of---G-u-i-d-a-n-c-e---n-o-t-e---Guidance note 2:For notation HELDK , SOLAS Ch. II-2 Reg. 18.3.2 will be used when DNV are delegated to issue SOLAS safety certificates.---e-n-d---of---G-u-i-d-a-n-c-e---n-o-t-e---B. Design Loads and Load CombinationsB 100General101 The scantlings of each structural element shall be based on the most unfavourable of the following loading conditions:—landing condition—stowed condition (helicopter lashed onboard at sea).Guidance note:In the stowed condition, the helicopter deck strength and its sup-porting structure may be checked using Pt.3 Ch.1 and the wheel loading requirements given in Pt.5 Ch.2 Sec.4.---e-n-d---of---G-u-i-d-a-n-c-e---n-o-t-e---102 Both the normal operational conditions and any identifi-able accidental conditions shall be considered. The following loads are in general to be considered:—landing impact forces—gravity and inertia forces of the helicopter in stowed position —hull still water loads (applicable for use of weather decksas helicopter deck)—sea pressure.Guidance note:Wind loads on the helicopter in stowed condition may generally be neglected.---e-n-d---of---G-u-i-d-a-n-c-e---n-o-t-e---103 For landing platforms erected as separate structure the following loads are also to be considered:—gravity and inertia forces of the structure with equipment —wind forces (for erected structures)—ice loads.104 In the landing condition, the landing impact force shall be combined with associated environmental loads. Heel and trim need normally not be considered.105 The loads in 200 to 500 shall be combined as follows:Operational conditions:1)Landing condition—landing force—gravity and inertia forces of the structure with equip-ment.2)Stowed condition (helicopter lashed onboard)—gravity and inertia of the helicopter—gravity and inertia of the structure with equipment —hull bending loads (only applicable for integrated hel-icopter decks)—sea pressure—ice loads on erected helicopter deck and supportingstructure—green sea on pillars supporting erected helicopterdecks.3)Wind lift forces on erected structures (no helicopter ondeck).B 200Landing forces201 The total vertical force from the helicopter during land-ing shall be taken not less than:P v =2 g 0 M H (kN)M H =maximum take-off mass in t of helicopter.The total force P v shall be considered as distributed on the hel-icopter's landing gear in the same manner as when the helicop-ter is resting on a horizontal surface and the helicopter's centre of gravity is in its normal position in relation to the landing gear.B 300Gravity and inertia forces (due to vessel motions and accelerations)301 The dynamic design forces caused by the platform struc-ture itself and, if applicable, by the helicopter in it’s stowed po-sition are preferably to be taken either from direct calculations or model tests.302 Worst case realistic load combinations of static and dy-namic design forces shall be considered.Guidance note:For ships in world-wide operation, inertia forces can be deter-mined from Pt.3 Ch.1 Sec.4, and combined according to Pt.3Ch.1 Sec.4 C500 for operational conditions.---e-n-d---of---G-u-i-d-a-n-c-e---n-o-t-e---303 For vessels with class notation Supply Vessel the ac-celerations acting on the helicopter deck and supporting struc-ture shall be taken in accordance with Pt.5 Ch.7 Sec.3 E200.B 400Sea pressure401 The sea pressure for superstructure deck and top of houses shall be taken in accordance with Pt.3 Ch.1 Sec.4 C200.For elevated platforms with free water passage below, the re-duction 4 h 0 in the formula may be substituted by 4h 0 + k 0where k 0 = height of free water passage below in m. Minimum sea pressure is 2.5 kN/m 2.B 500Green sea501 Loads from green sea on pillars supporting erected heli-copter decks shall be included for helicopter deck positioned in the fore ship. The horizontal load caused by green sea is given by the following equation:p = 4.1 C D a (1.79 C W – h 0) [kN/m 2]C D =drag coefficient= 1.0 for circular cross section = 2.0 for non circular sections a = 2 + L/120, maximum 4.5L =length between perpendicularsh 0=vertical distance in m from the waterline at draught T to the load pointC W =wave load coefficient, see Pt.3 Ch.1 Sec.4 B200.This is a horizontal load acting in the direction of the ship lon-gitudinal axis. It shall be used on the supporting structures, and shall be combined with acceleration loads as specified in Pt.3Ch.1 Sec.4 C500.。

CP8310_Datasheet_Release_1.0_WOTX_kr

Use of this specification for product design requires an executed license agreement from the ClairPixel. The ClairPixel shall not be liable for technical or editorial errors or omissions contained herein; nor for incidental or consequential damages resulting from the furnishing, performance, or use of this material. All parts of the ClairPixel Specification are protected by copyright law and all rights are reserved. This documentation may not, in whole or in part, be copied, photocopied, reproduced, translated, or reduced to any electronic medium or machine readable form without prior consent, in writing, from the ClairPixel.
6. MCU interface ................................................................................................................................................19 7. EEPROM Boot Sequence .............................................................................................................................20 8. TG(Timing Generator) ...................................................................................................................................21

MIPS芯片架构说明

MIPS32™ Architecture For Programmers Volume I: Introduction to the MIPS32™ArchitectureDocument Number: MD00082Revision 2.00June 8, 2003MIPS Technologies, Inc.1225 Charleston RoadMountain View, CA 94043-1353Copyright © 2001-2003 MIPS Technologies Inc. All rights reserved.Copyright ©2001-2003 MIPS Technologies, Inc. All rights reserved.Unpublished rights (if any) reserved under the copyright laws of the United States of America and other countries.This document contains information that is proprietary to MIPS Technologies, Inc. ("MIPS Technologies"). Any copying,reproducing,modifying or use of this information(in whole or in part)that is not expressly permitted in writing by MIPS Technologies or an authorized third party is strictly prohibited. At a minimum, this information is protected under unfair competition and copyright laws. Violations thereof may result in criminal penalties and ﬁnes.Any document provided in source format(i.e.,in a modiﬁable form such as in FrameMaker or Microsoft Word format) is subject to use and distribution restrictions that are independent of and supplemental to any and all conﬁdentiality restrictions. UNDER NO CIRCUMSTANCES MAY A DOCUMENT PROVIDED IN SOURCE FORMAT BE DISTRIBUTED TO A THIRD PARTY IN SOURCE FORMAT WITHOUT THE EXPRESS WRITTEN PERMISSION OF MIPS TECHNOLOGIES, INC.MIPS Technologies reserves the right to change the information contained in this document to improve function,design or otherwise.MIPS Technologies does not assume any liability arising out of the application or use of this information, or of any error or omission in such information. Any warranties, whether express, statutory, implied or otherwise, including but not limited to the implied warranties of merchantability orﬁtness for a particular purpose,are excluded. Except as expressly provided in any written license agreement from MIPS Technologies or an authorized third party,the furnishing of this document does not give recipient any license to any intellectual property rights,including any patent rights, that cover the information in this document.The information contained in this document shall not be exported or transferred for the purpose of reexporting in violation of any U.S. or non-U.S. regulation, treaty, Executive Order, law, statute, amendment or supplement thereto. The information contained in this document constitutes one or more of the following: commercial computer software, commercial computer software documentation or other commercial items.If the user of this information,or any related documentation of any kind,including related technical data or manuals,is an agency,department,or other entity of the United States government ("Government"), the use, duplication, reproduction, release, modiﬁcation, disclosure, or transfer of this information, or any related documentation of any kind, is restricted in accordance with Federal Acquisition Regulation12.212for civilian agencies and Defense Federal Acquisition Regulation Supplement227.7202 for military agencies.The use of this information by the Government is further restricted in accordance with the terms of the license agreement(s) and/or applicable contract terms and conditions covering this information from MIPS Technologies or an authorized third party.MIPS,R3000,R4000,R5000and R10000are among the registered trademarks of MIPS Technologies,Inc.in the United States and other countries,and MIPS16,MIPS16e,MIPS32,MIPS64,MIPS-3D,MIPS-based,MIPS I,MIPS II,MIPS III,MIPS IV,MIPS V,MIPSsim,SmartMIPS,MIPS Technologies logo,4K,4Kc,4Km,4Kp,4KE,4KEc,4KEm,4KEp, 4KS, 4KSc, 4KSd, M4K, 5K, 5Kc, 5Kf, 20Kc, 25Kf, ASMACRO, ATLAS, At the Core of the User Experience., BusBridge, CoreFPGA, CoreLV, EC, JALGO, MALTA, MDMX, MGB, PDtrace, Pipeline, Pro, Pro Series, SEAD, SEAD-2, SOC-it and YAMON are among the trademarks of MIPS Technologies, Inc.All other trademarks referred to herein are the property of their respective owners.Template: B1.08, Built with tags: 2B ARCH MIPS32MIPS32™ Architecture For Programmers Volume I, Revision 2.00 Copyright © 2001-2003 MIPS Technologies Inc. All rights reserved.Table of ContentsChapter 1 About This Book (1)1.1 Typographical Conventions (1)1.1.1 Italic Text (1)1.1.2 Bold Text (1)1.1.3 Courier Text (1)1.2 UNPREDICTABLE and UNDEFINED (2)1.2.1 UNPREDICTABLE (2)1.2.2 UNDEFINED (2)1.3 Special Symbols in Pseudocode Notation (2)1.4 For More Information (4)Chapter 2 The MIPS Architecture: An Introduction (7)2.1 MIPS32 and MIPS64 Overview (7)2.1.1 Historical Perspective (7)2.1.2 Architectural Evolution (7)2.1.3 Architectural Changes Relative to the MIPS I through MIPS V Architectures (9)2.2 Compliance and Subsetting (9)2.3 Components of the MIPS Architecture (10)2.3.1 MIPS Instruction Set Architecture (ISA) (10)2.3.2 MIPS Privileged Resource Architecture (PRA) (10)2.3.3 MIPS Application Specific Extensions (ASEs) (10)2.3.4 MIPS User Defined Instructions (UDIs) (11)2.4 Architecture Versus Implementation (11)2.5 Relationship between the MIPS32 and MIPS64 Architectures (11)2.6 Instructions, Sorted by ISA (12)2.6.1 List of MIPS32 Instructions (12)2.6.2 List of MIPS64 Instructions (13)2.7 Pipeline Architecture (13)2.7.1 Pipeline Stages and Execution Rates (13)2.7.2 Parallel Pipeline (14)2.7.3 Superpipeline (14)2.7.4 Superscalar Pipeline (14)2.8 Load/Store Architecture (15)2.9 Programming Model (15)2.9.1 CPU Data Formats (16)2.9.2 FPU Data Formats (16)2.9.3 Coprocessors (CP0-CP3) (16)2.9.4 CPU Registers (16)2.9.5 FPU Registers (18)2.9.6 Byte Ordering and Endianness (21)2.9.7 Memory Access Types (25)2.9.8 Implementation-Specific Access Types (26)2.9.9 Cache Coherence Algorithms and Access Types (26)2.9.10 Mixing Access Types (26)Chapter 3 Application Specific Extensions (27)3.1 Description of ASEs (27)3.2 List of Application Specific Instructions (28)3.2.1 The MIPS16e Application Specific Extension to the MIPS32Architecture (28)3.2.2 The MDMX Application Specific Extension to the MIPS64 Architecture (28)3.2.3 The MIPS-3D Application Specific Extension to the MIPS64 Architecture (28)MIPS32™ Architecture For Programmers Volume I, Revision 2.00i Copyright © 2001-2003 MIPS Technologies Inc. All rights reserved.3.2.4 The SmartMIPS Application Specific Extension to the MIPS32 Architecture (28)Chapter 4 Overview of the CPU Instruction Set (29)4.1 CPU Instructions, Grouped By Function (29)4.1.1 CPU Load and Store Instructions (29)4.1.2 Computational Instructions (32)4.1.3 Jump and Branch Instructions (35)4.1.4 Miscellaneous Instructions (37)4.1.5 Coprocessor Instructions (40)4.2 CPU Instruction Formats (41)Chapter 5 Overview of the FPU Instruction Set (43)5.1 Binary Compatibility (43)5.2 Enabling the Floating Point Coprocessor (44)5.3 IEEE Standard 754 (44)5.4 FPU Data Types (44)5.4.1 Floating Point Formats (44)5.4.2 Fixed Point Formats (48)5.5 Floating Point Register Types (48)5.5.1 FPU Register Models (49)5.5.2 Binary Data Transfers (32-Bit and 64-Bit) (49)5.5.3 FPRs and Formatted Operand Layout (50)5.6 Floating Point Control Registers (FCRs) (50)5.6.1 Floating Point Implementation Register (FIR, CP1 Control Register 0) (51)5.6.2 Floating Point Control and Status Register (FCSR, CP1 Control Register 31) (53)5.6.3 Floating Point Condition Codes Register (FCCR, CP1 Control Register 25) (55)5.6.4 Floating Point Exceptions Register (FEXR, CP1 Control Register 26) (56)5.6.5 Floating Point Enables Register (FENR, CP1 Control Register 28) (56)5.7 Formats of Values Used in FP Registers (57)5.8 FPU Exceptions (58)5.8.1 Exception Conditions (59)5.9 FPU Instructions (62)5.9.1 Data Transfer Instructions (62)5.9.2 Arithmetic Instructions (63)5.9.3 Conversion Instructions (65)5.9.4 Formatted Operand-Value Move Instructions (66)5.9.5 Conditional Branch Instructions (67)5.9.6 Miscellaneous Instructions (68)5.10 Valid Operands for FPU Instructions (68)5.11 FPU Instruction Formats (70)5.11.1 Implementation Note (71)Appendix A Instruction Bit Encodings (75)A.1 Instruction Encodings and Instruction Classes (75)A.2 Instruction Bit Encoding Tables (75)A.3 Floating Point Unit Instruction Format Encodings (82)Appendix B Revision History (85)ii MIPS32™ Architecture For Programmers Volume I, Revision 2.00 Copyright © 2001-2003 MIPS Technologies Inc. All rights reserved.Figure 2-1: Relationship between the MIPS32 and MIPS64 Architectures (11)Figure 2-2: One-Deep Single-Completion Instruction Pipeline (13)Figure 2-3: Four-Deep Single-Completion Pipeline (14)Figure 2-4: Four-Deep Superpipeline (14)Figure 2-5: Four-Way Superscalar Pipeline (15)Figure 2-6: CPU Registers (18)Figure 2-7: FPU Registers for a 32-bit FPU (20)Figure 2-8: FPU Registers for a 64-bit FPU if Status FR is 1 (21)Figure 2-9: FPU Registers for a 64-bit FPU if Status FR is 0 (22)Figure 2-10: Big-Endian Byte Ordering (23)Figure 2-11: Little-Endian Byte Ordering (23)Figure 2-12: Big-Endian Data in Doubleword Format (24)Figure 2-13: Little-Endian Data in Doubleword Format (24)Figure 2-14: Big-Endian Misaligned Word Addressing (25)Figure 2-15: Little-Endian Misaligned Word Addressing (25)Figure 3-1: MIPS ISAs and ASEs (27)Figure 3-2: User-Mode MIPS ISAs and Optional ASEs (27)Figure 4-1: Immediate (I-Type) CPU Instruction Format (42)Figure 4-2: Jump (J-Type) CPU Instruction Format (42)Figure 4-3: Register (R-Type) CPU Instruction Format (42)Figure 5-1: Single-Precisions Floating Point Format (S) (45)Figure 5-2: Double-Precisions Floating Point Format (D) (45)Figure 5-3: Paired Single Floating Point Format (PS) (46)Figure 5-4: Word Fixed Point Format (W) (48)Figure 5-5: Longword Fixed Point Format (L) (48)Figure 5-6: FPU Word Load and Move-to Operations (49)Figure 5-7: FPU Doubleword Load and Move-to Operations (50)Figure 5-8: Single Floating Point or Word Fixed Point Operand in an FPR (50)Figure 5-9: Double Floating Point or Longword Fixed Point Operand in an FPR (50)Figure 5-10: Paired-Single Floating Point Operand in an FPR (50)Figure 5-11: FIR Register Format (51)Figure 5-12: FCSR Register Format (53)Figure 5-13: FCCR Register Format (55)Figure 5-14: FEXR Register Format (56)Figure 5-15: FENR Register Format (56)Figure 5-16: Effect of FPU Operations on the Format of Values Held in FPRs (58)Figure 5-17: I-Type (Immediate) FPU Instruction Format (71)Figure 5-18: R-Type (Register) FPU Instruction Format (71)Figure 5-19: Register-Immediate FPU Instruction Format (71)Figure 5-20: Condition Code, Immediate FPU Instruction Format (71)Figure 5-21: Formatted FPU Compare Instruction Format (71)Figure 5-22: FP RegisterMove, Conditional Instruction Format (71)Figure 5-23: Four-Register Formatted Arithmetic FPU Instruction Format (72)Figure 5-24: Register Index FPU Instruction Format (72)Figure 5-25: Register Index Hint FPU Instruction Format (72)Figure 5-26: Condition Code, Register Integer FPU Instruction Format (72)Figure A-1: Sample Bit Encoding Table (76)MIPS32™ Architecture For Programmers Volume I, Revision 2.00iii Copyright © 2001-2003 MIPS Technologies Inc. All rights reserved.Table 1-1: Symbols Used in Instruction Operation Statements (2)Table 2-1: MIPS32 Instructions (12)Table 2-2: MIPS64 Instructions (13)Table 2-3: Unaligned Load and Store Instructions (24)Table 4-1: Load and Store Operations Using Register + Offset Addressing Mode (30)Table 4-2: Aligned CPU Load/Store Instructions (30)Table 4-3: Unaligned CPU Load and Store Instructions (31)Table 4-4: Atomic Update CPU Load and Store Instructions (31)Table 4-5: Coprocessor Load and Store Instructions (31)Table 4-6: FPU Load and Store Instructions Using Register+Register Addressing (32)Table 4-7: ALU Instructions With an Immediate Operand (33)Table 4-8: Three-Operand ALU Instructions (33)Table 4-9: Two-Operand ALU Instructions (34)Table 4-10: Shift Instructions (34)Table 4-11: Multiply/Divide Instructions (35)Table 4-12: Unconditional Jump Within a 256 Megabyte Region (36)Table 4-13: PC-Relative Conditional Branch Instructions Comparing Two Registers (36)Table 4-14: PC-Relative Conditional Branch Instructions Comparing With Zero (37)Table 4-15: Deprecated Branch Likely Instructions (37)Table 4-16: Serialization Instruction (38)Table 4-17: System Call and Breakpoint Instructions (38)Table 4-18: Trap-on-Condition Instructions Comparing Two Registers (38)Table 4-19: Trap-on-Condition Instructions Comparing an Immediate Value (38)Table 4-20: CPU Conditional Move Instructions (39)Table 4-21: Prefetch Instructions (39)Table 4-22: NOP Instructions (40)Table 4-23: Coprocessor Definition and Use in the MIPS Architecture (40)Table 4-24: CPU Instruction Format Fields (42)Table 5-1: Parameters of Floating Point Data Types (45)Table 5-2: Value of Single or Double Floating Point DataType Encoding (46)Table 5-3: Value Supplied When a New Quiet NaN Is Created (47)Table 5-4: FIR Register Field Descriptions (51)Table 5-5: FCSR Register Field Descriptions (53)Table 5-6: Cause, Enable, and Flag Bit Definitions (55)Table 5-7: Rounding Mode Definitions (55)Table 5-8: FCCR Register Field Descriptions (56)Table 5-9: FEXR Register Field Descriptions (56)Table 5-10: FENR Register Field Descriptions (57)Table 5-11: Default Result for IEEE Exceptions Not Trapped Precisely (60)Table 5-12: FPU Data Transfer Instructions (62)Table 5-13: FPU Loads and Stores Using Register+Offset Address Mode (63)Table 5-14: FPU Loads and Using Register+Register Address Mode (63)Table 5-15: FPU Move To and From Instructions (63)Table 5-16: FPU IEEE Arithmetic Operations (64)Table 5-17: FPU-Approximate Arithmetic Operations (64)Table 5-18: FPU Multiply-Accumulate Arithmetic Operations (65)Table 5-19: FPU Conversion Operations Using the FCSR Rounding Mode (65)Table 5-20: FPU Conversion Operations Using a Directed Rounding Mode (65)Table 5-21: FPU Formatted Operand Move Instructions (66)Table 5-22: FPU Conditional Move on True/False Instructions (66)iv MIPS32™ Architecture For Programmers Volume I, Revision 2.00 Copyright © 2001-2003 MIPS Technologies Inc. All rights reserved.Table 5-23: FPU Conditional Move on Zero/Nonzero Instructions (67)Table 5-24: FPU Conditional Branch Instructions (67)Table 5-25: Deprecated FPU Conditional Branch Likely Instructions (67)Table 5-26: CPU Conditional Move on FPU True/False Instructions (68)Table 5-27: FPU Operand Format Field (fmt, fmt3) Encoding (68)Table 5-28: Valid Formats for FPU Operations (69)Table 5-29: FPU Instruction Format Fields (72)Table A-1: Symbols Used in the Instruction Encoding Tables (76)Table A-2: MIPS32 Encoding of the Opcode Field (77)Table A-3: MIPS32 SPECIAL Opcode Encoding of Function Field (78)Table A-4: MIPS32 REGIMM Encoding of rt Field (78)Table A-5: MIPS32 SPECIAL2 Encoding of Function Field (78)Table A-6: MIPS32 SPECIAL3 Encoding of Function Field for Release 2 of the Architecture (78)Table A-7: MIPS32 MOVCI Encoding of tf Bit (79)Table A-8: MIPS32 SRL Encoding of Shift/Rotate (79)Table A-9: MIPS32 SRLV Encoding of Shift/Rotate (79)Table A-10: MIPS32 BSHFL Encoding of sa Field (79)Table A-11: MIPS32 COP0 Encoding of rs Field (79)Table A-12: MIPS32 COP0 Encoding of Function Field When rs=CO (80)Table A-13: MIPS32 COP1 Encoding of rs Field (80)Table A-14: MIPS32 COP1 Encoding of Function Field When rs=S (80)Table A-15: MIPS32 COP1 Encoding of Function Field When rs=D (81)Table A-16: MIPS32 COP1 Encoding of Function Field When rs=W or L (81)Table A-17: MIPS64 COP1 Encoding of Function Field When rs=PS (81)Table A-18: MIPS32 COP1 Encoding of tf Bit When rs=S, D, or PS, Function=MOVCF (81)Table A-19: MIPS32 COP2 Encoding of rs Field (82)Table A-20: MIPS64 COP1X Encoding of Function Field (82)Table A-21: Floating Point Unit Instruction Format Encodings (82)MIPS32™ Architecture For Programmers Volume I, Revision 2.00v Copyright © 2001-2003 MIPS Technologies Inc. All rights reserved.vi MIPS32™ Architecture For Programmers Volume I, Revision 2.00 Copyright © 2001-2003 MIPS Technologies Inc. All rights reserved.Chapter 1About This BookThe MIPS32™ Architecture For Programmers V olume I comes as a multi-volume set.•V olume I describes conventions used throughout the document set, and provides an introduction to the MIPS32™Architecture•V olume II provides detailed descriptions of each instruction in the MIPS32™ instruction set•V olume III describes the MIPS32™Privileged Resource Architecture which deﬁnes and governs the behavior of the privileged resources included in a MIPS32™ processor implementation•V olume IV-a describes the MIPS16e™ Application-Speciﬁc Extension to the MIPS32™ Architecture•V olume IV-b describes the MDMX™ Application-Speciﬁc Extension to the MIPS32™ Architecture and is notapplicable to the MIPS32™ document set•V olume IV-c describes the MIPS-3D™ Application-Speciﬁc Extension to the MIPS64™ Architecture and is notapplicable to the MIPS32™ document set•V olume IV-d describes the SmartMIPS™Application-Speciﬁc Extension to the MIPS32™ Architecture1.1Typographical ConventionsThis section describes the use of italic,bold and courier fonts in this book.1.1.1Italic Text•is used for emphasis•is used for bits,ﬁelds,registers, that are important from a software perspective (for instance, address bits used bysoftware,and programmableﬁelds and registers),and variousﬂoating point instruction formats,such as S,D,and PS •is used for the memory access types, such as cached and uncached1.1.2Bold Text•represents a term that is being deﬁned•is used for bits andﬁelds that are important from a hardware perspective (for instance,register bits, which are not programmable but accessible only to hardware)•is used for ranges of numbers; the range is indicated by an ellipsis. For instance,5..1indicates numbers 5 through 1•is used to emphasize UNPREDICTABLE and UNDEFINED behavior, as deﬁned below.1.1.3Courier TextCourier ﬁxed-width font is used for text that is displayed on the screen, and for examples of code and instruction pseudocode.MIPS32™ Architecture For Programmers Volume I, Revision 2.001 Copyright © 2001-2003 MIPS Technologies Inc. All rights reserved.Chapter 1 About This Book1.2UNPREDICTABLE and UNDEFINEDThe terms UNPREDICTABLE and UNDEFINED are used throughout this book to describe the behavior of theprocessor in certain cases.UNDEFINED behavior or operations can occur only as the result of executing instructions in a privileged mode (i.e., in Kernel Mode or Debug Mode, or with the CP0 usable bit set in the Status register).Unprivileged software can never cause UNDEFINED behavior or operations. Conversely, both privileged andunprivileged software can cause UNPREDICTABLE results or operations.1.2.1UNPREDICTABLEUNPREDICTABLE results may vary from processor implementation to implementation,instruction to instruction,or as a function of time on the same implementation or instruction. Software can never depend on results that areUNPREDICTABLE.UNPREDICTABLE operations may cause a result to be generated or not.If a result is generated, it is UNPREDICTABLE.UNPREDICTABLE operations may cause arbitrary exceptions.UNPREDICTABLE results or operations have several implementation restrictions:•Implementations of operations generating UNPREDICTABLE results must not depend on any data source(memory or internal state) which is inaccessible in the current processor mode•UNPREDICTABLE operations must not read, write, or modify the contents of memory or internal state which is inaccessible in the current processor mode. For example,UNPREDICTABLE operations executed in user modemust not access memory or internal state that is only accessible in Kernel Mode or Debug Mode or in another process •UNPREDICTABLE operations must not halt or hang the processor1.2.2UNDEFINEDUNDEFINED operations or behavior may vary from processor implementation to implementation, instruction toinstruction, or as a function of time on the same implementation or instruction.UNDEFINED operations or behavior may vary from nothing to creating an environment in which execution can no longer continue.UNDEFINED operations or behavior may cause data loss.UNDEFINED operations or behavior has one implementation restriction:•UNDEFINED operations or behavior must not cause the processor to hang(that is,enter a state from which there is no exit other than powering down the processor).The assertion of any of the reset signals must restore the processor to an operational state1.3Special Symbols in Pseudocode NotationIn this book, algorithmic descriptions of an operation are described as pseudocode in a high-level language notation resembling Pascal. Special symbols used in the pseudocode notation are listed in Table 1-1.Table 1-1 Symbols Used in Instruction Operation StatementsSymbol Meaning←Assignment=, ≠Tests for equality and inequality||Bit string concatenationx y A y-bit string formed by y copies of the single-bit value x2MIPS32™ Architecture For Programmers Volume I, Revision 2.00 Copyright © 2001-2003 MIPS Technologies Inc. All rights reserved.1.3Special Symbols in Pseudocode Notationb#n A constant value n in base b.For instance10#100represents the decimal value100,2#100represents the binary value 100 (decimal 4), and 16#100 represents the hexadecimal value 100 (decimal 256). If the "b#" preﬁx is omitted, the default base is 10.x y..z Selection of bits y through z of bit string x.Little-endian bit notation(rightmost bit is0)is used.If y is less than z, this expression is an empty (zero length) bit string.+, −2’s complement or ﬂoating point arithmetic: addition, subtraction∗, ×2’s complement or ﬂoating point multiplication (both used for either)div2’s complement integer divisionmod2’s complement modulo/Floating point division<2’s complement less-than comparison>2’s complement greater-than comparison≤2’s complement less-than or equal comparison≥2’s complement greater-than or equal comparisonnor Bitwise logical NORxor Bitwise logical XORand Bitwise logical ANDor Bitwise logical ORGPRLEN The length in bits (32 or 64) of the CPU general-purpose registersGPR[x]CPU general-purpose register x. The content of GPR[0] is always zero.SGPR[s,x]In Release 2 of the Architecture, multiple copies of the CPU general-purpose registers may be implemented.SGPR[s,x] refers to GPR set s, register x. GPR[x] is a short-hand notation for SGPR[ SRSCtl CSS, x].FPR[x]Floating Point operand register xFCC[CC]Floating Point condition code CC.FCC[0] has the same value as COC[1].FPR[x]Floating Point (Coprocessor unit 1), general register xCPR[z,x,s]Coprocessor unit z, general register x,select sCP2CPR[x]Coprocessor unit 2, general register xCCR[z,x]Coprocessor unit z, control register xCP2CCR[x]Coprocessor unit 2, control register xCOC[z]Coprocessor unit z condition signalXlat[x]Translation of the MIPS16e GPR number x into the corresponding 32-bit GPR numberBigEndianMem Endian mode as conﬁgured at chip reset (0→Little-Endian, 1→ Big-Endian). Speciﬁes the endianness of the memory interface(see LoadMemory and StoreMemory pseudocode function descriptions),and the endianness of Kernel and Supervisor mode execution.BigEndianCPU The endianness for load and store instructions (0→ Little-Endian, 1→ Big-Endian). In User mode, this endianness may be switched by setting the RE bit in the Status register.Thus,BigEndianCPU may be computed as (BigEndianMem XOR ReverseEndian).Table 1-1 Symbols Used in Instruction Operation StatementsSymbol MeaningChapter 1 About This Book1.4For More InformationVarious MIPS RISC processor manuals and additional information about MIPS products can be found at the MIPS URL:ReverseEndianSignal to reverse the endianness of load and store instructions.This feature is available in User mode only,and is implemented by setting the RE bit of the Status register.Thus,ReverseEndian may be computed as (SR RE and User mode).LLbitBit of virtual state used to specify operation for instructions that provide atomic read-modify-write.LLbit is set when a linked load occurs; it is tested and cleared by the conditional store. It is cleared, during other CPU operation,when a store to the location would no longer be atomic.In particular,it is cleared by exception return instructions.I :,I+n :,I-n :This occurs as a preﬁx to Operation description lines and functions as a label. It indicates the instruction time during which the pseudocode appears to “execute.” Unless otherwise indicated, all effects of the currentinstruction appear to occur during the instruction time of the current instruction.No label is equivalent to a time label of I . Sometimes effects of an instruction appear to occur either earlier or later — that is, during theinstruction time of another instruction.When this happens,the instruction operation is written in sections labeled with the instruction time,relative to the current instruction I ,in which the effect of that pseudocode appears to occur.For example,an instruction may have a result that is not available until after the next instruction.Such an instruction has the portion of the instruction operation description that writes the result register in a section labeled I +1.The effect of pseudocode statements for the current instruction labelled I +1appears to occur “at the same time”as the effect of pseudocode statements labeled I for the following instruction.Within one pseudocode sequence,the effects of the statements take place in order. However, between sequences of statements for differentinstructions that occur “at the same time,” there is no deﬁned order. Programs must not depend on a particular order of evaluation between such sections.PCThe Program Counter value.During the instruction time of an instruction,this is the address of the instruction word. The address of the instruction that occurs during the next instruction time is determined by assigning a value to PC during an instruction time. If no value is assigned to PC during an instruction time by anypseudocode statement,it is automatically incremented by either 2(in the case of a 16-bit MIPS16e instruction)or 4before the next instruction time.A taken branch assigns the target address to the PC during the instruction time of the instruction in the branch delay slot.PABITSThe number of physical address bits implemented is represented by the symbol PABITS.As such,if 36physical address bits were implemented, the size of the physical address space would be 2PABITS = 236 bytes.FP32RegistersModeIndicates whether the FPU has 32-bit or 64-bit ﬂoating point registers (FPRs).In MIPS32,the FPU has 3232-bit FPRs in which 64-bit data types are stored in even-odd pairs of FPRs.In MIPS64,the FPU has 3264-bit FPRs in which 64-bit data types are stored in any FPR.In MIPS32implementations,FP32RegistersMode is always a 0.MIPS64implementations have a compatibility mode in which the processor references the FPRs as if it were a MIPS32 implementation. In such a caseFP32RegisterMode is computed from the FR bit in the Status register.If this bit is a 0,the processor operates as if it had 32 32-bit FPRs. If this bit is a 1, the processor operates with 32 64-bit FPRs.The value of FP32RegistersMode is computed from the FR bit in the Status register.InstructionInBranchDelaySlotIndicates whether the instruction at the Program Counter address was executed in the delay slot of a branch or jump. This condition reﬂects the dynamic state of the instruction, not the static state. That is, the value is false if a branch or jump occurs to an instruction whose PC immediately follows a branch or jump, but which is not executed in the delay slot of a branch or jump.SignalException(exce ption, argument)Causes an exception to be signaled, using the exception parameter as the type of exception and the argument parameter as an exception-speciﬁc argument). Control does not return from this pseudocode function - the exception is signaled at the point of the call.Table 1-1 Symbols Used in Instruction Operation StatementsSymbolMeaning。

Fusion 360 制图功能教程：绘制工程图纸说明书

Default Title Blocks ................................................................................................................ 9 Importing Custom Title Blocks ............................................................................................... 9 Drawing Templates................................................................................................................ 9
Your AU Expert(s)
Andrew de Leon is a senior principal user experience designer at Autodesk, Inc., with 20 years’ experience in the manufacturing industry and 11 years in user experience design. He has experience with AutoCAD software, AutoCAD Mechanical software, Inventor software, and Fusion பைடு நூலகம்60 software. He’s passionate about manufacturing and design, and enjoys solving difficult problems.

LiveU LU500 User Guide V3.0

•
• • •
•
3
LiveU LU500 User Guide
Table of Contents
About This Guide ........................................................................................................ 1 Intended Audience ................................................................................................. 3 Additional Documentation .................................................................................... 3 Chapter 1: Introducing the LU500 ............................................................................ 9 Overview........................................................................................................................... 9 What’s in the LU500 Carrying Case? .........................................................................11 LiveU Central ..................................................................................................................12 Chapter 2: Getting Started ...................................................................................... 13 Step 1, Connecting the Video Camera ...................................................................14 Step 2, Powering On the LU500 Unit...........................................................................15 Charging the LU500 ...............................................................................................15 Step 3, Selecting a Channel .......................................................................................17 Virtual Groups .........................................................................................................20 Step 4, Selecting a Profile ............................................................................................22 Select a Profile ........................................................................................................22 Select the Delay .....................................................................................................23 Step 5, Selecting an Advanced Streaming Mode ................................................. 23 Step 6, Configuring WiFi ...............................................................................................27 Step 7, Going Live .........................................................................................................29 Checking Interface Quality .................................................................................30 Step 8, Shutting Down ..................................................................................................33 Chapter 3: LU500 User Interface ............................................................................. 35 LU500 Touch Screen Interface ....................................................................................36 Video Feed .....................................................................................................................37 Currently Selected Channel ......................................................................................39 Currently Selected Profile ...........................................................................................40 Connected Interfaces and Bandwidth.........................................................................40 Battery Status ................................................................................................................41 Turning Off .....................................................................................................................41 System Menu .................................................................................................................42 Selecting the LU500 Profile..........................................................................................43 Live ............................................................................................................................41 Store & Forward ......................................................................................................42 Configuration ................................................................................................................45

UBVI CCD photometry of two old open clusters NGC 1798 and NGC 2192

a r X i v :a s t r o -p h /9901140v 1 12 J a n 1999Mon.Not.R.Astron.Soc.000,1–8(1998)Printed 1February 2008(MN L A T E X style ﬁle v1.4)UBV I CCD photometry of two old open clusters NGC 1798and NGC 2192Hong Soo Park and Myung Gyoon Lee ⋆Department of Astronomy,Seoul National University,Seoul 151-742,KoreaAccepted 1998??.Received 1998??;in original form 1998July ??ABSTRACT We present UBV I CCD photometry of two open clusters NGC 1798and NGC 2192which were little studied before.Color-magnitude diagrams of these clusters show several features typical for old open clusters:a well-deﬁned main-sequence,a red giant clump,and a small number of red giants.The main sequence of NGC 1798shows a distinct gap at V ≈16.2mag.From the surface number density distribution we have measured the size of the clusters,obtaining 8′.3(=10.2pc)for NGC 1798and 7′.3(=7.5pc)for NGC 2192.Then we have determined the reddening,metallicity,and distance of these clusters using the color-color diagrams and color-magnitude diagrams:E (B −V )=0.51±0.04,[Fe/H]=−0.47±0.15dex and (m −M )0=13.1±0.2(d =4.2±0.3kpc)for NGC 1798,and E (B −V )=0.20±0.03,[Fe/H]=−0.31±0.15dex and (m −M )0=12.7±0.2(d =3.5±0.3kpc)for NGC 2192.The ages of these clusters have been estimated using the morphological age indicators and the isochrone ﬁtting with the Padova isochrones:1.4±0.2Gyrs for NGC 1798and 1.1±0.1Gyrs for NGC 2192.The luminosity functions of the main sequence stars in these clusters are found to be similar to other old open clusters.The metallicity and distance of these clusters are consistent with the relation between the metallicity and galactocentric distance of other old open clusters.Key words:Hertzsprung–Russell (HR)diagram –open clusters and associations:general –open clusters and associations:individual:NGC 1798,NGC 2192–stars:luminosity function.1INTRODUCTIONOld open clusters provide us with an important informationfor understanding the early evolution of the Galactic disk.There are about 70known old open clusters with age >1Gyrs (Friel 1995).These clusters are faint in general so thatthere were few studies about these clusters until recently.With the advent of CCD camera in astronomy,the numberof studies on these clusters has been increasing.However,there are still a signiﬁcant number of old open clusters forwhich basic parameters are not well known.For example,metallicity is not yet known for about 30clusters amongthem.Recently Phelps et al.(1994)and Janes &Phelps (1994)presented an extensive CCD photometric survey of potentialold open clusters,the results of which were used in the studyon the development of the Galactic disk by Janes &Phelps(1994).In the sample of the clusters studied by Phelps et al.⋆corresponding author,E-mail:mglee@astrog.snu.ac.krthere are several clusters for which only the non-calibrated photometry is available.We have chosen two clusters among them,NGC 1798and NGC 2192,to study the characteristics of these clus-ters using UBV I CCD photometry.These clusters are lo-cated in the direction of anti-galactic centre.To date there is published only one photometric study of these clusters,which was given by Phelps et al.(1994)who presented non-calibrated BV CCD photometry of these clusters.From the instrumental color-magnitude diagrams of these clus-ters Phelps et al.estimated the ages of these clusters using the morphological age indicators,obtaining the values of 1.5Gyrs for NGC 1798and 1.1Gyrs for NGC 2192.However,no other properties of these clusters are yet known.In this paper we present a study of NGC 1798and NGC 2192based on UBV I CCD photometry.We have es-timated the basic parameters of these clusters:size,red-dening,metallicity,distance,and age.Also we have derived the luminosity function of the main sequence stars in these clusters.Section 2describes the observations and data re-duction.Sections 3and 4present the analysis for NGC 1798c 1998RAS2Hong Soo Park and Myung Gyoon Leeand NGC2192,respectively.Section5discusses the results. Finally Section6summarizes the primary results.2OBSER V ATIONS AND DATA REDUCTION 2.1ObservationsUBV I CCD images of NGC1798and NGC2192were obtained using the Photometrics512CCD camera at the Sobaeksan Observatory61cm telescope in Korea for several observing runs between1996November and1997October. We have used also BV CCD images of the central region of NGC1798obtained by Chul Hee Kim using the Tek1024 CCD camera at the Vainu Bappu Observatory2.3m tele-scope in India on March4,1998.The observing log is given in Table1.The original CCD images wereﬂattened after bias sub-traction and several exposures for eachﬁlter were combined into a single image for further reduction.The sizes of the ﬁeld in a CCD image are4′.3×4′.3for the PM512CCD im-age,and10′.6×10′.6for the Tek1024CCD image.The gain and readout noise are,respectively,9electrons/ADU and 10.4electrons for the PM512CCD,and9electrons/ADU and10.4electrons for the Tek1024CCD.Figs.1and2illustrate grey scale maps of the V CCD images of NGC1798and NGC2192made by mosaicing the images of the observed regions.It is seen from theseﬁgures that NGC1798is a relatively rich open cluster,while NGC 2192is a relatively poor open cluster.2.2Data ReductionInstrumental magnitudes of the stars in the CCD images were obtained using the digital stellar photometry reduction program IRAF⋆/DAOPHOT(Stetson1987,Davis1994). The resulting instrumental magnitudes were transformed onto the standard system using the standard stars from Lan-dolt(1992)and the M67stars in Montgomery et al.(1993) observed on the same photometric nights.The transforma-tion equations areV=v+a V(b−v)+k V X+Z V,(B−V)=a BV(b−v)+k BV X+Z BV,(U−B)=a UB(u−b)+k UB X+Z UB,and(V−I)=a V I(v−i)+k V I X+Z V I,where the lower case symbols represent instrumental mag-nitudes derived from the CCD images and the upper case symbols represent the standard system values.X is the air-mass at the midpoint of the observations.The results of the transformation are summarized in Table2.The data ob-tained on non-photometric nights were calibrated using the photometric data for the overlapped region.The total number of the measured stars is1,416for NGC1798and409for NGC2192.Tables3and4list the⋆IRAF is distributed by the National Optical Astronomy Ob-servatories,which are operated by the Association of Universities for Research in Astronomy,Inc.under contract with the National Science Foundation.photometry of the bright stars in the C-regions of NGC1798 and NGC2192,respectively.The X and Y coordinates listed in Table3and4are given in units of CCD pixel(=0′′.50). The X and Y values are increasing toward north and west, respectively.We have divided the entire region of theﬁelds into sev-eral regions,as shown in Figs.1and2,for the analysis of the data.The C-region represents the central region of the cluster,and the F-regions(F,Fb,Fir,and Fi regions)rep-resent the controlﬁeld regions,and the N-region represents the intermediate region between the central region and the ﬁeld region.The radius of the C-region is300pixel for NGC 1798and NGC2192.The ratio of the areas of the C-region, N-region,Fb-region,and(Fi+Fir)-regions for NGC1798is 1:1.50:1.00:1.07,and the ratio of the areas of the C-region, N-region,and F-region for NGC2192is1:1.26:0.98.3ANALYSIS FOR NGC17983.1The Size of the ClusterWe have investigated the structure of NGC1798using star-counts.The centre of the cluster is estimated to be at the po-sition of(X=710pixel,Y=1110pixel),using the centroid method.Fig.3illustrates the projected surface number den-sity proﬁle derived from counting stars with V<19.5mag in the entire CCDﬁeld.The magnitude cutoﬀfor starcounts was set so that the counts should be free of any photometric incompleteness problem.Fig.3shows that most of the stars in NGC1798are concentrated within the radius of250pixel (=125′′),and that the outskirts of the cluster extend out to about500pixel(=250′′)from the center.The number density changes little with radius beyond500pixel,show-ing that the outer region of the observedﬁeld can be used as a controlﬁeld.Therefore we have estimated the approxi-mate size of NGC1798for which the cluster blends in with theﬁeld to be about500′′in diameter,which corresponds to a linear size of10.2pc for the distance of NGC1798as determined below.3.2Color-Magnitude DiagramsFigs.4and5show the V−(B−V)and V−(V−I)color-magnitude diagrams(CMDs)of the measured stars in the observed regions in NGC1798.Theseﬁgures show that the C-region consists mostly of the members of NGC1798with some contamination of theﬁeld stars,while the F-regions consist mostly of theﬁeld stars.The N-region is intermediate between the C-region and the F-region.The distinguishable features seen in the color-magnitude diagrams of the C-region are:(a)There is a well-deﬁned main sequence the top of which is located at V≈16 mag;(b)There is seen a distinct gap at V≈16.2mag in the main sequence,which is often seen in other old open clusters (e.g.M67);(c)There is a poorly deﬁned red giant branch and these is seen some excess of stars around(B−V)=1.3 and V=15.6mag on this giant branch,which is remarked by the small box in theﬁgures.This may be a random excess of stars.However,the positions of the stars in the CMDs are consistent with the positions of known red giant clump in other old open clusters.Therefore most of these stars arec 1998RAS,MNRAS000,1–8UBV I CCD photometry of two old open clusters NGC1798and NGC21923probably red giant clump stars;and(d)There are a small number of stars along the locus of the red giant branch. 3.3Reddening and MetallicityNGC1798is located close to the galactic plane in the anti-galactic centre direction(b=4◦.85and l=160◦.76)so that it is expected that the reddening toward this cluster is signiﬁcant.We have estimated the reddening for NGC1798 using two methods as follows.First we have used the mean color of the red giant clump.Janes&Phelps(1994)estimated the mean color and magnitude of the red giant clump in old open clusters to be (B−V)RGC=0.87±0.02and M V,RGC=0.59±0.09,when the diﬀerence between the red giant clump and the main sequence turn-oﬀof the clusters,δV,is smaller than one. The mean color of the red giant clump in the C-region is estimated to be(B−V)RGC=1.34±0.01((V−I)RGC= 1.47±0.01,and(U−B)RGC=1.62±0.04),and the cor-responding mean magnitude is V RGC=15.57±0.05.δV is estimated to be0.8±0.2,which is the same value derived by Phelps et al.(1994).From these data we have derived a value of the reddening,E(B−V)=0.47±0.02.Secondly we have used the color-color diagram to es-timate the reddening and the metallicity simultaneously. We haveﬁtted the mean colors of the stars in the C-region with the color-color relation used in the Padova isochrones (Bertelli et al.1994).This process requires iteration,because we need to know the age of the cluster as well as the red-dening and metallicity.We have iterated this process until all three parameters are stabilized.Fig.6illustrates the results ofﬁtting in the(U−B)−(B−V)color-color diagram.It is shown in thisﬁgure that the stars in NGC1798are reasonablyﬁtted by the color-color relation of the isochrones for[Fe/H]=−0.47±0.15 with a reddening value of E(B−V)=0.55±0.05. The error for the metallicity,0.15,was estimated by com-paring isochrones with diﬀerent metallicities.As a reference the mean locus of the giants for solar abundance given by Schmidt-Kaler(1982)is also plotted in Fig.6.Finally we derive a mean value of the two estimates for the reddening, E(B−V)=0.51±0.04.3.4DistanceWe have estimated the distance to NGC1798using two methods as follows.First we have used the mean magnitude of the red giant clump.We have derived a value of the ap-parent distance modulus(m−M)V=14.98±0.10from the values for the mean magnitudes of the red giant clump stars described above.Secondly we have used the the zero-age main sequence (ZAMS)ﬁtting,following the method described in Vanden-Berg&Poll(1989).VandenBerg&Poll(1989)presented the semi-empirical ZAMS as a function of the metallicity[Fe/H] and the helium abundance Y:V=M V(B−V)+δM V(Y)+δM V([Fe/H])whereδM V(Y)=2.6(Y−0.27)andδM V([Fe/H])=−[Fe/H](1.444+0.362[Fe/H]).Before the ZAMSﬁtting,we subtracted statistically the contribution due to theﬁeld stars in the CMDs of the C-region using the CMDs of the Fb-region for BV photometry and the CMDs of the Fi+Fir region for V I photometry. The size of the bin used for the subtraction is∆V=0.25 and∆(B−V)=0.1.The resulting CMDs are displayed in Fig.7.We used the metallicity of[Fe/H]=–0.47as derived above and adopted Y=0.28which is the mean value for old open clusters(Gratton1982).Using this method we have obtained a value of the apparent distance modulus(m−M)V=14.5±0.2.Finally we calculate a mean value of the two estimates,(m−M)V=14.7±0.2.Adopting the extinction law of A V=3.2E(B−V),we derive a value of the intrinsic distance modulus(m−M)0=13.1±0.2.This corresponds to a distance of d=4.2±0.3kpc.3.5AgeWe have estimated the age of NGC1798using two methods as follows.First we have used the morphological age index (MAI)as described in Phelps et al.(1994).Phelps et al. (1994)and Janes&Phelps(1994)presented the MAI–δV relation,MAI[Gyrs]=0.73×10(0.256δV+0.0662δV2).From the value ofδV derived above,0.8±0.2mag,we obtain a value for the age,MAI=1.3±0.2Gyrs.Secondly we have estimated the age of the cluster us-ing the theoretical isochrones given by the Padova group (Bertelli et al.1994).Fitting the isochrones for[Fe/H]=–0.47to the CMDs of NGC1798,as shown in Fig.8,we estimate the age to be1.4±0.2Gyrs.Both results agree very well.3.6Luminosity FunctionWe have derived the V luminosity functions of the main sequence stars in NGC1798,which are displayed in Fig.9.The Fb-region was used for subtraction of theﬁeld star contribution from the C-region and the magnitude bin size used is0.5mag.This controlﬁeld may not be far enough from the cluster to derive theﬁeld star contribution.If so,we might have oversubtracted theﬁeld contribution,obtaining ﬂatter luminosity functions than true luminosity functions. However,the fraction of the cluster members in thisﬁeld must be,if any,very low,because the surface number density of this region is almost constant with the radius as shown in Fig.3.The luminosity function of the C-region in Fig. 9(a)increases rapidly up to V≈16.5mag,and stays almost ﬂat for V>16.5mag.The luminosity functions of the N-region and the(R+Fir)-region are steeper than that of the C-region.A remarkable drop is seen at V=16.2mag(M V= 1.5mag)in the luminosity function of the C-region based on smaller bin size of0.2mag in Fig.9(b).This corresponds to the main sequence gap described above.4ANALYSIS FOR NGC21924.1The Size of the ClusterWe have investigated the structure of NGC2192using star-counts.We could not use the centroid method to estimatec 1998RAS,MNRAS000,1–84Hong Soo Park and Myung Gyoon Leethe centre of this cluster,because this cluster is too sparse. So we have used eye-estimate to determine the centre of the cluster to be at the position of(X=465pixel,Y=930 pixel).Fig.10illustrates the projected surface number den-sity proﬁle derived from counting stars with V<18mag in the entire CCDﬁeld.The magnitude cutoﬀfor starcounts was set so that the counts should be free of any photomet-ric incompleteness problem.Fig.10shows that most of the stars in NGC2192are concentrated within the radius of200 pixel(=100′′),and that the outskirts of the cluster extend out to about440pixel(=220′′)from the centre.Therefore the approximate size of NGC2192is estimated to be about 440′′in diameter,which corresponds to a linear size of7.5pc for the distance of NGC2192as determined below.4.2Color-Magnitude DiagramsFigs.11and12show the V−(B−V)and V−(V−I)color-magnitude diagrams of the measured stars in the observed regions in NGC2192.The distinguishable features seen in the color-magnitude diagrams of the C-region are:(a)There is a well-deﬁned main sequence the top of which is located at V≈14mag;(b)There are a group of red giant clump stars at(B−V)=1.1and V=14.2mag,which are remarked by the small box in theﬁgures;and(c)There are a small number of stars along the locus of the red giant branch. 4.3Reddening and MetallicityNGC2192is located11degrees above the galactic plane in the anti-galactic centre direction(b=10◦.64and l= 173◦.41)but higher than NGC1798so that it is expected that the reddening toward this cluster is signiﬁcant but smaller than that of NGC1798.We have estimated the red-dening for NGC2192using two methods as applied for NGC 1798.First we have used the mean color of the red giant clump.The mean color of the red giant clump in the C-region is estimated to be(B−V)RGC=1.08±0.01((V−I)RGC=1.07±0.01,and(U−B)RGC=0.61±0.02),and the corresponding mean magnitude is V RGC=14.20±0.05.δV is estimated to be0.6±0.2,which is similar to the value derived by Phelps et al.(1994).From these data we have derived a value of the reddening,E(B−V)=0.19±0.03.Secondly we have used the color-color diagram to es-timate the reddening and the metallicity simultaneously. We haveﬁtted the mean colors of the stars in the C-region with the color-color relation used in the Padova isochrones (Bertelli et al.1994).Fig.13illustrates the results ofﬁt-ting in the(U−B)−(B−V)color-color diagram.It is shown in thisﬁgure that the stars in NGC2192are rea-sonablyﬁtted by the color-color relation of the isochrones for[Fe/H]=−0.31±0.15dex with a reddening value of E(B−V)=0.21±0.01.The error for the metallicity,0.15, was estimated by comparing isochrones with diﬀerent metal-licities.As a reference the mean locus of the giant for solar abundance given by Schmidt-Kaler is also plotted in Fig.13. Finally we derive a mean value of the two estimates for the reddening,E(B−V)=0.20±0.03.4.4DistanceWe have estimated the distance to NGC2192using two methods as for NGC1798.First we have used the mean magnitude of the red giant clump.We have derived a value of the apparent distance modulus(m−M)V=13.61±0.10 from the values for the mean magnitudes of the red giant clump stars described previously.Secondly we have used the ZAMSﬁtting.Before the ZAMSﬁtting,we subtracted statistically the contribution due to theﬁeld stars in the CMDs of the C-region using the CMDs of the F-region.The size of the bin used for the subtraction is∆V=0.25and∆(B−V)=0.1.The resulting CMDs are displayed in Fig.14.We used the metallicity of[Fe/H]=–0.31as derived before and adopted Y=ing this method we have obtaineda value of the apparent distance modulus(m−M)V=13.1±0.2.Finally we calculate a mean value of the two estimates,(m−M)V=13.3±0.2.Adopting the extinction law of A V=3.2E(B−V),we derive a value of the intrinsic distance modulus(m−M)0=12.7±0.2.This corresponds to a distance of d=3.5±0.3kpc.4.5AgeWe have estimated the age of NGC2192using two methods as follows.First we have used the morphological age index. From the value ofδV derived above,0.6±0.2mag,we obtain a value for the age,MAI=1.1±0.2Gyrs.Secondly we have estimated the age of the cluster using the theoretical isochrones given by the Padova group(Bertelli et al.1994). Fitting the isochrones for[Fe/H]=–0.31to the CMDs of NGC2192,as shown in Fig.15,we estimate the age to be 1.1±0.1Gyrs.Both results agree very well.4.6Luminosity FunctionWe have derived the V luminosity functions of the main sequence stars in NGC2192,which are displayed in Fig.16.The F-region was used for subtraction of theﬁeld star contribution from the C-region.The luminosity function of the C-region in Fig.16(a)increases rapidly up to V≈14 mag,and stays almostﬂat for V>15mag.The luminosity function of the N-region is steeper than that of the C-region. Fig.16(b)displays a comparison of the luminosity functions of NGC1798,NGC2192,and NGC7789which is another old open cluster of similar age(Roger et al.1994).Fig.16(b) shows that the luminosity functions of these clusters are similar in that they are almostﬂat in the faint part.The ﬂattening of the faint part of the luminosity functions of old open clusters has been known since long,and is believed to be due to evaporation of low mass stars(Friel1995).5DISCUSSIONWe have determined the metallicity and distance of NGC 1798and NGC2192in this study.We compare them with those of other old open clusters here.Fig.17illustrates the radial metallicity gradient of the old open clusters com-piled by Friel(1995)and supplemented by the data in Wee&Lee(1996)and Lee(1997).Fig.17shows that thec 1998RAS,MNRAS000,1–8UBV I CCD photometry of two old open clusters NGC1798and NGC21925 mean metallicity decreases as the galactocentric distance in-creases.The positions of NGC1798and NGC2192we haveobtained in this study are consistent with the mean trendof the other old open clusters.The slope we have deter-mined for the entire sample including these two clusters is∆[Fe/H]/R GC=−0.086±0.011dex/kpc,very similar tothat given in Friel(1995),∆[Fe/H]/R GC=−0.091±0.014dex/kpc.There are only four old open clusters located beyondR GC=13kpc in Fig.17.These four clusters follow the meantrend of decreasing outward.However,the number of theclusters is not large enough to decide whether the metallictykeeps decreasing outward or it stops decreasing somewherebeyond R GC=13kpc and stays constant.Further studiesof more old open clusters beyond R GC=13kpc are neededto investigate this point.6SUMMARY AND CONCLUSIONSWe have presented UBV I photometry of old open clustersNGC1798and NGC2192.From the photometric data wehave determined the size,reddening,metallicity,distance,and age of these clusters.The luminosity functions of themain sequence stars in these clusters are similar to those ofthe other old open clusters.The basic properties of theseclusters we have determined in this study are summarizedin Table5.ACKNOWLEDGMENTSProf.Chul Hee Kim is thanked for providing the BV CCDimages of NGC1798.This research is supported in part bythe Korea Science and Engineering Foundation Grant No.95-0702-01-01-3.REFERENCESBertelli,G.,Bressan,A.,Chiosi,C.,Fagotto,F.,&Nasi,E.1994,A&AS,106,275Davis,L.E.,1994,A Reference Guide to the IRAF/DAOPHOTPackageFriel,E.D.1995,ARA&A,33,381Gratton,R.G.,1982,ApJ,257,640Janes,K.,&Phelps,R.L.1994,AJ,108,1773Landolt,A.U.,1992,AJ,104,340Lee,M.G.,1997,113,729Montgomery,K.A.,Marschall,L.A.,&Janes,K.A.1993,AJ,106,181Phelps,R.L.,Janes,K.,&Montgomery,K.A.,1994,AJ,107,1079Roger,C.M.,Paez,E.,Castellani,V.,&Staniero,O.1994,A&A,290,62Schmidt-Kaler,T.1982,in Landolt-Bornstein VI,2b(Berlin:Springer)Stetson,P.B.,1987,PASP,99,191VandenBerg,D.A.,&Poll,H.E.,1989,AJ,98,1451Wee,S.O.,&Lee,M.G.,1996,Jour.Korean Astro.Soc.,29,181This paper has been produced using the Royal AstronomicalSociety/Blackwell Science L A T E X styleﬁle.c 1998RAS,MNRAS000,1–86Hong Soo Park and Myung Gyoon LeeTable2.Transformation coeﬃcients for the standard stars.Date Color a k Z rms n(stars) 96.11.11V0.003–0.101–6.0400.00919(B−V) 1.090–0.155–0.4670.01317(U−B) 1.008–0.154–1.7110.03416 97.02.11V0.028–0.198–6.0500.00934(B−V) 1.150–0.118–0.5930.01035(U−B) 1.079–0.324–1.5750.03226(V−I)0.983–0.1300.3020.00829 97.02.13V–0.007–0.176–6.0050.01034(B−V) 1.160–0.133–0.5880.01334(U−B) 1.079–0.349–1.5260.02320(V−I)0.986–0.0970.2710.01532 97.03.17V-0.019–0.225–6.0680.01548(B−V) 1.221–0.093–0.7810.01844(U−B) 1.008–0.309–1.4580.02735(V−I)0.956–0.1570.3140.02052Table 3.UBV I photometry of the bright stars in the C-regionof NGC1798.ID X[px]Y[px]V(B−V)(U−B)(V−I) 1723.21110.815.8600.7790.3240.9143680.51092.015.380 1.3250.627 1.5254746.01160.315.9050.7410.2200.9545741.81165.514.380 1.4830.880 1.6336684.61030.115.8140.8640.342 1.0427745.31073.315.3760.9200.237 1.0849707.21038.814.777 1.4860.723 1.653 11549.41153.715.305 1.5290.915 1.666 12547.91162.714.846 1.6270.947 1.764 13602.31068.015.325 1.5240.847 1.660 14598.11080.815.776 1.3340.575 1.490 15525.81116.815.510 1.0020.346 1.169 18833.91144.214.976 1.4940.866 1.578 21981.91125.114.711 1.510 1.031 1.440 26835.71098.015.706 1.3180.468 1.407 27656.51022.115.653 1.4160.180 1.571 28659.8955.915.216 1.2160.384 1.385 29656.4976.813.6670.6610.3100.777 30674.2822.512.0330.4450.0500.532 33668.7966.315.687 1.3130.641 1.446 34764.3879.915.460 1.3370.508 1.408 38749.01008.115.359 1.3220.744 1.426 39774.4965.915.545 1.3040.590 1.402 43571.8930.612.875 1.970 1.264 2.252 45512.8908.715.810 1.3480.474 1.485 46642.1949.515.622 1.3290.590 1.477 48732.61211.315.821 1.3530.643 1.492 50678.81210.515.297 1.3680.770 1.501 51742.11244.414.7990.747-0.046 1.216 52673.11250.215.180 1.3060.780 1.457 56728.21183.415.665 1.4050.803 1.545 57614.91229.413.085 2.1770.635 3.581 62563.01338.415.9090.7060.6380.778 65913.91203.013.686 1.2490.851 1.354 67792.71314.215.6010.9750.470 1.275 68932.61268.414.4660.7170.1970.763 70801.11338.715.561 1.3270.785 1.442 72827.61315.513.5260.9670.521 1.161 78444.01094.814.605 1.5790.825 1.723 82684.3822.615.8280.9510.128 1.189 97598.51330.315.580 1.3360.710 1.483Table4.UBV I photometry of the bright stars in the C-region of NGC2192.ID X[px]Y[px]V(B−V)(U−B)(V−I) 4502.4879.614.9830.4320.1140.424 5537.5891.712.9690.9240.4750.930 7535.1931.315.1700.598-0.2010.483 9434.8947.613.6760.570-0.0560.648 10562.3991.914.037 1.0960.612 1.043 11412.9884.814.165 1.0780.608 1.072 12598.4778.715.1840.464-0.0300.477 13595.9930.014.4800.5020.1720.549 14625.8971.814.7430.7200.0890.741 16614.3684.214.3970.7660.1750.758 17463.3689.514.7660.4660.0120.480 18553.3710.715.4920.447-0.1350.428 19591.7723.814.4660.5450.0930.566 21623.0867.712.634 1.1020.713 1.108 22648.0929.015.3380.3940.1150.399 26461.1711.314.162 1.0860.670 1.091 29583.9802.315.0940.600-0.0160.644 32720.4889.515.3260.3700.0710.410 37395.9778.315.2640.3960.0310.379 38405.5778.514.8900.4810.1010.409 40258.21042.915.4310.4240.1200.484 42376.6883.915.1870.4550.1360.470 44180.1908.714.3200.2870.1120.295 47367.1938.314.8970.4030.2520.459 51183.3998.714.202 1.1140.552 1.108 55475.81052.514.6370.3880.1670.465 56389.11055.113.6060.6520.2560.777 58481.41074.114.3470.4500.1150.520 59514.91085.115.0970.4290.1370.517 60478.51089.614.2360.5280.1590.582 61498.51127.914.6090.5090.1350.578 63278.71154.414.372 1.0700.599 1.053 64527.41158.715.4180.4460.2450.510 65343.41167.814.266 1.0120.618 1.035 66362.21169.314.2660.8790.4690.879 74346.91039.814.5810.4520.1240.510 77688.91124.215.4200.3900.2900.400 83678.91079.715.4950.4640.1070.504 84624.21042.813.5010.3850.2170.389 88579.61028.914.8250.4560.1620.530 Table5.Basic properties of NGC1798and NGC2192.Parameter NGC1798NGC2192RA(2000)5h11m40s6h15m11sDEC(2000)47◦40′37′′39◦51′1′′l160◦.76173◦.41b4◦.8510◦.64Age1.4±0.2Gyrs1.1±0.1GyrsE(B−V)0.51±0.040.20±0.04[Fe/H]−0.47±0.15dex−0.31±0.15dex(m−M)013.1±0.212.7±0.2distance4.2±0.3kpc3.5±0.3kpcR GC12.5kpc11.9kpcz355pc646pcdiameter10.2pc(8′.3)7.5pc(7′.3)c 1998RAS,MNRAS000,1–8UBV I CCD photometry of two old open clusters NGC1798and NGC21927 Table1.Observing log for NGC1798and NGC2192.Date Target Filter Seeing Telescope Condition96.11.11NCC1798UBV2′′.3SAO a-61cm Photometric97.01.12NCC1798UBV I2′′.2SAO-61cm Non-photometric97.02.12NCC1798,NGC2192UBV I3′′.3SAO-61cm Photometric97.02.13NCC1798,NGC2192UBV I2′′.5SAO-61cm Non-photometric97.03.17NCC2192UBV I2′′.2SAO-61cm Photometric97.10.21NCC1798BV I2′′.3SAO-61cm Non-photometric97.10.24NCC2192BV I2′′.7SAO-61cm Non-photometric97.03.04NCC1798BV2′′.7VBO b-2.3m Non-photometrica Sobaeksan Astronomical Observatoryb Vainu Bappu Observatoryc 1998RAS,MNRAS000,1–8。

ubuntu11.10图形(图解)安装教程、基本设置,网络,设置软件源、硬件驱动、unity3d、g

U b u n t u11.10图形(图解)安装教程、基本设置,网络,设置软件源、硬件驱动、U n i t y3D、G n o m e3、U盘安装-CAL-FENGHAI.-(YICAI)-Company One1Ubuntu （Oneiric Ocelot ）图形（图解）安装教程、基本设置、网络设置、软件源、语言与输入法、硬件驱动、Unity 3D、Gnome3、Ubuntu文档、制作USB Live、U盘安装、软件安装、简介、下载目录一．准备安装系统 Ubuntu简介 Ubuntu正式支援的衍生版本包括介绍Ubuntu 以下特点Ubuntu的正式发音官方网站与文档获得Ubuntu发行版从镜像站点上下载ISO的镜像文件将ISO镜像文件制作成CD/DVD 硬盘分区方案二．光盘安装Ubuntu语言确认安装条件分区硬盘及格式化硬盘Ubuntu 安装程序提供了几个方案其他选项 (Something else)（手动分区：/、swap、/home）所在地区和国家键盘类型使用者资料及密码完成安装初次开机三．安装后系统设置设置网络有线网络无线网络拨号上网（PPPOE）设置软件源与升级安装语言套件 (Language Pack)输入法修正时区及时间硬件驱动Unity 3DGnome3窗口按钮改为右手（使用于Unity桌面）四．安装软件安装压缩工具flash插件Google Chrome浏览器QQmsnpdf运行Windows软件安装 rpm 软件包支持DVD播放Ubuntu下安装显卡驱动Nvidia显卡驱动的安装ATI显卡驱动的安装五．U盘安装Ubuntu Windows Linux Ubuntu一．准备安装Ubuntu 系统1．Ubuntu简介Ubuntu是一个以桌面应用为主的Linux操作系统，其名称来自非洲南部祖鲁语或豪萨语的“ubuntu”一词（译为吾帮托或乌班图），意思是“人性”、“我的存在是因为大家的存在”，是非洲传统的一种价值观，类似华人社会的“仁爱”思想。

k-on!_iilustration_archieves_2009-2012

k-on! iilustration archieves 2009-20121. 引言1.1 概述《K-ON!》是一部由秋元康创作的日本漫画作品，于2007年开始连载，并在2009年至2010年期间改编为同名电视动画。

该作以五位女高中生组成的乐队为主线，展现了她们在校园生活中的音乐努力和友情故事。

除了精彩的剧情外，这部作品还以其独特且精美的插图而受到广大读者的喜爱。

1.2 文章结构本文将分为五个章节来介绍《K-ON! Illustration Archives》这本插图收藏册。

首先，在第二章中，我们将对背景进行介绍，解释插图收藏的起源和发展，并分析其中一些具有重要影响力的作品。

接着，在第三章中，我们将详细讨论《K-ON! Illustration Archives》中各篇插图的扉页内容，并深入解读主要角色插图所传达出来的信息。

最后，在第四章中，我们会评价和分享日文版、英文版和中文版插图集带给我们不同的观赏体验，并提供相关订购信息及总结评价。

1.3 目的本文的目的是通过对《K-ON! Illustration Archives》的分析研究，探讨这本插图收藏册所展示的美术风格、角色形象以及其在粉丝心中的意义和价值。

此外，我们也将展望未来，对于即将推出的《K-ON!》剧场版插图收藏期待进行预测和探讨，希望通过本文能够进一步增加读者对于《K-ON!》作品的了解和欣赏程度。

2. 章节一:2.1 背景介绍在本章节中，将对K-ON!插图收藏的背景进行介绍。

首先，我们会细致地讲述K-ON！这部作品的背景和主题，以及它在2009年至2012年期间的影响力和流行程度。

此外，我们还将探讨该插图收藏项目所涉及到的相关行业和市场情况。

2.2 插图收藏的起源和发展本小节将重点探讨K-ON!插图收藏活动的起源和发展历程。

我们将回顾该项目创立的初衷以及关键人物对于插图收藏活动的推进、宣传和经营等方面所做出的贡献。

我们还会详细介绍相关活动、展览和商业合作等对于插图收藏活动发展起到重要作用的事件。

HullOFOD9eSolutionsCh13第九版期权、期货及其他衍生品课后答案

CHAPTER 13 Binomial TreesPractice QuestionsProblem 13.1.A stock price is currently $40. It is known that at the end of one month it will be either $42 or $38. The risk-free interest rate is 8% per annum with continuous compounding. What is the value of a one-month European call option with a strike price of $39?Consider a portfolio consisting of 1-: Call option +∆: SharesIf the stock price rises to $42, the portfolio is worth 423∆-. If the stock price falls to $38, it is worth 38∆. These are the same when42338∆-=∆ or 075∆=.. The value of the portfolio in one month is 28.5 for both stock prices. Its value today must be the present value of 28.5, or 0080083332852831e -.⨯..=.. This means that 402831f -+∆=.where f is the call price. Because 075∆=., the call price is 400752831$169⨯.-.=.. As an alternative approach, we can calculate the probability, p , of an up movement in a risk-neutral world. This must satisfy: 0080083334238(1)40p p e .⨯.+-= so that 00800833344038p e .⨯.=-or 05669p =.. The value of the option is then its expected payoff discounted at the risk-free rate: 008008333[305669004331]169e -.⨯.⨯.+⨯.=. or $1.69. This agrees with the previous calculation.Problem 13.2.Explain the no-arbitrage and risk-neutral valuation approaches to valuing a European option using a one-step binomial tree.In the no-arbitrage approach, we set up a riskless portfolio consisting of a position in the option and a position in the stock. By setting the return on the portfolio equal to the risk-free interest rate, we are able to value the option. When we use risk-neutral valuation, we first choose probabilities for the branches of the tree so that the expected return on the stock equals the risk-free interest rate. We then value the option by calculating its expected payoff and discounting this expected payoff at the risk-free interest rate.Problem 13.3.What is meant by the delta of a stock option?The delta of a stock option measures the sensitivity of the option price to the price of the stock when small changes are considered. Specifically, it is the ratio of the change in theprice of the stock option to the change in the price of the underlying stock.Problem 13.4.A stock price is currently $50. It is known that at the end of six months it will be either $45 or $55. The risk-free interest rate is 10% per annum with continuous compounding. What is the value of a six-month European put option with a strike price of $50?Consider a portfolio consisting of 1-: Put option +∆: SharesIf the stock price rises to $55, this is worth 55∆. If the stock price falls to $45, the portfolio is worth 455∆-. These are the same when 45555∆-=∆or 050∆=-.. The value of the portfolio in six months is 275-. for both stock prices. Its value today must be the present value of 275-., or 010********e -.⨯.-.=-.. This means that 502616f -+∆=-.where f is the put price. Because 050∆=-., the put price is $1.16. As an alternative approach we can calculate the probability, p , of an up movement in a risk-neutral world. This must satisfy: 01055545(1)50p p e .⨯.+-= so that 010*******p e .⨯.=-or 07564p =.. The value of the option is then its expected payoff discounted at the risk-free rate: 0105[007564502436]116e -.⨯.⨯.+⨯.=. or $1.16. This agrees with the previous calculation.Problem 13.5.A stock price is currently $100. Over each of the next two six-month periods it is expected to go up by 10% or down by 10%. The risk-free interest rate is 8% per annum with continuous compounding. What is the value of a one-year European call option with a strike price of $100?In this case 110u =., 090d =., 05t ∆=., and 008r =., so that0080509007041110090e p .⨯.-.==..-.The tree for stock price movements is shown in Figure S13.1. We can work back from the end of the tree to the beginning, as indicated in the diagram, to give the value of the option as $9.61. The option value can also be calculated directly from equation (13.10): 22200805[0704121207041029590029590]961e -⨯.⨯..⨯+⨯.⨯.⨯+.⨯=. or $9.61.Figure S13.1: Tree for Problem 13.5Problem 13.6.For the situation considered in Problem 13.5, what is the value of a one-year European put option with a strike price of $100? Verify that the European call and European put prices satisfy put –call parity.Figure S13.2 shows how we can value the put option using the same tree as in Problem 13.5. The value of the option is $1.92. The option value can also be calculated directly from equation (13.10): 20080522[0704102070410295910295919]192e -⨯.⨯..⨯+⨯.⨯.⨯+.⨯=.or $1.92. The stock price plus the put price is 10019210192$+.=.. The present value of the strike price plus the call price is 008110096110192e $-.⨯+.=.. These are the same, verifyingthat put –call parity holds.Figure S13.2: Tree for Problem 13.6Problem 13.7.What are the formulas for u and d in terms of volatility?u e =and d e -=Problem 13.8.Consider the situation in which stock price movements during the life of a European option are governed by a two-step binomial tree. Explain why it is not possible to set up a position in the stock and the option that remains riskless for the whole of the life of the option.The riskless portfolio consists of a short position in the option and a long position in ∆ shares. Because ∆ changes during the life of the option, this riskless portfolio must also change.Problem 13.9.A stock price is currently $50. It is known that at the end of two months it will be either $53 or $48. The risk-free interest rate is 10% per annum with continuous compounding. What is the value of a two-month European call option with a strikeprice of $49? Use no-arbitrage arguments.At the end of two months the value of the option will be either $4 (if the stock price is $53) or $0 (if the stock price is $48). Consider a portfolio consisting of:shares1option+∆:-:The value of the portfolio is either 48∆ or 534∆- in two months. If48534∆=∆- i.e.,08∆=. the value of the portfolio is certain to be 38.4. For this value of ∆ the portfolio is therefore riskless. The current value of the portfolio is: 0850f .⨯-where f is the value of the option. Since the portfolio must earn the risk-free rate of interest010212(0850)384f e .⨯/.⨯-=.i.e.,223f =.The value of the option is therefore $2.23.This can also be calculated directly from equations (13.2) and (13.3). 106u =., 096d =. so that01021209605681106096e p .⨯/-.==..-. and010212056814223f e -.⨯/=⨯.⨯=.Problem 13.10.A stock price is currently $80. It is known that at the end of four months it will be either $75or $85. The risk-free interest rate is 5% per annum with continuous compounding. What is the value of a four-month European put option with a strike price of $80? Use no-arbitrage arguments.At the end of four months the value of the option will be either $5 (if the stock price is $75) or $0 (if the stock price is $85). Consider a portfolio consisting of:shares1option-∆:+:(Note: The delta, ∆ of a put option is negative. We have constructed the portfolio so that it is +1 option and -∆ shares rather than 1- option and +∆ shares so that the initial investment is positive.)The value of the portfolio is either 85-∆ or 755-∆+ in four months. If 85755-∆=-∆+ i.e.,05∆=-. the value of the portfolio is certain to be 42.5. For this value of ∆ the portfolio is therefore riskless. The current value of the portfolio is: 0580f .⨯+where f is the value of the option. Since the portfolio is riskless005412(0580)425f e .⨯/.⨯+=.i.e.,180f =.The value of the option is therefore $1.80.This can also be calculated directly from equations (13.2) and (13.3). 10625u =., 09375d =. so that00541209375063451062509375e p .⨯/-.==..-. 103655p -=. and005412036555180f e -.⨯/=⨯.⨯=.Problem 13.11.A stock price is currently $40. It is known that at the end of three months it will be either $45 or $35. The risk-free rate of interest with quarterly compounding is 8% per annum. Calculate the value of a three-month European put option on the stock with an exercise price of $40. Verify that no-arbitrage arguments and risk-neutral valuation arguments give the same answers.At the end of three months the value of the option is either $5 (if the stock price is $35) or $0 (if the stock price is $45).Consider a portfolio consisting of:shares1option-∆:+:(Note: The delta, ∆, of a put option is negative. We have constructed the portfolio so that it is +1 option and -∆ shares rather than 1- option and +∆ shares so that the initial investment is positive.)The value of the portfolio is either 355-∆+ or 45-∆. If:35545-∆+=-∆i.e.,05∆=-.the value of the portfolio is certain to be 22.5. For this value of ∆ the portfolio is therefore riskless. The current value of the portfolio is 40f -∆+where f is the value of the option. Since the portfolio must earn the risk-free rate of interest (4005)102225f ⨯.+⨯.=. Hence 206f =. i.e., the value of the option is $2.06.This can also be calculated using risk-neutral valuation. Suppose that p is the probability of an upward stock price movement in a risk-neutral world. We must have 4535(1)40102p p +-=⨯. i.e., 1058p =. or: 058p =.The expected value of the option in a risk-neutral world is:00585042210⨯.+⨯.=. This has a present value of210206102.=..This is consistent with the no-arbitrage answer.Problem 13.12.A stock price is currently $50. Over each of the next two three-month periods it is expected to go up by 6% or down by 5%. The risk-free interest rate is 5% per annum with continuous compounding. What is the value of a six-month European call option with a strike price of $51?A tree describing the behavior of the stock price is shown in Figure S13.3. The risk-neutral probability of an up move, p , is given by00531209505689106095e p .⨯/-.==..-. There is a payoff from the option of 561851518.-=. for the highest final node (which corresponds to two up moves) zero in all other cases. The value of the option is therefore 2005612518056891635e -.⨯/.⨯.⨯=.This can also be calculated by working back through the tree as indicated in Figure S13.3. The value of the call option is the lower number at each node in the figure.Figure S13.3:Tree for Problem 13.12Problem 13.13.For the situation considered in Problem 13.12, what is the value of a six-month European put option with a strike price of $51? Verify that the European call and European put prices satisfy put–call parity. If the put option were American, would it ever be optimal to exercise it early at any of the nodes on the tree?The tree for valuing the put option is shown in Figure S13.4. We get a payoff of-.=.if -.=.if the middle final node is reached and a payoff of 51451255875 515035065the lowest final node is reached. The value of the option is therefore2005612.⨯⨯.⨯.+.⨯.=.(06520568904311587504311)1376e-.⨯/This can also be calculated by working back through the tree as indicated in Figure S13.4. The value of the put plus the stock price is.+=.137********The value of the call plus the present value of the strike price is005612e-.⨯/.+=.16355151376This verifies that put–call parity holdsTo test whether it worth exercising the option early we compare the value calculated for the option at each node with the payoff from immediate exercise. At node C the payoff from-.=.. Because this is greater than 2.8664, the option should immediate exercise is 5147535be exercised at this node. The option should not be exercised at either node A or node B.Figure S13.4:Tree for Problem 13.13Problem 13.14.A stock price is currently $25. It is known that at the end of two months it will be either $23 or $27. The risk-free interest rate is 10% per annum with continuous compounding. Suppose T S is the stock price at the end of two months. What is the value of a derivative that pays off2T S at this time?At the end of two months the value of the derivative will be either 529 (if the stock price is 23) or 729 (if the stock price is 27). Consider a portfolio consisting of:shares1derivative+∆:-:The value of the portfolio is either 27729∆- or 23529∆- in two months. If2772923529∆-=∆- i.e.,50∆= the value of the portfolio is certain to be 621. For this value of ∆ the portfolio is therefore riskless. The current value of the portfolio is: 5025f ⨯-where f is the value of the derivative. Since the portfolio must earn the risk-free rate of interest 010212(5025)621f e .⨯/⨯-= i.e., 6393f =. The value of the option is therefore $639.3.This can also be calculated directly from equations (13.2) and (13.3). 108u =., 092d =. so that01021209206050108092e p .⨯/-.==..-. and 010212(0605072903950529)6393f e -.⨯/=.⨯+.⨯=.Problem 13.15.Calculate u , d , and p when a binomial tree is constructed to value an option on a foreign currency. The tree step size is one month, the domestic interest rate is 5% per annum, the foreign interest rate is 8% per annum, and the volatility is 12% per annum.In this case (005008)11209975a e .-.⨯/==.010352u e .==.109660d u =/=.0997509660045531035209660p .-.==..-.Problem 13.16.The volatility of a non-dividend-paying stock whose price is $78, is 30%. The risk-free rate is 3% per annum (continuously compounded) for all maturities. Calculate values for u, d, and p when a two-month time step is used. What is the value of a four-month European call option with a strike price of $80 given by a two-step binomial tree. Suppose a trader sells 1,000 options (10 contracts). What position in the stock is necessary to hedge the trader’s position at the time of the trade?4898.08847.01303.18847.08847.0/11303.112/230.01667.030.0=--=====⨯⨯e p u d e uThe tree is given in Figure S13.5. The value of the option is $4.67. The initial delta is 9.58/(88.16 – 69.01) which is almost exactly 0.5 so that 500 shares should be purchased.Figure S13.5: Tree for Problem 13.16Problem 13.17.A stock index is currently 1,500. Its volatility is 18%. The risk-free rate is 4% per annum (continuously compounded) for all maturities and the dividend yield on the index is 2.5%. Calculate values for u, d, and p when a six-month time step is used. What is the value a 12-month American put option with a strike price of 1,480 given by a two-step binomial tree.4977.08805.01357.18805.08805.0/11357.15.0)025.004.0(5.018.0=--=====⨯-⨯e p u d e uThe tree is shown in Figure S13.6. The option is exercised at the lower node at the six-month point. It is worth 78.41.Figure S13.6: Tree for Problem 13.17Problem 13.18.The futures price of a commodity is $90. Use a three-step tree to value (a) a nine-month American call option with strike price $93 and (b) a nine-month American put option with strike price $93. The volatility is 28% and the risk-free rate (all maturities) is 3% with continuous compounding.4651.08694.01503.18694.018694.0/11503.125.028.0=--=====⨯u u d e u The tree for valuing the call is in Figure S13.7a and that for valuing the put is in Figure S13.7b. The values are 7.94 and 10.88, respectively.824637Figure S13.7a : CallFigure S13.7b : PutFurther QuestionsProblem 13.19.The current price of a non-dividend-paying biotech stock is $140 with a volatility of 25%. The risk-free rate is 4%. For a three-month time step: (a) What is the percentage up movement? (b) What is the percentage down movement?(c) What is the probability of an up movement in a risk-neutral world? (d) What is the probability of a down movement in a risk-neutral world?Use a two-step tree to value a six-month European call option and a six-month European put option. In both cases the strike price is $150.(a) 25.025.0⨯=e u = 1.1331. The percentage up movement is 13.31% (b) d = 1/u = 0.8825. The percentage down movement is 11.75%(c) The probability of an up movement is 5089.0)8825.1331.1/()8825.()25.004.0=--⨯e (d) The probability of a down movement is0.4911.The tree for valuing the call is in Figure S13.8a and that for valuing the put is in Figure S13.8b. The values are 7.56 and 14.58, respectively.Figure S13.8a : CallFigure S13.8b : PutProblem 13.20.In Problem 13.19, suppose that a trader sells 10,000 European call options. How many shares of the stock are needed to hedge the position for the first and second three-month period? For the second time period, consider both the case where the stock price moves up during the first period and the case where it moves down during the first period.The delta for the first period is 15/(158.64 – 123.55) = 0.4273. The trader should take a long position in 4,273 shares. If there is an up movement the delta for the second period is 29.76/(179.76 – 140) = 0.7485. The trader should increase the holding to 7,485 shares. If there is a down movement the trader should decrease the holding to zero.Problem 13.21.A stock price is currently $50. It is known that at the end of six months it will be either $60 or $42. The risk-free rate of interest with continuous compounding is 12% per annum. Calculate the value of a six-month European call option on the stock with an exercise price of $48. Verify that no-arbitrage arguments and risk-neutral valuation arguments give the same answers.At the end of six months the value of the option will be either $12 (if the stock price is $60) or $0 (if the stock price is $42). Consider a portfolio consisting of:shares1option+∆:-:The value of the portfolio is either 42∆ or 6012∆- in six months. If426012∆=∆- i.e.,06667∆=. the value of the portfolio is certain to be 28. For this value of ∆ the portfolio is therefore riskless. The current value of the portfolio is: 0666750f .⨯-where f is the value of the option. Since the portfolio must earn the risk-free rate of interest01205(0666750)28f e .⨯..⨯-=i.e.,696f =.The value of the option is therefore $6.96.This can also be calculated using risk-neutral valuation. Suppose that p is the probability of an upward stock price movement in a risk-neutral world. We must have 0066042(1)50p p e .+-=⨯ i.e., 181109p =. or: 06161p =.The expected value of the option in a risk-neutral world is:120616100383973932⨯.+⨯.=. This has a present value of 00673932696e -..=.Hence the above answer is consistent with risk-neutral valuation.Problem 13.22.A stock price is currently $40. Over each of the next two three-month periods it is expected to go up by 10% or down by 10%. The risk-free interest rate is 12% per annum with continuous compounding.a. What is the value of a six-month European put option with a strike price of $42?b. What is the value of a six-month American put option with a strike price of $42?a. A tree describing the behavior of the stock price is shown in Figure S13.9. The risk-neutral probability of an up move, p , is given by012312090065231109e p .⨯/-.==..-.Calculating the expected payoff and discounting, we obtain the value of the option as 2012612[24206523034779603477]2118e -.⨯/.⨯⨯.⨯.+.⨯.=.The value of the European option is 2.118. This can also be calculated by working back through the tree as shown in Figure S13.9. The second number at each node is the value of the European option.b. The value of the American option is shown as the third number at each node on the tree. It is 2.537. This is greater than the value of the European option because it is optimal to exercise early at node C.40.0002.1182.53744.000 0.8100.81036.0004.7596.00048.4000.0000.00039.6002.4002.40032.4009.6009.600ABCFigure S13.9: Tree to evaluate European and American put options in Problem 13.22. At each node, upper number is the stock price, the next number is the European put price, and the final number is the American put priceProblem 13.23.Using a “trial -and-error” approach, estimate how high the strike price has to be in Problem 13.17 for it to be optimal to exercise the option immediately.Trial and error shows that immediate early exercise is optimal when the strike price is above 43.2. This can be also shown to be true algebraically. Suppose the strike price increases by a relatively small amount q . This increases the value of being at node C by q and the value of being at node B by 0030347703374e q q -..=.. It therefore increases the value of being at node A by003(065230337403477)0551q q e q -..⨯.+.=.For early exercise at node A we require 253705512q q .+.<+ or 1196q >.. This corresponds to the strike price being greater than 43.196.Problem 13.24.A stock price is currently $30. During each two-month period for the next four months it is expected to increase by 8% or reduce by 10%. The risk-free interest rate is 5%. Use a two-step tree to calculate the value of a derivative that pays off 2[max(300)]T S -, whereT S is the stock price in four months? If the derivative is American-style, should it be exercised early?This type of option is known as a power option. A tree describing the behavior of the stock price is shown in Figure S13.10. The risk-neutral probability of an up move, p , is given by005212090602010809e p .⨯/-.==..-. Calculating the expected payoff and discounting, we obtain the value of the option as393.5]3980.049.323980.06020.027056.0[12/405.02=⨯+⨯⨯⨯⨯-eThe value of the European option is 5.393. This can also be calculated by working back through the tree as shown in Figure S13.10. The second number at each node is the value of the European option. Early exercise at node C would give 9.0 which is less than 13.2435. The option should therefore not be exercised early if it is American.Figure S13.10: Tree to evaluate European power option in Problem 13.24. At each node, upper number is the stock price and the next number is the option priceProblem 13.25.Consider a European call option on a non-dividend-paying stock where the stock price is $40, the strike price is $40, the risk-free rate is 4% per annum, the volatility is 30% per annum, and the time to maturity is six months.a. Calculate u , d , and p for a two step treeb. Value the option using a two step tree.c. Verify that DerivaGem gives the same answerd. Use DerivaGem to value the option with 5, 50, 100, and 500 time steps.0.0000 29.1600 0.705624.3000 32.4900 F(a) This problem is based on the material in Section 13.8. In this case 025t ∆=.so that03011618u e .==., 108607d u =/=., and00402508607049591161808607e p .⨯.-.==..-.(b) and (c) The value of the option using a two-step tree as given by DerivaGem is shown in Figure S13.11 to be 3.3739. To use DerivaGem choose the first worksheet, select Equity as the underlying type, and select Binomial European as the Option Type. After carrying out the calculations select Display Tree.(d) With 5, 50, 100, and 500 time steps the value of the option is 3.9229, 3.7394, 3.7478, and 3.7545, respectively.Figure S13.11: Tree produced by DerivaGem to evaluate European option in Problem 13.25Problem 13.26.Repeat Problem 13.25 for an American put option on a futures contract. The strike price and the futures price are $50, the risk-free rate is 10%, the time to maturity is six months, and the volatility is 40% per annum.(a) In this case 025t ∆=.and 04012214u e .==., 108187d u =/=., and0102508187045021221408187e p .⨯.-.==..-.(b) and (c) The value of the option using a two-step tree is 4.8604.(d) With 5, 50, 100, and 500 time steps the value of the option is 5.6858, 5.3869, 5.3981, and 5.4072, respectively.Problem 13.27.Footnote 1 shows that the correct discount rate to use for the real world expected payoff inAt each node:Upper v alue = Underlying Asset PriceLower v alue = Option Price Values in red are a result of early exercise.Strike price = 40Discount factor per step = 0.9900Time step, dt = 0.2500 years, 91.25 daysGrowth factor per step, a = 1.0101Probability of up mov e, p = 0.4959Up step size, u = 1.16180.00000.25000.5000the case of the call option considered in Figure 13.1 is 42.6%. Show that if the option is a put rather than a call the discount rate is –52.5%. Explain why the two real-world discount rates are so different.The value of the put option is012312.⨯+.⨯=.(065230034773)10123e-.⨯/The expected payoff in the real world is.⨯+.⨯=.(070410029593)08877The discount rate R that should be used in the real world is therefore given by solving025.=.1012308877Re-.-.or 52.5%.The solution to this is 0525The underlying stock has positive systematic risk because it expected return is higher than the risk free rate. This means that the stock will tend to do well when the market does well. The call option has a high positive systematic risk because it tends to do very well when the market does well. As a result a high discount rate is appropriate for its expected payoff. The put option is in the opposite position. It tends to provide a high return when the market does badly. As a result it is appropriate to use a highly negative discount rate for its expected payoff.Problem 13.28.A stock index is currently 990, the risk-free rate is 5%, and the dividend yield on theindex is 2%. Use a three-step tree to value an 18-month American put option with astrike price of 1,000 when the volatility is 20% per annum. How much does the option holder gain by being able to exercise early? When is the gain made?The tree is shown in Figure S13.12. The value of the option is 87.51. It is optimal to exercise at the lowest node at time one year. If early exercise were not possible the value at this node would be 236.63. The gain made at the one year point is therefore 253.90 – 236.63= 17.27.Figure 13.12: Tree for Problem 13.28Problem 13.29.Calculate the value of nine-month American call option on a foreign currency using athree-step binomial tree. The current exchange rate is 0.79 and the strike price is 0.80 (both expressed as dollars per unit of the foreign currency). The volatility of the exchange rate is 12% per annum. The domestic and foreign risk-free rates are 2%and 5%, respectively. Suppose a company has bought options on 1 million units of the foreign currency. What position in the foreign currency is initially necessary to hedge its risk?The tree is shown in Figure S13.13. The cost of an American option to buy one million units of the foreign currency is $18,100. The delta initially is (0.0346 −0.0051)/(0.8261 – 0.7554) = 0.4176. The company should sell 417,600 units of the foreign currencyFigure S13.13: Tree for Problem 13.29。

实验1_安装与配置Ubuntu

实验1 安装与配置Ubuntu Linux实验目标1．掌握安装Ubuntu Desktop的详细步骤；2．掌握配置Ubuntu Desktop系统基本参数的详细步骤；实验准备ubuntu_12.10_desktop_x86.iso实验步骤任务1：安装前准备工作1．Ubuntu简介Ubuntu是一个以桌面应用为主的Linux操作系统，其名称来自非洲南部祖鲁语或豪萨语的“ubuntu”一词（译为吾帮托或乌班图），意思是“人性”、“我的存在是因为大家的存在”，是非洲传统的一种价值观，类似华人社会的“仁爱”思想。

Ubuntu 是一个社区开发的基于Debian GNU/Linux的操作系统，适合笔记本、桌面计算机和服务器使用。

它包含了所有您需要的应用程序——网页浏览器、幻灯片演示、文档编辑和点子表格软件，即时通讯软件等等。

2004年10月，Ubuntu 的第一个版本正式发布。

此后 Ubuntu 每六个月发布一个新版本，用户可以免费升级到最新版本。

Ubuntu 鼓励用户及时地升级到新版本，以便享用最新的功能和软件。

Ubuntu 的命名遵从“Y.MM (开发代号)”格式，Y 代表年份，MM 代表月份。

在括号里的名字是预发布版时确定的开发代号。

每一个普通版本都将被支持 18 个月，长期支持版(Long Term Support, LTS)的桌面版本支持 3 年，服务器版本则是 5 年。

（1）Ubuntu正式支援的衍生版本包括：1、Kubuntu：使用和Ubuntu一样的软件库，但不采用GNOME，而使用更为美观的KDE为其预定桌面环境。

2、Edubuntu：是Ubuntu的教育发行版。

这是为了使教育工作者可以在短于一小时的时间内设计电脑教室，或建立网上学习环境，并且可即时控制该环境而不用在家学习而创作的。

3、Xubuntu：属于轻量级的发行版，使用Xfce4作为桌面环境，与Ubuntu采用一样的软件库。

4、Ubuntu Server Edition：其提供了服务器的应用程序，如一个电邮服务器、一个LAMP网页服务器平台、DNS设定工具、档案服务器与数据库管理。

清新明朗绿色PTT模板1

Add Title • Description of the contents
Click to edit title style
Text in here
Text in here
Text in here
Text in here
Title ThemeGallery is a Design Digital Content & Contents mall developed by Guild Design Inc.
• Description of the contents
Add Title • Description of the contents
• Description of the contents
Add Title • Description of the contents
• Description of the contents
Click to edit title style
ThemeGallery is a Design Digital Content & Contents mall developed by Guild Design Inc.
Text in here
▪ Description of the business ▪ Description of the business ▪ Description of the business • Description of the contents • Description of the contents
Click to edit title style
Please write down of a slogan for a vision of a Vision 01

DS_da280

MEMS digital output motion sensor low-power high performance 3-axes “DSC-XYZ” accelerometerKey Features•Supply voltage, 1.62V to 3.6V •For 2x2x1.1 mm LGA-12 package •User selectable range, ±2g, ±4g, ±8g, ±16g •User selectable data output rate •Digital I 2C/SPI output interface •14 bit resolution •Low power consumption •2 Programmable interrupt generators with independent function for motion detection •Free-fall detection •Embedded self-test function •Factory programmable offset and sensitivity • RoHS compliantApplications•User interface for mobile phone and PMP •Display orientation •Gesture recognition •Active/inactive monitoring •Free-fall detection •Double/ Click recognition •Power management •Vibration monitoring •Inclination and tilt sensing •PedometerProduct OverviewThe da280 sensor is a low power high performance capacitive three-axis linear accelerometer developed by micro-machined technology. The device is available in a 2x2x1.1mm land grid array (LGA) and it is guaranteed to operate over an extended temperature range from -40°C to +85°C. The sensor element is fabricated by single crystal silicon with DRIE process and is protected by hermetically sealed silicon cap from the environment. The device features user selectable full scale of ±2g/ ±4g/ ±8g/ ±16g measurement range with data output rate from 1Hz to 1 kHz with signal condition, temperature compensation, self-test, motion detection imbedded. The da280 has a self-test mode for user to check the functioning of the sensor and a power-down mode that makes it good for handset power management. Two independent and flexible interrupts provided greatly simplify the algorithm for various motion status detections. Standard I2C and SPI interfaces are used to communicate with the chip.Content1 Block diagram and pin description (9)1.1 Block diagram (9)1.2 Pin description (9)2 Mechanical and electrical specifications (11)2.1 Mechanical characteristics (11)2.2 Electrical characteristics (12)2.3 Absolute maximum ratings (13)3 Communication interface (14)3.1 Communication interface Electrical specification (14)3.1.1 SPI Electrical specification (14)3.1.2 I2C Electrical specification (15)3.2 Digital interface operation (16)3.2.1 SPI Operation (16)3.2.2 I2C Operation (18)4 Terminology and functionality (20)4.1 Terminology (20)4.1.1 Sensitivity (20)4.1.2 Zero-g level (20)4.2 Functionality (21)4.2.1 Power mode (21)4.2.2 Sensor data (21)4.2.3 Self-test (21)4.2.4 Factory calibration (22)4.3 Interrupt controller (22)4.3.1 General features (22)4.3.2 Mapping (23)4.3.3 Electrical behavior (INT1/INT2 to open-drive or push-pull) (24)4.3.4 New data interrupt (24)4.3.5 Active detection (24)4.3.6 Tap detection (24)4.3.7 Orientation recognition (26)4.3.8 Freefall interrupt (27)5 Application hints (29)6 Register mapping (30)7 Registers description (32)7.1 SOFT_RESET (00H) (32)7.2 CHIPID (01h) (32)7.3 ACC_X_LSB (02H), ACC_X_MSB (03H) (32)7.4 ACC_Y_LSB (04H), ACC_Y_MSB (05H) (32)7.5 ACC_Z_LSB (06H), ACC_Z_MSB (07H) (33)7.6 MOTION_FLAG (09H) (33)7.7 NEWDATA_FLAG (0AH) (34)7.8 TAP_ACTIVE_STATUS (0BH) (34)7.9 ORIENT_STATUS (0CH) (35)7.10 RESOLUTION_RANGE (0FH) (35)7.11 ODR_AXIS (10H) (35)7.12 MODE_BW (11H) (36)7.13 SWAP_POLARITY (12H) (37)7.14 INT_SET1 (16H) (37)7.15 INT_SET2 (17H) (38)7.16 INT_MAP1 (19H) (38)7.17 INT_MAP2 (1AH) (38)7.18 INT_MAP3 (1BH) (39)7.19 INT_CONFIG (20H) (39)7.20 INT_LTACH (21H) (40)7.21 FREEFALL_DUR (22H) (40)7.22 FREEFALL_THS (23H) (41)7.23 FREEFALL_HYST (24H) (41)7.24 ACTIVE_DUR (27H) (41)7.25 ACTIVE_THS (28H) (42)7.26 TAP_DUR (2AH) (42)7.27 TAP_THS (2BH) (42)7.28 ORIENT_HYST (2CH) (43)7.29 Z_BLOCK (2DH) (43)7.30 SELF_TEST (32H) (44)7.31 CUSTOM_OFF_X (38H) (44)7.32 CUSTOM_OFF_Y (39H) (44)7.33 CUSTOM_OFF_Z (39H) (45)7.34 CUSTOM_FLAG (4EH) (45)7.35 CUSTOM_CODE (4FH) (45)7.36 Z_ROT_HODE_TM (51H) (45)7.37 Z_ROT_DUR (52H) (46)7.38 ROT_TH_H (53H) (46)7.39 ROT_TH_L (54H) (46)8 Package information (47)8.1 Outline dimensions (47)8.2 Tape and reel specification (47)9 Revision history (49)List of tablesTable 1.Pin description (10)Table 2.Mechanical characteristic (11)Table 3.Electrical characteristics (12)Table 4.Absolute maximum ratings (13)Table 5.Electrical specification of the SPI interface pins (14)Table 6.Electrical specification of the I2C interface pins (15)Table 7.Mapping of the interface pins (16)Table 8.W1 and W0 settings (17)Table 9.I2C Address (18)Table 10.SAD+Read/Write patterns (18)Table 11.Transfer when master is writing one byte to slave (18)Table 12.Transfer when master is writing multiple bytes to slave (18)Table 13.Transfer when master is receiving (reading) one byte of data from slave (19)Table 14.Transfer when master is receiving (reading) multiple bytes of data from slave (19)Table 15.Self-test difference values (22)Table 16.Interrupt mode selection (22)Table 17.meaning of ‘orient’ bits in symmetric mode (26)Table 18.meaning of ‘orient’ bits in high-asymmetric mode (26)Table 19.meaning of ‘orient’ bits in low-asymmetric mode (27)Table 20.blocking conditions for orientation recognition (27)Table 21.Register address map (30)Table 22. SOFT_RESET register (32)Table 23. I2C Configuration description (32)Table 24. CHIPID register (32)Table 25.ACC_X_LSB register (32)Table 26.ACC_X_MSB register (32)Table 27.ACC_Y_LSB register (33)Table 28.ACC_Y_MSB register (33)Table 29.ACC_Z_LSB register (33)Table 30.ACC_Z_MSB register (33)Table 31.MOTION_FLAG register (33)Table 32.MOTION_FLAG register description (33)Table 33.NEWDATA_FLAG register (34)Table 34.NEWDATA_FLAG register description (34)Table 35.TAP_ACTIVE_STATUS register (34)Table 36.TAP_ACTIVE_STATUS register description (34)Table 37.ORIENT_STATUS register (35)Table 38.ORIENT_STATUS register description (35)Table 39.RESOLUTION_RANGE register (35)Table 40.RESOLUTION_RANGE register description (35)Table 41.ODR_AXIS register (35)Table 42.ODR_AXIS register description (36)Table 44.MODE_BW register description (36)Table 45.SWAP_POLARITY register (37)Table 46.SWAP_POLARITY register description (37)Table 47.INT_SET1 register (37)Table 48.INT_SET1 register description (37)Table 49.INT_SET2 register (38)Table 50.INT_SET2 register description (38)Table 51.INT_MAP1 register (38)Table 52.INT_MAP1 register description (38)Table 53.INT_MAP2 register (38)Table 54.INT_MAP2 register description (39)Table 55.INT_MAP3 register (39)Table 56.INT_MAP3 register description (39)Table 57.INT_CONFIG register (39)Table 58.INT_CONFIG register description (39)Table 59.INT_LTACH register (40)Table 60.INT_LTACH register description (40)Table 61.FREEFALL_DUR register (40)Table 62.FREEFALL_DUR register description (40)Table 63.FREEFALL_THS register (41)Table 64.FREEFALL_THS register description (41)Table 65.FREEFALL_HYST register (41)Table 66.FREEFALL_HYST register description (41)Table 67.ACTIVE_DUR register (41)Table 68.ACTIVE_DUR register description (41)Table 69.ACTIVE_THS register (42)Table 70.ACTIVE_THS register description (42)Table 71.TAP_DUR register (42)Table 72.TAP_DUR register description (42)Table 73.TAP_THS register (42)Table 74.TAP_THS register description (43)Table 75.ORIENT_HYST register (43)Table 76.ORIENT_HYST register description (43)Table 77.Z_BLOCK register (43)Table 78.Z_BLOCK register description (43)Table 79.SELF_TEST register (44)Table 80.SELF_TEST register description (44)Table 81.CUSTOM_OFF_X register (44)Table 82.CUSTOM_OFF_X register description (44)Table 83.CUSTOM_OFF_Y register (44)Table 84.CUSTOM_OFF_Y register description (44)Table 85.CUSTOM_OFF_Z register (45)Table 86.CUSTOM_OFF_Z register description (45)Table 88.CUSTOM_FLAG register description (45)Table 89.CUSTOM_CODE register (45)Table 90.CUSTOM_CODE register description (45)Table 91.Z_ROT_HODE_TM register (45)Table 92.Z_ROT_HODE_TM register description (46)Table 93.Z_ROT_DUR register (46)Table 94.Z_ROT_DUR register description (46)Table 95.ROT_TH_H register (46)Table 96.ROT_TH_H register description (46)Table 97.ROT_TH_L register (46)Table 98.ROT_TH_L register description (46)Table 99.Document revision history (49)List of figuresFigure 1 Block Diagram (9)Figure 2 Pin description (9)Figure 3 SPI slave timing diagram (14)Figure 4 I2C Slave timing diagram (15)Figure 5 Instruction Phase Bit Field (16)Figure 6 MSB First and LSB First Instruction and Data Phases (17)Figure 7 I2C Protocol (18)Figure 8 power mode (21)Figure 9 Interrupt mode (23)Figure 10 Timing of tap detection (25)Figure 11 Definition of vector components (26)Figure 12 da280 I2C electrical connection (29)Figure 13 12 Pin LGA Mechanical data and package dimensions (47)Figure 14 Tape and reel dimension in mm (48)1 Block diagram and pin description1.1 Block diagramCSB SDIOSCLKSDOPS INT1INT2GNDIOFigure 1 Block Diagram1.2 Pin descriptionFigure 2 Pin description2Mechanical and electrical specifications2.1Mechanical characteristicsVdd = 2.5 V, T = 25 °C unless otherwise noted (a)a. The product is factory calibrated at 2.5 V. The operational power supply range is from 1.62V to 3.6 V.Table 2.Mechanical characteristicSymbol Parameter Test conditions Min Type Max UnitFS Measurement range FS bit set to 00±2 g FS bit set to 01 ±4 g FS bit set to 10 ±8 g FS bit set to 11 ±16 gSo Sensitivity FS bit set to 00 4096 LSB/g FS bit set to 01 2048 LSB/g FS bit set to 10 1024 LSB/g FS bit set to 11 512 LSB/gTCSo Sensitivity change vs.temperatureFS bit set to 00 0.01 %/°CTyoff Typical zero-g level offsetaccuracy70 mgTcoff Zero-g level change vs.temperatureMax delta from 25°C ±0.6 mg/°CAn Acceleration noise density FS bit set to 00,Normal Mode,ODR = 1000Hz150 200 ug/sqrt(Hz)Vst Self-test output change X: FS bit set to 00 400 mg Y: FS bit set to 00 400 mg Z: FS bit set to 00 400 mgTop Operation temperature range -40 85 °C2.2Electrical characteristicsVdd = 2.5 V, T = 25 °C unless otherwise notedTable 3.Electrical characteristicsSymbol Parameter Test conditions Min Typ. Max Unit Vdd Supply voltage 1.62 2.5 3.6 V Vdd_IO I/O Pins supply voltage 1.62 3.6 VIdd current consumption innormal modeTop=25℃,ODR=1kHz220 uAIdd_lp current consumption in lowpower modeTop=25℃,ODR=62.5Hz,BW=500Hz40 uAIdd_sm current consumption insuspend modeTop=25℃ 1 uAVIH Digital high level inputvoltageSPI&I2C 0.7*Vdd_IO VVIL Digital low level inputvoltageSPI&I2C 0.3*Vdd_IO VVOH high level output voltage 0.9*Vdd_IO V VOL Low level output voltage 0.1*Vdd_IO V BW System bandwidth 1.95 500 Hz ODR Output data rate 1 1000 Hz Wake-uptimetwu From stand-by 1 ms Start-uptimetsu From power off 3 ms PSRR Power Supply Rejection Rate Top=25℃20 mg/V2.3Absolute maximum ratingsStresses above those listed as “absolute maximum ratings” may cause permanent damage to the device. This is a stress rating only and functional operation of the device under these conditions is not implied. Exposure to maximum rating conditions for extended periods may affect device reliability.Table 4.Absolute maximum ratingsParameter Test conditions Min Max Unit Storage Temperature -45 125 ℃Supply Voltage Supply pins -0.3 4.25 VSupply Voltage Logic pins -0.3 Vdd_IO+0.3 VESD Rating HMB,R=1.5k,C=100pF ±2 kV Mechanical Shock Duration<200us 10,000 gNote: Supply voltage on any pin should never exceed 4.25VThis is a mechanical shock sensitive device, improper handling can cause permanent damages to the part.This is an ESD sensitive device, improper handling can cause permanent damages to the part.3Communication interface3.1Communication interface Electrical specification3.1.1SPI Electrical specificationTable 5.Electrical specification of the SPI interface pinsSymbol Parameter Condition Min Max Unit fsclk Clock frequency Max load on SDIO or SDO = 25pF 10 MHz tsclk_l SLCK low pulse 20tsclk_h SLCK high pulse 20Tsdi_setup SDI setup time 20 ns Tsdi_hold SDI hold time 20 nsTsdo_od SDO/SDI output delay Load = 25pF 30 ns Load = 250pF 40 nsTcsb_setup CSB setup time 20 ns Tcsb_hold CSB hold time 40 nsThe figure below shows the definition of the SPI timing given in Table5:Figure 3 SPI slave timing diagram3.1.2I2C Electrical specificationTable 6.Electrical specification of the I2C interface pinsSymbol Parameter Min Max Unitfscl Clock frequency 400 kHztscl_l SCL low pulse 1.3 ustscl_h SCL high pulse 0.6 us Tsda_setup SDA setup time 0.1 us Tsda_hold SDA hold time 0.0 ustsusta Setup Time for a repeated start condition 0.6 usthdsta Hold time for a start condition 0.6 ustsusto Setup Time for a stop condition 0.6 ustbuf Time before a new transmission can start 1.3 us The figure below shows the definition of the I2C timing given in Table 6:Figure 4 I2C Slave timing diagram3.2Digital interface operationThe da280 supports two serial digital interface protocols for communications as slave with a host device: SPI and I2C. The active interface is selected by the state of the pin PS, 0 selects SPI and 1 selects I2C. By default, SPI operates in 3-wire mode and it can be re-configured by writing 1 to bit ‘SDO_active’ to work in 4-wire mode. Both interfaces share the same pins. The mapping for each interface is given in the following table:Table 7.Mapping of the interface pinsPIN name I2C SPISCL/SCLK Serial clock Serial clockSDA/SDI Serial Data Data input (4-wire mode).Data input/output (3-wire mode)SDO Used to set LSB of I2C address Data output (4-wire mode)CSB Unused Chip select3.2.1SPI OperationThe falling edge of CSB, in conjunction with the rising edge of SCLK, determines the start of framing. Once the beginning of the frame has been determined, timing is straightforward. The first phase of the transfer is the instruction phase, which consists of 16 bits followed by data that can be of variable lengths in multiples of 8 bits. If the device is configured with CSB tied low, framing begins with the first rising edge of SCLK.The instruction phase is the first 16 bits transmitted. As shown in Figure5, the instruction phase is divided into a number of bit fields.Figure 5 Instruction Phase Bit FieldThe first bit in the stream is the read/write indicator bit (R/W). When this bit is high, a read is being requested, otherwise indicates it is a write operation.W1 and W0 represent the number of data bytes to transfer for either read or write (Table8). If the number of bytes to transfer is three or less (00, 01, or 10), CSB can stall high on byte boundaries. Stalling on a non-byte boundary terminates the communications cycle. If these bits are 11, data can be transferred until CSB transitions high. CSB is not allowed to stall during the streaming process.The remaining 13 bits represent the starting address of the data sent. If more than one word is being sent, sequential addressing is used, starting with the one specified, and it either increments (LSB first) or decrements (MSB first) basedon the mode setting.Table 8.W1 and W0 settingsW1:W0 Action CSB stalling00 1 byte of data can be transferred. Optional01 2 bytes of data can be transferred. Optional10 3 bytes of data can be transferred. OptionalNo11 4 or more bytes of data can be transferred. CSB must be heldlow for entire sequence; otherwise, the cycle is terminated.Data follows the instruction phase. The amount of data sent is determined by the word length (Bit W0 and Bit W1). This can be one or more bytes of data. All data is composed of 8-bit words.Data can be sent in either MSB-first mode or LSB-first mode (by setting ‘LSB_first’ bit). On power up, MSB-first mode is the default. This can be changed by programming the configuration register. In MSB-first mode, the serial exchange starts with the highest-order bit and ends with the LSB. In LSB-first mode, the order is reversed. (Figure6)Figure 6 MSB First and LSB First Instruction and Data PhasesRegister bit ‘SDO_active’ is responsible for activating SDO on devices. If this bit is cleared, then SDO is inactive and read data is routed to the SDIO pin. If this bit is set, read data is placed on the SDO pin. The default for this bit is low, making SDO inactive.3.2.2I2C OperationI2C bus uses SCL and SDA as signal lines. Both lines are connected to VDDIO externally via pull-up resistors so that they are pulled high when the bus is free. The I2C device address of da280 is shown below. The LSB bit of the 7bits device address is configured via SA0pin.Table 9.I2C AddressSAD6 SAD5 SAD4 SAD3 SAD2 SAD1 SAD0 W/R0 1 0 0 1 1 SAO 0/1Table 10.SAD+Read/Write patternsCommand SAD[6:1] SAD[0]=SA0 R/W SAD+R/W Read 010011 0 1 01001101(4dh)Write 010011 0 0 01001100(4ch)Read 010011 1 1 01001111(4fh)Write 010011 1 0 01001110(4eh)The I2C interface protocol has special bus signal conditions. Start (S), stop (P) and binary data conditions are shown below. At start condition, SCL is high and SDA has a falling edge. Then the slave address is sent. After the 7 address bits, the direction control bit R/W selects the read or write operation. When a slave device recognizes that it is being addressed, it should acknowledge by pulling SDA low in the ninth SCL (ACK) cycle.At stop condition, SCL is also high, but SDA has a rising edge. Data must be held stable at SDA when SCL is high. Data can change value at SDA only when SCL is low.Figure 7 I2C Protocol4Terminology and functionality4.1Terminology4.1.1SensitivitySensitivity describes the gain of the sensor and can be determined e.g. by applying 1 g acceleration to it. As the sensor can measure DC accelerations this can be done easily by pointing the axis of interest towards the center of the earth, noting the output value, rotating the sensor by 180 degrees (pointing to the sky) and noting the output value again. By doing so, ±1 g acceleration is applied to the sensor. Subtract the larger output value from the smaller one, and dividing the result by 2, leads to the actual sensitivity of the sensor. This value changes very little over temperature and also time. The sensitivity tolerance describes the range of sensitivities of a large population of sensors.4.1.2Zero-g levelZero-g level offset (TyOff) describes the deviation of an actual output signal from the ideal output signal if no acceleration is present. A sensor in a steady state on a horizontal surface measure 0 g in X axis and 0 g in Y axis whereas the Z axis measure 1 g. The output is ideally in the middle of the dynamic range of the sensor (content of output data registers are 00h, data expressed as 2’s complement number). A deviation from ideal value in this case is called Zero-g offset. Offset is to some extent a result of stress to MEMS sensor and therefore the offset can slightly change after mounting the sensor onto a printed circuit board or exposing it to extensive mechanical stress. Offset changes little over temperature; see “Zero-g level change vs. temperature”. The Zero-g level tolerance (TyOff) describes the standard deviation of the range of Zero-g levels of a population of sensors.4.2Functionality4.2.1Power modeThe da280 has three different power modes. Besides normal mode, which represents the fully operational state of the device, there are two special energy saving modes: low-power mode and suspend mode.Figure 8 power modeIn normal mode, all parts of the electronic circuit are held powered-up and data acquisition is performed continuously. In suspend mode, the whole analog part, including the oscillator, Ana LDO, Dig LDO and Drive Buffer are all powered down, no data acquisition is performed and the only supported operation is to read/write the registers. Suspend mode is entered by writing ‘11’ or ‘10’ to the (0x11) ‘pwr_mode’ bits.In low power mode, the device is periodically switching between a sleep phase and a wake-up phase. The wake-up phase essentially corresponding to operation in normal mode with complete power-up of the circuitry. During the sleep phase the analog part except the oscillator is powered down.During the wake-up phase, if a enabled interrupt is detected, the device stays in the wake-up phase as long as the interrupt condition endures (non-latched interrupt), or until the latch time expires (temporary interrupt), or until the interrupt is reset (latched interrupt). If no interrupt detected, the device enters the sleep phase.4.2.2Sensor dataThe width of acceleration data is 14bits given in two’s complement representation. The 14bits for each axis are split into an MSB part (one byte containing bits 13 to 6) and an LSB lower part (one byte containing bits 5 to 0)4.2.3Self-testThis feature permits to check the sensor functionality by applying electrostatic forces to the sensor core instead of external accelerations. By actually deflecting the seismic mass, the entire signal path of the sensor can be tested. Activating the self-test results in a static offset of the acceleration data; any external acceleration or gravitational forceapplied to the sensor during active self-test will be observed in the output as a superposition of both acceleration and self-test signal.The self-test is activated individually for each axis by writing 1 to the (0x32) ‘self_test_en’ bit. It is possible to control the direction of the deflection though bit ‘self_test_sign’ for each axis. The excitation occurs in positive (negative) direction if ‘self_test_sign’ = ‘0b’ (‘1b’).In order to ensure a proper interpretation of the self-test signal it is recommended to perform the self-test for both directions and then to calculate the difference of the resulting acceleration values. Table15 show the difference for each axis.Table 15.Self-test difference valuesX-axis signal Y-axis signal Z-axis signalResulting difference value +0.4g +0.4g +0.4g4.2.4Factory calibrationThe IC is factory calibrated for sensitivity (So) and Zero-g level (TyOff). The trimming values are stored inside the chip’s nonvolatile memory. The trimming parameters are loaded to registers while da280 reset (POR or software reset). This allows using the device without further calibration.4.3Interrupt controllerInterrupt engines are integrated in the da280. Each interrupt can be independently enabled and configured. If the condition of an enabled interrupt is fulfilled, the corresponding status bit is set to 1 and the selected interrupt pin is activated. There are two interrupt pins, INT1 and INT2; interrupts can be freely mapped to any of these two pins. The pin state is a logic ‘or’ combination of all mapped interrupts.4.3.1General featuresAn interrupt is cleared depending on the selected interrupt mode, which is common to all interrupts. There are three different interrupt modes: non-latched, latched and temporary. The mode is selected by the ‘latch_int’ bits according to table16.Table 16.Interrupt mode selectionlatch_int Interrupt mode0000 non-latched0001 temporary latched 250ms0010 temporary latched 500ms0011 temporary latched 1s0100 temporary latched 2s0101 temporary latched 4s0110 temporary latched 8s0111 latched1000 non-latched1001 temporary latched 1ms1010 temporary latched 1ms1011 temporary latched 2ms1100 temporary latched 25ms1101 temporary latched 50ms1110 temporary latched 100ms1111 latchedAn interrupt is generated if its activation condition is met. It can’t be cleared as long as the activation condition is fulfilled. In the non-latched mode the interrupt status bit and the selected pin (INT1 or INT2) are cleared as soon as the activation condition is no more valid. Exceptions to this behavior are the new data and orientation, which are automatically reset after a fixed time.In the latched mode an asserted interrupt status and the selected pin are cleared by writing 1 to (0x21) ‘reset_int’ bit. If the activation condition still holds when it is cleared, the interrupt status is asserted again with the next change of the acceleration registers.In the temporary mode an asserted interrupt and selected pin are cleared after a defined period of time. The behavior of the different interrupt modes is shown in figure 9.Figure 9 Interrupt mode4.3.2MappingThe mapping of interrupts to the interrupt pins is done by registers ‘INT_MAP_x’ (0x19 0x1a and 0x1b), setting int1_inttype (e.g. int1_freefall) to 1 can map this type of interrupt to INT1 pin and setting int2_inttyp to 1 can map this type interrupt to INT2 pin.4.3.3Electrical behavior (INT1/INT2 to open-drive or push-pull)Both interrupt pins can be configured to show desired electrical behavior. The active level for each pin is set by register bit int1_lvl (int2_lvl), if int1_lvl (int2_lvl) = 0 (1), then the pin INT1 (INT2) is 0 (1) active.Also the electric type of the interrupt pin can be selected. By setting int1_od (int2_od) = 1 (0), the interrupt pin output type can be set to be open-drive (push-pull).4.3.4New data interruptThis interrupt serves for synchronous reading of acceleration data. It is generated after an acceleration data was calculated. The interrupt is cleared automatically before the next acceleration data is ready.4.3.5Active detectionActive detection uses the slope between successive acceleration signals to detect changes in motion. An interrupt is generated when the slope (absolute value of acceleration difference) exceeds a preset threshold. The threshold is set with the value of register ‘active_th’ with the LSB corresponding to 16 LSB of acceleration data, that is 3.9mg in 2g-range, 7.8mg in 4g-range, 15.6mg in 8g-range and 31.3mg in 16g-range. And the maximum value is 1g in 2g-range, 2g in 4g-range, 4g in 8g-range and 8g in 16g-range.The time difference between the successive acceleration signals depends is fixed to 1ms.Active detection can be enabled (disabled) for each axis separately by writing ‘1’ to bits ‘active_int_en_x/y/z’. The active interrupt is generated if the slope of any of the enabled axes exceeds the threshold for [‘active_dur’+1] consecutive times. As soon as the slopes of all enabled axes fall below this threshold for [‘active_dur’+1] consecutive times, the interrupt is cleared unless the interrupt signal is latched.The interrupt status is stored in the (0x09) ‘active_int’ bit. The (0x0b) bit ‘active_first_x/y/z’ records which axis triggered the active interrupt first and the sign of this acceleration data that triggered the interrupt is recorded in the (0x0b) bit ‘active_sign’.4.3.6Tap detectionTap detection has a functional similarity with a common laptop touch-pad or clicking keys of a computer mouse. A tap event is detected if a pre-defined pattern of the acceleration slope is fulfilled at least for one axis. Two different tap events are distinguished: A single tap is a single event within a certain time, followed by a certain quiet time. A double tap consist a first such event followed by a second event within a defined time.Single tap interrupt is enabled by writing 1 to the (0x16) ‘s_tap_int_en’ bit and double tap interrupt is enabled by writing 1 to the (0x16) ‘d_tap_int_en’ bit. The status of the single tap interrupt is stored in the (0x09) ‘s_tap_int’ bit and the status of the double tap interrupt is stored in the (0x09) ‘d_tap_int’ bit.The slope threshold for detecting a tap event is set by the (0x2b) “tap_th” bits with the LSB corresponding to 256LSB。

p81

A Virtual Network Mapping Algorithm based on SubgraphIsomorphism DetectionJens Lischka,Holger KarlPaderborn Center for Parallel ComputingPaderborn University33102Paderborn,Germanyjeli@mail.uni-paderborn.de,holger.karl@mail.uni-paderborn.deABSTRACTAssigning the resources of a virtual network to the compo-nents of a physical network,called Virtual Network Map-ping,plays a central role in network virtualization.Existing approaches use classical heuristics like simulated annealing or attempt a two stage solution by solving the node map-ping in aﬁrst stage and doing the link mapping in a second stage.The contribution of this paper is a Virtual Network Map-ping(VNM)algorithm based on subgraph isomorphism de-tection:it maps nodes and links during the same stage.Our experimental evaluations show that this method results in better mappings and is faster than the two stage approach, especially for large virtual networks with high resource con-sumption which are hard to map.Categories and Subject DescriptorsC2.5[Computer-Communication Networks]:Local and Wide-Area Networks;G.1.6[Numerical Analysis]:Opti-mizationGeneral TermsAlgorithmsKeywordsVirtual Network Mapping;Network Embedding;Resource Allocation;Subgraph Isomorphism Detection;Network Vir-tualization1.INTRODUCTIONVirtualization is a well investigated research area in com-puter science.One of its initial purposes is to run multiple diﬀerent applications(e.g.servers,operating systems)upon the same shared physical work Virtualization has become more and more important over the last years. It is used for example for network simulation[10,1,8]or to Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for proﬁt or commercial advantage and that copies bear this notice and the full citation on theﬁrst page.To copy otherwise,to republish,to post on servers or to redistribute to lists,requires prior speciﬁc permission and/or a fee.VISA’09,August17,2009,Barcelona,Spain.Copyright2009ACM978-1-60558-595-6/09/08...$10.00.provide customized end-to-end services over the same phys-ical network[6,14].Virtual Network Mapping(VNM)plays a central role in building a virtual network(VN).During this mapping pro-cess each node of the VN is assigned to a node of the physi-cal network(PN)and each virtual link is assigned to a path orﬂow in the PN,such that a set of previously deﬁned con-straints(e.g.topology constraints,data rate,CPU capacity) is satisﬁed.The main objective in solving the Virtual Network Map-ping Problem(VNMP)is to make eﬃcient use of the un-derlying resources,while still satisfying the set of previously deﬁned mapping constraints.In addition,a VNMP Algo-rithm should be able to handle dynamicly arriving online requests and also oﬀer admission control,since some VN requests must be rejected or postponed to avoid violation of resource guarantees for already existing virtual networks [15].Several eﬃcient VNMP heuristics solving diﬀerent vari-ants of the VNMP have been proposed in the past years[11, 17,13,5,9,15].Some try to solve the problem considering data rate constraints[5,9]while others restrict the search space by only solving the link embedding,since they as-sume that the node mapping is known in advance[13].Ref.[11]describes a simulated annealing approach to map VNs onto the Emulab[4]infrastructure,and Ref.[15]presents a two stage mapping algorithm,handling the node mapping in aﬁrst stage and doing the link mapping in a second stage, based on shortest path and multi commodityﬂow detection. In contrast to existing approaches,in this paper we pro-pose a backtracking algorithm based on a subgraph isomor-phism search method[2]that maps nodes and links during the same stage.The advantage of this single stage approach is that link mapping constraints are taken into account at each step of the mapping.When a bad mapping decision is detected it can be revised by simply backtracking to the last valid mapping decision,whereas the two stage approach has to remap all links which is very expensive in terms of run-time.Our experimental evaluations show that our subgraph isomorphism based method results in better mappings and is faster than the traditional two stage approach.The remainder of this paper is organized as follows.Sec-tion2introduces terms and deﬁnitions related to the VNMP we use throughout the rest of the paper.Section3then spec-iﬁes the vnmFlib algorithm,which is a modiﬁed version of the Vﬂib graph matching algorithm.Section4presents some experimental results and a performance comparison with a two stage VNM algorithm,Section5concludes the paper.5b 34453567757BCDEF c34456Ga8A34355bac 6743853411356715BCDEF 16G 0A34Residual GraphG G VPFigure 1:Example of virtual network mapping2.VN MAPPING MODEL AND PROBLEMFORMULATIONThe deﬁnitions presented in the following correspond to the problem formulation of [15].Definition 1(Network).A Network is given by a directed graph G =(N,L,C ),where N is a set of nodes and L a set of links.Each node or link e ∈N ∪L is associated with a set of constraints C (e )={C 1(e ),...,C m (e )}.Definition 2(Virtual Network Mapping (VNM)).A VNM of a virtual network G V =(N V ,L V ,C V )onto a physical network G P =(N P ,L P ,C P )is deﬁned as a map-ping of G V to a subset of G P such that each virtual node is mapped onto exactly one physical node and each virtual link is mapped onto a loopfree path in the physical network:M :G V −→(N P ,P P ),where P P denotes the subset of all loopfree paths in G P .M is called a valid VNM if all constraints of G V are sat-isﬁed and for each l V =(s V ,t V )∈L V there exists a path p (s P ,t P )∈P P with M (s V )=s P and M (t V )=t P .The VNM can be decomposed into node and link mapping as fol-lows:Node mapping :M N :N V −→N P Link mapping :M L :L V −→P PAs an example consider G V and G P of Figure 1.Each node is associated with a CPU-and each link with a data rate constraint.The nodes a,b,c are mapped onto A,B,E and the virtual links are mapped to the paths [A,D,E ],[B,A ]and [B,E ].The mapping is valid,since the capacity con-straints of the virtual network do not exceed the capacities of the physical network.To deﬁne the costs of a VNM we consider a constraint cost function cost i (M (G V ))for each constraint C i ∈C V .The costs of a VNM are given by the sum of the cost functions together with a tunable weight constant αi for each C i which allows to strike a balance between the diﬀerent constraint costs:Definition 3(Virtual Network Mapping Costs).Suppose a VN G V with constraints C V ={C V 1,...,C Vm },aPN G P with constraints C P ={C P 1,...,C Pm }and a VNMM (G V )of G V onto G P.The total costs of M (G V )are given bycost (M (G V))=n X i =1αi ·cost i (M (G V ))The deﬁnition of the constraint cost functions can vary anddepends on the character of the corresponding constraint.In case of additive constraint costs like data rate or delay the constraint cost function could look likecost i (M (G V ))=X l ∈L VC Vi (l )·length (M (l )).where M (l )is the path in G P to which the virtual link lis mapped and length (M (l ))is the length of the path.For multiplicative costs like error rate,the function would look likecost i (M (G V ))=1−X l ∈L V(C Vi (l ))length (M (l )).Consider the VNM of Figure 1.In addition to the con-straints C 1=CPU and C 2=data rate we examine an C 3=error rate of 0.1for each physical link.Further the costs are weighted equally with α1=α2=α3=1.The costs are cost 1(M (G V ))=8+7+6=21for the node mapping and sum to cost 2(M (G V ))=3·2+4·1+5·1=15for the data rate and cost 3(M (G V ))=1−(0.12+0.11+0.11)=0.79for the error rate.The total costs of the VNM are cost (M (G V )=36.79.To handle multiple dynamicly arriving mapping requests we next introduce the terms Virtual Network Request and Residual Graph .Definition 4(Virtual Network Request (VNR)).A VNR r i =(G V i ,a i ,l i )consists of a virtual network G Vi ,an arrival time a i and a life time l i .The arrival time is the time a VNR should be mapped onto a PN and life time denotes the time period a VN should last on the PN.Definition 5(Residual Graph).Given a physical Net-work G P ,a virtual network G V and a VNM of G V onto G P .We get the residual graph G P res of GPby subtracting the ca-pacities of each virtual node and link of G V from the capac-ities of the physical nodes and links of G P to which they are mapped.Again consider the mapping of Figure 1.Node a is mappedto node A and the residual CPU capacity is C P 1(A )−C V1(a )=0.The link [a,c ]is mapped to path [A,D,E ]which results in a residual capacity of 1for the links [A,D ]and [D,E ].3.THE ALGORITHMThe NP-complete Subgraph Isomorphism Detection prob-lem [7]can be reduced to the VNM problem by assigning asingle delay constraint of 1to each physical and virtual link.The delay constraint is satisﬁed if the delay of a physical path does not exceed the delay of the virtual link that is mapped to it.A VNM of G V onto G P maps each node n V ∈N V to a node n P ∈N P and each virtual link l V ∈L V to a path p in P P .To get a valid VNM the delay con-straint has to be satisﬁed.That means that each l V must be mapped onto a path of length ≤1and therefore the re-sulting VNM is a subgraph isomorphism of G V in G P sinceAlgorithm1vnmFlib(G V sub,M(G V sub),G V,G P) Require:a VN G V,a PN G P and a subgraph G V sub of G V 1:C=←genneigh(G V sub,G V,G P)2:for each(n V,n P)in C do3:if valid(M(G V sub),(n V,n P),G P)then4:create G V sub and M(G V sub)by adding(n V,n P)5:vnmFlib(G V sub,M(G V sub),G V,G P res)6:end if7:if G V sub==G V then8:return M(G V sub)9:end if10:end foreach virtual link is mapped to exactly one physical link. Thus it seems to be a promising approach to use a subgraph isomorphism detection algorithm to solve the VNM prob-lem.The vnmFlib algorithm(Algorithm1)described in this section is an extended version of the Vﬂib graph matching al-gorithm[2].The main diﬀerence of vnmFlib and Vﬂib is that vnmFlib allows the mapping of links to paths shorter than a predeﬁned distance value (in terms of hops),whereas Vﬂib is limited to link-on-link mappings.Note that if =1the VNM of a VN G V onto a PN G P generated by vnmFlib is also a subgraph isomorphism of G V in G P.Another dif-ference is that vnmFlib checks network constraints at each mapping step.The algorithm tries to build a valid VNM solution by suc-cessively adding nodes and links of G V to an initially empty subgraph G V sub of G V.During the mapping process the al-gorithm ensures that M(G V sub)is a valid VNM of G V sub onto G P.The algorithm terminates when G V sub fully covers G V and returns M(G V sub),which is a valid VNM of G V on G P.3.1An ExampleFigure2depicts the mapping process for the networks of Figure1with =2.In aﬁrst step a set C of node pairs (n V,n P)with n V∈N V and n P∈N P is generated by the genneigh()function(Algorithm1line1).The algorithm adds n V to G V sub and n P to M(G V sub)respectively(Figure 2(a)).Now the valid()function(line3)checks whether the resulting mapping M(G V sub)is valid.If so the nodes are added to G V sub and M(G V sub)and vnmFlib is called with the corresponding residual graph G P res and the new subgraphs G V sub and M(G V sub)(line5).Otherwise the termination con-dition is checked(line7)and if it fails the next node pair of C is examined.Since the valid()function returns true for our example,vnmFlib is called with the newly created subgraph and mapping.Again a vector of node pairs is generated and theﬁrst node pair(c,B)is added to G V sub and M(G V sub)(Figure2 (b)).Now for all virtual links connecting the newly added node c with G V sub a path in G P which satisﬁes all constraints has to be found and added to the mapping.For our example the only virtual link connecting node c with G V sub is[a,c] and the algorithm adds path[A,B]to the mapping,since it satisﬁes the data rate constraint.The mapping is valid and the algorithm proceeds with the generation of a new set of node pairs.Next the algorithm maps node b to node G.This time the valid function fails because there exists no path from G to AG V subBDGAbacCEFC={(a,A)}(a)aBDGAbacCEF(b)acBDGAbacCEFC={(b,G),(b,E)}(c)acbacbBDGAbacCEFC={(b,E)}(d)BDGAbacCEF(e)a cBDGAbacCEFC={(b,B),(b,G)}(f)a cbVsubM(G )C={(c,B),(c,E),(b,G),(b,B),(b,E)}C={(c,E),(b,G),(b,B),(b,E)}Figure2:vnmFlib mapping processin G P with suﬃcient data rate capacity(Figure2(c)).Thus the algorithm tries to map the next pair(b,E)and fails for the same reason(Figure2(d)).As there is no node pair left in C the algorithm checks the termination condition(line 7),fails,does a backtracking step to the last valid mapping (Figure2(b))and tries to map(c,E),which results in a valid mapping(Figure2(e)).Again the algorithm computes a set of node pairs and maps theﬁrst one(Figure2(f)).This time the mapping is valid and the algorithm returns it(line8)since G V sub fully covers G V and the termination check of line7succeeds. 3.2Algorithm DetailsIn the following we describe the two key functions of the vnmFlib algorithm,genneigh()and valid()in depth.Before we can describe the procedure in more detail,we have to introduce the node set F Gsub(G):Let G=(N,L)be a directed graph and G sub=(N sub,L sub)Figure3:Set of front nodes F Gsub (G)={B,C,D,E}of G sub relative to G and F G(G sub)={G,H,I,J}re-spectivelyAlgorithm2genneigh(G P,G V,G V sub,M(G V sub)) Require:G P,G V,G V sub,M(G V sub)1:if FG Vsub(G V)=∅then2:C=N V×N P3:else4:C=FG Vsub ×G P\M N(G V sub)5:end if6:optimize(C)7:sort(C)8:return(C)be a subgraph of G.The setF Gsub (G)=F in Gsub(G)∪F outG sub(G)withF in Gsub(G)={n i|(n i,n j)∈L∧(n j∈N sub∧n i∈N sub} andF outG sub(G)={n j|(n i,n j)∈L∧(n i∈N sub∧n j∈N sub)} is called the front of G sub in relation to G.Thus the front of G sub in relation to G is the set of all nodes in G sub that are adjacent to a link connecting G sub with G.As an example consider the graphs of Figure3with N sub= {A,B,C,D,E}.The set of links starting in G and end-ing in G sub are(H,D)and(H,C)and thus F in Gsub (G)={C,D}.All links from G sub to G are(D,I),(E,J),(B,G)and(C,G).Consequently F outG sub (G)consists of the nodesets{B,C,D,E}and F Gsub(G)={B,C,D,E}.3.2.1The genneigh()FunctionThe genneigh()function(Algorithm2)takes four graphs as its input arguments:a VN G V,a PN G P,a subgraph G V sub of G V and a VNM M(G V sub)of G V sub onto G P which can also be seen as a graph.In aﬁrst step the function generates the front of G V sub relative to G V and checks if it is empty. Again consider the example of Figure2.In the initial step ofthe vnmFlib algorithm G V sub is empty and thus FG Vsub (G V)is empty too.The algorithm computes the candidates set C as the cartesian product of all nodes in G V and all nodes in G P(line2).But as we can see in Figure2(a),C consists of only one node pair(a,A).The reduction of the node pairs is done in the optimize()function in line6.The function deletes all node pairs from C which do not satisfy the CPURule ConditionR-node True iﬀn P satisﬁes all constraints C V of n V R-pred True iﬀfor each predecessor n V p of n V in G V sub there exists a path of length≤ from thecorresponding node n P p in M(G V sub)to n P thatsatisﬁes all constraints C V of the virtual linksl=(n V p,n V)in G P.R-succ True iﬀfor each successor n V s of n V in G V sub there exists a path of length≤ from n P inM(G V sub)to the corresponding node n V s thatsatisﬁes all constraints C V l of the virtual linksl=(n V,n V s)in G P.Table1:Validity check conditions constraint.Since node a of G V needs8CPU units and only node A of G P can serve this request,all remaining node pairs are removed from C.Such optimizations can drastically reduce the search space of the algorithm and lead to better runtimes.Another optimization reducing the size of C is the restriction of the length of paths to which virtual links are mapped by the threshold.In the example of Figure2 is set to2and thus only paths with length≤2are allowed.As a consequence in Figure2(b)mapping b onto F is forbidden.A small -value can lead to better VNMs(in terms of map-ping costs as described in Section2)but could also increase the number of rejected VNs if it is chosen too restrictive.If =1,the algorithm tries toﬁnd a subgraph isomorphism of the VN in the PN.Such an isomorphism does often not exist,especially for larger VNs.In this case the vnmFlib algorithm would traverse the whole search tree which has worst case complexityΘ(|N P|!|N V|)[3].To avoid this we introduce an upper boundωon the number of mapping steps and force the algorithm to stop its search ifωis exceeded. Finding good andωvalues is part of the evaluation process and described in Section4.In a last step the node pairs are sorted.The sorting cri-terion depends on the constraint set of the networks.It is usually better to map expensive nodes prior to cheaper nodes.By expensive nodes we mean nodes with a high re-source consumption.For example the node a of the VN of Figure1has a CPU capacity of8and is thus more expensive than node b with capacity6.3.2.2The valid()FunctionThe valid()function checks if the addition of node pairs (n V,n P)to a valid VNM again results in a valid VNM.The necessary rules which have to be checked are listed in Table 1.Theﬁrst rule R-node checks whether any node constraints are violated.In the example of Figure1CPU capacity is chosen as the only node constraint.Consider the addition of node pair(b,C).For this case the R-node rule would fail since C cannot satisfy the CPU capacity of b(5<6)and valid()returns false.The remaining rules R-pred and R-succ check for broken connections.As an example consider the addition of(c,B) in Figure2(b).The set of predecessors of c in G V sub is just a and the corresponding node in M(G V sub)is A.Because there exists a path from A to B in G P with suﬃcient data rate and it is shorter than (length([A,B])=1≤2)the rule succeeds.The R-succ rule does the same for all successors50607080901000.00.20.40.60.81.0Threshold value ωR /C −R a t i on=80, beta=80n=80, beta=20n=70, beta=70n=70, beta=30n=60, beta=90n=60, beta=20Figure 4:R/C-Ratio in relation to ωvalue for dif-ferent n and βvalues.20406080100123456Threshold value ωS e c o n d sn=80, beta=80n=80, beta=20n=70, beta=70n=70, beta=30n=60, beta=90n=60, beta=20Figure 5:Runtime in relation to ωvalue for diﬀerent n and βvalues.respectively.All three conditions are checked beginning with the node rules.If one of the rules fails,valid()immediately stops and returns false,since the violation of one rule suﬃces to produce an invalid mapping.4.EXPERIMENTAL RESULTSIn this section we ﬁrst evaluate the runtime and outputquality of the vnmFlib algorithm for diﬀerent and ωvalues before we compare its performance to that of a two stage VNM algorithm [15].4.1Evaluation EnvironmentThe networks for our experimental evaluations are associ-ated with two Constraints C 1and C 2,where C 1(n )denotes the CPU-capacity of a node n and C 2(l )the data rate ca-pacity of a link l .The mapping costs (s.Section 2)are deﬁned by the constraint cost functions cost 1(M (G V ))=P n ∈N V C 1(n )and cost 2(M (G V))=P l ∈L V C 2(l )·length (M (l ))with α1=α2=1.To express the quality of a VNM we in-2468100.00.20.40.60.81.0Threshold value εR /C −R a t i on=10, beta=20n=10, beta=70n=20, beta=80n=40, beta=70n=60, beta=80n=80, beta=60Figure 6:R/C-Ratio in relation to value for diﬀer-ent n and βvalues.2468100123456Threshold value εS e c o n d sn=10, beta=20n=10, beta=70n=20, beta=80n=40, beta=70n=60, beta=80n=80, beta=60Figure 7:Runtime in relation to value for diﬀerent n and βvalues.troduce the R/C-Ratio (Revenue-to-Cost-Ratio)as the ratio of revenue to mapping costs R (G V )/cost (M (G V ))with the Revenue of a VN deﬁned asR (G V)=α1·X n ∈N VC 1(n )+α2·X l ∈L VC 2(l )If a VN cannot be mapped the R/C-Ratio is set to 0.Note that the R/C-Ratio takes on values between 0and 1,where 1is an optimal VNM.Network Setup.We used the GT-ITM tool [16]to generate the physical topologies.Like in [15]the physical networks are conﬁgured to have 100nodes and around 500links,a scale that corresponds to a medium-size ISP.The CPU constraints at nodes and the link data rates follow a uniform distribution from 0to 100units.The size n of a VN is expressed as the amount of its nodes:n =|N V |.Each pair of virtual nodes is randomly connected with probability 0.5.The CPU resources at nodes and the link data rates follow a uniform distribution from 0to βunits.For example,a βof 50means that the CPU or datarate constraint of a virtual node or link is set to maximal50 units.Thus VNs with largeβvalues are potentially harder to map than VNs with lowerβvalues.4.2Evaluation ResultsAll results are evaluated at a conﬁdence level of95percent. The conﬁdence intervals are not shown in theﬁgures because they got too small.4.3Determining proper andωvalues. Figures4and5depict the impact ofωon mapping qual-ity and runtime of vnmFlib for VNs of diﬀerent size andβvalues.One can see that the runtime converges fast and the R/C-Ratio reaches its maximum aroundω=n+10.Sinceour primary interest is mapping quality and overestimating does not increase the runtime too much we setω=4n for the rest of our experiments.Figures6and7depict the impact of on mapping quality and runtime.As in case of theωvalues the runtimes con-verge fast and thus an overestimation is not critical in this context.But overestimating of can decrease the R/C-Ratio as can be seen in Figure6.The R/C-Ratios for the n=10 VNs decline from over0.65for =1to around0.5for =2 but the eﬀect weakens for the n=20and n=40networks and dissapears for the n=60and n=80networks.Thus we chose two approaches for setting the value:A simple approach with constant =10and a more advanced ap-proach which tries toﬁnd a proper in the interval[1,10]. The advanced vnmFlib starts with =1.If it cannotﬁnd a valid VNM is increased by one and the algorithm continues with the mapping process.The algorithm stops either if it ﬁnds a valid VNM or if >10.4.4Single VNRs.We next compare runtimes and R/C-Ratios of simple vn-mFlib,advanced vnmFlib and the two stage approach(2stage) of Ref.[15]for virtual network requests(VNRs)of various size and variousβvalues.For the2stage algorithm we used the implementation of Ref.[12].Each VNR is mapped sep-arately onto a PN such that the total resources of the PN are available to this single VNR.Figures8and9depict runtimes for VNRs of size n= {10,20,30,40},β={30,90}and the corresponding R/C-Ratios.For the smallerβ=30value(solid lines)the run-times and R/C-Ratios of2stage(crosses)and simple vnm-Flib(squares)are nearly equal while the advanced vnmFlib approach(triangles)needs slightly more time but produces better R/C-Ratios especially for VNs of size n=10.For big-gerβvalues(dashed lines)the runtime of2stage increases strongly while the R/C-ratio decreases.This eﬀect strength-ens with growing network size.To map a VN of40nodes andβ=90the2stage approach takes nearly11seconds and produces a R/C-Ratio of0.15.The vnmFlib algorithm reacts much more stable on increasingβvalues and VN size (note that the runtimes of simple vnmFlib forβ=30and β=90overlap)and maps the same VNRs in about1second with a R/C-Ratio of0.3.The advanced vnmFlib reaches a R/C-Ratio of0.45in less than2seconds.For smaller VNs the R/C-Ratio of the advanced vnmFlib algorithm is nearly twice as good compared to the R/C-Ratios of sim-ple vnmFlib and2stage.Note that for n=10andβ=30 the advanced vnmFlib algorithm achieves a nearly optimal R/C-Ratio.10152025303540 02468112Size n of virtual networkSecondsvnmFlib simple, beta=30vnmFlib simple, beta=90vnmFlib advanced, beta=30vnmFlib advanced, beta=902stage, beta=302stage, beta=90Figure8:Runtimes of vnmFlib and2stage algo-rithms for VNs of diﬀerent size n andβvalues.10152025303540 0..2.4.6.81.Size n of virtual networkR/C−RatioFigure9:R/C-Ratios of vnmFlib and2stage algo-rithms for VNs of diﬀerent size n andβvalues.4.5Multiple VNRs and Path SplittingTo compare the performance of our algorithm with2stage for dynamicly arriving VNRs and mapping of multiple VNRs onto the same PN at the same time we implemented the environment of Ref.[15]as depicted in Figure12.The time axis is divided into a sequence of time windows of equal size t.At each time t the vnmFlib algorithm tries to map all virtual networks requests r i with arrival times a i≤t+ t.All requests with a i+l i>t are deleted and there resources on the PN released.Virtual Network Requests.In a VNR the number of nodes is randomly determined by a uniform distribution be-tween20and40following similar setups to previous work [17,15].Each pair of virtual nodes is randomly connected with probability0.5.The arrivals of the VNRs are modeled by a Poisson process with meanﬁve requests per time win-dow.The duration of the requests follows an exponential distribution with10time windows on average.Note that we used the same experiment setup as in Ref.010203040506020406080100Splitting Ratio (%)M i n u t e svnmFlib simple, beta=40vnmFlib simple, beta=80vnmFlib advanced, beta=40vnmFlib advanced, beta=802stage, beta=402stage, beta=80Figure 10:Runtime in relation to Splitting Ratio for vnmFlib and 2stage[15]but increased VN size.In Ref.[15]the sizes of the VNs vary between 2and 20nodes.We evaluated VN sizes between 20and 40nodes which seems to be a more realistic VN size.For the setup of the 2stage algorithm we had to adjust two parameters:1.T try which is the number of rounds in node remapping the algorithm does.Since our experiments showed that higher values do not improve the output qual-ity signiﬁcantly but increase the runtime we chose to set T try =0.These results are consistent with Ref.[15].2.Allow path migration or not.Since we are primarily interested in mapping quality and as shown by Ref.[15]path migration improves mapping quality we al-lowed path migration.Path Splitting.So far we have only considered the map-ping of virtual links onto physical links or paths.By path splitting we mean that a virtual link can also be split up and mapped onto a ﬂow of suﬃcient data rate.For a detailed discussion of path splitting see Ref.[15].Figures 10and 11show the runtimes and percentage of mapped revenue for diﬀerent β-values and splitting ratios.Splitting ratio denotes the percentage of VNRs that allow path splitting.By percentage of mapped revenue we mean the ratio of the total revenue of all VNRs to the revenue of all successfully mapped VNRs.Mapping multiple VNRs onto the same PN at the same time is a challenging task for a VNM algorithm.Here the vnmFlib algorithm beneﬁts from the high R/C-Ratios it achieves for the single mappings.Note that a high R/C-Ratio means that the physical resources consumed by a VNM are small.Thus if a VNM algorithm achieves higher R/C-Ratios he can map more VNRs onto the same PN at the same time.This results in fewer rejected VNRs and the algorithm obtains a higher revenue.This interrelation is reﬂected by Figure 11.For β=40(dashed lines)the simple vnmFlib approach (squares)achieves around 20percent more revenue for all splitting ratios than the 2stage algorithm (crosses).The10203040506020406080100Splitting Ratio (%)P e r c e n t a g e o f M a p p e d R e v e n ueFigure 11:Percentage of total revenue in relation to Splitting Ratio for vnmFlib and 2stageadvanced vnmFlib approach (triangles)is even better and achieves at least 35percent more revenue.For β=80(solid lines)simple vnmFlib performs around 40percent and ad-vanced vnmFlib around 50percent better than 2stage.This is due to the better R/C-Ratios of the VNMs produced by vnmFlib.As a consequence the VNMs of the vnmFlib al-gorithm need less resources of the PN than the VNMs pro-duced by 2stage.Thus the vnmFlib algorithm can map more VNRs onto the same PN at the same time and achieves a higher revenue.In addition to the higher revenue the vnmFlib algorithm is also faster than 2stage.For the β=40VNRs and 0percent splitting ratio it takes about 8minutes to map all VNRs with 2stage.This is due to the costly multi commodity ﬂow computations which take place in the link mapping stage of 2stage.The simple vnmFlib can map all requests in 57seconds and the advanced approach needs 90seconds.This eﬀect strengthens with increasing splitting ratio.For β=80VNRs and a splitting ratio of 60percent 2stage needs about 167minutes to map all VNRs while simple vnmFlib needs 2minutes and the advanced approach 6minutes.Figure 12:Evaluation environment for dynamicly arriving VNRs5.CONCLUSIONIn this paper we presented a virtual network mapping al-gorithm based on subgraph isomorphism detection which is able to handle multiple capacity constraints and dynamicly arriving online requests.We implemented a prototype and。

imfindcircles

imfindcircles发现采用圆形Hough变换圆展开所有页面句法∙中心= imfindcircles（A，半径）∙[中心，半径] = imfindcircles（A，radiusRange）∙[中心，半径，公制] = imfindcircles（A，radiusRange）的例子∙[中心，半径，公制] = imfindcircles（____，名称，值）的例子描述中心= imfindcircles（一，半径）发现图像中的圆圈一个，其半径约等于半径。

输出，中心，是包含一个两列的矩阵的x，y的圆的坐标上的图象在中心。

[ 中心，半径] = imfindcircles（一，radiusRange）发现与圆的半径由指定的范围radiusRange。

附加的输出的参数，半径，包含对应于每个圆心估计半径的中心。

例子[ 中心，半径，公制] = imfindcircles（一，radiusRange）也返回一个列向量，度量，包含累加器数组的峰值每个圆圈的大小（按降序排列）。

的各行的中心和半径对应的行度量。

例子[ 中心，半径，公制] = imfindcircles（____，名称，值）指定额外的选项与一个或多个名称，值对参数，使用任何以前的语法。

示例折叠所有检测最强的五圈中的图片检测图像中的明亮和黑眼圈输入参数折叠所有一个 -输入图像的灰度图像|真彩色图像|二值图像输入图像是在其中以检测圆形物体，指定为灰度，真彩，或二值图像的图像。

背包九讲完整版

背包问题九讲v1.0目录第一讲01背包问题第二讲完全背包问题第三讲多重背包问题第四讲混合三种背包问题第五讲二维费用的背包问题第六讲分组的背包问题第七讲有依赖的背包问题第八讲泛化物品第九讲背包问题问法的变化附：USACO中的背包问题前言本篇文章是我(dd_engi)正在进行中的一个雄心勃勃的写作计划的一部分，这个计划的内容是写作一份较为完善的NOIP难度的动态规划总结，名为《解动态规划题的基本思考方式》。

现在你看到的是这个写作计划最先发布的一部分。

背包问题是一个经典的动态规划模型。

它既简单形象容易理解，又在某种程度上能够揭示动态规划的本质，故不少教材都把它作为动态规划部分的第一道例题，我也将它放在我的写作计划的第一部分。

读本文最重要的是思考。

因为我的语言和写作方式向来不以易于理解为长，思路也偶有跳跃的地方，后面更有需要大量思考才能理解的比较抽象的内容。

更重要的是：不大量思考，绝对不可能学好动态规划这一信息学奥赛中最精致的部分。

你现在看到的是本文的1.0正式版。

我会长期维护这份文本，把大家的意见和建议融入其中，也会不断加入我在OI学习以及将来可能的ACM-ICPC的征程中得到的新的心得。

但目前本文还没有一个固定的发布页面，想了解本文是否有更新版本发布，可以在OIBH论坛中以“背包问题九讲”为关键字搜索贴子，每次比较重大的版本更新都会在这里发贴公布。

目录第一讲01背包问题这是最基本的背包问题，每个物品最多只能放一次。

第二讲完全背包问题第二个基本的背包问题模型，每种物品可以放无限多次。

第三讲多重背包问题每种物品有一个固定的次数上限。

第四讲混合三种背包问题将前面三种简单的问题叠加成较复杂的问题。

第五讲二维费用的背包问题一个简单的常见扩展。

第六讲分组的背包问题一种题目类型，也是一个有用的模型。

后两节的基础。

第七讲有依赖的背包问题另一种给物品的选取加上限制的方法。

第八讲泛化物品我自己关于背包问题的思考成果，有一点抽象。

1、下载文档前请自行甄别文档内容的完整性，平台不提供额外的编辑、内容补充、找答案等附加服务。
2、"仅部分预览"的文档,不可在线预览部分如存在完整性等问题,可反馈申请退款(可完整预览的文档不适用该条件!)。
3、如文档侵犯您的权益，请联系客服反馈,我们会尽快为您处理(人工客服工作时间：9:00-18:30)。

f ul l circl e K DE 4.0
P
.
P.
P.
P..
f ul l circl e
P.0
h t t p://w w w.k e r ne l.or g/
de b h t t p://ppa.l aunch pad.ne t/k ubunt u-
m e m be r s-k de4/ubunt u gut s y m ain
h t t ps://bl ue pr int s.l aunch pad.ne t /ubu nt u/h ar dy
h t t p://ope nge u.int il
h t t p://cdim age.ubunt /por t s/r e l e ase s/f e ist y/r e l e ase/
h t t p://w w w.t t-f or um s.ne t/ v ie w t opic.ph p?t
=3407h t t p://dow nl oad.t r ans por t t ycoon.ne t/f il e s/t t d-gr aph ics.r ar
m k dir t m p
cd t m p
w ge t h t t p://dow nl oad.t r ans por t t ycoo n.ne t/f il e s/t t d-gr aph ics.r ar
unr ar e t t d-gr aph ics.r ar
r m t t d-gr aph ics.r ar
s udo cp *
/us r/s h ar e/gam e s/ope nt t d/dat a/
h t t p://w w w.ope nt t d.or g/donat e.ph p
h t t p://ope nt t /bbs.ph p
h t t p://inf r ar e cor de r.s our ce f or ge.ne t/
Ronnie
Ronnie
Ronnie Robe r
t [1] de b h t t p://ppa.l aunch pad.ne t /k ubunt u-m e m be r s -k de 4/ubunt u gut s y m ain
h t t p://w w w.r ock box.or g
h t t p:/w
w.r ock box-
t h e m e s.or g/
e b99l am o@k t h.se
h t t p://m e e t t h e gim p.or g/
h t t p://w w w.de s ignyour ow nw e b .com/gim p-t ut or ial.h t m
h t t p://w w w.gim p.or g/t ut or ial s/
h t t p://j im m ac.m us ich al l.cz/gim p2de m os.ph p
h t t p://w ik iv /inde x.ph p/GI MP
h t t r e s h m e at.ne t/pr
j e ct s/m andv
h t t p://w w w.ge t de b.ne t/r e l e as e.ph p?
id=1908
h t t p://w w w.ge t de b.ne t/r e l e as e.ph p?
id=9
17
h t t p://w w w.gnom e.or g/pr oj e ct s/gw ge t/h t t p://code.googl /p/gnom e-f r e e l oade r/
h t t p://f l as h got.n
e t/
f e at ur e s#cus t om dm
h t t p://w w w.k ras u.ru/s of t /ch uch e l o/
h t t p://w w w.dow nt h e m al l .ne t /
ne w s @f ul l cir cl e m agaz ine .or g l e t t e r s @f ul l cir cl e m agaz ine .or g r e v ie w s @f ul l cir cl e m agaz ine .or g Que s t ions @f ul l cir cl e m agaz ine .or g m is c@f ul l cir cl e m agaz ine .or g w w w.f ul l cir cl e m agaz ine .or
g
41h t t p://j im h u.not if yl ist .com /f ul l cir cl e.h t m
l。