A web-based software tool for participatory optimization of conservation practices in watersheds

WRESTORE (Watershed Restoration Using Spatio-Temporal Optimization of Resources) is a web-based, participatory planning tool that can be used to engage with watershed stakeholder communities, and involve them in using science-based, human-guided, interactive simulation–optimization methods for designing potential conservation practices on their landscape. The underlying optimization algorithms, process simulation models, and interfaces allow users to not only spatially optimize the locations and types of new conservation practices based on quantifiable goals estimated by the dynamic simulation models, but also to include their personal subjective and/or unquantifiable criteria in the location and design of these practices. In this paper, we describe the software, interfaces, and architecture of WRESTORE, provide scenarios for implementing the WRESTORE tool in a watershed community's planning process, and discuss considerations for future developments.     

Managing readiness-relevant activities for the organizational dimension of ERP implementation

An organization requires performing readiness-relevant activities to ensure successful implementation of an enterprise resource planning (ERP) system. This paper develops a novel approach to managing these interrelated activities to get ready for implementing an ERP system. The approach enables an organization to evaluate its ERP implementation readiness by assessing the degree to which it can achieve the interrelated readiness relevant activities using fuzzy cognitive maps. Based on the interrelationship degrees among the activities, the approach clusters the activities into manageable groups and prioritizes them. To help work out a readiness improvement plan, scenario analysis is conducted.     

优化军工科研项目管理的具体策略

我国的军工科研所成立于上世纪，它以军工项目的科研、预研为主，为我国的国防军工提供研发产品。伴随着我国经济实力的增强和科技军事力量的增长，军工科研院所也转变了原有的工业专属性质，走上了军民两用、寓军于民的道路，并在时代的进步中成为了我国先进装备制造业的重要科研力量和科技创新支柱。凸现军事工业“高、精、尖”的特点，以项目管理的优化为具体策略进行军工科研开发工作。     

Operational time-series data modeling via LSTM network integrating principal component analysis based on human experience

Today’s information technologies involve increasingly intelligent systems, which come at the cost of increasingly complex equipment. Modern monitoring systems collect multi-measuring-point and long-term data which make equipment health prediction a “big data” problem. It is difficult to extract information from such condition monitoring data to accurately estimate or predict health statuses. Deep learning is a powerful tool for big data processing that is widely utilized in image and speech recognition applications, and can also provide effective predictions in industrial processes. This paper proposes the Long Short-term Memory Integrating Principal Component Analysis based on Human Experience (HEPCA-LSTM), which uses operational time-series data for equipment health prognostics. Principal component analysis based on human experience is first conducted to extract condition parameters from the condition monitoring system. The long short-term memory (LSTM) framework is then constructed to predict the target status. Finally, a dynamic update of the prediction model with incoming data is performed at a certain interval to prevent any model misalignment caused by the drifting of relevant variables. The proposed model is validated on a practical case and found to outperform other prediction methods. It utilizes a powerful deep learning analysis method, the LSTM, to fully process big condition monitoring series data; it effectively extracts the features involved with human experience and takes dynamic updates into consideration.     

User activities and the heterogeneity of urban space:The case of Dahiyat Al Hussein park

Urban researchers have maintained a constant interest in the complexity and continuity of urban space usage. Some have applied actor–network theory (ANT) to investigate the heterogeneity of spaces and present them through the networks of their users’ activities. However, these accounts are predominantly limited in examining the extent to which these spaces may be heterogeneous when exploring such networks. This paper draws on recent ANT scholarship, which employs an ethnographic research conducted in a main park in a housing project at Dahiyat Al Hussein in Amman, Jordan. The findings describe the complex and unpredictable negotiations that occur within spaces by documenting the varieties and interrelations among user activity networks within this common and shared urban space. This research reveals the extent to which spaces, parks in this case, may be heterogeneous by unpacking their usage. The conclusions and insights assert the necessity of paying attention to design detail and creating designs that are responsive to evolving user activities.     

基于MF-R和AWS密钥管理机制的物联网健康监测大数据分析系统

带有传感器的可穿戴式医疗设备不断生成大量数据，由于数据的复杂性，难以通过处理和分析大数据来找到有价值的决策信息。为了解决这个问题，提出了一种新的物联网体系结构，用于存储和处理医疗应用的可扩展传感器数据（大数据）。所提出的架构主要由两个子架构组成：Meta Fog重定向（MF-R）架构和AWS密钥管理机制。MF-R架构使用Apache Pig和Apache HBase等大数据技术来收集和存储不同传感器设备生成的传感器数据，并利用卡尔曼滤波消除噪声。AWS密钥管理机制使用密钥管理方案，目的是保护云中的数据，防止未经授权的访问。当数据存储在云中时，所提出的系统能够使用随机梯度下降算法和逻辑回归来开发心脏病的预测模型。仿真实验表明，和其他几种算法相比，提出的算法具有更小的误差，且在吞吐量、准确度等方面具有一定的优越性。     

