GeaBios

GeaBios is a free (non-profit) "Slovene Citizen Oriented Information Service", and the name stands for Geo Enabled And Better Internet Oriented Services.

Read about on Wikipedia



Weather forecasting system

Weather Forecast Production System for Environmental Agency of the Republic of Slovenia.

Weather forecasting is the application of science and technology to predict the state of the atmosphere for a future time and a given location. Human beings have attempted to predict the weather informally for millennia, and formally since at least the nineteenth century. Weather forecasts are made by collecting quantitative data about the current state of the atmosphere and using scientific understanding of atmospheric processes to project how the atmosphere will evolve.


Real estate appraisal modeling system

Real estate appraisal modeling system for Geodetic Department of the Slovenian Government.

Real estate appraisal (property valuation and land valuation) is the practice of developing an opinion of the value of real property, usually its market value. The need for appraisals arises from the heterogeneous nature of property as an investment class. No two properties are identical, and all properties differ from each other in their location - which is one of the most important determinants of their value.

Automated valuation models (AVMs) rely on statistical models such as multiple regression analysis, kriging (interpolation), co-kriging, pure geographic information systems (GIS) GRID analysis, logistic models, etc.. These methods are growing in acceptance, gradually. While AVMs can be quite accurate, particularly when used in a very homogeneous area, there is also evidence that AVMs are not accurate in other instances such as when they are used in rural areas, or when the appraised property does not conform well to the neighborhood.

The Computer Assisted Mass Appraisal (CAMA) Modeling System is specifically designed to satisfy Assessor’s requirements, Mortgage Loan requirements directive (Basel II), Expropriation of property (request of Surveying and Mapping Authority of the Republic of Slovenia, supervisor Lantmäteriet Sweden), based on Hybrid models (multiple regression analysis, local robust multiple regresion analysis, thin plate spline interpolation on one or more independent variables, social-economic factors, etc.). The system provides modeling on market, income and other approaches utilized in determining the value of residential, commercial, industrial, agricultural and special purpose real estate properties.



PCBCAD

PCBCAD, statical analysis of prestressed concrete bridges.


Industry 4.0

Job Shop Scheduling - automatic decision making according to data, conditions, hard and soft constraints, cost and time multi criteria optimization.

Move cursor over GANT to get info or click on red rectangle © 2017, ACADEMA Ltd. 0 12 24 36 48 60 72 84 96 108 120 132 144 156 168 m0 m1 m2 m3 m4 m10 m11 m5 m12 m6 m13 m7 m8 m14 m9 m15 m1 m3 m6 m6 m2 m1 m2 j0 j1 j10 j11 j102 j103 j104 j106 j109 j111 j128 j137 j116 j131 j115 j121 j112 j165 j144 j117 j146 j159 j119 j160 j100 j107 j171 j136 j138 j108 j110 j127 j101 j118 j169 j122 j149 j114 j14 j29 j147 j163 j150 j120 j124 j172 j18 j151 j13 j123 j130 j126 j135 j105 j162 j12 j125 j152 j41 j166 j148 j25 j35 j129 j168 j132 j30 j141 j142 j155 j140 j133 j161 j24 j175 j39 j113 j139 j176 j4 j15 j134 j170 j16 j36 j40 j46 j50 j28 j145 j177 j19 j51 j54 j178 j38 j143 j156 j173 j22 j47 j154 j58 j153 j23 j164 j34 j44 j179 j6 j17 j33 j72 j157 j167 j26 j49 j57 j64 j73 j63 j79 j52 j75 j27 j67 j8 j32 j37 j59 j158 j2 j53 j7 j43 j42 j5 j3 j31 j48 j61 j80 j74 j55 j69 j174 j45 j20 j83 j71 j76 j85 j66 j56 j62 j68 j90 j77 j92 j21 j91 j96 j99 j95 j81 j70 j94 j82 j97 j9 j65 j98 j60 j93 j87 j89 j78 j86 j88 j84 Job Shop Scheduling (mach.=16,jobs=180,cost=31947€/43167€ (74.01%),tard.=4) Sol.:45/48 Sorry, your browser does not support inline SVG.

Example above: 16 working machines, 180 jobs, time 168 hours (1 week), several jobs connected, deadlines defined for all jobs except those connected, several machines (flashing red) excluded for certain interval of time. Cost and tardiness minimization

