پرشین وب | دانلود, بازی, نرم افزار, کامپیوتر, جوک, اس ام اس, مذهبی اخبار, خبر, آنتی ویروس, بازی اندروید, نرم افزار اندروید, فیلم, سریال

نرم افزار های مورد نیاز

تبلیغات متنی


 

مشخصات مقاله
انتشار مقاله سال 2018
تعداد صفحات مقاله انگلیسی 4 صفحه
هزینه دانلود مقاله انگلیسی رایگان میباشد.
منتشر شده در نشریه اسپرینگر
نوع مقاله ISI
عنوان انگلیسی مقاله Special Issue: Real-Time Data Hiding and Visual Cryptography
ترجمه عنوان مقاله پنهان سازی داده های زمان واقعی و رمزنگاری ویژوال
فرمت مقاله انگلیسی  PDF
رشته های مرتبط مهندسی کامپیوتر
گرایش های مرتبط امنیت اطلاعات
مجله مجله پردازش تصویر زمان واقعی – Journal of Real-Time Image Processing
دانشگاه Department of Computer Science and Engineering – Sejong University – Korea
شناسه دیجیتال – doi
https://doi.org/10.1007/s11554-018-0749-0
کد محصول E8887
وضعیت ترجمه مقاله  ترجمه آماده این مقاله موجود نمیباشد. میتوانید از طریق دکمه پایین سفارش دهید.
دانلود رایگان مقاله دانلود رایگان مقاله انگلیسی
سفارش ترجمه این مقاله سفارش ترجمه این مقاله

 

بخشی از متن مقاله:
1 Introduction

Data hiding (DH) may embed secret data, copyright information, and annotation into various media such as image, audio, video, or text. The embedded data should be invisible to a watchdog, and meanwhile the secret data have to stay hidden in a cover signal without detection from steganalysis tools. For this reason, we should retain the good visual quality of an image with the high embedding data. However, trade-offs exist between the embedding capacity and the degree of quality to cover media modification. That is, as one increases, the other must decrease. Thus, according to our need, we choose the best way to implement DH. Reversible DH (RDH) was derived from DH for sensitive applications such as military and hospital since 10 year ago. Recent research on RDH has been focused on encrypted domains. Another topic of this special issue is visual cryptography scheme (VCS). In the last two decades, investigations on VCS were widely conducted. A basic model of VC was firstly proposed by Naor and Shamir. They demonstrated VCS, where an image was divided into a number of shared images so that only participants in the qualified set could decrypt the secret image, while participants in the nonqualified set have no information about the secret. In VCS, the appealing property is that the decoding process can be performed directly by the human eyes without any complicated cryptographic computation. This ‘‘stackingto-see’’ property of VCS provides many intended applications, e.g., information hiding, access control, watermarking, authentication, identification, and transmitting passwords. This special issue (SI) of the Springer Journal of RealTime Image Processing (JRTIP) entitled Real-Time DH and VCS highlights the latest research results on various image, pattern recognition, and signal processing algorithms and technologies for real-time approaches in DH, RDH, and VCS based on various multimedia. This SI addresses both theoretical and practical problems along with the real-time theme of JRTIP. It includes fast schemes and hardware implementations, as well as software/hardware co-design based on DH/RDH and VCS. The call for papers resulted in 29 submissions. For each submission, at least two reviewers examined its quality, together with the guest editors and editor-in-chief. Finally, 19 papers were accepted for this special issue. The selected papers outlined below can be divided broadly into the following themes. The first theme involves VCS and image secret sharing schemes to support real-time algorithms. Six papers fall into this theme. The second theme involves DH, RDH, and steganography for high capacity and good image quality with fast encoding algorithm, and another nine papers fall into this theme. The third theme has two papers and consists of watermarking and reversible watermarking implemented with FPGA for supporting real-time processing techniques. The fourth theme has two papers including steganalysis and authentication.

نوشته مقاله انگلیسی رایگان در مورد پنهان سازی داده های زمان واقعی و رمزنگاری ویژوال – اسپرینگر 2018 اولین بار در سایت آی اس آی دانلود ISIDL. پدیدار شد.


 

مشخصات مقاله
انتشار مقاله سال 2018
تعداد صفحات مقاله انگلیسی 8 صفحه
هزینه دانلود مقاله انگلیسی رایگان میباشد.
منتشر شده در نشریه اسپرینگر
نوع مقاله ISI
عنوان انگلیسی مقاله Color image encryption using DNA based cryptography
ترجمه عنوان مقاله رمزگذاری تصویر رنگی با استفاده از رمزنگاری مبتنی بر DNA
فرمت مقاله انگلیسی  PDF
رشته های مرتبط مهندسی کامپیوتر
گرایش های مرتبط امنیت اطلاعات
مجله مجله بین المللی فناوری اطلاعات – International Journal of Information Technology
دانشگاه KIIT Deemed to be University – Bhubaneswar – India
کلمات کلیدی رمزنگاری، رمزگذاری، رمزنگاری DNA، تصویر، امنیت
کلمات کلیدی انگلیسی Cryptography, Decryption, DNA cryptography, Encryption, Image, Security
شناسه دیجیتال – doi
https://doi.org/10.1007/s41870-018-0100-9
کد محصول E8888
وضعیت ترجمه مقاله  ترجمه آماده این مقاله موجود نمیباشد. میتوانید از طریق دکمه پایین سفارش دهید.
دانلود رایگان مقاله دانلود رایگان مقاله انگلیسی
سفارش ترجمه این مقاله سفارش ترجمه این مقاله

 

