Many promising optimization algorithms for solving numerical optimization problems come from population-based metaheuristics. A few of them are based on Swarm-Intelligence Algorithms, which are inspired by the collective behavior of social organisms. One of the most successful of such algorithms is the Differential Ant-Stigmergy Algorithm (DASA), which uses stigmergy, a method of communication in emergent systems where the individual parts of the system communicate with one another by modifying their local environment. The main characteristic of the DASA is its underlying structure (pheromone graph) that uses discrete steps to move through a continuous search space. As a consequence of this the search-space movement is in some way limited and the algorithm’s time/space complexity is increased. In order to overcome the problem an improved algorithm called the Continuous Differential Ant-Stigmergy Algorithm (CDASA) is proposed and then benchmarked on standard benchmark functions. This benchmarking showed that the CDASA performs better than the DASA, especially at lower dimensions, that its time/space complexity is decreased, and that the algorithm code is simplified. As such, the CDASA is more suitable for parallel implementations on General-Purpose Graphic Processing Units. Compared to the Swarm-Intelligence Algorithms presented in this paper, the CDASA is the best-performing algorithm and competitive to the state-of-the-art algorithms belonging to different metaheuristic approaches.
COBISS.SI-ID: 26700327
The development of a simple, adaptive, parameter-less search algorithm was initiated by the need for an algorithm that is able to find optimal solutions relatively quick, and without the need for a control-parameter-setting specialist. Its control parameters are calculated during the optimization process, according to the progress of the search. The algorithm is intended for continuous and combinatorial problems. The efficiency of the proposed parameter-less algorithm was evaluated using one theoretical and three real-world industrial optimization problems. A comparison with other evolutionary approaches shows that the presented adaptive parameter-less algorithm has a competitive convergence with regards to the comparable algorithms. Also, it proves algorithm's ability to finding the optimal solutions without the need for predefined control parameters.
COBISS.SI-ID: 26708007
A hardware accelerator for the compression of LIDAR data has been developed. For this purpose, hardware predictors of the point coordinates and other attributes of LIDAR data were conceived. The predictors of the point coordinates consist of two methods: linear prediction using last coordinate changes, and the search for the closest coordinate change among the most recent coordinate changes. The applied method is dynamically selected based on the resemblance of the current search result. A pipelined hardware divider, required for linear prediction, was also developed. An adjustable pipeline depth enabled us to select the most suitable divider with respect to the dividers’ latency, the usage of the hardware resources, and the clock period. The coordinate prediction and the prediction of other LIDAR data attributes are used in the prediction compression of the LIDAR data. Additionally, a variable length encoder was developed, and the arithmetic coder was improved by using the barrel shifter structure, which resulted in up to 8-times higher data throughput. Modules were developed in the VHDL language and verified in the Cadence simulation environment. Individual modules were synthesized and tested on the Xilinx XUPV5 prototype board.
COBISS.SI-ID: 26726695
A hypercube is one of the widely studied architecture due to its elegant properties. In this paper the resilience to the removal of edges or robustness of network is concerned. The problems of mutually-independent Hamiltonian paths with prescribed end-vertices and mutually-independent s-starting Hamiltonian cycles in the hypercube with faulty edges are studied. The study is motivated by the problem of transferring different pieces of a given message from one vertex to all recipients simultaneously such that they never meet in the same vertex. The obtained results on mutually-independent Hamiltonian paths with prescribed end-vertices is used to prove that there are n-f mutually-independent s-starting Hamiltonian cycles in the n-dimensional hypercube with f faulty edges.
COBISS.SI-ID: 26622247
Background and objectives: The main aim of this study was to validate a nutrient-estimation method applied using OPEN, a Slovenian platform for clinical nutrition. As the most desirable validation is a direct comparison of the calculated values with the values obtained from a chemical analysis of the same food, we performed a chemical analysis and a calculation for a representative set of daily meals (n = 20) and compared the data. The secondary aim was to evaluate the usability of the OPEN for dietary assessment. Methods: We used a Student’s t test to observe any differences between the analysed and calculated nutrient-content data, considering the 0.01 significance level. Results: No statistically significant differences were observed in the mean contents of energy, total dietary fibre, water, macro-nutrients, and selected essential minerals: Ca, Fe, Mg, Zn, Na, P, Cu and I. We notice statistically significant difference in the mean calculated and analytical values of selenium. Conclusions: We noticed remarkable, but not statistically significant, difference in the mean values of iodine (11%). The present study also indicates that the OPEN is a useful and cost-effective tool for both dieticians and patients.
COBISS.SI-ID: 26568231