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

IEEE Conference on Vehicular technology (VTC)

作者： Arti M. K. Ranjan K. Mallik Robert Schober Dept. of Electr. Eng. Indian Inst. of Technol.-Delhi Hauz Khas New Delhi India Department of Electrical Engineering Indian Institute of Technology - Delhi New Delhi India Dept.of Electrical and Computer Engineering University of British Columbia Vancouver BC Canada

This paper investigates the problem of channel estimation and decoding of orthogonal space time block codes (OSTBCs) in a two-way amplify-and-forward (AF) multiple-input multiple-output (MIMO) relay network. We propose a joint decoder for a pilot symbol-aided two-way AF based MIMO cooperative system. The proposed decoder jointly processes the received OSTBC data and pilot matrix by using vector derivative over the two-way MIMO relay channel. We derive a closed-form expression in Rayleigh fading for the moment generating function of the received signal-to-noise ratio at both cooperating users for the proposed decoder; and then investigate the system performance based on analytical expressions for the symbol error rate, diversity order, and array gain.

关键词： Decoding Nickel Relays Joints Channel estimation MIMO Signal to noise ratio

来源：评论

学校读者我要写书评

暂无评论

Conception and Design of a Hardware Simulator for Restoring Lost Biomechanical Function

Conception and Design of a Hardware Simulator for Restoring ...

引用

IEEE International Conference on Systems, Man, and Cybernetics

作者： P. Beckerle L. Lahnstein J. Wojtusch S. Rinderknecht O. Von Stryk Dept. of Mechanical Engineering Inst. for Mechatronic Systems in Mech. Eng. Member IEEE Technische Universit?t Darmstadt - Darmstadt Germany Technische Universit?t Darmstadt - Darmstadt Germany Dept. of Computer Science Simulation Systems Optimization and Robotics Group Member IEEE Technische Universit?t Darmstadt - Darmstadt Germany Dept. of Mechanical Engineering Inst. for Mechatronic Systems in Mech. Eng.Technische Universit?t Darmstadt - Darmstadt Germany

ISBN: (纸本)9781479906505

The Prosthesis-User-in-the-Loop simulator concept represents an approach to integrate users to prosthetic development by a holistic simulation of gait with a prosthesis. It aims at a more user-centered design of lower limb prosthetic devices by utilizing user experience and assessment. As this requires a complex mechanical robot design and sophisticated control strategies that allow for restoring lost biomechanical function, this paper presents the conception and design of a hardware simulator for proof-of-concept studies of those issues. For those investigations, the ankle joints of healthy praticpants are locked mechanically to induce a temporary disability. The task of the simulator is to provide a simulation of physiological gait by artificially restoring ankle functionality. Therefore, the biody-namic behaviour of the locked ankle joint and the enviroment have to be mimicked mechnically. After introducing Prosthesis-User-in-the-Loop simulator idea, the conception of a proof-of-concept simulator is presented. From this, an analytical model is derived and inverse dynamics simulation are used for design. The resulting mechanism is limited to sagittal plane movements and thus has three degrees of freedom. The actuators are dimensioned to meet the requirements of walking motions in the human subject with maximum body height among the test population.

关键词： Prosthetics User-centered Development in-the-Loop Evaluation Biomechanics Robotics Prosthesis simulator Conception robotics Biomechanics Ankle Joint three degrees of freedom human subject robot design computer hardware Body Height Locomotion

来源：评论

学校读者我要写书评

暂无评论

Optimized Path Selection Mechanism for IEEE 802.16j Multi-hop Relay Networks

Optimized Path Selection Mechanism for IEEE 802.16j Multi-ho...

引用

IEEE International Conference on Communications (ICC)

作者： Chang, Jian-Ming Lai, Chin-Feng Chao, Han-Chieh Chen, Jiann-Liang Dept. of Computer Science Information Engineering National Dong Hwa University Taiwan Inst. of Computer Science Information Engineering National Ilan University Taiwan Dept. of Electrical Engineering National Taiwan University of Science and Technology Taiwan

ISBN: (纸本)9781457720536

When the mobile station (MS) is far away from the base station (BS) or terrain and buildings interfere with transmission, the data rate decreases with the increased distance from the BS, and the coverage range of the BS will be shortened to only a few kilometers. The IEEE Working Group has proposed the 802.16j relay technology. This technology can be used to forward data for a BS while overcoming the signal strength attenuation. Since the cost of constructing the relay station is low, the MS will have to scan more than one signal when entering the Mobile Multi-Hop Relay (MMR) network. In this paper, we introduce a novel path selection mechanism that exploits the remaining slot and signal strength indicator (SSI). Since the signal strength will affect the Modulation and Coding Scheme (MCS) combination, we propose to use SSI integrated with the MCS, taking the hop count into account. We demonstrate that our proposed scheme is capable of producing an optimal path selection.

关键词： Path selection 802.16j OFDMA Modulation and Coding Scheme (MCS)

