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     

基于MATLAB的异步电动机线性化控制系统的仿真

从异步电动机在同步旋转坐标系下的状态方程出发，在一定的条件下，对其系数矩阵简化．推出异步电动机的线性化控制模型．并基于该模型得出异步电动机的线性化控制系统．以给定电机为例，对该模型的有效性、响应用MATLAB进行仿真分析．验证的结果说明上述模型具有实用价值．     

Scheduling data transfers in a network and the set scheduling problem

In this paper we consider the online ftp problem. The goal is to service a sequence of file transfer requests given bandwidth constraints of the underlying communication network. The main result of the paper is a technique that leads to algorithms that optimize several natural metrics, such as max-stretch, total flow time, max flow time, and total completion time. In particular, we show how to achieve optimum total flow time and optimum max-stretch if we increase the capacity of the underlying network by a logarithmic factor. We show that the resource augmentation is necessary by proving polynomial lower bounds on the max-stretch and total flow time for the case where online and offline algorithms are using same-capacity edges. Moreover, we also give polylogarithmic lower bounds on the resource augmentation factor necessary in order to keep the total flow time and max-stretch within a constant factor of optimum.     

Cu~+、Ag~+、Au~+与乙硫醇的气相化学反应

利用激光溅射 分子束的技术 ,结合反射飞行时间质谱计 ,研究了Cu+、Ag+、Au+与乙硫醇的气相化学反应。结果显示这三种金属离子与 (CH3 CH2 SH) n 反应形成一系列团簇离子M+(CH3 CH2 SH) n,且团簇离子尺寸不一样。Ag+、Au+与乙硫醇的反应还生成了 (CH3 CH2 SH) +n ,由此推测Cu+、Ag+、Au+与乙硫醇团簇的反应存在两种通道 ,一种通道是生成M+(CH3 CH2 SH) n,另一种是生成 (CH3 CH2 SH) +n 。Cu+、Au+与乙硫醇的反应还生成了M+(H2 S) (M =Cu、Au) ,但是实验中没有观察到Ag+(H2 S) ,理论计算表明Ag+(H2 S)很不稳定。另外 ,分析产物离子M+(CH3 CH2 SH) n 的强度发现 ,n =1～ 2之间存在明显的强度突变现象     

资源有限的加权总完工时间单机排序问题

本讨论资源有限的加权总工时间单机排序问题，对现在仍为OPEN问题1｜pj=bj-ajuj，∑uj≤U｜∑wjCj给出了一个有关最优解中最优资源分配的重要性质，并利用该性质分别给出了三种情况bj=b,wj=w,aj=a；bj=b,wj=w,uj=u；aj=a,wj=w,uj=u的最优算法。     

多重休假的带启动--关闭期的Geom/G/1排队

本研究多重休假的带启动——关闭期的Geom／G／1离散时间排队，给出稳态队长，等待时间分布的母函数及其随机分解结果，推导出忙期的全假期的母函数，给出该模型的几个特例。     

Survivability in IP-over-WDM Networks: WDM Lightpath Protection versus IP LSP Protection

This article compares the performance of WDM lightpath protection and IP LSP protection schemes for IP-over-WDM networks. A mathematical formulation of the maximum throughput problem is presented and analytical expressions for recovery time are derived for both schemes. The throughputs and recovery times are analyzed and compared. Results show that the IP LSP protection scheme presents higher throughputs then WDM lightpath protection. The IP LSP protection scheme, providing individual IP LSP protection has, however, scalability problems. This scheme presents high recovery times when a failure affects many lightpaths and many hops are allowed for the primary routes of IP LSPs.     

Bounds to optimal burn‐in and optimal work size

Burn‐in is a widely used method to improve the quality of products or systems after they have been produced. In this paper, we consider the problem of determining the optimal burn‐in time and optimal work size maximizing the long‐run average amount of work saved per time unit in the computer applications. Assuming that the underlying lifetime distribution of the computer has an initially decreasing or/and eventually increasing failure rate function, an upper bound for the optimal burn‐in time is derived for each fixed work size and a uniform (with respect to the burn‐in time) upper bound for the optimal work size is also obtained. Furthermore, it is shown that a non‐trivial lower bound for the optimal burn‐in time can be derived if the underlying lifetime distribution has a large initial failure rate. Copyright © 2005 John Wiley & Sons, Ltd.     

用于强磁场的快响应真空规的研制进展

研制了能在强磁场、强干扰环境下工作的快响应真空电离规(快规),用于对HL 2A装置偏滤器室和等离子体附近的中性粒子密度和通量进行原位测量。介绍了快规的结构、工作原理、设计要点以及实验结果。在无磁场的情况下,快规对气体压强的测量范围为6.4×10-6～0.15Pa,在1×10-5～0.15Pa范围内,快规收集极离子流与发射电子流之比与气压保持良好线性关系;在0 15T的磁场下,快规的规管常数未发生显著变化,在规管对称轴与磁力线的夹角小于15o时,规管常数的变化小于10%。     

Fractional Brownian Heavy Traffic Approximations of Multiclass Feedforward Queueing Networks

We consider multiclass feedforward queueing networks under first in first out and priority service disciplines driven by long-range dependent arrival and service time processes. We show that in critical loading the normalized workload, queue length and sojourn time processes can converge to a multi-dimensional reflected fractional Brownian motion. This weak heavy traffic approximation is deduced from a deterministic pathwise approximation of the network behavior close to constant critical load in terms of the solution of a Skorokhod problem. Since we model the doubly infinite time interval, our results directly cover the stationary case.AMS subject classification: primary 90B15, secondary 60K25, 68M20