Lee's Algorithm Research Articles

A Novel ASIC Implementation of Two-Dimensional Image Compression Using Improved B.G. Lee Algorithm

A 2D Discrete Cosine Transform and Inverse Discrete Cosine Transform using the B.G. Lee algorithm, incorporating a signed error-tolerant adder for additions, and a signed low-power fixed-point multiplier to perform multiplications are proposed and designed in this research. A novel Application Specific Integrated Circuit hardware implementation is used for the 2D DCT/IDCT computation of each 8 × 8 image block by optimizing the input data using the concepts of pipelining. An enhanced speed in processing and optimized arithmetic computations was observed due to the eight-stage pipeline architecture. The 2D DCT/IDCT of each 8 × 8 image segment can be quickly processed in 34 clock cycles with a substantially reduced level of circuit complexity. The B.G. Lee algorithm has been implemented using signed error-tolerant adders, signed fixed-point multipliers, and shifters, reducing computational complexity, power, and area. The Cadence Genus tool synthesized the proposed architecture with gpdk-90 nm and gpdk-45 nm technology libraries. The proposed method showed a significant reduction of 31.01%, 12.17%, and 21.11% in power, area, and PDP in comparison to the existing image compression architectures. An improved PSNR of the reconstructed image was also achieved compared to existing designs.

Interactive Visualization of the Printed Circuits Tracing Algorithms for Educational Purposes

A software module that allows interactive demonstration of maze routing algorithms for tracing printed conductors, which, during their operation, use a grid representation of a discrete working space of a printed circuit board has been developed. The main difference between the developed module and the software of similar purpose is the possibility of step-by-step annotated execution of various algorithms for tracing printed conductors with the possibility of changing the order of routing user-specified conductors. The interrelation of algorithms for finding the shortest paths on graphs and algorithms for tracing printed conductors and the influence of the order of making connections between pairs of contact pads on the length of printed electrical connections are considered. An analysis of the advantages and disadvantages of the wave algorithm (Lee algorithm) and the heuristic algorithm A* was carried out with a description of their step-by-step operation. The use of the development is justified when giving lectures and conducting laboratory research on the theoretical foundations of automation systems for the design of radio electronic equipment and contributes to solving the complex problem of digitalization of the educational process with the help of visualization programs that allow you to observe the results of the algorithms they implement on various sets of initial data.

Применение нейронных сетей для сегментации изображений в задаче быстрой трассировки интегральных схем

The paper explores the possibilities of using neural network methods to solve the problem of global routing for VLSI ASIC design. An algorithm has been developed for generating a training dataset based on the Lee algorithm, which allows one to synthesize three-dimensional matrices with obstacles and points that need to be connected. The U-Net fully convolutional neural network, effective for semantic segmentation of images, was selected for training. The quality of the results was assessed using a validation data. A significant reduction in routing time compared to the Lee algorithm was shown, but the share of unbroken routes was only 37%. Ways to improve the training dataset and adapt the approach to real conditions using DEF and GUIDE files are proposed. In general, the work demonstrated the potential of neural network methods to speed up the global routing task, but continued research is required to improve the quality and reliability of the results. The work is useful for specialists in the field of integrated circuit design and machine learning.

PREDIKSI POLA PERSEBARAN TUMPAHAN MINYAK MENGGUNAKAN DATA CITRA SATELIT SENTINEL-1 DI PERAIRAN BINTAN, KEPULAUAN RIAU

