检索结果-内蒙古大学图书馆

International Symposium on Autonomous Decentralized systems (ISADAS)

作者： Wei-Tek Tsai Peide Zhong Jay Elston Xiaoying Bai Yinong Chen Department of Computer Science and Technology Tsinghua University Beijing China School of Computing Informatics and Decision System Engineering Arizona State University Tempe AZ USA

The current implementations of cloud environment do not have suitable mechanism through which services can be managed to make use of cloud resources. The services in these environments can passively serve users' request only. If a service receives more requests than it can handle in a certain time period, it is subject to malfunctioning. This paper proposes a new approach to service replications that allows a cloud to adjust its service instance deployments in response to existing and projected service request loads. This approach defines an optimal service replication strategy based on MapReduce, a processing model used extensively in GAE (Google App Engine) to solve huge data processing tasks. This service replication strategy is implemented by Service Level MapReduce (SLMR). To better support for SLMR, service replication technology is introduced, which include dynamic service replication and pre-deployed service replication. Furthermore, a passive SLMR approach that depends on the cloud management service (CMS) and a positive SLMR approach that does not need the support from CMS will be introduced.

关键词： Cloud computing Servers computer architecture Google Timing Speech recognition Dispatching

来源：评论

学校读者我要写书评

暂无评论

Design of a high-speed data processing channel based on DSD for digital audio system

International Journal of Digital Content Technology and its ...

引用

International Journal of Digital Content technology and its Applications 2011年第3期5卷 219-224页

作者： Guo-Xiang, Tong Jing-zhao, Wang Yi, Li School of Optical-Electrical and Computer Engineering University of Shanghai for Science and Technology Shanghai 200093 China Shanghai Key Laboratory of Modern Optical System Shanghai 200093 China

With the development of digital audio technology, recently, a so-called DSD(direct stream digital) coding technique becomes a hot subject of research. Now, engineers all over the world are researching on digital power amplifier and digital speaker, hoping that 1-bit stream in the form of DSD can be amplified by a digital power amplifier and then the amplified signal can be passed to a digital speaker directly so that the high-fidelity of digital audio can be achieved. In the procedure of development, the demand of high-speed is placed on the process of filtering and noise-shaping. In order to fulfill this demand, a high-speed data processing channel based on DSD is presented in this paper, the speed of data processing is enhanced effectively by using RNS FIR filter in DSP.

关键词： FIR filters

来源：评论

学校读者我要写书评

暂无评论

SelectCast: Scalable data aggregation scheme in wireless sensor networks

SelectCast: Scalable data aggregation scheme in wireless sen...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

作者： Cheng Wang Shaojie Tang Xiang-Yang Li Changjun Jiang Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China Department of Computer Science University of Tongji Shanghai China Department of Computer Science Illinois Institute of Technology Chicago IL USA TNLIST School of Software Tsinghua University China

In this work, for a wireless sensor network (WSN) of n randomly placed sensors with node density λ ∈ [1, n], we study the tradeoffs between the aggregation throughput and gathering efficiency. The gathering efficiency refers to the ratio of the number of the sensors whose data have been gathered to the total number of sensors. Specifically, we design two efficient aggregation schemes, called single-hop-length (SLH) scheme and multiple-hop-length (MLH) scheme. By novelly integrating these two schemes, we theoretically prove that our protocol achieves the optimal tradeoffs, and derive the optimal aggregation throughput depending on a given threshold value (lower bound) on gathering efficiency. Particularly, we show that under the MLH scheme, for a practically important set of symmetric functions called perfectly compressible functions, including the mean, max, or various kinds of indicator functions, etc., the data from Θ(n) sensors can be aggregated to the sink at the throughput of a constant order Θ(1), implying that our MLH scheme is indeed scalable.

关键词： TV Wireless sensor networks Power capacitors Blogs Lattices

来源：评论

学校读者我要写书评

暂无评论

General capacity scaling of wireless networks

General capacity scaling of wireless networks

引用

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

作者： Cheng Wang Changjun Jiang Xiang-Yang Li Shaojie Tang Panlong Yang Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China Department of Computer Science University of Tongji Shanghai China Department of Computer Science Illinois Institute of Technology Chicago IL USA TNLIST School of Software Tsinghua University China People''s Liberation Army University of Science and Technology China