来源：评论

学校读者我要写书评

暂无评论

A highly robust distributed fault-tolerant routing algorithm for NoCs with localized rerouting 12

A highly robust distributed fault-tolerant routing algorithm...

引用

2012 Interconnection Network Architecture: On-Chip, Multi-Chip Workshop, INA-OCMC'12

作者： Vitkovskiy, Arseniy Soteriou, Vassos Nicopoulos, Chrysostomos Dept. of Electrical and Computer Eng. and Informatics Cyprus University of Technology Lemesos Cyprus Dept. of Electrical and Computer Engineering University of Cyprus Nicosia Cyprus

ISBN: (纸本)9781450310109

Denser transistor integration has enabled the fabrication of multi-tile chips, however, at the expense of higher susceptibility to defects and wear-out. Metal wires comprising the links of Networks-on-Chip (NoCs) are especially vulnerable to such defects, which can render some links disconnected. This paper presents a new fault-tolerant routing scheme to sustain on-chip communication. It uses a localized re-routing approach, whereby de-touring around faulty links - or complex regions of faults - is done locally at each node in a purely distributed and dynamic manner, while guaranteeing deadlock- and livelock-freedom. Results using synthetic traffic and real applications with full-system simulations prove its efficacy in addressing a large percentage of NoC links being faulty albeit at a gracefully degraded performance mode. © 2012 ACM.

关键词： Routing algorithms

来源：评论

学校读者我要写书评

暂无评论

A self-organized, service-oriented GMPLS optical network testbed

A self-organized, service-oriented GMPLS optical network tes...

引用

8th International ICST Conference on Testbeds and Research Infrastructures: Development of Networks and Communities, TridentCom 2012

作者： Siokis, Apostolis Vlachos, Kyriakos Computer Engineering and Informatics Dept. Computer Technology Institute and Press University of Patras GR26500 Rio Patras Greece

ISBN: (纸本)9783642355752

In this paper, we detail the implementation of a self-organized GMPLS network using the DRAGON software suite to introduce service awareness in a GMPLS network. DRAGON daemon has been extended to support anycast routing to allow forwarding user (service) requests to the most suitable servers based on their advertised service attributes. Furthermore, OSPF daemon has been also extended to allow for these advertisements to propagate through the network and modify shortest paths based on these service attributes that can be network (i.e. bandwidth, delay etc) and non-network (storage capacity, CPU units, availability etc) resources. © 2012 ICST inst.tute for computer Science, Social informatics and Telecommunications engineering.

关键词： Network routing

来源：评论

学校读者我要写书评

暂无评论

Fast robustness estimation in large social graphs: Communities and anomaly detection

Fast robustness estimation in large social graphs: Communiti...

引用

12th SIAM International Conference on Data Mining, SDM 2012

作者： Malliaros, Fragkiskos D. Megalooikonomou, Vasileios Faloutsos, Christos Dept. of Computer Engineering and Informatics University of Patras Rio Greece Dept. of Computer Engineering and Informatics Center for Information Science and Technology University of Patras Rio PA Greece School of Computer Science Carnegie Mellon University PA United States

ISBN: (纸本)9781611972320

Given a large social graph, like a scientific collaboration network, what can we say about its robustness? Can we estimate a robustness index for a graph quickly? If the graph evolves over time, how these properties change? In this work, we are trying to answer the above questions studying the expansion properties of large social graphs. First, we present a measure which characterizes the robustness properties of a graph, and serves as global measure of the community structure (or lack thereof). We study how these properties change over time and we show how to spot outliers and anomalies over time. We apply our method on several diverse real networks with millions of nodes. We also show how to compute our measure efficiently by exploiting the special spectral properties of real-world networks. Copyright © 2012 by the Society for Industrial and Applied Mathematics.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Text mining in negative relevance feedback

引用

Web Intelligence and Agent Systems 2012年第2期10卷 151-163页

作者： Algarni, Abdulmohsen Li, Yuefeng Wu, Sheng-Tang Xu, Yue School of Electrical Engineering and Computer Science Faculty of Science and Engineering Queensland University of Technology Brisbane QLD 4001 Australia Dept. of Applied Informatics and Multimedia Asia University Taichung Taiwan

It is a big challenge to clearly identify the boundary between positive and negative streams. Several attempts have used negative feedback to solve this challenge;however, there are two issues for using negative relevance feedback to improve the effectiveness of information filtering. The first one is how to select constructive negative samples in order to reduce the space of negative documents. The second issue is how to decide noisy extracted features that should be updated based on the selected negative samples. This paper proposes a pattern mining based approach to select some offenders from the negative documents, where an offender can be used to reduce the side effects of noisy features. It also classifies extracted features (i.e., terms) into three categories: positive specific terms, general terms, and negative specific terms. In this way, multiple revising strategies can be used to update extracted features. An iterative learning algorithm is also proposed to implement this approach on RCV1, and substantial experiments show that the proposed approach achieves encouraging performance. © 2012 - IOS Press and the authors. All rights reserved.

