检索结果-南通市图书馆

semantics of Sexual Violence:The“Imperfect Victims”in the Italian Media

在线全文

学校读者我要写书评

暂无评论

Sociology Study 2022年第2期12卷 45-51页

作者： Alice Migliorelli Tor Vergata University of Rome RomeItaly

Starting from an etymological analysis of rape in the Indo-European language family,we want to trace the historical and semantic roots of this lexeme,in order to review its semantic and pragmatic development in the perception of Italian *** aim is to read and understand the rape victim socio-cultural stigma in collective *** is therefore possible to reconstruct the lexical,socio-semiotic,and narrative domain anticipating the phenomenology of victim blaming,which characterizes the media narratives of sexual *** victimological profile,socially expected and culturally accepted,seems to support the original semantic connotation of the Latin word stuprum,that is“corruption of virginity”,“contamination of purity”.Many typical mainstream discourses examined,through special“gender lenses”,provide portraits of imperfect,ambiguous,unreliable victims because they are deemed guilty of not being holy enough.

关键词： rape culture Italy victim blaming semantics media studies Critical Discourse Analysis(CDA)

Comparison of semantics of Disjunctive Logic Programs Based on Model-Equivalent Reduction

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2007年第4期22卷 562-568页

作者：赵希顺沈榆平 Institute of Logic and Cognition Sun Yat-Sen University

In this paper, it is shown that stable model semantics, perfect model semantics, and partial stable model semantics of disjunctive logic programs have the same expressive power with respect to the polynomial-time model-equivalent reduction. That is, taking perfect model semantics and stable model semantic as an example, any logic program P can be transformed in polynomial time to another logic program P＇ such that perfect models （resp. stable models） of P i-i correspond to stable models （resp. perfect models） of P＇, and the correspondence can be computed also in polynomial time. However, the minimal model semantics has weaker expressiveness than other mentioned semantics, otherwise, the polynomial hierarchy would collapse to NP.

关键词： disjunctive logic program semantics polynomial-time model-equivalent reduction quantified Boolean formula

A fully abstract semantics for value-passing CCS for trees

在线全文

学校读者我要写书评

暂无评论

Frontiers of Computer Science 2019年第4期13卷 828-849页

作者： Ying JIANG Shichao LIU Thomas EHRHARD State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing 100190 China University of Chinese Academy of Sciences Beijing 100049 China CNRS IRIF UMR 8243 Univ Paris Diderot Sorbonne Paris Cite F-75205 Paris France

We propose a fully abstract semantics for valuepassing CCS for trees (VCCTS) with the feature that processes are located at the vertices of a graph whose edges describe possible interaction capabilities. The operational semantics is given both in terms of a reduction semantics and in terms of a labelled transition semantics. We develop a theory of behavioral equivalences by introducing both weak barbed congruence and weak bisimilarity. In particular, we show that, on image-finite processes, weak barbed congruence coincides with weak bisimilarity. To illustrate potential applications and the powerful expressiveness of VCCTS, we formally compare VCCTS with some well-known models, e.g., dynamic pushdown networks, top-down tree automata and value-passing CCS.

关键词： process calculus non-interleaving semantics barbed congruence bisimulation

Load Balance Strategy of Data Routing Algorithm Using semantics for Deduplication Clusters

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Electronic Science and Technology 2017年第3期15卷 277-282页

作者： Ze-Jun Jiang Zhi-Ke Zhang Li-Fang Wang Chin-Chen Chang Li Liu School of Computer Science Northwestern Polytechnical University Xi'an 710072 IBM China Systems &Technology Lab Beijing 100193 Department of Information Engineering and Computer Science Feng Chia University Taichung 40724

The backup requirement of data centres is tremendous as the size of data created by human is massive and is increasing *** node deduplication cannot meet the increasing backup requirement of data centres.A feasible way is the deduplication cluster,which can meet it by adding storage *** data routing strategy is the key of the deduplication ***（data routing strategy using semantics） improves the storage utilization of MCS（minimum chunk signature） data routing strategy a ***,for the large deduplication cluster,the load balance of DRSS is worse than *** improve the load balance of DRSS,we propose a load balance strategy used for DRSS,namely *** a node is overloaded,DRSSLB iteratively migrates the current smallest container of the node to the smallest node in the deduplication cluster until this overloaded node becomes non-overloaded.A container is the minimum unit of data *** files sharing the same features or file names are stored in the same *** ensures the similar data groups are still in the same node after rebalancing the *** use the dataset from the real world to evaluate *** results show that,for various numbers of nodes of the deduplication cluster,the data skews of DRSSLB are under predefined value while the storage utilizations of DRSSLB do not nearly increase compared with DRSS,with the low penalty（the data migration rate is only6.5% when the number of nodes is 64）.

关键词： Index Terms--Data routing strategy deduplicationcluster semantics load balance.

Declarative semantics of programming in residuated lattice-valued logic

在线全文

学校读者我要写书评

暂无评论

Science China(Technological Sciences) 2000年第5期43卷 481-494页

作者：应明生 State Key Laboratory of Intelligent Technology and Systems Department of Computer Science and Technology Tsinghua University Beijing 100084 China

We give two generalizations of Tarski’s fixpoint theorem in the setting of residuated lattices and use them to establish van Emdem-Kowalski’s least fixpoint semantics for residuated lattice-valued logic programs.

关键词： logic programming declarative semantics residuated lattice fixpoint theorem completion of program.

Compactness theorems of fuzzy semantics

在线全文

学校读者我要写书评

暂无评论

Chinese Science Bulletin 2000年第2期45卷 120-125页

作者： WANG Guojun Institute of Mathematics, Shaanxi Normal University, Xi’an/710062, China Institute of Mathematics Shaanxi Nornial University Xi’an China

The relationship among diverse fuzzy semantics vs. the corresponding logic consequence operators has been analyzed systematically The results that compactness and logical compactness of fuzzy semantics are equivalent to compactness and continuity of the logic consequence operator induced by the semantics respectively have been proved under certain conditions. A general compactness theorem of fuzzy semantics have been established which says that every fuzzy semantics defined on a free algebra with members corresponding to continuous functions is compact.

关键词： fuzzy semantics compactness loglc compactness inductive set point compactness Lukasiewicz semantics.

Location and Its semantics in Location-Based Services

在线全文

学校读者我要写书评

暂无评论

Geo-Spatial Information Science 2007年第2期10卷 145-150页

作者： ZHAO Dongqing LUE Zhiping ZHANG Xiguang Institute of Surveying and Mapping Information Engineering University 66 Middle Longhai Road Zhengzhou 450052 China Geomatics and Applications Laboratory LiaoningTechnical University 47 Zhonghua Road Fuxin 123000 China

Starting with a simple presentation of location determination techniques, physical location and geographic location as two common kinds of location description methods are discussed. The semantic location concept is then introduced and a correction is given, which especially emphasizes that location property is an important part of semantic location. By analyzing the connotation and extension of every geographic location, what should be contained in a location property is determined. Using a hierarchical model, the relations and associations among locations are clearly described. To realize a formalized description of semantic location, an ontology technique that can adequately describe semantic information of location is used. Organized by ontology web language, a location ontology model allows semantic location to be read and processed by computer. The location ontology model realizes the knowledge description of location information and establishes an important foundation to personalized preference services in location based services.

关键词： personalized preference services location semantics ontology

Program generic set:semantics of medium logic program described by forcing

在线全文

学校读者我要写书评

暂无评论

Science China(Technological Sciences) 1996年第6期39卷 620-627页

作者：朱朝晖施庆生朱梧槚 Institute of Computer Science Nanjing University of Aeronautics and AstronauticsNanjing 210016China Department of Basic Sciences Nanjing Architectural and Civil Engineering InstituteNanjing 210009China State Key Laboratory for Novel Software Technology at Nanjing University Nanjing 210093China Institute of Computer ScienceNanjing University of Aeronautics and AstronauticsNanjing 210016China

The technique of forcing created by Cohen is adopted to discuss the semantics of medium logic program without closed-world assumption (CWA).The fixed point and complete-meet semilattice property ofprogram generic set ... 详细信息

关键词： medium logic program semantics non-CWA program generic set.

semantics in Image and Video Retrieval Systems

在线全文

学校读者我要写书评

暂无评论

The Journal of China Universities of Posts and Telecommunications 2002年第4期9卷 57-63页

作者： CAIJun LIXiao-fei LabofMultimediaCommunications DepartmentofInformationEngineeringNanjingUniversityofPostsandTelecommunicationsNanjing210003P.R.China LabofMultimediaCommunications DepartmentofInformationEngineering

Multimedia document annotation is used in traditional multimedia databasesystems. However, without the help of human beings, it is very difficult to extract the semanticcontent of multimedia automatically. On the other hand, it is a tedious job to annotate multimediadocuments in large databases one by one manually. This paper first introduces a method to constructa semantic net-work on top of a multimedia database. Second, a useful and efficient annotationstrategy is presented based on the framework to obtain an accurate and rapid annotation of anymultimedia databases. Third, two methods of joint similarity measures for semantic and low-levelfeatures are evaluated .

关键词： image retrieval video retrieval semantic-based information retrieval MPEG-7 content-based feature semantics