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

Communications psychology 2025年第1期3卷 47页

作者： Johannes P-H Seiler Jonas Elpelt Vsevolod Mashkov Aida Ghobadi Ambika Kapoor Daniel Turner Matthias Kaschube Oliver Tüscher Simon Rumpel Institute of Physiology Focus Program Translational Neurosciences University Medical Center of the Johannes Gutenberg University Mainz Mainz Germany. johseile@uni-mainz.de. Frankfurt Institute for Advanced Studies Frankfurt am Main Germany. Institute of Computer Science Goethe University Frankfurt Frankfurt am Main Germany. Institute of Physiology Focus Program Translational Neurosciences University Medical Center of the Johannes Gutenberg University Mainz Mainz Germany. Department of Psychiatry and Psychotherapy University Medical Center of the Johannes Gutenberg University Mainz Mainz Germany. Leibniz Institute for Resilience Research Mainz Germany. Department of Psychiatry Psychotherapy and Psychosomatic Medicine University Medicine Halle Martin-Luther University Halle-Wittenberg Halle Germany.

Our brains have evolved to represent and process sensory information from our environment and use it to guide behavior. The perception of sensory information and subsequent responses, such as boredom, however, vary across situations and individuals, impressively depicted by patients with attentional disorders who show extensive boredom across many situations. Despite these implications, it remains unclear how environmental features and individual traits act together to allow effective transmission of sensory information, and how both factors relate to boredom experience. We present a framework to address this issue, exposing human participants to text stimuli with defined objective information content, while assessing perceived information, boredom and text sentiment. Using information theory to formalize external and internal factors of information transmission, we find that lower information transmission predicts higher boredom. Moreover, individuals with attention deficit hyperactivity disorder show lower information transmission, compared to a control sample. Together, delineating the interaction of sensory information content with individual traits, boredom emerges as a situational consequence of reduced information-decoding, heightened in ADHD.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Restoration decoding for MIMO-OFDM ultrawideband communications

Restoration decoding for MIMO-OFDM ultrawideband communicati...

引用

2008 IEEE International Conference on Ultra-Wideband, ICUWB 2008

作者： Bashir, Sajid Malik, Wasim Q. Shah, Syed Ismail Department of Computer Engineering Centre for Advanced Studies in Engineering Sector G-5 Islamabad Pakistan Department of Brain and Cognitive Sciences Massachusetts Institute of Technology Cambridge MA United States Department of Computing and Technology Iqra University Sector H-9 Islamabad Pakistan

ISBN: (纸本)9781424418275

This paper discusses a near-optimal detection algorithm for 22 multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems operating on ultrawideband (UWB) channels. The reported affine restoration (AR) algorithm exploits the independence among the elements of the channel matrix and performs a parallel detection process at all receive antennas. For performance approaching that of maximum likelihood (ML) detection, but with lower complexity, the channel state information (CSI) at the receiver is utilized to restore the transmitted vector without channel matrix inversion or decomposition. We create a subset of the ML search space so as to reduce the computational complexity with minimal compromise on performance. We also discuss a modification in the proposed algorithm to further reduce the detection complexity. The proposed algorithm achieves near-optimal performance as demonstrated through simulations. ©2008 IEEE.

关键词： Maximum likelihood

来源：评论

学校读者我要写书评

暂无评论

Ethically Governed Artificial Intelligence Based Innovative Business Research in Finance and Marketing System 8

Ethically Governed Artificial Intelligence Based Innovative ...

引用

8th IEEE International Conference on science, Technology, Engineering and Mathematics, ICONSTEM 2023

作者： Krishna, Somanchi Hari Madala, Ravikiran Ramya, P. Sabarirajan, A. Dobhal, Dinesh Sapate, SheetalD. Vignana Bharathi Institute of Technology Department of Business Management Telangana Hyderabad501301 India University of Cumberlands Ph.D Information Technology DurhamNC United States Sona College of Technology Department of Computer Science and Engineering Tamilnadu Salem India Psna College of Engineering and Technology Department of Management Studies Tamilnadu Dindigul India Graphic Era Deemed to Be University Department of Computer Science Engineering Uttarakhand Dehradun India Bharati Vidyapeeth Jawaharlal Nehru Institute of Polytechnic Department of Computer Technology Maharashtra Pune India