关键词： Information filtering

来源：评论

学校读者我要写书评

暂无评论

Optimized strategies for mapping three-dimensional FFTs onto CUDA GPUs

Optimized strategies for mapping three-dimensional FFTs onto...

引用

2012 Innovative Parallel Computing, InPar 2012

作者： Wu, Jing JaJa, Joseph Dept. of Electrical and Computer Engineering Inst. for Advanced Computer Studies University of Maryland College Park MD United States

ISBN: (纸本)9781467326322

We address in this paper the problem of mapping three-dimensional Fast Fourier Transforms (FFTs) onto the recent, highly multithreaded CUDA Graphics Processing Units (GPUs) and present some of the fastest known algorithms for a wide range of 3-D FFTs on the NVIDIA Tesla and Fermi architectures. We exploit the high-degree of multi-threading offered by the CUDA environment while carefully managing the multiple levels of the memory hierarchy in such a way that: (i) all global memory accesses are coalesced into 128-byte device memory transactions issued in such a way as to optimize effects related to partition camping [19], locality [22], and associativity. and (ii) all computations are carried out on the registers with effective data movement involved in shared memory transposition. In particular, the number of global memory accesses to the entire 3-D dataset is minimized and the FFT computations along the X dimension are almost completely overlapped with global memory data transfers needed to compute the FFTs along the Y or Z dimensions. We were able to achieve performance between 135 GFlops and 172 GFlops on the Tesla architecture (Tesla C1060 and GTX280) and between 192 GFlops and 290 GFlops on the Fermi architecture (Tesla C2050 and GTX480). The bandwidths achieved by our algorithms reach over 90 GB/s for the GTX280 and around 140 GB/s for the GTX480. © 2012 IEEE.

关键词： Fast Fourier transforms

来源：评论

学校读者我要写书评

暂无评论

Transferring evolved reservoir features in reinforcement learning tasks

Transferring evolved reservoir features in reinforcement lea...

引用

9th European Workshop on Reinforcement Learning, EWRL 2011

作者： Chatzidimitriou, Kyriakos C. Partalas, Ioannis Mitkas, Pericles A. Vlahavas, Ioannis Dept. of Electrical and Computer Engineering Aristotle University of Thessaloniki Greece Informatics and Telematics Institute Centre for Research and Technology Hellas Greece Dept. of Informatics Aristotle University of Thessaloniki Greece

ISBN: (纸本)9783642299452

The major goal of transfer learning is to transfer knowledge acquired on a source task in order to facilitate learning on another, different, but usually related, target task. In this paper, we are using neuroevolution to evolve echo state networks on the source task and transfer the best performing reservoirs to be used as initial population on the target task. The idea is that any non-linear, temporal features, represented by the neurons of the reservoir and evolved on the source task, along with reservoir properties, will be a good starting point for a stochastic search on the target task. In a step towards full autonomy and by taking advantage of the random and fully connected nature of echo state networks, we examine a transfer method that renders any inter-task mappings of states and actions unnecessary. We tested our approach and that of inter-task mappings in two RL testbeds: the mountain car and the server job scheduling domains. Under various setups the results we obtained in both cases are promising. © 2012 Springer-Verlag.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Optimal social choice functions: A utilitarian view 12

Optimal social choice functions: A utilitarian view

引用

13th ACM Conference on Electronic Commerce, EC '12

作者： Boutilier, Craig Caragiannis, Ioannis Haber, Simi Lu, Tyler Procaccia, Ariel D. Sheffet, Or Dept. of Computer Science University of Toronto Toronto ON Canada Computer Technology Institute Dept. of Computer Engineering and Informatics University of Patras Patras Greece Dept. of Mathematical Sciences Carnegie Mellon University Pittsburgh PA United States Computer Science Dept. Carnegie Mellon University Pittsburgh PA United States

ISBN: (纸本)9781450314152

We adopt a utilitarian perspective on social choice, assuming that agents have (possibly latent) utility functions over some space of alternatives. For many reasons one might consider mechanisms, or social choice functions, that only have access to the ordinal rankings of alternatives by the individual agents rather than their utility functions. In this context, one possible objective for a social choice function is the maximization of (expected) social welfare relative to the information contained in these rankings. We study such optimal social choice functions under three different models, and underscore the important role played by scoring functions. In our worst-case model, no assumptions are made about the underlying distribution and we analyze the worst-case distortion - -or degree to which the selected alternative does not maximize social welfare - -of optimal social choice functions. In our average-case model, we derive optimal functions under neutral (or impartial culture) distributional models. Finally, a very general learning-theoretic model allows for the computation of optimal social choice functions (i.e., that maximize expected social welfare) under arbitrary, sampleable distributions. In the latter case, we provide both algorithms and sample complexity results for the class of scoring functions, and further validate the approach empirically. © 2012 ACM.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：