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

Sleep and Biological Rhythms 2016年第1期5卷 A1-A189页

作者： J. Ferrie M. Shipley F. Cappuccio E. Brunner M. Miller M. Kumari M. Marmot A. Coenen J. L. Castillo F. Araya G. Bustamante L. Montecino C. Torres S. Oporto J. Gronli E. Fiske R. Murison B. Bjorvatn E. Sorensen R. Ursin C. M. Portas S. Rajaraman A. Gribok N. Wesensten T. Balkin J. Reifman N. Dursunoglu S. Ozkurt S. Baser O. Delen S. Sarikaya P. Sadler P. Mitchell D. Françon M. Decobert B. Herve A. Richard G. Griebel P. Avenet B. Scatton G. L. Fur D. Eckert A. Jordan A. Wellman S. Smith A. Malhotra D. White D. Bruck I. Thomas A. Kritikos W. Oertel K. Stiasny-Kolster D. Garcia-Borreguero W. Poewe B. Hoegl R. Kohnen E. Schollmayer J. Keffel C. Trenkwalder A. Valle S. Roizenblatt F. Fregni P. Boggio S. Tufik K. Ward L. Robertson L. Palmer P. Eastwood D. Hillman J. Lee S. Mukherjee V. de Padova G. Barbato G. Ficca I. Zilli P. Salzarulo M. Veldi T. Hion V. Vasar M. Kull L. Nowak J. Davis Y. Latzer O. Tzischinsky S. Crowley M. Carskadon M. Anca-Herschkovitsch D. Frey J. Ortega C. Wiseman C. Farley K. Wright A. Campbell A. Neill K. Spiegel R. Leproult E. Tasali N. Scherberg E. van Cauter A. T. Noradina N. A. Karim I. Norlinah A. A. Raymond R. Sahathevan B. Hamidon E. Werth R. Poryazova R. Khatami C. Bassetti R. G. Beran L. Ainley G. Holand J. Duncan H. Kinney B. Davis B. Hood S. Frey C. Schmidt M. Hofstetter P. Peigneux C. Cajochen W.-P. Hu J.-D. Li C. Zhang L. Boehmer J. Siegel Q.-Y. Zhou Y. Sagawa H. Kondo T. Takemura H. Kanayama Y. Kaneko M. Sato T. Kanbayashi Y. Hishikawa T. Shimizu A. Viola L. James L. Schlangen D.-J. Dijk R. Andretic Y.-C. Kim K.-A. Han F. Jones R. Greenspan L. Sanford L. Yang X. Tang K. Dieter E. Uta H. Sven M. Richard N. Oyane S. Pallesen F. Holsten Y. Inoue M. Fujita N. Emura K. Kuroda N. Uchimura A. Johnston J. Astbury G. Kennedy K. Hoedlmoser M. Schabus T. Pecherstorfer S. Moser G. Gruber P. Anderer W. Klimesch N. Naidoo M. Ferber A. Pack D. Neu O. Mairesse G. Hoffmann A. Dris L. Lambrecht P. Linkowski P. Verbanck O. Le Bon N. Matsuura M. Yamao N. Adachi R. Aritomi Y. Komada H. Tanaka S. Shirak University College London London UK University College London London USA Warwick Medical School London UK Warwick Medical School Coventry USA Radboud University Nijmegen Nijmegen Netherlands Department of Neurology University of Chile Santiago Chile Neurology Service Hospital del Salvador Santiago Chile Family Health Center Juan Pablo II Santiago Chile Department of Biomedicine Section on Physiology Univeristy of Bergen Bergen Norway Department of Public Health and Primary Health Care Univeristy of Bergen Bergen Norway Department of Public Health and Primary Health Care University of Bergen Bergen Norway Norwegian Competence Center for Sleep Disorders Haukeland University Hospital Bergen Norway Department of Child and Adolescent Psychiatry Haukeland University Hospital Univeristy of Bergen Bergen Norway Department of Biomedicine University of Bergen Bergen Norway US Army Medical Research and Materiel Command Fort Detrick Frederick USA Walter Reed Army Institute of Research Silver Spring USA Department of Behavioral Biology Walter Reed Army Institute of Research Silver Spring USA Faculty Department of Pulmonology Pamukkale University Medical Denizli Turkey University of Ballarat Ballarat Australia Sanofi-Aventis Recherche et Developpement Paris France Brigham and Women’s Hospital Harvard Medical School Boston USA The University of Queensland Adelaide Australia School of Psychology University of Queensland Brisbane Australia The University of Queensland Brisbane Australia Victoria University Melbourne Australia Department of Psychology Victoria University Melbourne Australia School of Psychology Victoria University Melbourne Australia Philips-Universität Marburg Germany Philips-Universitaet-Marburg Marburg Germany Instituto de Investigaciones del Sueno Madrid Spain Universitätsklinik für Neurologie Innsbruck Austria Universitaetsklinik fuer Neurologie Innsbruck Austria IMEREM GmbH Nuernberg Germany Schwarz Pharma AG Monheim Germany

