Search

Nowadays it is important to store sensitive data and restrict its usage only to authorized people or institutions. In general, solutions for Data Leakage Prevention (DLP) ignores malicious attacks on documents and algorithms using fingerprinting and regular expressions are used. However, content-based attacks are successful evading those algorithms. In this paper an algorithm robust against malicious content-based attacks is proposed, which is independent of the attack executed. Transposition, sentence structure alteration, modification, obfuscation attacks are taken into consideration within the scope of paper. N-gram, charactergram, k-skip-n-gram and LSA methods are used in the feature extraction step, for having better classification results under attacks. The extracted features are passed to a Vote Classifier consisting of Support Vector Machine, Random Forest and Multi-Layer Perceptron classifiers. Additionally, the effects of instrumenting Spell-Correction in different steps of the algorithm is evaluated, which is effective against modification attacks. [ABSTRACT FROM AUTHOR]

In control system design, it is important to determine the controller type and controller parameters appropriately. PID controllers are mostly preferred in many applications. At the same time, it is known that PID controllers are insufficient to control higher order oscillatory systems with time delay. In such systems, PIDA controller is preferred instead of traditional PID controller. This paper presents a hybrid algorithm based optimization method for the control of higher order oscillatory systems with time delay. A hybrid algorithm combining the advantages of firefly and genetic algorithm is used to determine PIDA controller parameters. In the proposed method, a multi-criteria objective function is suggested by taking the settling and rising time, percent overshoot and steady state error criteria from the time response parameters. Two simulation studies are conducted to evaluate the performance of the proposed method, and the results are compared with some studies from the literature. In addition, the parameter uncertainties of the systems are analyzed and the robustness performance evaluations of the designed controllers are made. It is seen from the results obtained that the proposed method improves the transient and steady state response of higher order oscillatory systems with time delay and offers a fast and effective tuning method. [ABSTRACT FROM AUTHOR]

Recent studies show that the performance of Evolutionary Algorithms often depends on choosing appropriate parameter configurations. Thus, researchers have generally tuned these parameters either looking at the similar research areas in the literature or manually, e.g. Grid Search. However, searching the parameter manually is laborious and timeconsuming; therefore, meta-optimization techniques have become commonly used methods to adjust parameters of an algorithm. These techniques can be classified in two widespread manners: off-line, tuning parameters of an algorithm before the algorithm initiates, and on-line, tuning the parameters while it is working. In this paper, Bipolar Matching Tendency (BMT) algorithm has been chosen as the selection method of a Genetic Algorithm (GA). The new obtained algorithm is named GA-BMT and has been used for the first time as an online metaoptimizer. In addition, the paper utilizes two search algorithms (Grid Search, Coarse to Fine Search) with three meta-optimization methods (Standard GA, Particle Swarm Optimization, GA-BMT) to investigate the best parameter settings of the Standard GA for 17 test functions, and offers a comparative work by comparing their results. Furthermore, non-parametric statistical tests, Friedman and Wilcoxon Signed Rank, were performed to demonstrate the significance of the results. Based on the all results that achieved, GA-BMT presents a reasonable achievement. [ABSTRACT FROM AUTHOR]

In this paper, it is aimed to express more accurately the intuitionistic fuzzy values expressed by the decision-makers for intuitionistic fuzzy parameterized intuitionistic fuzzy soft sets. For this purpose, virtual intuitionistic fuzzy parameterized intuitionistic fuzzy soft sets are proposed by defining the concepts of virtual lower and upper intuitionistic fuzzy approaches. Moreover, the basic set operations for this hybrid set type are examined together with their associated properties. In addition, a decision-making algorithm focusing on virtual intuitionistic fuzzy parameterized intuitionistic fuzzy soft sets is constructed. Finally, an analysis of the obtained results was made. [ABSTRACT FROM AUTHOR]

