Reducing the complexity of distance measurement methods for circular turbo codes that use structured interleavers

The knowledge of turbo code's minimum Hamming distance (d_min) and its corresponding codeword multiplicity (A_min) is of a great importance because the error correction capability of a code is strongly tied to the values of d_min and A_min. Unfortunately, the computational complexity associated with the search for d_min and A_min can be very high, especially for a turbo code that has high d_min value. This paper introduces some useful properties of turbo codes that use structured interleavers together with circular encoding. These properties allow for a significant reduction of search space and thus reduce significantly the computational complexity associated with the determination of d_min and A_min values. © 2014 The Authors. International Journal of Communication Systems published by John Wiley & Sons, Ltd.     

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.     

LTE系统多小区上行联合功控算法

针对传统的小区内开环功率控制算法通常以提升本小区的吞吐量性能为目标，忽略了当前小区用户对邻小区用户同频干扰的问题，为提升边缘用户性能的同时兼顾系统整体性能，提出了一种LTE系统小区间上行联合功率控制（UJPC）算法。该算法采用单基站三扇区为系统模型，以最优化系统吞吐量比例公平函数为目标，首先根据最小信干噪比（SINR）约束值和用户最大发射功率这两个约束条件得到相应的数学优化模型，然后采用连续凸近似的方法求解优化问题得出各个基站所管辖的小区内所有用户的最优发射功率。仿真结果表明，与基准的开环功控方案相比，联合功控方案在保证系统平均频谱利用率的情况下能够较大幅度地提高小区边缘频谱利用率，其最佳性能增益能达到50%。     

基于注意力机制与文本信息的用户关系抽取

随着社交媒体的发展,用户之间的关系网络对于社交媒体的分析有很大的帮助。因此,该文主要研究用户好友关系检测。以往的关于用户好友关系抽取的研究主要基于社交媒体上的结构化信息,比如其他好友关系,用户的不同属性等。但是,很多时候用户本身并没有大量的好友信息存在,同时也不一定有很多确定的属性。因此,我们希望基于用户发表的文本信息来对用户关系进行预测。不同于以往的潜在好友推荐算法,该文提出了一种基于注意力机制以及长短时记忆网络(long short-term memory,LSTM)的好友关系预测模型,将好友之间的评论分开处理,通过分析用户之间的评论来判断是否具备一定的好友关系。该模型将好友双方信息拼接后的结果作为输入,并将注意力机制应用于LSTM的输出。实验表明,用户之间的评论对于好友关系预测确实有较大的实际意义,该文提出的模型较之于多个基准系统的效果,取得了明显的提升。在不加入任何其它非文本特征的情况下,实验结果的准确率达到了77%。     

Effective Location Based Services with Dynamic Data Management in Mobile Environments

With the proliferation of mobile computing technologies, location based services have been identified as one of the most promising target application. We classify mobile information service domains based on feature characteristics of the information sources and different patterns of mobile information access. By carefully examining the service requirements, we identify the dynamic data management problem that must be addressed for effective location based services in mobile environments. We then devise a general architecture and cost model for servicing both location independent and location dependent data. Based on the architecture and cost model, we propose a set of dynamic data management strategies that employs judicious caching, proactive server pushing and neighborhood replication to reduce service cost and improve response time under changing user mobility and access patterns. Detail behavior analysis helps us in precisely capturing when and how to apply these strategies. Simulation results suggest that different strategies are effective for different types of data in response to different patterns of movement and information access. Shiow-yang Wu is an associate professor of the Department of Computer Science and Information Engineering at National Dong Hwa University, Hualien, Taiwan, R.O.C. He received the BS and MS degrees in computer engineering from National Chiao Tung University, Hsinchu, Taiwan, ROC, and the PhD degree in computer science from the University of Texas at Austin in 1984, 1986, and 1995, respectively. His research interests include data/knowledge bases, mobile computing, distributed processing, intelligence information systems, and electronic commerce. Kun-Ta Wu was born in Taipei, Taiwan, R.O.C., in 1976. He received the B.S. degree in computer science from Soochow University, Taipei, Taiwan, R.O.C., in 1999 and the M.S. degree in computer science and information engineering from National Dong Hwa University, Hualien, Taiwan, R.O.C., in 2001. Currently, he is an Assistant Researcher in the Domestic Division at Science and Technology Information Center, National Science Council, R.O.C., as a member of Information Gathering and Analysis Group of National Information and Communication Security Taskforce. His research interests include mobile computing, wireless network and information security.     

地震数据采集系统延迟时间研究与分析

文章分析了影响地震采集系统延迟时间的因素,并根据系统延迟的理论对产生的原因进行了论证.同时对实际生产中的测试方法进行了阐述研究和分析,提出了新的测试方法,并结合实际生产提出了合理性建议.     

地震平衡技术及其在地震反演中的应用

地震平衡技术是一种在地震反演中改善井震关系的新技术。它通过单井对比、空间分形建模以及平衡处理的手段 ,克服地震反演中子波空变的影响 ,使得经过地震平衡技术处理的地震剖面井震关系得到较好改善 ,从而可以用统一的子波对研究区的地震资料进行反演     

Allocentric Versus Egocentric Spatial Memory After Unilateral Temporal Lobectomy in Humans.

Thirty patients who had undergone either a right or left unilateral temporal lobectomy (14 RTL; 16 LTL) and 16 control participants were tested on a computerized human analogue of the Morris Water Maze. The procedure was designed to compare allocentric and egocentric spatial memory. In the allocentric condition, participants searched for a target location on the screen, guided by object cues. Between trials, participants had to walk around the screen, which disrupted egocentric memory representation. In the egocentric condition, participants remained in the same position, but the object cues were shifted between searches to prevent them from using allocentric memory. Only the RTL group was impaired on the allocentric condition, and neither the LTL nor RTL group was impaired on additional tests of spatial working memory or spatial manipulation. The results support the notion that the right anterior temporal lobe stores long-term allocentric spatial memories. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

SUN工作站的EEPROM浅析

ＥＥＰＲＯＭ的参数设置控制着系统的基本功能，设置的改变对系统的起动和运行起着重要作用。本文详细地列出了ＥＥＰＲＯＭ的地址分配表，并通过上机实验对那些重要的地址了详细的说明。