来源：评论

学校读者我要写书评

暂无评论

Power management over co-channel femtocells in LTE-A systems

Power management over co-channel femtocells in LTE-A systems

引用

IFIP Wireless Days, WD

作者： Christos Bouras Georgios Diles Vasileios Kokkinos Andreas Papazois Computer Technology Institute and Press “Diophantus” Patras Greece Computer Engineering and Informatics Dept. University of Patras Greece

The use of femtocells has been an attractive solution since it achieves better coverage and capacity and low cost for deployment and maintenance. However, their performance can be compromised by the cross-tier interference with existing macrocell infrastructure or between adjacent femtocells, especially in the case of co-channel deployment. One way to address this, is adjusting the transmit power of every femto base station with respect for overall performance. To this direction, we have implemented a framework that simulates femtocell overlays over LTE-Advanced (LTE-A) macrocellular systems. The framework allows power management over user-defined femtocell deployment, deciding their power levels according to three different power schemes. The resulting throughput is presented for every point of the macrocell in a user-friendly GUI. In this paper, we present the design of this framework and discuss the results.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Bagged nonlinear Hebbian learning algorithm for fuzzy cognitive maps working on classification tasks

Bagged nonlinear Hebbian learning algorithm for fuzzy cognit...

引用

7th Hellenic Conference on Artificial Intelligence, SETN 2012

作者： Papageorgiou, Elpiniki I. Oikonomou, Panagiotis Kannappan, Arthi Technological Educational Institute of Lamia Informatics and Computer Technology Department 3rd km Old National Road Lamia-Arthens 35100 Lamia Greece University of Thessaly Computer and Communication Engineering Dept. 38221 Volos Greece RVS College of Computer Applications Coimbatore-641402 Tamilnadu India

ISBN: (纸本)9783642304477

Learning of fuzzy cognitive maps (FCMs) is one of the most useful characteristics which have a high impact on modeling and inference capabilities of them. The learning approaches for FCMs are concentrated on learning the connection matrix, based either on expert intervention and/or on the available historical data. Most learning approaches for FCMs are Hebbian-based and evolutionary-based algorithms. A new learning algorithm for FCMs is proposed in this research work, inheriting the main aspects of the bagging approach which is an ensemble based learning approach. The FCM nonlinear Hebbian learning (NHL) algorithm enhanced by the bagging technique is investigated contributing to an approach where the model is trained using NHL algorithm as a base learner classifier. This work is inspired from the neural networks ensembles and it is used to learn the FCM ensembles produced by the NHL exploiting better classification accuracies. © 2012 Springer-Verlag .

关键词： Fuzzy Cognitive Maps

来源：评论

学校读者我要写书评

暂无评论

A Fuzzy Cognitive Map for Identifying User Satisfaction from Smartphones

A Fuzzy Cognitive Map for Identifying User Satisfaction from...