Güç sistemleri, üretim aşamasından tüketim aşamasına kadar karmaşık bir yapıdadır. Elektrik enerjisinin tüketiciye sürekli, güvenilir, kaliteli ve ekonomik olarak ulaştırılması üretim/iletim/dağıtım aşamalarında kesintisiz ve optimize edilmiş enerji akışının sağlanmasına bağlıdır. Optimum Yük Akışı (OYA) problemi jeneratörler/bara gerilimleri, kademe değiştiricileri aktif/reaktif gücü güvenli sınırlarında tutup, yakıt maliyeti ve aktif/reaktif güç kayıpları gibi parametrelerini optimize etmeyi hedefler. Bu nedenle güç sistemlerinde OYA probleminin etkili bir yöntemle optimize edilmesi önemlidir. Bu yayın, OYA problemini çözmek için yeni bir sezgisel algoritma olan İyileştirilmiş Su Çevrim Algoritması (İSÇA)'nı kullanmaktadır. Önerilen yöntem farklı amaç fonksiyonlarına sahip IEEE 30 bara güç sistemi üzerinde uygulanmıştır. Önerilen yöntemin etkinliği ve esnekliği literatürde yakın zamanda yayınlanmış diğer sezgisel yöntemlerin sayısal sonuçlarıyla karşılaştırılarak tartışılmıştır. Bu çalışmada İSÇA yöntemiyle IEEE 30 bara güç sistemine ait önemli sonuçlarından biri olan yakıt maliyetinin sonucu 798.9021 $/s hesaplanmıştır. Bu veri, çalışmada bildirilen güncel yöntemlere ait yakıt maliyeti sonuçlarından daha iyidir. Ayrıca bu yayında sunulan yöntem gerçek bir güç sistemi olan 154 kV Güney Marmara iletim sisteminin bir kesitinin sanal modeline uygulanarak, gerçek zamanlı bir sistemde aktif güç kayıplarının azaltılmasının sağlanabileceği gösterilmiştir. Power systems are getting more complex structure from production to consumption stages. The continuous, reliable, quality and economical delivery of electrical energy to the consumer depends on ensuring uninterrupted and optimized energy flow during the production/transmission/distribution stages. Optimum Power Flow (OPF) problem goals to optimize the parameters such as fuel cost, active/reactive power losses, etc by keeping the generators/bus voltages, tap setting and active/reactive power within their secure limits. Therefore, it is important to optimize load flow in power systems with an effective method. This paper uses a recent heuristic algorithm, named as the Modified Water Cycle Algorithm (MWCA), for the OPF problem. For the purpose demonstrate the effectiveness of the recommended method, it has been analyzed on the IEEE 30 bus power system for varied object functions. The validity and flexibility of this algorithm are discussed by comparison with numerical conclusion of the many newly published heuristic methods in the literature. In this study, the result of the of fuel cost, which is important results of the IEEE 30 bus test system, is computed using MWCA as $798.9021/s. This value is best the fuel cost results of various methods reported in the study. In addition, this method, has applied to a part of the virtual model of 154 kV South Marmara transmission system to show that the active power losses of transmission system could be reduced in a realtime system. [ABSTRACT FROM AUTHOR]

With the use of computers in every field, the usage intensity of processors is increasing day by day. In order to cope with this intensity, processors need to be constantly updated and improved. Various scheduling algorithms are being developed every day in order to continuously improve and accelerate the processors and to cope with the processing intensity. The main purpose of the scheduling algorithms is to increase the efficiency of the processor. For this, the processor needs to make a planning between the pending processes. Planning can be done by giving different priorities or using different methods. In order to increase the efficiency of the processor, in this paper, existing algorithms were examined. Round Robin Algorithm was improved using Genetic Algorithm. It is aimed to find the optimum values by selecting the quantum value according to the pending processes and their parameters. When the developed new method compared with the existing standard algorithms, it is observed that the waiting time and the turnaround time were shorter than the other algorithms. [ABSTRACT FROM AUTHOR]

