Search results for "Slicing"
showing 9 items of 19 documents
Hypertext support for the information needs of software maintainers
2004
Making changes safely to programs requires program comprehension and satisfaction of the information needs of software maintainers. In this paper we provide insights into improving hypertext-based software maintenance support by analyzing those information needs. There exists a series of four earlier, detailed-level empirical studies on the information needs of professional C program maintainers. We focus on these studies, synthesize their results and determine sources from which the required information might be attained. An experimental research tool, the HyperSoft system, is used to demonstrate the satisfaction of information needs and the system is analytically evaluated against the nee…
Filling-in Gaps in Textured Images Using Bit-Plane Statistics
2008
In this paper we propose a novel approach for the texture analysis-synthesis problem, with the purpose to restore missing zones in greyscale images. Bit-plane decomposition is used, and a dictionary is build with bit-blocks statistics for each plane. Gaps are reconstructed with a conditional stochastic process, to propagate texture global features into the damaged area, using information stored in the dictionary. Our restoration method is simple, easy and fast, with very good results for a large set of textured images. Results are compared with a state-of-the-art restoration algorithm.
Restoration of Digitized Damaged Photos using Bit-Plane Slicing
2007
Digital image restoration aims to recover damaged zones of a digital image, using surrounding information. In this paper we propose a novel approach, based on bit-plane slicing decomposition, with the purpose to make information analysis and reconstruction process easy, fast and effective. Tests have been made on digitized damaged old photos to restore several classes of typical defects in old photographic prints.
Firefly algorithm based upon slicing structure encoding for unequal facility layout problem
2019
Finding the locations of departments or machines in a workspace is classified as a Facility Layout Problem. Good placement of departments has a relevant influence on manufacturing costs, work in process, lead times and production efficiency. This paper analyses the problem of allocating departments with restrictions in terms of unequal area and rectangular shape within a facility, in order to minimize the sum of material handling costs taking into account the satisfaction of the aspect ratio requested. In particular, we propose for the first time a Firefly Algorithm based on the slicing structure encoding. The proposed method was tested comparing the results obtained from other authors on t…
A multi objective genetic algorithm for the facility layout problem based upon slicing structure encoding
2012
This paper proposes a new multi objective genetic algorithm (MOGA) for solving unequal area facility layout problems (UA-FLPs). The genetic algorithm suggested is based upon the slicing structure where the relative locations of the facilities on the floor are represented by a location matrix encoded in two chromosomes. A block layout is constructed by partitioning the floor into a set of rectangular blocks using guillotine cuts satisfying the areas requirements of the departments. The procedure takes into account four objective functions (material handling costs, aspect ratio, closeness and distance requests) by means of a Pareto based evolutionary approach. The main advantage of the propos…
Network Slicing Enabled Resource Management for Service-Oriented Ultra-Reliable and Low-Latency Vehicular Networks
2020
Network slicing has been considered as a promising candidate to provide customized services for vehicular applications that have extremely high requirements of latency and reliability. However, the high mobility of vehicles poses significant challenges to resource management in such a stochastic vehicular environment with time-varying service demands. In this paper, we develop an online network slicing scheduling strategy for joint resource block (RB) allocation and power control in vehicular networks. The long-term time-averaged total system capacity is maximized while guaranteeing strict ultra-reliable and low-latency requirements of vehicle communication links, subject to stability const…
Supporting Impact Analysis by Program Dependence Graph Based Forward Slicing
2007
Since software must evolve to meet the typically changing requirements, source code modifications can not be avoided. Impact analysis is one of the central and relatively demanding tasks of software maintenance. It is constantly needed while aiming at ensuring the correctness of the made modifications. Due to its importance and challenging nature automated support techniques are required. Theoretically, forward slicing is a very suitable technique for that purpose. Therefore, we have implemented a program dependence graph (PDG) based tool, called GRACE, for it. For example, due to the typical rewritings of Visual Basic programs there is a great need to support their impact analysis. However…
Modified morphological correlation based on bit-map representations.
1999
Pattern recognition with high discrimination can be achieved with a morphological correlator. A modification of this correlator is carried out by use of a binary slicing process instead of linear thresholding. Although the obtained correlation result is not identical to the conventional morphological correlation, it requires fewer calculations and provides even higher discrimination. Two optical experimental implementations of this modified morphological correlator as well as some experimental results are shown.