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

CUID: A new study of perceived image quality and its subjective assessment

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Lévêque, Lucie Yang, Ji Yang, Xiaohan Guo, Pengfei Dasalla, Kenneth Li, Leida Wu, Yingying Liu, Hantao Laboratory Ergonomics and Cognitive Sciences applied to Transport Gustave Eiffel University Lyon France School of Computer Science and Informatics Cardiff University Cardiff United Kingdom School of Electronic and Information Engineering Xi'an Jiaotong University Xi'an China School of Computational Science Zhongkai University of Agriculture and Engineering Guangzhou China Department of Computer Science University of Bath Bath United Kingdom School of Artificial Intelligence Xidian University Xi’an China School of Mathematics Cardiff University Cardiff United Kingdom

关键词： Vision

Neighborhood mutual remainder: Self-stabilizing implementation of look-compute-move robots

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Dolev, Shlomi Kamei, Sayaka Katayama, Yoshiaki Ooshita, Fukuhito Wada, Koichi Department of Computer Science Ben-Gurion University of the Negev Israel Department of Information Engineering Graduate School of Engineering Hiroshima University Japan Department of Computer Science and Engineering Graduate School of Engineering Nagoya Institute of Technology Japan Graduate School of Science and Technology Nara Institute of Science and Technology Japan Department of Applied Informatics Faculty of Science and Engineering Hosei University Japan

Local mutual exclusion guarantees that no two neighboring processes enter a critical section at the same time while satisfying both mutual exclusion and no starvation properties. On the other hand, processes may want to execute some operation simultaneously with the neighbors. Of course, we can use a globally synchronized clock to achieve the task but it is very expensive to realize it in a distributed system in general. In this paper, we define a new concept neighborhood mutual remainder. A distributed algorithm that satisfies the neighborhood mutual remainder requirement should satisfy global fairness, l-exclusion and repeated local rendezvous requirements. Global fairness is satisfied when each process (that requests to enter the critical section infinitely often) executes the critical section infinitely often, l-exclusion is satisfied when at most l neighboring processes enter the critical section at the same time, and repeated local rendezvous is satisfied when for each process infinitely often no process in the closed neighborhood is in the critical or trying section. We first formalize the concept of neighborhood mutual remainder, and give a simple self-stabilizing algorithm to demonstrate the design paradigm to achieve neighborhood mutual remainder. We also present two applications of neighborhood mutual remainder to a Look-Compute-Move robot system. One is for implementing a move-atomic property and the other is for implementing FSYNC scheduler, where robots possess an independent clock that is advanced in the same speed. These are the first self-stabilizing implementations of the LCM synchronization. Copyright © 2019, The Authors. All rights reserved.

关键词： Clocks

Benchmarking quality-dependent and cost-sensitive score-level multimodal biometric fusion algorithms

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Poh, Norman Bourlai, Thirimachos Kittler, Josef Allano, Lorene Alonso-Fernandez, Fernando Ambekar, Onkar Baker, John Dorizzi, Bernadette Fatukasi, Omolara Fierrez, Julian Ganster, Harald Ortega-Garcia, Javier Maurer, Donald Salah, Albert Ali Scheidat, Tobias Vielhauer, Claus Centre for Vision Speech and Signal Processing School of Electronics and Physical Sciences University of Surrey Guildford SurreyGU2 7XH United Kingdom Biometrics Center Lane Department of Computer Science and Electrical Engineering College of Engineering and Mineral Resources West Virginia University MorgantownWV26506-6109 United States Institut Telecom Telecom and Management SudParis Evry91011 France Biometric Recognition Group – ATVS Escuela Politecnica Superior Universidad Autonoma de Madrid Madrid28049 Spain Amsterdam1098 XG Netherlands Applied Physics Laboratory Johns Hopkins University LaurelMD20723 United States Electronics and Physics Department Institut Telecom Telecom and Management SudParis Evry91011 France Institute of Digital Image Processing Joanneum Research Graz8010 Austria ISLA-ISIS University of Amsterdam Amsterdam1098 XG Netherlands Department of Informatics and Media Brandenburg University of Applied Sciences Brandenburg an der HavelD-14770 Germany Research Group Multimedia and Security Department of Technical and Business Information Systems Faculty of Computer Science Otto-von-Guericke-University of Magdeburg MagdeburgD-39106 Germany