TÜBİTAK has introduced the Incentive Program for International Scientific Publications (UBYT) in 1993 in order to increase the quantity, quality and impact of TR-addressed publications indexed in Web of Science (WoS) and support their authors. Some changes take place from time to time in the algorithms used in the program to identify publications to be supported and to calculate the amounts of monetary support to be paid. The new support algorithm introduced in 2019 aims to improve the shortcomings of the previous one. This paper is a comparative investigation of the impact of the new algorithm on supported journals, publications and the amounts of payments. For this, we first compare the functioning of the old and new support algorithms. We then analyze the impact of the new algorithm on the Program's supported journals lists as well as on the publications having article influence scores (AIS) that were supported in 2015 according to the old algorithm. Findings show that ongoing problems such as providing relatively more support to low impact publications and paying different amounts to publications in different fields do not seem to have completely been solved with the new algorithm. We discuss the major issues with performance-based research funding systems that solely use bibliometric measures to determine the impact of publications and offer some suggestions. [ABSTRACT FROM AUTHOR]

This paper studies how a group of delivery workers in Barcelona were able to organize a successful traditional and a social media strategy in order to claim for their rights as waged workers. They created a union, RidersxDerechos, and they also decided to create a worker's cooperative, Mensakas, with their own application and algorithm. We will study how they were able to re-appropriate technology and to use digital communities to spread alternative discourses. We have used different methodologies: traditional content analysis in Media, debate analysis in Social Media, qualitative ethnography. We noticed that RidersxDerechos access to media was very successful (300 piece of news analyzed) thanks to strikes and court trials, facilitating a change of perspective in the treatment of platform economy in Media. Media were following up the digital entrepreneurship rhetoric until then. Along with the traditional media strategy they developed a diversified communicative pathway in social media (Twitter, Instagram, Facebook, and Goteo) that helped them to establish alliances with riders from other cities and countries. We focused on more than 25.000 tweets. Finally, they proposed a new way to use technology by creating their own app and algorithms for their working cooperative, Mensakas. Crowdfunding was also used to fund it and to spread an alternative working storytelling from Silicon Valley's. [ABSTRACT FROM AUTHOR]

This paper presents a filled function method to solve economic load dispatch (ELD) of the thermal unit. The proposed method can take care of ELD considering nonlinearity such as valve point loading. The effectiveness of the proposed algorithm has been verified on three different test systems with equality and inequality constraint. Simulation results show that the filled function method is less sensitive to initial values of parameters and is more effective than other previously developed algorithms. In addition, the proposed algorithm is highly promising for the large-scale system. [ABSTRACT FROM AUTHOR]

Nowadays, a lot of data hiding algorithms for binary images have been proposed in the literature. The main purpose of these algorithms is to provide data hiding with high capacity and high visual quality. The pattern based data hiding algorithms are commonly used to achieve this purpose. In this paper, a new data hiding algorithm is suggested. This algorithm is based on minesweeper game for binary images. Neighborhood degree is calculated by selecting mine value as 0 or 1. The size of 3x3 non overlapping blocks have been used to determine neighborhood degree. Data hiding process is implemented by modifying the obtained neighborhood degree. Hamming distance is calculated to keep distortion in minimum level. In the selection of similar blocks with different neighborhood degrees, privacy of the algorithm is provided by using random number generators. The experimental results showed that the proposed data hiding algorithm resulted successfully. [ABSTRACT FROM AUTHOR]

