皮带运输机集中控制技术应用

皮带运输机的运行有效性对矿井生产作业效率有直接影响,以此为着手点,对皮带运输机集中控制技术的应用开展分析探究,结合具体工程实际,在分析皮带运输保护的基础上,对皮带运输机中PLC可编程控制器运用开展探究,希望能够为其他矿井相似工程的开展提供借鉴与参考。     

综机设备集中化管理实践

综机设备是煤矿采掘生产效率的重要支撑，如果没有先进的综机设备，要想提高采掘生产效率是不可能的。从综机设备集中化和综机设备检修的专业化，分别阐述了其发展趋势，简要总结了中煤新集多年的实践经验，并针对目前管理存在的问题提出相应的建议。     

Toward the adaptation of component‐based architectures by model transformation: behind smart user interfaces

Graphical user interfaces are not always developed for remaining static. There are GUIs with the need of implementing some variability mechanisms. Component‐based GUIs are an ideal target for incorporating this kind of operations, because they can adapt their functionality at run‐time when their structure is updated by adding or removing components or by modifying the relationships between them. Mashup user interfaces are a good example of this type of GUI, and they allow to combine services through the assembly of graphical components. We intend to adapt component‐based user interfaces for obtaining smart user interfaces. With this goal, our proposal attempts to adapt abstract component‐based architectures by using model transformation. Our aim is to generate at run‐time a dynamic model transformation, because the rules describing their behavior are not pre‐set but are selected from a repository depending on the context. The proposal describes an adaptation schema based on model transformation providing a solution to this dynamic transformation. Context information is processed to select at run‐time a rule subset from a repository. Selected rules are used to generate, through a higher‐order transformation, the dynamic model transformation. This approach has been tested through a case study which applies different repositories to the same architecture and context. Moreover, a web tool has been developed for validation and demonstration of its applicability. The novelty of our proposal arises from the adaptation schema that creates a non pre‐set transformation, which enables the dynamic adaptation of component‐based architectures. Copyright © 2014 Copyright © 2014 John Wiley & Sons, Ltd.     

基于不可靠通信链路的数据共享模块

随着企业规模的逐步扩大和计算机网络与企业信息技术的飞速发展，大中型企业陆续建立了很多业务系统，对各个系统之间数据同步的安全性提出了更高的需求。针对此需求，基于RabbitMQ消息队列中间件，本文设计并实现基于不可靠通信链路的数据共享模块，解决在企业内部两级数据中心之间的双向数据同步问题，并通过RabbitMQ的消息确认机制和持久化机制，保证数据的安全送达、无丢失。经过实践证明，该数据共享模块功能稳定，可提高两级数据中心的数据传输效率并保证其安全性。     

A hybrid homogeneously weighted moving average control chart for process monitoring

Several modifications and enhancements to control charts in increasing the performance of small and moderate process shifts have been introduced in the quality control charting techniques. In this paper, a new hybrid control chart for monitoring process location is proposed by combining two homogeneously weighted moving average (HWMA) control charts. The hybrid homogeneously weighted moving average (HHWMA) statistic is derived using two smoothing constants λ₁ and λ₂ . The average run length (ARL) and the standard deviation of the run length (SDRL) values of the HHWMA control chart are obtained and compared with some existing control charts for monitoring small and moderate shifts in the process location. The results of study show that the HHWMA control chart outperforms the existing control charts in many situations. The application of the HHWMA chart is demonstrated using a simulated data.     

A resilient buffer allocation scheme in active queue management: a stochastic cooperative game theoretic approach

During the last decade, a plentiful number of active queue management schemes have been proposed, but their main objectives are simply allocating the buffer resource to all flows evenly, or protecting responsive flows from being degraded by unresponsive flows. However, the sending rates of the responsive flows can be determined diversely, and not all unresponsive flows have aggressively high sending rates. Furthermore, it is rational to reserve a portion of the buffer resource for certain privileged traffic. Grounded by these evidences, in this paper, we present a resilient active queue management algorithm, named Prior‐Core‐based Buffer Allocation considering diverse congestion control algorithms, fair‐unresponsive flows, and some privileged traffic. Our approach is based on stochastic cooperative game theory, where the payoffs yielded by cooperation are described by random variables, and the core is defined only over the distribution of these random payoffs; the core in this situation is called the prior‐core. As a result, it is shown that our buffer allocation, yielded by the prior‐core, achieves completely fair allocation for those flows whose requirement does not exceed the fair‐share regardless of the responsiveness, whereas aggressive flows are restricted according to availability of the buffer; all these are verified through ns‐2 simulation experiments. Copyright © 2014 John Wiley & Sons, Ltd.     

电信运营商信息安全管控架构及集中策略研究

本文对运营商信息安全集中管控架构演进和信息安全管控策略面临的问题进行了深入分析，提出了信息安全集中管控架构的演进方向建议及对信息安全监控策略工作优化的若干意见。     

机房集中监控系统维护方法探讨

对机房集中监控系统三级监控单元SU、SC、SS所使用的各种物理设备的类型及其原理进行分析，提出有针对性的物理设备故障检测技术及日常维护方法。所探讨的这些故障检测技术及维护方法，均经过实践证明具有高准确度，可以为机房维护人员准确分析设备故障状态提供参考，及时有效地采取措施，提高工作效率和降低维护费用。     

A side-sensitive synthetic coefficient of variation chart

Control charts for monitoring the coefficient of variation (γ) are useful for processes with an inconsistent mean (μ) and a standard deviation (σ) which changes with μ, by monitoring the consistency in the ratio σ over μ. The synthetic-γ chart is one of the charts proposed to monitor γ, and its attractiveness lie in waiting until a second point to fall outside the control limits before a decision is made. However, existing synthetic-γ charts do not differentiate between the points falling outside the upper control limit (UCL) and lower control limit (LCL). Hence, this paper proposes a side-sensitive synthetic-γ chart, where successive nonconforming samples must either fall above the UCL or below the LCL. Formulae to compute the average run length (ARL), the standard deviation of the run length (SDRL) and expected average run length (EARL) are derived using the Markov chain approach, and the algorithms to obtain the optimal charting parameters are proposed. Subsequently, the optimal charting parameters, ARL, SDRL and EARL values for various numerical examples are shown. Comparisons show that the side-sensitive synthetic-γ chart consistently outperforms the existing synthetic-γ chart, especially for small shifts. The proposed chart also consistently outperforms the Shewhart-γ chart, while showing comparable or better performance than the Exponentially Weighted Moving Average (EWMA) chart for most shift sizes, except for very small shifts. Finally, this paper shows the implementation of the proposed chart on an industrial example.     

Nonlinear performance evaluation model for throughput of AQM scheme using full factorial design approach

The performance of active queue management (AQM) is measured in terms of throughput, delay, queue size, and loss rate. We have carried out the optimized performance measure of throughput for AQM scheme random early detection (RED) using full factorial design (FDD) technique that is a new approach of performance analysis particularly for congestion control algorithms. We have considered the input factors, viz, buffer size, maximum threshold, and the number of file transfer protocol (FTP) sources for the evaluation of RED that can be used for other AQM schemes, viz, adaptive RED, three‐section RED (TRED), and adaptive queue management with random dropping (AQMRD). The effect of each input factor as well as their interactions are evaluated using factorial design technique that results to obtain the nonlinear equation for performance measure in terms of input factors buffer size, maximum threshold, and the number of FTP sources. Finally, we show the contour plots for variation of performance measure throughput (steady state) from minimum to maximum values with respect to the different setting of input parameters.