Bintan is one of the regions with annual cases of oil spills, which were excluded from tank cleaning and black waste disposal activities. In arranging oil spill response, it is important to know the areas that are potentially affected, using oil spill trajectory model by GNOME. SAR (Sentinel-1) data is used to create coordinates for oil spills location in GNOME. SAR data processing is using SNAP software, with Lee Algorithm filter (window 5x5). The areas that potentially exposed to oil spills are known based on Environmental Sensitivity Index (ESI). In this model, oil spill will reach the Bintan Coast within 2 to 5 days with average surface current speed of 4.28 m/s (West Monsoon). The estimated of oil total amount is 1,767 barrel, which 1,157 barrel polluted the coast, 606 barrel has evaporation and dispersion and the other 4 barrel was off map. The most sensitive area to oil spills are Trily Resort Center Bintan and Sebong Bay (Index 10D). The ESI average among the Bintan region are Index 3A and 3B such as Lagoi, Tanjung Berakit, Pulau Pangkil, Pulau Mapur, Cabana, Pulau Lobam, Pantai Mayang Sari, Pantai Indah Club Med Bintan, Bintan Lagoon Resort, Pantai Senggiling, and Pengudang.

Research Based on Lee Algorithm and Genetic Algorithm of the Automatic External Pipe Routing of the Aircraft Engine

The casing of aeroengine has the characteristics of rotating surface, and more than one hundred pipes are decorated between the casing and outer surface of the nacelle. For the narrow space and various constraints of pipe routing, manual pipe routing is not only labor intensive, but also difficult to ensure the accuracy. To resolve the problem of automatic pipe routing of the aircraft engine, a novel method based on lee algorithm and genetic algorithm is proposed. Firstly, a 3D environment of pipe routing is built and then the initial population for the genetic algorithm is formed by lee algorithm combined with roulette method. Each chromosome of the population represents a possible solution of pipe routing. Secondly, a variable length coding scheme based on chain table is used for chromosome encoding. The genetic manipulation includes selection, crossover and mutation. This paper presents the fitness function based on the constraint condition of pipeline routing. Finally, the useful and feasibility of this method is developed and verified by developing an automatic pipe routing module based on UG and VC.

PERAMALAN MENGGUNAKAN METODE WEIGHTED FUZZY INTEGRATED TIME SERIES (Studi Kasus: Harga Beras di Indonesia Bulan Januari 2011 s/d Desember 2017)

Fuzzy Time Series (FTS) is a time series data forecasting technique that uses fuzzy theory concepts. Forecasting systems using FTS are useful for capturing patterns of past data and then to using it to produce information in the future. Initially in the FTS each pattern of relations formed was considered to have the same weight besides using only the first order. In its development the Weighted Fuzzy Integrated Time Series (WFITS) which gave a difference in the weight of each relation and high order usage has been appeared. Measuring the accuracy of forecasting results is used the value of Root Mean Square Error (RMSE) and Mean Absolute Percentage Error (MAPE). In this study both the first-order and high-order WFITS methods were applied to forecast rice prices in Indonesia based on data from January 2011 to December 2017. In this regard, the results of the analysis obtained data forecasting using Lee's high-order model WFITS algorithm (1,2,3) giving the value of RMSE and MAPE on the data testing in a row as many as 69,898 and 0.47% while for the RMSE and MAPE on the training data is as many as 70.4039 and 0.54%. Keywords: Fuzzy Time Series, Weighted Fuzzy Integrated Time Series, RMSE, MAPE, High-Order, Rice Prices

The Island CGH, a new coding scheme: concept and demonstration.

Computer generated holograms (CGHs) are powerful optical elements used in many fields, such as wavefront shaping, quality testing of complex optics, and anti-counterfeiting devices. The Lee algorithm is the most used to generate binary amplitude Fourier holograms. Grayscale CGHs are known to give a higher reconstruction quality than binary holograms, but they usually require a cumbersome production process. A very simple and straightforward method of manufacturing rewritable grayscale CGHs is proposed here by taking advantage of two key components: a digital micro-mirror device (DMDs) and a photochromic plate. An innovative algorithm, named Island algorithm, able to generate grayscale amplitude Fourier CGHs, is reported and compared with the standard Lee approach, based on 9 levels. A crucial advantage lies on the fact that the increase or decrease of the quantification does not affect the spatial resolution. In other words, the new coding leads to a higher spatial resolution (for a given CGH size) and a reconstructed image with an order of magnitude higher contrast with respect to the classical Lee-coded hologram. In order to show the huge potential of our approach, a 201 level Island hologram is designed, produced and reconstructed, pushing the contrast to values higher than104. These results reveal the potential of our process as well as our algorithm for generating programmable grayscale CGHs.

Avoiding the Obstacles in the Robot Working Zone by Using the Lee Algorithm

Avoiding the Obstacles in the Robot Working Zone by Using the Lee Algorithm

Fast routing verification with complexity effect for SOC

Integrated circuit (IC) fabrication technology has improved to 7 nm resulting that IC can accommodate more transistors to implement system-on-a-chip (SOC). SOC generally consists of a great quantity digital circuits with specific functions. Diverse signals not only convey inside but also communicate outside among circuits. For hundreds of thousands interlaced and complicated signals, it is an extreme big challenge to route in shrink channel. In this work, we propose a complexity effect routing algorithm based on the Lee algorithm to achieve fast verification for SOC. The advantages are to gain fast evaluated for various architectures of route, trace path from origin to destination and set diverse complexity to simulate SOC architectures. Experimental results demonstrate the achievements on five complexity sets of routing benchmarks.

ИССЛЕДОВАНИЕ МОДЕЛЕЙ РЕАЛИЗАЦИИ ВОЛНОВОГО АЛГОРИТМА ДВИЖЕНИЯ РОБОТА ДЛЯ АРХИТЕКТУРЫ NVIDIA В ТЕХНОЛОГИИ CUDA

ИССЛЕДОВАНИЕ МОДЕЛЕЙ РЕАЛИЗАЦИИ ВОЛНОВОГО АЛГОРИТМА ДВИЖЕНИЯ РОБОТА ДЛЯ АРХИТЕКТУРЫ NVIDIA В ТЕХНОЛОГИИ CUDA

Fuchsia : A tool for reducing differential equations for Feynman master integrals to epsilon form

We present Fuchsia — an implementation of the Lee algorithm, which for a given system of ordinary differential equations with rational coefficients ∂xJ(x,ϵ)=A(x,ϵ)J(x,ϵ) finds a basis transformation T(x,ϵ), i.e., J(x,ϵ)=T(x,ϵ)J′(x,ϵ), such that the system turns into the epsilon form : ∂xJ′(x,ϵ)=ϵS(x)J′(x,ϵ), where S(x) is a Fuchsian matrix. A system of this form can be trivially solved in terms of polylogarithms as a Laurent series in the dimensional regulator ϵ. That makes the construction of the transformation T(x,ϵ) crucial for obtaining solutions of the initial system.In principle, Fuchsia can deal with any regular systems, however its primary task is to reduce differential equations for Feynman master integrals. It ensures that solutions contain only regular singularities due to the properties of Feynman integrals. Program summaryProgram Title:FuchsiaProgram Files doi:http://dx.doi.org/10.17632/zj6zn9vfkh.1Licensing provisions: MITProgramming language:Python 2.7Nature of problem: Feynman master integrals may be calculated from solutions of a linear system of differential equations with rational coefficients. Such a system can be easily solved as an ϵ-series when its epsilon form is known. Hence, a tool which is able to find the epsilon form transformations can be used to evaluate Feynman master integrals.Solution method: The solution method is based on the Lee algorithm (Lee, 2015) which consists of three main steps: fuchsification, normalization, and factorization. During the fuchsification step a given system of differential equations is transformed into the Fuchsian form with the help of the Moser method (Moser, 1959). Next, during the normalization step the system is transformed to the form where eigenvalues of all residues are proportional to the dimensional regulator ϵ. Finally, the system is factorized to the epsilon form by finding an unknown transformation which satisfies a system of linear equations.Additional comments including Restrictions and Unusual features: Systems of single-variable differential equations are considered. A system needs to be reducible to Fuchsian form and eigenvalues of its residues must be of the form n+mϵ, where n is integer. Performance depends upon the input matrix, its size, number of singular points and their degrees. It takes around an hour to reduce an example 74 × 74 matrix with 20 singular points on a PC with a 1.7 GHz Intel Core i5 CPU. An additional slowdown is to be expected for matrices with complex and/or irrational singular point locations, as these are particularly difficult for symbolic algebra software to handle.

