lnu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Time performance comparison in determining the weak parts in wooden logs
Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering. (RICS)
Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering. (RICS)
2009 (English)Independent thesis Advanced level (degree of Master (One Year)), 10 credits / 15 HE creditsStudent thesis
Abstract [en]

The steadily increasing demand of wood forces sawmills to increase the efficiency and effectiveness of their equipments. The weak parts and the twist in wooden logs have been documented as the most common and crucial defect in sawn lumber.

In this thesis we are going to implement a program which is able to determine the weak parts in wooden logs. The implementation will be in two languages C++ and Matlab. Parts of the program are going to be implemented sometimes by C++ and sometimes by Matlab therefore different designs are going to be tested. The aim of this thesis is to check whether these designs will meet the real time bound of 10 m/s.

The result shows that there is a huge difference in time performance for the different designs. Therefore, different discretization levels were used in order to meet the deadline of 10m/s. We found that in order to get better speed one should calculate the matrix for the function F and the Jacobian function J by using C++ not by Matlab. Also we found that when we called functions from one language to another an extra time is added.

Place, publisher, year, edition, pages
2009. , p. 34
Series
Reports from MSI, ISSN 1650-2647
Keywords [en]
Wooden logs, weak parts, Newton-Raphson method, Time comparison
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:vxu:diva-5703ISRN: VXU/MSI/DA/E/--09049/--SEOAI: oai:DiVA.org:vxu-5703DiVA, id: diva2:231978
Presentation
2009-06-08, D1170, D Building, Växjö University, 13:15 (English)
Uppsok
Technology
Supervisors
Examiners
Available from: 2009-08-18 Created: 2009-08-18 Last updated: 2018-01-13Bibliographically approved

Open Access in DiVA

fulltext(1265 kB)1629 downloads
File information
File name FULLTEXT01.pdfFile size 1265 kBChecksum SHA-512
1e644563f3ab5c214e1d867db79a7f4f49570f5fd5d8f03c36e48328371512163985d4b8af03d80be20e25f39a548ffdd374c73d0db78e177397094502dadc2f
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Akhtar, NaeemAlzghoul, Ahmad
By organisation
School of Mathematics and Systems Engineering
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 1629 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 260 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf