Experimental analysis, modeling, and theoretical design of McMaster pore-filled nanofiltration membranes

A side-by-side comparison of the performance of McMaster pore-filled (MacPF) and commercial nanofiltration (NF) membranes is presented here. The single-salt and multi-component performance of these membranes is studied using experimental data and using a mathematical model. The pseudo two-dimensional model is based on the extended Nernst–Planck equation, a modified Poisson–Boltzmann equation, and hydrodynamic calculations. The model includes four structural properties of the membrane: pore radius, pure water permeability, surface charge density and the ratio of effective membrane thickness to water content. The analysis demonstrates that the rejection and transport mechanisms are the same in the commercial and MacPF membranes with different contributions from each type of mechanism (convection, diffusion and electromigration). Solute rejection in NF membranes is determined primarily by a combination of steric and electrostatic effects. The selectivity of MacPF membranes is primarily determined by electrostatic effects with a significantly smaller contribution of steric effects compared to commercial membranes. Hence, these membranes have the ability to reject ions while remaining highly permeable to low molecular weight organics. Additionally, a new theoretical membrane design approach is presented. This design procedure potentially offers the optimization of NF membrane performance by tailoring the membrane structure and operating variables to the specific process, simultaneously. The procedure is validated at the laboratory scale.     

Time Series Prediction Based on Chaotic Attractor

A new prediction technique is proposed for chaotic time series. The usefulness of the technique is thatit can kick off some false neighbor points which are not suitable for the local estimation of the dynamics systems. Atime-delayed embedding is used to reconstruct the underlying attractor, and the prediction model is based on the timeevolution of the topological neighboring in the phase space. We use a feedforward neural network to approximate thelocal dominant Lyapunov exponent, and choose the spatial neighbors by the Lyapunov exponent. The model is testedfor the Mackey-Glass equation and the convection amplitude of lorenz systems. The results indicate that this predictiontechnique can improve the prediction of chaotic time series.     

On effectiveness of wiretap programs in mapping social networks

Snowball sampling methods are known to be a biased toward highly connected actors and consequently produce core-periphery networks when these may not necessarily be present. This leads to a biased perception of the underlying network which can have negative policy consequences, as in the identification of terrorist networks. When snowball sampling is used, the potential overload of the information collection system is a distinct problem due to the exponential growth of the number of suspects to be monitored. In this paper, we focus on evaluating the effectiveness of a wiretapping program in terms of its ability to map the rapidly evolving networks within a covert organization. By running a series of simulation-based experiments, we are able to evaluate a broad spectrum of information gathering regimes based on a consistent set of criteria. We conclude by proposing a set of information gathering programs that achieve higher effectiveness then snowball sampling, and at a lower cost. Maksim Tsvetovat is an Assistant Professor at the Center for Social Complexity and department of Public and International Affairs at George Mason University, Fairfax, VA. He received his Ph.D. from the Computation, Organizations and Society program in the School of Computer Science, Carnegie Mellon University. His dissertation was centered on use of artificial intelligence techniques such as planning and semantic reasoning as a means of studying behavior and evolution of complex social networks, such as these of terrorist organizations. He received a Master of Science degree from University of Minnesota with a specialization in Artificial Intelligence and design of Multi-Agent Systems, and has also extensively studied organization theory and social science research methods. His research is centered on building high-fidelity simulations of social and organizational systems using concepts from distributed artificial intelligence and multi-agent systems. Other projects focus on social network analysis for mapping of internal corporate networks or study of covert and terrorist orgnaizations. Maksim’s vita and publications can be found on Kathleen M. Carley is a professor in the School of Computer Science at Carnegie Mellon University and the director of the center for Compuational Analysis of Social and Organizational Systems (CASOS) which has over 25 members, both students and research staff. Her research combines cognitive science, social networks and computer science to address complex social and organizational problems. Her specific research areas are dynamic network analysis, computational social and organization theory, adaptation and evolution, text mining, and the impact of telecommunication technologies and policy on communication, information diffusion, disease contagion and response within and among groups particularly in disaster or crisis situations. She and her lab have developed infrastructure tools for analyzing large scale dynamic networks and various multi-agent simulation systems. The infrastructure tools include ORA, a statistical toolkit for analyzing and visualizing multi-dimensional networks. ORA results are organized into reports that meet various needs such as the management report, the mental model report, and the intelligence report. Another tool is AutoMap, a text-mining systems for extracting semantic networks from texts and then cross-classifying them using an organizational ontology into the underlying social, knowledge, resource and task networks. Her simulation models meld multi-agent technology with network dynamics and empirical data. Three of the large-scale multi-agent network models she and the CASOS group have developed in the counter-terrorism area are: BioWar a city-scale dynamic-network agent-based model for understanding the spread of disease and illness due to natural epidemics, chemical spills, and weaponized biological attacks; DyNet a model of the change in covert networks, naturally and in response to attacks, under varying levels of information uncertainty; and RTE a model for examining state failure and the escalation of conflict at the city, state, nation, and international as changes occur within and among red, blue, and green forces. She is the founding co-editor with Al. Wallace of the journal Computational Organization Theory and has co-edited several books and written over 100 articles in the computational organizations and dynamic network area. Her publications can be found at: http://www.casos.cs.cmu.edu/bios/carley/publications.php     