With the development of agile optical switches, dynamic optical circuit switching has become possible and connections are set up and torn down on demand basis. The explosive growth of different traffic types such as data, voice and video requires the support of differentiated services in terms of survivability measures and timing requirements. In order to guarantee a specific level of survivability, availability-guaranteed bandwidth provisioning is considered. On the other hand, connections are set up and released for specific time durations, with sliding or fixed setup times. Connection requests arrive to the network provider with specified holding times, delay tolerances and availability requirements which need to be satisfied. Delay tolerance is defined as the maximum time which a request can tolerate before the connection is set up. Future network carriers need to meet strict SLA (Service Level Agreement) guidelines, thus guaranteeing a level of service, as well as achieving efficient resource utilization. Connection availability is an important metric to measure the quality of service (QoS) in a survivable network. It is defined as the probability that a connection will be found in the operating state at a random time in the future (Clouqueur et al., 2002). It is affected by many factors such as network component failure probabilities, failure repair times, etc. Usually, the availability target for a connection is specified in a Service Level Agreement (SLA), which is a contract between a service provider (e.g., a network operator) and one of its customers (e.g., a large institutional user of bandwidth). An SLA violation may result in a penalty to be paid by the network operator to the customer according to the contract (Grover, 1999). In order to provide the appropriate level of availability stated in the SLAs, different recovery mechanisms can be used to provision different connection requests. In this study, we consider unprotected, shared-path protected and dedicated-path protected provisioning mechanisms at the same time to satisfy different QoS requirements in a dynamic manner. Previous studies, while maximizing sharability by routing backup paths in a dynamic traffic environment, do not make any estimation on future sharability of resources. They take the current link states into consideration to choose sharable links. Reference (Tornatore et al., 2005a,b) shows that resource overbuild (RO) in shared-path protection can be decreased by exploiting the holding-time information of connections which have already been provisioned in the network. Since holding times of incoming traffic demands may be known in advance for a variety of applications, this information about the future states of the links makes the route decision more intelligent by allowing the choice of more sharable paths. In this paper, unprotected, shared-path, and dedicated-path protection techniques are used to meet the differentiated availability requirements. Recently, among the other Service Level Specifications (SLSs), many new applications are identified by known in advance holding time and delay tolerance. So, in this paper, for dynamic provisioning of availability guaranteed connections in an optical mesh network, we propose two new algorithms which exploit 1 the knowledge of connection holding times to accomplish minimum backup capacity allocation as compared to the previous holding time unaware approach and 2 the knowledge of delay tolerances to degrease the blocking probability in the conditions that the system resources are not available to satisfy the SLS demands of connection requests. Here we also propose a new routing mechanism for backup paths optimizing backup resources considering the future departure time of existing connections. In order to show the performance gain; the first proposal, AGSDP_HT (Holding time aware Availability Guaranteed Service Differentiated Provisioning) is compared by a base line algorithm AGSDP. The second proposal ADT (Availability guaranteed, service differentiated provisioning with Delay Tolerance) is compared by a base line approach which does not consider delay tolerance. For the second proposal, both algorithms dedicated protection is not used as a choice, since blocking is decreased by delay tolerance. [ABSTRACT FROM AUTHOR]

Recent research in architecture have focused on to understand computational methods of formal exploration and expression. Computational mechanisms have been used to readdress formal issues using new techniques and methods. Computational tools that operate on algorithmic logic are central in these explorations. Despite the proliferation of computers in architecture today, use of algorithms in architectural design is limited. This paper describes "Designing the Design" studio work, developed within the scope of "The integration of Computational Design into Design and Architectural Education" research project. The aim of the studio is to explore the use of algorithms in architectural design process. The paper is organized in three parts, the first part elaborates formal language and algorithmic approach to design. The second describes the studio work in which algorithmic logic is integrated into design process and the third evaluates the studio work and discusses the changing paradigms in practice and education of design. [ABSTRACT FROM AUTHOR]

High-rate low-density parity-check (LDPC) codes are the focus of intense research in magnetic recording because, when decoded by the iterative sum-product algorithm, they show decoding performance close to the Shannon capacity. However, cycles, especially short cycles, are harmful to LDPC codes. The paper describes the partition-and-shift LDPC (PS-LDPC) codes, a new class of regular, structured LDPC codes that can be designed with large girth and arbitrary large minimum distance. Large girth leads to more efficient iterative decoding and codes with better error-floor properties than random LDPC codes. PS-LDPC codes can be designed for any desired column weight and with flexible code rates. The paper details the girth and distance properties of the codes and their systematic construction and presents analytical and simulation performance results that show that, in the high signal-to-noise ratio region, PS-LDPC codes out- perform random codes, alleviating the error floor phenomenon. [ABSTRACT FROM AUTHOR]

This paper presents a high-performance vector control strategy for Multilevel Inverter (MLI) fed induction motor drive system. In the proposed drive system, an adaptive and online trained sugeno type neuro-fuzzy speed controller is used to improve the speed tracking performance. The generation of Pulse Width Modulation (PWM) patterns for multilevel inverter is obtained using space vector PWM algorithm. The complete drive system is implemented in real time using DS1104 controller card. Using the experimental setup, the performance of the proposed drive system is tested under different speed commands, mechanical parameter variations and load disturbances. The experimental results show that control performance of the proposed drive system is satisfactory. [ABSTRACT FROM AUTHOR]

