2013年4季度，世界经济复苏势头渐显。从国际经济形势来看，美国经济受益于个人消费、出口、非居民住宅固定资产投资以及私人库存投资的增加而持续增长，欧元区在经历了债务危机的打击之后正在慢慢恢复元气，相关数据也表明欧洲经济正处于加速增长的轨道上，而日本经济则受制于私人部门消费增长没能达到预期和出口不振的影响，增速明显低于预期。从国内形势来看，中国经济增速稳中向好。根据国家统计局的初步核算，2013年全年国内生产总值568845亿元，按可比价格计算，比上年增长7.7%。国内经济的平稳运行，为电信业务收入的增长创造了良好的环境。2013年全年，电信业务收入实现11689.1亿元，同比增长8.7%，增速虽较上年回落0.2个百分点,但仍连续三年高于同期GDP增速。

全新的网络营销渠道：微博、微信、人人。高效低成本的品牌推广：社交网络、点评。线上+线下“全渠道”O2O：“沃尔玛+亚马逊”。背后需要重新梳理定价体系：“左右手互搏”。细分品类、“小而美”品牌的出现：黄飞红花生。适应线上的子品牌与新产品：罗莱LOVO。企业价值链的重新架构：盈利模式发生变化。移动互联下的商业法则：建设或融入“生态圈”。

2013年,世界经济延续缓慢复苏态势,全球消费电子市场保持小幅增长,手机市场形势好于2012年.市场研究机构IDC称,2013年全球手机出货量达到18亿部,同比7.3%,增速比2012年明显提高;智能手机的快速增长是带动手机市场成长的主要动力,IDC称,2013年全球智能手机出货量首次突破10亿部,达到10.04亿部,同比增长38.4%,占手机整体出货量份额达到55%.与手机市场规模扩张相伴的是行业竞争进一步加剧,手机产业竞争由原先的单纯产品竞争演变为硬件、软件与服务的全方位竞争.面对市场与竞争结构的不断变化,我国手机企业积极应对,加快产品革新,提升服务质量,行业整体平稳运行,产量规模继续扩张,外贸出口稳步增长,效益质量持续提升,对我国电子制造业、软件业及通信业的发展起到了积极的支撑作用.

2013年，面对错综复杂的国内外政治经济形势，我国电子信息产业各级主管部门认真贯彻党中央、国务院“稳中求进”的经济工作总基调，坚持统筹稳增长、调结构与促改革之间的关系，加大政策预调微调力度，积极培育信息消费等热点领域，产业内骨干企业加快转变发展方式，不断优化产品与市场结构，全面深化转型升级，使得产业整体运行呈现平稳态势，生产保持较快增长，效益规模稳步提升，结构调整不断加快，为提高社会信息化发展水平和促进两化深度融合发挥了积极作用，在国民经济中的重要性持续提高。

我国便利店业态便是一个红海与蓝海交错，随着城镇化的提升与消费习惯的变迁容量持续稳定增长的终端市场，而且在购物移动转型中具备本地生活购物、服务、社交线下流量入口的核心地位，是未来零售渠道核心业态之一。经济发展与消费习惯变迁推动便利店兴起与发展。极致便利、精选品类+丰富服务、高效管理成就强大竞争力。便利店转型之变革求生：差异化经营和海外拓展推动新一轮增长。便利店转型之拥抱未来：移动转型本地生活购物、服务、社交入口。

1月份，我国通信业总体运行平稳,电信业务总量和业务收入增速回升。1月份，全国电信业务总量完成1411.3亿元，同比增长17.0%，比上年同期增速高3.6个百分点；电信主营业务收入完成947.1亿元，同比增长9.2%，比上年同期增速高2.4个百分点。

对于影响移动互联网用户行为的因素，学者众说纷纭，根据相关学者的研究和实证分析，得出影响用户消费行为的因素包括外部因素和内部因素。

The Asia-Pacific ICT sector slowed over the six months under review, hampered by sluggish growth in China and India. Emerging countries such as Malaysia, Vietnam, Indonesia and the Philippines spent more on ICT, with governments budgeting to further develop high-tech ICT infrastructure. The ten leading Asian IT stocks were mixed over the six months to October 25, 2013, but most of them performed poorly, declining by an average 5.8%. Although Lenovo remained in a virtual tie for the top position in PC market, it shifted its “attack market” to mobile devices, which contributed to a significant portion of total revenues.Asia-Pacific merger and acquisition activity was low in both volume and value over the past six months, but the long-term outlook remains strong thanks to ongoing technology innovation.

We introduce the new framework of natural continuous time quantum search algorithms, that in contrast to the adiabatic quantum algorithms, require neither the ground state initialization nor the adiabatic change of the Hamiltonian parameters. We derive a slightly more general bound for the cumulative matrix multiplicative weights algorithm and introduce the first iterative matrix multiplicative weights algorithm with the same small performance regret. Furthermore, we address the following question:”what is the minimal size quantum circuit required to exactly implement a specifiednqubit unitary operationU, without the use of ancillaqubits?” finally we investigate then-dimensional hypercube quantum random walk(QRW) as a particularly appealing example of a quantum walk because it has a natural implementation on a register onnqubits.

This dissertation offers new capabilities of bit-level liveness verification in general and an in-depth formal analysis of communication fabrics with the objective of their scalable bit-level response verification. We show that the operations of industrially relevant hardware systems (communication fabrics in our case studies) can naturally give rise to a well-founded ordering in their state spaces. We provide an algebraic analysis of a set of industrially relevant communication fabrics. The analysis offers a rigorous mathematical justification of the Chatterjee-Kishinevsky invariants and their connection to the underlying network topology.

The first part of this thesis focuses on improving energy consumption of stream applications on multicore machines by exploiting the modularity and the static properties of Synchronous Dataflow (SDF). In the second part of this thesis, we focus on those compilation issues of stream programs.

we present our model for ambiguous fragment assignment for RNA-Seq, which includes the most comprehensive set of parameters of any model introduced to date, as well as various methods we have explored for scaling our optimization procedure. These methods include the use of an online EM algorithm and a distributed EM solution implemented on the Spark cluster computing system. Our advances have resulted in the first efficient solution to the problem of fragment assignment in sequencing.

This thesis presents an end-to-end system architecture for online services to provide it's users with a "privacy guarantee". The privacy guarantee as described in this thesis relates to the technological enforcement of the user's privacy policies by these online applications that are otherwise untrusted by the user.

We present a physics-based mathematical model of thermal behavior of buildings,along with a novel Parameter Adaptive Building (PAB) model framework to update the model parameters.We then address the "Cyber-Physical" aspect of a building HVAC system in the design flow.The last part of this dissertation is centered on the role of smart buildings in the context of the smart grid.

A legged crawler's unsteady dynamics are explored with an emphasis on how these affect optical flow estimation, which mediates navigation. The optical flow algorithm's gains are further tuned using policy gradient reinforcement learning so as to improve motion estimation for specific unsteady regimes. This approach is demonstrated in an obstacle avoidance scenario.

In this dissertation, we first discuss several formulations for Sparse PCA, as well as the algorithms for solving the formulations and a few greedy methods. We then develop a block coordinate ascent algorithm for solving DSPCA with better dependence on problem size. We show that our algorithm converges much faster than the existing first-order algorithm in practice and demonstrate that our code can handle huge real data sets. We also demonstrate that Sparse PCA does bring more interpretability and hence gives rise to new interesting findings in various real data sets.

The focus of this thesis is the design of capacity-achieving network codes realizable by modern signal processing circuits.