Hardware design of parallel switch setting algorithm for Benes networks

Benes/Clos networks have been used in many areas, such as interconnection network in parallel computers, multiprocessors system, and networks-on-chip. The parallel switch setting algorithm is the key to satisfy the requirements of high performance switching networks. The Lee's routing algorithm is by far the most efficient parallel routing algorithm for Benes networks. However, there is no hardware implementation for this algorithm. In this paper, the Lee's routing algorithm is fully implemented in RTL and synthesised. We have refined the algorithm in data structure and initialisation/updating of relation values to make it suitable for hardware implementation. The simulation and synthesis results of the switching setting circuits for 4 × 4 to 64 × 64 Benes networks confirm that the timing, area, and power consumption of the circuit is consistent with the complexity of the Lee's algorithm. To the best of our knowledge, this is the first complete hardware implementation of the parallel switch setting algorithm which can handle all types of permutations including partial ones.

Hardware design of parallel switch setting algorithm for Benes networks

Benes/Clos networks have been used in many areas, such as interconnection network in parallel computers, multiprocessors system, and networks-on-chip. The parallel switch setting algorithm is the key to satisfy the requirements of high performance switching networks. The Lee's routing algorithm is by far the most efficient parallel routing algorithm for Benes networks. However, there is no hardware implementation for this algorithm. In this paper, the Lee's routing algorithm is fully implemented in RTL and synthesised. We have refined the algorithm in data structure and initialisation/updating of relation values to make it suitable for hardware implementation. The simulation and synthesis results of the switching setting circuits for 4 × 4 to 64 × 64 Benes networks confirm that the timing, area, and power consumption of the circuit is consistent with the complexity of the Lee's algorithm. To the best of our knowledge, this is the first complete hardware implementation of the parallel switch setting algorithm which can handle all types of permutations including partial ones.

\textsf {Fuchsia} and Master Integrals for Energy--Energy Correlations at NLO in QCD

In this talk we discuss some aspects of the analytical calculation of energy correlations in electron-positron annihilation at a next-to-leading order in QCD. Our primary focus is on the most difficult task: the calculation of master integrals for real-emission contributions, which are functions of two dimensionless variables and the dimensional regulator. We use a method of differential equations and their so-called epsilon-form which is constructed with the help of the Fuchsia program based on Lee's algorithm.

Cellular Automata Construction for Novel Routing over Hexagonal Grid for Mobile Ad-hoc Networks

We address the problem of constructing an efficient route algorithm for Mobile Ad-hoc Network setting up QoS routes based on route discovery mechanism of AODV protocol and cellular automata. A Mobile Ad-hoc Network (MANET) consists of mobile nodes which are free to move arbitrarily due to its dynamic nature, adaptive and infrastructure less in nature. It is very tough task to have a snap of a network topology in this dynamic nature. Many research works have done to find a shortest path in MANET, it may give a better solution for finding an optimal path but difficult to augment with QoS constraints and its energy utilization. Here we have proposed an algorithm based on hexagonal cellular automata model for giving an efficient algorithm. This algorithm applies ADOV protocol and Lee's algorithm for constructing a shortest route and it considers energy and delay/bandwidth constraints as its basic metrics. These two metrics give a basic criterion for selecting a path between source and destination nodes through hexagonal cellular automata. Finally it is modeled with a matrix to implement it.

Image Tamper Detection and Recovery based on Dilation and Chaotic Mixing

In this paper, we propose an efficient method for image tamper detection and recovery. We separate the image into several blocks, and share a block information to two other blocks. It means, there have two copies of one block information for each non-overlapping block. In implementing, we improve Lee's algorithm of watermark embedding, especially when the tampered area is a rounded region or a text field, and our scheme has higher PSNR value than Lee's method. During image recovery, we use the image inpainting approach to fill the tampered region of whole image. The experimental result shows that our scheme is effective than Lee's interpolation method.