引用

Panhellenic Conference on informatics (PCI)

作者： Vassilis C. Gerogiannis Sotiria Papadopoulou Elpiniki I. Papageorgiou Dept. of Project Management Technological Education Institute of Larissa Greece Dept. of Informatics & Computer Technology Institute of Lamia Greece

Fuzzy Cognitive Map (FCM) is an efficient knowledge representation and reasoning method, which is based on human knowledge and experience. In this work, a FCM model is constructed to represent users' perceptions of satisfaction from Information technology (IT) products, such as smart phones. A set of key factors, related with smart phone characteristics and functionalities, was first derived from the literature to construct the FCM model. Then, a questionnaire was disseminated to a number of randomly selected (current/potential) smart phone users. Users' preferences were converted into fuzzy numbers representing the degree of satisfaction, as it was expressed by individual users, from each corresponding factor. Strengths of causal relationships between factors were specified by calculating similarities/dissimilarities between these fuzzy numbers. The produced FCM indicates the smart phone functionalities and trade-offs which influence more the perceived user satisfaction.

关键词： Smart phones Analytical models Computational modeling Mathematical model Fuzzy cognitive maps Usability

来源：评论

学校读者我要写书评

暂无评论

Robust face recognition using wavelet and dct based lighting normalization, and shifting-mean lda

Robust face recognition using wavelet and dct based lighting...

引用

1st International Conference on Pattern Recognition Applications and Methods, ICPRAM 2012

作者： Gede Pasek Suta Wijaya, I. Uchimura, Keiichi Koutaki, Gou Zhang, Cuicui Electrical Engineering and Computer Science Dept. Kumamoto University Kurokami 2-39-1 Kumamoto Shi Japan Electrical Engineering Dept. Mataram University Jl. Majapahit 62 Mataram Indonesia Department of Intelligence Science and Technology Graduate School of Informatics Kyoto University Kyoto Japan

ISBN: (纸本)9789898425980

This paper presents an integration of Wavelet and Discrete Cosine Transform (DCT) based lighting normalization, and shifting-mean Linear Discriminant Analysis (LDA) based face classifiers for face recognition. The aims are to provide robust recognition rate against large face variability due to lighting variations and to avoid retraining problem of the classical LDA for incremental data. In addition, the compact holistic features is employed for dimensional reduction of the raw face image. From the experimental results, the proposed method gives sufficient and robust achievement in terms of recognition rate and requires short computational time.

关键词： Lighting

来源：评论

学校读者我要写书评

暂无评论

On left and right seeds of a string

On left and right seeds of a string

引用

作者： Christou, Michalis Crochemore, Maxime Guth, Ondrej Iliopoulos, Costas S. Pissis, Solon P. King's College London Dept. of Informatics United Kingdom Czech Technical University in Prague Faculty of Information Technology Dept. of Theoretical Computer Science Czech Republic Curtin University Digital Ecosystems and Business Intelligence Institute Center for Stringology and Applications Australia Université Paris-Est France

We consider the problem of finding the repetitive structure of a given string y of length n. A factor u of y is a cover of y, if every letter of y lies within some occurrence of u in y. A string v is a seed of y, if it is a cover of a superstring of y. A left seed of y is a prefix of y, that is a cover of a superstring of y. Similarly, a right seed of y is a suffix of y, that is a cover of a superstring of y. An integer array LS is the minimal left-seed (resp. maximal left-seed) array of y, if LS[i] is the minimal (resp. maximal) length of left seeds of y[0.i]. The minimal right-seed (resp. maximal right-seed) array RS of y is defined in a similar fashion. In this article, we present linear-time algorithms for computing all left and right seeds of y, a linear-time algorithm for computing the minimal left-seed array of y, a linear-time solution for computing the maximal left-seed array of y, an O(nlogn)-time algorithm for computing the minimal right-seed array of y, and a linear-time solution for computing the maximal right-seed array of y. All algorithms use linear auxiliary space. © 2012 Elsevier B.V. All rights reserved.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Lombardi drawings of graphs

