动产所有权合同移转模式的比较法研究

本文采用比较法的方法 ,就有体动产所有权合同移转模式进行了探讨。认为除法律另有规定或者当事人另有约定外 ,有体动产所有权的移转应该从交付受让人时发生 ;有体动产所有权移转的效力依赖于基础合同的存在及其有效。文章同时对我国《合同法》的相关条款存在的缺陷提出了自己的观点     

反思与完善：从应然视角分析我国私有财产权宪法保障规范

我国宪法经过四次修宪后，有关私有财产权保障规范体系已经形成，但是这并不能说明我国宪法上私有财产权保障规范方面完美无缺。本文试从应然的角度反思我国私有财产权保障的不足之处，并就我国实际提出完善的对策。     

接收天线等效电路的严格推导

从场的观点出发,利用反应概念并结合互易定理严格证明了接收天线可以等效为传统基于开路电压的等效模型,并指出了当电场分别与接收模式下和发射模式下的电流作反应时,将得到不同的等效电路参数;结合偶极子天线的数值例子,说明了传统的开路电压模型在接收系统的分析中更为方便、合理。     

论侵占罪中的遗忘物与埋藏物

侵占遗忘物和埋藏物是侵占罪的两个特殊类型。遗忘物是指持有人有意识地放置于某一特定场所,由于疏忽而忘记带走,而为该特定场所的特定人员所控制的动产,不包括遗失物。埋藏物是指埋没或隐藏于地下或他物之中的物,包括隐藏物。     

Markov Properties for Acyclic Directed Mixed Graphs

We consider acyclic directed mixed graphs, in which directed edges ( x → y ) and bi-directed edges ( x ↔ y ) may occur. A simple extension of Pearl's d -separation criterion, called m -separation, is applied to these graphs. We introduce a local Markov property which is equivalent to the global property resulting from the m -separation criterion for arbitrary distributions.     

论物权变动与物权公示的分离

物权公示的对象是物权,而不是物权变动。物权公示只是在物权已经发生变动以后,将新的静态的物权归属状况表征出来,与物权变动是否发生效力没有关系。物权变动和物权公示不是一个层面的问题,两者所实现的制度目标、追求的制度价值、考量的相关因素是不一样的。物权变动和物权公示可以分离,并且应当分离,这一点在动产和不动产上都得到了明显的体现。而物权变动模式不过是在当事人没有作出特殊约定的情况下,为双方当事人之间的物权变动确定一个科学而又合理的时间基准。     

Communication of risk: health hazards from mobile phones

Summary. Possible health hazards from mobile phones arise from the use of the phones themselves and via the base stations that relay signals. Except for an increase in traffic accidents induced by the use of mobile phones in cars the evidence for a health hazard is at most indirect, but it cannot be entirely dismissed; the phones have not been widely used for sufficiently long for direct epidemiological studies to have high sensitivity for detecting any induced incidence of cancer, for example. The background and evidence are briefly reviewed and the steps taken in the UK to make information widely available described.     

用谦抑性原则检讨我国刑法对教唆未遂的处罚规定

刑法谦抑性原则的要义就是缩小刑事处罚的范围和减轻刑事处罚的程度。我国刑法第 2 9条第 2款规定 :“如果被教唆的人没有犯被教唆的罪 ,对于教唆犯 ,可以从轻或减轻处罚。”这表明我国刑法对教唆未遂采必罚主义 ,这种做法有违谦抑性原则 ,且不具有可操作性。因此 ,该条款应修改为 :“如果被教唆的人没有犯被教唆的罪 ,如果此罪的法定最低刑为三年以上有期徒刑 ,对于教唆犯 ,可以比照所教唆之罪从轻、减轻或免除处罚。     

构建我国高校知识产权教育体系

高校知识产权教育是近年来人们关注的热点。针对我国高校知识产权教育管理中存在的问题，从高校知识产权教育现状入手，借鉴日本知识产权教育管理经验，提出构建中国高校知识产权教育体系的观点，并就高校知识产权教育及教育体系问题进行了分析。     

A Unified Approach to the Characterization of Equivalence Classes of DAGs, Chain Graphs with no Flags and Chain Graphs

Abstract.  A Markov property associates a set of conditional independencies to a graph. Two alternative Markov properties are available for chain graphs (CGs), the Lauritzen–Wermuth–Frydenberg (LWF) and the Andersson–Madigan– Perlman (AMP) Markov properties, which are different in general but coincide for the subclass of CGs with no flags . Markov equivalence induces a partition of the class of CGs into equivalence classes and every equivalence class contains a, possibly empty, subclass of CGs with no flags itself containing a, possibly empty, subclass of directed acyclic graphs (DAGs). LWF-Markov equivalence classes of CGs can be naturally characterized by means of the so-called largest CGs , whereas a graphical characterization of equivalence classes of DAGs is provided by the essential graphs . In this paper, we show the existence of largest CGs with no flags that provide a natural characterization of equivalence classes of CGs of this kind, with respect to both the LWF- and the AMP-Markov properties. We propose a procedure for the construction of the largest CGs, the largest CGs with no flags and the essential graphs, thereby providing a unified approach to the problem. As by-products we obtain a characterization of graphs that are largest CGs with no flags and an alternative characterization of graphs which are largest CGs. Furthermore, a known characterization of the essential graphs is shown to be a special case of our more general framework. The three graphical characterizations have a common structure: they use two versions of a locally verifiable graphical rule. Moreover, in case of DAGs, an immediate comparison of three characterizing graphs is possible.