In this paper, the different working structure and unique design of the E-Core Transverse Flux Machine that is combined of transverse flux and reluctance principle is investigated for training bike application. Also, static magnetic characteristics of the machine are obtained with finite element analysis and experimental measurements. The modeling of the E-Core Transverse Flux Machine and its driver system are given. The whole system with all control algorithms for a training bike application is simulated and the performance curves are presented. Finally, the experimental tests done at the laboratory for the indoor training bike application are compared and verified with the results of the simulation. [ABSTRACT FROM AUTHOR]

Many classification algorithms and econometric models require that training examples contain only discrete values. In order to use these algorithms when some variables have continuous values, the numeric variables must be converted into discrete ones. This paper describes a new way of discretizing numeric values using multiple structural changes. [ABSTRACT FROM AUTHOR]

In this paper a solution method is proposed for emphasizing the importance of costumer needs at the starting of Quality Function Deployment (QFD) application when there are multi costumer groups. Data Envelopment Analysis (DEA) steps are added to an algorithm in which an Analytic Network Process (ANP) approach is used in QFD. The need for adding DEA steps is determining the efficient customer requirements when there are multi customer groups. This solution approach is called DEANP which aggregates data DEA to ANP. The relative importance values of product technical requirements are calculated with this algorithm and application is performed at a manufacturer of white goods company in Turkey. The fact that using DEANP instead of ANP produced more powerful solutions is also confirmed by marketing specialists. [ABSTRACT FROM AUTHOR]

Pulmonary arterial hypertension (PAH) is a clinical syndrome that is often diagnosed late and is associated with a progressive clinical deterioration and death. However, over the past ten years there has been a dramatic increase in the number of effective therapies. Identification of dysfunctional pathways in the pulmonary circulation provided novel therapeutic targets with the goal of reducing pulmonary vascular resistance and death from right ventricular failure. Treatment strategies are determined according to current guidelines. Pulmonary artery vasoreactivity, functional class and response to treatment are important concepts for initiation of medical therapy. With the availability of medications that target different pathologic processes, combination therapy has become a frequently used therapeutic option in PAH. In this paper, we aimed to review the therapeutic algorithms in pulmonary hypertension based on current guidelines. [ABSTRACT FROM AUTHOR]

In this paper, we propose a new hybrid meta-heuristic algorithm based on simulated annealing supplemented with tabu list for the Multi Objective Facility Layout Problem (MOFLP). It is a SA approach supplemented with a tabu list. The main advantage of this approach is that a short term memory provided by the tabu list can be used to avoid solution re-visits while preserving the stochastic nature of the SA method. The goal of the new hybrid heuristic algorithm is to find the solutions forming the set of efficient solutions (pareto optimal set) of the MOFLP's in a relatively short time. The hybrid meta-heuristic is illustrated with a practical example of plant with 8 departments and 4 objectives. An efficient set of layouts corresponding to pre-determined weights are obtained. And also the set of efficient pareto-optimal solutions of the problem are determined. [ABSTRACT FROM AUTHOR]

