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

Robustness Checks in Composite Indices: A Responsible Approach 1

6th international conference on Dynamics Games and Science, DGS-VI-2018, 19th Latin American conference on Economic theory, JOLATE 2018 and 21st international Consortium on applied Bioeconomy Research, ICABR 2017

作者： Paredes-Gázquez, Juan Diego Pardo, Eva Rodríguez-Fernández, José Miguel UNED Facultad CC. Económicas y Empresariales Paseo Senda del Rey 11 Madrid28040 Spain Universidad de Valladolid Facultad CC. Económicas y Empresariales Avda del Valle Esgueva 6 Valladolid47011 Spain

ISBN: (数字)9783030781637

ISBN: (纸本)9783030781620

Scholars and practitioners are increasingly using composite indices. this is especially true in Corporate Social Responsibility (CSR) research, where composite indices are becoming a common measure. However, the robustness of these indices is not always tested or, if tested, it is mainly limited to the weighting scheme of the indicators of the index. the objective of this chapter is to highlight the importance of robustness checks in CSR composite indexes in order they can properly summarize CSR performance. We have constructed a CSR composite index, testing its robustness by using uncertainty and sensitivity analyses. the results evidence that missing data and normalization of indicators can highly affect the internal structure of CSR composite indices, making them unreliable sometimes. these results suggest that missing data treatment and the normalization of indicators deserve more attention by the CSR research community. Consequently, the robustness of CSR composite indexes should always be tested, especially if they include missing data. © 2021, Springer Nature Switzerland AG.

关键词： Uncertainty analysis

来源：评论

学校读者我要写书评

暂无评论

Waiting for Trains: Complexity Results 6th

Waiting for Trains: Complexity Results

引用

6th international conference on algorithms and discrete applied mathematics

作者： Tauer, Bjoern Fischer, Dennis Fuchs, Janosch Koch, Laura Vargas Zieger, Stephan Rhein Westfal TH Aachen Dept Comp Sci Aachen Germany Rhein Westfal TH Aachen Dept Econ & Business Aachen Germany Rhein Westfal TH Aachen Inst Transport Sci Aachen Germany

ISBN: (纸本)9783030392185;9783030392192

We introduce a model for train routing on railway systems. Trains route through a network over time from a start to an end depot. they occupy consecutive nodes and edges corresponding to their length and block each other. We study the case where the depots are part of the network (internal) and the case where the depots are not part of the network (external). the problem is a generalization of packet routing without buffers. We consider two different kinds of optimization problems. In the first, trains are only allowed to wait on predefined paths and in the second, trains are additionally allowed to shunt, i.e., change direction. In both cases, we are interested in minimizing the overall makespan. For waiting instances, we find NP-hardness results even on unidirectional paths. We also show W[1]-hardness and lower bounds on the running time using the Exponential Time Hypothesis. For shunting instances, we show PSPACE-completeness results on honeycomb graphs and transfer the previously shown NP-hardness results. We present a polynomial time algorithm for a special subclass of unidirectional paths.

关键词： Train scheduling Wormhole routing Packet routing Parameterized complexity

来源：评论

学校读者我要写书评

暂无评论

6th international Symposium on Signal Processing and Intelligent Recognition Systems, SIRS 2020

6th International Symposium on Signal Processing and Intelli...

引用

6th international Symposium on Advances in Signal Processing and Intelligent Recognition Systems, SIRS 2020

ISBN: (纸本)9789811604249