بخشی از متن مقاله:
1 Introduction

Data are vulnerable and need utmost security when they are getting transferred from source to destination. Encryption is one of the most formidable ways to keep our data and information safe between two endpoints. It makes data impenetrable and unread-able, so even it ends up getting in wrong hands it is mostly useless [1]. DNA (deoxyribonucleic acid) is a genetic information carrier from parent organisms to the newly forming organism. The methodologies of encryption in which compo-nents of DNA are used to hide plain text from eavesdropper or unauthorized users in the network come under the study of DNA cryptography [2]. In DNA cryptography, the four chemical bases of DNA namely adenine (A), guanine (G), cytosine (C) and thymine (T) has so far majorly been used in addition to cryptographic algorithms but with advancement in the study of other components like Amino acids are also brought into the play [3]. Considering ‘ATGC’ to be a code we can have 24 combinations of it like ‘CTAG’, ‘TAGC’ etc. (4! = 24). Although among the 24 combinations only 8 are possible in a real life occasion as ‘A’ can combine only with ‘T’ and ‘C’ combines only with ‘G’ following the properties of DNA [3]. But, here we shall use all the 24 combinations to encrypt our data. This will increase the complexity of detecting patterns in the encrypted text. In the study of cryptography, an image which contains information is converted to an unreadable or unrecognizable form by using algorithms. This field is gaining much popularity as image can carry vital information with them. The capacity of carrying information is also more by an image. In image encryption methodologies, the pixels of original images are either manipulated of information is laid inside the image using the image as a cover to protect the data from undesired receivers [4]. Image encryption enables passing of data over unsecured networks like the internet. Without the correct key, the correct decryption to retrieve the original is a major challenge to high-end super computers [5]. Although image encryption might require more than normal text encryption but it is more formidable. Image encryption plays a vital role in securing the transmission of important government document images, images of military, healthcare and other private images [6]. Section 2 gives a background of work relating to image encryption and DNA cryptography together; Sect. 3 provides the description of proposed algorithm, utility of some of its steps and the entire algorithm; Sect. 4 documents the result analysis and Sect. 5 concludes the paper.

نوشته مقاله انگلیسی رایگان در مورد رمزگذاری تصویر رنگی با استفاده از رمزنگاری مبتنی بر DNA – اسپرینگر 2018 اولین بار در سایت آی اس آی دانلود ISIDL. پدیدار شد.


 

مشخصات مقاله
انتشار مقاله سال 2018
تعداد صفحات مقاله انگلیسی 20 صفحه
هزینه دانلود مقاله انگلیسی رایگان میباشد.
منتشر شده در نشریه اسپرینگر
نوع مقاله ISI
عنوان انگلیسی مقاله VMVC: Verifiable multi-tone visual cryptography
ترجمه عنوان مقاله VMVC: رمزنگاری بصری چند لحنی قابل بررسی
فرمت مقاله انگلیسی  PDF
رشته های مرتبط مهندسی کامپیوتر
گرایش های مرتبط امنیت اطلاعات
مجله ابزارهای چندرسانه ای و برنامه های کاربردی – Multimedia Tools and Applications
دانشگاه Thapar University – Patiala – India
کلمات کلیدی رمزنگاری بصری قابل بازبینی، رمزنگاری بصری چند لحنی، اشتراک راز، سهام معنی دار
کلمات کلیدی انگلیسی Verifiable visual cryptography, Multi-toned visual cryptography, Secret sharing, Meaningful shares
شناسه دیجیتال – doi
https://doi.org/10.1007/s11042-017-4422-6
کد محصول E8889
وضعیت ترجمه مقاله  ترجمه آماده این مقاله موجود نمیباشد. میتوانید از طریق دکمه پایین سفارش دهید.
دانلود رایگان مقاله دانلود رایگان مقاله انگلیسی
سفارش ترجمه این مقاله سفارش ترجمه این مقاله

 

بخشی از متن مقاله:
1 Introduction

Visual Cryptography (VC) is a category of secret sharing scheme, proposed by Naor et al. [17], that allows computation-less decoding of secret images. Mainly in a k-out-of-n visual secret sharing (VSS) scheme, a secret image is encoded into n noise-like shares and printed onto transparencies to distribute them among n participants. Secret image can be decoded by just stacking any k or more transparencies. In spite of using infinite computation power, k − 1 or fewer participants can not decode the secret image. Besides the secret sharing, visual cryptography can also be used for number of other purposes including access control, watermarking, copyright protection [5], identification [16] and visual authentication. To demonstrate the working of VSS, consider a 2-out-of-2 VSS (k = 2, n = 2) scheme shown in Fig. 1. Each pixel p of secret binary image is encoded into a pair of black and white subpixels for both shares. If p is white/black, one of the first/last two columns tabulated under the white/black pixel in Fig. 1 is selected randomly so that selection probability will be 50 %. Then, the first two subpixels in that column are alloted to share 1 and the following other two subpixels are alloted to share 2. Independent of whether p is black or white, pixel is encoded into two subpixels of black-white or white-black with equal probabilities. Thus an individual share has no idea about whether p is black or white. The last row of Fig. 1 shows the superimposition of the two shares, If the pixel p is black, the output of superimposition will be two black subpixels corresponding to a gray level 1. If p is white, then result of superimposition will be one white and one black subpixel, corresponding to a gray level 1/2. Hence by stacking two shares together, we can obtain the approximate visual information of the secret image. Figure 2 shows an example of the 2-out-of-2 VSS scheme. Figure 2a shows a secret binary image Isec to be encoded. According to the encoding scheme shown in Fig. 1, each pixel p of Isec is divided into two subpixels in each shares, as shown in Fig. 2b and c. Stacking the two shares leads to the output image shown in Fig. 2d. The decoded image is clearly revealed. There are some contrast loss and the width of the reconstructed image is just twice of the original secret image. The 2-out-of-2 VSS scheme shown above is a special case of the k-out-of-n VSS scheme. A more general model for VSS schemes based on general access structures has been designed by Ateniese et al. in [1]. An access structure is a specified set of all the qualified and forbidden subsets of the shares. The secret image can be decoded by the participants of a qualified subset only. The capabilities of VSS has also been enhanced by allowing gray scale images as secret rather than a binary image [15].