Integrating Transactions into the Data-Driven Multi-threading Model Using the TFlux Platform

The introduction of multi-core processors has renewed the interest in programming models which can efficiently exploit general purpose parallelism. Data-Flow is one such model which has demonstrated significant potential in the past. However, it is generally associated with functional styles of programming which do not deal well with shared mutable state. There have been a number of attempts to introduce state into Data-Flow models and functional languages but none have proved able to maintain the simplicity and efficiency of pure Data-Flow parallelism. Transactional memory is a concurrency control mechanism that simplifies sharing data when developing parallel applications while at the same time promises to deliver affordable performance. In this paper we report our experience of integrating Transactional Memory and Data-Flow within the TFlux Platform. The ability of the Data-Flow model to expose large amounts of parallelism is maintained while Transactional Memory provides simplified sharing of mutable data in those circumstances where it is important to the expression of the program. The isolation property of transactions ensures that the exploitation of Data-Flow parallelism is not compromised. In this study we extend the TFlux platform, a Data-Driven Multi-threading implementation, to support transactions. We achieve this by proposing new pragmas that allow the programmer to specify transactions. In addition we extend the runtime functionality by integrating a software transactional memory library with TFlux. To test the proposed system, we ported two applications that require transactional memory: Random Counter and Labyrinth an implementation of Lee's parallel routing algorithm. Our results show good opportunities for scaling when using the integration of the two models.

Trade Signing in Fast Markets

This study assesses the reliability of trade signing algorithms in fast trading environments using the NASDAQ HFT dataset. We compare of several variations of the Lee and Ready algorithm and the tick rule in data that contain true trade signs. Using one second resolution data, the Lee and Ready algorithm outperforms the tick rule and classifies trades with an accuracy comparable to that in prior studies from slower trading environments. Using millisecond data, the Lee and Ready algorithm has very high trade classification accuracy and shows little performance degradation in subsamples where the market is particularly fast. In robustness tests in TAQ data, we find no accuracy improvement from millisecond timestamps while the other results hold. We conclude that trade signing is still viable despite the recent evolution towards fast markets, and the use of quote data still increases trade classification accuracy.

Building a Software System Using a Spiral Model to Evaluate the Overall Risk of Projects Using Fuzzy Number Theory

This research aims presented a practical application for the process of assessing the overall risk of the projects following the risk management in software engineering steps, the life cycle is the most famous in this area is a (Spiral Model), this model represented by the core of the process to building a system based on customers information taken from them in the form of hearings conversations. This research depended on EA tool (Enterprise Architect) that building by a company (Sparex Systems) for represent the processes of stages to analysis because it is the basis currently used in the world and the most prevalent and most recently the base idea for this work is found the rate of aggregative risk in project by used fuzzy model for fuzzy number by follow Lee's algorithm. This system has been applied a practical in bank / public administration / northern region of the data / analysis and risk assessment of bank credit / short-term and long-term.

Obstacle Avoidance Procedure and Lee Algorithm Based Path Replanner for Autonomous Mobile Platforms

Abstract The paper proposes solution for two important issues connected to navigation of independent mobile platforms in an unknown environment. First issue relates to obstacle map, estimated based on stereovision images. It provides a basis for further platform path-planning. The main problem that has to be solved in obstacle map derivation is elimination of artifacts resulting from depth estimation. Thus a two-step artifact filtering procedure is proposed, which exploits both within-frame spatial correlations as well as temporal, between-frame correlations to do this task. Second procedure, based on well-known Lees algorithm is designed for obtaining vehicle collisionless path. Such routes need to be updated on-the-fly to take into account moving obstacles or newly detected objects. The main idea of the proposed approach is to identify regions where environment has changed and to execute a procedure of selective path updates. As a result, an optimal path can be derived at a computational expense comparable to the heuristic Lifelong A* search. Experiment results demonstrate efficiency of the two discussed approaches for platform operation control in real environments, where both static and moving obstacles are present.