Idempotent conjunctive combination of belief functions: Extending the minimum rule of possibility theory

When conjunctively merging two belief functions concerning a single variable but coming from different sources, Dempster rule of combination is justified only when information sources can be considered as independent. When dependencies between sources are ill-known, it is usual to require the property of idempotence for the merging of belief functions, as this property captures the possible redundancy of dependent sources. To study idempotent merging, different strategies can be followed. One strategy is to rely on idempotent rules used in either more general or more specific frameworks and to study, respectively, their particularization or extension to belief functions. In this paper, we study the feasibility of extending the idempotent fusion rule of possibility theory (the minimum) to belief functions. We first investigate how comparisons of information content, in the form of inclusion and least-commitment, can be exploited to relate idempotent merging in possibility theory to evidence theory. We reach the conclusion that unless we accept the idea that the result of the fusion process can be a family of belief functions, such an extension is not always possible. As handling such families seems impractical, we then turn our attention to a more quantitative criterion and consider those combinations that maximize the expected cardinality of the joint belief functions, among the least committed ones, taking advantage of the fact that the expected cardinality of a belief function only depends on its contour function.     

Scheduling loops with partial loop-carried dependencies

This paper deals with task scheduling, where each task is one particular iteration of a DO loop with partial loop-carried dependencies. Independent iterations of such loops can be scheduled in an order different from the one of classical serial execution, so as to increase program performance.The approach that we present is based both on the use of a directive added to the High Performance Fortran (HPF2) language, which specifies the dependencies between iterations, and on inspector/executor support, implemented in the CoLUMBO library, which builds the task graph and schedules tasks associated with iterations. We validate our approach by showing results achieved on an IBM SP2 for a sparse Cholesky factorization algorithm applied to real problems.     

面向Java语言生态的软件供应链安全分析技术

随着开源软件技术的不断发展,为提高开发效率并降低人力成本,组件化开发模式逐渐得到行业的认可,开发人员可以利用相关工具便捷地使用第三方组件,也可将自己开发的组件贡献给开发社区,从而形成了软件供应链.然而,这种开发模式必然会导致高危漏洞随组件之间的依赖链条扩散到其他组件或项目,从而造成漏洞影响的扩大化,例如2021年底披露的Log4j2漏洞,通过软件供应链对Java生态安全造成了巨大影响.当前针对Java语言软件供应链安全的分析与研究大多是对组件或项目进行抽样调研,这忽略了组件或项目对整个开源生态的影响,无法精准衡量其对生态所产生的影响.为此,本文针对Java语言生态软件供应链安全分析技术展开研究,首次给出了软件供应链安全领域的组件依赖关系和影响力等重要指标的形式化定义,并依据此提出了基于索引文件的增量式组件配置收集和基于POM语义的多核并行依赖解析,设计实现了Java开源生态组件依赖关系提取与解析框架,收集并提取超过880万个组件版本和6500万条依赖关系.在此基础上,本文以受到漏洞影响的日志库Log4j2为例,全面评估其对生态的影响以及修复比例,结果表明该漏洞影响了生态15.12%的组件(71082个)以及16.87%的组件版本(1488971个)同时仅有29.13%的组件在最新版本中进行了修复.     

关于传递闭包和函数依赖完备公理系统存在问题研究

数据依赖在数据库设计中起着十分重要的作用．自Ｃｏｄｄ提出函数依赖（ＦＤｓ）、Ｆａｇｉｎ引入多值依赖（ＭＶＤｓ）后，近几年来人们又根据设计中的需要引入多种新的依赖，如在工程数据库设计中所引进的传递闭包依赖（ＣＤｓ）等．对这些依赖一般是按其是否具有完备的公理系统而划分为两大类，因为完备性公理系统往往具有有效的判定算法为先决条件．本文对ＣＤｓ和ＦＤｓ的ｋ元完备公理系统存在问题进行了研究，证明了ＣＤｓ和ＦＤｓ不具有共同的ｋ元完备公理系统这一结论．     

一种基于数据相关性的乱序处理器验证方法

乱序执行是现代微处理器设计中普遍采用的提高流水线性能的方法,但乱序执行并乱序退出的全乱序结构在超标量处理器中应用并不普遍,这种全乱序的结构对基于参考模型的处理器正确性验证提出了巨大的挑战。主要介绍了从处理器的程序行为是否正确的最终标准——程序员可见的结构变量按程序行为进行顺序变化的角度对全乱序结构的处理器验证提出了一种全新的解决方法。     