نوشته مقاله انگلیسی رایگان در مورد VMVC: رمزنگاری بصری چند لحنی قابل بررسی – اسپرینگر 2018 اولین بار در سایت آی اس آی دانلود ISIDL. پدیدار شد.


 

مشخصات مقاله
انتشار مقاله سال 2018
تعداد صفحات مقاله انگلیسی 17 صفحه
هزینه دانلود مقاله انگلیسی رایگان میباشد.
منتشر شده در نشریه الزویر
نوع مقاله ISI
عنوان انگلیسی مقاله A risk-based approach applied to system engineering projects: A new learning based multi-criteria decision support tool based on an Ant Colony Algorithm
ترجمه عنوان مقاله یک رویکرد مبتنی بر ریسک اعمال شده بر پروژه های مهندسی سیستم: یک ابزار پشتیبانی تصمیم گیری چند معیاره جدید مبتنی بر یادگیری بر اساس الگوریتم کلونی مورچه
فرمت مقاله انگلیسی  PDF
رشته های مرتبط مدیریت، مهندسی کامپیوتر
گرایش های مرتبط مدیریت پروژه، الگوریتم ها و محاسبات، هوش مصنوعی
مجله کاربرد مهندسی هوش مصنوعی – Engineering Applications of Artificial Intelligence
دانشگاه INP-ENIT/LGP – University of Toulouse – Avenue d’Azereix – France
کلمات کلیدی مدیریت پروژه، مهندسی سیستم، عدم قطعیت، ریسک، موناکو، پشتیبانی تصمیم، یادگیری
کلمات کلیدی انگلیسی Project management, System engineering, Uncertainty, Risk, MONACO, Decision support, Learning
شناسه دیجیتال – doi
https://doi.org/10.1016/j.engappai.2018.04.001
E8850
وضعیت ترجمه مقاله  ترجمه آماده این مقاله موجود نمیباشد. میتوانید از طریق دکمه پایین سفارش دهید.
دانلود رایگان مقاله دانلود رایگان مقاله انگلیسی
سفارش ترجمه این مقاله سفارش ترجمه این مقاله

 

بخشی از متن مقاله:
1. Introduction

Whenever complexity exists, risks exist too. The difficulty to make concerted decisions between all the actors of a Project Management (PM) process and a System Engineering (SE) one increases the complexity of a SE project. For this purpose, an integrated process that takes into account the interactions between the PM and the SE sub-processes is a good way to make collaborative decisions and meet the customer needs by satisfying the different requirements and project objectives especially in terms of cost, duration and risk. Some previous works done in our research team have defined coupling points between a system design process and a project planning process (Coudert et al., 2011; Vareilles et al., 2015). These works have shown that both processes need to be controlled and executed in parallel with strong synchronization mechanisms which allow meeting the requirements of the customers. A centralized information model (represented by an oriented graph) is useful to consider all the decisions of these project actors about all the possible tasks and their associated project objectives values. Making good decisions among all these possible choices needs to select the optimized ones. In our work, the objectives to optimize are the global cost of the project, its total duration and the global risk associated to these criteria. Risks are defined in this work as uncertainty about project objectives and are considered in the preliminary steps of a project graph construction. Uncertainty is modeled by using intervals to take into account the negative risks’ impacts on tasks costs and durations. The idea is to provide to the decision makers a panel of Pareto-optimal solutions in order to select one good scenario to plan and then realize. The proposed integrated process includes a multi-criteria decision support tool based on a multi-objective optimization method. It allows the generation of Pareto-optimal scenarios from the resulting integrated project graph that encompasses all the design and the project alternative choices of a new system to conceive and realize. For this matter, the standard Ant Colony Optimization (ACO) meta-heuristic (Dorigo and Stützle, 2010; Stützle et al., 2011) was adopted and adapted to develop a multi-objective new ant colony algorithm based on a learning mechanism denoted as MONACO algorithm. The standard ACO algorithm performance is improved by a learning mechanism. That consists in modifying the standard probability formula used by every ant to reach a next node in the graph. It is modified taking into account the path that every ant has taken before the decision. The proposed learning mechanism learns from the past choices made by an ant in order to influence its future ones by changing dynamically the weights given to the three objectives (cost, duration, risk) in the probability formula of the MONACO algorithm. At the end of the algorithm, a Pareto-front is built and all the optimal scenarios are given to help the decision makers to select one scenario that has reasonable global values of cost, duration and risk. A related works section is given in the next part (Section 2) to contextualize the problematic with regards to other works and to justify the use of an Ant Colony Algorithm.