the proceedings contain 27 papers. the special focus in this conference is on Signal Processing and Intelligent Recognition Systems. the topics include: Improved Long-Short Term Memory U-Net for Image Segmentation;Extraction of Parcel Boundary from UAV Images Using Deep Learning Techniques;Grad-CAM-Based Classification of Chest X-Ray Images of Pneumonia Patients;periocular Recognition Under Unconstrained Image Capture Distances;acoustic Prediction of Elephants for Localization and Movement Tracking Using Sensors and Distance Metrics;community Detection algorithms in Complex Networks: A Survey;a Systematic Review on the Influence of User Personality in Rumor and Misinformation Propagation through Social Networks;HRIDAI: A Tale of Two Categories of ECGs;channel-Aware Decision Fusion with Rao Test for Multisensor Fusion;detection of Breast Cancer from Mammogram Images Using Deep Transfer Learning;Comprehending the Dynamics of EEG Generated Under Various Odorant Stimulation on the Brain;Robust Beamforming Against DOA Mismatch with Null Widening for Moving Interferences;6G Ultra-Low Latency Communication in Future Mobile XR Applications;applying Neural Style Transfer to Spectrograms of Environmental Audio;identification of Indian English by Speakers of Multiple Native Languages;Robust and Imperceptible Digital Image Watermarking Based on DWT-DCT-Schur;comparative Study of Maturation Profiles of Neural Cells in Different Species with the Help of Computer Vision and Deep Learning;deep Learning algorithms to Detect and Localize Acute Intracranial Hemorrhages;Explainable NLP: A Novel Methodology to Generate Human-Interpretable Explanation for Semantic Text Similarity;a Leak Detection in Water Pipelines Using discrete Wavelet Decomposition and Artificial Neural Network;supervised Feature Learning for Music Recommendation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

the complexity of AND-decomposition of Boolean functions

引用

discrete applied mathematics 2020年 280卷 113-132页

作者： Emelyanov, Pavel Ponomaryov, Denis Ershov Inst Informat Syst Lavrentiev Av 6 Novosibirsk 630090 Russia Novosibirsk State Univ Pirogova St 1 Novosibirsk 630090 Russia

We consider the complexity of decomposing a Boolean function into a conjunction of components, which may share a (possibly empty) given set of variables.. Boolean functions are given as expressions in CNF, DNF, full DNF, and ANF and it is assumed that decomposition components must be in the same normal form as the input expression. We show that deciding decomposability is in general intractable for CNF and DNF already for the empty set of shared variables between the components. On the other hand, we demonstrate that for positive CNF and DNF and full DNF, the finest decomposition components wrt a given. can be computed in polynomial time (in the size of the input expression given as a string). the tractability results employ an efficient transformation of input expressions into series of expressions in ANFs aka Boolean polynomials, for which we provide a polynomial time factorization algorithm. Since the reduction leads to solving series of factorization tasks for Boolean polynomials, we discuss a number of ideas on how to optimize massive factorization and report preliminary experimental results. (C) 2019 Elsevier B.V. All rights reserved.

关键词： Conjunctive decomposition Disjoint decomposition Polynomial factorization Computational complexity

来源：评论

学校读者我要写书评

暂无评论

Sign Language Recognition Using Leap Motion Based on Time-Frequency Characterization and Conventional Machine Learning Techniques 4th

Sign Language Recognition Using Leap Motion Based on Time-Fr...

引用

4th international conference on applied Informatics (ICAI)

作者： Lopez-Alban, D. Lopez-Barrera, A. Mayorca-Torres, D. Peluffo-Ordonez, D. Univ Mariana Pasto 520001 Colombia Mohammed VI Polytech Univ Ben Guerir 47963 Morocco SDAS Res Grp Ben Guerir 47963 Morocco

ISBN: (纸本)9783030896546;9783030896539

the abstract should briefly summarize the contents of the paper in Sign language is the form of communication between the deaf and hearing population, which uses the gesture-spatial configuration of the hands as a communication channel with their social environment. this work proposes the development of a gesture recognition method associated with sign language from the processing of time series from the spatial position of hand reference points granted by a Leap Motion optical sensor. A methodology applied to a validated American Sign Language (ASL) Dataset which involves the following sections: (i) pre-processing for filtering null frames, (ii) segmentation of relevant information, (iii) time-frequency characterization from the discrete Wavelet Transform (DWT). Subsequently, the classification is carried out with Machine Learning algorithms (iv). It is graded by a 97.96% rating yield using the proposed methodology with the Fast Tree algorithm.

关键词： Sign language Leap motion discrete wavelet transform Machine learning

来源：评论

学校读者我要写书评

暂无评论

Numerical simulation of subsonic gas flows using local discrete nonreflecting boundary conditions 6

Numerical simulation of subsonic gas flows using local discr...

引用

6th ECCOMAS European conference on Computational Mechanics: Solids, Structures and Coupled Problems, ECCM 2018 and 7th ECCOMAS European conference on Computational Fluid Dynamics, ECFD 2018

