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

3rd International Workshop on Information, Computation, and Control Systems for Distributed Environments, ICCS-DE 2021

作者： Babenko, Mikhail Kucherov, Nikolay Tchernykh, Andrei Kuchukov, Viktor Golimblevskaia, Elena Kuchukova, Ekaterina Vashchenko, Irina North-Caucasus Center for Mathematical Research North-Caucasus Federal University 1 Pushkin Street Stavropol355017 Russia Sirius University of Science and Technology 1 Olympic Ave Sochi354340 Russia Institute for System Programming of the Russian Academy of Sciences Moscow109004 Russia CICESE Research Center carr. Tijuana-Ensenada 3918 Ensenada22860 Mexico South Ural State University Prospekt Lenina 76 Chelyabinsk454080 Russia

In this article, the formulation and proof of the theorem on the difference in the ranks of the numbers represented in the Residue Number System is carried out. A method is proposed that allows to reduce the amount of necessary calculations and increases the speed of calculating the rank of a number relative to the method for calculating the rank of a number based on the approximate method. To find the rank of a number in the method for calculating the rank of a number based on the approximate method, it is necessary to calculate n operations with numbers exceeding the modulus value;in the proposed method, it is necessary to calculate n ·(n-1)/ 2 operations not exceeding the value of the module. Copyright © 2021 for this paper by its authors.

关键词： Approximation theory

来源：评论

学校读者我要写书评

暂无评论

Monitoring System for Prediction and Detection of Epilepsy Seizure

Monitoring System for Prediction and Detection of Epilepsy S...

引用

International Conference on Advances in Computational Tools for Engineering Applications, ACTEA

作者： Nashaat el Halabi Roy Abi Zeid Daou Roger Achkar Ali Hayek Josef Börcsök Department of Computer and Communications Engineering American University of Science and Technology Beirut Lebanon MART Learning Education and Research Center Chananir Lebanon Department of Computer Architecture and System Programming University of Kassel Germany

Epilepsy is a neurological disorder associated with abnormal electrical activity in the brain, which causes seizures. The occurrence of seizure is not predictable; the duration between seizures, as well as the symptoms, varies from patient to another. Since the seizures are not predictable, and most of epileptic patients suffer from physical risky symptoms during the seizure, such patients are not able to perform daily work activities. The objective of this project is to design and implement a monitoring system for epileptic patients; the system should continuously check some vital signs, analyze the measurements, and decide whether the patient is nearly to have a seizure or not. Whenever a seizure is predicted, the system initiates an alarm. In addition, a notification should be sent to the health care responsible, as well as one preferred contact. By implementing the monitoring system, people who suffer from epilepsy will have more chance to work and live a normal life. Thus, this paper presents the concept of the overall system and shows results of the implemented systems: EEG, ECG and Fall Detection system. Results have shown that the fall detection accuracy reached 99.89% whereas the accuracy of the prediction using the ANN was about 97.34%.

关键词： Electroencephalography Epilepsy Feature extraction Tools Monitoring Artificial neural networks Support vector machines

来源：评论

学校读者我要写书评

暂无评论

How File-access Patterns Inuence the Degree of I/O Interference between Cluster Applications

Supercomputing Frontiers and Innovations

引用

Supercomputing Frontiers and Innovations 2019年第2期6卷 29-55页

作者： Shah, Aamer Kuo, Chih-Song Nomura, Akihiro Matsuoka, Satoshi Wolf, Felix Laboratory for Parallel Programming Technische Universita•t Darmstadt Darmstadt Germany Taiwan Semiconductor Manufacturing Company Limited Hsinchu Taiwan Global Scientic Information and Computing Center Tokyo Institute of Technology Tokyo Japan Department of Mathematical and Computing Science Tokyo Institute of Technology Tokyo Japan

On large-scale clusters, tens to hundreds of applications can simultaneously access a parallel le system, leading to contention and, in its wake, to degraded application performance. In this article, we analyze the inuence of le-access patterns on the degree of interference. As it is by experience most intrusive, we focus our attention on write-write contention. We observe considerable dierences among the interference potentials of several typical write patterns. In particular, we found that if one parallel program writes large output les while another one writes small checkpointing les, then the latter is slowed down when the checkpointing les are small enough and the former is vice versa. Moreover, applications with a few processes writing large output les already can signicantly hinder applications with many processes from checkpointing small les. Such eects can seriously impact the runtime of real applications|up to a factor of ve in one instance. Our insights and measurement techniques oer an opportunity to automatically classify the interference potential between applications and to adjust scheduling decisions accordingly. © The Authors 2019. This paper is published with open access at ***

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Improving communication in PGAS environments: Static and dynamic coalescing in UPC 13

Improving communication in PGAS environments: Static and dyn...

引用

27th ACM International Conference on Supercomputing, ICS 2013