Automatically verifying the identity of a person by means of biometrics (e.g., face and fingerprint) is an important application in our day-to-day activities such as accessing banking services and security control in airports. To increase the system reliability, several biometric devices are often used. Such a combined system is known as a multimodal biometric system. This paper reports a benchmarking study carried out within the framework of the BioSecure DS2 (Access Control) evaluation campaign organized by the University of Surrey, involving face, fingerprint, and iris biometrics for person authentication, targeting the application of physical access control in a medium-size establishment with some 500 persons. While multimodal biometrics is a well-investigated subject in the literature, there exists no benchmark for a fusion algorithm comparison. Working towards this goal, we designed two sets of experiments: quality-dependent and cost-sensitive evaluation. The quality-dependent evaluation aims at assessing how well fusion algorithms can perform under changing quality of raw biometric images principally due to change of devices. The cost-sensitive evaluation, on the other hand, investigates how well a fusion algorithm can perform given restricted computation and in the presence of software and hardware failures, resulting in errors such as failure-to-acquire and failure-to-match. Since multiple capturing devices are available, a fusion algorithm should be able to handle this nonideal but nevertheless realistic scenario. In both evaluations, each fusion algorithm is provided with scores from each biometric comparison subsystem as well as the quality measures of both the template and the query data. The response to the call of the evaluation campaign proved very encouraging, with the submission of 22 fusion systems. To the best of our knowledge, this campaign is the first attempt to benchmark quality-based multimodal fusion algorithms. In the presence of changing

关键词： Benchmarking

Paired domination versus domination and packing number in graphs

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Dettlaff, Magda Gozupek, Didem Raczek, Joanna Faculty of Applied Physics and Mathematics Gdansk University of Technology Poland Department of Computer Engineering Gebze Technical University Kocaeli Turkey Faculty of Electronics Telecommunications and Informatics Gdansk University of Technology Poland

Given a graph G = (V (G),E(G)), the size of a minimum dominating set, minimum paired dominating set, and a minimum total dominating set of a graph G are denoted by (G), pr(G), and t(G), respectively. For a positive integer k, a k-packing in G is a set S ⊆ V (G) such that for every pair of distinct vertices u and v in S, the distance between u and v is at least k + 1. The k-packing number is the order of a largest k-packing and is denoted by pk(G). It is well known that pr(G) ≤ 2(G). In this paper, we prove that it is NP-hard to determine whether pr(G) = 2(G) even for bipartite graphs. We provide a simple characterization of trees with pr(G) = 2(G), implying a polynomialtime recognition *** also prove that even for a bipartite graph, it is NP-hard to determine whether pr(G) = t(G).We finally prove that it is both NP-hard to determine whether pr(G) = 2p4(G) and whether pr(G) = 2p3(G). Copyright © 2019, The Authors. All rights reserved.

关键词： Trees (mathematics)

Brief announcement: Bounded-degree cut is fixed-parameter tractable 45

学校读者我要写书评

暂无评论

Brief announcement: Bounded-degree cut is fixed-parameter tr...

45th International Colloquium on Automata, Languages, and Programming, ICALP 2018

作者： Xiao, Mingyu Nagamochi, Hiroshi School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu China Department of Applied Mathematics and Physics Graduate School of Informatics Kyoto University Japan

ISBN: (纸本)9783959770767

In the bounded-degree cut problem, we are given a multigraph G = (V, E), two disjoint vertex subsets A, B ⊆ V , two functions uA, uB : V → (0, 1, . . ., |E|) on V , and an integer k ≥ 0. The task is to determine whether there is a minimal (A, B)-cut (VA, VB) of size at most k such that the degree of each vertex v ∈ VA in the induced subgraph G[VA] is at most uA(v) and the degree of each vertex v ∈ VB in the induced subgraph G[VB] is at most uB(v). In this paper, we show that the bounded-degree cut problem is fixed-parameter tractable by giving a 218k|G|O(1)-time algorithm. This is the first single exponential FPT algorithm for this problem. The core of the algorithm lies two new lemmas based on important cuts, which give some upper bounds on the number of candidates for vertex subsets in one part of a minimal cut satisfying some properties. These lemmas can be used to design fixed-parameter tractable algorithms for more related problems. © 2018 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. All rights reserved.

关键词： Parameter estimation

The dynamics simulation of knowledge potentials of agents including the feedback

学校读者我要写书评

暂无评论

Journal of Physics: Conference Series 2021年第1期1840卷

作者： V V Pasichnyk A Y Bomba M V Nazaruk N E Kunanets Information Systems and Networks Department Lviv Polytechnic National University 12 Bandera Str. Lviv 79000 Ukraine Computer science and Applied Mathematics Department National University of Water and Environmental Engineering 11 Soborna Str. Rivne 33028 Ukraine Informatics and Applied Mathematics Department Rivne State Humanitarian University 31 Plastova Str. Rivne 33000 Ukraine

