Using activity focus networks to pressure terrorist organizations

The predominant idea for using network concepts to fight terrorists centers on disabling key parts of their communication networks. Although this counternetwork strategy is clearly a sound approach, it is vulnerable to missing, incomplete, or erroneous information about the network. This paper describes a different and complementary application of network concepts to terrorist organizations. It is based on activity focus networks (AFNs), which represent the complex activity system of an organization. An activity focus is a conceptual or physical entity around which joint activity is organized. Any organization has a number of these, which are in some cases compatible and in some cases incompatible. The set of foci and their relations of compatibility and incompatibility define the AFN. A hypothetical AFN for a terrorist organization is specified and tested in a simulation called AQAS. It shows that certain activity foci, and in particular one combination, have high potential as pressure points for the activity system. The AFN approach complements the counternetwork approach by reducing the downside risk of incomplete information about the communication network, and enhancing the effectiveness of counternetwork approaches over time. Steven R. Corman is Professor in the Hugh Downs School of Human Communication at Arizona State University and Chair of the Organizational Communication Division of the International Communication Association. His research interests include communication networks and activity systems, high-resolution text and discourse analysis, and modeling and simulation of human communication systems.     

Interpolation by a Game

We introduce a notion of a real game (a generalisation of the Karchmer-Wigderson game (cf. [3]) and of real communication complexity, and relate this complexity to the size of monotone real formulas and circuits. We give an exponential lower bound for tree-like monotone protocols (defined in [4, Definition 2.2]) of small real communication complexity solving the monotone communication complexity problem associated with the bipartite perfect matching problem. This work is motivated by a research in interpolation theorems for prepositional logic (by a problem posed in [5, Section 8], in particular). Our main objective is to extend the communication complexity approach of [4, 5] to a wider class of proof systems. In this direction we obtain an effective interpolation in a form of a protocol of small real communication complexity. Together with the above mentioned lower bound for tree-like protocols this yields as a corollary a lower bound on the number of steps for particular semantic derivations of Hall's theorem (these include tree-like cutting planes proofs for which an exponential lower bound was demonstrated in [2]).     

Strategies for multi-site GLP studies

 A GLP study can be performed at more than one site. This is called a multi-site study. Although, the study is performed at different sites, it is still one study and must completely comply with the GLP principles. The fact that different activities are conducted at different sites implies that the planning, the organization and the communication are crucial for the success of the study. This means that all the staff involved should know their responsibilities and should have the knowledge and skills to realize all the phases of the study according to the GLP principles. To achieve a well managed multi-site study, several strategies for setting up such a study can be followed. This paper focuses on the responsibilities, communication, and collaboration of the personnel, which are involved in a multi-site study. Several case studies are highlighted, and we concluded that the basic communication triangle in a single-site GLP study between test facility management, study director, and the quality assurance unit should be extended to the communication among test facility and test site management, study director, principle investigator(s), and the quality assurance units at the test sites. Introduction Received: 14 August 2002 Accepted: 26 November 2002     

Agro-industrial waste enzymes: Perspectives in circular economy

According to the Food and Agriculture Organization of the United Nations, approximately 1.3 billion tons of food is wasted each year, equivalent to approximately one-third of world production. Agri-food wastes are the source of proteins, carbohydrates, lipids, and other essential minerals that have been exploited for value-added products by the development of biorefineries and sustainable business as important elements of circular economies. The innovation and materialization of these types of processes, including the use of disruptive technologies on microbial bioconversion and enzyme technology, such as nanotechnology, metabolic engineering, and multi-omics platforms, increase the perspectives on the waste valorization process. Lignocellulolytic enzymes, pectinases, and proteases are mainly used as catalyzers on agri-food waste treatment, and their production in house might be the trend in near future for agro-industrial countries. Another way to transform the agri-food wastes is via aerobic or anaerobic microbial process from fungal or bacterial cultures; these processes are the key to produce waste enzymes.     

基于XMPP的智能小区远程控制系统研究与设计

为解决智能家居系统中的通信控制实时性不强,系统可扩展性较差的问题,从即时通信领域引入XMPP协议,对传输的XML消息格式进行了扩展,使其适合于家居设备信息的描述和传输。通过asmack类库开发家居远程控制端和家居网关客户端,并对OpenFire服务器进行二次开发,构建了远程控制系统,该系统兼具智能家居控制与即时通信功能,实验表明,该系统控制信息传输时延在150ms以内,服务器端能支持200000用户,能满足小区用户的日常需求。     

一种基于WSN的井下无线应急通信节点设计

摘　要：针对井下应急通讯需求,本文提出了基于无线传感器网络（WSN）的井下无线应急通信系统架构,设计由微处理器电路、无线收发模块、传感器电路、电源、和天线所组成的井下无线应急通信系统节点,低功耗设计。按照功能开展模块化,提高节点灵活适用性。最后测试了设计节点点对点通信性能,得到相应的距离与丢包率之间的关系曲线。井下无线应急通信有效通信距离达到45m,能够满足井下大规模应用组网需求。     

A novel quasi-phase-matching frequency doubling technique

A new quasi-phase-matching technique for efficient second-harmonic generation is reported. It is based on the spatial periodic modulation of the light intensity along the propagation direction, rather than the conventional spatial periodic modulation of the nonlinear optical coefficients. It can be realized by using a novel dual-channel waveguide frequency doubler structure for the desired light intensity distribution. This dual-channel waveguide device has major advantages including very small beam size, high light intensity within long nonlinear-waveguide interaction length, highly efficient second-harmonic generation, ease in fabrication of the nonlinear channel waveguides without any spatially periodic poling, and low waveguide propagation losses. The new quasi-phase-matching technique can also be applied to third-harmonic generation and other nonlinear optics processes.     

The analysis of the error statistics in a 5 × 40 Gbit/s fibre link with hybrid amplification

We quantify the error statistics and patterning effects in a 5 × 40 Gbit/s WDM RZ-OOK SMF/DCF fibre link using hybrid Raman/EDFA amplification. By extensive use of a numerical model, we determine how the error statistics change with the transmission distance. This knowledge is used as a basis for a constrained coding technique in order to improve the transmission error rate. We propose an adaptive constrained code for mitigation of the patterning effects and demonstrate that this approach can substantially reduce the bit error rate (BER) even for very large values of the channel BER (BER > 10^− 1). The proposed technique can be used in combination with forward error correction schemes (FEC) to extend the range of channel BERs that an FEC scheme is effective over.     

Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays

This paper addresses a certain type of scheduling problem that arises when a parallel computation is to be executed on a set of identical parallel processors. It is assumed that if two precedence-related tasks are processed on two different processors, due to the information transferring, there will be a task-dependent communication delay between them. For each task, a processing time, a due date and a weight is given while the goal is to minimize the total weighted late work. An integer linear mathematical programming model and a branch-and-bound algorithm have been developed for the proposed problem. Comparing the results obtained by the proposed branch-and-bound algorithm with those obtained by CPLEX, indicates the effectiveness of the method.