Abstract: The need to merge software artifacts seems inherent
to modern software development. Distribution of development over
several teams and breaking tasks into smaller, more manageable
pieces are an effective means to deal with the kind of complexity. In
each case, the separately developed artifacts need to be assembled as
efficiently as possible into a consistent whole in which the parts still
function as described. In addition, earlier changes are introduced into
the life cycle and easier is their management by designers.
Interaction-based specifications such as UML sequence diagrams
have been found effective in this regard. As a result, sequence
diagrams can be used not only for capturing system behaviors but
also for merging changes in order to create a new version. The
objective of this paper is to suggest a new approach to deal with the
problem of software merging at the level of sequence diagrams by
using the concept of dependence analysis that captures, formally, all
mapping, and differences between elements of sequence diagrams
and serves as a key concept to create a new version of sequence
diagram.
Abstract: A new approach has been developed to estimate the
load share and distribution of worm gear drives, and to calculate the
instantaneous tooth meshing stiffness. In the approach, the worm gear
drive was modelled as a series of spur gear slices, and each slice was
analyzed separately using the well-established formulae of spur gear
loading and stresses. By combining the results obtained for all slices,
the entire envolute worm gear set loading and stressing was obtained. The geometric modelling method presented allows tooth elastic
deformation and tooth root stresses of worm gear drives under
different load conditions to be investigated. Based on the slicing
method introduced in this study, the instantaneous meshing stiffness
and load share are obtained. In comparison with existing methods,
this approach has both good analysis accuracy and less computing
time.
Abstract: When printing a plate (or dish) by an FDM 3D printer,
the process normally requires support material, which causes several
problems. This paper proposes a method for forming thin plates
without using wasteful support material. This method requires several
extraordinary parameter values when slicing plates. The experiments
show that the plates can, for the most part, be successfully formed
using a conventional slicer and a 3D printer; however, seams between
layers spoil them and the quality of printed objects strongly depends
on the slicer.
Abstract: Floorplanning plays a vital role in the physical design
process of Very Large Scale Integrated (VLSI) chips. It is an
essential design step to estimate the chip area prior to the optimized
placement of digital blocks and their interconnections. Since VLSI
floorplanning is an NP-hard problem, many optimization techniques
were adopted in the literature. In this work, a music-inspired
Harmony Search (HS) algorithm is used for the fixed die outline
constrained floorplanning, with the aim of reducing the total chip
area. HS draws inspiration from the musical improvisation process of
searching for a perfect state of harmony. Initially, B*-tree is used to
generate the primary floorplan for the given rectangular hard
modules and then HS algorithm is applied to obtain an optimal
solution for the efficient floorplan. The experimental results of the
HS algorithm are obtained for the MCNC benchmark circuits.
Abstract: Experimental study on slicing of sapphire with fixed
abrasive diamond wire saw was conducted in this paper. The process
parameters were optimized through orthogonal experiment of three
factors and four levels. The effects of wire speed, feed speed and
tension pressure on the surface roughness were analyzed. Surface
roughness in cutting direction and feed direction were both detected.
The results show that feed speed plays the most significant role on the
surface roughness of sliced sapphire followed by wire speed and
tension pressure. The optimized process parameters are as follows:
wire speed 1.9 m/s, feed speed 0.187 mm/min and tension pressure
0.18 MPa. In the end, the results were verified by analysis of variance.
Abstract: Steganography is the art and science that hides the information in an appropriate cover carrier like image, text, audio and video media. In this work the authors propose a new image based steganographic method for hiding information within the complex bit planes of the image. After slicing into bit planes the cover image is analyzed to extract the most complex planes in decreasing order based on their bit plane complexity. The complexity function next determines the complex noisy blocks of the chosen bit plane and finally pixel mapping method (PMM) has been used to embed secret bits into those regions of the bit plane. The novel approach of using pixel mapping method (PMM) in bit plane domain adaptively embeds data on most complex regions of image, provides high embedding capacity, better imperceptibility and resistance to steganalysis attack.
Abstract: The aim of this paper is image encryption using Genetic Algorithm (GA). The proposed encryption method consists of two phases. In modification phase, pixels locations are altered to reduce correlation among adjacent pixels. Then, pixels values are changed in the diffusion phase to encrypt the input image. Both phases are performed by GA with binary chromosomes. For modification phase, these binary patterns are generated by Local Binary Pattern (LBP) operator while for diffusion phase binary chromosomes are obtained by Bit Plane Slicing (BPS). Initial population in GA includes rows and columns of the input image. Instead of subjective selection of parents from this initial population, a random generator with predefined key is utilized. It is necessary to decrypt the coded image and reconstruct the initial input image. Fitness function is defined as average of transition from 0 to 1 in LBP image and histogram uniformity in modification and diffusion phases, respectively. Randomness of the encrypted image is measured by entropy, correlation coefficients and histogram analysis. Experimental results show that the proposed method is fast enough and can be used effectively for image encryption.
Abstract: Program slicing is the task of finding all statements in
a program that directly or indirectly influence the value of a variable
occurrence. The set of statements that can affect the value of a
variable at some point in a program is called a program backward
slice. In several software engineering applications, such as program
debugging and measuring program cohesion and parallelism, several
slices are computed at different program points. The existing
algorithms for computing program slices are introduced to compute a
slice at a program point. In these algorithms, the program, or the
model that represents the program, is traversed completely or
partially once. To compute more than one slice, the same algorithm
is applied for every point of interest in the program. Thus, the same
program, or program representation, is traversed several times.
In this paper, an algorithm is introduced to compute all forward
static slices of a computer program by traversing the program
representation graph once. Therefore, the introduced algorithm is
useful for software engineering applications that require computing
program slices at different points of a program. The program
representation graph used in this paper is called Program Dependence
Graph (PDG).
Abstract: Although the STL (stereo lithography) file format is
widely used as a de facto industry standard in the rapid prototyping
industry due to its simplicity and ability to tessellation of almost all
surfaces, but there are always some defects and shortcoming in their
usage, which many of them are difficult to correct manually. In
processing the complex models, size of the file and its defects grow
extremely, therefore, correcting STL files become difficult. In this
paper through optimizing the exiting algorithms, size of the files and
memory usage of computers to process them will be reduced. In spite
of type and extent of the errors in STL files, the tail-to-head
searching method and analysis of the nearest distance between tails
and heads techniques were used. As a result STL models sliced
rapidly, and fully closed contours produced effectively and errorless.
Abstract: In this paper, an experimentation to enhance the
visibility of hot objects in a thermal image acquired with ordinary
digital camera is reported, after the applications of lowpass and
median filters to suppress the distracting granular noises. The
common thresholding and slicing techniques were used on the
histogram at different gray levels, followed by a subjective
comparative evaluation. The best result came out with the threshold
level 115 and the number of slices 3.
Abstract: The purpose of study was to design and construction
the semi-automatic sliced ginger machine for reduce production times
in sheet and slice ginger procedure furthermore, reduced amount of
labor of slides and cutting method. Take consider into clean and safety of workers and consumers. The principle of machines, used 1
horsepower motor, rotation speed of sliced blade 967 rpm, the diameter of sliced dish 310 mm, consists of 2 blades for sheet cutting
ginger and the power from motor which transfer to rotate the sliced blade roller, rotation speed 440 rpm. The slice cutter roller was sliced
ginger from sheet ginger to line ginger. The conveyer could
adjustment level of motors, used to the beginning area that sheet
ginger was transference to the roller for sheet and sliced cutting in next process. The cover of sliced cutting had channel for 1 tuber of
ginger. The semi-automatic sliced ginger machine could produced sheet ginger 81.8 kg/h (6.2 times of labor) and line ginger 17.9 kg/h
(2.5 times of labor) compare with, labor work could produced sheet
ginger 13.2 kg/h and line ginger 7.1 kg/h, and when timekeeper, the
total times of semi auto machine 30.86 kg/h and labor 4.6 kg/h, there
for the semi auto machine was 6.7 times of labor. The semiautomatic
sliced ginger machine convenient, easy for use and
maintain, in addition to reduce fatigue of body and seriousness from
works; must be used high skill, and protection accident in slicing
procedure. Beside, machine could used with other vegetables for
example potato, carrot .etc
Abstract: Program slicing is the task of finding all statements in a program that directly or indirectly influence the value of a variable occurrence. The set of statements that can affect the value of a variable at some point in a program is called a program slice. In several software engineering applications, such as program debugging and measuring program cohesion and parallelism, several slices are computed at different program points. In this paper, algorithms are introduced to compute all backward and forward static slices of a computer program by traversing the program representation graph once. The program representation graph used in this paper is called Program Dependence Graph (PDG). We have conducted an experimental comparison study using 25 software modules to show the effectiveness of the introduced algorithm for computing all backward static slices over single-point slicing approaches in computing the parallelism and functional cohesion of program modules. The effectiveness of the algorithm is measured in terms of time execution and number of traversed PDG edges. The comparison study results indicate that using the introduced algorithm considerably saves the slicing time and effort required to measure module parallelism and functional cohesion.
Abstract: We describe a novel method for removing noise (in wavelet domain) of unknown variance from microarrays. The method is based on the following procedure: We apply 1) Bidimentional Discrete Wavelet Transform (DWT-2D) to the Noisy Microarray, 2) scaling and rounding to the coefficients of the highest subbands (to obtain integer and positive coefficients), 3) bit-slicing to the new highest subbands (to obtain bit-planes), 4) then we apply the Systholic Boolean Orthonormalizer Network (SBON) to the input bit-plane set and we obtain two orthonormal otput bit-plane sets (in a Boolean sense), we project a set on the other one, by means of an AND operation, and then, 5) we apply re-assembling, and, 6) rescaling. Finally, 7) we apply Inverse DWT-2D and reconstruct a microarray from the modified wavelet coefficients. Denoising results compare favorably to the most of methods in use at the moment.