The conceptual and mathematical models of the agents' knowledge potential redistribution considering their constituent components are constructed in the paper. A nonlinear model describing the dynamics of agents' knowledge potentials is developed taking into account the feedback effects (agent – student) on the source of knowledge (teacher / lecturer). In particular, the procedure of constructing a multicomponent two-dimensional array of discrete values of the knowledge potential constituent components for generating procedures to enhance (improve) the professional competences of knowledge sources, is generalized and specified.

关键词：

Software Performance of the ATLAS Track Reconstruction for LHC Run 3

学校读者我要写书评

暂无评论

Computing and Software for Big Science 2024年第1期8卷 1-32页

作者： Aad, G. Abbott, B. Abeling, K. Abicht, N.J. Abidi, S.H. Aboulhorma, A. Abramowicz, H. Abreu, H. Abulaiti, Y. Acharya, B.S. Bourdarios, C. Adam Adamczyk, L. Adamek, L. Addepalli, S.V. Addison, M.J. Adelman, J. Adiguzel, A. Adye, T. Affolder, A.A. Afik, Y. Agaras, M.N. Agarwala, J. Aggarwal, A. Agheorghiesei, C. Ahmad, A. Ahmadov, F. Ahmed, W.S. Ahuja, S. Ai, X. Aielli, G. Aikot, A. Tamlihat, M. Ait Aitbenchikh, B. Aizenberg, I. Akbiyik, M. Åkesson, T.P.A. Akimov, A.V. Akiyama, D. Akolkar, N.N. Khoury, K. Al Alberghi, G.L. Albert, J. Albicocco, P. Albouy, G.L. Alderweireldt, S. Aleksa, M. Aleksandrov, I.N. Alexa, C. Alexopoulos, T. Alfonsi, F. Algren, M. Alhroob, M. Ali, B. Ali, H.M.J. Ali, S. Alibocus, S.W. Aliev, M. Alimonti, G. Alkakhi, W. Allaire, C. Allbrooke, B.M.M. Allen, J.F. Flores, C. A. Allendes Allport, P.P. Aloisio, A. Alonso, F. Alpigiani, C. Estevez, M. Alvarez Fernandez, A. Alvarez Cardoso, M. Alves Alviggi, M.G. Aly, M. Coutinho, Y. Amaral Ambler, A. Amelung, C. Amerl, M. Ames, C.G. Amidei, D. Santos, S. P. Amor Dos Amos, K.R. Ananiev, V. Anastopoulos, C. Andeen, T. Anders, J.K. Andrean, S.Y. Andreazza, A. Angelidakis, S. Angerami, A. Anisenkov, A.V. Annovi, A. Antel, C. Anthony, M.T. Antipov, E. Antonelli, M. Anulli, F. Aoki, M. Aoki, T. Pozo, J. A. Aparisi Aparo, M.A. Bella, L. Aperio Appelt, C. Apyan, A. Aranzabal, N. Val, S. J. Arbiol Arcangeletti, C. Arce, A.T.H. Arena, E. Arguin, J.-F. Argyropoulos, S. Arling, J.-H. Arnaez, O. Arnold, H. Artoni, G. Asada, H. Asai, K. Asai, S. Asbah, N.A. Assahsah, J. Assamagan, K. Astalos, R. Atashi, S. Atkin, R.J. Atkinson, M. Atmani, H. Atmasiddha, P.A. Augsten, K. Auricchio, S. Auriol, A.D. Austrup, V.A. Avolio, G. Axiotis, K. Azuelos, G. Babal, D. Bachacou, H. Bachas, K. Bachiu, A. Backman, F. Badea, A. Bagnaia, P. Bahmani, M. Bailey, A.J. Bailey, V.R. Baines, J.T. Baines, L. Baker, O.K. Bakos, E. Gupta, D. Bakshi Balakrishnan, V. Balasubramanian, R. Baldin, E.M. Balek, P. Ballabene, E. Balli, F. Baltes, L.M. Balunas, W.K. Balz, J. Banas, E. Bandieramonte CPPM Aix-Marseille Université CNRS/IN2P3 Marseille France Homer L. Dodge Department of Physics and Astronomy University of Oklahoma Norman OK United States II. Physikalisches Institut Georg-August-Universität Göttingen Göttingen Germany Fakultät Physik Technische Universität Dortmund Dortmund Germany Physics Department Brookhaven National Laboratory Upton NY United States Faculté des sciences Université Mohammed V Rabat Morocco Raymond and Beverly Sackler School of Physics and Astronomy Tel Aviv University Tel Aviv Israel Department of Physics Technion Israel Institute of Technology Haifa Israel Department of Physics New York University New York NY United States INFN Gruppo Collegato di Udine Sezione di Trieste Udine Italy ICTP Trieste Italy Department of Physics Stanford University Stanford CA United States LAPP Université Savoie Mont Blanc CNRS/IN2P3 Annecy France AGH University of Krakow Faculty of Physics and Applied Computer Science Krakow Poland Department of Physics University of Toronto Toronto ON Canada Department of Physics Brandeis University Waltham MA United States School of Physics and Astronomy University of Manchester Manchester United Kingdom Department of Physics Northern Illinois University DeKalb IL United States Department of Physics Istanbul University Istanbul Turkey Particle Physics Department Rutherford Appleton Laboratory Didcot United Kingdom Santa Cruz Institute for Particle Physics University of California Santa Cruz Santa Cruz CA United States CERN Geneva Switzerland Institut de Física d’Altes Energies (IFAE) Barcelona Institute of Science and Technology Barcelona Spain INFN Sezione di Pavia Pavia Italy Dipartimento di Fisica Università di Pavia Pavia Italy Institut für Physik Universität Mainz Mainz Germany Department of Physics Alexandru Ioan Cuza University of Iasi Iasi Romania Affiliated with an international laboratory covered by a cooperation agreement with CERN Geneva Switzerland Institu

