Search results for "Abstract data type"
showing 10 items of 1140 documents
The set of character degrees of a finite group does not determine its solvability
2014
Semidirect products of internal groupoids
2010
We give a characterization of those finitely complete categories with initial object and pushouts of split monomorphisms that admit categorical semidirect products. As an application we examine the case of groupoids with fixed set of objects. Further, we extend this to the internal case. (C) 2010 Elsevier B.V. All rights reserved.
Datamining: Pemanfaatan Algoritma Apriori dalam Menganalisa Pola-Pola Transaksi yang Terjadi
2012
This paper will be described about implementation and analysis of the well-known apriori algorithm, which is called Market Basket Analysis (MBA) in data mining. This algorithm is widely used to predict the relation among market basket in the huge amount of database. This algorithm is based on the concept of a prefix tree. There are several ways to organize the nodes of such a tree, to encode the items, and to organize the transactions, which may be used in order to minimize the time needed to find the frequent itemsets as well as to reduce the amount of memory needed to store the counters. The rules produced will be used by management of supermarket to organize the items set to increase the…
Condition Assessment of Norwegian Bridge Elements Using Existing Damage Records
2020
The Norwegian Public Roads Administration (NPRA) has recorded bridge element damages in a database for all the bridges it manages since the 1990s. This paper presents a comparison of three methods to establish element condition based on damage records. The methods consist in a non-parametric procedure based on the worst damage registered in the element, linear regression considering also bridge and road characteristics data and classification through an artificial neural network. The methods are assessed using a set of 159 bridges inspected in 2016. The results show that diagnostics of bridge element condition can reach high accuracy by using an artificial neural network classifier and taki…
Trust management in tactical coalition software defined networks
2018
This paper reports from ongoing efforts related to trust management in tactical Software Defined Networks (SDN) when used with mobile nodes in a coalition operation. We analyze the problem space and suggests a set of security and contructional requirements, as well as an analysis on how existing technology may contribute to a solution. The proposed architecture serves as a guide for current and future experimentation on trust management and protection in SDN. The paper also reports from experimental investigations into the utility of these technology elements for the present purpose.
The min-max close-enough arc routing problem
2022
Abstract Here we introduce the Min-Max Close-Enough Arc Routing Problem, where a fleet of vehicles must serve a set of customers while trying to balance the length of the routes. The vehicles do not need to visit the customers, since they can serve them from a distance by traversing arcs that are “close enough” to the customers. We present two formulations of the problem and propose a branch-and-cut and a branch-and-price algorithm based on the respective formulations. A heuristic algorithm used to provide good upper bounds to the exact procedures is also presented. Extensive computational experiments to compare the performance of the algorithms are carried out.
Development of a Design Procedure for Bending Operations
1999
Springback can be considered as one of the most important shape defect in sheet stamping. Such effect results relevant even when simple bending operations are taken into account. In the paper the authors present a design procedure able to provide the proper value of the punch stroke to be applied in order to compensate for elastic springback. In particular two approaches have been followed: firstly an inverse design technique has been utilized in order to find out the response function governing the investigated phenomenon; furthermore neural network techniques have been applied in order to represent the logical link between the input data and the aimed output, i.e. the proper punch stroke …
Solution Using Clustering Methods
1987
The main aim of this analysis is to find out typical morphologies from the multivariate and longitudinal data set on growing children and to describe the morphological evolution of the found groups of girls. The finding out of typical morphologies is, in our opinion, strictly linked to the search of structures in the individuals and in the variables.
PROTEIN SECONDARY STRUCTURE PREDICTION: HOW TO IMPROVE ACCURACY BY INTEGRATION
2006
In this paper a technique to improve protein secondary structure prediction is proposed. The approach is based on the idea of combining the results of a set of prediction tools, choosing the most correct parts of each prediction. The correctness of the resulting prediction is measured referring to accuracy parameters used in several editions of CASP. Experimental evaluations validating the proposed approach are also reported.
Low Dose-Rate, High Total Dose Set-Up for Rad-Hard CMOS I/O Circuits Testing
2017
In this paper, the planning of low dose-rate, high total dose testing campaign for I/O circuits is reported. In particular, the paper describes all development steps, starting from the rad-hard I/O circuits design and the implementation of the test-chip, which is meant to allow comparative testing between rad-hard and standard devices. The designed experimental setup permits in situ measurements, therefore the circuits behavior can be remotely monitored for very long periods. This feature enables low dose-rate testing up to very high dose.