煤矿5G分布式MIMO组网技术研究（增刊）

根据煤矿井下的安全防爆要求，天线的射频发射功率受到严格限制，导致煤矿5G的基站部署密度显著高于地面场景。为了解决由此引发的交叉覆盖问题，本文提出了煤矿5G分布式MIMO组网技术，利用分布在不同位置的天线实现对用户数据的联合并行发送，不仅避免了由交叉覆盖导致的乒乓切换等负面效应，还提升了边缘区域的信号覆盖效果。在乌兰木伦煤矿的300米采煤工作面内，利用分布式MIMO组网技术实现了5G信号的无边界覆盖，上行速率不低于500Mbps，保障了煤机数据的实时有效传输。     

基于多媒体技术的思想政治教育课程资源整合系统

为解决资源种类划分结果异常,设计基于多媒体技术的思想政治教育课程资源整合系统。选用CYUSB3014芯片作为此次设计系统的主控芯片,并设定信息处理芯片以及外围电路。在此基础上,对思政课程信息进行分类,建立了课程资源库。优化资源整合模块,设定多媒体资源整合流程,并添加DataSet与.NET Framework数据处理程序,实现对多媒体数据的高效处理。构建系统测试环节显示,此系统资源种类划分结果较为合理且系统承载率较高。由此可知,此系统在应用中具有较高的综合性能。     

多媒体技术在小学英语故事教学中的应用尝试

在新时期下,传统的英语教学方法已经不适合学生的学习和发展了,经过笔者的研究和分析发现,小学生对故事似乎是非常感兴趣,所以就针对多媒体技术在小学英语故事教学中的应用进行了几点尝试。     

Distributed two‐stage state estimation with event‐triggered strategy for multirate sensor networks

This paper investigates the state estimation issue for a class of wireless sensor networks (WSNs) with the consideration of limited energy resources. First, a multirate estimation model is established, and then, a new event‐triggered two‐stage information fusion algorithm is developed based on the optimal fusion criterion weighted by matrices. Compared with the existing methods, the presented fusion algorithm can significantly reduce the communication cost in WSNs and save energy resources of sensors efficiently. Furthermore, by presetting a desired containment probability over the interval [0,1] with the developed event‐triggered mechanism, one can obtain a suitable compromise between the communication cost and the estimation accuracy. Finally, a numerical simulation for the WSN tracking system is given to demonstrate the effectiveness of the proposed method.     

Cryptographic Lightweight Encryption Algorithm with Dimensionality Reduction in Edge Computing

Edge Computing is one of the radically evolving systems through generations as it is able to effectively meet the data saving standards of consumers, providers and the workers. Requisition for Edge Computing based items have been increasing tremendously. Apart from the advantages it holds, there remain lots of objections and restrictions, which hinders it from accomplishing the need of consumers all around the world. Some of the limitations are constraints on computing and hardware, functions and accessibility, remote administration and connectivity. There is also a backlog in security due to its inability to create a trust between devices involved in encryption and decryption. This is because security of data greatly depends upon faster encryption and decryption in order to transfer it. In addition, its devices are considerably exposed to side channel attacks, including Power Analysis attacks that are capable of overturning the process. Constrained space and the ability of it is one of the most challenging tasks. To prevail over from this issue we are proposing a Cryptographic Lightweight Encryption Algorithm with Dimensionality Reduction in Edge Computing. The t-Distributed Stochastic Neighbor Embedding is one of the efficient dimensionality reduction technique that greatly decreases the size of the non-linear data. The three dimensional image data obtained from the system, which are connected with it, are dimensionally reduced, and then lightweight encryption algorithm is employed. Hence, the security backlog can be solved effectively using this method.     

Photomontage in the Present Perfect Continuous