作者： Alvanos, Michail Farreras, Montse Tiotto, Ettore Amaral, José Nelson Martorell, Xavier Programming Models Barcelona Supercomputer Center Barcelona Spain Department of Computer Architecture Universitat Politecnica de Catalunya Cr. Jordi Girona 1-3 08034 Barcelona Spain Static Compilation Technology IBM Toronto Laboratory Toronto ON Canada Dep. of Computing Science University of Alberta Edmonton AB Canada Barcelona Supercomputing Center Cr. Jordi Girona 29 08034 Barcelona Spain IBM Canada CAS Research Markham ON Canada

ISBN: (纸本)9781450321303

The goal of Partitioned Global Address Space (PGAS) languages is to improve programmer productivity in large scale parallel machines. However, PGAS programs may have many fine-grained shared accesses that lead to performance degradation. Manual code transformations or compiler optimizations are required to improve the performance of programs with fine-grained accesses. The downside of manual code transformations is the increased program complexity that hinders programmer productivity. On the other hand, most compiler optimizations of fine-grain accesses require knowledge of physical data mapping and the use of parallel loop constructs. This paper presents an optimization for the Unified Parallel C language that combines compile time (static) and runtime (dynamic) coalescing of shared data, without the knowledge of physical data mapping. Larger messages increase the network efficiency and static coalescing decreases the overhead of library calls. The performance evaluation uses two microbenchmarks and three benchmarks to obtain scaling and absolute performance numbers on up to 32768 cores of a Power 775 machine. Our results show that the compiler transformation results in speedups from 1.15X up to 21X compared with the baseline versions and that they achieve up to 63% the performance of the MPI versions. © 2013 ACM.

关键词： Dynamics

来源：评论

学校读者我要写书评

暂无评论

How file access patterns influence interference among cluster applications

How file access patterns influence interference among cluste...

引用

IEEE International Conference on Cluster Computing

作者： Chih-Song Kuo Aamer Shah Akihiro Nomura Satoshi Matsuoka Felix Wolf Department of Computer Science RWTH Aachen University Aachen Germany German Research School for Simulation Sciences Laboratory for Parallel Programming Aachen Germany Tokyo Institute of Technology Global Scientific Information and Computing Center Tokyo Japan

On large-scale clusters, tens to hundreds of applications can simultaneously access a parallel file system, leading to contention and in its wake to degraded application performance. However, the degree of interference depends on the specific file access pattern. On the basis of synchronized time-slice profiles, we compare the interference potential of different file access patterns. We consider both micro-benchmarks, to study the effects of certain patterns in isolation, and realistic applications to gauge the severity of such interference under production conditions. In particular, we found that writing large files simultaneously with small files can slow down the latter at small chunk sizes but the former at larger chunk sizes. We further show that such effects can seriously affect the runtime of real applications-up to a factor of five in one instance. In the future, both our insights and profiling techniques can be used to automatically classify the interference potential between applications and to adjust scheduling decisions accordingly.

关键词： Interference Servers Throughput Benchmark testing Market research Degradation Aggregates

来源：评论

学校读者我要写书评

暂无评论

The first optimal algorithm for smooth and strongly-convex-strongly-concave minimax optimization 22

The first optimal algorithm for smooth and strongly-convex-s...

引用

Proceedings of the 36th International Conference on Neural Information Processing Systems

作者： Dmitry Kovalev Alexander Gasnikov King Abdullah University of Science and Technology Thuwal Saudi Arabia Moscow Institute of Physics and Technology Dolgoprudny Russia and Institute for System Programming RAS Research Center for Trusted Artificial Intelligence Moscow Russia and National Research University Higher School of Economics Moscow Russia

ISBN: (纸本)9781713871088

In this paper, we revisit the smooth and strongly-convex-strongly-concave minimax optimization problem. Zhang et al. (2021) and Ibrahim et al. (2020) established the lower bound $\Omega\left(\sqrt{\kappa_x\kappa_y} \log \frac{1}{\epsilon}\right)$ on the number of gradient evaluations required to find an ε-accurate solution, where kx and ky are condition numbers for the strong convexity and strong concavity assumptions. However, the existing state-of-the-art methods do not match this lower bound: algorithms of Lin et al. (2020) and Wang and Li (2020) have gradient evaluation complexity $\mathcal{O}\left(\sqrt{\kappa_x\kappa_y} \log^3 \frac{1}{\epsilon}\right)$ and $\mathcal{O}\left( \sqrt{\kappa_x\kappa_y}\log^3 (\kappa_x\kappa_y)\log\frac{1}{\epsilon}\right)$, respectively. We fix this fundamental issue by providing the first algorithm with O (√kxky log 1/ε) gradient evaluation complexity. We design our algorithm in three steps: (i) we reformulate the original problem as a minimization problem via the pointwise conjugate function; (ii) we apply a specific variant of the proximal point algorithm to the reformulated problem; (iii) we compute the proximal operator inexactly using the optimal algorithm for operator norm reduction in monotone inclusions.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Accelerated primal-dual gradient method for smooth and convex-concave saddle-point problems with bilinear coupling 22

Accelerated primal-dual gradient method for smooth and conve...

引用

Proceedings of the 36th International Conference on Neural Information Processing Systems