A Dominated Theorem on 5L(2, R) and Its Application

In this paper, we give the following dominated theorem: Let φ(g) ∈ L1(G//K),φε(t)=ε> 0, and the least radical decreasing dominatedfunction φ(t) = sup |φ(y)| ∈L1(G//K). If shtφ(t) is monotonically decreasingon (0, ∞), then for any f∈L1loc(G//K) , the following inequality holds:sup |φε * f(x)| ≤ Cmf(x),where mf(x) is the Hardy-Littlewood maximal function of f, and C = ||φ||1.An application of this dominated theorem is also given.     

可压稠密气固两相流动过程的模拟计算

基于稠密气体分子运动论和颗粒动理学,建立可压稠密气固两相流动模型。采用梯度模拟来考虑气相可压缩性对气相湍流的影响。模拟计算表明气固两相射流速度沿轴向和径向减小,颗粒浓度下降。气固两相射流具有高的颗粒温度,呈现强烈的气固两相湍流流动特性。     

基于园区网络的主动安全模型设计与研究

从现行典型园区网络安全设计方案入手，结合其在安全防范解决方案上存在的问题，提出了一种网络主动安全模型；在全局网络安全认识的基础上．阐述了模型组成部件的功能定义和网络主动安全实现流程；采用统一网络入口认证、网络知识发现及资源有效控制、沟通等手段，解决了现行网络安全设计中存在的恶意攻击行为源头定位困难，以及信息安全司法取证不准、网络资源安全被动防护、网络灾难快速反映能力差等问题．实验结果表明，该设计方案具有较好的可行性和实用性．     

Spectroscopic Studies of a Three-dimensional, Five-coordinated Copper(Ⅱ) Complex via Hydrogen Bonds: [Cu(PDA)(H_2O)_2](H_2PDA=Pyridine-2,6-dicarboxylic Acid)

IntroductionFive- coordinated complexes with d9- configuredcations have received much attention stereochemi-cally,spectrochemically and biologically,and havebeen comprehensively discussed[1] . Usually thereare two stable configurations for the copper( )complexes with five equal coordinating atoms:anapically elongated square pyramid( SP) and a com-pressed trigonal bipyramid( TBP) ,with an obviousenergetic preference for the latter coordination.When the ligands are rigid and provide angular d…     

Stable Ergodicity and Frame Flows

In this note we show that all diffeomorphisms close enough to the time-one map of the frame flow on certain negatively curved manifolds are ergodic. As a simple corollary we deduce that the frame flows are ergodic for all compact manifolds with curvature pinched sufficiently close to –1, thus providing results in the case of manifolds of dimension 7 or 8 which were missing from the results of Brin and Karcher.     

随机交通均衡配流模型及其等价的变分不等式问题

本文讨论了交通网络系统的随机用户均衡原理的数学表述问题.在路段出行成本是流量的单调函数的较弱条件下,对具有固定需求和弹性需求的模式,首次证明了随机均衡配流模型可表示为一个变分不等式问题,同时也说明了该变分不等式问题与相应的互补问题以及一个凸规划问题之间的等价关系.     

网络股泡沫大小测度研究

网络股泡沫是最能反映网络泡沫本质的表现形式，本文利用理性预期理论，构建了网络股泡沫大小的测度模型，说明网络股泡沫的存在，在此基础上确定了网络股泡沫大小的测度指标，并以雅虎公司股票为例对泡沫的大小进行了测度，结果符合网络泡沫的实际情况。