Modality and databases
- 格式:pdf
- 大小:542.37 KB
- 文档页数:21
单词汇总(数据库专业一点的词汇其实主要就是每章后面review items的内容,在这里简单列一下,如果你实在没时间看书,至少这些单词要熟悉.):1. 数据库系统:database system(DS),database management system(DBMS)2.数据库系统(DS),数据库治理系统(DBMS )3. 关系和关系数据库table= relation , column = attribute 属性,domain, atomic domain, row= tuple ,relational database, relation schema, relation instance, database schema, database instance;4.表=关系,列=属性属性,域,原子域,排二元组,关系型数据库,关系模式,关系实例,数据库模式,数据库实例;1. key 们:super key, candidate key, primary key, foreign key, referencing relation, referenced relation;2.超码,候选码,主码,外码,参照关系,被参照关系5.关系代数(relational algebra): selection, project, natural join, Cartesian product, set operations, union, intersect, set difference( except\minus), Rename, assignment, outer join, grouping, tuple relation calculus6.(关系代数):选择,工程,自然连接,笛卡尔积,集合运算,集,交集,集合差(除负),重命名,分配,外连接,分组,元组关系演算7.sql组成:DDL :数据库模式定义语言,关键字:createDML :数据操纵语言,关键字:Insert > delete、updateDCL :数据库限制语言,关键字:grant、removeDQL :数据库查询语言,关键字:select8.3.SQL 语言:DDL , DML , DCL , QL , sql query structure, aggregate functions, nested subqueries, exists(as an operator), unique(as anoperator), scalar subquery, assertion, index(indices), catalogs, authorization, all privileges, granting, revoking , grant option, trigger, stored procedure, stored function4.SQL语言:DDL , DML , DCL , QL , SQL查询结构,聚合函数,嵌套子查询,存在(如运营商),独特的(如运营商),标量子查询,断言指数(指数),目录,授权,所有权限,授予,撤销,GRANT OPTION ,触发器,存储过程,存储函数9. 表结构相关:Integrity constraints, domain constraints, referential integrity constraints10.完整性约束,域名约束,参照完整性约束5.数据库设计(ER 模型):Entity-Relationship data model, ER diagram, composite attribute, single-valued and multivalued attribute,derived attribute, binary relationship set, degree of relationship set, mapping cardinality, 1-1, 1-m, m-n relationship set (one to one, one to many, many to many), participation, partial or total participation, weak entity sets, discriminator attributes, specialization and generalization6.实体关系数据模型,ER图,复合属性,单值和多值属性,派生属性,二元关系集,关系集,映射基数的程度,1-1, 1-米,MN关系集合(一对一,一对多,多对多),参与局部或全部参与,弱实体集,分辨符属性,特化和概化11. 函数依赖理论:functional dependence, normalization, lossless join (or lossless) decomposition,First Normal Form (1NF), the third normal form (3NF), Boyce-codd normal form (BCNF), R satisfies F, F holds on R, Dependency preservation 保持依赖,Trivial, closure of a set of functional dependencies 函数依赖集的闭包,closure of a set of attributes 属性集闭包,Armstrong 's axioms Armstrong 公理,reflexivity rule 自反律,augmentation rule,增广率, transitivity 传递律,restriction of F to R i F 在Ri 上的限定,canonical cover 正那么覆盖, extraneous attributes 无关属性,decomposition algorithm 分解算法.7.函数依赖,标准化,无损连接〔或无损〕分解,第一范式〔1NF〕,第三范式〔3NF〕 BC范式〔BCNF〕, R满足F, F持有R,依赖保存,平凡,一组函数依赖封闭,一组属性,8. 事务:transition, ACID properties ACID特性,并发限制系统concurrency control system,故障恢复系统recovery system,事务状态transition state,活动的active,局部提交的partiallycommitted,失败的failed,中止的aborted,提交的committed,已结束的terminated,调度schedule,操作冲突conflict of operations, 冲突等价conflict equivalence,冲突可串彳f化conflictserializablity ,可串行化顺序serializablity order,联级回滚cascading rollback,封锁协议lockingprotocol ,共享〔S〕锁shared-mode lock 〔S-lock〕,排他〔X〕锁exclusive -mode lock 〔X-lock〕, 相容卜i compatibility,两阶段封锁协议2-phase locking protocol,意向锁intention lock,时间戳timestamp, 恢复机制recovery scheme,日志log, 基于日志的恢复log-based recovery, 延迟的修改deferredmodification,立即的修改immediate modification,检查点checkpoint.数据库系统DBS Database System数据库系统应用Database system applications文件处理系统file-processing system数据不一致性data inconsistency——致性约束consistency constraint数据抽象Data Abstraction实例instance模式schema物理模式physical schema逻辑模式logical schema物理数据独立性physical data independence数据方^型data model实体-联系模型entity-relationship model 〔E-R〕关系数据模型relational data model基于对象的数据模型object-based data model半结构化数据模型semistructured data model数据库语言database language数据定义语言data-definition language数据操纵语言data-manipulation language查询语言query language元数据metadata应用程序application program标准化normalization数据字典data dictionary存储治理器storage manager查询治理器query processor事务transaction原子性atomicity故障恢复failure recovery并发限制concurrency-control两层和三层数据库体系结构two-tier/three-tier数据才2掘data mining数据库治理员DBA database administrator表table关系relation元组tuple空值null value数据库模式database schema数据库实例database instance关系模式relation schema关系实例relation instance码keys超码super key候选码candidate key主码primary key外码foreign key参照关系referencing relation被参照关系referenced relation属性attribute域domain原子域atomic domain参照完整性约束referential integrity constraint模式图schema diagram查询语言query language过程化语言procedural language非过程化语言nonprocedural language关系运算operations on relations选择元组selection of tuples选择属性selection of attributes自然连接natural join笛卡尔积Cartesian product集合运算set operations关系代数relational algebraSQL 查询语言SQL query structureSelect 字句select clauseFrom 字句from clauseWhere 字句where clause自然连接运算natural join operationAs 字句as clauseOrder by 字句order by clause相关名称 (相关变量,元组变量) correlation name (correlation variable , tuple variable ) 集合运算set operationsUnionInterestExcept空值null values真值"unknown " truth “ unknown 〞聚集函数aggregate functionsavg, min, max, sum, countgroup byhaving嵌套子查询nested subqueries集合比拟set comparisons{ «,? 二 ,〉〉,?=}{some , all}existsuniquelateral 字句lateral clausewith 字句with clause标量子查询scalar subquery数据库彳修改database modification删除deletion插入insertion更新updating参照完整性referential integrity参照完整T约束referential Hntegrity constraint 或子集依赖subset dependency 可延迟的deferrable断言assertion连接类型join types内连接和夕卜连接inner and outer join左外连接、右外连接和全外连接left、right and full outer joinNatural连接条件、using连接条件和on连接条件natural using and so on 视图定义view definition物化视图materialized views视图更新view update事务transactions提交commit work回滚roll back work原子事务atomic transaction完整性约束integrity constraints域约束domain constraints唯——性约束unique constraintCheck 字句check clause参照完整性referential integrity级联删除cascading delete级联更新cascading updates断言assertions日期和时间类型date and time types默认值default values索弓I index大对象large object用户定义类型user-defined types域domains目录catalogs模式schemas授权authorization权卜M privileges选择select插入insert更新update所有权限all privileges授予权卜M granting of privileges收回权卜M revoking of privileges授予权限的权限privileges to privilegesGrant option角色roles视图授权authorization on views执行授权execute authorization调用者权限invoker privileges行级授权row-level authorizationJDBCODBC预备语句prepared statements 访问元数据accessing metadata SQL 注入SQL injection 嵌入式SQL embedded SQL 游标cursors 可更新的游标updatable cursors 动态SQL dynamic SQL SQL 函数SQL functions 存储过程stored procedures 过程化结构procedural constructs夕卜部语言例程external language routines触发器triggerBefore 和after 触发器before and after triggers过渡变量和过渡表transition variables and tables递归查询recursive queries单调查询monotonic queries排名函数ranking functionsRankDense rankPartition by分窗windowing联机分析处理〔OLAP 〕 online analytical processing多维数据multidimensional data度量属性measure attributes维属性dimension attributes转轴pivoting数据立方体data cube切片和切块slicing and dicing上卷和下钻rollup and drill down交叉表cross-tabulation第七章实体-联系数据模型Entity-relationship data model实体和实体集entity and entity set属性attribute域domain简单和复合属T生simple and composite attributes单值和多值属T生single-valued and multivalued attributes空值null value派生属性derived attribute超码、候选码以及主码super key ,candidate key, and primary key联系和联系集relationship and relationship set二元联系集binary relationship set联系集的度degree of relationship set描述性属性descriptive attributes超码、候选码以及主码super key ,candidate key, and primary key角色role自环联系集recursive relationship setE-R 图E-R diagram映射基数mapping cardinality——对——联系one-to-one relationship——对多联系one-to-many relationship多对——联系many-to-one relationship多对多联系many-to-many relationship参与participation全部参与total participation局部参与partial participation弱实体集和强实体集weak entity sets and strong entity sets分辨符属性discriminator attributes标识联系identifying relationship特化和概化specialization and generalization超类和子类superclass and subclass属性继承attribute inheritance单和多继承single and multiple inheritance条件定义的和用户定义的成员资格condition-defined and userdefined membership 不相交概化和重叠概化disjoint and overlapping generalization全部概化和局部概化total and partial generalization聚集aggregationUMLUML 类图UML class diagram第八章E-R 模型和标准化E-R model and normalization分解decomposition函数依赖functional dependencies无损分解lossless decomposition原子域atomic domains第一范式(1NF) first normal form(1NF)合法关系legal relations超码super keyR 满足 F R satisfies FF在R上成立 F holds on RBoyce-Codd 范式BCNF Boyce-Codd normal form(BCNF)保持依赖dependency preservation第三范式(3NF) third normal form(3NF)平凡的函数依赖thivial functional dependencies函数依赖集的闭包closure of a set of functional dependenciesArmstrong 公理Armstrong s axioms属性集闭包closure of attribute setsF 在Ri 上的限定restriction of F to Ri正贝 1 覆盖canonical cover无关属T生extraneous attributesBCNF 分解算法BCNF decomposition algorithm3NF 分解算法3NF decomposition algorithm多值依赖multivalued dependencies第四范式(4NF) fourth normal form(4NF)多值依赖的限定restriction of a multivalued independency投影-连接范式(PJNF) project-join normal form(PJNF)域-码范式(DKNF ) domain-key normal form(DKNF)泛关系universal relation唯一角色假设unique-role assumption 去标准化denormalization。
XploreIntegrated image and data management product to support your drug & biomarker r esearch & discovery programTissue diagnostics and biomarker analytics are the keystones of cancer discovery. However, delivering on the promise of personalized medicine requires multiple data sources to be integrated and analyzed. Management and analysis of large volumes of tissue samples are crucial to realizing the potential of personalized medicine. To accomplish this, imaging and pathology informatics support will be essential to moving forward in an increasingly complex and multifaceted medical research environment.With the power of machine learning and the power of big data management tools, researchers can integrate data from multiple sources, including digital pathology and tissue imaging, enhancing their ability to glean critical insights into disease and identify novel biomarkers.Need for a cutting edge tool that addresses the problems of a modern tissue research laboratoryDigitizing slides will not automatically result in faster and more efficient research and investigative studies. There are several problems that a research product needs to address if digital pathology is to prove an effective tool for drug and biomarker discovery studies.• High volume of images: Virtual Slides – high quality images produced using a scanner – are typically several gigabytes in size. In the past, sharing these image files with colleagues has proven problematic due to their size and the lack of IT infrastructure supporting fast sharing and viewing of these images. Integrating tissue image archives across centers encourages multisite collaboration.• Vendor neutrality: There are few standards in digital pathology imaging, with over a dozen major scanning vendors, each typically using their own proprietary image file format. Each type of scanner usually has its own ‘Viewer’ (digital microscope) to look at these virtual slides. Pathologists therefore may require training with multiple different viewers in order to review all slides.• Multi-modality data management: Collating and organizing data from multiple data sources brings its own challenges. Data may all be stored in different files and across various locations.Spreadsheets, CSV/TSV files, LIMS, and in-house databases and applications are incapable of managing the quantity and variety of data that needs to be captured as part of a typical study.• Image analytics integration: Image analysis tools can quantify and qualify tissue cells and cell structures in a rapid and consistent manner. However, a range of image analysis applications is available– from commercial vendors, as well as in-house and openXploreTechnology backgroundersolutions. Managing slides that are used in multiple applications and the data produced by their algorithms can be difficult, due to limited interoperability.• TMA management: Tissue microarrays (TMAs) provide the means for high-throughput analysis of multiple tissues and cells. The issues involved in collating, organizing and associating data with whole sections of tissue is multiplied with a TMA, as a single TMA slide may contain 200 cores, each potentially representing a different patient. A TMA study of a single 20x10 block, with five stains, three scoring criteria per stain and two reviewing pathologists will result in six thousand ‘scores’. Mapping these scores to different patients, comparing scores and results, and identifying trends across different cohorts will be time-consuming and prone to human error. Data mining tools, detailed in the next section, are required to solve the challenges of conducting large biomarker investigative studies.• Cross study data management: Given the range and volume of datamentioned in the points above, and the high quantity of slides thatmay be part of a typical study, the organizing slides in different ways,and maintaining a link with the aforementioned data, will provechallenging. Slides may need to be included as part of severalstudies. Studies may also be organized in many different ways.• Lab ecosystem: There are many different platforms and applicationsin a lab today and there is a need to ensure flexibility andinteroperability through and image management system that canprovide some context. Labs also have differing views on deploymentmethods for applications.Key design principles that allow a solution to these problemsTo address the problems listed above, Xplore was designed in conjunction with key opinion leaders from across the pathologyspectrum, to impact and accelerate tissue-centric discovery in drug and biomarker research. There are four key design principals that the solution adheres to.An Open solution, allowing institutions to use slides from multiple scanner vendors in a single Viewer, but also launch multiple image analysis vendors.A Flexible solution, providing institutions with tools to manage research the way you want, allowing you to design, organize, manage, search, and interrogate studies in a variety of ways.An Integrated solution, allowing institutions to store image, analytic data with slides both within and across studies, with search and datamining tools to help retrieve important data quickly.A Connected solution, bringing together researchers across an organization, across multiple sites and across geographies, amplifying the expertise of all those involved anywhere.Let us explore in detail how some of the issues highlighted earlier in the biomarker research process can be addressed through an effective tissue research product.View virtual slides in a single digital viewerOur Solution – the Xplore ViewerXplore supports all major scanning vendors in a single web-based viewer, thereby reducing training needs across multiple platforms. Both bright field and fluorescent slides are supported, in addition to z-stacking and multi-regions.Ve n dor Exte n sion Philips .isyntax / .tiffHamamatsu .ndpi / .ndpisLeica / Ariol .scnPerkin Elmer .qptiffAperio .svsVentana .bif / .tif / .svsZeiss .cziOlympus .vsiOmnyx .rtsSakura .svs3DHistec h .mrsxHuron .tif Mikroscan.svsTrestle .tifVendor Neutrality - Support for all major scanning vendorsXplore offers a range of tools that you would expect in a modern digital pathology viewer, including the following features,extremely important in a research setting, Annotation & Measuring tools, Split screen (Sync up to four whole slide images or TMA Cores), Fluorescent multi-channel image adjustments, Counting tools to assist validating image analysis algorithms, Screenshots and Z-Stack (switch between different planes).Manage and organize images and data in ascalable user centric mannerOur Solution – Flexible Folder, Study & Slide Management The Philips Xplore product can ingest thousands of images in seconds, provides a database for easily organizing Whole Slide Images (WSI’s), documents, image analysis and slide associated metadata within aflexible hierarchical structure. Users are assigned as owners of a particular study with permissions to share slides and data within and across teams of researchers.Xplore’s configurable study-based folder hierarchy makes a very flexible product for research. Xplore has no fixed study hierarchy,Xplore - Key design principlesallowing multi-disciplinary research.Slides can be included as part of multiple studies, without duplicating/multiplying the large file sizes on disk. Slides can also be added to a hierarchy of the researcher’s choosing, for example stain, body site, sample ID or case ID or principal investigator. Slides can therefore be better organized to meet the context/purpose of the study.Maintain metadata and third party dataOur Solution – Datasets, import, barcodes and documentsDatasets can be created with custom fields and metadata. Image analysis data can be uploaded into Xplore and easily searched or interrogated for biomarker evaluation, case selection and correlations.1D, 2D, Datamatrix support, allows metadata on the slide to be automatically added to the Xplore database on slide acquisition. Xplore also has an import facility, to associate additional information not included in the barcode with slides and studies using CSV or TSV files. Data can be uploaded against the slide name or by TMA core position/ID, or by information collected on the barcode, for example Sample ID.The document management system allows supporting research material, journals, publications and presentations to be stored alongside studies.Manage high volumes of slides, identify trends and outliers and create cohortsOur Solution – Precision SearchXplore’s Search engine allows user to identify cohorts, based on searching a range of data across folders and slides, or studies, slides, cores and scoring data in the case of TMA’s.Search across system generated fields, barcode metadata, clinical/image analysis data uploaded via CSV, and manual scoring data, to perform a deep and detailed analysis of any study managed in Xplore, and get a better understanding of how biomarkers are expressing themselves on different TMA cores, whole slides and therefore patients.Use the results of Search to create additional research studies; create charts from Search results to more easily spot trends and outliers; save for future use; or export data for use in other 3rd partyapplications.Conduct large biomarker investigative and evaluation studiesOur Solution – Comprehensive TMA moduleXplore’s TMA (Tissue Microarray) module is designed to speed up research studies that require manual scores of TMA cores, thereby helping evaluate new tissue biomarkers in TMAs quickly and ing scoring templates, map templates, and an automated TMA de-arrayer, TMA cores can be segmented, identified, and sent out for scoring. Patient information (managed through datasets), scoring criteria and the TMA Core tissue are available through a single interface. The TMA Core tissue is locked to the question(s) being asked upon it, so the user is unable to answer scoring questions on a TMA Core that is not visible on screen.Virtual TMAThe Virtual TMA module in Xplore allows selected cores from multiple recipient blocks to be combined in a single, score-able Virtual TMA Study.Given there are discrepancies or anomalies in the data that has been captured through image analysis or manual scoring,individual TMA Cores from one or more TMA Slides or TMA StudiesCross study data management - Example Folder & Study structures in XploreThe Xplore Search interface can build complex queries across multi-modality dataTMA Management - TMA Scoring interface in Xplorecan be segmented into a new, composite, ‘Virtual TMA’ study. This study can then be sent out again for scoring, but only providing the researcher with the TMA Cores that need to be scored, rather than the several hundred that may be on a single slide. This greatly increases the efficiency of getting selected TMA Cores re-scored.Easily identify trends and spot outliersOur solution – ChartsThe Charts tools in Xplore will help researchers and pathologists more easily quantify data, and help spot trends and outliers in Xplore. The results of a study or advanced search can be opened in a variety of charts. Tools for the researcher allow him or her to directly open the relevant data point to obtain a full breakdown of the data that has been captured against a whole slide or TMA core.By providing a charts and graphing facility within Xplore, the link with the virtual slide and therefore tissue is maintained. The process of matching a data point in a spreadsheet or other application with the original tissue can be extremely difficult, but Xplore allows the researcher to click a data point and open the tissue in the viewer within seconds.Integrate with multiple imageanalysis vendorsOur solution – Image Analysis agnosticXplore’s open product structure offers interoperability with offerings from third party image analysis vendors, such as Visiopharm OncoTopix. Xplore’s advanced search engine provides tools for cohort and training set selection, allowing researchers to launch slides and associated annotations in third party applications.Image analysis results can then be imported back into Xplore, providing a central repository for virtual slides, clinical, genomic and molecular data and image analysis results. As before, any data captured alongside the slide can be searched upon, allowing both image analysis and manual scoring data to be queried alongside patient information.Embed in the lab eco systemOur solution Flexible platform that integrates and brings together expertise Xplore embeds easily with a lab ecosystem through the use of current lab credential systems with a single sign on capability. Xplore supports both cloud and on premise deployments.Connect your team to a shared archiveOur solution – Web-based technology and advancedsystem architectureXplore enables knowledge sharing and expertise across multiple research studies and centres by providing tools for sharing studies with colleagues.Entire studies, or parts of a study, can be shared with one or more individuals. Different access levels can be provided, to allow for review of study results, or collaborative studies, in which multiple pathologists can score and annotate slides.What Next?Digitizing slides without providing tools to manage the images and associated data will not automatically lead to efficiencies in pathological research studies. Xplore sits at the center of a research pathology workflow. Xplore will continue to develop with the vision of becoming the centerpiece for pathology informatics and data integration across the spectrum of tissue-centricdiscovery.© 2020 Koninklijke Philips N.V.All rights are reserved. Reproduction or transmission in whole or in part, in any form or by any means, electronic, mechanical or otherwise, is prohibited without the prior written consent of the copyright owner.4522 207 41601 - January 2020Visit us on: /computationalpathology or /digitalpathologyScatter Chart in Xplore with clickable data-points linking to the Viewer to view the tissue in more detail。
Contents(times new roman 三号)Abstract in Chinese (I)A b s t r a c t i n English (II)Introduction…………………………………………………………….……. 1 C h a p e r1.F u n c t i o n a lg r a m m a r (4)1.1E x p e r i e n t i a l m e t a f u n c t i o n (5)1.2I n t e r p e r s o n a l m e t a f u n c t i o n (5)1.3 Textual metafuncton (6)Chapter2. The experiential metafunction of company o v e r v i e w (7)2.1 Analyze company overview from the perspective of t r a n s i t i v i t y (7)2.1.1 Transitivity (7)2.1.2 A statistic analysis of the processes used in the companyoverviews………………………………………………………92.1. 3 S u m m a r y (13)2.2 Analyze company overview from the perspective of v o i c e….……1 62.2.1 Voice (16)2.2.2 A statistic analysis of voice used in the company o v e r v i e w s…1 62.2.3 Summary (19)Chaper3. The interpersonal metafunction of compa ny o v e r v i e w (20)3.1 Analyze company overview from the perspective of m o o d (20)3.1. 1 M o o d (20)3.1.2 A statistic analysis of voice used in the company o v e r v i e w s (20)3.1. 3 S u m m a r y (24)3. 2 Modality (26)C h a p e r4.T h e t e x t u a l m e t a f u n c t i o n o f c o m p a n y o v e r v i e w (27)4.1 Analyze company overview from the perspective of t h e m e (27)4.1. 1 Th e me (27)4.1.2 A statistic analysis of theme-rheme patterns used in thecompanyoverviews………………...………………………………….....304.1. 3 Summary (34)4.2 Analyze company overview from the perspective ofc o h e s i o n………3 44.2. 1 Cohesion (35)4.2.2 A statistic analysis of cohesive devices used in thecompanyoverviews………………………………………………………364.2.3 Summary………………………………………..………………38 Conclusion……………………………………………….….………………39 References (42)Ap pe n di x (43)Acknowledgements…………………………………….…………………4 5(times new roman 小四)说明:目录中每一级子目录都应较其上一级总目录缩进2个字母的位置,以第二章目录为例。
语言学书目(英语)语言学书目(英语)2008-04-20 21:53语言学书目(英语)普通语言学Allwood, Jens, Lars-Gunnar Andersson and Östen Dahl.1993 (1977). Logic in Linguistics. Cambridge Textbooks in Linguistics. Cambridge: Cambridge University Press.Bàrtoli, Matteo. 1945. Saggi di linguis tica spaziale. Torino: Vicenze Bona.Blake, Barry J. 1994. Case. Cambridge Textbooks in Linguistics. Cambridge: Cambridge University Press.Bloomfield, Leonard. 1984 (1933). Language. Chicago: University of Chicago Press.Bopp, F. 1816. Über das Conjugatio nsystem der Sanskritsprache in Vergleichung mit jenem der griechischen, lateinischen, persischen, und germanischen Sprache. Frankfurt.Bybee, Joan. 1985. Morphology: A study of the relation between meaning and form, Amsterdam: John Benjamins Publishing Corporation.Bynon, Theodora. 1977, 1990. Historical Linguistics. Cambridge Textbooks in Linguistics. Cambridge: Cambridge University Press.Chafe, Wallace L. 1970. Meaning and the Structure of Language. UCP.Comrie, Bernard. 1976. Aspect. Cambridge Textbooks in Linguistics. Cambridge: Cambridge University Press.Comrie, Bernard. 1989 (1981). Language Universals and Linguistic Typology. second edition. Oxford: Basil Blackwell ltd.Comrie, Bernard. 1985. Tense. Cambridge Textbooks in Linguistics. Cambridge: Cambridge University Press.Corbett, Greville.1991. Gender. Cambridge Textbooks in Linguistics. Cambridge: CambridgeCroft, William. 1990. Typology and Universals. Cambridge Textbooks inLinguistics. Cambridge: Cambridge University Press.Cruse, D.A. 1986, 1991. Lexical Semantics. Cambridge Textbooks in Linguistics. Cambridge: Cambridge University Press.Crystal, David. 1991. A dictionary of linguistics and phonetics. Oxford, Basil Blackwell.De Saussure, Ferdinand. 1955. Cours de Linguistique Générale, cinquième édition. Paris: Payot.Dixon, R.M.W. 1994. Ergativity, Cambridge Studies in Linguistics 69, Cambridge: Cambridge University Press.Dixon, R.M.W. 1997. The rise and fall of languages. Cambridge: Cambridge University Press.Dürr, Michael and Peter Schlobinski. 1990. Einführung in die deskriptive Linguistik. Opladen: Westdeutscher Verlag.Greenberg, Joseph H. 1966. "Some universals of grammar, with particular reference to the order of meaningful elements". In J. Greenberg (ed.), Universals of Language, second edition. MIT press.Harris, Alice C. and Lyle Campbell. 1995. Historical syntax incross-linguistic perspective. Cambridge Studies in Linguistics 74. Cambridge: Cambridge University Press.Hopper, Paul J. and Elizabeth Closs Traugott. 1993. Grammaticalization . Cambridge Textbooks in Linguistics. Cambridge: Cambridge University Press.Jespersen, Otto. 1923. Language, its nature, development and origin . London: George Allen & Unwin.Jespersen, Otto. 1924. The Philosophy of Grammar. London: George Allen & Unwin.Kempson, Ruth M.1977, 1989. Semantic Theory. Cambridge Textbooks in Linguistics. Cambridge: Cambridge University Press.Lass, Roger.1984, 1989. Phonology: an introduction to basic concepts. Cambridge Textbooks in Linguistics. Cambridge: Cambridge University Press.Lyons, John. 1989 (1968). Introduction to Theoretical Linguistics. Cambridge: Cambridge University Press.Manders W.J.A. 1947. Vijf Kunsttalen. Vergelijkend onderzoek naar de waarde van het volapük, esperanto, ido, occidental en novial. P urmerend: J. Muusses.Matthews, Peter. 1991. Morphology. Cambridge: Cambridge University Press.Nerbonne, John (ed.). 1998. Linguistic Databases. Stanford, CSLI Publications.Palmer, F.R. 1986. Mood and Modality. Cambridge: Cambridge University Press.Renfrew, Colin. 1998 (1987). Archaeology & Language. London: Pimlico.Schegel, F. 1801. Über die Sprache und Weisheit der Indier, Heidelberg.Shopen, Timothy (ed.). 1990 (1985). Language typology and syntactic description. Cambridge: Cambridge University Press.Swadesh, Morris. 1955. "Towards Greater Accuracy in Lexicostatistic Dating" International Journal of American Linguistics, XXI, p. 121.Weinreich, Uriel. 1974. Languages in Contact: Findings and Problems. The Hague: Mouton.Wierzbicka, Anna. 1988. The semantics of grammar Amsterdam: John Benjamins.语义学Bolinger, Dwight. 1975 [1968]. Meaning. The Segmentation of Reality. Excerpt from Aspects of Language Chapter 7, 2nd edition. New York: Harcourt, Brace, Jovanovich, 185-192.Ullman, Stephen. 1962. Chapter 3 of Semantics: An introduction to the science of meaning. Oxford: Basil Blackwell. pp.Tyler, Stephen A. 1969. Order out of chaos. In Cognitive Anthropology. New York: Holt, Rinehart and Winston, pp. 6-13.Lehrer, Adrienne. 1974. Semantic fields. In Semantic fields and lexicalstructure. Amsterdam & London: North Holland Publishing. New York: American Elsevier Publishing Co., pp. 15-35.Fillmore, Charles. 1978. On the organization of semantic information in the lexicon. In Papers from the parasession on the lexicon. Chicago Linguistic Society, ed. by Donka Farkas, Wesley Jacobsen, and Karol Todrys. Chicago: Chicago Linguistic Society (Dept. of Linguistics, University of Chicago), pp. 165-173.Clark, Eve V. and Herbert H. Clark. 1978 [1977]. Universals, relativity, and language processing. In Universals of human language, ed. by Joseph H. Greenberg, Vol. I. Stanford: Stanford University Press, pp. 225-277. (Reprinted from Psychology and Language by Eve V. Clark and Herbert H. Clark, Harcourt Brace and Jovanovich, 1977.)Fillmore, Charles. 1975. An alternative to checklist theories of meaning. In Proceedings of the first annual meeting of the Berkeley Linguistics Society, ed. by Cathy Cogen et al. Berkeley: Berkeley Linguistics Society, Dept. of Linguistics, U.C. Berkeley, pp. 123-131.Lee, David. Chapter from An Introduction to Cognitive Linguistics.Wierzbicka, Anna. 1985. Cups and mugs: The semantics of simple artifacts. In Lexicography and conceptual analysis. Ann Arbor, Mich.: Karoma Publishers pp. 1-40.Ungerer, Friedrich, and Hans-Joerg Schmidt. 1996. An Introduction to Cognitive Linguistics. London and New York: Longman.Lakoff, George, and Mark Johnson. 1980. Concepts we live by; The Systematicity of metaphorical concepts; Highlighting and hiding; Orientational metaphors. In Metaphors we live by Chicago: University of Chicago Press, 3-21.Turner, Mark. Image schemas. Excerpt from The Literary Mind, forthcoming from Oxford University Press, pp. 17-32.Talmy, Leonard. Lexicalization patterns: Semantic structure in lexical forms. In Timothy Shopen, ed., Language typology and syntactic description. Vol. 3, Grammatical categories and the lexicon. Cambridge: Cambridge University Press, 57-76 and 102-125.Traugott, Elizabeth. 1985. On regularity in semantic change. In Journal of Literary Semantics 14. Institute of Languages and Linguistics,University of Kent at Canterbury, England: Julius Groos, pp. 155-173.Langacker, Ronald. 1988. A view of linguistic semantics. In Topics in Cognitive Linguistics, ed. by Brygida Rudzka-Ostyn. Amsterdam & Philadelphia: John Benjamins, pp. 49-90.Bierwisch, Manfred. 1970. Semantics. In New Horizons in Linguistics, ed. by John Lyons. Hammondsworth, Middlesex, England: Penguin Books, pp. 166-184.Bolinger, Dwight. 1965. The Atomization of Meaning. Language,Katz, J.J. and J. Fodor. The Structure of a Semantic Theory. LanguageLakoff George. 1987. Case Study 2: Over. In Women, Fire, and dangerous things: What categories reveal about the mind. Chicago: University of Chicago Press, pp. 416-461.Miller, George, and Christiane Fellbaum. 1991. Semantic networks of English. In Lexical and conceptual semantics, ed. by Beth Levin and Steven Pinker. Cambridge, Mass.: Blackwell, pp. 197-229.Palmer, F.R. Logic and Language. From Semantics.Rosch, Eleanor. 1978. Principles of categorization. In Cognition and categorization, ed. by E. Rosch and B. Lloyd. Hillsdale, NJ: Lawrence Erlbaum, pp. 27-48.Ullman, Stephen. 1962. Meaning change. Chapter 8 of Semantics: An Introduction to the Science of Meaning, Oxford: Basil Blackwell, pp. 193-235.认知语言学Croft, William and Alan D. Cruse. 2004. Cognitive Linguistics. CUP.Lakoff, George and Mark Johnson. 1999. Philosophy in the Flesh. Basic Books.Sinha, Chris. 1999. Grounding, Mapping and Acts of Meaning. In T. Janssen and G. Redeker (eds.). Cognitive Linguistics, Foundations, Scope and Methodology, 223-256. Mouton de Gruyter.Ungerer, Jans-Jorg; and Friedrich Schmid. 1996. An Introduction toCognitive Linguistics. Longman.Clausner, Timothy and William Croft. 1999. Domains and Image Schemas. Cognitive Linguistics, 10, 1, 1-32.Gibbs, Raymond and Herbert Colston. 1995. The Cognitive Psychological Reality of Image Schemas and their Transformations. Cognitive Linguistics, 6, 4, 347-378.Lakoff, George. 1987. Women, Fire and Dangerous Things. University of Chicago Press.Johnson, Mark. 1987. The Body in the Mind. Chicago University Press.Langacker, Ronald. 1987. Foundations of Cognitive Grammar. Vol. 1. Stanford University Press.Turner, Mark. 1996. The Literary Mind. OUP.Croft, William. 1993. The Role of Domains in the Interpretation of Metaphors and Metonymies. Cognitive Linguistics, 4, 335-370.Fillmore, Charles. 1982. Frame Semantics. The Linguistic Society of Korea (ed.). Linguistics in the Morning Calm, 111-137.Fillmore, Charles. 1985. Frames and the Semantics of Understanding. Quaderni di Semantica, 6, 222-254.Langacker, Ronald. 1987. Foundations of Cognitive Grammar. Vol. 1. Stanford University Press.Lakoff, George. 1987. Women, Fire and Dangerous Things. University of Chicago Press.Rosch, Eleanor 1975. Cognitive representations of semantic categories. Journal of Experimental Psychology: General, 104, 192-233.Rosch, Eleanor 1977. Human Categorization. In Studies incross-linguistic psychology, ed. By Neil Warren. Academic Press.Rosch, Eleanor 1978. Principles of categorization. In Cognition and categorization, ed. by B.B. Lloyd and Eleanor Rosch, 27-48. Erlbaum.Rosch, Eleanor and Caroline Mervis. 1975. Family Resemblances: Studies in the Internal Structure of Categories. Cognitive Psychology, 7,573-605.Rosch, Eleanor, Caroline Mervis; Wayne Gray; David Johnson and Penny Boyes-Braem. 1976. Basic Objects in Natural Categories. Cognitive Psychology, 8, 382-439.Taylor, John. 1995. Linguistic Categorization (second edition). OUP.Barcelona, Antonio 2000. Metaphor and Metonymy at the Crossroads: A Cognitive Perspective. Mouton de Gruyter.Dirven, R. and Ralph Porings. 2002. Metaphor and Metonymy in Comparison and Contrast. Mouton de Gruyter.Grady, Joseph. 1999. A Typology of Motivation for Conceptual Metaphor: Correlation vs. Resemblance. In R. Gibbs and G. Steen. Metaphor in Cognitive Linguistics, 79-100. John Benjamins.Lakoff, George. 1993. The Contemporary Theory of Metaphor. In A. Ortony (ed.). Metaphor and Thought (second edition). CUPLakoff, George and Mark Johnson 1980. Metaphors We Live By. Chicago University Press.Lakoff, George and Mark Johnson 1999. Philosophy in the Flesh. Basic Books.Lakoff, George and Mark Turner 1999. More than cool reason. University of Chicago Press.Ortony, Andrew. 1993. Metaphor and Thought (second edition). CUPPanther, Klaus-Uwe and Gunter Radden. 1999. Metonymy in Cognition and language.Gibbs, Raymond and Gerard Steen. Metaphor in Cognitive Linguistics. John Benjamins.Turner, Mark. 1996. The Literary Mind. OUP.Yu, Ning. 1998. The Contemporary Theory of Metaphor: A Perspective from Chinese. John Benjamins.Aitchison, Jean 1996. Words in the Mind. Blackwell.Brugman, Claudia and George Lakoff 1988. Cognitive Topology and LexicalNetworks. In S. Small; G. Cottrell and M. Tannenhaus (eds.). Lexical Ambiguity. Resolution, 477-507. Morgan Kaufman.Cuyckens, Hubert and Britta Zawada. 2001. Polysemy in cognitive linguistics. John Benjamins.Cuyckens, Hubert; Rene Dirven and John Taylor. 2003. Cognitive Approaches to Lexical Semantics. Mouton de Gruyter.Croft, William (1998) Mental representations. Cognitive Linguistics, 9,2, 151-174.Fillmore, Charles and Beryl Atkins 1992. Toward a frame-based lexicon: The semantics of RISK and its neighbors. In A. Lehrer and E. Kittay (eds.) Frames. Fields and Contrasts. Erlbaum.Geeraerts, Dirk. 1993. Vagueness’s Puzzles, Polysemy’s Vagaries. Cognitive Linguistics, 4,3,223-274.Geeraerts, Dirk. 1994. Diachronic Prototype Semantics. OUP.Herskovits, Anette 1986 Language and spatial cognition. CUP.Lakoff, George 1987. Women, Fire and Dangerous Things. University of Chicago Press.Nerlich, Brigitte; Zazie Tood; Vimala Herman and David D. Clarke. 2003. Polysemy: Flexible Patterns of Meaning in Mind and Language. Mouton de Gruyter.Sandra, Dominiek 1998. What Linguists Can and Can’t Tell You about the Heman Mind: A Reply to Croft. Cognitive Linguistics, 9,4, 361-478.Sandra, Dominiek and Sally Rice (1995). Network analyses of prepositional meaning: Mirroring whose mind—the linguist’s or the language user’s ? Cognitive Linguistics, 6, 1, 89-130.Tuggy, David. 1993. Ambiguity, Polysemy and Vagueness. Cognitive Linguistics, 4, 3, 273-290.Tuggy, David. 1999. Linguistic Evidence for Polysemy in the Mind: A Response to William Croft and Dominiek Dandra. Cognitive linguistics, 10, 4, 343-368.Tyler, Andrea and Vyvyan Evans 2003. The Semantics of EnglishPrepositions: Spatial Scenes, Embodied Meaning and Cognition. CUP.Vandeloise, Claude 1991. Spatial Prepositions: A Case Study in French. Chicago: The University of Chicago Press.Vandeloise, Claude. 1994. Methodology and analyses of the preposition in. Cognitive Linguistics, 5,2,157-184.Fauconnier, Gilles 1994. Mental Spaces. CUP.Fauconnier, Gilles 1997. Mappings in Thought and Language. CUP.Fauconnier, Gilles and Eve Sweetser 1996. Spaces, Worlds and Grammar. University of Chicago Press.Coulson, Seanna (2000) Semantic Leaps. CUP.Coulson, Seanna and Todd Oakley (2000) Conceptual Blending. Special issue of Cognitive Linguistics, 11, 3/4.Fauconnier, Gilles and Mark Turner. 1996. Blending as a Central Process of Grammar in Conceptual Structure, Discourse, and Language. Edited by Adele Goldberg. Stanford: Center for the Study of Language and Information (CSLI), 113-130.Fauconnier, Gilles and Mark Turner. 1998. Principles of Conceptual Integration. Discourse and Cognition. Edited by Jean-Pierre Koenig. Stanford: CSLI, 269-283.Fauconnier, Gilles and Mark Turner. 1999. Metonymy and Conceptual Integration. In Metonymy in Language and Thought. Edited by Klaus-Uwe Panther and G. Radden. Amsterdam: John Benjamins. Pages 77-90. Fauconnier and Turner.Fauconnier, Gilles and Mark Turner. 2003. Polysemy and Conceptual Blending. In Polysemy: Patterns of Meaning in Mind and Language. Edited by Brigitte Nerlich, Vimala Herman, Zazie Todd, and David Clarke.Fauconnier, Gilles and Mark Turner. 1998. Conceptual Intergration Networks. Cognitive Science. Volume 22, number 2 (April-June 1998), pages 133-187.Fauconnier, Gilles and Mark Turner (2002) The Way We Think. Basic Books. Fauconnier, Gilles. 1999. Method and Generalizations. In T. Janssen andG. Redeker (eds.). Cognitive Linguistics, Foundations, Scope and Methodology, 95-128. Mouton de Gruyter.Grady, Joseph; Todd Oakley and Sean Coulson (1999) Blending and Metaphor. In R. Gibbs and G. Steen (eds.). Metaphor in Cognitive Linguistics, 101-124. John Benjamins.Turner, Mark. 2001. Cognitive Dimensions of Social Science. OUP.Turner, Mark and Gilles, Fauconnier. 1995. “Conceptual Integration and Formal Expression.” Metaphor and Symbolic Activity, 10: 3, 183-203.Langacker, R.W. 2001. “Discourse in Cognitive Grammar”. Cognitive Linguistics, p143-188.Traugott, E. and P. Hopper, 1999. Grammaticalization. CUP.Blank, A. and P. Koch. 1999. Historical semantics and Cognition. Mouton de Gruyter.Giori, G. 2002. “Semantic change and Cognition”. Cognitive Linguistics, p123-16611。
GE HealthcareWomen’s HealthcareSenographePristinaGE imagination at workThe Senographe* Pristina is a full field digital mammography system designed to offer an extensive breast care solution with screening and diagnostic capabilities, focused on an ergonomic design for the technologist and patient comfort. Senographe Pristina features a 24 x 29 cm detector, designed to offer full breast coverage in a single image. Smaller breasts can also be imaged in any view with paddles that can slide to both sides of the detector.The Senographe Pristina does not require daily calibration. Ergonomics for technologists•Re-imagined user interface• Park Positioning during patient positioning• One touch access to preset rotation for positioning• Variable speed motorized gantry movements• Sliding compression paddles can move to the side of the detector for compressionErgonomics and design for patient comfort•Designed for Patient comfort•Wheelchair access, MITA compliant•Thinner Bucky than previous platform•Rounded edges detector for patient comfortImage quality• Automatic Optimization of Parameters (AOP), selects all exposure parameters based on breast radiological properties • Three AOP modes + 1 Automatic mode for implants• eContrast is an image processing feature that makes automatic adjustments of brightness and contrast• DQE at IEC 62220-2-3 equivalent spectrum, at 75µGy: 70% (+/-3) at 0.5lp/mm and 64% (+/-3) at 2lp/mm Smooth digital workflow connectivity• Automated Quality Control• Integrated Repeat and Reject AnalysisTechnical SpecificationsDetector• Detector ready to use right after system boot• Detector size: 24 x 29 cm• Pixel size (pitch): 100 μm• Acquisition dynamic range: 14 bits• Bucky front cover thickness: 49mm• Optimized room for positioning due to the bucky depth: 470mm • Image size:– LFOV image size - approx. 13 MB per image– Regular image size - approx. 9 MB per image• Patented needle structure CsI scintillator, single piece construction• Breast support with rounded edge• Air coolingTube technology• X-Ray tube type: Artemis• Anode target materials - Dual track: Molybdenum (Mo) enriched with Vanadium, and Rhodium (Rh)• Four focal spots: 0.1 and 0.3 IEC on each target• Target angle: 0 degree• Maximal high voltage: 49 kV• Tube current:– Molybdenum target:• 100 mA from 25 to 30 kV on large focal spot• 40 mA from 25 to 30 kV on small focal spot– Rhodium target:• 62 mA from 25 to 30 kV on large focal spot• 35 mA from 25 to 30 kV on small focal spot• Anode size (tracks diameter): 100 mm• Anode heat storage capacity: 250kJ (340 kHU)• Anode maximum dissipation: 500 W (40 kHU/min)• Max casing con tinuous dissipation:150 W (12 kHU/min) at 40 °C• Permanent filtration: 0.69 mm Beryllium• Weight: 7 kg• X-ray tube assembly: self-encased X-ray tube, oil-free, lead-free, air-cooled head• Tube protection: software monitoring of tube loadGrid/breast support•Universal grid compatible with 2D Conventional Mammography and DBT•Ergonomic breast support designed for patient comfort and cleanability• Motorized lock of the grid and breast support• Breast support material: carbon fiber composite• Optimized grid motion ensuring no grid structure visible in the image• Detector to breast support edge-to-edge distance ≤ 5 mm• It is always possible for the technologist to takecompression control even if the patient has started self-compression• PAC is inhibited during acquisition, the patient cannot interfere with the examinationPositioner• Isocentric arm with motorized rotation and vertical movement• Source to image receptor distance: 660 mm• Floor to image receptor distance: from 65 cm to 150 cm • Rotation angle: -180/+180 degrees• Ergonomic hand -rest: one at each side of the tube arm and two additional behindSafety features• Gantry motions locked when compression force appliedUser interface• Four sets of single speed switches for rotation , angulation and lift movements, with an accelerating speed profile• Four sets of preset position switches for positioning in CC and MLO• Automatic sto p at +/- 90 degrees for lateral positions • Collimation buttons on the tube head for field of view size and location• Parameters display– Tube arm support rotation angle– Compressed breast thickness (in mm) – Compression force (in daN)• Ergonomic control console– Controls exposure– Provides information on system status– Gives access to advanced parameters for system set-up• Patented automatic view names marking based on breast laterality• View name can be edited while the exam is performedAcquisition workstation• Time to display processed image (average): 10 seconds • Time between exposures (typical): 12 seconds• Dose calculated and displayed on the image after every exposure (Entrance Skin Dose and Average Glandular Dose) • Quad core Intel i5 workstation:– Memory: 32GB– Hard disk: 1 internal 250GB disk for the system – Hard disk: 1TB for image storage – Ports: 4 Gigabit Ethernet port – DVI Display and port connector• 2 types of display available – 1MP LCD Monitor• 48 cm (19”) medical grade • 1280 x 1024 pixels (landscape) • High luminance - up to 300 Cd/m2 • Contrast ratio: 2000:1• Viewing angle: 170 degrees• Mounted on a rotating arm for in -room accessAutomatic exposureAutomatic Optimization of Parameters (AOP) Fully automatic mode• AOP is an automatic exposure system that selects all exposure parameters based on radiological density of the breast: - track (Mo or Rh) - filter (Mo or Ag) - kV - mAs• The system identifies the densest part of the breast to select the appropriate exposure parameters • Three AOP modes are available:– "Standard + ”: dose to patient comparable to screen/film Mammography– “Dose -”: priority is given to dose reduction– “Standard”: balances low noise and dose reduction • Automatic acquisition mode for implants Manual mode• Manual selection of all parameters: track, filter, kV and mAsCollimator• Filters: Molybdenum: 0.030 mm; Silver: 0.030 mm • Field of View (FOV) in detector plane, in cm:– For standard contact views: 24 x 29 maximum FOV or 19 x 23 regular FOV, automatic adjustment depending on paddle used, breast support and gantry rotation angle• Field of View (FOV) selection: automatic and manual• FOV size: selected automatically based on the paddle or geometric magnification platform used, can be modified manually by using the collimation size switch on the tube head • FOV location (left, right, center): selected automatically based on the tube arm angle, can be modified manually by using the collimation position switch on the tube head • Compression and exposure are prevented if the FOV and compression paddle sizes or locations are not consistent • Light centering device: a light automatically switches on when a preset position is reached, at compression start or at paddle insertion; can be turned on with the collimation switches buttons located on the tube head or on the acquisition consoleCompression• Compression modes:– Motor driven compression up to 20 daN – Manual compression up to 27 daN• Dual foot-pedals for column height and compression adjustments• User defined motorized compression force limit: 4 to 20 daN • Min force for AOP: 3 daN• Compression speed: 3 speed levels• Selectable automatic decompression after exposure, to minimize patient time under compressionPatient Assisted Compression (PAC)*Commercialized as Pristina Dueta in some countries• Wireless and ergonomic -designed device that allows the patient to continue the compression after the technologist has positioned correctly and reached a threshold of compression• Designed to minimize patients' perceived pain and discomfort• Intended to be available for every patient positioning• PAC’s speed profile is similar to the technologist-controlled one-Nio Color 3MP (MDNC-3421) – Barco:• High performance color IPS-TFT Color LCD• 54cm (21.3”)• 2048 x 1536 pixels (landscape)• Brightness: 900 cd/m2• Contrast ratio: 1400:1• Viewing angle: 178°• Mounted on a rotating arm for in-room access • Image PresentationeContrast allows you to choose among 6 levels to better adapt to breast morphology and radiologist display preferences:–eContrast 1 provides a “film-like” aspect withimproved visibility of the skin line– eContrast 2 to 4 provide increasing steps of imagesharpness and contrast– eContrast 5 provides a high level of sharpnessand contrast, with a very high level of tissuepenetration– eContrast 6 is adapted to very dense breast orimplants– Automatic windowing (window level and windowwidth)– Other features: zoom, roaming, inversion, flip,rotation of images, window width and level setting,annotations and measurements• In case of power failure, an Uninterruptible Power Supp ly (UPS) allows to close the examination without loss of informationConnectivity• DICOM** 3.0 platform:– Modality Worklist User– Storage Provider– Storage Commitment User– Query/Retrieve User– Basic Grayscale Print User– Verification Provider– DICOM-compliant CD, DVD-R/-RW and USB DataInterchange• Connectivity features: customizable Autopush to multiple DICOM databases, Autoprint, Autodelete based on Storage Commitment• Modality Perform Procedure Step User• Connectivity to GE Service for remote diagnostic capability • IHE Profiles: Scheduled workflow, Mammography image, Tomosynthesis profile, Portable data for imaging, Consistent time integrationQuality assurance• Complete quality control program• Automation of quality control tests: Flat Field, MTF, AOP, SNR• Test history and results can be reviewed• Data can be exported for data tracking• Automated Repeat and Reject Analysis Radiation shield• Choice between two radiation shields:– Integrated to the control console– StandaloneHigh voltage generator• Generator Integrated into the gantry for room saving • Generator type: high frequency single-phase power supply• Ripple: < 4% from peak to peak• Power: 5 kW max• Generator max rating:• 2 to 600 mAs (depending on track, filter and kV)•22 to 49 kV, in 1 kV steps depending on track • Generator protection: software monitoring tube load Standard configuration• Motorized isocentric gantry• X-ray tube with rotating Mo/Rh anode• 24 x 29 cm flat panel detector• Acquisition workstation– CD,DVD-R/-RW– 1MP or 3MP display– Control console– UPS• Pair of dual foot-pedals• Standard Face shield• 24 x 29 cm bucky with grid• 24 x 29 cm paddle• Quality control toolkit• User manual and technical documentationOptions• 1.5 and 1.8 magnification stands• Additional 24 x 29 cm paddle• 19 x 23 cm sliding paddle• 24 x 29 cm Flexible compression paddle• 19 x 23 cm Flexible & sliding compression paddle• 10x23 Sliding Implant/Small breast compression paddle • Square spot sliding compression paddle• Round spot sliding paddle• 2D Localization 19x23 Swiss Cheese sliding compression paddle• 2D Localization 19x23 sliding standard compressionpaddle•2D crosshair device• X-Ray protective shield• Bar code reader• Printers compatibility: AGFA DRYSTAR AXYS• Upgradable to Senographe Pristina 3D and/or SenoBright HD• X-ray remote control hand switch• X-ray footswitchSenographe Pristina 3DSenographe Pristina 3D is a three-dimensional imaging technology that uses a low dose short X-ray sweep around a compressed breast. The acquired projection images are processed electronically in order to reconstruct a 3D representation of the entire breast. This imaging technique is designed to separate the tissues and to reduce the overlapping of structures, which represents a limiting factor in standard 2D mammography.The 3D option is available for the Senographe Pristina platform that generates 3D and 2D images. Senographe Pristina 3D Technology• Sweep angle is 25° with 9 projections at any rotation angle between -160°/+160°• The “Step and Shoot” tube motion stops for each exposure to avoid image blur• Mo and Rh tube tracks create narrow x-ray spectra,exactly where the dose efficiency is for thin (Mo) andmedium and thick breasts (Rh)• Detector: 100 microns with no binning, high DQE in 3Dmode (IEC 62220-2-3, equivalent spectrum at 5µGy):65% (+/-2) at 0.5lp/mm and 57% (+/-2) at 2lp/mm• Automatic reconstruction of the images by using ASIR DBT iterative algorithms• The dose of a DBT (Digital Breast Tomosynthesis) view isdesigned to be equivalent to the dose of a 2D standardacquisition of the same view• Capability to reconstruct 0.5mm or 1mm distancebetween tomo-planes• 3D+2D mode allows the user to acquire in a single action a 3D sequence followed by 2D image for a given view,without releasing the compressionSenoBright HDThe SenoBright HD (Contrast Enhanced Spectral Mammography CESM) application shall enable contrast heightened breast imaging using a dual energy technique. This imaging technique can be used as an adjunct following mammography and ultrasound exams to localize a known or suspected lesion.Patient Comfort• As with previous generation GE mammography systems, patients lying in a recumbent position can be examined with SenoBright HDErgonomics designed for technologist• User can switch between standard mammography and Spectral Mammography mode during the same exam session• SenoBright HD provides a timer function to both monitor and record time after injection, which is displayed as an annotated field in the images• SenoBright HD offers Automatic Optimization of Parameters (AOP) and manual exposure modes for the dual-energy exam• S enoBright HD will automatically acquire the Spectral Mammography images for each view with a single action of the x-ray exposure control TechnologySenoBright HD chooses filtering materials depending on the operating mode and the exposure levels necessary. For the high-energy acquisition, a proprietary multi-layer filter is used to shape the resulting energies of the x-ray spectrum to those required to best highlight iodine.Energy LevelsThe energy levels may vary depending on breast thickness • 26-34 KVp for lower energy acquisition• 49 KVp for higher energy acquisition.System Power supply• Input frequency: 50Hz/60Hz• Input voltage: single-phase 200-240 V~• EATON UPS 5P650 650VASystem Weight• Gantry: 420 kg• Control Station without monitors: 160 kg Environmental conditions• Temperature range: 15° to 30°C• Humidity range: 10% to 80%• Atmospheric pressure range: 70 kPa to 106kPa(0 to 3000m altitude)Screening ProtocolFor reference, in the US a DBT screening examination may consist of one of the following combinations (CC: craniocaudal, MLO: mediolateral oblique):- a 2D CC view and a 3D DBT MLO view, or- a 3D DBT image set consisting of CC and MLO views, and a 2D synthesized image set consisting of CC and MLO V-Preview images.V-Preview is the 2D synthesized image generated by GE SenoIris mammography software from GE DBT images.Note: Breast cancer screening may be regulated by country specific rules. Please refer to competent Healthcare Authorities for guidanceWireless Footswitch OptionThe wireless footswitch is available on the Senographe Pristina platform. The footswitch includes pedals to activate lift up, lift down, compression and decompression functionalities. The communication range between the footswitch and the receiver shall be located within 1.5m radius from the gantry.Mobile OptionA Mobile Mounting Device is available for Senographe Pristina 2D and 3D to allow its installation and transportation in a mobile unitWorkflow OptionsThe Senographe Pristina is compatible with iCAD Second Look (2D CAD), iCAD Tomo Detection 1.0 (3D CAD) and iCAD ProFound AI for Tomo (3D CAD)Senographe PristinaNOTE:- Weights and dimensions may vary slightly depending on equipment configuration.Senographe Pristina, PAC, Wireless footswitch, Mobiles and iCAD are not available in all countries. Please refer to your GE Healthcare sales representative.1885m775368Maximum HeightGantry BasePlateM ax imM ax im uData subject to change.Marketing Communications GE Medical SystemsSociété en Commandite Simple au capital de 85.418.040 Euros 283, rue de la Minière, 78530 Buc France RCS Versailles B 315 013 359A General Electric company, doing business as GE HealthcareUK: 0800 0329201Spain: 0900 993620 Germany************France: 0800 908719Austria: 0800 291888 SwitzerlandItaly: 0800 786947 German: 0800 837279French: 0800 837279GE, the GE Monogram, and imagination at work are trademarks of the General Electric Company*Trademark of General Electric Company** DICOM is a trademark of National Electrical Manufacturers Association.All other trademarks, service marks, company names and product names are the property of their respective owners© 2016-2019 Copyright GE Healthcare。
2025年软件资格考试数据库系统工程师(基础知识、应用技术)合卷(中级)模拟试卷(答案在后面)一、基础知识(客观选择题,75题,每题1分,共75分)1、数据库系统工程师在数据库设计过程中,以下哪个阶段是确定数据库中数据模型和概念模型的阶段?A、需求分析阶段B、概念结构设计阶段C、逻辑结构设计阶段D、物理结构设计阶段2、在关系数据库中,以下哪种数据类型可以存储固定长度的字符串?A、VARCHARB、CHARC、TEXTD、BLOB3、在数据库系统中,为了确保数据的一致性,在执行事务时必须遵循ACID属性。
以下哪个选项不是ACID属性的一部分?A. 原子性B. 一致性C. 隔离性D. 可用性4、下列关于关系数据库规范化理论的描述中,哪一项是不正确的?A. 第一范式要求每个属性都应该是不可再分的基本项。
B. 满足第二范式的前提是先满足第一范式,并且所有非主属性完全依赖于整个候选键。
C. 第三范式消除了传递依赖。
D. BCNF(Boyce-Codd范式)比第三范式更严格,它不允许任何属性部分依赖或传递依赖于候选键。
5、在数据库系统中,以下哪一项不是关系模型的三要素?A. 属性B. 关系C. 范式D. 约束6、在SQL语言中,用于删除表的命令是:A. DROP TABLEB. DELETE FROMC. TRUNCATE TABLED. DELETE7、在数据库系统中,什么是数据模型?请简述其作用。
8、什么是数据库规范化理论?请简述其目的。
(1)第一范式(1NF):要求每个属性都是不可分割的最小数据单位。
(2)第二范式(2NF):在满足1NF的基础上,要求非主属性完全依赖于主键。
(3)第三范式(3NF):在满足2NF的基础上,要求非主属性不传递依赖于主键。
(4)巴斯-科德范式(BCNF):在满足3NF的基础上,要求每个非平凡函数依赖都由主键决定。
通过规范化理论,可以优化数据库设计,提高数据库的质量和性能。
参考文献(人工智能)曹晖目的:对参考文献整理(包括摘要、读书笔记等),方便以后的使用。
分类:粗分为论文(paper)、教程(tutorial)和文摘(digest)。
0介绍 (1)1系统与综述 (1)2神经网络 (2)3机器学习 (2)3.1联合训练的有效性和可用性分析 (2)3.2文本学习工作的引导 (2)3.3★采用机器学习技术来构造受限领域搜索引擎 (3)3.4联合训练来合并标识数据与未标识数据 (5)3.5在超文本学习中应用统计和关系方法 (5)3.6在关系领域发现测试集合规律性 (6)3.7网页挖掘的一阶学习 (6)3.8从多语种文本数据库中学习单语种语言模型 (6)3.9从因特网中学习以构造知识库 (7)3.10未标识数据在有指导学习中的角色 (8)3.11使用增强学习来有效爬行网页 (8)3.12★文本学习和相关智能A GENTS:综述 (9)3.13★新事件检测和跟踪的学习方法 (15)3.14★信息检索中的机器学习——神经网络,符号学习和遗传算法 (15)3.15用NLP来对用户特征进行机器学习 (15)4模式识别 (16)4.1JA VA中的模式处理 (16)0介绍1系统与综述2神经网络3机器学习3.1 联合训练的有效性和可用性分析标题:Analyzing the Effectiveness and Applicability of Co-training链接:Papers 论文集\AI 人工智能\Machine Learning 机器学习\Analyzing the Effectiveness and Applicability of Co-training.ps作者:Kamal Nigam, Rayid Ghani备注:Kamal Nigam (School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, knigam@)Rayid Ghani (School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213 rayid@)摘要:Recently there has been significant interest in supervised learning algorithms that combine labeled and unlabeled data for text learning tasks. The co-training setting [1] applies todatasets that have a natural separation of their features into two disjoint sets. We demonstrate that when learning from labeled and unlabeled data, algorithms explicitly leveraging a natural independent split of the features outperform algorithms that do not. When a natural split does not exist, co-training algorithms that manufacture a feature split may out-perform algorithms not using a split. These results help explain why co-training algorithms are both discriminativein nature and robust to the assumptions of their embedded classifiers.3.2 文本学习工作的引导标题:Bootstrapping for Text Learning Tasks链接:Papers 论文集\AI 人工智能\Machine Learning 机器学习\Bootstrap for Text Learning Tasks.ps作者:Rosie Jones, Andrew McCallum, Kamal Nigam, Ellen Riloff备注:Rosie Jones (rosie@, 1 School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213)Andrew McCallum (mccallum@, 2 Just Research, 4616 Henry Street, Pittsburgh, PA 15213)Kamal Nigam (knigam@)Ellen Riloff (riloff@, Department of Computer Science, University of Utah, Salt Lake City, UT 84112)摘要:When applying text learning algorithms to complex tasks, it is tedious and expensive to hand-label the large amounts of training data necessary for good performance. This paper presents bootstrapping as an alternative approach to learning from large sets of labeled data. Instead of a large quantity of labeled data, this paper advocates using a small amount of seed information and alarge collection of easily-obtained unlabeled data. Bootstrapping initializes a learner with the seed information; it then iterates, applying the learner to calculate labels for the unlabeled data, and incorporating some of these labels into the training input for the learner. Two case studies of this approach are presented. Bootstrapping for information extraction provides 76% precision for a 250-word dictionary for extracting locations from web pages, when starting with just a few seed locations. Bootstrapping a text classifier from a few keywords per class and a class hierarchy provides accuracy of 66%, a level close to human agreement, when placing computer science research papers into a topic hierarchy. The success of these two examples argues for the strength of the general bootstrapping approach for text learning tasks.3.3 ★采用机器学习技术来构造受限领域搜索引擎标题:Building Domain-specific Search Engines with Machine Learning Techniques链接:Papers 论文集\AI 人工智能\Machine Learning 机器学习\Building Domain-Specific Search Engines with Machine Learning Techniques.ps作者:Andrew McCallum, Kamal Nigam, Jason Rennie, Kristie Seymore备注:Andrew McCallum (mccallum@ , Just Research, 4616 Henry Street Pittsburgh, PA 15213)Kamal Nigam (knigam@ , School of Computer Science, Carnegie Mellon University Pittsburgh, PA 15213)Jason Rennie (jr6b@)Kristie Seymore (kseymore@)摘要:Domain-specific search engines are growing in popularity because they offer increased accuracy and extra functionality not possible with the general, Web-wide search engines. For example, allows complex queries by age-group, size, location and cost over summer camps. Unfortunately these domain-specific search engines are difficult and time-consuming to maintain. This paper proposes the use of machine learning techniques to greatly automate the creation and maintenance of domain-specific search engines. We describe new research in reinforcement learning, information extraction and text classification that enables efficient spidering, identifying informative text segments, and populating topic hierarchies. Using these techniques, we have built a demonstration system: a search engine forcomputer science research papers. It already contains over 50,000 papers and is publicly available at ....采用多项Naive Bayes 文本分类模型。
primary outcome was the rate of revascularization following stenting.Results26patients met the inclusion criteria with a mean age of56.5years old,34.6%of whom were female.On presenta-tion the median National Institute of Health Stroke Scale (NIHSS)was11and media Alberta Stroke Program Early CT Score(ASPECTS)was9.MT was performed using A Direct Aspiration First Pass T echnique(ADAPT)in all patients.Fol-lowing Neuroform Atlas stent placement,3patients(11.5%) had moderate in stent stenosis while severe stenosis was encountered in4patients(15.4%).The rate of successful revascularization(TICI IIB-III)was identified in92.3%of the patients.On follow up vascular images,re-occlusion occurred in2patients(7.7%)and symptomatic hemorrhage was encountered in3patients(11.5%).Excellent outcome at90 days(mRS0–2)was achieved in13/26(50%)of patients. Conclusions Our series provides preliminary safety and efficacy data regarding the use of the Neuroform Atlas stent as a res-cue modality in ICAS-ELVO cases.Disclosures jthia:None. E.Almallouhi:None.K.Kicie-linski:None.J.Lena:None. A.Spiotta:None.S.Al Kasab: None.E-066ROBOTIC ARM USE IN NEUROENDOVASCULARPROCEDURES:SYSTEMATIC REVIEW OF LITERATUREE Almallouhi,S Al Kasab,E Brennan,A Spiotta.Medical University of South Carolina, Charleston,SC10.1136/neurintsurg-2022-SNIS.177Background The use of robotic arm in neuroendovascular pro-cedures has gained increasing popularity in the last few years. The theoretical benefits of using a robotic arm include more accurate deployment of stents and coils,and the ability to per-form procedures remotely.However,limited evidence is cur-rently available to support the use of robotic arm in routine neuroendovascular practice.Methods Databases searched include PubMed,CINAHL Com-plete,and Scopus from database date of inception through February,11th2022.We included all human studies that reported the procedural and clinical outcomes of using a robotic arm as a primary approach to perform neuroendovas-cular procedures.The search strategies used a combination of subject headings and keywords for the following two concepts: robotic arm,and neuroendovascular procedures.Results A total of11studies were identified including10case reports/case series and1comparative study.Overall,65proce-dures were performed using the CorPath(Corindus Inc.) robotic arm including28diagnostic cerebral angiograms,28 cervical carotid stents,8cerebral aneurysm embolization,and one selective spinal angiogram.No complications were reported and only one case(1.5%)required conversion to manual approach.In the single comparative study that com-pared manual vs.robotic carotid stenting,there was no differ-ence in the procedural and clinical outcomes in both groups. Conclusion The use of robotic arm is a promising new tech-nology in the neuroendovascular field.Future comparative studies are needed to confirm efficacy and safety of using the robotic arm.Disclosures E.Almallouhi:None.S.Al Kasab:None. E. Brennan:None. A.Spiotta:1;C;Stryker,Penumbra,and Medtronic.E-067VERAPAMIL AND ITS ASSOCIATION WITH HIVES INRADIAL ARTERY CATHETERIZATION FORNEUROENDOVASCULAR DIAGNOSTIC ANGIOGRAMS1D Romeo,2M Salem,2J Burkhardt,2B Jankowitz.1Perelman School of Medicine,Universityof Pennsylvania,Philadelphia,PA;2Department of Neurosurgery,University of Pennsylvania, Philadelphia,PA10.1136/neurintsurg-2022-SNIS.178Introduction Different combinations of medications are utilizedduring radial artery(RA)catheterization for neuroendovascular procedures to preclude RA spasm.These combinations com-monly include verapamil,a calcium channel blocker amongthe‘radial cocktail’,without established benefit in mitigatingthe risk of RA spasm.However,the negative effects of verapa-mil such as the acute development of hives are sparsely reported in the context of RA neuro-angiography.We soughtto assess their association using a case-control cohort of oursingle center experience.Methods A series of consecutive patients undergoing diagnosticradial angiograms were reviewed and analyzed.Patients whohad verapamil in their medication cocktail were classified as‘cases’and patients without verapamil were‘controls’.We lim-ited the analysis to diagnostic angiograms,excluding treatment procedures to avoid potential confounding factors such as the complexity of a given treatment.The primary outcomes assessed were the presence of hives and radial artery spasm.Results215radial diagnostic neuro-angiography procedureswere included in our analysis.137patients underwent RA catherization with verapamil and84underwent RA catheriza-tion without verapamil.Of the137patients that received verapamil,4(2.9%)developed hives during the RA catheriza-tion procedure and were subsequently treated with Benadryl(25mg)and0(0.0%)experienced RA vasospasm.Of the78who did not receive verapamil,there were0(0.0%)cases ofhives and1(1.3%)case of RA spasm.Conclusion The administration of verapamil for those under-going RA vasospasm appears to be associated with the devel-opment of hives without significant reduction in the RAspasm risk.More data is needed to better understand the util-ity and safety of verapamil in RA catherization procedures. Disclosures D.Romeo:None.M.Salem:None.J.Burkhardt: None.B.Jankowitz:None.E-068A SINGLE-INSTITUTION RETROSPECTIVE ANALYSIS OFPEDIATRIC CEREBRAL VENOUS SINUS THROMBOSISM Brown.Interventional and Diagnostic Radiology,Aurora St.Luke’s Medical Center, Milwaukee,WI10.1136/neurintsurg-2022-SNIS.179Objective Pediatric cerebral venous sinus(sinovenous)throm-bosis(CSVT)is a rare complication with limited data on pre-sentation,treatment,and prognosis.Most literature consists ofcase reports and small case series that demonstrate variable morbidity and mortality outcomes.The purpose of this studywas to retrospectively analyze the risk of CSVT in a single-institution pediatric population,to identify correlating factors,and to evaluate clinical features,diagnosis,management,and prognosis.Methods A comprehensive retrospective review of electronic medical records was performed for9149hospitalizations in 6374unique patients evaluated by the pediatric neurosurgery on December 24, 2023 by guest. Protected by copyright./ J NeuroIntervent Surg: first published as 10.1136/neurintsurg-2022-SNIS.179 on 23 July 2022. Downloaded fromservice at Riley Hospital for Children(Indianapolis,IN)from 1990–2020.All patients18years of age or younger who were either admitted to the neurosurgical service or evaluated in consultation by neurosurgery were included.Results A total of36(0.56%)patients were found to have CSVT,19of which were males and17were females.Patients aged from3months to16years,with an average age of6.3 +/-6.1years and median of5years.Eleven(30.6%)patients presented with traumatic brain injury,7(19.4%)were found to have systemic infections,and17(47.2%)had some form of hypercoagulable state.At the time of CSVT diagnosis,no patient had a history of cancer.One(2.8%)patient was found to have upper extremity deep venous thrombosis.Thirteen (36.1%)patients were subsequently treated with anticoagulation.Conclusion This study is one of the largest single institution retrospective review of CSVT to date.Children admitted for non-operative traumatic brain injuries exhibited a statistically significant increased risk of CSVT.Death was associated with coma at presentation.Anticoagulation and thrombolytic proto-cols were not associated with improved morbidity and mortal-ity.Establishment of treatment guidelines,screening protocols, and prospective studies may contribute to more successful out-comes.(Study is ongoing and pending6additional cases,pos-sibly more,with additional chart review focusing on any interventions performed.)Disclosures M.Brown:None.E-069TREATMENT OF INTRACRANIAL INTERNAL CAROTID PSEUDOANEURYSM AND ANEURYSMALSUBARACHNOID HEMORRHAGE WITH PIPELINE SHIELDFLOW DIVERTER1M Abouelleil,2L Lyons,2K Aljaboori,3J Singer.1Spectrum Health/Michigan State,Grand Rapids,MI;2Spectrum Health/Michigan State,Grand Rapids,MI;3Neurosurgery,Spectrum Health/Michigan State,Grand Rapids,MI10.1136/neurintsurg-2022-SNIS.180Summary We describe the successful management of aneurys-mal subarachnoid hemorrhage(SAH)in two patients using Pipeline shield embolization and single antiplatelet therapy. The first patient,a43-year-old male,developed an iatrogenic supraclinoid internal carotid artery(ICA)pseudoaneurysm after pituitary tumor resection.The second patient had a ruptured left posterior inferior cerebellar artery(PICA)aneurysm.Both aneurysms were successfully treated with Pipeline flex shield embolization device with no intraoperative or perioperative complications.Stent patency was also confirmed6months after placement without intra-stent thrombus formation.Our successful experience with the Pipeline flex shield demon-strates the possibility of reducing dual antiplatelet therapy to a single agent in the setting of SAH.Background The commonly used treatment approaches for ruptured intracranial aneurysms are either endovascular coiling or surgical clipping.1The complexity of a considerable popu-lation of aneurysms,which can be dictated by shape,size,or location,makes them unamenable to either treatment approach.These aneurysms are usually managed with either stent assisted coiling or flow diverting stents.2,3Despite their promising results,thromboembolism and ischemia are known complications.4Although the use of antiplatelet therapy can reduce thrombogenicity,it increases the risk of bleeding,espe-cially in the setting of aneurysmal subarachnoid hemorrhage.Shielded Pipeline stents are flow diverting stents that are coated with phosphorylcholine,an antithrombotic agent that inhibits platelet aggregation and activation.The advent of this technology reduced the risk of thrombotic events compared to‘unshielded’stents.5Conclusion Our presented cases demonstrate the efficacy andsafety of Pipeline shield stents,combined with single antiplate-let therapy for6months,in the management of aneurysmalSAH.Disclosures M.Abouelleil:None.L.Lyons:None.K.Alja-boori:None.J.Singer:None.E-070THE USE OF INPATIENT VIRTUAL SHARED MEDICALAPPOINTMENTS FOR PATIENTS WITH ACUTECEREBROVASCULAR PATHOLOGIES AND THEIRCAREGIVERS:A PILOT STUDY TO IMPROVE HEALTHLITERACY,PATIENT SELF-EFFICACY AND REDUCEPROVIDER BURNOUT1U Mahajan,1N Sharma,1M Maynard,1L Kang,2C Labak,2M Sajatovic,2A Hoffer,2B Shammassian,2J Wright,2X Zhou,2C Wright.1Case Western Reserve University, Cleveland,OH;2University Hospitals Cleveland Medical Center,Cleveland,OH10.1136/neurintsurg-2022-SNIS.181Objective Admission to the hospital for an acute cerebrovascu-lar condition such as stroke or brain hemorrhage can be a traumatic and disorienting experience for patients and theirfamily members.The COVID-19pandemic has further intensi-fied this experience in addition to exacerbating clinician and resident burnout.T o ameliorate some of these concerns,ateam of resident and medical student trainees implemented avirtual shared medical appointment(vSMA)program for inpa-tients with acute cerebrovascular disorders and their caregivers.This study hypothesized that an early intervention vSMA improves patient and caregiver health literacy and prepared-ness,simultaneously educates trainees on effective communica-tion skills,and reduces clinician burnout.Methods Patients and caregivers of admitted patients were screened through the neurosurgery,neurocritical care,and neurology electronic medical record census.A weekly60-minute secure virtual session consisted of introductions,a10-minute standardized presentation on cerebrovascular disease management,followed by participant-guided discussion.Partici-pants completed pre-and post-surveys.We report data on this feasibility study and present challenges,both expected and unforeseen.Results A total of170patients were screened;13patients and26caregivers participated in at least1session.A total of6 different healthcare providers facilitated sessions.The vSMA program received overwhelmingly positive feedback from care-givers.Surveys demonstrated96.4%of caregivers and75%of patients were satisfied with the session.96.4%of caregiversand87.5%of patients would recommend this type of appointment to a friend or family member.88.8%of pro-viders felt validated by conducting the session.The participantgroup had a20%greater percentage of patients dischargedhome without home needs compared to the non-participant group.The primary obstacle encountered included technologi-cal frustrations with the consent process and the sessions themselves.Conclusions Implementation of a vSMA program at a tertiarycare center during a pandemic was feasible.Themes caregivers expressed on the post-survey included better understanding of on December 24, 2023 by guest. Protected by copyright./ J NeuroIntervent Surg: first published as 10.1136/neurintsurg-2022-SNIS.179 on 23 July 2022. Downloaded from。
Modality and DatabasesMelvin FittingDept.Mathematics and Computer ScienceLehman College(CUNY),Bronx,NY10468e-mail:fitting@web page:/fittingAbstract.Two things are done in this paper.First,a modal logic inwhich one can quantify over both objects and concepts is presented;asemantics and a tableau system are given.It is a natural modal logic,ex-tending standard versions,and capable of addressing several well-knownphilosophical difficulties successfully.Second,this modal logic is used tointroduce a rather different way of looking at relational databases.Theidea is to treat records as possible worlds,record entries as objects,andattributes as concepts,in the modal sense.This makes possible an in-tuitively satisfactory relational database theory.It can be extended,bythe introduction of higher types,to deal with multiple-valued attributesand more complex things,though this is further than we take it here.1IntroductionA few years ago my colleague,Richard Mendelsohn,and Ifinished work on our book,“First-Order Modal Logic,”[2].In it,non-rigidity was given an extensive examination,and formal treatments of definite descriptions,designation,exis-tence,and other issues were developed.I next attempted an extension to higher-order modal logic.After several false starts(or rather,unsatisfactoryfinishes) this was done,and a book-length manuscript is on my web page inviting com-ments,[1].Carrying out this extension,in turn,led me to rethink thefirst-order case.There were two consequences.First,I came to realize that the approach in our book could be extended,without leaving thefirst-order level,to produce a quite interesting logic with a natural semantics and a tableau proof procedure. And second,I realized that this modal logic provided a natural alternative set-ting for relational databases,which are usually treated usingfirst-order classical logic.In this paper I want to sketch both the modal logic and its application to databases.In a full treatment offirst-order modal logic,one must be able to discourse about two kinds of things:individual objects and individual concepts.“George Washington”and“Millard Fillmore”denote individual objects,while“the Pres-ident of the United States”denotes an individual concept,which in turn denotes various individuals at different times.Or again,at the time I am writing this the year is2000.This particular year is an individual object.“The current year”is an individual concept,and will not always denote2000.In[2]we had quan-tifiers ranging over individual objects,and constant symbols with values that2Melvin Fittingwere individual concepts.That was a good combination to elucidate a number of well-known philosophical problems,but it is not a full picture.In this paper the formal system presented will have quantifiers over individual objects,and also a second kind of quantifier ranging over individual concepts.Likewise there will be two kinds of constant symbols.The system of[2]can be embedded in the present one.(Of course this is only approximate.In our book we had function symbols,and we do not have them here.There are other differences as well,but the embedability claim is essentially correct.)I’ll begin with a presentation of the logic,and then consider its applications to databases.In a sense,using the modal logic of this paper to supply a semantics for rela-tional databases does not give us anything new.We are able to treat things that, previously,had been treated using classicalfirst-order logic.The modal point of view is substantially different,and hence interesting,but does not expand our concept of relational database.The real significance lies in what comes next, just after the conclusion of this paper.The modal logic presented here is the first-order fragment of a higher-order modal logic,with both extensional and in-tensional objects at each level.When such a logic is applied to database theory, we get a natural setting within which to model multiple-valued relations,rela-tions having afield whose values are sets of attributes,and more complex things yet.Think of the present paper,then,as providing a different point of view on what is generally understood,and as signaling the approach of an extension, which can be glimpsed down the road.2SyntaxThe syntax of this version offirst-order modal logic is a little more complex than usual,and so some care must be taken in its presentation.There are infinitely many variables and constants,in each of two categories: individual objects and individual concepts.I’ll use lowercase Latin letters x,y, z as object variables,and lowercase Greek lettersα,β,γas concept variables. (Based on the notion that the ancient Greeks were the theoreticians,while the Romans were the engineers.)The Greek letter ,with or without subscripts, represents a variable of either kind.For constants,I’ll use lowercase Latin letters such as a,b,c for both kinds,and leave it to context to sort things out.Definition1(Term).A constant symbol or a variable is a term.It is an ob-ject term if it is an individual object variable or constant symbol.Similarly for concept terms.If t is a concept term,↓t is an object term.It is called a relativized term.The idea is,if t is a concept term,↓t is intended to designate the object denoted by t,in a particular context.Sometimes I’ll refer to↓as the evaluate at operator.Since there are two kinds of variables and constants,assigning an arity to relation symbols is not sufficient.By a type I mean afinite sequence of o’s and c’s, such as c,o,c .Think of an o as marking an object position and a c as markingModality and Databases3 a concept position.There are infinitely many relation symbols of each type.In particular there is an equality symbol,=,of type o,o .That is,equality is a relation on individual objects.One could also introduce a notion of equality for individual concepts,but it will not be needed here.I allow the empty sequence as a type.It corresponds to what are sometimes called propositional letters,taking no arguments.Definition2(Formula).The set of formulas,and their free variables,is de-fined as follows.1.If P is a relation symbol of type ,it is an atomic formula,and has no freevariables.2.Suppose R is a relation symbol of type n1,n2,...,n k and t1,t2,...,t k isa sequence of terms such that t i is an individual object term if n i=o andis an individual concept term if n i=c.Then R(t1,t2,...,t k)is an atomic formula.Its free variables are the variable occurrences that appear in it. 3.if X is a formula,so are¬X,P X,and Q X.Free variable occurrences arethose of X.4.If X and Y are formulas,so are(X∧Y),(X∨Y),and(X⊃Y).Free variableoccurrences are those of X together with those of Y.5.If X is a formula and is a variable(of either kind),(∀ )X and(∃ )X areformulas.Free variable occurrences are those of X,except for occurrences of .6.If X is a formula, is a variable(again of either kind),and t is a term of thesame kind as , λ .X (t)is a formula.Free variable occurrences are those of X,except for occurrences of ,together with those of t.As usual,parentheses will be omitted from formulas to improve readability. Also=(x,y)will be written as x=y.Andfinally,a formula likeλ 1. λ 2. λ 3.X (t3) (t2) (t1)will be abbreviated by the simpler expressionλ 1, 2, 3.X (t1,t2,t3)and similarly for other formulas involving iterated abstractions.3SemanticsI will only formulate an S5logic—the ideas carry over directly to other logics, but S5is simplest,the ideas are clearest when stated for it,and it is all that is actually needed for databases.Frames essentially disappear,since we are dealing with S5.A model has a set of possible worlds,but we can take every world to be accessible from every other,and so no explicit accessibility relation is needed.4Melvin FittingThe usual constant/varying domain dichotomy is easily ignored.For first-order modal logics generally,a constant domain semantics can simulate a varying domain version,through the use of an explicit existence predicate and the rela-tivization of quantifiers to it.Here I’ll take object domains to be constant—not world dependent—which makes things much simpler.Since the language has two kinds of terms,we can expect models to have two domains—two sorts,in other words.There will be a domain of individual objects,and a domain of individual concepts.Concepts will be functions,from possible worlds to individual objects.It is not reasonable,or desirable,to insist that all such functions be present.After all,if there are countably many possible worlds,there would be a continuum of such concept functions even if the set of individual objects is finite,and this probably cannot be captured by a proof procedure.But anyway,the notion of an individual concept presupposes a kind of coherency for that individual concept—not all functions would be acceptable intuitively.I simply take the notion of individual concept as basic;I do not try to analyize any coherency condition.It is allowed that some,not necessarily all,functions can serve as individual concepts.Definition 3(Model).A model is a structure M = G ,D o ,D c ,I ,where:1.G is a non-empty set,of possible worlds ;2.D o is a non-empty set,of individual objects ;3.D c is a non-empty set of functions from G to D o ,called individual concepts ;4.I is a mapping that assigns:(a)to each individual object constant symbol some member of D o ;(b)to each individual concept constant symbol some member of D c ;(c)to each relation symbol of type a mapping from G to {false ,true };(d)to each relation symbol of type n 1,n 2,...,n k a mapping from G to the power set of D n 1×D n 2×···×D n k .It is required that I (=)be the constant mapping that is identically the equality relation on D o .Some preliminary machinery is needed before truth in a model can be char-acterized.Definition 4(Valuation).A valuation v in a model M is a mapping that assigns to each individual object variable some member of D o ,and to each indi-vidual concept variable some member of D c .Definition 5(Value At).Let M = G ,D o ,D c ,I be a model,and v be a valuation in it.A mapping (v ∗I )is defined,assigning a meaning to each term,at each possible world.Let Γ∈G .1.If is a variable,(v ∗I )( ,Γ)=v ( ).2.If c is a constant symbol,(v ∗I )(c,Γ)=I (c ).3.If ↓t is a relativized term,(v ∗I )(↓t,Γ)=(v ∗I )(t )(Γ).Modality and Databases5 Item3is especially significant.If↓t is a relativized term,t must be a constant or variable of concept type,and so(v∗I)(t)has been defined for it in parts1 and2,and is a function from worlds to objects.Thus(v∗I)(t)(Γ)is a member of D o.Now the main notion,which is symbolized by M,Γ vΦ,and is read:formula Φis true in model M,at possible worldΓ,with respect to valuation v.To make reading easier,the following special notation is used.Let 1,..., k be variables of any type,and let d1,...,d k be members of D o∪D c,with d i∈D o if the variable i is of object type,and d i∈D c if i is of concept type.ThenM,Γ vΦ[ 1/d1,..., k/d k]abbreviates:M,Γ v Φwhere v is the valuation that is like v on all variables except 1,..., k,and v ( 1)=d1,...,v ( k)=d k.Here is the central definition.For simplicity,take∨,⊃,∃,and Q as defined symbols,in the usual way.Definition6(Truth in a Model).Let M= G,D o,D c,I be a model,and v be a valuation in it.1.If P is of type ,M,Γ v P iffI(P)(Γ)=true.2.If R(t1,...,t k)is atomic,M,Γ v R(t1,...,t k)iff(v∗I)(t1,Γ),...,(v∗I)(t k,Γ) ∈I(R)(Γ).3.M,Γ v¬ΦiffM,Γ vΦ.4.M,Γ vΦ∧ΨiffM,Γ vΦand M,Γ vΨ.5.M,Γ v(∀x)ΦiffM,Γ vΦ[x/d]for all d∈D o.6.M,Γ v(∀α)ΦiffM,Γ vΦ[α/d]for all d∈D c.7.M,Γ v PΦiffM,∆ vΦfor all∆∈G.8.M,Γ v λ .Φ (t)if M,Γ vΦ[ /d],where d=(v∗I)(t,Γ).Definition7(Validity).A closed formula X is valid in a model if it is true at every world of it.A notion of consequence is a little more complicated because,in modal set-tings,it essentially breaks in two.These are sometimes called local and global consequence notions.For a set S of formulas,do we want X to be true at every world at which members of S are true(local consequence),or do we want X to be valid in every model in which members of S are valid(global consequence). These have quite differentflavors.Fortunately,for S5,the situation is somewhat simpler than it is for other modal logics since,to say X is valid in a model is just to say P X is true at some world of it.So,if we have a notion of local con-sequence,we can define a corresponding global consequence notion simply by introducing necessity symbols throughout.So,local consequence is all we need here.Definition8(Consequence).A closed formula X is a consequence of a set S of closed formulas if,in every model,X is true at each world at which all the members of S are true.6Melvin Fitting4RigidityAn individual concept term t can vary from world to world in what it designates. Call t rigid in a model if it is constant in that model,designating the same object at each world.This is a notion that plays an important role in philosophy.For instance Kripke[3],among others,asserts that names are rigid designators.The notion of rigidity can be captured by a formula.Assume c is an individual concept constant symbol in the following.λx.P(x=↓c) (↓c)(1) It is quite straightforward to show that(1)is valid in a model if and only if the interpretation of c is rigid in that model.In[2]this,in turn,was shown to be equivalent to the vanishing of the de re/de dicto distinction,though this will not be needed here.One can also speak of relativized notions of rigidity.Let us say the interpre-tation of c is rigid on a particular subset G0of the collection G of possible worlds of a model provided it designates the same object throughout G0.And let us say c is rigid relative to d in a model provided the interpretation of c is rigid on any subset of worlds on which the interpretation of d is rigid.(Of course,this notion applies to individual concept terms that are variables as well.I’m using constant symbols just as a matter of convenience.)The notion of c being rigid relative to d is captured by formula(2).λx,y.P[x=↓d⊃y=↓c] (↓d,↓c)(2) One can also consider more complicated situations.Formula(3)asserts that c is rigid relative to the rigidity of d and e jointly.λx,y,z.P[(x=↓d∧y=↓e)⊃z=↓c] (↓d,↓e,↓c)(3) Finally,one can even say that all individual concepts are rigid relative to c.This is done in formula(4).Individual concept quantification is obviously essential here.(∀α) λx,y.P[x=↓c⊃y=↓α] (↓c,↓α)(4) 5Databases With a Single RelationIn this section we begin taking a look at relational databases.What we consider is quite basic,and can be found in any textbook on databases—[4]is a good source.Relational databases are commonly reasoned about using classicalfirst-order logic.I want to show that modal logic is also a natural tool for this purpose. For now,only a single relation will be considered—this will be extended later.Modality and Databases7 The record is the basic unit of a relational database,yet it is not afirst-class object in the sense that it is not something we can get as an answer to a query. We could get a record number,perhaps,but not a record.We will take the records of a relational database to be the possible worlds of a Kripke model.In any standard modal language possible worlds,in fact,cannot be directly spoken of.The accessibility relation will be the usual S5one,though there could be circumstances where something more complex might be appropriate.Entries thatfillfields of a relational database generally can be of several data types.To keep things simple,let’s say there is just one data type used for this purpose.(In examples I’ll use strings.)Looking at this in terms of modal logic, thesefield entries will be the individual objects of a Kripke model.Next come the attributes themselves.If the database is one listing family relationships,say,and there is an attribute recording“father-of,”it has a value that varies from record to record,but in every case that value is what we have taken to be an individual object.In other words,attributes are simply individual concepts.The next question is,what about things like functional dependencies,keys, and so on?Let’s begin with the notion of functional dependency.Say we have a relational database in which there are two attributes,call them c and d,and c is functionally dependent on d.Then,if we are at an arbitrary possible world (record)at which c and d have particular values,at any other world at which d has the value it has in this one,c must also have the same value it has in this one.This can be expressed by requiring validity of the following formula,in which we assume c and d of the Kripke model also occur as individual concept constants of the language,and designate themselves.λx,y.P[x=↓d⊃y=↓c] (↓d,↓c)But this is just formula(2),and says c is rigid relative to d.In this case,a functional dependency can be expressed by a relative rigidity assertion.More complicated functional dependencies also correspond to relative rigidity formulas.For instance,if c is functionally dependent on{d,e},this is expressed by(3).Next,what about the notion of keys?As usually treated,to say an attribute c is a key is to say there cannot be two records that agree on the value of c. We cannot quite say that,since records cannot directly be spoken of.What we can say is that two possible worlds agreeing on the value of c must agree on the values of all attributes.More formally,this is expressed by the validity of the following formula.(∀α) λx,y.P[x=↓c⊃y=↓α] (↓c,↓α)Note that this is our earlier formula(4).Now,what does the design of a relation schema look like from the present modal point of view?We must specify the domain for atomic values of the re-lation schema.Semantically,that amounts to specifying the set D o of a modal8Melvin Fittingmodel.Proof-theoretically,it amounts to saying what the individual object con-stant symbols of the formal language are.(I’ll generally assume that constant symbols of the language can also occur in models,and designate themselves.) Next,we must specify what the attributes for the relation schema are.This amounts to specifying the set D c of a model,or the set of individual concept constant symbols of a language.Finally,we must impose some constraints,such as requiring that some at-tribute or set of attributes be a key,or that various functional dependencies must hold.This corresponds to taking appropriate relative rigidity formulas as axioms.6A Simple ExampleIn this section I’ll show how a simple,standard,example translates into modal language both semantically and proof-theoretically.Consider the relation schema withfive attributes:NAME,SSN,BIRTHDATE,JOBNUMBER,and JOBTITLE.It will be assumed that SSN is the primary key,and JOBNUMBER is functionally dependent on JOBTITLE.We set up a formal language with“NAME,”“SSN,”“BIRTHDATE,”“JOBNUMBER,”and“JOBTITLE”as individual concept constant symbols.Then we adopt the fol-lowing two constraint axioms.1.P(∀α) λx,y.P[x=↓SSN⊃y=↓α] (↓SSN,↓α)2.P λx,y.P[x=↓JOBTITLE⊃y=↓JOBNUMBER] (↓JOBTITLE,↓JOBNUMBER) Table1displays a particular relation instance of this relation schema.NAME SSN BIRTHDATE JOBNUMBER JOBTITLEAdam101/06/-40041GardenerEve201/08/-40042ExplorerCain310/21/-40041GardenerAbel411/05/-40032ShepherdSeth502/04/-39832ExplorerTable1.The relation PERSONSTo represent this relation instance as a modal axiomatic theory,we add the following to the constraint axioms above;we call them instance axioms.3.Q[(↓NAME=Adam)∧(↓SSN=1)∧(↓BIRTHDATE=01/06/-4004)∧(↓JOBNUMBER=1)∧(↓JOBTITLE=Gardener)]4.Q[(↓NAME=Eve)∧(↓SSN=2)∧(↓BIRTHDATE=01/08/-4004)∧(↓JOBNUMBER=2)∧(↓JOBTITLE=Explorer)]5.Q[(↓NAME=Cain)∧(↓SSN=3)∧(↓BIRTHDATE=10/03/-4004)∧(↓JOBNUMBER=1)∧(↓JOBTITLE=Gardener)]Modality and Databases 96.Q [(↓NAME =Abel )∧(↓SSN =4)∧(↓BIRTHDATE =08/05/-4003)∧(↓JOBNUMBER =2)∧(↓JOBTITLE =Shepherd )]7.Q [(↓NAME =Seth )∧(↓SSN =5)∧(↓BIRTHDATE =02/04/-3983)∧(↓JOBNUMBER =2)∧(↓JOBTITLE =Explorer )]This,of course,assumes individual object constant symbols,“01/06/-4004,”“Adam ,”and so on have been added to the language.I’ll also assume these sym-bols are intended to designate distinct objects.This gives us a (long)list of axioms.8.¬(1=2),¬(Adam =Eve ),etc.Corresponding to this,semantically,we have the following S5model.There are five possible worlds,one for each of the five rows of Table 1;call them Γ1,Γ2,Γ3,Γ4,and Γ5.D o ={Adam ,1,01/06/-4004,...}.D c ={ NAME , S SN , BIRTHDATE , JOBNUMBER , JOBTITLE },where NAME is the function that maps Γ1to Adam ,Γ2to Eve ,and so on.I (Adam )=Adam ,...,I (NAME )= NAME,and so on.Finally,here are some sample queries,in modal language.First,who are the explorers?This corresponds to the following,in which appropriate keys (social security numbers)are desired.λx.Q [(↓SSN =x )∧(↓JOBTITLE =Explorer )] (5)Suppose we abbreviate formula (5)by Q .Then,on the one hand,Q (z )is true in the modal model we constructed just in case z is 2or 5.On the other hand,Q (z )is provable in the axiom system we constructed just in case z is 2or 5.Here is a second sample query:is there more than one gardener?(∃x )(∃y ){Q [(↓SSN =x )∧(↓JOBTITLE =Gardener )]∧Q [(↓SSN =y )∧(↓JOBTITLE =Gardener )]∧¬(x =y )}(6)Formula (6)is derivable from our axioms,and true in our model.7ConnectionsIn the example of the previous section we saw that being a consequence of certain axioms and being true in a particular model could coincide.Now we examine to what extent this is generally the case.Suppose we have a relation schema R and a corresponding set of constraints concerning keys and functional dependencies.Associated with R is a set of con-straint axioms ,which I’ll denote axiom (R ),consisting of formulas like (2),(3),and (4).I’ll omit an exact definition—axioms 1and 2of the example in the pre-vious section is a sufficient guide.Note that these axioms are either quantifier free,or else involve just universal quantifiers,and P is the only modal operator.10Melvin FittingNext,suppose we have a relation instance r of the relation schema R—aparticular set of tuples.Associated with this is a set of instance axioms,all ofwhich are quantifier free.Again I omit an exact definition,but axioms3–7of theprevious section illustrate the notion sufficiently.Finally there are distinctnessaxioms,as in axiom8of the previous section.By axiom(r)I mean the collectionof these instance axioms and distinctness axioms,together with the members ofaxiom(R).Clearly,to say r is an instance of R and satisfies the constraints,isjust to say axiom(r)is a consistent set of model axioms.Next,we want a designated modal model to correspond to relation instancer.Again,the example of the previous section serves as a guide.We want themodel,denote it by model(r),meeting the following conditions.The collectionof possible worlds G is the collection of tuples in r.The domain D o of individualobjects is just the collection of table entries in r.The domain D c of individualconcepts is the collection of attributes of relation schema R.The interpretation I maps each table entry(as a constant of the modal language)to itself(as a member of D o).And I maps each attribute ATT to the function whose value attuple(possible world)Γis the entry in the tupleΓcorresponding to ATT.Theonly relation symbol is=,which is interpreted as equality on D o.Question:what are the connections between axiom(r)and model(r)?I don’tknow the most general answer to this,but here is something that accounts forwhat was seen in the previous section.Note that the queries considered there,formulas(5)and(6),were either quantifier free or involved existential quantifiersof individual object type only.This is significant.Definition9.Call a closed modal formula simple existential if it is of the form(∃x1)···(∃x n)QΦwhereΦis quantifier and modality free,and contains only=as a relation symbol. Proposition10.For a relation instance r and a simple existential sentence X, X is a consequence of axiom(r)if and only if X is true in model(r).I’ll postpone a proof of this to Section12.3.8Partial ConceptsWe have taken individual concepts to be total functions on the set of possibleworlds of a modal model.But there are many circumstances where a more generalnotion is desirable.“The King of France,”for instance,designates an individualat many points in history,but not at all of them.Fortunately,it is straightforwardto allow partiality.Definition3,of modal model,is changed as follows.From now on D c will be anon-empty set of functions,each from some subset of G to D o,where that subsetcan be proper.IfΓis not in the domain of some individual concept f,we willwrite f(Γ)=⊥,where⊥is an arbitrary item not a member of D o.Definition5,Modality and Databases11 value at,can be used with no change in wording,but notice that the scope of part3has been extended.If↓t is a relativized term,andΓis not in the domain of(v∗I)(t),then(v∗I)(↓t,Γ)=(v∗I)(t)(Γ)=⊥.Now Definition6,truth in a model,must also be modified.I’ll follow the pretty obvious general principle that one cannot ascribe properties to what is designated by a non-designating term.In the Definition,item2is changed to read as follows.2.If R(t1,...,t k)is atomic,(a)if any of(v∗I)(t1,Γ),...,(v∗I)(t k,Γ)is⊥then M,Γ v R(t1,...,t k);(b)otherwise M,Γ v R(t1,...,t k)iff (v∗I)(t1,Γ),...,(v∗I)(t k,Γ) ∈I(R)(Γ).Also item8must be changed.8.For an abstract λ .Φ (t),(a)if(v∗I)(t,Γ)=⊥,M,Γ v λ .Φ (t);(b)otherwise M,Γ v λ .Φ (t)if M,Γ vΦ[ /d],where d=(v∗I)(t,Γ).Notice that,with the definitions modified in this way,↓t=↓t is true at a world of a model if and only if the term t“designates”at that world.This makes possible the following piece of machinery.Definition11(Designation Formula).D abbreviates the abstract λα.↓α=↓α .Clearly M,Γ v D(t)iff(v∗I)(t,Γ)=⊥,where M= G,D o,D c,I .Thus D really does express the notion of designation.Now our earlier notions of rigidity and relative rigidity must be modified.We say c is rigid if it designates the same thing in all worlds in which it designates at all.This means formula(1)must be replaced with the following,if we want to express a notion of rigidity allowing for partial concepts.D(c)⊃ λx.P[D(c)⊃(x=↓c)] (↓c)(7) Likewise,c being rigid relative to d must be modified.It should now say:if d designates in two worlds,and designates the same thing,then if c also designates in those worlds,it must designate the same thing at both.This means formula (2)must be replaced with the following.(D(c)∧D(d))⊃ λx,y.P[(D(c)∧D(d)∧x=↓d)⊃(y=↓c)] (↓d,↓c)(8) Similar changes must be made to the other notions from Section4.In par-ticular,(4),expressing that every attribute is rigid relative to c,gets expressed as follows.(∀α){(D(c)∧D(α))⊃ λx,y.P[(D(c)∧D(α)∧x=↓c)⊃(y=↓α)] (↓c,↓α)}(9)12Melvin Fitting9Relational Databases More GenerallyA relational database generally has more than one relation involved.Now that partial individual concepts are available,this is easy to handle.Suppose we add to the database containing the relation given in Table1a second relation,given in Table2.JOBNUMBER WHERE1Home2AwayTable2.The relation LOCATIONWe allowed,in our modal language,relation symbols of type .Let us in-troduce two specific ones,PERSONS and LOCATION,intended to distinguish the two relations we now have.The idea is,we will have two kinds of possible worlds,those at which LOCATION is true and those at which PERSONS is true. Thefirst kind of world should correspond to a row of the LOCATION table,and so JOBNUMBER and WHERE should be defined,but nothing else.Similarly for the second kind.This gives us the following new kinds of constraint axioms.1.P{PERSONS⊃[D(JOBNUMBER)∧¬D(WHERE)∧D(NAME)∧D(SSN)∧D(BIRTHDATE)∧D(JOBTITLE)]}2.P{LOCATION⊃[D(JOBNUMBER)∧D(WHERE)∧¬D(NAME)∧¬D(SSN)∧¬D(BIRTHDATE)∧¬D(JOBTITLE)]}We still want the functional dependencies we had before,but these need to be modified to take partiality of intensional concepts into account.We also want a new dependency saying WHERE is functionally dependent on JOBNUMBER.These take the following form.3.P(∀α){(D(SSN)∧D(α))⊃ λx,y.P[(D(SSN)∧D(α)∧x=↓SSN)⊃(y=↓α)] (↓SSN,↓α)}4.P{(D(JOBNUMBER)∧D(JOBTITLE))⊃λx,y.P[(D(JOBNUMBER)∧D(JOBTITLE)∧x=↓JOBTITLE)⊃(y=↓JOBNUMBER)] (↓JOBTITLE,↓JOBNUMBER)}5.P{(D(JOBNUMBER)∧D(WHERE))⊃λx,y.P[(D(JOBNUMBER)∧D(WHERE)∧x=↓WHERE)⊃(y=↓JOBNUMBER)] (↓WHERE,↓JOBNUMBER)}Next we need the instance axioms.These are quite straightforward.6.Q[LOCATION∧(↓JOBNUMBER=1)∧(↓WHERE=Home)]7.Q[LOCATION∧(↓JOBNUMBER=2)∧(↓WHERE=Away)]。