作者： Dmitry Kovalev Alexander Gasnikov Peter Richtárik King Abdullah University of Science and Technology Thuwal Saudi Arabia Moscow Institute of Physics and Technology Dolgoprudny Russia and Institute for System Programming RAS Research Center for Trusted Artificial Intelligence Moscow Russia and National Research University Higher School of Economics Moscow Russia

ISBN: (纸本)9781713871088

In this paper we study the convex-concave saddle-point problem minx maxy f(x) + yTAx – g(y), where f(x) and g(y) are smooth and convex functions. We propose an Accelerated Primal-Dual Gradient Method (APDG) for solving this problem, achieving (i) an optimal linear convergence rate in the strongly-convex-strongly-concave regime, matching the lower complexity bound (Zhang et al., 2021), and (ii) an accelerated linear convergence rate in the case when only one of the functions f(x) and g(y) is strongly convex or even none of them are. Finally, we obtain a linearly convergent algorithm for the general smooth and convex-concave saddle point problem minx maxy F(x, y) without the requirement of strong convexity or strong concavity.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Calculation of Signal Information Delay in Intelligent Communication Networks 3

Calculation of Signal Information Delay in Intelligent Commu...

引用

3rd IEEE KhPI Week on Advanced technology, KhPI Week 2022

作者： Kuchuk, Nina Mozhaiev, Mykhailo Kalinin, Yevhen Davydov, Viacheslav Mozhaev, Oleksandr Kuchuk, Heorhii National Technical University 'Kharkiv Polytechnic Institute' Department of Computer Engineering and Programming Kharkiv Ukraine Computer Technology and Telecommunications Researches Sector National Scientific Center «hon. Prof Bokarius Forensic Science Institute» Kharkiv Ukraine National University of Life and Environmental Sciences of Ukraine Tractors Cars and Bioenergy Resources Department Kyiv Ukraine Kharkiv National University of Internal Affairs Department of Cyber Security and Data Technologies Kharkiv Ukraine

ISBN: (数字)9798350399202

ISBN: (纸本)9798350399202

An analysis of the signaling systems used in the Intelligent Communication Network has been carried out. The main probabilistic characteristics of signal information delay are determined. A method for calculating these characteristics for such error correction methods is proposed: basic error control method and preventive cyclical control method. The analysis of the delay of signal units from loading the signal network is carried out. Simple formulas are proposed for approximating the load applied to the signaling link. © 2022 IEEE.

关键词： Error correction

来源：评论

学校读者我要写书评

暂无评论

Redundant optical data transmission using semiconductor lasers

Redundant optical data transmission using semiconductor lase...

引用

ACS/IEEE International Conference on Computer Systems and Applications

作者： H. D. Wacker J. Borcsok H. Hillmer Development HIMA Paul Hildebrandt GmbH + Co KG Bruehl GERMANY Department of Electrical Engineering and Computer Science Chair for Computer Architecture and System Programming Kassel GERMANY University of Kassel Institute of Nanostructure Technologies and Analytics (INA) and Center for Interdisciplinary Nanostructure Science and Technology (CINSaT) Kassel GERMANY

This paper is dealing with redundant optoelectronic data transmission with special respect to laser channels. The concept of the generalized erasure channel (GEC) is used to determine the probability of undetected error for some binary symmetric and non-symmetric channels protected by appropriate codes. In detail, communication via different binary symmetric channels (BSCs), generalized erasure channels and symmetrized binary non symmetric channels (BNSCs) is investigated. Simple upper bounds are given, relating the new formulas to that one of the BSC Finally the results in connection with an inequality for proper codes are applied to multi wavelength optical transmission through channels generated by semiconductor lasers.

关键词： Data communication Semiconductor lasers Error probability Optical transmitters Protection Safety Wavelength division multiplexing Laser theory Upper bound Linear code

来源：评论

学校读者我要写书评

暂无评论

Implementation lessons of performance prediction tool for parallel conservative simulation 6

引用

6th International European Conference on Parallel Computing, Euro-Par 2000

作者： Lim, Chu-Cheow Low, Yoke-Hean Gan, Boon-Ping Cai, Wentong Intel Corporation SC12-305 2000 Mission College Blvd Santa ClaraCA95052-8119 United States Programming Research Group Oxford University Computing Laboratory University of Oxford OxfordOX1 3QD United Kingdom Gintic Institute of Manufacturing Technology 71 Nanyang Drive Singapore638075 Singapore Center for Advanced Information Systems School of Applied Science Nanyang Technological University Singapore639798 Singapore

ISBN: (纸本)9783540679561

Performance prediction is useful in helping parallel programmers answer questions such as speedup scalability. Performance prediction for parallel simulation requires first working out the performance analyzer algorithms for specific simulation protocols. In order for the prediction results to be close to the results from actual parallel executions, there are further considerations when implementing the analyzer. These include (a) equivalence of code between the sequential program and parallel program, and (b) system effects (e.g. cache miss rates and synchronization overheads in an actual parallel execution). This paper describes our investigations into these issues on a performance analyzer for a conservative, "super-step" (synchronous) simulation protocol. © Springer-Verlag Berlin Heidelberg 2000.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：