Digital Finite Impulse Response (FIR) filters are frequently used in Digital Signal Processing (DSP) by virtue of stability and easy implementation. The problem of designing the multiplier block of a digital FIR filter has received a significant amount of attention during the last decade, as the filters require a large number of multiplications, leading to excessive area, delay, and power consumption even if implemented in a full custom integrated circuit. Previous works have focused on the design of filters with minimum area by replacing the multiplication operations with constant coefficients by addition, subtraction, and shifting operations. Since shifts can be implemented with only wires in hardware, the design problem can be defined as the minimization of the number of addition/subtraction operations to implement the coefficient multiplications. This problem is generally known as the MCM problem. In the last decade, many efficient algorithms have been proposed for the MCM problem. These algorithms can be categorized in two classes: Common Subexpression Elimination (CSE) and graph-based algorithms. While the CSE algorithms basically find the common non-zero digit patterns on the representations of the constants, the graph-based algorithms are not restricted to a particular number representation and synthesize the constants iteratively by building a graph. However, in the algorithms proposed for the MCM problem, an addition/subtraction operation is assumed to be a two-input operation that is generally implemented using a Ripple Carry Adder (RCA) block yielding great latency in the implementation of MCM. In high-speed applications, particularly in DSP systems, Carry-Save Adder (CSA) blocks are preferred to RCA blocks taking into account the increase in area. Despite the large number of algorithms designed for the minimization of addition/subtraction operations based on RCAs, there are only a few algorithms proposed for the optimization of the number of CSA blocks. Although these algorithms give good results, they are based on heuristics, i.e., provide no indication on how far from the minimum their solutions are. To the best of our knowledge, there is no exact algorithm proposed for the optimization of the number of CSA blocks in MCM. In this paper, an exact CSE algorithm designed for the minimization of the number of CSA blocks is introduced. In the exact CSE algorithm, initially, all possible implementations of filter coefficients and partial terms using CSAs are found when filter coefficients are defined under a number representation, and a combinational network that represents the implementations of constants is constructed. Then, the minimization of the number of CSA blocks problem is defined as a 0-1 Integer Linear Programming (ILP) problem with a cost function to be minimized and constraints to be satisfied.… [ABSTRACT FROM AUTHOR]

Wireless Sensor Networks (WSN) are very popular area of interest both in academic studies and industrial applications since they can work individually without additional maintenance and can be deployed in diverse applications. However, the limited source of the nodes cannot guarantee a sufficient level of security and also complicates the design and the implementation of the algorithms/protocols. DoS (Denial of Service) attacks that manipulate vulnerabilities of access protocol by disrupting network communication or arising exceptional cases and cutting network's lifetime are primary threats for wireless sensor networks. S-MAC (Sensor Medium Access Control) and its derivatives (T-MAC [1], D-MAC [2] etc.) which, are the most common medium access protocols designed for WSNs, are vulnerable against such attacks. In this paper, we have implemented the design of the AR-MAC (Attack Resistant MAC) protocol that detects the types of jammers and maintains the appropriate solution for each jammer type. By means of the new MAC protocol designed, the WSNs have been more robust to DoS attacks in MAC layer and the lifetime of the nodes have been extended under such attacks without additional hardware. [ABSTRACT FROM AUTHOR]

In this paper, we consider the problem of modeling the timing error process in magnetic recording systems. We propose a discrete- valued Markov model for the timing error process, and design two methods (data-aided and nondata-aided), based on the Baum-Welch algorithm, to extract the model parameters from the readback waveforms. The channel model we consider is an intersymbol interference (ISI) channel with additive Gaussian noise. The continuous-time readback signal at the output of the channel is sampled at baud-rate. Simulation results show that the estimated parameters are close to the actual values and the convergence is attained in a few iterations of the Baum-Welch algorithm. We also demonstrate the usefulness of the accurate model extraction by comparing a fine-tuned Markov timing recovery loop to the standard Mueller and Muller detector with a tuned second-order loop filter. [ABSTRACT FROM AUTHOR]

The article presents information on the properties of Graeco-Latin squares enumerated by mathematician Leonhard Euler. Euler suggested that a Graeco-Latin square of size n could never exist for any n of the form 4k +2, although he was not able to prove it. A Latin square is an n-by-n array of n distinct symbols in which each symbol appears exactly once in each row and column. On the other hand a Graeco-Latin square is an n-by-n array of ordered pairs from a set of n symbols such that in each row and each column of the array, each symbol appears exactly once in each coordinate. In one of his papers on Graeco-Latin squares, Euler used magic squares, which are closely related to Graeco-Latin squares. Magic squares were constructed by using Graeco-Latin squares of orders 3, 4 and 5. He showed that a Graeco-Latin square of order n can be converted into a magic square by the use of an algorithm. One can construct Graeco-Latin squares of every order n except those values for which the prime factorization of n contains only a single factor of 2.

This paper presents general information on simulation with Pareto distribution and introduces an algorithm to generate random numbers by simulation method. A computer code has been developed for this algorithm by using Delphi programming language. Ten thousand random numbers for Pareto distribution have been generated using this program, and the chi-square goodness-of-fit at five percent significance level has been performed. [ABSTRACT FROM AUTHOR]