In its first instance as art practice among the historical avant-garde, photomontage was considered indispensable for its claim to intervene in perceptual processes, stimulating a critical mode of apprehension that would redirect the viewer away from conventions of aesthetic experience and towards a lived reception of art with pronounced relevance to the sociopolitical landscape. The effect was understood as structural, that is, activated not so much by direct political content, but by the stark and shocking effects of juxtaposition. By this measure, one challenge to contemporary photomontage is clear: in a postindustrial and postdigital visual landscape dominated by the structural fragmentation of the attention economy, the ‘simultaneity of the radically disparate’ (as Peter Bürger put it) might no longer present as heterodoxy but rather threaten to sink into invisibility. Yet with the migration off-screen of the effects of electronic media, a new urgency around moving photomontage structures into physical, public space is rising in contemporary practices. Shannon Ebner’s multi-part project A Hudson Yard (2014–15) is emblematic of the new ways in which artists are manipulating photomontage as a form of fully sensory experience that gives the medium room to play critically in both virtual and material space. By constructing subtle interruptions of naturalised commercial space, A Hudson Yard activates a détournement of instrumentalised language, using structures of juxtaposition to divert the discursive surfaces of public space away from consumption and towards what could be called a public poesis.     

基于查询的新闻多文档自动摘要技术研究

针对新闻文本领域,该文提出一种基于查询的自动文本摘要技术,更加有针对性地满足用户信息需求。根据句子的TF-IDF、与查询句的相似度等要素,计算句子权重,并根据句子指示的时间给定不同的时序权重系数,使得最近发生的新闻内容具有更高的权重,最后使用最大边界相关的方法选择摘要句。通过与基于TF-IDF、Text-Rank、LDA等六种方法的对比,该摘要方法ROUGE评测指标上优于其他方法。从结合评测结果及摘要示例可以看出,该文提出的方法可以有效地从新闻文档集中摘取核心信息,满足用户查询内容的信息需求。     

A platform for P2P agent-based collaborative applications

The operational environment can be a valuable source of information about the behavior of software applications and their usage context. Although a single instance of an application has limited evidence of the range of the possible behaviors and situations that might be experienced in the field, the collective knowledge composed by the evidence gathered by the many instances of a same application running in several diverse user environments (eg, a browser) might be an invaluable source of information. This information can be exploited by applications able to autonomously analyze how they behave in the field and adjust their behavior accordingly. Augmenting applications with the capability to collaborate and directly share information about their behavior is challenging because it requires the definition of a fully decentralized and dependable networked infrastructure whose nodes are the user machines. The nodes of the infrastructure must be collaborative, to share information, and autonomous, to exploit the available information to change their behavior, for instance, to better accommodate the needs of the users to prevent known problems. This paper describes the initial results that we obtained with the design and the development of an infrastructure that can enable the execution of collaborative scenarios in a fully decentralized way. Our idea is to combine the agent-based paradigm, which is well suited to design collaborative and autonomous nodes, and the peer-to-peer paradigm, which is well suited to design distributed and dynamic network infrastructures. To demonstrate our idea, we augmented the popular JADE agent-based platform with a software layer that supports both the creation of a fully decentralized peer-to-peer network of JADE platforms and the execution of services within that network, thus enabling JADE multiagent systems (MASs) to behave as peer-to-peer networks. The resulting platform can be used to study the design of collaborative applications running in the field.     

Scheduling distributed flowshops with flexible assembly and set-up time to minimise makespan

The scheduling problems under distributed production or flexible assembly settings have achieved increasing attention in recent years. This paper considers scheduling the integration of these two environments and proposes an original distributed flowshop scheduling problem with flexible assembly and set-up time. Distributed production stage is deployed several homogeneous flowshop factories that process the jobs to be assembled into final products in the flexible assembly stage. The objective is to find a schedule, including a production subschedule for jobs and an assembly subschedule for products, to minimise the makespan. Such a scheduling problem involves four successive decisions: assigning jobs to production factories, sequencing jobs at every factory, designating an assembly machine for each product and sequencing products on each assembly machine. The computational model is first established, and then a constructive heuristic (TPHS) and two hybrid metaheuristics (HVNS and HPSO) are proposed. Numerical experiments have been carried out and results validate the algorithmic feasibility and effectiveness. TPHS can obtain reasonable solutions in a shorter time, while metaheuristics can report better solutions using more yet acceptable time. HPSO is statistically comparable yet less robust compared with HVNS for small-scale instances. For the large-scale case, HPSO outperforms HVNS on both effectiveness and robustness.