The Asia-Pacific ICT sector, which acquires a greater share of the global ICT market with each passing year, grew slowly over the past six months under review, along with the advanced economies.

Social gaming refers to playing games on social media platforms, networking sites, or within social media applications as a form of social interaction. Such games allow players to compete with friends they are connected to on social media, as well as chat with other players. Social games gained popularity after Facebook and Zynga collaborated in 2009 to offer Farmville on the social networking site. Following the success of Farmville, social gaming became increasingly popular worldwide. We expect the global social gaming market to grow at a CAGR of 14.96% during 2015-2019.

Procurement software is a program that allows organizations to automate the process of purchasing resources and managing inventory. The software generates purchase orders, executes them online, matches invoices for materials received, and tracks all payment schedules. It is used for a range of applications, from shopping carts to highly complex supply chain management (SCM) applications for global enterprises.

Android是目前最流行的智能手机软件平台,报告称,2014年,Android的销售量占到全球份额81%的绝对优势,首次达到10亿部.其余如苹果、微软、黑莓与火狐等则远远落在后面.与此同时,Android智能手机的日益流行也吸引了黑客,导致Android恶意软件应用的大量增加.从Android体系结构、设计原则、安全机制、主要威胁、恶意软件分类与检测、静态分析与动态分析、机器学习方法、安全扩展方案等多维角度,对Android安全的最新研究进展进行了总结与分析.

稀疏编码理论应用于信号处理的各个领域,为了获取优化的稀疏编码,需要通过训练获取数据词典.提出了一种复数域数据词典的快速训练方法,将词典训练问题转化为最优化问题并交替地对词典原子和编码进行最优化而得到最终训练词典.在对词典原子的最优化过程中,采用具有记忆性的在线训练算法;而在对编码进行最优化的过程中,采用交换乘子方向方法进行实现.通过实验得出:所提出的算法能够有效地提高数据词典的训练效率,在保证收敛值的同时缩短训练时间,并且对于训练样本中的噪声具有鲁棒性.

基于占优关系的可测试性转化,是将目标语句覆盖问题转化为位于该语句之前的占优语句(集)覆盖问题,能够对含有标志变量的程序进行测试.但是当占优语句(集)不止一个时,如何从这些语句(集)中选择最容易覆盖的作为新的目标语句(集),至今没有有效的方法,从而限制了可测试性转化的应用范围.研究了占优语句(集)选择问题,提出了基于覆盖难度的占优语句(集)选择方法.首先,提出评价语句覆盖难度的4个指标,并给出这些指标的计算方法;然后,基于上述指标,利用Topsis方法排序,选择最容易覆盖的占优语句(集);最后,将所提出的方法应用于多个基准与工业程序测试,实验结果表明,覆盖基于该方法选择的占优语句(集)能够显著提高测试数据生成的效率.

Graphs are widespread data structures used to model a wide variety of problems. The sheer amount of data to be processed has prompted the creation of a myriad of systems that help us cope with massive scale graphs. The pressure to deliver fast responses to queries on the graph is higher than ever before, as it is demanded by many applications (e.g. online recommendations, auctions, terrorism protection, etc.). In addition, graphs change continuously (so do the real world entities that typically represent). Systems must be ready for both: near real-time and dynamic masive graphs. We survey systems taking their scalability, real-time potential and capability to support dynamic changes to the graph as driving guidelines. The main techniques and limitations are distilled and categorised. The algorithms run on top of graph systems are not ready for prime time dynamism either. Therefore, a short overview on dynamic graph algorithms has also been included. 

Reading online content for educational, learning, training or recreational purposes has become a very popular activity. While reading, people may have difficulty understanding a passage or wish to learn more about the topics covered by it, hence they may naturally seek additional or supplementary resources for the particular passage. These resources should be close to the passage both in terms of the subject matter and the reading level. However, using a search engine to find such resources interrupts the reading flow. It is also an inefficient, trial-and-error process because existing web search and recommendation systems do not support large queries, they do not understand semantic topics, and they do not take into account the reading level of the original document a person is reading. In this paper, we present LearningAssistant, a novel system that enables online reading material to be smoothly enriched with additional resources that can supplement or explain any passage from the original material for a reader on demand. The system facilitates the learning process by recommending learning resources (documents, videos, etc) for selected text passages of any length. The recommended resources are ranked based on two criteria (a) how they match the different topics covered within the selected passage, and (b) the reading level of the original text where the selected passage comes from. User feedback from students who use our system in two real pilots, one with a high school and one with a university, for their courses suggest that our system is promising and effective. 

Datacenter topology design is a complex problem with a huge search space. Recent work on systematic solution space exploration points out a significant problem on cabling: how to map a logical topology with servers, switches, and links onto a physical space with racks and cable trays such that the cable costs are minimized? In this paper, we show that this problem is NP-hard and present partitioning-based heuristics. Evaluation with different topologies demonstrate that our approach discovers better layouts than the previous approaches and reduces the cabling costs by up to 38%.