نوشته مقاله انگلیسی رایگان در مورد رویکرد مبتنی بر ریسک اعمال شده بر پروژه های مهندسی سیستم – الزویر 2018 اولین بار در سایت آی اس آی دانلود ISIDL. پدیدار شد.


 

مشخصات مقاله
انتشار مقاله سال 2018
تعداد صفحات مقاله انگلیسی 9 صفحه
هزینه دانلود مقاله انگلیسی رایگان میباشد.
منتشر شده در نشریه اسپرینگر
نوع مقاله ISI
عنوان انگلیسی مقاله Optimization of cluster resource indexing of Internet of Things based on improved ant colony algorithm
ترجمه عنوان مقاله بهینه سازی شاخص گذاری منابع خوشه ای اینترنت اشیا بر اساس الگوریتم کلونی مورچه بهبود یافته
فرمت مقاله انگلیسی  PDF
رشته های مرتبط مهندسی کامپیوتر، فناوری اطلاعات
گرایش های مرتبط الگوریتم ها و محاسبات، اینترنت و شبکه های گسترده
مجله محاسبه خوشه ای – Cluster Computing
دانشگاه School of Economy and Trade – Hunan University – China
کلمات کلیدی الگوریتم کلونی مورچه، اینترنت اشیا، منابع خوشه ای، شاخص گذاری، خوشه بندی
کلمات کلیدی انگلیسی Ant colony algorithm, Internet of things, Cluster resource, Indexing, Clustering
شناسه دیجیتال – doi
https://doi.org/10.1007/s10586-017-1496-x
کد محصول E8851
وضعیت ترجمه مقاله  ترجمه آماده این مقاله موجود نمیباشد. میتوانید از طریق دکمه پایین سفارش دهید.
دانلود رایگان مقاله دانلود رایگان مقاله انگلیسی
سفارش ترجمه این مقاله سفارش ترجمه این مقاله

 

بخشی از متن مقاله:
1 Introduction

With the development of Internet of Things technology, Internet of Things received considerable attention in resource scheduling and transmission with good real-time and strong object-oriented ability [1–3]. There is massive cluster resources in Internet of Things platform, so it is required to optimize the scheduling and retrieval of massive cluster resources, and improve classification management and information processing capacity of resources [4–6]. The client of cluster resources in Internet of Things is done with multi-host and multi-database distribution to meet the demands of distributed storage and retrieval of cluster resources in Internet of Things. With the expansion of resource scale, the difficulty of indexing cluster resources in Internet of Things is larger. It is of great significance to study a more effective cluster resource indexing method for Internet of Things in improving resource scheduling and data transmission and reception of Internet of Things, so relative researches on resource indexing methods have received a great attention [7–9]. At present, the research on the development of cluster resource indexing of Internet of Things is based on database retrieval and optimal design of routing mechanism of Internet of Things. Data source, business logic, user interface and communication protocols are bundled together with the distribution model of link routing constructing Internet of Things in cellular, self-organizing and mixed way to achieve optimal retrieval of cluster resources [10–12]. Common cluster resource index methods include feature labeling method of spatial information points, fuzzy retrieval method, data clustering method and particle swarm optimiza tion index method [13–15]. Some research achievement has been achieved in self-adaptive scheduling and classification indexing for cluster resource with web crawler and data clustering. In this paper, a method of indexing cluster resources of Internet of Things based on multi-layer fuzzy subtraction clustering algorithm is proposed in literature [16]. Combined with the improved particle swarm optimization, this proposed method can prevent the interference of neighboring data points and improves the security of Internet of Things information management platform in cluster resource indexing of Internet of Things, but the method is not high in the precision of large-scale resource indexing; In literature [17], a method of indexing cluster resources of Internet of Things based on association semantic fusion clustering is proposed, and association semantic fusion clustering is done with segmented fusion fuzzy clustering method to construct index target values and calculate the global optimal solution. And then the cluster resources of Internet of Things are optimized and indexed. The method has strong anti-interference ability in resource indexing, and its convergence is well during indexing, but this method will bring a great computational cost and its real-time performance of cluster resource indexing is poor.

نوشته مقاله انگلیسی رایگان در مورد بهینه سازی شاخص گذاری منابع خوشه ای اینترنت اشیا – اسپرینگر 2018 اولین بار در سایت آی اس آی دانلود ISIDL. پدیدار شد.


 

مشخصات مقاله
انتشار مقاله سال 2018
تعداد صفحات مقاله انگلیسی 7 صفحه
هزینه دانلود مقاله انگلیسی رایگان میباشد.
منتشر شده در نشریه اسپرینگر
نوع مقاله ISI
عنوان انگلیسی مقاله Short-term wind speed forecasting based on improved ant colony algorithm for LSSVM
ترجمه عنوان مقاله پیش بینی سرعت باد کوتاه مدت با استفاده از الگوریتم کلونی مورچه بهبود یافته برای LSSVM
فرمت مقاله انگلیسی  PDF
رشته های مرتبط مهندسی کامپیوتر، فناوری اطلاعات
گرایش های مرتبط الگوریتم ها و محاسبات، هوش مصنوعی، شبکه های کامپیوتری
مجله محاسبه خوشه ای – Cluster Computing
دانشگاه  College of Control Science and Engineering of Hebei University of Technology – China
کلمات کلیدی پیش بینی سرعت باد کوتاه مدت، ماشین برداری پیشتبان مربعات جزیی، شبکه عصبی BP، الگوریتم کلونی مورچه
کلمات کلیدی انگلیسی Short-time wind speed forecast, Least squares support vector machine, BP neural network, Ant colony algorithm
شناسه دیجیتال – doi
https://doi.org/10.1007/s10586-017-1422-2
کد محصول E8852
وضعیت ترجمه مقاله  ترجمه آماده این مقاله موجود نمیباشد. میتوانید از طریق دکمه پایین سفارش دهید.
دانلود رایگان مقاله دانلود رایگان مقاله انگلیسی
سفارش ترجمه این مقاله سفارش ترجمه این مقاله

 