Move cursor over GANT to get info or click on red rectangle © 2017, ACADEMA Ltd. 0 12 24 36 48 60 72 84 96 108 120 132 144 156 168 m10 m11 m12 m13 m14 m15 m16 m17 m30 m31 m18 m32 m19 m33 m34 m35 m36 m37 m38 m39 m20 m21 m22 m23 m24 m25 m26 m27 m28 m29 m0 m1 m2 m3 m4 m5 m6 m7 m8 m9 m4 m7 m8 m8 m3 m2 m2 m5 m0 m3 j0 j1 j10 j12 j13 j21 j100 j101 j102 j105 j107 j109 j110 j113 j114 j116 j124 j131 j135 j145 j147 j148 j152 j155 j173 j182 j185 j11 j22 j119 j128 j142 j165 j193 j203 j117 j129 j126 j127 j172 j115 j244 j139 j168 j196 j118 j122 j167 j274 j108 j144 j178 j106 j143 j225 j187 j197 j17 j176 j181 j123 j130 j161 j186 j212 j233 j133 j120 j121 j138 j141 j156 j199 j222 j19 j111 j112 j227 j307 j330 j132 j136 j177 j191 j223 j14 j183 j163 j180 j271 j32 j134 j159 j217 j302 j15 j140 j153 j194 j254 j103 j125 j154 j174 j205 j242 j243 j277 j24 j137 j160 j218 j258 j16 j27 j211 j158 j164 j175 j219 j238 j281 j150 j166 j201 j270 j371 j169 j232 j283 j292 j146 j162 j216 j282 j319 j157 j200 j224 j311 j184 j220 j248 j20 j188 j213 j215 j308 j190 j192 j272 j301 j195 j221 j259 j207 j264 j104 j149 j179 j210 j279 j320 j171 j305 j317 j170 j206 j226 j228 j239 j377 j249 j250 j300 j356 j263 j23 j294 j361 j209 j151 j189 j231 j241 j253 j322 j334 j348 j299 j276 j234 j235 j260 j198 j240 j245 j306 j204 j286 j339 j18 j214 j255 j265 j285 j208 j236 j332 j25 j318 j327 j362 j374 j267 j273 j313 j290 j2 j340 j351 j31 j237 j246 j256 j331 j345 j354 j230 j261 j269 j408 j29 j202 j289 j347 j396 j366 j388 j365 j229 j275 j284 j266 j297 j383 j417 j287 j28 j304 j346 j369 j393 j257 j247 j288 j350 j352 j395 j399 j406 j34 j325 j397 j291 j336 j349 j389 j252 j262 j309 j335 j293 j26 j35 j268 j298 j312 j278 j324 j338 j419 j41 j363 j400 j412 j328 j385 j411 j3 j59 j251 j378 j61 j316 j344 j359 j403 j405 j407 j386 j392 j295 j315 j390 j321 j329 j418 j58 j296 j326 j401 j452 j280 j379 j355 j367 j314 j333 j414 j30 j36 j409 j4 j357 j391 j421 j303 j343 j430 j433 j43 j337 j37 j50 j413 j428 j45 j451 j39 j63 j70 j96 j353 j384 j415 j436 j33 j78 j90 j381 j404 j42 j410 j432 j435 j364 j341 j323 j380 j422 j442 j372 j52 j373 j342 j71 j368 j370 j438 j7 j423 j446 j360 j92 j97 j310 j40 j64 j73 j38 j46 j68 j387 j448 j74 j444 j8 j53 j89 j416 j424 j425 j431 j450 j9 j49 j69 j77 j98 j398 j420 j447 j457 j44 j394 j67 j91 j358 j439 j458 j376 j459 j86 j375 j382 j454 j429 j437 j441 j54 j47 j62 j85 j449 j402 j55 j95 j445 j434 j60 j93 j426 j440 j76 j6 j57 j72 j75 j79 j443 j66 j427 j51 j81 j83 j87 j453 j456 j65 j48 j82 j94 j5 j56 j80 j455 j88 j99 j84 Job Shop Scheduling (mach.=40,jobs=460,cost=84066€/107044€ (78.53%),tard.=0) Sol.:33/77 Sorry, your browser does not support inline SVG.

Example above: 40 working machines, 460 jobs, time 168 hours (1 week), several jobs connected, deadlines defined for all jobs except those connected, several machines (flashing red) excluded for certain interval of time. Cost and tardiness minimization

Read more.

2D strip packing - automatic decision making according to data and conditions, material use optimization

Move cursor over PANEL to get info © 2017, ACADEMA Ltd. 0 10 20 30 40 50 60 70 80 90 100 110 120 0 10 20 30 40 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 2D Strip Packing (No. of rectangles = 160 Width = 127 Height = 40 (98.58%)) Sol.=4/4 Sorry, your browser does not support inline SVG.

160 rectangles packed in strip 40cm wide, optimization of length.


Graph / Multigraph Fuzzy Search

Linked data are structured graph, so if we want to do something with, we have to enable calculus on. The graph isomorphism, subgraph isomorphism, and graph edit distance problems are combinatorial problems with many applications. Heuristic exact and approximate algorithms foreach of these problems have been developed for different kinds of graphs: directed, undirected, labeled, etc. However, additional work is often needed to adapt such algorithms to different classes of graphs, for example to accommodate both labels and property annotations on nodes and edges.

We create Generalized Model to calculate the graph isomorphism, subgraph isomorphism, and graphedit distance problems, it is obvious that such a presentation can cover search of multi-graph/graph similarities. The model consists of labeled nodes and labeled directed/undirected edges, every node/edge has multiple properties, as key-value pairs, where the value can be single value or interval (like process tolerance, minimum and maximum, etc.). Certain nodes/edges have importance, so we have hard and soft constraints, and the minimization offers a set of answers.

Examples have small amount of nodes and directed edges, to generate a nice layout for large graphs takes time.