引用

Journal of Graph Algorithms and Applications 2012年第1期16卷 85-108页

作者： Duncan, Christian A. Eppstein, David Goodrich, Michael T. Kobourov, Stephen G. Nöllenburg, Martin Dept. of Computer Science Louisiana Tech Univ United States Dept. of Computer Science Univ. of California Irvine CA United States Dept. of Computer Science University of Arizona United States Faculty of Informatics Karlsruhe Institute of Technology Germany

We introduce the notion of Lombardi graph drawings, named after the American abstract artist Mark Lombardi. In these drawings, edges are represented as circular arcs rather than as line segments or polylines, and the vertices have perfect angular resolution: the edges are equiangularly spaced around each vertex. We describe algorithms for _nding Lombardi drawings of regular graphs, graphs of bounded degeneracy, and certain families of planar graphs.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

A declarative approach for AGVs modeling and cyclic scheduling

Frontiers in Artificial Intelligence and Applications

引用

Frontiers in Artificial Intelligence and Applications 2012年 243卷 1942-1952页

作者： Grzegorz, Bocewicz Zbigniew, Banaszak Pawel, Pawlewski Koszalin University of Technology Dept. of Electronics and Computer Science Koszalin Poland Warsaw University of Technology Dept. of Business Informatics Warsaw Poland Poznań University of Technology Faculty of Engineering Management Poznań Poland

ISBN: (纸本)9781614991045

In this paper, we deal with the cyclic scheduling problem usually observed in the FMS producing multi-type parts where the AGVS plays a role of a material handling system. Finding the conditions guaranteeing the AGVs dead-lock-free and collision-free movement policy is the aim of this work. The AGVs co-sharing the common parts of the transportation route while executing repetitive processes, i.e. being assigned to AGVs passing along machines in a cyclic way, can be modeled in terms of Cyclic Concurrent Process Systems (CCPS). Schedulability analysis for a given CCPS answers the question whether a cyclic schedule exists or not. The paper suggests a novel approach for schedulability analysis employing the declarative modeling. The sufficient conditions guaranteeing CCPS schedulability are discussed and the recursive approach to their designing is proposed. © 2012 The authors and IOS Press. All rights reserved.

关键词： Constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

A greedy algorithm for checking normality of cryptographic boolean functions

A greedy algorithm for checking normality of cryptographic b...

引用

International Symposium on Information Theory and Its Applications, ISITA

作者： Nicholas Kolokotronis Konstantinos Limniotis Dept. of Computer Science & Technology University of Peloponnese Tripolis Greece Dept. of Informatics & Telecomm. University of Athens Athens Greece

The cryptographic property of normality for cubic Boolean functions is studied in this paper. This property is highly relevant for the analysis and design of important building blocks in cryptosystems. We develop a novel greedy algorithm to find whether a given function is normal and the affine subspace where this property occurs. Our algorithm exploits the fact that cubic functions admit a matrix representation to work with tools having fast implementations. Thus, the proposed algorithm achieves a much lower complexity than other well known general techniques in the literature.

关键词： Boolean functions Complexity theory Cryptography Symmetric matrices Vectors Greedy algorithms Educational institutions

来源：评论

学校读者我要写书评

暂无评论

On the second-order nonlinearity of cubic Maiorana-McFarland Boolean functions

On the second-order nonlinearity of cubic Maiorana-McFarland...

引用

International Symposium on Information Theory and Its Applications, ISITA

The second-order nonlinearity, as well as the best quadratic approximations, of Boolean functions are studied in this paper. More precisely, we prove that cubic functions within the Maiorana-McFarland class achieve very high second-order nonlinearity, which is higher than the second-order nonlinearity obtained by other known constructions. Moreover, a subset of their best quadratic approximations is efficiently computed.

关键词： Boolean functions Approximation methods Cryptography Educational institutions Electronic mail Linearity computer science

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：