بخشی از متن مقاله:
1 Introduction

Since the energy and environmental problems have become increasingly prominent, wind energy as an important renewable energy resource has been paid more and more attention in recent years by virtue of its widely distributed, pollutionfree and renewable [1]. However, due to the characteristics of randomness and volatility of wind power generation, largescale wind power access to power grid will cause great impact on the power system is not conducive to the maintenance and smooth operation of the power system. Wind speed perturbation easily causes great changes of voltage and frequency of the power grid system, seriously the power system will be instable [2]. The study about short-term forecast on wind speed and power of wind farms is beneficial to stable power system operation, which prompting the relevant dispatching department to adjust the plan according to the forecast result, so as to reduce the influence of intermittent wind power [3]. At present, many experts at home and abroad have done a lot of research on short-term wind speed forecasting of wind farms. Wind speed forecast can be classified into three categories according to technology: digital weather forecast, statistical method and neural network forecasting method [4]. In recent years, artificial neural network (ANN) has made some achievements in wind speed forecast. However, ANN has some weakness. In fact, it is difficult to determine the network structure, besides over-learning and easily fall into the local minimum [5,6]. The support vector machine (SVM) method based on statistical theory can solve the problem of small sample and non-linearity well. It is proved to be better than artificial neural network and other methods in wind speed forecast. Hu Qian et al. proposed an integrated learning model based on Adaboost to forecast the short-term wind speed and obtain desirable results for solving the problem that the traditional single SVM model is not accurate [7,8]. The least squares support vector machine (LSSVM) replaces the inequality constraints with equality constraints on the basis of SVM, which avoids the time-consuming quadratic programming problem, so it is a powerful tool for nonlinear system modeling and prediction [9]. In the LSSVM model, the parameter penalty factor and kernel function have great influence on the forecast effect of the model. Therefore, it is the key to forecast the wind speed by determining the reasonable LSSVM penalty factor and kernel function [10]. Fang Biwu and others the parameters of LSSVM to achieve short-term wind speed forecast by improving firefly algorithm [11–13]. Zhang et al. adopted genetic algorithm to optimize the LSSVM parameters. But the genetic algorithm is not suitable for the whole modeling because of the complex operation. Some scholars optimized LSSVM by using genetic algorithms and other bionic algorithm. Chappelle proposed gradient descent method to optimize LSSVM parameters. Despite the fact that the efficiency of genetic algorithm has been significantly improved, this approach is easy to fall into the demerit of local optimum.

نوشته مقاله انگلیسی رایگان در مورد پیش بینی سرعت باد با الگوریتم کلونی مورچه – اسپرینگر 2018 اولین بار در سایت آی اس آی دانلود ISIDL. پدیدار شد.


 

مشخصات مقاله
انتشار مقاله سال 2018
تعداد صفحات مقاله انگلیسی 17 صفحه
هزینه دانلود مقاله انگلیسی رایگان میباشد.
منتشر شده در نشریه اسپرینگر
نوع مقاله ISI
عنوان انگلیسی مقاله Logistics Terminal Distribution Mode and Path Optimization Based on Ant Colony Algorithm
ترجمه عنوان مقاله حالت توزیع ترمینال لجستیک و بهینه سازی مسیر بر اساس الگوریتم کلونی مورچه
فرمت مقاله انگلیسی  PDF
رشته های مرتبط مهندسی کامپیوتر
گرایش های مرتبط الگوریتم ها و محاسبات
مجله ارتباطات شخصی بی سیم – Wireless Personal Communications
دانشگاه Business School – China University of Political Science and Law – China
کلمات کلیدی توزیع ترمینال لجستیک، الگوریتم کلونی مورچه، بهینه سازی مسیر
کلمات کلیدی انگلیسی Logistics terminal distribution, Ant colony algorithm, Path optimization
شناسه دیجیتال – doi
https://doi.org/10.1007/s11277-018-5319-z
کد محصول E8853
وضعیت ترجمه مقاله  ترجمه آماده این مقاله موجود نمیباشد. میتوانید از طریق دکمه پایین سفارش دهید.
دانلود رایگان مقاله دانلود رایگان مقاله انگلیسی
سفارش ترجمه این مقاله سفارش ترجمه این مقاله

 

بخشی از متن مقاله:
1 Introduction