作者： Abalakin, Ilya V. Dorodnicyn, Ludwig W. M.V. Keldysh Institute for Applied Mathematics Miusskaia sq. 4 Moscow125047 Russia M.V. Lomonosov Moscow State University Faculty CMC Vorobievy gory Moscow119991 Russia

ISBN: (纸本)9788494731167

this paper is devoted to development of nonreflecting boundary conditions for finite-difference schemes in multi-dimensional gas dynamics. Such boundary conditions are local and do not require large computational resources. the distinction between continuous and discrete formulations is taken into account. Examples of schemes and boundary conditions are shown, which cause small wave reflections for any angle of incidence. Various numerical tests-both linear and nonlinear-are presented. Copyright © Crown copyright (2018).All right reserved.

关键词： Gas dynamics

来源：评论

学校读者我要写书评

暂无评论

Deep Reinforcement Learning-based Obstacle Avoidance for Robot Movement in Warehouse Environments

Deep Reinforcement Learning-based Obstacle Avoidance for Rob...

引用

IEEE international conference on Civil Aviation Safety and Information Technology (ICCASIT)

作者： Keqin Li Jiajing Chen Dezhi Yu Tao Dajun Xinyu Qiu Jieting Lian Ryan Ji Shengyuan Zhang Zhenyu Wan Baiwei Sun Bo Hong Fanghao Ni Jiaqi Han Department of Computer Science AMA University Quezon Philippines Courant Institute New York University 251 Mercer St New York NY USA School of Information University of California Berkeley University Avenue and Oxford St Berkeley CA United States Master of Science in Mechanical Engineering School of Engineering Carnegie Mellon University 5000 Forbes Avenue Pittsburgh PA USA College of Engineering Northeastern University Seattle USA Master of Science in Database Technology School of Professional Studies New York University 50 West 4th Street New York NY USA College of Engineering Cornell University 616 Thurston Ave Ithaca NY US Master of Professional Science in Applied Statistics-Data Science College of Computing and Information Science Cornell University 616 Thurston Ave Ithaca NY USA Independent Researcher Beijing China Master of Computer Science Donald Bren School of Information and Computer Sciences University of California Irvine 510 Aldrich Hall Irvine CA USA School of Informatics Computing and Cyber Systems Northern Arizona University Flagstaff AZ USA Shanghai Institute of Technology Shanghai China

ISBN: (数字)9798350389418

ISBN: (纸本)9798350389425

this paper proposes a deep reinforcement learning based on the warehouse environment, the mobile robot obstacle avoidance Algorithm. Firstly, the value function network is improved based on the pedestrian interaction. We can learn to obtain the relative importance of the current state and the historical trajectory state as well as the joint impact on the robot’s obstacle avoidance strategy. Secondly, the reward function of reinforcement learning is designed based on the spatial behaviour of pedestrians, and the robot is punished for the state where the angle changes too much, so as to achieve the requirement of comfortable obstacle avoidance. Finally, the feasibility and effectiveness of the deep reinforcement learning-based mobile robot obstacle avoidance algorithm in the warehouse environment in the complex environment of the warehouse are verified through simulation experiments.

关键词： Legged locomotion Pedestrians Heuristic algorithms Robot sensing systems Feature extraction Trajectory Safety Data mining Collision avoidance Information technology

来源：评论

学校读者我要写书评

暂无评论

Methodology, based on the correlation and the discrete wavelet transform to debug and correct the misalignment signal amplitude, a-scan, for images by time of flight diffraction, d-scan 6th

Methodology, based on the correlation and the discrete wavel...

引用

6th international conference on Advanced Engineering theory and Applications, AETA 2019

作者： Rodríguez Martínez, Jairo Alejandro Electronic Engineering Faculty Santo Tomás University Cra. 9 no. 51-11 Bogotá110231 Colombia

ISBN: (纸本)9783030530204