ISBN: (纸本)9798350347791

The ascent of a few insightful labor and products throughout the course of recent years, as well as their business feasibility and financial impacts, have driven some to contemplate whether the ongoing coming of computer based intelligence is just marketing publicity or really can possibly change society. The review investigates the few impacts of artificial intelligence (artificial intelligence), and digs further into both good and troublesome consequences for legislatures, networks, organizations, and individuals. The entire impacts of simulated intelligence, from exploration and advancement to execution, are analyzed in this paper. With the advancement of computer based intelligence innovations, the marketing business is developing rapidly. Artificial intelligence offers numerous open doors, including the capacity to acquire data, hyper-customize administrations, further develop consumer loyalty, save working expenses, support efficiency, and so forth. For both monetary administrations organizations and advertisers, artificial intelligence has changed the game. © 2023 IEEE.

关键词： Finance

来源：评论

学校读者我要写书评

暂无评论

Imputation of single-cell gene expression with an autoencoder neural network

引用

Quantitative Biology 2020年第1期8卷 78-94页

作者： Md.Bahadur Badsha Rui Li Boxiang Liu Yang ILi Min Xian Nicholas EBanovich Audrey Qiuyan Fu Department of Statistical Science Institute for Bioinformatics and Evolutionary StudiesInstitute for Modeling Collaboration&InnovationUniversity of IdahoMoscowID 83844USA Department of Biology Stanford UniversityStanfordCA 94305USA Section of Genetic Medicine University of ChicagoChicagoIL 60637USA Department of Computer Science University of IdahoIdaho FallsID 83401USA The Translational Genomics Research Institute PhoenixAZ 85004USA

Background:Single-cell RNA-sequencing(scRNA-seq)is a rapidly evolving technology that enables measurement of gene expression levels at an unprecedented *** the explosive growth in the number of cells that can be assayed by a single experiment,scRNA-seq still has several limitations,including high rates of dropouts,which result in a large number of genes having zero read count in the scRNA-seq data,and complicate downstream ***:To overcome this problem,we treat zeros as missing values and develop nonparametric deep learning methods for ***,our LATE(Learning with AuToEncoder)method trains an autoencoder with random initial values of the parameters,whereas our TRANSLATE(TRANSfer learning with LATE)method further allows for the use of a reference gene expression data set to provide LATE with an initial set of parameter ***:On both simulated and real data,LATE and TRANSLATE outperform existing scRNA-seq imputation methods,achieving lower mean squared error in most cases,recovering nonlinear gene-gene relationships,and better separating cell *** are also highly scalable and can efficiently process over 1 million cells in just a few hours on a ***:We demonstrate that our nonparametric approach to imputation based on autoencoders is powerful and highly efficient.

关键词： single-cell gene expression deep learning autoencoder

来源：评论

学校读者我要写书评

暂无评论

Single- and Multi-Hop BERT Question Classifier for Open-Domain Question Answering (SiMQC)

Single- and Multi-Hop BERT Question Classifier for Open-Doma...

引用

Iranian Conference on Electrical Engineering (ICEE)

作者： Faeze Zakaryapour Sayyad Mahdi Bohlouli dept. Computer Science and Information Technology Institute for Advanced Studies in Basic Sciences (IASBS) Zanjan Iran

Multi-hop Question Answering has recently received particular attention in research and practice, especially in the context of conversational systems and answering complex questions. Various architectures have been proposed to answer these complex multi-hop questions. However, in real-world scenarios, a conversational system should answer both simple (single-hop) and complex (multi-hop) questions. In this work, we propose an efficient BERT question classifier that supports retrievers in the question-answering systems to process single- and multi-hop questions. We also released a mixed dataset consisting of both single- and multi-hop questions. We show that utilizing our classifier inside the QA system can improve these systems' accuracy and enable them to answer both kinds of questions considering their complexity.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Cancellation of Unwanted Audio to Support Interactive computer Music 30

