Library Of The Present- Communal Information In Physical Space
电子回溯图书的产生背景和现实意义
——上海图书馆刘炜副馆长
pri nger Boo k Archives| 5/14/2013 | 16 演S讲 大纲
• Springer的历史和背景 • 电子图书使用情况 • Springer电子回溯图书 • 浩大的投资与辛苦的制作过程 • 现实意义
电子图书和电子期刊的用量分布
Springer: 按标题数全文下载分布图
期刊
100% 90% 80% 70% 全文下载量 60% 50% 40% 30% 20% 10% 0%
电子图书
80%的下载量来自于20%的顶级期刊 55%的下载量来自于20%的电子图书
10%
20%
30%
40%
50%
60%
70%
80%
LIBRARIES ARE:
MODERN
Spri nger Book Archives| 5/14/2013| 8
LIBRARIES ARE:
DIGITAL
Spri nger Book Archives| 5/14/2013| 9
“你所学到的知识......是许多代人孜孜不倦探索的结晶，它汇集了来自世界上各个国家无 数先辈的心血和努力。现在传到你的手中，请你接受它、尊敬它、丰富它，直到有一天你把 它虔诚的交到下一代手中。”
2011
pri nger Boo k Arch ives| 5/14/2013 | 20 诺S贝 尔奖和菲尔兹 奖获得者的Springer图书
从1950年至今，诺贝尔奖和菲尔兹奖作者在Springer出版198种图书
诺贝尔奖和菲尔兹奖的 Springer图书
文献检索考试答案
文献检索考试答案【篇一：信息检索期末考试题及答案】结合自己的检索经历，谈一谈学习信息检索的意义。
要求内容包括但不局限于“图书馆馆藏查询、期刊数据库查询、电子图书查询、学位论文查询、搜索引擎查询”的意义”（30分）新的世纪随着现代科学技术尤其是计算机技术和网络技术的迅猛发展,社会信息量激增，信息呈现出爆炸式的增长趋势，然而在信息的汪洋之中,存在着大量虚假信息和无用信息，这使得获取有用的信息资源变得越来越困难。
因此,信息检索能力已成为新时代人才的一项必备技能。
通过学习信息检索这门课程，我发现在我学习中遇到一些问题时，我又多了一种解决问题的方法，那就是利用图书馆的电子资源，若是在以前我可能更多的向老师和同学求助来解决问题，现在我可以利用图书馆馆藏查询来寻找与之相关的书籍，在学校图书馆里我们可以通过图书馆馆藏查询中的简单查询和组合查询高效快速的查询我们需要的图书，这极大地提高了我们的学习的效率，在我们学校的图书馆我们还可以通过期刊数据库查询来查找一些学术论文，例如我们常用的《中国期刊网》（cnki），该库是目前世界上最大的连续动态更新的中国期刊全文数据库，收录国内8200多种重要期刊，在《中国期刊网》（cnki）我们可以查询我们学校的老师发表的论文，更多的了解所学学科的动态。
除了这些我们还可以在图书馆首页电子图书类下进行电子图书查询在超星数字图书馆下载一些专业书籍，在我们毕业的时候，我们可能也需要一些资料来指导我们的论文写作，这个时候我们可以利用万方中国学位论文数据库进行学位论文查询，可以避免一些我们在写论文时容易犯的错误，给我的论文写作带来方便，有些同学可能直接利用百度搜索论文，有些论文不够专业，不过搜索引擎查询在我们确实给我们的生活带来了一些便利，当我们到了另外一个城市，我们可能不知道坐哪一路公交车找我们的同学，这时我们可以通过百度或谷歌来查询一下路线。
最后我想说学习信息检索可以增强人的信息意识，提高信息素质；作为新时代的大学生，学好信息检索将给我们的现在的学习和以后的工作提供更多的帮助。
期刊网站大全
香港科技大学图书馆Dspace t.hk/dspace包括香港科技大学的学术论文、学位论文、研究报告等内容，均可免费获取全文。
Openj-gate /提供4350种开放获取的期刊的数百万期刊全文文献。
加利福尼亚大学国际和区域数字馆藏/escholarship/加利福尼亚大学国际和区域数字馆藏研究项目。
eScholarshipRepository主要提供已出版的期刊论文、未出版的研究手稿、会议文献以及其他连接出版物上的文章1万多篇，均可免费阅读。
剑桥大学机构知识库/由Cambridge University Library和University Computing Service维护，提供剑桥大学相关的期刊、学术论文、学位论文等电子资源。
发展中国家联合期刊库.br/非营利的电子出版物服务机构，提供来自发展中国家（如巴西、古巴、印度、印尼、肯尼亚、南非、乌干达、津巴布韦等）的开放获取的多种期刊的全文。
美国密西根大学论文库/index.jsp美国密西根大学论文库2万多篇期刊论文、技术报告、评论等文献全文。
包含艺术学、生物学、社会科学、资源环境学等学科的相关论文，另还有博硕士论文。
标识为OPEN的可以打开全文。
CERN Document Server http://cdsweb.cern.ch/主要覆盖物理学（particle physics）及相关学科，提供360,000多篇全文文献，包括预印文献、期刊论文、图书、图片、学位论文等等。
ArXiv/ArXiv是属于Cornell University的非盈利教育机构，面向物理学、数学、非线性科学、计算机科学和定量生物学等学科提供16种免费电子期刊的访问。
NASA Technical Reports Server/?method=browse主要是关于航空航天领域研究的科技报告和会议论文。
National Service Center for Environmental Publications/ncepihom/National Service Center for Environmental Publications提供的是美国环境保护总署(EPA)出版物。
A theory of weak bisimulation for core cml
J.Functional Programming1(1):1–000,January1993c1993Cambridge University Press1A Theory of Weak Bisimulation for Core CMLWILLIAM FERREIRA†Computing LaboratoryUniversity of CambridgeMATTHEW HENNESSY AND ALAN JEFFREY‡School of Cognitive and Computing SciencesUniversity of Sussex1IntroductionThere have been various attempts to extend standard programming languages with con-current or distributed features,(Giacalone et al.,1989;Holmstr¨o m,1983;Nikhil,1990). Concurrent ML(CML)(Reppy,1991a;Reppy,1992;Panangaden&Reppy,1996)is a practical and elegant example.The language Standard ML is extended with two new type constructors,one for generating communication channels,and the other for delayed com-putations,and a new function for spawning concurrent threads of computation.Thus the language has all the functional and higher-order features of ML,but in addition pro-grams also have the ability to communicate with each other by transmitting values along communication channels.In(Reppy,1992),a reduction style operational semantics is given for a subset of CML calledλcv,which may be viewed as a concurrent version of the call-by-valueλ-calculus of(Plotkin,1975).Reppy’s semantics gives reduction rules for whole programs,not for program fragments.It is not compositional,in that the semantics of a program is not defined in terms of the semantics of its subterms.Reppy’s semantics is designed to prove properties about programs(for example type safety),and not about program fragments(for example equational reasoning).In this paper we construct a compositional operational semantics in terms of a labelled †William Ferreira was funded by a CASE studentship from British Telecom.‡This work is carried out in the context of EC BRA7166CONCUR2.2W.Ferreira,M.Hennessy and A.S.A.Jeffreytransition system,for a core subset of CML which we callµCML.This semantics not only describes the evaluation steps of programs,as in(Reppy,1992),but also their communi-cation potentials in terms of their ability to input and output values along communication channels.This semantics extends the semantics of higher-order processes(Thomsen,1995) with types andfirst-class functions.We then proceed to demonstrate the usefulness of this semantics by using it to define a version of weak bisimulation,(Milner,1989),suitable forµCML.We prove that,modulo the usual problems associated with the choice operator of CCS,our chosen equivalence is preserved by allµCML contexts and therefore may be used as the basis for reasoning about CML programs.In this paper we do not investigate in detail the resulting theory but confine ourselves to pointing out some of its salient features;for example standard identities one would expect of a call-by-valueλ-calculus are given and we also show that certain algebraic laws common to process algebras,(Milner,1989),hold.We now explain in more detail the contents of the remainder of the paper.In Section2we describeµCML,a monomorphically typed core subset of CML,which nonetheless includes base types for channel names,booleans and integers,and type con-structors for pairs,functions,and delayed computations which are known as events.µCML also includes a selection of the constructs and constants for manipulating event types,such as and for constructing basic events for sending and receiving values, for combining delayed computations,for selecting between delayed compu-tations,and a function for launching new concurrent threads of computation within a program.The major omission is thatµCML has no facility for generating new channel names.However we believe that this can be remedied by using techniques common to the π-calculus,(Milner,1991;Milner et al.,1992;Sangiorgi,1992).In the remainder of this section we present the operational semantics ofµCML in terms of a labelled transition system.In order to describe all possible states which can arise dur-ing the computation of a well-typedµCML program we need to extend the language.This extension is twofold.Thefirst consists in adding the constants of event type used by Reppy in(Reppy,1992)to defineλcv,i.e.constants to denote certain delayed computations.This extended language,which we callµCML cv,essentially coincides with theλcv,the lan-guage used in(Reppy,1992),except for the omissions cited above.However to obtain a compositional semantics we make further extensions toµCML cv.We add a parallel oper-ator,commonly used in process algebras,which allows us to use programs in place of the multisets of programs of(Reppy,1992).Thefinal addition is more subtle;we include inµCML cv expressions which correspond to the ed versions of Reppy’s constants for representing delayed computations.Thus the labelled transition system uses as states programs from a language which we call µCML.This language is a superset ofµCML cv,which is our version of Reppy’sλcv, which in turn is a superset ofµCML,our mini-version of CML.The following diagramA Theory of Weak Bisimulation for Core CML3indicates the relationships between these languages:µCMLλcvCMLIn Section3we discuss semantic equivalences defined on the labelled transition of Sec-tion2.We demonstrate the inadequacies of the obvious adaptations of strong and weak bisimulation equivalence,(Milner,1989),and then consider adaptations of higher-order and irreflexive bisimulations from(Thomsen,1995).Finally we suggest a new variation called hereditary bisimulation equivalence which overcomes some of the problems en-countered with using higher-order and irreflexive bisimulations.In Section4we show that hereditary bisimulation is preserved by allµCML contexts.This is an application of the proof method originally suggested in(Howe,1989)but the proof is further complicated by the fact that hereditary bisimulations are defined in terms of pairs of relations satisfying mutually dependent properties.In Section5we briefly discuss the resulting algebraic theory ofµCML expressions.This paper is intended only to lay the foundations of this theory and so here we simply indicate that our theory extends both that of call-by-valueλ-calculus(Plotkin,1975)and process algebras(Milner,1989).In Section6we show that,up to weak bisimulation equivalence,our semantics coincides with the reduction semantics forλcv presented in(Reppy,1992).This technical result ap-plies only to the common sub-language,namelyµCML cv.In Section7we briefly consider other approaches to the semantics of CML and related languages and we end with some suggestions for further work.2The LanguageIn this section we introduce our languageµCML,a subset of Concurrent ML(Reppy, 1991a;Reppy,1992;Panangaden&Reppy,1996).We describe the syntax,including a typing system,and an operational semantics in terms of a labelled transition system. Unfortunately,there is not enough space in this paper to provide an introduction to pro-gramming in CML:see(Panangaden&Reppy,1996)for a discussion of the design and philosophy of CML.The type expressions for our language are given by:A::A A A A A AThus we have three base types,,and;the latter two are simply examples of useful base types and one could easily include more.These types are closed under four con-structors:pairing,function space,and the less common and type constructors.4W.Ferreira,M.Hennessy and A.S.A.JeffreyOur language may be viewed as a typedλ-calculus augmented with the type constructors A for communication channels sending and receiving data of type A,and A for constructing delayed computations of type A.Let Chan A be a type-indexed family of disjoint sets of channel names,ranged over by k, and let Var denote a set of variables ranged over by x,y and z.The expressions ofµCML are given by the following abstract syntax:e f g Exp::v ce e e e e e x e e eev w Val::x y e x k01c Const::The main syntactic category is that of Exp which look very much like the set of expressions for an applied call-by-value version of theλ-calculus.There are the usual pairing,let-binding and branching constructors,and two forms of application:the application of one expression to another,ee,the application of a constant to an expression,ce.There is also a syntactic category of value expressions Val,used in giving a semantics to call-by-value functions and communicate-by-value channels.They are restricted in form: either a variable,a recursively defined function,x y e,or a predefined literal value for the base types.We will use some syntax sugar,writing y e for x y e when x does not occur in e,and e;f for x e f when x does not occur in f. Finally there are a small collection of constant functions.These consist of a representa-tive sample of constants for manipulating objects of base type,,which could easily be extended,the projection functions and,together with the set of constants for manipulating delayed computations taken directly from(Reppy,1992):and,for constructing delayed computations which can send and receive values,,for constructing alternatives between delayed computations,,for spawning new computational threads,,for launching delayed computations,,for combining delayed computations,,for a delayed computation which always deadlocks,and,for a delayed computation which immediately terminates with a value. Note that there is no method for generating channel names other than using the predefined set of names Chan A.There are two constructs in the language which bind occurrences of variables,xe1e2where free occurrences of x in e2are bound and x y e where free oc-currences of both x and y in e are bound.We will not dwell on the precise definitions of free and bound variables but simply use f v e to denote the set of variables which have free occurrences in e.If f v e/0then e is said to be a closed expression,which we sometimes refer to as a program.We also use the standard notation of e v x to denote the substitution of the value v for all free occurrences of x in e where bound names may be changed in order to avoid the capture of free variables in v.(Since we are modelling aA Theory of Weak Bisimulation for Core CML5:A B A:A A:A B B:A A::A A A::::A A B B:A A:A:A AFigure1a.Type rules forµCML constant functionsx yΓx:A y:BΓ:Γ:Γx y e:A BΓe:AΓf:BΓe:AΓe f:BΓe:AΓx:A f:BΓe f g:A6W.Ferreira,M.Hennessy and A.S.A.Jeffreythis reduction semantics are of the form:CτCwhere C C are configurations which combine a closed expression with a run-time envi-ronment necessary for its evaluation,andτis Milner’s notation for a silent action.However this semantics is not compositional as the reductions of an expression can not be deduced directly from the reductions of it constituent components.Here we give a compositional operational semantics with four kinds of judgements:eτe,representing a one step evaluation or reduction,e v e,representing the production of the value v,with a side effect e,e k?x e,representing the potential to input a value x along the channel k,ande k!v e,representing the output of the value v along the channel k.These are formally defined in Figure2,but wefirst give an informal overview.In order to define these relations we introduce extra syntactic constructs.These are introduced as required in the overview but are summarized in Figure3.The rules for one step evaluation or reduction have much in common with those for a standard call-by-valueλ-calculus.But in addition a closed expression e of type A should evaluate to a value of type A and it is this production of values which is the subject of the second kind of judgement.HoweverµCML expressions can spawn subprocesses before returning a value,so we have to allow expressions to continue evaluation even after they have returned a result.For example in the expression:0a;aone possible reduction is(whereτindicates a sequence ofτ-reductions):0a;aτa?11a!0where the process returns the value1before outputting0.For this reason we need a reduc-tion e v e rather than the more usual termination e v.The following diagram illustrates all of the possible transitions from this expression:0a;aτa!0τa?vva!0vA Theory of Weak Bisimulation for Core CML7 judgements of the operational semantics apply to these configurations.The second,more common in work on process algebras,(Bergstra&Klop,1985;Milner,1989),extends the syntax of the language being interpreted to encompass configurations.We choose the latter approach and one extra construct we add to the language is a parallel operator,e f.This has the same operational rules as in CCS,allowing reduction of both processes:eαee fαe fand communication between the processes:e k!v ef k?x fe fτe v x fThe assymetry is introduced by termination(a feature missing from CCS).A CML process has a main thread of control,and only the main thread can return a value.By convention, we write the main thread on the right,so the rule is:f v feαeSecondly,e may have spawned some concurrent processes before returning a function,and these should carry on evaluation,so we use the silent rule for constant application:e v e8W.Ferreira,M.Hennessy and A.S.A.JeffreyThe well-typedness of the operational semantics will ensure that v is a function of the appropriate type,.With this method of representing newly created computation threads more of the rules corresponding toβ-reduction in a call-by-valueλ-calculus may now be given.To evaluate an application expression e f,first e is evaluated to a value of functional form and then the evaluation of f is initiated.This is represented by the rules:eαee fτe yf g(In fact we use a slightly more complicated version of the latter rule as functions are al-lowed to be recursive.)Continuing with the evaluation of e f,we now evaluate f to a value which is then substituted into g for y.This is represented by the two rules:fτfx f gτf g v xThe evaluation of the application expression c f is similar;f is evaluated to a value and then the constant c is applied to the resulting value.This is represented by the two rulesfτfc fτfδc vHere,borrowing the notation of(Reppy,1992),we use the functionδto represent the effect of applying the constant c to the value v.This effect depends on the constant in question and we have already seen one instance of this rule,for the constant,which result from the fact thatδv v.The definition ofδfor all constants in the language is given in Figure2f.For the constants associated with the base types this is self-explanatory; the others will be explained below as the constant in question is considered.Note that because of the introduction of into the language we can treat all constants uniformly, unlike(Reppy,1992)where and have to considered in a special manner.In order to implement the standard left-to-right evaluation of pairs of expressions we introduce a new value v w representing a pair which has been fully evaluated.Then to evaluate e f:first allow e to evaluate:eαee fτe xf v xThese value pairs may then be used by being applied to functions of type A B.For example the following inferences result from the definition of the functionδfor the constants and:e v w eeτe m nIt remains to explain how delayed computations,i.e.programs of type A,are han-dled.It is important to realise that expressions of type A represent potential rather than actual computations and this potential can only be activated by an application of theA Theory of Weak Bisimulation for Core CML9eαee fαe feαee f gαe f geαee fαef fαfe f v e fFigure2a.Operational semantics:static rules ge1αege1ge2αegeαeceτeδc v e ee f gτe ge v ee fτe yfg v xv x y g e v ee fτef v xe k?x ef k!v fv vΛk?k?x x10W.Ferreira,M.Hennessy and A.S.A.Jeffreye f g Exp::v ce e e e e e x e e eev w Val::x y e x k01c Const::Figure3a.Syntax ofµCMLv w Val::v v gege GExp::v!v v?ge v ge geΛA vFigure3b.Syntax ofµCML cve f g Exp::ge e eFigure3c.Syntax ofµCMLconstant,of type A A.Thus for example the expression k is of type A and represents a delayed computation which has the potential to receive a value of type A along the channel k.The expression k can actually receive such a value v along channel k,or more accurately can evaluate to such a value,provided some other computation thread can send the value along channel k.The semantics of is handled by introducing a new constructor for values.For certain kinds of expressions ge of type A,which we call guarded expressions,let ge be a value of type A;this represents a delayed computation which when launched initiates a new computation thread which evaluates the expression ge.Then the expression ge reduces in one step to the expression ge.More generally the evaluation of the expressione proceeds as follows:First evaluate e until it can produce a value:eτeeτe geNote that here,as always,the production of a value may have as a side-effect the generation of a new computation thread e and this is launched concurrently with the delayed compu-tation ge.Also both of these rules are instances of more general rules already considered. Thefirst is obtained from the rule for the evaluation of applications of the form ce and the second by definingδge to be ge.The precise syntax for guarded expressions will emerge by considering what types of values of the form e can result from the evaluation of expressions of type from the basic languageµCML.The constant is of type A A and thereforethe evaluation of the expression e proceeds byfirst evaluating e to a value of type A until it returns a value k,and then returning a delayed computation consisting of an event which can receive any value of type A on the channel k.To represent this event we extend the syntax further by letting k?be a guarded expression for any k and A,with the associated rule:e k eeτe k!vIt is these two new expressions k?and k!v which perform communication between compu-tation threads.Formally k!v is of type and we have the axiom:k?k?x xTherefore in general input moves are of the form e k?x f where e:B and x:A f:B. Communication can now be modelled as in CCS by the simultaneous occurrence of input and output actions:e k?x ef k!v feτeΛobtained,once more,by definingδto beΛ.The constant is of type A A B B.The evaluation of e proceeds in the standard way by evaluating e until it produces a value,which must be of the form ge v,where ge is a guarded expression of type A and v has type A B.Then the evaluation of e continues by the construction of the new delayed computation ge v.Bearing in mind the fact that the production of values can generate new computation threads,this is formally represented by the inference rule:e ge v ege vαveThe construct,of type A A,evaluates its argument to a value v,and thenreturns a trivial a delayed computation;this computation,when activated,immediately evaluates to the value v.In order to represent these trivial computations we introduce a new constructor for guarded expressions,A and the semantics of is then captured by the rule:e v eA vτvThe choice construct e is a choice between delayed computations as has the type A A A.To interpret it we introduce a new choice constructor ge1ge2where ge1and ge2are guarded expressions of the same type.Then e pro-ceeds by evaluating e until it can produce a value,which must be of the form ge1ge2, and the evaluation continues by constructing the delayed computation ge1ge2.This is represented by the rule:e ge1ge2ege2αege1ge2αeΓv:AΓw:BΓge:AΓv:AΓw:AΓv?:AΓge:AΓv:A BΓge1ge2:AΓA v:AΓe:AΓf:BΓτ:A Γv:AΓk?x:AΓw:Bof the form e k ?xf where f may be an open expression we need to consider relations over open expressions.Let an open type-indexed relation R be a family of relations R ΓA such that if e R ΓA f then Γe :A and Γf :A .We will often elide the subscripts from relations,for example writing e R f for e R ΓA f when context makes the type obvious.Let a closed type-indexed relation R be an open type-indexed relation where Γis everywhere the empty context,and can therefore be elided.For any closed type-indexed relation R ,let its open extension R be defined as:e R x :A Bf iff e v x R B f v x for allv :AA closed type-indexed relation R is structure preserving iff:if v R A w and A is a base type then v w ,if v 1v 2R A 1A 2w 1w 2then v i R A i w i ,if ge 1R A ge 2then ge 1R A ge 2,andif v R A B v then for all w :A we have vw R B v w .With this notation we can now define strong bisimulations over µCML expressions.A closed type-indexed relation R is a first-order strong simulation iff it is structure-preserving and the following diagram can be completed:e 1R e 2e 1R e 2ase 1lRe 2lsince the definition of strong bisimulation demands that the actions performed by expres-sions match up to syntactic identity.This counter-example can also be reproduced using only µCML contexts:kx121kx21since the left hand side can perform the move:kx12τk !x12but this can only be matched by the right hand side up to strong bisimulation:kx21τk !x21In fact,it is easy to verify that the only first-order strong bisimulation which is a congruence for µCML is the identity relation.To find a satisfactory treatment of bisimulation for µCML,we need to look to higher-order bisimulation ,where the structure of the labels is accounted for.To this end,given a closed type-indexed relation R ,define its extension to labels R l as:v R l A wk !v R l A k !wkChan BThen R is a higher-order strong simulation iff it is structure-preserving and the followingdiagram can be completed:e 1R e 2e 1R e 2aswhere l 1R l l 2e 1l 1Re 2l 2lotherwise.Then R is a first-order weak simulation iff it is structure-preserving and the following diagram can be completed:e 1R e 2e 1R e 2ase 1lRe 2ˆl Let1be the largest first-order weak bisimulation.Proposition 3.31is an equivalence.ProofSimilar to the proof of Proposition 3.1.Unfortunately,1is not a congruence,for the same reason as 1,and so we can attempt the same modification.R is a higher-order weak simulation iff it is structure-preserving and the following diagram can be completed:e 1R e 2e 1R e 2aswhere l 1R ll 2e 1l 1Re 2ˆl 2Lethbe the largest higher-order weak bisimulation.Proposition 3.4h is an equivalence.ProofSimilar to the proof of Proposition 3.1.However,h is still not a congruence,for the usual reason that weak bisimulation equiva-lence is not a congruence for CCS summation.Recall from (Milner,1989)that in CCS 0τ0but a 00a 0τ0.We can duplicate this counter-example in µCML since the CCS operator corresponds to the µCML operator and 0corresponds to Λ.However may only be applied to guarded expressions and therefore we need a guarded expressionwhich behaves like τ0;the required expression is A Λ.Thus:ΛhA Λsince the right hand side has only one reduction:A ΛτΛτΛbut:Λk !0hA Λk !0because the only reduction of Λk !0is Λk !0k !0ΛΛand:A Λk !0τΛτΛThis counter-example can also be replicated using the restricted syntax of µCML.We have:hsince the left hand side has only one reduction:ΛΛand the right hand side can match this with:A ΛΛand we have seen:ΛhA ΛHowever:k 0hk 0since the left hand side has only one reduction:k 0τΛk !0whereas the right hand side has the reduction:k 0τA Λk !0A first attempt to rectify this is to adapt Milner’s observational equivalence for µCML,and to define h as the smallest symmetric relation such that the following diagram can be completed:e 1he 2e 1he 2aswhere l 1h ll 2e 1l 1he 2l 2Proposition 3.5h is an equivalence.ProofSimilar to the proof of Proposition 3.1.This attempt fails,however,since it only looks at the first move of a process,and not at thefirst moves of any processes in its transitions.Thus,the above µCML counter-example for h being a congruence also applies to h ;i.e.hbut:k 0hk 0This failure was first noted in (Thomsen,1995)for CHOCS.Thomsen’s solution to this problem is to require that τ-moves can always be matched by at least one τ-move,which produces his definition of an irreflexive simulation as a structure-preserving relation where the following diagram can be completed:e 1R e 2e 1R e 2aswhere l 1R l l 2e 1l 1Re 2l 2Letibe the largest irreflexive bisimulation.Proposition 3.6iis a congruence.ProofThe proof that i is an equivalence is similar to the proof of Proposition 3.1.The proof that it is a congruence is similar to the proof of Theorem 4.7in the next section.However this relation is rather too strong for many purposes,for example 12i111since the right hand side can perform more τ-moves than the left hand side.This is similar to the problem in CHOCS where a τP i a P .In order to find an appropriate definition of bisimulation for µCML,we observe that µCML only allows to be used on guarded expressions ,and not on arbitrary expressions.We can thus ignore the initial τ-moves of all expressions except for guarded expressions.For this reason,we have to provide two equivalences:one on terms where we are not interested in initial τ-moves,and one on terms where we are.A pair of closed type-indexed relations R R n R s form a hereditary simulation (we call R n an insensitive simulation and R s a sensitive simulation )iff R s is structure-preserving and we can complete the following diagrams:e 1R ne 2e 1R ne 2aswhere l 1R sll 2e 1l 1R ne 2ˆl 2and:e 1R se 2e 1R se 2aswhere l 1R s l l 2e 1l 1R ne 2l 2Let n sbe the largest hereditary bisimulation.Note that we require R s to be structure-preserving because it is used to compare the labels in transitions,which may contain ab-stractions or guarded events.In the operational semantics of µCML expressions,guarded expressions can only appear in labels,and not as the residuals of transitions.This explains why in the definition of n labels are compared with respect to the sensitive relation s whereas the insensitive relation is used for the residuals.For example,if ge 1n s ge 2then we have:xge 1nxge 2since once either side is applied to an argument,their first action will be a τ-step.On the other hand:ge 1nge 2sinceis precisely the construct which allows us to embed ge 1and ge 2in acontext.Theorem 3.7s is a congruence for µCML ,andnis a congruence for µCML.ProofThe proof that s and n are equivalences is similar to the proof of Proposition 3.1.The proof that they form congruences is the subject of the next section.Proposition 3.8The equivalences on µCML have the following strict inclusions:1shh111x1xk k i h k12s i1111n s x1xh n1h h x1xwhere:x x(Note that this settles an open question(Thomsen,1995)as to whether i is the largestcongruence contained in h.)It is the operator which differentiates between the two equivalences n and h.Howeverin order to demonstrate the difference we need to be able to apply to guarded expressionswhich can spontaneously evolve,i.e.performτ-moves.The onlyµCML constructor for guarded expressions which allows this is A,and in turn occurrences of this can only begenerated by theµCML constructor.Therefore:Proposition3.9For the subset ofµCML without and A,n is the same as h,and s is the same as h.ProofFrom Proposition3.8n h.For the subset ofµCML without and A,define R s as:v w v h w ge1ge2ge1h ge2v1w v2w v1h v2Then since no event without A can perform aτ-move,and since the only initial moves ofv i w areβ-reductions,we can show that h R s forms an hereditary bisimulation,and so h n.From this it is routine to show that s h.Unfortunately we have not been able to show that n is the largestµCML congruence con-tained in weak higher-order bisimulation equivalence.However we do have the following characterisation:Theorem3.10n is the largest higher-order weak bisimulation which respectsµCML contexts.ProofBy definition,n is a higher-order weak bisimulation,and we have shown that it respectsµCML contexts.All that remains is to show that it is the largest such.Let R be a higher-order weak bisimulation which respectsµCML contexts.Then define: R n R v1w e2v1R v2v2wτe2e1v2w v1R v2v1wτe1R s v w v R w ge1ge2ge1R ge2v1w v2w v1R v2We will now show that R n R s forms an hereditary simulation,from which we can de-duce R R n n.。
查找中国古代史史料-中国科学院自然科学史研究所机构知识库
古典学的历史 维拉莫威兹 三联书店 古典学术史 普法伊费尔 北京大学出版社 西方古典学术史第一卷 桑兹 上海人民出版社 全球史学史：从18世纪至当代 伊格尔斯 北大 The Oxford History of Historical Writing 西方校勘学论著选 苏杰编 上海人民出版社
数据库
外文期刊：
数字资源导航
• • • • • • • • • • BookOS BookFinder The Online Books Page Great Books Online Free Ebooks Library Digital Library and Archives OAPEN DOAB Making of America（MOA） UC Press E-Books Collection, 1982-2004
谢谢！
数据库
Archives： EEBO(Proquest~17)、EAI(Redeax~1819) 、ECCO(18)、 NCCO(Gale~19) EEB(Proquest~18)、Landmarks of Science(Redeax~19) AP、BP、PAO(Proquest)、18世纪期刊在线(AMD) AHN(Readex)、Gale报纸回溯数据库（17th &18th Centu ry Burney、19th Century British Library Newspapers、1 9th Century UK Periodicals、19th Century U.S. Newspa pers）、Chronicling America Smithsonian Collections Online(Gale) History Vault-Thomas Edison(Proquest)
英国大学图书馆开放获取出版服务研究
英国大学图书馆开放获取出版服务研究作者：王利君来源：《新世纪图书馆》2020年第04期摘要在开放获取的大环境下，英国大学图书馆充分发挥自身优势，通过出版开放获取图书和期刊、制定开放获取政策、管理开放获取出版基金和建设开放获取存储库来开展开放获取出版服务。
开展的服务具有服务人员专业化、服务途径多样化、用户培训特色化的特点，为我国大学图书馆积极参与开放获取出版提供了有益的借鉴和思考。
关键词英国大学图书馆开放获取学术出版Abstract In the open access environment， UK university libraries take advantages of themselves and carry out open access publishing service through publishing open access books and journals，formulating open access policies， managing open access publishing funds and building open access repositories. This service has the characteristics of professionalization of service personnel，diversification of service channels and specialization of user training. It provides useful reference and thinking to participate in open access publishing for university libraries in China.Keywords UK. University library. Open access. Academic publishing.0 引言开放获取（Open Access， OA）是一种学术信息共享的自由理念和出版机制。
User Profile Modeling and Applications to Digital Libraries
User Profile Modeling and Applications toDigital LibrariesGiuseppe Amato and Umberto StracciaIstituto di Elaborazione dell’Informazione-C.N.R.Via S.Maria46,I-56126Pisa,Italy{amato,straccia}@r.itr.it/~{amato,straccia}Abstract.The ultimate goal of an information provider is to satisfythe user information needs.That is,to provide the user with the rightinformation,at the right time,through the right means.A prerequisitefor developing personalised services is to rely on user profiles representingusers’information needs.In this paper we willfirst address the issue ofpresenting a general user profile model.Then,the general user profilemodel will be customised for digital libraries users.1IntroductionIt is widely recognised that the internet is growing rapidly in terms of the number of users accessing it,the amount of information created and accessible through it and the number of times users use it in order to satisfy their information needs. This has made it increasingly difficult for individuals to control and effectively seek for information among the potentially infinite number of information sources available on the internet.Ironically,just as more and more users are getting on-line,it is getting increasingly difficult tofind relevant information in a reasonable amount of time,unless one knows exactly what to get,from where to get it and how to get it.New emerging services are urgently needed on the internet to prevent computer users from being drowned by theflood of available information.Typical information sources on the internet,like search engines,digital li-braries and online database(e.g.,[1,6,12,13],just to mention some),provide a search and retrieval service to the web community at large.A common charac-teristics of most of these retrieval services is that they do not provide any per-sonalised support to individual users,or poorly support them.Indeed,they are oriented towards a generic user.In fact,they answer queries crudely rather than, for instance,learning the long-term requirements idiosyncratic to a specific user. Moreover,they seldom select and organise information for users accordingly,e.g., assisting in the selection of books or other archived documents from libraries, news items from press agencies,television station and journals,or documents from administrative bodies.Providing personalized information search and de-livering services,as additional services to the uniform and generic information search offered today,is likely to be thefirst step to make relevant informationavailable to people in the appropriate form,amount and level of detail,at the right time through the right means,and with minimal user effort.A prerequisite for developing systems providing personalised services is to rely on user profiles,i.e.a representation of the preferences of any individual user. Roughly,a user profile is a structured representation of the user’s needs through which a retrieval system should,e.g.,act upon one or more goals based on that profile and autonomously,pursuing the goals posed by the user(irrespective of whether the user is connected to the system).It is quite obvious that a user profile modeling process requires two steps (which constitutes the user profile modeling methodology).We have to describe –what has to to represented,that is which information pertaining to the user has to represented,and–how this is information is effectively represented.The topic of this paper is to describe both steps.We will show that thefirst one can be described in a quite general and application independent way,while the second one depends on a particular application.In order to be concrete,we will propose a user profile model which can be used in the context of the NCSTRL digital library(Networked Computer Science Technical Reference Library)[13]. Essentially,using profiles,users will be able to create their own customised scientific interest representation.This allows the digital library to provide a “notification service”,by e.g.e-mailing the users when documents(like technical reports and articles)matching their scientific interest become available in the digital library.1The interesting point is that simple modifications to the existing architectures are sufficient in order to provide this service.We proceed as follows.In the next section we will introduce those concepts which have to be taken into account in a quite general user profile modeling process.In Section3we will apply these concepts to a special case:digital libraries(like NCSTRL).In Section4we will present two solutions for extending an existing search service in a retrieval system in order to take into account user profiles.Section5concludes and describes further work.2User Profile ModelingThe topic of this section is to describe some general concepts involved in the user modeling process.In particular,we will describe what has to represented ina user profile from the users point of view.2.1The General Information Retrieval ScenarioThe general concern of a user is the retrieval of relevant information that per-tains to its information needs.So,let usfirst introduce a global and general information seek scenario(see Fig.1).1Similar features are promised within the ACM Digital Library[6]as a forthcoming service.Fig.1.The information seek scenarioWe can distinguish two main actors in it:the user information needs and the information sources.User Information Needs.With user information needs we mean“what”a user is really looking for.Examples of user information needs may be1.“I’m looking for journal articles about computer networking,published notlater than1996.I want to pay less than2$for each.”2.“I’m looking for news concerning the latest trend about stock quotes ofHigh-Tech companies.”3.“I’m looking for MPEG videos about Formula One races,downloadable fromthe web in less than2hours.”4.“I’m looking for hike tours in the Alps.”In the following,we will consider the information needs described by Point1.−4.Thefirst observation is that a user information need may be quite different rmation type and content.With respect to the type,in cases1.−4. we are looking for journal articles,news,MPEG videos and images,respectively. These describe the type of information we are looking for.On the other hand, w.r.t.the content,in cases1.−4.we are also looking for information which is about computer networking,about stock quotes of High-Tech companies,about Formula One races and geographical maps with hike trails.These describe what information we are looking for from an information content point of view.The second observation is that not only different users have heterogeneousinformation needs,but there may be a heterogeneity in between the needs of asingle user too.That is,the information needs1.−4.may belong to four different users or may be four different needs(from a type and content point of view)of the same user.A third andfinal observation is that a user information need may be a short term user information need or a long term user information need.In the former case we refer to an ad-hoc,occasional user information need,whereas in the latter case we refer to a user information need which is of interest during a relevant time period.It is easily verified that in fact our daily information seek process involves both temporary needs as well as long term interests.Of course, whether an information need is a short term or a long term interest depends on the user.For instance,if an economist(say,John)is planning to hike in the mountains next weekend(an event that seldom happens for John),then he is looking for some site map and tour and may express its need through Point4. above.This is a short term information need of John.But,John,as a serious economist,is also interested in any kind of news related to stock exchange quotes. He may express his information need through Point2.above.Of course,this is a long term information need.On the other hand,Point2.may be a short term interest of a computer scientist(say,Tom),whereas Point1.may be his long term interest.In summary,information needs may differ w.r.t.their type,their content and their duration(short term and long term).Moreover,information needs are heterogeneous among users and in between users.All these aspects have to be taken into account during the user profile modeling process.Information Sources.With information sources we mean all the heterogeneous digital information providers distributed over the Internet,which make available any kind of information which might be of interest to Internet users.Examples of information sources are web sites,online databases,news groups,news agen-cies,search engines,digital libraries,etc.Essentially,they differ in what kind of information they provide,what services they provide and which users they address.The ultimate goal of an information provider is to satisfy user information needs,that is to provide the user with the right information,at the right time, through the right means.It is easily verified that this requires the execution of two separate tasks:to gather relevant information and to deliver them.Thefirst tasks,typically the hardest one,is that of gathering the information which is thought to be of interest to the user.Once the information has been collected, it has to be delivered to the user,according to his preferences(second task). Examples of delivery modalities may be web pages(this is the usual case for which most of us are familiar with),e-mail,phone,fax(e.g.,a user wants to receive stock quotes by phone,e-mail or fax),or surface mail(e.g.,a user wants to receive the proceedings of a conference by surface mail).As far as our work concerns,we will concentrate on user information needs.In particular,in the next section we will refine the concepts involved in the userinformation need modeling process.An equally important topic is the modeling of information sources,which we will not address in this paper.2.2The Data Categories of a User ProfileIn this section we will a present a general user profile model through which we may represent user’s preferences and needs.By relying on the discussion of the previous section(see also Fig.1)it is quite clear that in a user profile we have to represent at least–what has to be gathered,and–how the gathered information has to be delivered to the user.We will show in the following that the information to be represented about the users is not only restricted to the two categories above,but may be classified in fact into(at least)five data categories.These categories are the personal data category,the gathering data category,the delivering data category,the actions data category,and the security data category.In the following we will describe thesefive categories in detail.The Personal Data Category.The personal data category is a collection of user’s personal identification data.Under this category we consider data like user’s name,birth date,gender,identity certificate,employer,home contact information,business contact information,etc.(see e.g.,[14]as a concrete case). The Gathering Data Category.The gathering data category collects pref-erences and restrictions about the documents a user is looking for.These pref-erences and restrictions may be classified into three distinct subcategories,each addressing orthogonal document dimensions.These subcategories are:–the document content category:specification of what has to be gathered.Under this category we consider preferences on document’s properties that relate to the content a user is looking for:the document language and its aboutness.For instance,“I’m looking for documents talking about computer networking,written in English.”.–the document structure category:user’s specification of all those properties ofa document he/her is looking for which relate to the structure of a document,like its format(text formats,image formats,audio formats,video formats), its type(article,technical report,proceedings,news,novel,poem,www home page),its creation date,its cost and dimension.For instance,“I’m looking for GIF images created today.”–the document source category:specification of where to gather from.In this category we collect all the user’s restrictions on the source from which he/she would like to receive information,like a restriction on the URL(e.g.,“I want only documents from /”),the specification of publishers(e.g.,“I want only news from Reuters”),series(e.g.,“I want only articlesfrom the Lecture Notes in Computer Science”),author’s(e.g.,“I’m looking for audio records of Giuseppe Verdi.”).In summary,in a user profile we should allow the representation of what to gather(in terms of the structure and the content of a document)and where to gather from.The Delivering Data Category.Under the delivering data category the user specifies preferences on the delivery modes of the gathered information.These preferences may be classified into two distinct subcategories,each of them ad-dressing orthogonal delivering dimensions.These subcategories are:1.the delivery means category:specification of how to deliver.In this categorywe consider user preferences regarding the delivery means,like phone,fax, web and e-mail,that should be used in order to deliver the information the user requested for.2.the delivery time category:specification of when to deliver.In this categorywe consider user preferences regarding the delivery time,like interval(e.g.,“deliver me the news I’m interested in each morning at9am,except during the weekend.”)and as soon as possible(e.g.,“deliver me the news I’m inter-ested in as soon as you gather it.”,or“deliver me the stock quote exchange rate I’m interested in as soon as it looses more than5%.”).In few words,in order to represent the user’s delivery preferences we should represent how to deliver and when to deliver.Actions Data Category.A personalised service should be highly responsive to the needs of the user.In particular,long term information needs involve repeated interactions with the user.Assuming that a lot of the user actions are consistent,a retrieval service should match increasingly better his/her needs over time.Furthermore,since the interaction could extend over a long period of time,it cannot be assumed that the users interests will remain constant.The change in interest could be anything from a slight shift in relative priorities to completely losing interest in some domain and gaining interest in another.In general,a system must be able to detect or must allow the user to indicate the change in interests and should respond by adapting to these changes.The system must be able to explore newer domains and prospect for interesting information. To summarise,personalised service should be capable not only of dealing with the currently known needs of the user,but also exploring different domains to find documents of potential interest to the user.Thus,it should be specialised, adaptive and exploratory.In order to provide a service with the above capabilities,under the actions data category,we collect a set of actions,not necessarily taken only by the user him/her self.The actions data generally contains the recording of the user’sinteraction with retrieval systems and navigation data.Typical actions data maybe URLs of visited web pages,read documents and user’s relevance judgements.By relying on techniques based on user relevance feedback[2,4,8,9,11,15–17],as well as on collaborative feedback(in this case the user is usually member ofan interest group)[5,10],the actions may be profitably be used for refining the user’s gathering data specification.Security Data ers wants to express their privacy practices.The security data category is a collection of user preferences establishing the condi-tions under which the data represented in the user profile may be accessed.These preferences may regard all the previous categories(the personal data,the gath-ering data,the delivering data and the actions data categories).Typically,user’s may establish different privacy practices for each of the services they access to.An extensive work about privacy preferences can be found in[14].An Example.We end this part with an example,illustrating the concepts introduced in the sections above.Suppose a user’s profile is as follows:1.“I’m John Smith,34year old and I’m looking for2.video sequences,dated after than April,1st,for which I don’t want to payfor,3.which are about Michael Schumacher driving his Ferrari and4.published by FIA(Federation Internationale de l’Automobile).5.Deliver me as soon as possible6.an audio summary message of the top ranked video I’m interested in and aSMS message containing the source URL,at my cellular phone,+39.0347.593404.7.I have already seen /news/news1.mov and consider/news/ferrari.html as relevant to what I’m looking for.8.I do not allow to access to my personal data.”.According to the user profile schema resumed in Table1,Point1.pertains to the personal data category,Point2.pertains to the document structure category, Point3.pertains to the document content category,Point4.pertains to the document source category,Point5.pertains to the delivery time category,Point 6.pertains to the delivery means category,Point7.pertains to the actions data category and Point8.pertains to the security data category.3A Pr ofile Schema for Digital Libr ar yUser sAs for documents there exists several ways to represent them(like the vector space model,Dublin Core,MARC,etc.),similarly,there may be different,ap-plication dependent,user profile representations.In this section a profile schema tailored for digital library users is discussed.The proposed profile schema,whileer profile schema summaryUser Profile:personal data categorygathering data category:document content categorydocument structure categorydocument source categorydelivering data category:delivery means categorydelivery time categoryactions data categorysecurity data categoryremaining within the general user profile model presented in the previous sec-tions,tries to capture typical aspects that can be required by a digital library user.These features,if well exploited,can significantly help an advanced digital library to automatically search for documents relevant to the user.For instance, a particularly interesting case concerns digital libraries users having long term interest,as,e.g.scientist.In this case,a digital library(like NCSTRL and ACM [6,13])may notify the user as soon as a new article,technical report or the like has been made available and matches his/her research interests.We willfirst describe the general structure of the user profile schema,then particular attention will be paid to the gathering data category.3.1The Profile SchemaUsers that want to exploit the retrieval capabilities of a digital library are sup-posed to subscribe to the service.As consequence of the subscription,a person-alized profile is created for the user.The profile is identified by a unique profile identifier.This can be formalized as follows:P rofiles=P rofID→UserP rofile.(1) As we have seen,user profile data may be classified intofive categories.We formalise this withUserP rofile=(P ersData×GathData×DeliData×ActData×SecData).(2) In the following we will formally describe each of these categories.Personal Data.The personal data category contains information about the user identity.For complying a standard,we propose to rely on the P3P“user”schema[14]for the P ersData specification.Gathering Data.This category of the user profile specifies what documents a user is interested in.In Section2.1we have seen that a certain user may have at the same time several different interests.In the user’s profile all the user’s interests should be described separately so that different types of preferences can be specified for different interests.We call topic a single user information need.In order to capture the fact that the user may have several interests,the proposed user profile is associated with a set of topics.This is formalized as follows:GathData=T opicID→T opic.(3) Each topic is identified by a topic identifier that should be unique for a given user profile,i.e.the pair(P rofID,T opicID)is unique.The complete definition of a topic will be given separately in Section3.2.Delivery Data.Different users may have different delivery modalities.In order to take into account the delivery means and the delivery time,we formalise DeliData asDeliData=(DelMode×T imeMode).(4) The delivery mode contains the specification of which means should be used to deliver information,how the delivered information should look like and the destination address.More formally:DelMode=(DelMeans×Layout×Destination).(5) The user can choose to be notified using one of the delivery means available,like e-mail,web page,phone,fax,etc.Since the potential users of a digital library like NCSTRL are scientist,e-mail or web page is adequate.In the former case an e-mail,formatted accordingly the layout preferences,is sent to the address speci-fied in the destinationfield.In the latter case,retrieved documents are published in the web page identified by the destinationfield and formatted accordingly the layout preferences.The layout specification may contain preferences about e.g.the colors and fonts to be used,and preferences about the information to be included for each relevant document found(e.g.title,abstract,authors,key-words,etc.).The destination specification is an address identifier that depends on the delivery means.The time mode specifies when to deliver.We will consider basically a con-dition like“new document found”and“updated document”associated with a delivery time.The deliver time can be afixed time interval(e.g.every day at9 am)or“as soon as possible”.Formally we have:T imeMode=(NewDoc×UpdatedDoc×T ime)NewDoc=(yes+no)(6)UpdatedDoc=(yes+no)T ime=(T imeInterval+asap),where T imeInterval is defined accordingly to the Unix OS crontabfile.It is worth noting that the formalisation of DeliData establishes that a user has an unique delivery modality.We may enhance the schema by allowing a delivery modality,for each user topic–er interest.This is,for instance, required to model cases like“upload the proceedings of ECDL to my ftp server, while send me the abstracts of papers aboutfiltering systems by e-mail”.In order to take this into account we may formalise DeliData as follows:DeliData=T opicID→(DelMode×T imeMode).(7)Actions Data.The actions data category is a sequence of pairs each represent-ing an action performed on a certain document.As actions are typically used for coding user’s relevance feedback within one of his topics of interest,we formalise ActData as follows:ActData=T opicID→(Action×DocumentID)∗(8)Action=(read+relevant+notrelevant)and DocumentID is the identifier of a document notified to the user(a URI). The action identifiers will be used according to the following meanings: read:the user looked at the full text of the documentrelevant:the user judged the document as relevantnot relevant:the user judged the document as not relevantOf course,other actions may be included as well.It’s beyond the scope of this paper to further detail how the actions data may be used for relevance feedback analysis.Security Data.As users subscribing to a service agree on its privacy prac-tices(see,e.g.[14]),the simple privacy maintenance mechanism we adopt is to specify in the security data category which on-line services may access the user’s information.It is basically a list of the hosts that are authorized to ask for information contained in the user’s profile.SecData=(HostName)∗.(9) 3.2TopicsAs specified in Section3.1,a user may have several topics of interest and a topic specifies what to gather.Accordingly to Section2.2,we define T opic asT opic=(T opicName×DocContent×DocStruct×DocSource).(10) The document content category contains the information that allows the system to recognise documents relevant to a topic from a document content point ofview.In digital libraries,the content of a document is described by means of its title,its textual description(the abstract or summary),a list of relevant keywords and a list of standard categories(e.g.the ACM categories)and its language.We formalise this asDocContent=(T itle×T extualDescr×Keywords×Categories×Languages).(11) The document structure category contains information that allows the system to eliminate candidate documents according to their structural properties.Doc-uments in digital libraries can be stored in differentfile formats and they can be different types of documents(e.g.book,technical report,scientific article). Moreover,documents have a publication date and,in case of a paying service, they can have a price.The DocStruct category is defined as follows:DocStruct=(F ileF ormat×T ype×P ublicationDate×P rice)F ileF ormat=(all+postscript+pdf+html+...)∗(12)T ype=(all+book+technicalreport+journalarticle+...)∗.The all is used in order to specify allfile formats or all document types.A system should eliminate unwanted documents by considering the informa-tion about the source of a document.The document source category is intended to provide a conceptual information that specifies from where to gather docu-ments.We model DocSource as follows:DocSource=(AllowSources×DenySources)AllowSources=(Sources)(13)DenySources=(Sources)Sources=(Collection∗×P ublisher∗×Series∗×Author∗).The all value is used to indicate all collections,all publishers,all series or all authors.The deny list contains sources that should not be considered while the allow list those that should be considered.4ArchitectureIn this section we will show how an existing digital library may simply be ex-tended in order to provide a new service:to alert automatically a user when a new document,matching the user’s profile,is available in the digital library.There are basically two different possibilities to implement the above func-tionality which we call pull modality and push modality.In the former case the profile is used in order to generate a query based on it and submit the query to the native information retrieval engine of the digital library.In the latter case, any new incoming document is matched against all available profiles in order to select those which the document is relevant for.The two possible corresponding architecture are depicted in Fig.2and Fig.3.Fig.2.Pull modalityFig.3.Push modalityThe profile manager and the deliverer component are common to both ap-proaches.The profile manager mainly maintains the user profiles.It allows users and authorized components to modify a user profile and send profiles or portion of it to authorized components that request them.The deliverer component is responsible for delivering according to user’s delivery preferences.In the pull modality,the scheduler component at scheduled times,depending on the profile preferences,generates queries based on the profiles content and submit them to the built-in information retrieval engine of the digital library. From the result list we have to consider only those documents which have not yet been delivered to the user.The obtained list is returned to the delivery component.It is worth noting that this solution may be applied to any existing digital library as ideally no modifications are needed to existing systems.The pull module could be customized for different digital libraries just defining for the scheduler component ad-hoc wrappers that translate profiles into queries.。
外文核心期刊简介
外文核心期刊简介1、《科学计量学》（双月刊）（Scientometrics. 1978, Amstendam : Elsevier Scientific Pub..co.）本刊是由匈牙利出版的一份权威性的国际期刊，主要刊载科学计量学领域的研究论文、短讯和评论。
为介绍科学计量研究方法、开展不同学术观点的争鸣提供了最广泛的国际环境，因刊载许多计量学的研究性文章，受到了图书馆和情报学专家的特殊重视。
2、《情报处理与管理》（双月刊）http://www.elsevien.nl（Information Processing & management 。
1975~ Oxford: Pergamon Press.）本刊是图书馆学情报学领域一份重要的国际科学期刊，研究情报学的产生、组织、存储、检索、传递及利用，涉及情报科学、计算机科学、认知科学等相关学科。
内容包括基础理论与应用研究、具体讨论检索技术的文本处理、专家系统、人机界面、多媒体技术、数据处理与评价技术以及情报网络管理等方面的问题。
继承：《Information Storage and Retrieval》《情报存储与检索》吸收：Information Technology《情报技术》E-mail: nlinfo-f@elsevier.nl3、《情报学杂志》（双月刊）(Journal of Information, 1979~, Amsterdam : Published for the Insititute of InformationScientists by the Worth-Holland Pub. Co.)本刊内容涉及有关情报学各方面的理论与实践，包括知识与知识交流、情报源，情报管理，情报传播、情报技术的创新与转让等，涉及数字、语言和经济学等学科知识，编委会由世界各地的专家学者组成。
因此，影响较大，其中一些文章被认为是情报学的权威之作。
国外英语论文网站
国外英语论文网站Worcester Polytechnic Institute/Pubs/ETD/伍斯特工学院:包括670余篇学位论文，其中有550多篇全文，硕士论文4篇。
涵盖生物、电子、计算机、材料、物理、机械等学科。
The university of Nottingham/诺丁汉大学的论文数据库。
含131篇免费硕博论文，涵盖医学、艺术、教育、法学、工学等学科。
Australian Digital Theses Program.au澳洲数字论文计划，由澳洲大学图书馆员协会发起。
包含澳洲40余所大学的15440篇硕博论文，涵盖各个学科。
University of South Florida/cgi-bin/ETD-db/ETD-...D-search/search南佛罗里达大学的989篇电子版博硕论文，涵盖地理学、医学、电子学等学科的内容。
其中绝大部分可以在线免费获取全文。
Virginia Commonwealth University/ETD-db/ETD-search/search弗吉尼亚公共资产大学的768篇博硕论文，包括化学、生物、医学、会计学、艺术、语言、工学、教育等学科。
其中614篇可以在线免费获取全文。
The Pennsylvania State University's electronic Theses and Dissertations Archives/ETD-db/ETD-search/search宾夕法尼亚州大学电子论文库，包含1848篇全文，涵盖材料学、教育学、工学、法学、医学、航空、经济、化工、建筑等各个学科。
可在线免费获取。
North Carolina State University/ETD-db/ETD-search/search北卡罗来纳州州立大学的3937篇免费博硕论文，涵盖了化学、物理学、电子电气、核能、机械、材料、食品、林业、土壤等各学科。
University of Pretoria : Electronic Theses and Dissertationshttp://upetd.up.ac.za/比勒陀利亚大学的电子学位论文，含3000多篇电子博硕论文，涵盖社会学、食品、建筑、经济、信息、生化、教育、管理、心理学、法学等学科，其中2876篇可免费获取全文。
主要电子图书数据库网址一览
4
主要电子期刊数据库/网络资源
OA期刊:
Hirewire免费电子期刊
DOAJ (Directory of Open Access Journals ) 中国科技论文在线
5
统计数据
infobank(高校财经数据库) EPS全球统计数据/分析平台 中宏教研支持系统 CNKI数字搜索 CNKI数字搜索统计网站导航 中国统计信息网 北京教育网 UNESCO Institute for Statisties Your Nation
综合搜索引le
Yahoo！ Alta Vsita Ask Jeeves Dogpile ……
天网
微软bing
……
1
主要电子期刊数据库/网络资源
中国期刊全文数据库(CNKI)
万方数据库——数字化期刊数据库
中文科技期刊数据库(维普资讯)(calis镜像) 龙源电子期刊阅览室 人大复印报刊资料数据库（用户名/密码:BJSFDX）
18
年度资料——年鉴
中国年鉴全文数据库(CNKI)
infobank(高校财经数据库)
WorldAlmanac (OCLC FirstSearch)(并发用户14个)
19
学术搜索引擎—— Scholar Search Engines
Google Scholar（学术搜索）
全国报刊索引
中文社会科学引文索引（CSSCI学校中英文图书数字化国际合作计划（CADAL） 中国博士学位论文全文数据库(CNKI) 中国优秀硕士学位论文全文数据库(CNKI) 万方数据库——中国学位论文全文数据库 CALIS学位论文中心服务系统
常用英文文献库入口与使用方法(工学方向)
常用英文文献库入口与使用方法（工学方面）hzjhzj20042005-3-24版权归小木虫论坛与作者所有，转载请注明。
前言目前，中国各个大学的研究生教育扩招迅猛，各研究生对外文资料的需求猛增，为使广大虫友对各个英文文献库有一个系统全面的认识，本人对几个常用的英文文献库作一罗列，希望对大家有所帮助。
此次介绍的数据库主要包括美国、英国、德国和荷兰几个国家的常用工科数据库。
有的地方可能讲得不太全面，请大家批评指正。
外文文献库还有很多，这里只例举了常用的九种，还有很多，如：OVID、KARGER、CELL等等，这就靠广大虫友们去总结与体会了，希望本课件能起到抱砖引玉的作用。
祝广大虫友学业有成，谢谢大家，在此向每日辛勤在小木虫岗位上的管理员、各位超版和版主，以及VIP和广大虫友们表示敬意，也祝我们的小木虫能百日杆头，更进一步。
一、 美国IEEE (英文文献期刊)（1）简介：EEE（Institute of Electrical & Electronics Engineers）是电子信息领域最著名的跨国性学术团体，其会员分布在世界150多个国家和地区。
据IEEE统计，IEEE会员总数2001年比2000年增加3.1%，达到377342人，其中学生会员为65669人，增长12.6%。
随着人们的信息越来越多地来自Internet，IEEE需要为会员提供更加完善和全面的电子信息产品和服务。
IEEE应成为IEEE会员获得信息的首选之地。
IEEE必须识别正确的信息，并提供对它们的访问方法。
实现这个目标的重要一步是通过IEEE Xplore与IEEE/IEE Electronic Library (IEL)连接。
IEL包括了1988年以来IEEE和IEE的所有期刊杂志和会议录，以及IEEE 的标准，可以通过题目、关键词和摘要进行查阅。
（2）网址：/Xplore/DynWel.jsp，如图所示：（3）进入方法：可以通过网上搜索的用户名与密码进入进行获取资料;也可以从网上的论坛或网上代理公布的网站搜索代理，并用代理猎手进行验证，经IEEE验证FREE的，就可以用了。
英语国际会议
1 Keynote Sessions 2 Oral Sessions 3 Poster Sessions 4 Research-in-Progress Sessions 5 Discussion/Question & Answer Session
2
Session Modes
Keynote Sessions:
1
Organizers and Committees
The Secretary :
To introduce the chair to audience,and distribute times.
To circulate the program and publish the preprints and proceedings of presented papers or abstract.
Organizer and Sponsor :
To select venue,assemble speaker,chair,parties,etc.
To manage the event and decide the subject or subjects to be presented.
To plan everything for the meeting and to brief the selected chair,secretary and staff.
and answer). G Sample G • Run in a single-track format.
Q&A
1 How many kinds of Organizers and Committees?And what are them? 2 How many kinds of Session Modes?And what are them?
硕士毕业论文开题报告模板
人学出版社，1992年版。
12.伍贻康、周建平等:《欧洲经济共同体》，人民出版社1983年版。
13.胡瑾等:《欧洲早期一体化思想与实践研究(1945一1967)》，山东人民出版社，2000年版。
14.田德文、靳雷：《为什么偏偏是英国》，北京：世界知识出版社，1999年版。
（四）、参考资料：
中文书籍：
1.钱乘旦、陈晓律：《英国文化模式溯源》，上海：上海社会科学出版社，2003年版。
2.王振华主编：《英国》，北京：社会科学文献出版社，2011版。
3.陈乐民主编：《战后英国外交史》，北京：北京世界ቤተ መጻሕፍቲ ባይዱ识出版社，1994年版。
4.陈乐民:《战后西欧国际关系，1945一1984》，中国社会科学出版社1987年版。
3.Charles Grant,Cameron’sEurope:Can the Conservatives achieve their EU objectives?,这篇文章分析了卡梅伦政府的对欧政策。
4.P.J.Marshall，British Empire，这本书涵盖了从美利坚革命到20世纪英帝国没落的各个时期，评价了英帝国的影响，既为了英帝国统治的人民，也为了大不列颠人民自己。本书的第四章详细的叙述了冷战后英帝国转向欧洲的历程，和人民的认知。
8.陈乐民，《战后英国外交史》，书中侧重对英美特殊关系的脉络进行了梳理。
9.计秋枫，冯梁，《英国文化与外交》，书中在梳理英国战后外交的同时侧重英国在英美特殊关系立场，分析了英美特殊关系的起源，发展等等。
10.马胜利，邝杨，《欧洲认同研究》，书中提出了“欧洲模式”的概念，并运用实证分析的方式，对欧洲青年人对欧洲的认同进行了调查和分析。
国际图书分类号查询--国际十进制分类简表
国际图书分类号查询--国际十进制分类简表0 Generalities 总论00 Prolegomena. Fundamentals of Knowledge and Culture 绪论、知识与文化、基础原理004 Computer science 计算机科学005 Management 管理学01 Bibliography 书目、目录02 Librarianship 图书馆学030 Encyclopaedias. General Reference Works 综合参考资料050 Serial Publications. Periodicals 连续出版物、期刊06 Organizations and Associations 组织与协会069 Museums 博物馆070 Newspapers. Journalism 报纸、新闻学08 Polygraphies. Collective Works 多图作品、集体作品09 Manuscripts. Rare and Remarkable Works手稿、珍本、善本1 Philosophy. Psychology 哲学、心理学101 Nature and role of Philosophy 哲学本质与角色11 Metaphysics 形而上学13 Philosophy of mind and spirit 心理与精神的哲学14 Philosophical systems 哲学体系159.9 Psychology 心理学16 Logic. Epistemology. Theory of Knowledge 逻辑、认识论、知识论、方法论17 Moral Philosophy. Ethics 道德、伦理、实践哲学2 Religion. Theology 宗教、神学21 Prehistoric and Primitive Religions 史前与原始宗教22 Religions of The Far East 远东发祥的宗教23 Religions of The Indian Subcontinent. Hinduism. Jainism. Sikhism 印度次大陆发祥的宗教、印度教、耆那教、锡克教24 Buddhism 佛教25 Religions of Antiquity. Minor Cults and Religions 古代宗教、异教252 Religions of Mesopotamia 美索不达米亚宗教254 Religions of Iran 伊朗宗教257 Religions of Europe 欧洲宗教26 Judaism 犹太教27 Christianity 基督教271 Eastern church 东方教会272/279 Western Church西方教会272 Roman Catholic church 天主教274/278 Protestant churches 新教教会28 Islam 伊斯兰教282 Sunnite Islam 逊尼派284 Shi'ite Islam 什叶派285 Babi-Baha'I巴比巴哈伊29 Modern Spiritual Movements 现代精神运动3 Social Sciences 社会科学304 Social questions. Social practice.社会问题、社会实践308 Sociography. Descriptive studies of society 社会地理学、社会的描述性研究311 Statistics 统计科学、统计理论314 Demography 人口统计学316 Sociology 社会学32 Politics 政治321 Forms of political organization. States as political power 政治组织形式、国际政治权利323 Home affairs. Internal policy 民政事务、内政324 Elections. Plebiscites. Referendums 选举、公民投票、全民公决327 International relations 国际关系328 Parliaments. Congresses. Representation of The people. Governments 议会、国会、国民代表、政府329 Political parties and Movements 政府和运动33 Economics 经济、经济学331 Labour. Employment. Work. Labour Economics. Organization of labour.劳动力、就业、工作、劳动经济学、劳动组织336 Finance金融338 Economic policy. Management of The economy. Production. Services. Prices经济政策、经济管理、生产、服务、价格339 Trade. Commerce. International economic relations. World economy 贸易、商业、国际经济关系、世界经济34 Law. Jurisprudence法律、法学341 International law 国际法342 Public law. Constitutional law. Administrative law公共法、宪法、行政法343 Criminal law 刑法、刑事罪343.9 Criminology犯罪学347 Civil law民法35 Public Administration. Government公共管理、政府、军事352/354 Levels of administration. Local, regional, central administration各级行政、本地、区域、中央行政355/359 Military Science 军事科学36 Safeguarding The Mental and Material Necessities of Life社会保障364 Social Welfare社会福利368 Insurance. Communal provision through sharing of risk保险、通过公用经费分担风险37 Education 教育371 Organization of educational and training system. School organization 普通教育学校374 Education and training out of school. Further education校外教育与培训、继续教育378 Higher education. Universities. Academic study高等教育、高校、学术研究379.8 Leisure休闲39 Ethnology. Folklore 民族学、民俗学391 Costume 传统服饰392 Customs, manners, usage in private life风俗、举止、私人生活习惯393 Death. Treatment of corpses. Funerals. Death rites死亡、尸体处理、葬礼、死亡仪式394 Public life. Social life. Life of The people公众生活、盛况、社交活动、民间生活395 Social ceremonial. Etiquette. Good manners社交礼仪、礼节、文明礼貌、社会形态、等级、头衔398 Folklore in The strict sense.民俗学（严格意义）396 Feminism 女权主义5 Mathematics and Natural Sciences 数学、自然科学502/504 Environmental Sciences. Conservation of natural resources. Threats to The environment and protection 环境科学、自然资源保存、环境威胁与保护51 Mathematics 数学52 Astronomy 天文学528 Geodesy, cartography大地测量学、测量学、摄影测量、遥感、制图529 Chronology 大事年表53 Physics物理54 Chemistry化学、结晶学、矿物学548 Crystallography晶体学549 Mineralogy矿物学55 Earth Sciences地球科学、地质学551.5 Meteorology. Climatology气象学、气候学551.7 Stratigraphy 历史地质学、地层地质学552 Petrology 岩石、岩石学553 Economic geology 经济地质学、矿床556 Hydrology 水圈、水文学56 Palaeontology 古生物学57 Biological Sciences 生物学572 Anthropology 人类学573 General biology普通理论生物学574 Ecology 生态学575 Genetics 遗传学576 Cytology 细胞学577 Biochemistry. Biophysics 生物化学、生物物理578 Virology 病毒学579 Microbiology 微生物学58 Botany 植物学59 Zoology 动物学6 Applied Sciences. Medicine. Technology 应用科学、医学、科技61 Medicine 医学619 Veterinary medicine 动物医学62 Engineering. Technology in General工程学、科技总论621 Mechanical engineering 机械工程621.3 Electrical engineering 电气工程621.38 Electronics 电子学622 Mining 采矿623 Military engineering 军事工程624 Civil engineering 土木工程625.1/.5 Railway engineering 铁路、电车、索道625.7/.8 Highway engineering 公路工程626/627 Hydraulic engineering 水利工程628 Public health engineering 公共卫生工程629 Vehicle engineering 车辆工程63 Agricultural Sciences 农业及其相关科学与技术、林业学630 Forestry 林学631/634 Farm management. Plant husbandry 农场管理、农艺学635 Horticulture 园艺学636/638 Animal husbandry 畜牧业639 Hunting. Fishing 狩猎、钓鱼、养鱼64 Home Economics 家政学641/642 Cookery 烹饪643/649 Household equipment and management 家庭设备与管理65 Management管理651 Office management 办公管理654 Telecommunications 通信与遥控655 Printing. Publishing. Book Trade 印刷、出版、图书贸易656 Transport and Postal Services 运输与邮政服务657 Accountancy 会计659 Publicity. Advertising. Public relations 宣传、公共关系66 Chemical Technology 化工技术669 Metallurgy 冶金67/68 Industries, Crafts and Trades 各种工业、贸易与手工艺69 Building 建筑7 The Arts 艺术71 Regional Planning 区域规划72 Architecture 建筑学73 Plastic Arts 雕塑艺术74 Drawing 绘画、设计、应用艺术与手工艺745/749 Applied Arts 应用艺术75 Painting 漆画76 Graphic Arts 图形艺术、图形77 Photography 摄影78 Music 音乐79 Recreation. Entertainment. Games. Sport 休闲、娱乐、游戏、体育791 Cinema. Films (Motion Pictures) 电影院、电影（动态影像）792 Theatre 戏剧793 Dance 舞蹈794 Board and table games 桌游、棋盘游戏796/799 Sport 体育8 Language. Linguistics. Literature 语言、语言学、文学80 Philology 语言学与文学、语言学81 Linguistics 语言学与语言811 Individual languages 语言82 Literature 文学821 Literature of individual languages 语言文学和语系文学9 Geography. Biography. History 地理、传记、历史902 Archaeology 考古学903 Prehistory 史前、史前遗迹、文物、古迹904 Cultural remains of historical times 历史年代的文化遗迹908 Area Studies 区域研究、地方研究91 Geography 地理学、地球与国家探索、旅游、区域地理929 Biography 传记及相关研究929.5 Genealogy 家谱929.6 Heraldry 纹章93/99 History 历史930 Science of history. Ancillary historical Sciences 历史学、史学930.1 History as a science. Theory and Philosophy of history历史作为一门科学、历史的理论和方法论930.25 Archivistics. Archives. Public records档案学（包括公共和其他档案）930.27 Epigraphy. Palaeography 碑铭学、古文字学94 General History 通史94(100) History of The world 世界历史94(3) History of The ancient world 远古时代历史94(4) History of Europe 欧洲历史94(5) History of Asia 亚洲历史94(6) History of Africa 非洲历史94(7/8) History of The Americas 美洲历史94(9) History of Oceania, The Polar regions, Australasia, etc.大洋洲、极地地区、澳大利西亚历史等注：更加细致的国际图书分类法UDC中文版查询地址：。
外文文献下载网站
开题报告主要包括以下几个方面：（一）论文名称论文名称就是课题的名字第一，名称要准确、规范。
准确就是论文的名称要把论文研究的问题是什么，研究的对象是什么交待清楚，论文的名称一定要和研究的内容相一致，不能太大，也不能太小，要准确地把你研究的对象、问题概括出来。
第二，名称要简洁，不能太长。
不管是论文或者课题，名称都不能太长，能不要的字就尽量不要，一般不要超过20个字。
（二）论文研究的目的、意义研究的目的、意义也就是为什么要研究、研究它有什么价值。
这一般可以先从现实需要方面去论述，指出现实当中存在这个问题，需要去研究，去解决，本论文的研究有什么实际作用，然后，再写论文的理论和学术价值。
这些都要写得具体一点，有针对性一点，不能漫无边际地空喊口号。
主要内容包括：⑴研究的有关背景(课题的提出)：即根据什么、受什么启发而搞这项研究。
⑵通过分析本地（校）的教育教学实际，指出为什么要研究该课题，研究的价值，要解决的问题。
（三）本论文国内外研究的历史和现状（文献综述）。
规范些应该有，如果是小课题可以省略。
一般包括：掌握其研究的广度、深度、已取得的成果；寻找有待进一步研究的问题，从而确定本课题研究的平台(起点)、研究的特色或突破点。
（四）论文研究的指导思想指导思想就是在宏观上应坚持什么方向，符合什么要求等，这个方向或要求可以是哲学、政治理论，也可以是政府的教育发展规划，也可以是有关研究问题的指导性意见等。
（五）论文写作的目标论文写作的目标也就是课题最后要达到的具体目的,要解决哪些具体问题，也就是本论文研究要达到的预定目标：即本论文写作的目标定位，确定目标时要紧扣课题,用词要准确、精练、明了。
常见存在问题是：不写研究目标；目标扣题不紧；目标用词不准确；目标定得过高, 对预定的目标没有进行研究或无法进行研究。
确定论文写作目标时，一方面要考虑课题本身的要求，另一方面要考率实际的工作条件与工作水平。
（六）论文的基本内容研究内容要更具体、明确。
英语作文-图书馆的数字化资源开放与知识共享
英语作文-图书馆的数字化资源开放与知识共享In the realm of knowledge and information, libraries have long stood as venerable institutions, guardians of wisdom accumulated over centuries. Yet, as we sail further into the digital age, these repositories of learning are undergoing a profound transformation. The digitization of library resources and the open sharing of knowledge are not just trends but revolutionary steps towards democratizing education and information.The digital revolution has ushered in an era where access to information is no longer confined to physical boundaries. Digital resources in libraries, encompassing ebooks, online journals, databases, and multimedia content, have become pivotal in extending the reach of knowledge. These resources, accessible from any corner of the world, empower individuals with the ability to learn, research, and explore without the limitations of location or time.The open sharing of knowledge, facilitated by digital libraries, aligns with the ethos of education as a communal resource. It fosters a culture of collaboration and continuous learning. Scholars, students, and curious minds alike can contribute to and benefit from the shared pool of intellectual wealth. This collective approach not only enriches individual understanding but also propels academic and scientific advancements.Moreover, the digitalization of library resources serves as a bridge over the digital divide, offering equal opportunities for all to access information. It is particularly beneficial for those in remote or underprivileged areas, who may not have the means to visit a physical library. The open sharing of knowledge thus becomes a tool for social equity, enabling every individual to partake in the global conversation and advancement.The transition to digital resources also reflects an environmental consciousness, reducing the need for paper and the physical space required to house vast collections. This shift not only conserves natural resources but also enhances the efficiency of information retrieval and management. With advanced search capabilities and metadata,finding relevant information has become a matter of seconds, streamlining the research process and encouraging a more dynamic interaction with knowledge.However, this digital leap does not come without challenges. Issues of copyright, data privacy, and the digital preservation of materials are at the forefront of discussions. Ensuring equitable access while protecting intellectual property rights requires a delicate balance and ongoing dialogue among stakeholders. Libraries are thus evolving into not just centers of information but also hubs of ethical discourse on the stewardship of knowledge in the digital age.In conclusion, the digitization of library resources and the open sharing of knowledge are transformative forces reshaping the landscape of education and information. They reflect a commitment to the ideals of accessibility, collaboration, and sustainability. As we continue to navigate the complexities of this digital transformation, it is imperative that we uphold these principles, ensuring that the library remains a beacon of knowledge for generations to come.This essay encapsulates the essence of the digital evolution within libraries and its impact on knowledge sharing. It strives to maintain a consistent tone, fluid narrative, and logical coherence throughout, adhering to the guidelines provided. The digitalization of libraries is not merely a technological upgrade but a cultural shift towards a more inclusive and interconnected world of learning.。
图书馆还有工作吗英语作文
In the modern era,the role of libraries has evolved significantly.While they have traditionally been places for quiet study and access to books,they now offer a variety of services and resources that extend well beyond the printed page.The Importance of Libraries in Todays WorldLibraries remain vital community hubs where people of all ages can access information and knowledge.They provide a space for learning,research,and personal development. Here are some reasons why libraries are still essential in the digital age:1.Access to Information:Libraries offer a wealth of information,including books, journals,and databases that may not be readily available online or are too expensive for individuals to purchase.2.Digital Literacy:With the rise of technology,libraries have become centers for digital literacy,teaching patrons how to use computers,access the internet,and navigate digital resources.munity Programs:Libraries host a variety of community programs,such as reading clubs,workshops,and lectures,which foster a sense of community and provide opportunities for social interaction.cational Support:They serve as an educational support system,offering resources for students and lifelong learners,including study spaces,tutoring services,and access to educational materials.5.Cultural Preservation:Libraries play a crucial role in preserving cultural heritage through the collection and archiving of historical documents,local history,and other cultural artifacts.6.Inclusive Spaces:They are inclusive spaces that cater to diverse populations,including those with disabilities,by providing accessible facilities and materials.7.Job Assistance:Many libraries offer job search assistance,including access to job databases,resume writing help,and interview preparation.8.Quiet Spaces:In a world filled with distractions,libraries provide quiet spaces for contemplation,study,and focus.The Future of LibrariesAs technology continues to advance,libraries are adapting to meet the changing needs of their communities.They are integrating more digital resources,such as ebooks and online journals,while also maintaining their traditional collections.Additionally,libraries are exploring new ways to engage with their patrons,such as through social media,virtual events,and digital storytelling.ConclusionDespite the prevalence of digital resources,libraries continue to play a crucial role in society.They are not just repositories of books but are dynamic,evolving spaces that contribute to education,community engagement,and cultural preservation.As we look to the future,its clear that libraries will continue to be essential places of learning and growth for generations to come.。
- 1、下载文档前请自行甄别文档内容的完整性，平台不提供额外的编辑、内容补充、找答案等附加服务。
- 2、"仅部分预览"的文档,不可在线预览部分如存在完整性等问题,可反馈申请退款(可完整预览的文档不适用该条件!)。
- 3、如文档侵犯您的权益，请联系客服反馈,我们会尽快为您处理(人工客服工作时间：9:00-18:30)。
Library Of The Present: Communal Information In Physical Space
By Jesse Ganes | August 6, 2011
© Iwan Baan
The Internet is now the library of the past. Where the public library has historically served as the primary source of information gathering and dissemination, we now look to this new virtual, infinitely large library that can be accessed anywhere at any time as the Library of the present.
As a result, the primary roles of today’s physical libraries h ave shifted. Libraries of the past focused primarily on individualized information consumption. Communal aspects of interaction and information dissemination now represent the core mission of the library when information is more easily accessible. The silent grand beaux-arts reading rooms of New Y ork or Boston have of the past been transformed into flexible communal “living rooms” in Seattle.
Like us on Facebook
© / Thomas Claveirole
© / Fernando Herrera
Community Driving Design
This new purpose is deeply considered in library design today. Recent library designs such as Tama Art University Library (Toyo Ito), Musashino Art University Museum & Library (Sou Fujimoto), and Steven Holl’s planned Queens Library at Hunterspoint all aim to provide spaces of communal interaction that would bring the patrons of each library together in different ways.
© Iwan Baan
The snake-like tables of Ito’s Tama Art University Library coupled with its panoramic open views to the exterior go a long way in fostering a community atmosphere extends into the library from the surrounding campus. The forest-like arches that support the building and divide interior space create a spectrum of individual and communal spaces based on their density. The low curvilinear bookshelves on the second floor are placed not to optimize the number of books stored but rather
to create corridors of varying width that allow for the insertion of communal sitting areas within the stacks.
© Iwan Baan
© Daici Ano
In Sou Fujimoto’s Musashino Art University Museum & Library, community space exists interstitial to the bookshelves of the library. The wrapping bookshelf-walls exist in a spiraling fashion where information is accessed from them and then brought into the voids created by them
to be shared, absorbed, and disseminated with others. V oids within the walls allow one to view into the center of the library and see the way in which media is being accessed and shared.
© Sou Fujimoto
© Steven Holl
Section is the primary factor in demarcating communal space in Steven Holl’s proposed Queens Library at Hunterspoint. The stepped stacks and reading areas that exist within the main volume of the building overlook both the Manhattan skyline across the east river and a central entry area that contains the primary gathering area. Holl sees the building as being pourous in its relationship to
Manhattan and in the way in which it exists in relationship to the community.
© Steven Holl
References: Wikipedia, Tama Art University Library, Musashino Art University Museum & Library, Queens Library at Hunters Point
Photographs: Iwan Baan, Flickr: Thomas Claveirole, Flickr: Fernando Herrera, Daici Ano, Sou Fujimoto, Steven Holl
Library Of The Present: Communal Information In Physical Space originally appeared on ArchDaily, the most visited architecture website on 06 Aug 2011.。