We study the general scaling laws of the capacity for random wireless networks under the generalized physical model. The generality of this work is embodied in three dimensions denoted by (λ ∈ [1, n], n d ∈ [1, n], n s ∈ (1, n]). It means that: (1) We study the random network of a general node density λ ∈ [1, n], rather than only study either random dense network (RDN, λ = n) or random extended network (REN, λ = 1) as in the literature. (2) We focus on the multicast capacity to unify unicast and broadcast capacities by setting the number of destinations for each session as a general value n d ∈ [1, n]. (3)We allow the number of sessions changing in the range n s ∈ (1, n], rather than assume that n s = Θ(n) as in the *** derive the general lower bounds on the capacity for the arbitrary case of (λ, n d , n s ). Particularly, we show that for the special cases (λ = 1, n d ∈ [1, n], n s = n) and (λ = n, n d ∈ [1, n], n s = n), our schemes achieve the highest multicast throughputs proposed in the existing works.

关键词： Roads Routing Throughput Lattices Schedules Mathematical model

来源：评论

学校读者我要写书评

暂无评论

An efficient multi-relay transmission scheme using LDGM code for satellite burst erasure channel

An efficient multi-relay transmission scheme using LDGM code...

引用

29th AIAA International Communications Satellite systems Conference 2011, ICSSC-2011

作者： Kyo, Takuma Okamoto, Eiji Shoji, Yozo Takayama, Yoshihisa Toyoshima, Morio Department of Computer Science and Engineering Graduate School of Engineering Nagoya Institute of Technology Gokiso-cho Showa-ku Nagoya 466-8555 Japan New Generation Network Laboratory Network Research Headquarters National Institute of Information and Communications Technology 4-2-1 Nukui-Kitamachi Koganei Tokyo 184-8795 Japan Space Communications System Laboratory Wireless Network Research Station National Institute of Information and Communications Technology 4-2-1 Nukui-Kitamachi Koganei Tokyo 184-8795 Japan

ISBN: (纸本)9781600869464

Since the first success of satellite laser communication experiments, their developments and researches have been much studied as a new satellite communication technology. From those experimental results, it is known that an instantaneous degradation of received optical power and link disconnection occur due to air turbulence or tracking error in the satellite-to-ground laser transmission. Therefore, forward error correction (FEC) is needed to achieve a high-quality transmission and the application of low-density parity check (LDPC) code for the satellite laser communication has been proposed. However, further application of land mobile communication techniques for achieving higher capacity is not fully discussed. One of the candidates of this application for more efficient satellite laser communication is a multi-hop transmission, which can be applied for geostationary satellite (GEO)-to-ground or deep space-to-ground links. Therefore, we propose a multi-relay cooperative LDPC transmission scheme for satellite laser communications to obtain an improved transmission quality with lower decoding complexity. The performance of the proposed scheme is evaluated by computer simulations. © 2011 by Takuma Kyo, Eiji Okamoto, Yozo Shoji, Yoshihisa Takayama, Morio Toyoshima. Published by the American Institute of Aeronautics and Astronautics, Inc., with permission.

关键词： Forward error correction

来源：评论

学校读者我要写书评

暂无评论

A History Record-Based Service Optimization Method for QoS-Aware Service Composition

A History Record-Based Service Optimization Method for QoS-A...

引用

IEEE International Conference on Web services (ICWS)

作者： Lin Wenmin Dou Wanchun Luo Xiangfeng Jinjun Chen State Key Laboratory for Novel Software Technology Nanjing University Nanjing China School of Computer Engineering and Science Shanghai University Shanghai China School of System Management and Leadership University of Technology Sydney Australia

The performance of a service's QoS may evolve relatively frequently with its internal changes or the changes of dynamic Internet environment, especially when some"intentional" deceptions are taken into consideration. Therefore, the service providers could not always deliver their services according to their "promised" quality. In view of this challenge, a history record-based service optimization method, named Hire Some, is investigated in this paper. This method aims at enhancing the credibility of service composition plan, taking advantage of a web service's QoShistory records, rather than using the tentative QoS values advertised by the service provider. At last, a case study and an experiment is presented for validating the method.

关键词： Quality of service History Web services IP networks Optimization methods Software

来源：评论

学校读者我要写书评

暂无评论

Spiking Neural P systems for Arithmetic Operations

Spiking Neural P Systems for Arithmetic Operations

引用

International Conference on Bio-Inspired computing: Theories and Applications, BICTA

作者： Xiangxiang Zeng Tao Song Linqiang Pan Xingyi Zhang Key Laboratory on Image Processing and Intelligent Control Department of Control Science and Engineering Huazhong University of Science and Technology Wuhan Hubei China Key Laboratory of Intelligent Computing and Signal Processing School of Computer Science and Technology Anhui University Hefei Anhui China

Recently, Gutierrez-Naranjo and Leporati considered performing basic arithmetic operations on a new class of bioinspired computing devices -- spiking neural P systems (for short, SN P systems). However, the binary encoding mechanism used in their research looks like the encoding approach in electronic circuits, instead of the style of spiking neurons (in usual SN P systems, information are encoded as the time interval between spikes). In this work, three SN P systems are constructed as adder, subtracter and multiplier, respectively. In these devices, a number is inputted to the system as the interval of time elapsed between two spikes received by input neuron, the result of a computation is the time between the moments when the output neuron spikes.