this article presents a non-invasive ultrasonic methodology for assessing the quality of welding in metal joints, but mentioning their most frequent defects. Subsequently, the concept of amplitude scanning, A-Scan, is ex plained as well as the ultrasonic imaging technique known as TOFD time of flight diffraction in D-Scan mode is detailed. then, the problem regarding the misalignment of the A-Scan signals and their distorting effect on the TOFD images is raised, and in like manner the implementation of an algorithm based on the correlation that allows for this problem to be eliminated is described. On the other hand, due to the non-stationary of the ultrasound signals, signal processing techniques are used to eliminate the noise present in these signals, Wavelet analysis and synthesis is used for this purpose in the domains of continuous and discrete time, which finally lead to multiresolution filtering applied to the A-Scan signals. © Springer Nature Switzerland AG 2021.

关键词： Ultrasonic imaging

来源：评论

学校读者我要写书评

暂无评论

Partitioning Cographs into Two Forests and One Independent Set 6th

Partitioning Cographs into Two Forests and One Independent S...

引用

6th international conference on algorithms and discrete applied mathematics

作者： Hell, Pavol Hernandez-Cruz, Cesar Sanyal, Anurag Simon Fraser Univ Sch Comp Sci Univ Dr 8888 Burnaby BC V5A 1S6 Canada Univ Nacl Autonoma Mexico Fac Ciencias Ave Univ 3000Circuito Exterior S-N Mexico City 04510 DF Mexico

ISBN: (纸本)9783030392185;9783030392192

We consider a variation of arboricity, where a graph is partitioned into p forests and q independent sets. these problems are NP-complete in general, but polynomial-time solvable in the class of cographs;in fact, for each p and q there are only finitely many minimal non-partitionable cographs. In previous investigations it was revealed that when p = 0 or p = 1, these minimal non-partitionable cographs can be uniformly described as one family of obstructions valid for all values of q. We investigate the next case, when p = 2;we provide the complete family of minimal obstructions for p = 2, q = 1, and find that they include more than just the natural extensions of the previously described obstructions for p = 2, q = 0. thus a uniform description for all q seems unlikely already in the case p = 2. Our result gives a concrete forbidden induced subgraph characterization of cographs that can be partitioned into two forests and one independent set. Since our proof is algorithmic, we can apply our characterization to complement the recognition algorithm for partitionable cographs by an algorithm to certify non-partitionable cographs by finding a forbidden induced subgraph.

关键词： Vertex arboricity Independent vertex feedback set Cograph Forbidden subgraph characterization Colouring Partition

来源：评论

学校读者我要写书评

暂无评论

Electro-optical Modulation Properties of Holographic Polymer Dispersed Liquid Crystal Gratings

Electro-optical Modulation Properties of Holographic Polymer...

引用

Electronics and Electrical Engineering Technology (EEET), international conference on

作者： Yizi Cao Zhuoya Zhu Yanwen Qi Byung Seong Bae Damian Chinedu Onwudiwe Wei Lei Joint International Research Laboratory of Information Display and Visualization School of Electronic Science and Technology Southeast University Nanjing China Department of Electronics &Display Engineering Hoseo University Hoseo Ro 79 Asan city Chungnam Republic of Korea Department of Chemistry School of Mathematics and Physical Sciences Faculty of Natural and Agricultural Sciences North- West University Mafikeng Campus Private Bag X2046 Mmabatho South Africa

ISBN: (数字)9798350395594

ISBN: (纸本)9798350395600

Holographic Polymer Dispersed Liquid Crystal (HPDLC) gratings can convert incident light from diffraction to transmission under an applied driving electric field. therefore, it is expected to be used as a new type of volume holographic diffraction grating to electrically control the output of images matching the ambient light intensity. In H-PDLC gratings, liquid crystal microdroplets dispersed in the polymer matrix are difficult to change their orientation under the anchoring energy of the substrate and polymer matrix, which leads to a high driving voltage. the effect of refractive index modulation and liquid crystal director on the diffraction efficiency were simulated and investigated in this paper. In addition, the optimized H-PDLC grating diffraction efficiency of $\mathbf{9 7. 2 \%}$ was obtained by adding the nonionic surfactant SPAN80. When the concentration of SPAN80 was $6 \%$, the threshold field intensity compared to the un-doped surfactant grating, decreased from $15 \mathrm{~V} / \mu \mathrm{m}$ to $1.37 \mathrm{~V} / \mu \mathrm{m}$.

关键词： Diffraction Refractive index Modulation Diffraction gratings Vectors threshold voltage Gratings

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：