با سلام خدمت کاربران در صورتی که با خطای سیستم پرداخت بانکی مواجه شدید از طریق کارت به کارت (6037997535328901 بانک ملی ناصر خنجری ) مقاله خود را دریافت کنید (تا مشکل رفع گردد).
ردیف | عنوان | نوع |
---|---|---|
31 |
Anonymous authentication scheme for smart home environment with provable security
طرح احراز هویت ناشناس برای محیط خانه هوشمند با امنیت قابل اثبات-2019 Smart home is an emerging paradigm of the Internet of Things (IoT), which facilitates an individual
to operate the smart home appliances remotely through the internet. Since the user
and the smart devices communicate over insecure communication channels, the transmit-
ted sensitive data collected by the smart devices may be intercepted and altered easily by a
malicious adversary. Therefore, there is a great need to design an effective and anonymous
authentication scheme to guarantee secure communications in smart home environment.
In the past decade, extensive research has been carried out on this security issue, but most
of them are not secure. As a step towards this direction, in this paper, we propose an efficient
and anonymous authentication scheme for smart home environment using Elliptic
Curve Cryptography (ECC). The proposed scheme avoids keeping the verification table for
authentication purposes. In addition, random number method is adopted to resist replay
attack, and it can avoid the clock synchronization problem. The rigorous formal proof and
heuristic analysis show that the proposed scheme provides the desired security features
and resists against all the possible attacks. Compared with the most representative related
schemes, the proposed scheme achieves a delicate balance between security and efficiency,
and it is more suitable for realistic environments. Keywords: Smart home | Elliptic curve cryptography | Authentication | Lightweight | Provable security |
مقاله انگلیسی |
32 |
Feasibility analysis of Inter-Pulse Intervals based solutions for cryptographic token generation by two electrocardiogram sensors
تجزیه و تحلیل امکان سنجی راه حل های مبتنی بر فاصله بین پالس برای تولید توکن رمزنگاری توسط دو سنسور الکتروکاردیوگرام-2019 In this paper we address the problem of how two devices that are sensing the same heart signal
can generate the same cryptographic token by extracting them from the Inter-Pulse Intervals (IPIs)
of each cardiac signal. Our analysis is based on the use of a run-time monitor, which is extracted
from a formal model and verified against predefined properties, combined with a fuzzy extractor to
improve the final result. We first show that it is impossible, in general, to correct the differences
between the IPIs derived from two captured electrocardiogram (ECG) signals when using only error
correction techniques, thus being impossible to corroborate previous claims on the feasibility of this
approach. Then, we provide a large-scale evaluation of the proposed method (run-time monitor and
fuzzy extractor) over 19 public databases from the Physionet repository containing heart signals. The
results clearly show the practicality of our proposal achieving a 91% of synchronization probability
for healthy individuals. Additionally, we also conduct an experiment to check how long the sensors
should record the heart signal in order to generate tokens of 32, 64 and 128 bits. Contrarily to what
it is usually assumed (6, 12, and 24 s for individuals with a heart rate of 80 beats-per-minute), the
sensors have to wait 13, 28 and 56.5 s on median, respectively, to derive the same token from both
sensors Keywords: Biometrics | Security | Privacy | Body sensor networks |
مقاله انگلیسی |
33 |
Mortality prediction based on imbalanced high-dimensional ICU big data
پیش بینی مرگ و میر بر اساسداده های بزرگ ICU عدم تعادل بعد بالا -2018 With the development of biomedical equipment and healthcare level, large amounts of data have been
brought out in hospital, especially in Intensive Care Unit (ICU). However, how to better exploit
meaningful information from these rich data still remains a challenge. This paper focuses on ICU
mortality prediction, which is a typical example of second use of ICU big data. Patient ICU mortality
prediction faces challenges in many aspects, such as high dimensionality, imbalance distribution and
time asynchronization etc. To solve these challenges, a series of analytical methods and tools, including
variables selection, preprocessing, feature extraction & feature selection and predictive modeling, have
been utilized and developed. High-dimensional and unbalanced natures of the ICU data badly affect the
performance of classifiers. We modified the cost-sensitive principal component analysis (CSPCA), which
is denoted by MCSPCA, to handle these problems in feature extraction stage. As for parameter
optimization, a variant of standard particle swarm optimization called chaos particle swarm optimization
(CPSO) was adopted for its capacity of finding optimal solution. In order to obtain the best prediction
model, different algorithms were investigated and their AUC performances were evaluated in a large real
world benchmark data. The final results show that our proposed method improved the performance of
the traditional machine learning methods, in which the support vector machine (SVM) reach best AUC
performance of 0.7718. This study gives a paradigm to handle similar problems in big health data and
helps promote healthcare services.
Keywords: Health data processing ، Analytical tools ، Modified cost-sensitive principal ، component analysis ، Support vector machine ، Chaos particle swarm optimization |
مقاله انگلیسی |
34 |
Parallel multiphase field simulations with OpenPhase
شبیه سازی زمینه چند فازی موازی با OpenPhase-2017 The open-source software project OpenPhase allows the three-dimensional simulation of microstructural
evolution using the multiphase field method. The core modules of OpenPhase and their implementation
as well as their parallelization for a distributed-memory setting are presented. Especially communication
and load-balancing strategies are discussed. Synchronization points are avoided by an increased halo-size,
i.e. additional layers of ghost cells, which allow multiple stencil operations without data exchange. Load
balancing is considered via graph-partitioning and sub-domain decomposition. Results are presented
for performance benchmarks as well as for a variety of applications, e.g. grain growth in polycrystalline
materials, including a large number of phase fields as well as Mg–Al alloy solidification.
Keywords: Material science | Phase field | Parallel computing | Load-balancing |
مقاله انگلیسی |
35 |
Care HPS: A high performance simulation tool for parallel and distributed agent-based modeling
مراقبت HPS: یک ابزار شبیه سازی با کارایی بالا برای مدل سازی مبتنی بر عامل موازی و توزیع شده-2017 Parallel and distributed simulation is a powerful tool for developing complex agent-based simulation.
Complex simulations require parallel and distributed high performance computing solutions. It is
necessary because their sequential solutions are not able to give answers in a feasible total execution
time. Therefore, for the advance of computing science, it is important that High Performance Computing
(HPC) techniques and solutions be proposed and studied. In literature, we can find some agent-based
modeling and simulation tools that use HPC. However, none of these tools are designed to enable the
HPC expert to be able to propose new techniques and solutions without great effort. In this paper,
we introduce Care High Performance Simulation (HPS), which is a scientific instrument that enables
researchers to: (1) develop techniques and solutions of high performance distributed simulations for
agent-based models; and, (2) study, design and implement complex agent-based models that require
HPC solutions. Care HPS was designed to easily and quickly develop new agent-based models. It was also
designed to extend and implement new solutions for the main issues of parallel and distributed solutions
such as: synchronization, communication, load and computing balancing, and partitioning algorithms.
We conducted some experiments with the aim of showing the completeness and functionality of Care
HPS. As a result, we show that Care HPS can be used as a scientific instrument for the advance of the
agent-based parallel and distributed simulations field.
Keywords: Agent-based model | Agent-based modeling and simulation | High performance simulation | High performance computing | Parallel and distributed simulation |
مقاله انگلیسی |
36 |
Erlang-based desynchronized urban traffic simulation for high-performance computing systems
شبیه سازی ترافیک شهری بدون هماهنگ بر پایه Erlang برای سیستم های محاسباتی با کارایی بالا-2017 The problem of simulating micro-scale urban traffic in large environments provides a great opportunity
for the utilization of HPC systems. Parallel implementation of this kind of computation (where complex,
data-intensive processing must be synchronized) is not straightforward. The simulation presented in this
paper is based on the concept of controlled desynchronization of the computations, which does not violate
the model. The implementation in the Erlang language uses Erlang distribution mechanisms for building
and managing the computing cluster. The presented method makes it possible to simulate 11.5M cars
traversing a road system composed of 240K crossroads and 144M possible locations. It provides a linear
scalability of up to 19,200 computing cores (where simulation speeds reach 160 steps per second).
Keywords: Urban traffic simulation | Parallel simulation | HPC | High-performance computing | Erlang |
مقاله انگلیسی |
37 |
طراحی و پیاده سازی کنترل کننده PID مبتنی بر EP برای هماهنگ سازی هرج و مرج سیستم مدار ریکیتاک
سال انتشار: 2017 - تعداد صفحات فایل pdf انگلیسی: 10 - تعداد صفحات فایل doc فارسی: 18 این مقاله به یک الگوریتم تکاملی برنامه نویسی (EP) تکنیک محور و روش های کنترل PID( تناسب-انتگرال-مشتق) ایجاد شده برای تضمین هماهنگ سازی و حل سیستم های هرج و مرج ریکیتاک برتر را پوشش می دهد. برای کنترل هماهنگ سازی PID ، الگوریتم برنامه نویسی تکاملی برای پیدا کردن پارامتر های PID بهینه از جمله k_p ، k_i و k_d بوسیله روش خطای کامل یکپارچه ( IAE) در شرایط همگرایی مورد استفاده قرار می گیرد. به منظور تصدیق عملکرد سیستم ، قطعات الکترونیکی پایه شامل تقویت کننده های عملیاتی (OPAs) ، مقاومت ها و خازن ها برای اجرای سیستم های ریکیتاک هرج و مرج پ استفاده می شود. در نهایت ، نتایج تجربی ، رویکرد هماهنک سازی هرج و مرج را در ریکیتاک پیشنهاد شده تایید می کند.
کلمات کلیدی: هماهنگ سازی | سیستم های هرج و مرج ریکیتاک | الگوریتم برنامه نویسی تکاملی | ( تناسب-انتگرال-مشتق) PID | کنترل |
مقاله ترجمه شده |
38 |
Parallel algorithms for switching edges in heterogeneous graphs
الگوریتم های موازی برای سوئیچ لبه ها در نمودار های ناهمگن-2017 An edge switch is an operation on a graph (or network) where two edges are selected randomly and one
of their end vertices is swapped with each other. Edge switch operations have important applications in
graph theory and network analysis, such as in generating random networks with a given degree sequence,
modeling and analyzing dynamic networks, and in studying various dynamic phenomena over a network.
The recent growth of real-world networks motivates the need for efficient parallel algorithms. The depen
dencies among successive edge switch operations and the requirement to keep the graph simple (i.e., no
self-loops or parallel edges) as the edges are switched lead to significant challenges in designing a parallel
algorithm. Addressing these challenges requires complex synchronization and communication among the
processors leading to difficulties in achieving a good speedup by parallelization. In this paper, we present
distributed memory parallel algorithms for switching edges in massive networks. These algorithms pro
vide good speedup and scale well to a large number of processors. A harmonic mean speedup of 73.25
is achieved on eight different networks with 1024 processors. One of the steps in our edge switch algo
rithms requires the computation of multinomial random variables in parallel. This paper presents the first
non-trivial parallel algorithm for the problem, achieving a speedup of 925 using 1024 processors.
Keywords: Edge switch | Random network generation | Network dynamics | Multinomial distribution | Parallel algorithms |
مقاله انگلیسی |
39 |
A parallel Quantized State System Solver for ODEs
حل کننده سیستم حالت تدریجی موازی برای ODEs-2017 This work introduces novel parallelization techniques for Quantized State System (QSS) simulation of
continuous time and hybrid systems and their implementation on a multi-core architecture. Exploiting
the asynchronous nature of QSS algorithms, the novel methodologies are based on the use of non-strict
synchronization between logical processes. The fact that the synchronization is not strict allows to achieve
large speedups at the cost of introducing additional numerical errors that, under certain assumptions, are
bounded depending on some given parameters.
Besides introducing the parallelization techniques, the article describes their implementation on a
software tool and it presents a theoretical analysis of the aforementioned additional numerical error.
Finally, the performance of the novel methodology and its implementation is deeply evaluated on four
large scale models.
Keywords: Parallel ODE simulation | QSS | Hybrid systems | Discrete event systems |
مقاله انگلیسی |
40 |
SKIRT: Hybrid parallelization of radiative transfer simulations
SKIRT: موازی سازی ترکیبی شبیه سازی انتقال تابشی-2017 We describe the design, implementation and performance of the new hybrid parallelization scheme
in our Monte Carlo radiative transfer code SKIRT, which has been used extensively for modelling the
continuum radiation of dusty astrophysical systems including late-type galaxies and dusty tori. The hybrid
scheme combines distributed memory parallelization, using the standard Message Passing Interface (MPI)
to communicate between processes, and shared memory parallelization, providing multiple execution
threads within each process to avoid duplication of data structures. The synchronization between
multiple threads is accomplished through atomic operations without high-level locking (also called lock
free programming). This improves the scaling behaviour of the code and substantially simplifies the
implementation of the hybrid scheme. The result is an extremely flexible solution that adjusts to the
number of available nodes, processors and memory, and consequently performs well on a wide variety of
computing architectures.
Keywords: Radiative transfer — methods | Numerical — software and its engineering | Multithreading — software and its | engineering | Multiprocessing / multiprogramming / multitasking — software and its engineering |Concurrency control — software and its engineering | Process synchronization |
مقاله انگلیسی |