关键词： Neurons Tin Encoding Adders Educational institutions Generators Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Dynamic scheduling for workflow applications over virtualized optical networks

Dynamic scheduling for workflow applications over virtualize...

引用

IEEE Conference on computer Communications Workshops, INFOCOM Wksps

作者： Jingyu Ding Yan Wang Jiajin Le Yaohui Jin School of Computer Science & Technology Donghua Uinversity China Huawei Technology Company Limited China State Key Laboratory of Advanced Optical Communication System and Network Shanghai Jiaotong University China

ISBN: (纸本)9781457702495

Joint scheduling of both computation and communication resources for workflow based distributed computing application over optical networks has been studied recently. Most algorithms proposed in previous work are mainly based on static scheduling strategies with assumption that detail resource information and accurate performance prediction is available. In this paper, we propose to employ shared virtualized optical network (VON) for the task scheduling problem. Both customers and carriers can benefit from such architecture with better flexibility and scalability. Based on a new Scheduled Result Graph (SRG) concept, we propose a computation and communication delay aware rescheduling (C 2 DAR) scheme to deal with the dynamics from shared VON resources. We evaluate the performance of dynamic scheduling scheme over shared VON in comparison to the static scheduling over dedicated VON and entire optical network respectively. Simulation results also show that C 2 DAR scheme outperforms traditional computation delay aware rescheduling (CDAR) scheme under shared VON scenario.

关键词： Schedules Bandwidth Processor scheduling Dynamic scheduling Optimal scheduling Delay Optical fiber networks

来源：评论

学校读者我要写书评

暂无评论

Decidability analysis on termination set of loop programs

Decidability analysis on termination set of loop programs

引用

International Conference on computer science and Service system (CSSS)

作者： Shizhong Zhao Donghuo Chen Shanghai Key Laboratory of Trustworthy Computing East China Jiao Tong University Shanghai China School of Computer Science and Technology Soochow University Suzhou China

For half a century, computer programs have been widely applied in all areas of industry and daily life. Given any program, whether it can terminate has direct impact on software safety. Many researchers have been working on the termination of programs. One definition of termination is as follows: a program is terminating if it terminates for any initial values; while it is non-terminating if at least one initial value makes it not terminates. Obviously, this definition does not consider program termination's dependency on initial values, and actually presents two extreme situations of the complicated programs in reality. Different from these two situations, this paper discusses what kinds of initial values can guarantee a program to terminate and what kinds of initial values cannot. For some linear loop assignment programs, whose terminations are decidable, the paper proposes a method using "limit" and "backward iteration" to derive the initial value set that make programs terminate.

关键词： Bismuth Colon Conferences Polynomials Logic programming

来源：评论

学校读者我要写书评

暂无评论

Aggregation capacity of wireless sensor networks: Extended network case

Aggregation capacity of wireless sensor networks: Extended n...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

作者： Cheng Wang Changjun Jiang Yunhao Liu Xiang-Yang Li Shaojie Tang Huadong Ma Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China Department of Computer Science University of Tongji Shanghai China Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong China TNLIST School of Software Tsinghua University China Department of Computer Science Illinois Institute of Technology Chicago IL USA Department of Computer Science Beijing University of Posts and Telecommunications Beijing China

ISBN: (纸本)9781424499199

A critical function of wireless sensor networks (WSNs) is data gathering. While, one is often only interested in collecting a relevant function of the sensor measurements at a sink node, rather than downloading all the data from all the sensors. This paper studies the capacity of computing and transporting the specific functions of sensor measurements to the sink node, called aggregation capacity, for WSNs. It focuses on random WSNs that can be classified into two types: random extended WSN and random dense WSN. All existing results about aggregation capacity are studied for dense WSNs, including random cases and arbitrary cases, under the protocol model (ProM) or physical model (PhyM). In this paper, we propose the first aggregation capacity scaling laws for random extended WSNs. We point out that unlike random dense WSNs, for random extended WSNs, the assumption made in ProM and PhyM that each successful transmission can sustain a constant rate is over-optimistic and unpractical due to transmit power *** derive the first result on aggregation capacity for random extended WSNs under the generalized physical model. Particularly, we prove that, for the type-sensitive perfectly compressible functions and type-threshold perfectly compressible functions, the aggregation capacities for random extended WSNs with n nodes are of order Θ ((log n) -β/2-1 ) and Θ (((log n) -β/2 )/(log log n)), respectively, where β >; 2 denotes the power attenuation exponent in the generalized physical model.

关键词： Wireless sensor networks Signal to noise ratio Interference Throughput Lattices Routing PROM

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：