How to hit scylla without avoiding charybdis: Comment on Perruchet, Tyler, Galland, and Peereman (2004).

M. Pe?a, L. L. Bonatti, M. Nespor, and J. Mehler (see record 2002-06215-001) argued that humans compute nonadjacent statistical relations among syllables in a continuous artificial speech stream to extract words, but they use other computations to determine the structural properties of words. Instead, when participants are familiarized with a segmented stream, structural generalizations about words are quickly established. P. Perruchet, M. D. Tyler, N. Galland, and R. Peereman (see record 2004-21166-008) criticized M. Pe?a et al.'s work and dismissed their results. In this article, the authors show that P. Perruchet et al.'s criticisms are groundless. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Correction to Perruchet et al. (2006).

Reports an error in "Do We Need Algebraic-Like Computations? A Reply to Bonatti, Pena, Nespor, and Mehler (2004)" by Pierre Perruchet, Ronald Peereman, and Michael D. Tyler (Journal of Experimental Psychology: General, 2006[May], 135(2), 322-326). The page numbers that Dr. Perruchet cited from Dr. Bonatti et al.'s article were printed incorrectly. These page numbers should appear as follows in the correction. (The following abstract of this article originally appeared in record 2006-06642-011.) L. L. Bonatti, M. Pena, M. Nespor, and J. Mehler (see record 2006-06642-010) argued that P. Perruchet, M. D. Tyler, N. Galland, and R. Peereman (see record 2004-21166-008) confused the notions of segmentation and generalization by ignoring the evidence for generalization in M. Pena, L. L. Bonatti, M. Nespor, and J. Mehler (see record 2002-06215-001). In this reply, the authors reformulate and complement their initial arguments, showing that their way of dealing with segmentation and generalization is not due to confusion or ignorance but rather to the fact that the tests used in Pena et al. make it likely that neither segmentation nor generalization were captured in their experiments. Finally, the authors address the challenge posed by Pena et al. of accounting for the whole pattern of their results without invoking rule-based, algebraic-like computations. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Analysis of dependencies in advanced transaction models

Transactional dependencies play an important role in coordinating and executing the subtransactions in advanced transaction processing models, such as, nested transactions and workflow transactions. Researchers have formalized the notion of transactional dependencies and have shown how various advanced transaction models can be expressed using different kinds of dependencies. Incorrect specification of dependencies can result in unpredictable behavior of the advanced transaction, which, in turn, can lead to unavailability of resources and information integrity problems. In this work, we focus on how to correctly specify dependencies in an advanced transaction. We enumerate the different kinds of dependencies that may be present in an advanced transaction and classify them into two broad categories: event ordering and event enforcement dependencies. Different event ordering and event enforcement dependencies in an advanced transaction often interact in subtle ways resulting in conflicts and redundancies. We describe the different types of conflicts that can arise due to the presence of multiple dependencies and describe how one can detect such conflicts. An advanced transaction may also contain redundant dependencies—these are dependencies that can be logically derived from other dependencies. We show how such extraneous dependencies can be eliminated to get an equivalent set of dependencies that has the same effect as the original set. Our dependency analysis is done in the context of a generalized advanced transaction model that is capable of expressing different kinds of advanced transactions. Recommended by: Amit Sheth     

Nondeterministic dependencies in relations: An extention of the concept of functional dependency

In the present article, some special semantic integrity constraints—so called nondeterministic dependencies—are proposed. These dependencies can be regarded as stochastic extensions of functional dependencies. After some basic definitions, the concept of nondeterministic dependency is introduced. Examples are given and an implementation for a statistical analysis system is described. Some properties are discussed.     

一种模糊项目调度问题的变宽Beam Search 算法

具有弹性约束和模糊工期的项目调度问题是一类具有实际应用意义但难于解决的问题.传统BS(Beam Search)方法存在常数线宽大小影响求解效果的问题.本文建立了此类项目调度问题的模型,并将序优化理论思想与BS方法结合,提出一种通过计算和改变线宽,兼顾解的质量和求解速度的变宽BS调度算法.仿真计算结果表明,该算法能够在较短时间内得到满意的调度结果,适用于实际模糊项目调度决策.