With the development and progress of society, the society has entered the era of Internet, Tmall, Jingdong and other large B2C e-commerce platforms are gradually complete, Tmall November 11th and December 12th shopping festivals are rather hot. In the daily consumption process, people can feel convenience and benefits brought by online shopping whenever and wherever, and they trust more on the online shopping. Therefore, Chinese online shopping transaction has expanded rapidly. China network shopping market data released by iResearch showed that, in 2016, Chinese online shopping market transactions was 2.8 trillion yuan, an increase of 48.7%, equivalent to 10.7% of total retail sales of consumer goods, and annual line penetration exceeding 10% for the first time. In the first quarter of 2017, the scale of online shopping market in China was 757.410 billion yuan, an increase of 45.2% over the same period. In the second quarter, the scale of China’s online shopping market was 872.410 billion yuan, an increase of 39.6% over the same period. The proportion of it in the total retail sales of social consumer goods is 12.3%, and the permeability is further improved. In the context of the supply side reform, as the ‘‘last kilometer’’ of e-commerce, the logistics link needs to further improve the quality and level of service. The terminal distribution, as the ‘‘last mile’’ of logistics, only contacts by the end user, which is a key part of the logistics. How to send the purchased goods to consumers safely, quickly, and conveniently directly affects the satisfaction of consumers for the entire logistics and even the whole online shopping. As a result, it is necessary to do a good job in the whole logistics scheduling and improve the efficiency of logistics. At the same time, the logistics terminal link also needs to take the corresponding methods and measures to adapt to consumer requirements on the delivery mode and efficiency, so as to further enhance the consumer satisfaction for online shopping activities [1]. In the paper, we mainly study the logistics terminal distribution mode and path optimization, and combined with the application of ant colony algorithm in the TSP, analyse the basic principle and implementation process of ant colony algorithm. In addition, through reference to map and field research, we consider the route length and road conditions (slope and congestion) of the the regional distribution point, and collect and draw the geographic information surrounding area A. Moreover, some key parameters in ant colony algorithm in value are chosen, and with the collected information as a concrete example, MATLAB simulation is carried out for the logistics terminal distribution path optimization based on ant colony algorithm, and its scientific nature and feasibility are verified.

نوشته مقاله انگلیسی رایگان در مورد حالت توزیع ترمینال لجستیک بر اساس الگوریتم کلونی مورچه – اسپرینگر 2018 اولین بار در سایت آی اس آی دانلود ISIDL. پدیدار شد.


 

مشخصات مقاله
انتشار مقاله سال 2018
تعداد صفحات مقاله انگلیسی 8 صفحه
هزینه دانلود مقاله انگلیسی رایگان میباشد.
منتشر شده در نشریه اسپرینگر
نوع مقاله ISI
عنوان انگلیسی مقاله Wireless sensor network routing method based on improved ant colony algorithm
ترجمه عنوان مقاله روش مسیریابی شبکه حسگر بی سیم بر اساس الگوریتم کلونی مورچه بهبود یافته
فرمت مقاله انگلیسی  PDF
رشته های مرتبط مهندسی کامپیوتر، فناوری اطلاعات
گرایش های مرتبط الگوریتم ها و محاسبات، شبکه های کامپیوتری
مجله مجله هوش محیطی و محاسبات انسانی – Journal of Ambient Intelligence and Humanized Computing
دانشگاه School of Management – Shanghai University – China
کلمات کلیدی شبکه های حسگر بی سیم، الگوریتم کلونی مورچه، تعادل انرژی، کیفیت خدمات
کلمات کلیدی انگلیسی Wireless sensor networks, Ant colony algorithm, Energy balance, Quality of service
شناسه دیجیتال – doi
https://doi.org/10.1007/s12652-018-0751-1
کد محصول E8854
وضعیت ترجمه مقاله  ترجمه آماده این مقاله موجود نمیباشد. میتوانید از طریق دکمه پایین سفارش دهید.
دانلود رایگان مقاله دانلود رایگان مقاله انگلیسی
سفارش ترجمه این مقاله سفارش ترجمه این مقاله

 

بخشی از متن مقاله:
1 Introduction

Smart manufacturing describes the new manufacturing intelligence applied to modern information technologies such as the Internet of Things, cloud computing, and artificial intelligence in the manufacturing process (Tao et al. 2018a, b). Data from various sources is becoming integrated into manufacturing intelligence to improve manufacturing in various ways. A typical example is the wide deployment of sensors in manufacturing to monitor and provide real-time manufacturing data such as temperature, humidity, speed, vibration, and acidity for better decision-making and control of the manufacturing process (Li et al. 2015). Therefore, multiple sensors of different modalities are needed in distributed locations. Wired sensor networks are extensively adopted, but the cost for their installation, testing, maintenance, and shutdown are quite high. In many cases, a wireless sensor network (WSN) is a more attractive alternative because it does not require any fixed infrastructure and can be applied over distributed areas where cabling is costly (Akyildiz et al. 2002). A WSN is composed of sensor nodes and sink nodes. Sensor nodes are responsible for collecting and forwarding data. Sink nodes either analyze data locally or forward data to a base station (Magaia et al. 2015). Each sensor node consists of small devices for sensing, processing, transceiving, and power, and it is able to communicate with other sensor nodes or directly with a base station. A WSN can be regarded as a self-supporting unit, with which unattended operation can be realized (Stankovic 2008). It is mostly applicable where power supplies and cabling are difficult, or in hostile environments that people cannot enter. With the technological developments in cloud computing and Internet of Things, WSNs are becoming even more widely deployed. They have also been used for machine health monitoring (Tiwari et al. 2007), data center monitoring (Wang et al. 2013), and data logging (Saleem et al. 2014) in various industries. Moreover, a WSN can be used for environmental monitoring (Hart and Martinez 2006), remote health care monitoring (Malasinghe et al. 2017), and other monitoring scenarios. Overall, its application in cloud computing and Internet of things and has significant social and economic benefit (Tao et al. 2014, 2011). WSNs have a key difference with the wired sensor network in that the sensor nodes in a WSN rely solely on their own battery, and thus have limited power resources. Moreover, their computing power and storage resources are also limited. As a consequence, reducing the energy consumption of each sensor node is a critical issue for WSNs (Carrabs et al. 2015). Ant colony optimization (ACO) has been used in WSNs to identify shortest paths, and thus reduce the energy consumed by a network. However, the ACO is prone to falling into local optima and converges slowly. We hence propose an improved ACO (IACO) that can be used to construct the sensor node transfer function and pheromone update rule, and adaptively construct a data route using the characteristics of a dynamic network. The major contributions of this paper are listed below. 1. The IACO consumes less energy. 2. The transmission delay is reduced using the IACO. 3. Fewer transmission packets are lost when using the IACO. This paper is organized as follows. Section 2 analyzes the current WSN routing algorithms and their weakness. In Sect. 3, we describe our model and its notation. In Sect. 4, a detailed description of the proposed routing IACO algorithm is given. In Sect. 5, simulation results comparing the proposed algorithm with several other algorithms are presented to show the effectiveness of the proposed method.

