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

Annual International Conference of the IEEE engineering in Medicine and Biology Society

作者： Chintha Chamalie Handapangoda Malin Premaratne Saeid Nahavandi with the Centre for Intelligent Systems Research Deakin University Geelong Victoria 3217 Australia with the Advanced Computing and Simulation Laboratory (A_XL) Department of Electrical and Computer Systems Engineering Monash University Clayton Victoria 3800 Australia malin.

ISBN: (纸本)9781424441198

Fluorescence has become a widely used technique for applications in noninvasive diagnostic tissue spectroscopy. The standard model used for characterizing fluorescence photon transport in biological tissue is based on the diffusion approximation. On the premise that the total energy of excitation and fluorescent photon flows must be conserved, we derive the widely used diffusion equations in fluorescence spectroscopy and show that there must be an additional term to account for the transport of fluorescent photons. The significance of this additional term in modeling fluorescence spectroscopy in biological tissue is assessed.

关键词： approximation fluorescence applications

来源：评论

学校读者我要写书评

暂无评论

Connecting spatially coupled LDPC code chains

Connecting spatially coupled LDPC code chains

引用

IEEE International Conference on Communications (ICC)

作者： Dmitri Truhachev David G. M. Mitchell Michael Lentmaier Daniel J. Costello Department of Computing Science University of Alberta Edmonton Canada Department of Electrical Engineering University of Notre Dame Notre Dame IN USA Vodafone Chair Mobile Communications Systems Dresden University of Technology Dresden Germany

Codes constructed from connected spatially coupled low-density parity-check code (SC-LDPCC) chains are proposed and analyzed. It is demonstrated that connecting coupled chains results in improved iterative decoding performance. The constructed protograph ensembles have better iterative decoding thresholds compared to an individual SC-LDPCC chain and require less computational complexity per bit when operating in the near-threshold region. In addition, it is shown that the proposed constructions are asymptotically good in terms of minimum distance.

关键词： Iterative decoding Bridges Error probability Convergence Reliability Convolutional codes

来源：评论

学校读者我要写书评

暂无评论

Improving spatially coupled LDPC codes by connecting chains

Improving spatially coupled LDPC codes by connecting chains

引用

IEEE International Symposium on Information Theory

In this paper, we study ensembles of connected spatially coupled low-density parity-check codes (SC-LDPCCs), i.e., ensembles described by graphs in which regular SC-LDPCC chains of various lengths serve as edges. We show that, by carefully connecting individual SC-LDPCC chains, we obtain LDPC code ensembles with improved iterative decoding thresholds compared to those of a single coupled chain, in addition to reducing the decoding complexity required to achieve a specific bit error probability. Moreover, we show that, like the component SC-LDPCC chains, the proposed constructions have a typical minimum distance that grows linearly with block length.

关键词： Joining processes Iterative decoding Error probability Couplings Convolutional codes Block codes

来源：评论

学校读者我要写书评

暂无评论

New codes on graphs constructed by connecting spatially coupled chains

New codes on graphs constructed by connecting spatially coup...

引用

Information Theory and Applications Workshop, ITA

A novel code construction based on spatially coupled low-density parity-check (SC-LDPC) code chains is presented. The proposed code ensembles are described by graphs in which individual SC-LDPC code chains of various lengths serve as edges. We demonstrate that connecting several appropriately chosen SC-LDPC code chains results in improved iterative decoding thresholds compared to those of a single coupled chain in addition to reducing the decoding complexity required to achieve a specific bit error probability.

关键词： Iterative decoding Error probability Joining processes Convergence Block codes Couplings

来源：评论

学校读者我要写书评

暂无评论

κ-Gap interval graphs

κ-Gap interval graphs

引用

10th Latin American Symposiumon Theoretical Informatics, LATIN 2012

作者： Fomin, Fedor V. Gaspers, Serge Golovach, Petr Suchan, Karol Szeider, Stefan Van Leeuwen, Erik Jan Vatshelle, Martin Villanger, Yngve Department of Informatics University of Bergen Bergen Norway Inst. of Information Systems Vienna University of Technology Vienna Austria School of Engineering and Computing Sciences Durham University Durham United Kingdom Facultad de Ingeniería y Ciencias Universidad Adolfo Ibáñez Santiago Chile Faculty of Applied Mathematics WMS AGH University of Science and Technology Krakow Poland

