A distributed collaborative product design environment based on semantic norm model and role-based access control

With the boom of Internet Technology, it becomes possible to combine designers from different disciplines into one team to support product design globally. In this paper, a distributed collaborative product design environment is presented to support top-down process oriented product design. In conceptual design stage, the artifact is managed by semantic norm model (SNM). In SNM, the designers can define virtual components at early design stage and instantiate those components at later detailed design stage. By role-based access control (RBAC), different roles with corresponding permissions could be assigned to distributed designers, and the designers could concurrently modify different components of the product relevant to his or her roles. Based on the SNM and RBAC system, a distributed collaborative product design environment is developed and the top-down oriented product design process is demonstrated.     

Analysis of distribution time of multiple files in a P2P network

Peer-to-Peer (P2P) file sharing attracts much attention due to its scalability and robustness. One important metric in measuring the performance of a P2P file sharing system is the amount of time required for all peers to get the files. We refer this time as the file distribution time. Researchers have proposed protocols to minimize the file distribution time under different situation. However, most works are based on the single-file scenario. On the other hand, there are studies showing that in a file sharing application, users may download multiple files at the same time. In this paper, we analyze the minimum time needed to distribute multiple files. We develop an explicit expression for the minimum amount of time needed to distribute multiple files in a heterogeneous P2P fluid model. Unlike the single-file scenario, we demonstrate that the theoretical lower bound in multi-file is not always achievable. With a comprehensive consideration of all the configurations, we elaborate how to partition the bandwidth capacities of both seeds and leechers for a particular file such that the finish time is optimal.     

One-Way Functions Using Algorithmic and Classical Information Theories

We prove several results relating injective one-way functions, time-bounded conditional Kolmogorov complexity, and time-bounded conditional entropy. First we establish a connection between injective, strong and weak one-way functions and the expected value of the polynomial time-bounded Kolmogorov complexity, denoted here by?E(K ^t (x|f(x))). These results are in both directions. More precisely, conditions on?E(K ^t (x|f(x))) that imply that?f is a weak one-way function, and properties of?E(K ^t (x|f(x))) that are implied by the fact that?f is a strong one-way function. In particular, we prove a separation result: based on the concept of time-bounded Kolmogorov complexity, we find an interval in which every function?f is a necessarily weak but not a strong one-way function. Then we propose an individual approach to injective one-way functions based on Kolmogorov complexity, defining Kolmogorov one-way functions and prove some relationships between the new proposal and the classical definition of one-way functions, showing that a Kolmogorov one-way function is also a deterministic one-way function. A relationship between Kolmogorov one-way functions and the conjecture of polynomial time symmetry of information is also proved. Finally, we relate?E(K ^t (x|f(x))) and two forms of time-bounded entropy, the unpredictable entropy?H ^unp, in which ??one-wayness?? of a function can be easily expressed, and the Yao⁺ entropy, a measure based on compression/decompression schema in which only the decompressor is restricted to be time-bounded.     

Fast and effective color-based object tracking by boosted color distribution

In this paper, we propose a novel tracking algorithm, boosted color distribution (BCD), for tracking color objects. There exist three contributions in this paper. First, we propose a novel online gentle boost (OGB) algorithm for online learning. The essential idea of OGB is composed of two aspects: online updating candidate weak classifiers, and then choosing and combining them in a boosting way. Second, we design a novel weak classifier, log color feature distribution ratio, which focuses on the difference of color distributions rather than individual samples and provides a simple yet effective manner of mining color features for object tracking. Third, by combining our OGB algorithm and our log color features, we develop a fast yet effective color-based object tracking algorithm. Numerous experiments demonstrate that our tracking algorithm is better than or not worse than some state-of-the-art tracking algorithms on some public sequences.Overall, this paper presents a novel BCD algorithm for color object tracking that achieves good results at a fast speed.     

Effects of Bed Load Movement on Mean Flow Characteristics in Mobile Gravel Beds

The effects of bed-load movement on mean flow characteristics were experimentally investigated using particle image velocimetry (PIV). The gravel beds associated with open-channel flow are hydraulically rough, and two types of grain with different median diameters were used. The flow field and bed load motion images were simultaneously obtained via the particular experimental setup. The mass of sediment particles instantaneously moving on the bed, i.e., the sand-wave, was observed in the experiment. It was found that the sand-waves have an average friction angle of 11.2° and heights ranging from 2.2 d ₅₀ to 3.8 d ₅₀. The mean velocity profiles on the mobile bed can also be represented with logarithmic distribution with deviations occurred in the near wall region. Based on the Schultz–Grunow formula, a modified equation is developed in this study to better express the flow resistance factor in terms of the Reynolds number and the ratio of flow depth to roughness height.     

基于SD模型的深圳市水资源承载力研究

基于深圳市社会、经济、环境现状,在综合考虑水资源质和量的基础上,采用系统动力学方法建立深圳市水资源承载力模型,并对深圳市水资源承载力进行计算评价,结论是深圳市水资源承栽力普遍小于1。通过对16种方案的计算比较,提出进行产业结构调整、提高污水处理水平、提高节水程度、加强人口控制可以有效地提高深圳市水资源承载力,到2030年,其值能接近于1。     

水库移民后期扶持监测评估研究

根据监测评估实践,对水库移民后期扶持监测评估的主要内容、指标体系、调查表格、工作步骤、方法等进行了系统总结。指出:水库移民后期扶持评估内容主要包括扶持政策实施情况,扶持资金的征收、使用和管理情况,扶持政策实施效果等;后期扶持监测评估指标体系由资金发放、项目实施、政策实施保障和政策实施效果4个一级指标构成,下设16个二级指标、40个三级指标;评估方法有统计分析、对比分析、参与式评价和综合评价。     

黏性浆液在小孔隙多孔介质中扩散的流固耦合分析

该文基于有效应力原理建立了描述黏性浆液在小孔隙多孔介质中扩散的流固耦合模型.通过对小孔隙多孔介质注浆过程中的浆液渗流场分布与固体骨架的应力应变特性的流固耦合分析,得到了各动态参数如孔隙率、应变率等的相互关系并在施工现场进行了试验.经过与施工现场试验数据对比,得到的数值分析结果与试验结果基本一致,验证了该流固耦合模型运用于注浆工程的可行性与实用性,可作为小孔隙多孔介质地层防渗注浆设计和注浆效果的初步评判.