نوشته مقاله انگلیسی رایگان در مورد روش مسیریابی شبکه حسگر بی سیم با الگوریتم کلونی مورچه – اسپرینگر 2018 اولین بار در سایت آی اس آی دانلود ISIDL. پدیدار شد.


 

مشخصات مقاله
انتشار مقاله سال 2018
تعداد صفحات مقاله انگلیسی 20 صفحه
هزینه دانلود مقاله انگلیسی رایگان میباشد.
منتشر شده در نشریه اسپرینگر
نوع مقاله ISI
عنوان انگلیسی مقاله A new hybrid ant colony algorithm for scheduling of no-wait flowshop
ترجمه عنوان مقاله یک الگوریتم کلونی مورچه هیبریدی جدید برای برنامه ریزی فلوشاپ بدون انتظار
فرمت مقاله انگلیسی  PDF
رشته های مرتبط مهندسی کامپیوتر
گرایش های مرتبط الگوریتم ها و محاسبات
مجله پژوهش عملیاتی – Operational Research
دانشگاه Institute for Integrated and Intelligent Systems – Griffith University – Australia
کلمات کلیدی برنامه ریزی فلوشاپ بدون انتظار، جستجوی محلی، حداکثر زمان انجام، جستجوی همسایگی متغیرها، annealing شبیه سازی شده
کلمات کلیدی انگلیسی No-wait flow shop scheduling, Local search, Maximum completion time, Variable neighborhood search, Simulated annealing
شناسه دیجیتال – doi
https://doi.org/10.1007/s12351-016-0253-x
کد محصول E8855
وضعیت ترجمه مقاله  ترجمه آماده این مقاله موجود نمیباشد. میتوانید از طریق دکمه پایین سفارش دهید.
دانلود رایگان مقاله دانلود رایگان مقاله انگلیسی
سفارش ترجمه این مقاله سفارش ترجمه این مقاله

 

بخشی از متن مقاله:
1 Introduction

The general assumption of majority of flow-shop applications is that the sequencing of the jobs relies on buffers, otherwise they are considered as intermediate storage between machines. The no-wait flow-shop scheduling problem (NWFSP) with makespan criterion is considered in this paper. In NWFSP, each job has to be processed from the first machine to the last without any interruption and the job sequence is unique on all machines. In addition, each machine can handle no more than one job at a time and each job has to visit each machine exactly once. Therefore, the start of a job on the first machine may be delayed in order to meet the no-wait requirement. Given that the release time of all jobs is zero and set-up time on each machine is included in the processing time, the no-wait flow-shop problem is to schedule jobs that minimize the makespan over all jobs. The no-wait flow shop scheduling problem has important applications in modern industry. It has an extensive background in industrial applications, including steel production, mining, logistics, chemical industry and food processing. For example, in steel factories, to avoid cooling and defects in steel, the liquid steel undergoes a chain of operations such as molding into ingots, unmolding, and soaking. Similarly, in the food processing, the canning operation must be operated after cooking operations immediately to ensure freshness (Hall and Sriskandarajah 1996). A comprehensive survey on the research and application of no-wait flow-shop scheduling problem can be found in Hall and Sriskandarayah’s review paper (Hall and Sriskandarajah 1996). In addition, Bagchi et al. (2006) showed that it can be transformed into the asymmetric traveling salesman problem (ATSP) and presented some no-wait and blocking scheduling models. In the operation research literature, many elegant mathematical models and methods have been developed to deal with the real-world problems. Some exact approaches have been proposed to unravel the problems optimally that have the limitation of solving only small-sized problems. On the other hand, heuristics which are based on polynomial time algorithms are the most suitable methods for solving large scheduling problems. In general, heuristics attain good solutions in a reasonable time interval. Additionally, in the recent years meta-heuristics with techniques such as bee colony algorithm (Khorramizadeh and Riahi 2015), genetic algorithm (GA) (Guo et al. 2005), memetic algorithm (MA) (Frutos and Tohme´ 2013), particle swarm optimization (PSO) (Marinakis et al. 2009), Electromagnetism-like Mechanism (SEM) (Bonyadi and Li 2010), and ant colony optimization (ACO) (Riahi and Kazemi 2015) have been developed to generate competitive results for many combinatorial optimization problems. In the recent years, several ant colony algorithms have developed for various kinds of problems including the scheduling problem. Kashan and Karimi (2008) proposed two ACO algorithms with two different visibility functions for total weighted tardiness single machine environment with formation of processing batches. To minimize total completion time in a no-wait two-machine flow-shop, Shyu et al. (2004) designed some specific features including a heuristic for initializing the initial pheromone, a hybrid state transition rule and a hybrid local search. Li et al. (2011) dealt with the minimization of the sum of completion time in a sequence-dependent setups permutational flowshop. The authors used a timelimited dynamic programming algorithm to perform a post-optimization strategy. Mirabi (2011) proposed an ant colony optimization technique for the sequencedependent flowshop scheduling problem.