ISBN: (纸本)9783642293436

We initiate the study of a new parameterization of graph problems. In a multiple interval representation of a graph, each vertex is associated to at least one interval of the real line, with an edge between two vertices if and only if an interval associated to one vertex has a nonempty intersection with an interval associated to the other vertex. A graph on n vertices is a κ-gap interval graph if it has a multiple interval representation with at most n + κ intervals in total. In order to scale up the nice algorithmic properties of interval graphs (where κ = 0), we parameterize graph problems by κ, and find FPT algorithms for several problems, including Feedback Vertex Set, Dominating Set, Independent Set, Clique, Clique Cover, and Multiple Interval Transversal. The Coloring problem turns out to be [1]-hard and we design an XP algorithm for the recognition problem. © 2012 Springer-Verlag Berlin Heidelberg.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Inertial estimator learning automata

引用

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 2012年第6期E95-A卷 1041-1048页

作者： Zhang, Junqi Ni, Lina Xie, Chen Gao, Shangce Tang, Zheng Department of Computer Science and Technology Key Laboratory of Embedded System and Service Computing Tongji University Shanghai 200092 China College of Information Science and Engineering Shandong University of Science and Technology Qingdao China Department of Intellectual Information Systems Engineering University of Toyama Toyama-shi 930-8555 Japan

This paper presents an inertial estimator learning automata scheme by which both the short-term and long-term perspectives of the environment can be incorporated in the stochastic estimator-the long term information crystallized in terms of the running reward-probability estimates, and the short term information used by considering whether the most recent response was a reward or a penalty. Thus, when the shortterm perspective is considered, the stochastic estimator becomes pertinent in the context of the estimator algorithms. The proposed automata employ an inertial weight estimator as the short-term perspective to achieve a rapid and accurate convergence when operating in stationary random environments. According to the proposed inertial estimator scheme, the estimates of the reward probabilities of actions are affected by the last response from environment. In this way, actions that have gotten the positive response from environment in the short time, have the opportunity to be estimated as "optimal", to increase their choice probability and consequently, to be selected. The estimates become more reliable and consequently, the automaton rapidly and accurately converges to the optimal action. The asymptotic behavior of the proposed scheme is analyzed and it is proved to be Ε-optimal in every stationary random environment. Extensive simulation results indicate that the proposed algorithm converges faster than the traditional stochastic-estimator-based SERI scheme, and the deterministicestimator- based DGPA and DPRI schemes when operating in stationary random environments. Copyright © 2012 The Institute of Electronics, Information and Communication Engineers.

关键词： Probability

来源：评论

学校读者我要写书评

暂无评论

Scalable Architectures for SaaS

Scalable Architectures for SaaS

引用

IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed computing Workshops (ISORCW)

作者： Wei-Tek Tsai Yu Huang Xiaoying Bai Jerry Gao School of Computing Informatics and Decision Systems Engineering Arizona State University Tempe AZ USA Department of Computer Science and Technology INLIST Tsinghua University Beijing China Department of Computer Engineering College of Engineering San Jose State University Foundation San Jose CA USA

An important issue faced by Software-as-a-Service (SaaS) application is scalability. Each SaaS application is typically shared by multiple (tens or hundreds) organizations (tenants). Each tenant may have hundreds or thousands of users. Thus, the number of concurrent accesses is high. Handling a large number of user requests effectively is critical for SaaS applications. Various aspects of SaaS can have a significant impact on its scalability, including levels of scalability mechanisms, automated migration, tenant awareness, workload support, fault-tolerance and recovery, software architecture and database access. This paper identifies scalability factors and discusses their impacts on the scalability of SaaS applications. Existing approaches for addressing the scalibility of SaaS applications are also analyzed, and this paper suggests some alternatives to improve SaaS scalability based on the factors identified.

关键词： Scalability Databases Computer architecture Servers Software Fault tolerance Fault tolerant systems

来源：评论

学校读者我要写书评

暂无评论

OSR-Lite: Fast and deadlock-free NoC reconfiguration framework

OSR-Lite: Fast and deadlock-free NoC reconfiguration framewo...

引用

International Conference on Embedded Computer systems: Architectures, Modeling and Simulation (IC-SAMOS)