网络安全威胁因素及其常见网络安全技术分析

社会经济的快速发展促进了科学技术水平的显著提升，社会生产生活各个领域当中对计算机网络的应用程度不断提升，当前，网络已经成为了人们日常生活与工作的重要组成部分。为此，加强对网络安全等因素影响研究就显得格外重要。网络环境关系着用户的使用质量，更加影响人们的工作效率，加强对网络安全技术的研究时解决相关问题的核心内容。本文针对网络安全威胁因素以及常见的网络安全技术进行了简要分析。     

Automated network management and configuration using Probabilistic Trans-Algorithmic Search

Online configuration of large-scale systems such as networks requires parameter optimization within a limited amount of time, especially when configuration is needed as a response to recover from a failure in the system. To quickly configure such systems in an online manner, we propose a Probabilistic Trans-Algorithmic Search (PTAS) framework which leverages multiple optimization search algorithms in an iterative manner. PTAS applies a search algorithm to determine how to best distribute available experiment budget among multiple optimization search algorithms. It allocates an experiment budget to each available search algorithm and observes its performance on the system-at-hand. PTAS then probabilistically reallocates the experiment budget for the next round proportional to each algorithm’s performance relative to the rest of the algorithms. This “roulette wheel” approach probabilistically favors the more successful algorithm in the next round. Following each round, the PTAS framework “transfers” the best result(s) among the individual algorithms, making our framework a trans-algorithmic one. PTAS thus aims to systematize how to “search for the best search” and hybridize a set of search algorithms to attain a better search. We use three individual search algorithms, i.e., Recursive Random Search (RRS) (Ye and Kalyanaraman, 2004), Simulated Annealing (SA) (Laarhoven and Aarts, 1987), and Genetic Algorithm (GA) (Goldberg, 1989), and compare PTAS against the performance of RRS, GA, and SA. We show the performance of PTAS on well-known benchmark objective functions including scenarios where the objective function changes in the middle of the optimization process. To illustrate applicability of our framework to automated network management, we apply PTAS on the problem of optimizing link weights of an intra-domain routing protocol on three different topologies obtained from the Rocketfuel dataset. We also apply PTAS on the problem of optimizing aggregate throughput of a wireless ad hoc network by tuning datarates of traffic sources. Our experiments show that PTAS successfully picks the best performing algorithm, RRS or GA, and allocates the time wisely. Further, our results show that PTAS’ performance is not transient and steadily improves as more time is available for search.     

Restructuring bank networks after mergers and acquisitions: A capacitated delocation model for closing and resizing branches

During restructuring processes, due to mergers and acquisitions, banks frequently face the problem of having redundant branches competing in the same market. In this work, we introduce a new Capacitated Branch Restructuring Model which extends the available literature in delocation models. It considers both closing down and long term operations׳ costs, and addresses the problem of resizing open branches in order to maintain a constant service level. We consider, as well, the presence of competitors and allow for ceding market share whenever the restructuring costs are prohibitively expensive.We test our model in a real life scenario, obtaining a reduction of about 40% of the network size, and annual savings over 45% in operation costs from the second year on. We finally perform a sensitivity analysis on critical parameters. This analysis shows that the final design of the network depends on certain strategic decisions concerning the redundancy of the branches, as well as their proximity to the demand nodes and to the competitor׳s branches. At the same time, this design is quite robust to changes in the parameters associated with the adjustments on service capacity and with the market reaction.     

A two stage heuristic algorithm for the integrated aircraft and crew schedule recovery problems

Airline disruptions incurred huge cost for airlines and serious inconvenience for travelers. In this paper, we study the integrated aircraft and crew schedule recovery problem. A two stage heuristic algorithm for the integrated recovery problem is proposed. In the first stage, the integrated aircraft recovery and flight-rescheduling model with partial crew consideration is built. This model is based on the traditional multi-commodity network model for the aircraft schedule recovery problem. The objective of this model also includes minimization of the original crew connection disruption. In the second stage, the integrated crew schedule recovery and flight re-scheduling model with partial aircraft consideration is built. We proposed a new multi-commodity model for the crew schedule recovery. The main advantage of such model is that it is much more efficient to integrate the flight-scheduling and aircraft consideration. New constraints are incorporated to guarantee that the aircraft connections generated in the stage 1 are still feasible. Two stages are run iteratively until no improvement can be achieved. Experimental results show that our method can provide better recovery solutions compared with the benchmark algorithms.