نوشته مقاله انگلیسی رایگان در مورد یک الگوریتم کلونی مورچه هیبریدی جدید – اسپرینگر 2018 اولین بار در سایت آی اس آی دانلود ISIDL. پدیدار شد.


 

مشخصات مقاله
انتشار مقاله سال 2018
تعداد صفحات مقاله انگلیسی 17 صفحه
هزینه دانلود مقاله انگلیسی رایگان میباشد.
منتشر شده در نشریه اسپرینگر
نوع مقاله ISI
عنوان انگلیسی مقاله CEO ability and firm performance: Stock market and job market reactions
ترجمه عنوان مقاله توانایی مدیر عامل و عملکرد شرکت: بازار سهام و واکنش بازار کار
فرمت مقاله انگلیسی  PDF
رشته های مرتبط مدیریت
گرایش های مرتبط مدیریت اجرایی، مدیریت مالی، مدیریت کسب و کار، مدیریت عملکرد
مجله مجله اقتصاد و امور مالی – Journal of Economics and Finance
دانشگاه University of New Orleans – New Orleans – USA
کلمات کلیدی توانایی و عملکرد مدیر عامل، بازار کار مدیر عامل، واکنش بازار سهام به استعفا داوطلبانه مدیر عامل
کلمات کلیدی انگلیسی CEO ability and performance, CEO job market, Stock market reactions to CEO voluntary resignations
شناسه دیجیتال – doi
https://doi.org/10.1007/s12197-017-9390-1
کد محصول E8814
وضعیت ترجمه مقاله  ترجمه آماده این مقاله موجود نمیباشد. میتوانید از طریق دکمه پایین سفارش دهید.
دانلود رایگان مقاله دانلود رایگان مقاله انگلیسی
سفارش ترجمه این مقاله سفارش ترجمه این مقاله

 

بخشی از متن مقاله:
1 Introduction

To what extent might a firm’s performance be attributed to the ability of its CEO? Chang et al. (2010) broach this question and assert that the firm performance is indeed related to its CEO’s ability. Specifically, they note that a) abnormal returns of the old firm in conjunction with the turnover announcement is negatively related to its predeparture performance and the salary of its CEO; b) the CEO’s subsequent success is positively related to his salary with and performance of the old firm; c) the postturnover performance of the old firm deteriorates after the better-performing executives with higher salaries depart. The cumulative evidence leads Chang et al. to conclude these results Breject the view that differences in firm performance stem entirely from non-CEO factors such as the firms’ assets, other employees, or Bluck,^ and that CEO pay is unrelated to the CEO’s contribution to firm value^ (p.1633). In this paper, we extend the Chang et al. (2010) paper in three ways. First, we examine if the stock market can make a finer cross-sectional distinction among CEOs based on the level of performance of the associated firms. In doing so, we divide CEOs with better-than-average abilities in two groups: the better-performing group and good-performing group. Second, assuming that the job market would be able to recognize the differential managerial talents, we hypothesize that the CEOs with better abilities would find the job faster and command a higher compensation package than their good counterparts. Finally, we examine if there is (are) any additional attribute(s) that differentiate the first group from the second. We select from voluntary turnovers1 those CEOs that voluntarily leave the jobs are managers with superior ability and CEOs that are fired are of inferior ability. Empirical research supports this premise. For example, Warner et al. (1988) find poor performance as a predictor of forced CEO turnover. In Panel A, Table 2 (page 14), Parrino et al. (2003) compare mean market-adjusted compound abnormal returns between the forced group and the voluntary group and report the abnormal returns for the first group are −30.22%, −10.77%, −10.43%, −15.65% respectively for the holding periods of (−7, 0), (−7, −4), (−3, −2), and (−1, 0) – all being significant at the 1% level. The returns for the same periods, are −1.67%, −.43%, −1.60%, and .23% for the voluntary turnover firms—only (−3, −2) return being significant at the 10% level. Based on the empirically supported notion that voluntarily resigning CEOs are usually superior performers, we first divide these CEOs in two groups: Bbetter^ and Bgood^ performers. Consistent with Chang et al. (2010) we hypothesize that a) abnormal returns of firms from which better CEOs (henceforth, Tier-1) departed would be more negative than those from which good CEOs (henceforth, Tier-2) departed; b) abnormal returns of firms that hired Tier 1 CEOs would be more positive than those that hired Tier-2 CEOs. We also examine if the long-term performance of the hiring firms is consistent with the short-term returns around hiring announcements: in other words, we test if the firms that hire Tier-1 managers would exhibit higher long-term post-hire performance than their Tier-2 counterparts.

نوشته مقاله انگلیسی رایگان در مورد توانایی مدیر عامل و عملکرد شرکت – اسپرینگر 2018 اولین بار در سایت آی اس آی دانلود ISIDL. پدیدار شد.

مطالب تصادفی

آخرین دیدگاه‌ها

    دسته‌ها