作者： Alessandro Strano Davide Bertozzi Francisco Triviño José L. Sánchez Francisco J. Alfaro José Flich University of Ferrara ENDIF Department Ferrara Italy Universidad de Castilla-La Mancha Computing Systems Department s/n Albacete Spain Universitat Politécnica de Valéncia Department of Computer Engineering Valencia Spain

Current and future on-chip networks will feature an enhanced degree of reconfigurability. Power management and virtualization strategies as well as the need to survive to the progressive onset of wear-out faults are root causes for that. In all these cases, a non-intrusive and efficient reconfiguration method is needed to allow the network to function uninterruptedly over the course of the reconfiguration process while remaining deadlock-free. This paper is inspired by the overlapped static reconfiguration (OSR) protocol developed for off-chip networks. However, in its native form its implementation in NoCs is out-of-reach. Therefore, we provide a careful engineering of the NoC switch architecture and of the system-level infrastructure to support a cost-effective, complete and transparent reconfiguration process. Performance during the reconfiguration process is not affected and implementation costs (critical path and area overhead) are proved to be fully affordable for a constrained system. Less than 250 cycles are needed for the reconfiguration process of an 8×8 2D mesh with marginal impact on system performance.

关键词： Routing Switches System recovery System-on-a-chip Protocols Network topology

来源：评论

学校读者我要写书评

暂无评论

Applying Cobit 4.1 to knowledge governance: Matrix ProGOB to control governance objectives

Applying Cobit 4.1 to knowledge governance: Matrix ProGOB to...

引用

Iberian Conference on Information systems and Technologies (CISTI)

作者： Juan Ignacio Rouyet Luis Joyanes Aguilar Antonio Folgueras Marcos IT Consulting Services Quint Wellington Redwood Madrid Spain Department of Languages and Computing Systems and Software Engineering Pontifical Salamanca University Madrid Spain Carlos III Technical University of Madrid Spain

ISBN: (纸本)9781467328432

Knowledge governance analyses to what extent knowledge processes are influenced by governance mechanisms. A number of advances have been made in this field, but much space remains for research. However, before advancing in this direction, we must have a tool to direct efforts and provide a certain notion of the progress made in research. This paper proposes a matrix that brings knowledge management processes into relation with knowledge governance objectives (ProGOb matrix). This matrix provides information about which knowledge processes affect which governance objectives, and to what extent. The ProGOb matrix can be highly useful in the current tendency towards the Web 2.0, where knowledge distribution requires knowledge governance which has clear objectives and takes specific actions.

关键词： Knowledge management Monitoring Process control Proposals Knowledge engineering Measurement

来源：评论

学校读者我要写书评

暂无评论

An Integrated Fuzzy-based Trustworthiness System for P2P Communications in JXTA-Overlay

An Integrated Fuzzy-based Trustworthiness System for P2P Com...

引用

International Conference on Broadband, Wireless computing, Communication and Applications (BWCCA)

作者： Kouhei Umezaki Evjola Spaho Leonard Barolli Fatos Xhafa Muhammad Younas Jiro Iwashige Graduate School of Engineering Fukuoka Institute of Technology Fukuoka Japan Department of Information and Communication Engineering Fukuoka Institute of Technology Fukuoka Japan Department of Languages and Informatics Systems Technical University of Catalonia Barcelona Spain Department of Computing and Communication Technologies Oxford Brookes University Oxford UK

Recently many researchers are working on Peer-to-Peer (P2P) networks, which are able to overcome the firewalls, NATs and other security devices without changing the network policy. P2P architectures will be very important for future distributed systems and applications. In such networks, peers are heterogeneous in providing the services and they do not have the same competence of reliability. Therefore, it is necessary to estimate whether a peer is trustworthy or not for file sharing and other services. In this paper, we propose an integrated fuzzy-based trustworthiness system for P2P Communications in JXTA-Overlay, which consists of two Fuzzy Logic Controllers (FLC1 and FLC2). For FLC1, we use three input parameters: Number of Jobs (NJ), Number of Connections (NC) and Connection Lifetime (CL) and the output is Actual Behavioural Criterion (ABC). We use ABC and Reputation (R) as input linguistic parameters for FLC2 and the output is Peer Reliability (PR). We evaluate the proposed system by computer simulations. The simulation results has shown that the proposed system has a good behaviour.

关键词： Pragmatics Reliability Fuzzy logic Iron Manganese Peer to peer computing Process control

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：