Charged particle reconstruction in the presence of many simultaneous proton–proton (pp) collisions in the LHC is a challenging task for the ATLAS experiment’s reconstruction software due to the combinatorial complexity. This paper describes the major changes made to adapt the software to reconstruct high-activity collisions with an average of 50 or more simultaneous pp interactions per bunch crossing (pile-up) promptly using the available computing resources. The performance of the key components of the track reconstruction chain and its dependence on pile-up are evaluated, and the improvement achieved compared to the previous software version is quantified. For events with an average of 60pp collisions per bunch crossing, the updated track reconstruction is twice as fast as the previous version, without significant reduction in reconstruction efficiency and while reducing the rate of combinatorial fake tracks by more than a factor two. © The Author(s) 2024.

关键词：

ThermalProGAN: A sequence-based thermally stable protein generator trained using unpaired data

学校读者我要写书评

暂无评论

Journal of bioinformatics and computational biology 2023年第1期21卷 2350008页

作者： Hui-Ling Huang Chong-Heng Weng Torbjörn E M Nordling Yi-Fan Liou International Program of Health Informatics and Management College of Management Chang Gung University No. 259 Wenhua 1st Road Guishan District Taoyuan City 33302 Taiwan. Department of Computer Science and Information Engineering National Central University No. 300 Zhongda Road Zhongli District Taoyuan City 320317 Taiwan. Department of Mechanical Engineering National Cheng Kung University No. 1 University Road Tainan City 701 Taiwan. Department of Applied Physics and Electronics Umeå University 90187 Umeå Sweden. Department of Virtual-Reality Interaction with Artificial Intelligence Technology Coretronic Reality Incorporation No. 5 Wenhua Rd. Hukou Township Hsinchu County 303 Taiwan.

MOTIVATION:The synthesis of proteins with novel desired properties is challenging but sought after by the industry and academia. The dominating approach is based on trial-and-error inducing point mutations, assisted by structural information or predictive models built with paired data that are difficult to collect. This study proposes a sequence-based unpaired-sample of novel protein inventor (SUNI) to build ThermalProGAN for generating thermally stable proteins based on sequence information. RESULTS:The ThermalProGAN can strongly mutate the input sequence with a median number of 32 residues. A known normal protein, 1RG0, was used to generate a thermally stable form by mutating 51 residues. After superimposing the two structures, high similarity is shown, indicating that the basic function would be conserved. Eighty four molecular dynamics simulation results of 1RG0 and the COVID-19 vaccine candidates with a total simulation time of 840[Formula: see text]ns indicate that the thermal stability increased. CONCLUSION:This proof of concept demonstrated that transfer of a desired protein property from one set of proteins is feasible. The source code of ThermalProGAN can be freely accessed at https://***/markliou/ThermalProGAN/ with an MIT license. The website is https://***:433. Supplementary data are available on Github.

关键词： CycleGAN Protein synthesis generative adversarial neural network thermal stability

Lecture Notes in Electrical Engineering

学校读者我要写书评

暂无评论

Preface

Lecture Notes in Electrical engineering 2021年 735 LNEE卷 ix-x页

作者： Thampi, Sabu M. Gelenbe, Erol Atiquzzaman, Mohammed Chaudhary, Vipin Li, Kuan-Ching Trivandrum Kerala India School of Computer Science University of Oklahoma NormanOK United States Department of Computer Science and Information Engineering Providence University Taichung Taiwan Institute of Theoretical and Applied Informatics Polish Academy of Sciences Gliwice Poland Department of Computer Science University at Buffalo State University BuffaloNY United States Case Western Reserve University ClevelandOH United States