Cancellation of Unwanted Audio to Support Interactive Comput...

引用

30th International computer Music Conference, ICMC 2004

作者： Lee, Jonghyun Dannenberg, Roger B. Chun, Joohwan Scientific Computing Laboratory Department of Electrical Engineering Korea Advanced Institute of Science and Technology 373-1 Kusong-Dong Yusong-Gu Taejeon305-701 Korea Republic of School of Computer Science Carnegie Mellon University United States

A real-time unwanted-audio cancellation system is developed. The system enhances recorded sound by canceling unwanted loudspeaker sounds picked up during the recording. After cancellation, the resulting sound gives an improved estimation of the live performer’s sound. The cancellation works by estimating the unwanted audio signal and subtracting it from the recorded signal. The canceller is composed of a delay block and two adaptive digital filters. Our work extends conventional echo-cancellation methods to address problems we encountered in music applications. We describe a real-time implementation in Aura and present experimental results in which the proposed canceller enhances the performance of a real-time pitch detector. The cancellation ratio is measured and limitations of the system are discussed. © ICMC 2004. All rights reserved.

关键词： Digital filters

来源：评论

学校读者我要写书评

暂无评论

Optimal allocation of carry-save-adders in arithmetic optimization 99

Optimal allocation of carry-save-adders in arithmetic optimi...

引用

IEEE International Conference on computer-Aided Design

作者： Junhyung Um Taewhan Kim C.L. Liu Department of Computer Science and Advanced Information Technology Research Center (AITrc) Korea Advanced Institute of Science and Technology Taejon South Korea Department of Computer Science National Tsing Hua University Hsinchu Taiwan

ISBN: (纸本)9780780358324

Carry-save-adder(CSA) is one of the most widely used schemes for fast arithmetic in industry. This paper provides a solution to the problem of finding an optimal-timing allocation of CSAs. Specifically, we present a polynomial time algorithm which finds an optimal-timing CSA allocation for a given arithmetic expression. In addition, we extend our result for CSA allocation to the problem of optimizing arithmetic expressions across the boundary of design hierarchy by introducing a new concept, called auxiliary ports. Our algorithm can be used to carry out the CSA allocation step optimally and automatically, and this can be done within the context of a standard HDL synthesis environment.

关键词： Arithmetic Delay Circuit synthesis computer science Design optimization Timing Algorithm design and analysis Adders Information technology Polynomials

来源：评论

学校读者我要写书评

暂无评论

Ecology-inspired evolutionary algorithm using feasibility-based grouping for constrained optimization

Ecology-inspired evolutionary algorithm using feasibility-ba...

引用

Congress on Evolutionary Computation

作者： Ming Yuchi Jong-Hwan Kim Department of Electrical Engineering and Computer Science Korea Advanced Institute of Science and Technology Daejeon South Korea

When evolutionary algorithms are used for solving numerical constrained optimization problems, how to deal with the relationship between feasible and infeasible individuals can directly influence the final results. This paper proposes a novel ecology-inspired EA to balance the relationship between feasible and infeasible individuals. According to the feasibility of the individuals, the population is divided into two groups, feasible group and infeasible group. The evaluation and ranking of these two groups are performed separately. The number of parents from feasible group has a sigmoid relation with the number of feasible individuals, which is inspired by the ecological population growth in a confined space. The proposed method is tested using (/spl mu/, /spl lambda/) evolution strategies with 13 benchmark problems. Experimental results show that the proposed method is capable of improving performance of the dynamic penalty method for constrained optimization problems.

关键词： Evolutionary computation Constraint optimization Performance evaluation computer science Benchmark testing Upper bound

来源：评论

学校读者我要写书评

暂无评论

Multiple hash matching units (MHMU): An algorithmic ternary content addressable memory design for field programmable gate arrays 19

Multiple hash matching units (MHMU): An algorithmic ternary ...

引用

19th IEEE International Conference on High Performance Switching and Routing, HPSR 2018

作者： Reviriego, Pedro Pontarelli, Salvatore Ullah, Anees Zahir, Ali Bianchi, Giuseppe ARIES Research Center Universidad Antonio de Nebrija Spain Italy Department of Electrical and Computer Engineering Center of Advanced Studies in Engineering Pakistan Department of Electrical Engineering COMSATs Institute of Information Technology Pakistan University of Rome Tor Vergata Italy

ISBN: (纸本)9781538678015

As applications and user requirements are constantly evolving, there is a need to provide flexible networks that are able to process packets at high speed. One of the basic functions used for packet processing is matching a key formed by some fields of the incoming packet header against a set of stored rules. This is done for example to determine the next hop of a packet or to apply security checks on a firewall. In many cases, the stored rules have do not care bits as that enables a more flexible and compact representation of the rules. Therefore, the matching can be done in hardware using Ternary Content Addressable Memories (TCAMs). However, TCAMs pose several problems in many implementations. For example, for ASICs they require much more circuit area and power than standard SRAMs. On the other hand, designs based on programmable logic such as Field Programmable Gate Arrays (FPGAs) can only use the blocks provided by the FPGA that do not typically include TCAMs. In this last case, a TCAM can be emulated using the FPGA logic resources but with a large cost. To reduce the cost of implementing TCAMs, a number of algorithmic solutions have been proposed and are known as Algorithmic TCAMs or A-TCAMs. Most of those schemes target either software or ASIC implementations. In this paper we present Multiple Hash Matching Units (MHMU) an A-TCAM solution targeted towards FPGA implementations. The proposed scheme exploits the massive parallelism of FPGAs to implement many hash based matching units that use the embedded block RAM memories of the FPGA. The proposed MHMU scheme has been mapped to a Xilinx series 7 FPGA to check its efficiency in terms of resource usage and its scalability. To validate the effectiveness of MHMU, a simple configuration has been tested with Classbench generated sets of rules. The results show that the MHMU is able to consistently accommodate sets with several tens of thousands of rules with large keys. © 2018 IEEE.

关键词： Static random access storage

来源：评论

学校读者我要写书评

暂无评论

Towards high-quality visualization of superfluid vortices

arXiv

引用

arXiv 2017年

作者： Guo, Yulong Liu, Xiaopei Xiong, Chi Xu, Xuemiao Fu, Chi-Wing School of Information Science and Technology ShanghaiTech University Institute of Advanced Studies Nanyang Technological University Singapore Department of Computer Science and Engineering South China University of Technology Department of Computer Science and Engineering Chinese University of Hong Kong

Superfluidity is a special state of matter exhibiting macroscopic quantum phenomena and acting like a fluid with zero viscosity. In such a state, superfluid vortices exist as phase singularities of the model equation with unique distributions. This paper presents novel techniques to aid the visual understanding of superfluid vortices based on the state-of-the-art non-linear Klein-Gordon equation, which evolves a complex scalar field, giving rise to special vortex lattice/ring structures with dynamic vortex formation, reconnection, and Kelvin waves, etc. By formulating a numerical model with theoretical physicists in superfluid research, we obtain high-quality superfluid flow data sets without noise-like waves, suitable for vortex visualization. By further exploring superfluid vortex properties, we develop a new vortex identification and visualization method: a novel mechanism with velocity circulation to overcome phase singularity and an orthogonal-plane strategy to avoid ambiguity. Hence, our visualizations can help reveal various superfluid vortex structures and enable domain experts for related visual analysis, such as the steady vortex lattice/ring structures, dynamic vortex string interactions with reconnections and energy radiations, where the famous Kelvin waves and decaying vortex tangle were clearly observed. These visualizations have assisted physicists to verify the superfluid model, and further explore its dynamic behavior more intuitively. Copyright © 2017, The Authors. All rights reserved.

关键词： Visualization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：