hkr.sePublications
Change search
Refine search result
123 1 - 50 of 113
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • 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
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 1.
    Aghi, Nawar
    et al.
    Kristianstad University, Faculty of Natural Science.
    Abdulal, Ahmad
    Kristianstad University, Faculty of Natural Science.
    House Price Prediction2020Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    This study proposes a performance comparison between machine learning regression algorithms and Artificial Neural Network (ANN). The regression algorithms used in this study are Multiple linear, Least Absolute Selection Operator (Lasso), Ridge, Random Forest. Moreover, this study attempts to analyse the correlation between variables to determine the most important factors that affect house prices in Malmö, Sweden. There are two datasets used in this study which called public and local. They contain house prices from Ames, Iowa, United States and Malmö, Sweden, respectively.The accuracy of the prediction is evaluated by checking the root square and root mean square error scores of the training model. The test is performed after applying the required pre-processing methods and splitting the data into two parts. However, one part will be used in the training and the other in the test phase. We have also presented a binning strategy that improved the accuracy of the models.This thesis attempts to show that Lasso gives the best score among other algorithms when using the public dataset in training. The correlation graphs show the variables' level of dependency. In addition, the empirical results show that crime, deposit, lending, and repo rates influence the house prices negatively. Where inflation, year, and unemployment rate impact the house prices positively.

    Download full text (pdf)
    fulltext
  • 2.
    Alassadi, Abdulrahman
    et al.
    Kristianstad University, Faculty of Natural Science.
    Ivanauskas, Tadas
    Kristianstad University, Faculty of Natural Science.
    Classification Performance Between Machine Learning and Traditional Programming in Java2019Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    This study proposes a performance comparison between two Java applications with two different programming approaches, machine learning, and traditional programming. A case where both machine learning and traditional programming can be applied is a classification problem with numeric values. The data is heart disease dataset since heart disease is the leading cause of death in the USA. Performance analysis of both applications is carried to state the differences in four main points; the development time for each application, code complexity, and time complexity of the implemented algorithms, the classification accuracy results, and the resource consumption of each application. The machine learning Java application is built with the help of WEKA library and using its NaiveBayes class to build the model and evaluate its accuracy. While the traditional programming Java application is built with the help of a cardiologist as an expert in the field of the problem to identify the injury indications values. The findings of this study are that the traditional programming application scored better performance results in development time, code complexity, and resource consumption. It scored a classification accuracy of 80.2% while the Naive Bayes algorithms in the machine learning application scored an accuracy of 85.51% but on the expense of high resource consumption and execution time.

    Download full text (pdf)
    fulltext
  • 3.
    Alm, Robert
    et al.
    Kristianstad University, Faculty of Natural Sciences.
    Imeri, Lavdim
    Kristianstad University, Faculty of Natural Sciences.
    A performance comparison between graph databases: Degree project about the comparisonbetween Neo4j, GraphDB and OrientDB on different operations2021Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    In this research we study what is the theoretical complexity of Neo4J, OrientDB and GraphDB, (three known Graph Databases that can be accessed by a Java instance), and how this complexity is manifested in a real life performance, To study their practical performance, a software was implemented and named as a profiler, which is capable to profile, (to record the time that is needed), each operation, and display the results in an accurate and organized manner. The technical documentation of those 3 databases was reviewed as well, to identify how the databases work, and what are their strong and weak points. By the profiling process, the best performance was displayed by Neo4J, and while OrientDB failed to deliver, GraphDB takes the second place in terms of performance. We can identify a potential in OrientDB’s approach, but its structure is too complex and rigid. Neo4J has a robust structure and an architecture that gives to it a great performance, while the Cypher syntax, which Neo4J uses, minimizes the possibility of human error. GraphDB is optimized for large scale public-data operations but performs well as a stand-alone solution as well.

    Download full text (pdf)
    FinalThesis-Alm-Imeri
  • 4.
    Andersson, Anders-Petter
    et al.
    Kristianstad University, School of Health and Society.
    Cappellen, Birgitta
    The Oslo School of Architecture and Design.
    Same but different: composing for interactivity2008In: Audio Mostly Conference: A Conference on Interaction with Sound, October 22-23 2011, Luleå University, Interactive Institute, Sonic, 2008, p. 80-85Conference paper (Refereed)
    Abstract [en]

    Based on experiences from practical design work, we try to show, what we believe, are the similarities and differences, between composing music for interactive media compared to linear music. In our view, much is the same, built on traditions that have been around for centuries within music and composition. The fact that the composer writes programming code is an essential difference. Instead of writing one linear work, he creates infinite numbers of potential musics that reveal themselves as answers to user interactions in many situations. Therefore, we have to broaden our perspectives. We have to put forward factors that earlier was implicit in the musical and music making situations, no matter if it was the concert hall, the church, or the club. When composing interactive music we have to consider the genre, the potential roles the listener might take, and the user experience in different situations.

    Download full text (pdf)
    FULLTEXT01
  • 5.
    Andersson, Tobias
    et al.
    Kristianstad University, Faculty of Natural Sciences.
    Reinholdsson, Håkan
    Kristianstad University, Faculty of Natural Sciences.
    REST API vs GraphQL: A literature and experimental study2021Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    The purpose of this study is to compare the two architectural techniques REST and GraphQL. This thesis will compare the two techniques and what defines them. A literature study and experimental study are carried out by the researchers. Four applications have been developed that include the ability to disable and to enable caching for both technologies to test the performance effect of caching. Earlier work has not covered the effects on caching related to these two frameworks. The literature study results point to that REST services are up to date and GraphQL is a technique with a shorter history, but that has declared growth in the industry and is a well suited choice for example when bandwidth matters in mobile phone applications. In the experimental study the tests showed slightly better results on average for REST API in terms of total response time (ms). Depending on the intended project there are many factors that need to be evaluated before making a decision on which framework to use. 

    Download full text (pdf)
    fulltext
  • 6.
    Arvidsson, Åke
    et al.
    Kristianstad University, Faculty of Natural Science, Research environment of Computer science (RECS). Kristianstad University, Faculty of Natural Science, Avdelningen för datavetenskap.
    Grinnemo, Karl-Johan
    Karlstads universitet.
    Chen, Eric Zhi
    Kristianstad University, Faculty of Natural Science, Avdelningen för datavetenskap. Kristianstad University, Faculty of Natural Science, Research environment of Computer science (RECS).
    Wang, Qinghua
    Kristianstad University, Faculty of Natural Science, Research environment of Computer science (RECS). Kristianstad University, Faculty of Natural Science, Avdelningen för datavetenskap.
    Brunström, Anna
    Karlstads universitet.
    Web metrics for the next generation performance enhancing proxies2019In: 2019 27TH INTERNATIONAL CONFERENCE ON SOFTWARE, TELECOMMUNICATIONS AND COMPUTER NETWORKS (SOFTCOM) / [ed] Begusic, D Rozic, N Radic, J Saric, M, IEEE , 2019, p. 171-176Conference paper (Refereed)
    Abstract [en]

    The fast growth of Internet traffic, the growing importance of cellular accesses and the escalating competition between content providers and network operators result in a growing interest in improving network performance and user experience. In terms of network transport, different solutions ranging from tuning TCP to installing middleboxes are applied. It turns out, however, that the practical results sometimes are disappointing and we believe that poor testing is one of the reasons for this. Indeed, many cases in the literature limit testing to the simple and rare use case of a single file download, while common and complex use cases like web browsing often are ignored or modelled only by considering smaller files. To facilitate better testing, we present a broader view which includes domain counts, flow counts and different forms of concurrency to better characterise the complexity around web pages, and from which the potential for different optimisation techniques can be estimated. We also derive numerical values of these metrics for a small set of popular web pages and study similarities and differences between pages with the same kind of content (newspapers, e-commerce and video) and between pages designed for the same platform (computer and smartphone).

  • 7.
    Arvidsson, Åke
    et al.
    Kristianstad University, Faculty of Natural Sciences, Avdelningen för datavetenskap. Kristianstad University, Faculty of Natural Sciences, Research environment of Computer science (RECS).
    Ivanovich, Milosh
    Australien.
    Fitzpatrick, Paul
    Australien.
    Modelling user experience of adaptive streaming video over fixed capacity links2021In: Performance evaluation (Print), ISSN 0166-5316, E-ISSN 1872-745X, Vol. 148, p. 1-12, article id 102199Article in journal (Refereed)
    Abstract [en]

    Streaming video continues to experience unprecedented growth. This underscores the need to identify user-centric performance measures and models that will allow operators to satisfy requirements for cost-effective network dimensioning delivered with an acceptable level of user experience. This paper presents an analysis of two novel metrics in the context of fixed capacity links: (i) the average proportion of a video’s playing time during which the quality is reduced and (ii) the average proportion of videos which experience reduced quality at least once during their playing time, based on an M/M/∞ system. Our analysis is shown to hold for the more general M/G/∞ system for metric (i), but not for (ii) and simulation studies show an unexpected form of sensitivity of metric (ii) to the flow duration distribution, contrary to the norm of increasing variance causing worse performance. At typical operational loads these new metrics provide a more sensitive and information rich guide for understanding how user experience degrades, than the widely used average throughput metric does. We further show that only the combined use of this existing and our new metrics can provide a holistic perspective on overall user performance.

    Download full text (pdf)
    fulltext
  • 8.
    Atxutegi, Eneko
    et al.
    Spanien.
    Grinnemo, Karl-Johan
    Karlstads universitet.
    Izurza, Andoni
    Spanien.
    Arvidsson, Åke
    Kristianstad University, School of Health and Society, Avdelningen för Design och datavetenskap.
    On the move with TCP in current and future mobile networks2017In: Proceedings of the 8th International Conference on the Network of the Future, London, United Kingdom, November 2017, 2017Conference paper (Other academic)
    Abstract [en]

    Mobile wireless networks constitute an indispensable part of the global Internet, and with TCP the dominating transport protocol on the Internet, it is vital that TCP works equally well over these networks as over wired ones. This paper identifies the performance dependencies by analyzing the responsiveness of TCP NewReno and TCP CUBIC when subject to bandwidth variations related to movements in different directions. The presented evaluation complements previous studies on 4G mobile networks in two important ways: It primarily focuses on the behavior of the TCP congestion control in medium- to high-velocity mobility scenarios, and it not only considers the current 4G mobile networks, but also low latency configurations that move towards the overall potential delays in 5G networks. The paper suggests that while both CUBIC and NewReno give similar goodput in scenarios where the radio channel continuously degrades, CUBIC gives a significantly better goodput in scenarios where the radio channel quality continuously increases. This is due to CUBIC probing more aggressively for additional bandwidth. Important for the design of 5G networks, the obtained results also demonstrate that very low latencies are capable of equalizing the goodput performance of different congestion control algorithms. Only in low latency scenarios that combine both large fluctuations of available bandwidths and a mobility pattern in which the radio channel quality continuously increases can some performance differences be noticed.

  • 9.
    Bao, Leiming
    et al.
    Kristianstad University, School of Health and Society.
    Sun, Chunyan
    Kristianstad University, School of Health and Society.
    Human-Computer Interaction in a Smart House2012Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    The quality attribute concerning usability is generally of significant importance to systems. The area of Human Computer Interaction, HCI, especially handles several usability aspects. This degree project emphasizes HCI in a context of, so called, Smart House. The report is divided into three main sections: theory, application, and measurement results. In the theory section we will present about the context of HCI and the content of HCI, such as HCI model and goals of HCI design. In the application section we discuss the use of mobile phones as a device to remotely control devices of smart houses, and present a system developed to support such services. In order to make the system more attractive, we decided to design it for two categories of operations, menu operation and direct-touch operation mode. Finally, we have used questionnaires for reasons of measuring user satisfaction. Through investigation and analysis of the result of this, we come to the conclusion that system usability is good.

    Download full text (pdf)
    fulltext
  • 10.
    Bengtsson, Filip
    et al.
    Kristianstad University, Faculty of Natural Science.
    Madrusan, Matteo
    Kristianstad University, Faculty of Natural Science.
    Near Field Communication Security concerns & applicable security in Android2020Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    Near Field Communication (NFC) is being used more frequent in smart devices, this raises security concerns whether the users information is secure from attackers. The thesis examines the threats that NFC on Android smartphones are exposed to, its countermeasures, as well as existing protocols that ensures the integrity and confidentiality of the users data. The results were achieved by a literature study, a questionnaire sent to companies that create products related to the subject as well as an experiment that was divided into two parts. The first part examined what information can be extracted from a debit card stored on an Android smartphone. The second part included a relay attack in which a purchase would be made with a victim’s debit card by using Android smartphones. The results shows that it is difficult to conduct any attack on the smart devices because of the limited range of NFC as well as the protocols available for making purchases with debit cards stored on smart devices disallows unauthorized applications and hardware to attack cards stored in smart devices.

    Download full text (pdf)
    fulltext
  • 11.
    Bisiach, Jonathon
    et al.
    Kristianstad University, Faculty of Natural Science.
    Zabkar, Matej
    Kristianstad University, Faculty of Natural Science.
    Evaluating Methods for Optical Character Recognition on a Mobile Platform: comparing standard computer vision techniques with deep learning in the context of scanning prescription medicine labels2020Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    Deep learning has become ubiquitous as part of Optical Character Recognition (OCR), but there are few examples of research into whether the two technologies are feasible for deployment on a mobile platform. This study examines which particular method of OCR would be best suited for a mobile platform in the specific context of a prescription medication label scanner. A case study using three different methods of OCR – classic computer vision techniques, standard deep learning and specialised deep learning – tested against 100 prescription medicine label images shows that the method that provides the best combination of accuracy, speed and resource using has proven to be standard seep learning, or Tesseract 4.1.1 in this particular case. Tesseract 4.1.1 tested with 76% accuracy with a further 10% of results being one character away from being accurate. Additionally, 9% of images were processed in less than one second and 41% were processed in less than 10 seconds. Tesseract 4.1.1 also had very reasonable resource costs, comparable to methods that did not utilise deep learning.

    Download full text (pdf)
    fulltext
  • 12.
    Buono, Vincenzo
    et al.
    Kristianstad University, Faculty of Natural Sciences.
    Petrovic, Petar
    Kristianstad University, Faculty of Natural Sciences.
    Enhance Inter-service Communication in Supersonic K-Native REST-based Java Microservice Architectures2021Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    The accelerating progress in network speeds and computing power permitted the architectural design paradigm to shift from monolithic applications to microservices. The industry moved from single-core and multi-threads, code-heavy applications, running on giant machines 24/7 to smaller machines, multi-cores single threads where computing power and memory consumption are managed very critically. With the advent of this novel approach to designing systems, traditional multi-tier applications have been broken down into hundreds of microservices that can be easily moved around, start, and stop quickly. In this context, scaling assumed a new meaning, rather than scaling up by adding more resources or computing power, now systems are scaled dynamically by adding more microservices instances. This contribution proposes a theoretical study and a practical experiment to investigate, compare and outline the performance improvements aid by the implementation of Protocol Buffers, Google's language-neutral, binary-based representational data interchange format over traditional text-based serialization formats in a modern, Cloud-Native, REST-based Java Microservice architecture. Findings are presented showing promising results regarding the implementation of Protobuf, with a significant reduction in response time (25.1% faster in the best-case scenario) and smaller payload size (72.28% better in the best-case scenario) when compared to traditional textual serialization formats while literature revealed out-of-the-box mechanisms for message versioning with backward compatibility.

    Download full text (pdf)
    fulltext
  • 13.
    Carlsson, Bengt
    et al.
    Blekinge Institute of Technology.
    Jönsson, K. Ingemar
    Lund University.
    Differences between the iterated prisoner's dilemma and the chicken game under noisy conditions2002Conference paper (Other academic)
    Abstract [en]

    The prisoner's dilemma has evolved into a standard game for analyzing the success of cooperative strategies in repeated games. With the aim of investigating the behavior of strategies in some alternative games we analyzed the outcome of iterated games for both the prisoner's dilemma and the chicken game. In the chicken game, mutual defection is punished more strongly than in the prisoner's dilemma, and yields the lowest fitness. We also ran our analyses under different levels of noise. The results reveal a striking difference in the outcome between the games. Iterated chicken game needed more generations to find a winning strategy. It also favored nice, forgiving strategies able to forgive a defection from an opponent. In particular the well-known strategy tit-for-tat has a poor successrate under noisy conditions. The chicken game conditions may be relatively common in other sciences, and therefore we suggest that this game should receive more interest as a cooperative game from researchers within computer science.

  • 14.
    Casian, Andrei
    et al.
    Kristianstad University, Faculty of Natural Science.
    Zannato, Martin
    Kristianstad University, Faculty of Natural Science.
    Predicting Teamfight Tactics Results with Machine Learning Techniques2020Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    The scope of this thesis is to determine whether Machine Learning techniques used in predictingtraditional sports results are relevant in predicting electronic sports results. Moreover, it exploreswhether there is a hidden pattern in a team that leads to a win rather than just plain team composition.The selected video game from electronic sports was Teamfight Tactics. The literature study wasconducted on journals, articles and projects that predicted traditional sports outcomes, from which theMachine Learning models were collected. Literature concerning Machine Learning algorithms, theiradvantages and caveats was studied as well for the scientific background and implementation. Finallythe experiment consisted in implementing models identified in literature study and analyzing the results.The experiment showed that predicting electronic sports with Machine Learning techniques used intraditional sports is not only relevant but also more accurate, due to the complex nature of the videogame and data availability which yields a dataset with high dimensionality and data points.The secondpart of the experiment showed that indeed there is a pattern in a team that leads to higher winningchances. It was demonstrated by encoding the dataset with word2vec (encoder used in naturallanguage processing) and visualizing the data through the Embedding Projector (a tool that showspatterns in data through clusters)

    Download (pdf)
    fulltext
  • 15.
    Chen, Eric Zhi
    Kristianstad University, School of Health and Society, Avdelningen för Design och datavetenskap.
    Constructions of 2-generator quasi-cyclic codes2006In: Proceedings of the tenth International Workshop on Algebraic and Combinatorial Coding Theory, Zvenigorod: Institute of Information Transmission Problems of Russian Academy of Sciences , 2006, p. 60-63Conference paper (Refereed)
  • 16.
    Chen, Eric Zhi
    Kristianstad University, School of Health and Society, Avdelningen för Design och datavetenskap.
    Constructions of quasi-cyclic two-weigh codes2006In: Proc. of the tenth International Workshop on Algebraic and Combinatorial Coding Theory (ACCT-10), 2006, p. 56-59Conference paper (Refereed)
    Abstract [en]

    As a generalization of cyclic codes, quasi-cyclic (QC) codes contain many good linear codes. But quasi-cyclic codes studied so far are mainly limited to one generator (1-generator) QC codes. In this paper, 2-generator QC codes are studied, and many good 2-generator QC codes are constructed using simplex codes. A computer algorithm is given, and used to find the best possible 2-generator QC codes. Among those 2-generator QC codes constructed, some codes are two-weight codes.

  • 17.
    Chen, Eric Zhi
    Linköping university.
    Further results on difference triangle sets1994In: IEEE Transactions on Information Theory, ISSN 0018-9448, E-ISSN 1557-9654, Vol. 40, no 4, p. 1268-1270Article in journal (Refereed)
    Abstract [en]

    Further results on the upper bounds for difference tri8nglesets (DTS) are derived from disjoint difference sets and additive sequencesof permutations, whit3 greatly improve the known bounds.

  • 18.
    Chen, Eric Zhi
    Kristianstad University, School of Engineering.
    Good quasi-cyclic codes derived from irreducible cyclic codes2005In: Proceedings of Optimal Codes and Related Topics (OC2005), 2005, p. 74-81Conference paper (Refereed)
    Abstract [en]

    As a generalization of cyclic codes, quasi-cyclic codes contain many good linear codes. Extensive search is made and lots of good quasi-cyclic codes are obtained from irreducible cyclic codes. A new binary [95, 13, 40] code which improves the lower bound on the minimum distance, is also constructed.

    Download full text (pdf)
    FULLTEXT01
  • 19.
    Chen, Eric Zhi
    Kristianstad University, School of Health and Society, Avdelningen för Design och datavetenskap.
    New binary h-generator quasi-cyclic codes by augmentation and new minimum distance bounds2016In: Designs, Codes and Cryptography, ISSN 0925-1022, E-ISSN 1573-7586, Vol. 80, no 1, p. 1-10Article in journal (Refereed)
    Abstract [en]

    An [n, k, d] code is a binary linear code of block length n, dimension k and minimum Hamming distance d. Since the minimum distance determines the error detection or correction capability, it is desired that d is as large as possible for the given block length n and dimension k. One of the most fundamental problems in coding theory is to construct codes with best possible minimum distances. This problem is very difficult in both theory and practice. During the last decades, it has proved that the class of quasi-cyclic (QC) codes contain many such codes. In this paper, augmentation of binary QC codes is studied. A new augmentation algorithm is presented, and 10 new h-generator QC codes that are better than previously known code have been constructed. Furthermore, Construction X has been applied to obtain another 18 new improved binary linear codes.With the standard construction techniques, a total of 124 new binary linear codes that improve the lower bound on the minimum distance have been obtained.

  • 20.
    Chen, Eric Zhi
    Kristianstad University, School of Engineering.
    New constructions of a family of 2-generator quasi-cyclic two-weight codes and related codes2007In: Proc. of 2007 IEEE Internat. Symp. on Inform. Theory, Piscataway, NJ: IEEE , 2007, p. 2191-2195Conference paper (Refereed)
    Abstract [en]

    Based on cyclic simplex codes, a new construction of a family of two-weight codes is given. These two-weight codes are in a simple 2-generator quasi-cyclic form. Based on this construction, new optimal binary quasi-cyclic [195, 8, 96], [210, 8, 104] and [240, 8, 120] codes, good QC ternary  [195, 6, 126], [208, 6, 135], [221, 6, 144] codes are thus obtained. It was also shown that some codes that meet the Griesmer bound and thus are optimal. Furthermre, binary  self-complementary codes in a 3-generator quasi-cyclic form,  are also constructed.

    Download full text (pdf)
    FULLTEXT01
  • 21.
    Chen, Eric Zhi
    Kristianstad University, School of Health and Society, Avdelningen för Design och datavetenskap.
    New constructions of combinatorial designs and related codes2002In: Proceedings of the 8th International Workshop on Algebraic coding and Combinatorial Theory (ACCT-VIII), 2002, p. 264-267Conference paper (Refereed)
    Abstract [en]

    New constructions of Steiner systems, majority logic decodable codes, and constant weight codes are presented. Comparisons with known results as well as examples are also given.

  • 22.
    Chen, Eric Zhi
    Kristianstad University, School of Health and Society, Avdelningen för Design och datavetenskap.
    New results on binary quasi-cyclic codes2000In: 2000 Ieee International Symposium on Information Theory: Proceedings, IEEE conference proceedings, 2000, p. 197-Conference paper (Refereed)
    Abstract [en]

    Twelve new binary quasi-cyclic codes, which improve the lower bounds on minimum distances for binary linear codes, are presented, and a Web database on best-known binary quasi-cyclic codes is constructed for public access.

  • 23.
    Chen, Eric Zhi
    Kristianstad University, School of Health and Society, Avdelningen för Design och datavetenskap.
    Quasi-cyclic codes derived from cyclic codes2004In: Proceedings of Int. Symp. on Information Theory and its Applications (ISITA2004), Parma, Italy, 2004, p. 162-165Conference paper (Refereed)
  • 24.
    Chen, Eric Zhi
    Linköping university.
    Six new binary quasi-cyclic codes1994In: IEEE Transactions on Information Theory, ISSN 0018-9448, E-ISSN 1557-9654, Vol. 40, no 5, p. 1666-1667Article in journal (Refereed)
    Abstract [en]

    Six new quasi-cyclic codes are presented, which improve thelower bounds on the minimum distance for a binary code. A localexhaustive search is used to find these codes and many other quasi-cycliccodes which attain the lower bounds.

  • 25.
    Chen, Eric Zhi
    et al.
    Kristianstad University, Faculty of Natural Sciences, Avdelningen för datavetenskap. Kristianstad University, Research Platform for Collaboration for Health. Kristianstad University, Faculty of Natural Sciences, Research environment of Computer science (RECS).
    Aydın, Nuh
    USA.
    A database of linear codes over F13 with minimum distance bounds and new quasi-twisted codes from a heuristic search algorithm2015In: Journal of Algebra Combinatorics Discrete Structures and Application, ISSN 2148-838X, Vol. 2, no 1, p. 1-16Article in journal (Refereed)
    Abstract [en]

    Error control codes have been widely used in data communications and storage systems. One centralproblem in coding theory is to optimize the parameters of a linear code and construct codes withbest possible parameters. There are tables of best-known linear codes over finite fields of sizes up to9. Recently, there has been a growing interest in codes over F13 and other fields of size greater than9. The main purpose of this work is to present a database of best-known linear codes over the fieldF13 together with upper bounds on the minimum distances. To find good linear codes to establishlower bounds on minimum distances, an iterative heuristic computer search algorithm is employed toconstruct quasi-twisted (QT) codes over the field F13 with high minimum distances. A large numberof new linear codes have been found, improving previously best-known results. Tables of [pm;m] QTcodes over F13 with best-known minimum distances as well as a table of lower and upper bounds onthe minimum distances for linear codes of length up to 150 and dimension up to 6 are presented.

    Download full text (pdf)
    fulltext
  • 26.
    Chen, Eric Zhi
    et al.
    Kristianstad University, School of Health and Society, Avdelningen för Design och datavetenskap.
    Nuh, Aydin
    USA.
    New quasi-twisted codes over F11— minimum distance bounds and a new database2015In: Journal of Information and Optimization Sciences, ISSN 0252-2667, E-ISSN 2169-0103, Vol. 36, no 1-2, p. 129-157Article in journal (Refereed)
    Abstract [en]

    One fundamental and challenging problem in coding theory is to optimize the parameters [nk,d] of a linear code over the finite field Fq and construct codes with best possible parameters. There are tables and databases of best-known linear codes over the finite fields of size up to 9 together with upper bounds on the minimum distances. Motivated by recent works on codes over F11, we present a table of best-known linear codes over F11 together with upper bounds on minimum distances. Our table covers the range n ≤ 150 for the length, and 3 ≤ k ≤ 7 for the dimension. To the best of our knowledge, this is the first time such a table is presented in the literature. For the construction of the best-known codes, we employed an iterative heuristic search algorithm to search for new linear codes in the class of quasi-twisted (QT) codes. The search yielded many new codes with better parameters than previously known codes. In many cases, optimal codes are obtained. In addition to presenting a comprehensive table of best-known codes over F11 of dimensions up to 7 with upper bounds on the minimum distances, we also present separate tables for the optimal codes and new QT codes over F11. We hope that this work will be a useful source for further study on codes over F11.

  • 27.
    Chen, Qinqing
    et al.
    Kristianstad University, Faculty of Natural Sciences.
    Su, Xiao
    Kristianstad University, Faculty of Natural Sciences.
    Improve Improper Load Distribution with Backpack2018Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    This article focuses on the distribution of backpack pressure on human body. We have noticed two interesting situations: whether the length of different backpack shoulder straps will change the pressure distribution of the backpack on the human body and whether different positions of the backpack load will change the pressure distribution of the backpack on the human body. To find the answer, we designed a backpack pressure detection system to collect data and use engineering software to analyse the data.We got the range that best fits the human body and the healthiest backpack: when the distance from the top of the backpack to the shoulder is about 1/5 of the length of the shoulder and the weight of the backpack is at the bottom of the backpack. At this time, the force of the three parts of the human body (shoulders, back) is the most uniform and relatively minimal. If the user wants to minimize the pressure on the shoulder, the shoulder strap of the backpack should be as short as possible. If the user only wants the pressure on the back to be minimal, the weight in the backpack is closer to the back, which is better for the back.

    Download full text (pdf)
    Improve Improper Load Distribution with Backpack
  • 28.
    Chen, Wende
    et al.
    Academia Sinica and Key State Lab. of Information Security, Graduate School of Academia Sinica, Institute of Systems Science, Beijing.
    Chen, Eric Zhi
    Kristianstad University, School of Health and Society, Avdelningen för Design och datavetenskap.
    Klove, Torleiv
    Department of Informatics, University of Bergen.
    New constructions of disjoint distinct difference sets1998In: Designs, Codes and Cryptography, ISSN 0925-1022, E-ISSN 1573-7586, Vol. 15, no 2, p. 157-165Article in journal (Refereed)
    Abstract [en]

    New constructions of regular disjoint distinct difference sets (DDDS) are presented. In particular,multiplicative and additive DDDS are considered.

  • 29.
    ChenReddy, Suresh Reddy
    et al.
    Kristianstad University College, School of Engineering.
    Mirza, Akbar Ali Baig
    Kristianstad University College, School of Engineering.
    SMS Based Pull Campaign Processing System2007Independent thesis Basic level (degree of Bachelor)Student thesis
    Abstract [en]

    SMS based pull campaign processing system is a new model of directory service provided in mobile infrastructure basically to enable SMS based directory services Mobile directory services is a brand new phenomenon, which hold strong promises to become the best targeting advertising medium delivering new means of services to users with message other than traditional channels (e.g.: print, television, radio and email etc).The main purpose of this system is to bring customers and business organizations closer .It enables SMS based directory services. It not only acts as directory services but also as an advertising medium between the user and the business organizations.

    Download full text (pdf)
    FULLTEXT01
  • 30.
    Comuni, Federica
    Kristianstad University, Faculty of Natural Science.
    A natural language processing solution to probable Alzheimer’s disease detection in conversation transcripts2019Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    This study proposes an accuracy comparison of two of the best performing machine learning algorithms in natural language processing, the Bayesian Network and the Long Short-Term Memory (LSTM) Recurrent Neural Network, in detecting Alzheimer’s disease symptoms in conversation transcripts. Because of the current global rise of life expectancy, the number of seniors affected by Alzheimer’s disease worldwide is increasing each year. Early detection is important to ensure that affected seniors take measures to relieve symptoms when possible or prepare plans before further cognitive decline occurs. Literature shows that natural language processing can be a valid tool for early diagnosis of the disease. This study found that mild dementia and possible Alzheimer’s can be detected in conversation transcripts with promising results, and that the LSTM is particularly accurate in said detection, reaching an accuracy of 86.5% on the chosen dataset. The Bayesian Network classified with an accuracy of 72.1%. The study confirms the effectiveness of a natural language processing approach to detecting Alzheimer’s disease.

    Download full text (pdf)
    fulltext
  • 31.
    Daley Jr, John
    Kristianstad University, Faculty of Natural Science.
    Generating Synthetic Schematics with Generative Adversarial Networks2020Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    This study investigates synthetic schematic generation using conditional generative adversarial networks, specifically the Pix2Pix algorithm was implemented for the experimental phase of the study. With the increase in deep neural network’s capabilities and availability, there is a demand for verbose datasets. This in combination with increased privacy concerns, has led to synthetic data generation utilization. Analysis of synthetic images was completed using a survey. Blueprint images were generated and were successful in passing as genuine images with an accuracy of 40%. This study confirms the ability of generative neural networks ability to produce synthetic blueprint images.

    Download full text (pdf)
    fulltext
  • 32.
    Davidsson, Paul
    et al.
    School of Engineering, Blekinge Institute of Technology.
    Holmgren, Johan
    School of Engineering, Blekinge Institute of Technology.
    Kyhlbäck, Hans
    School of Engineering, Blekinge Institute of Technology.
    Mengistu, Dawit
    School of Engineering, Blekinge Institute of Technology.
    Persson, Marie
    School of Engineering, Blekinge Institute of Technology.
    Applications of agent based simulation2007In: Multi-agent-based simulation VII: International workshop, MABS 2006, Hakodate, Japan, May 8, 2006, revised and invited papers / [ed] Luis Antunes & Keiki Takadama, Berlin: Springer Berlin/Heidelberg, 2007, p. 15-27Conference paper (Refereed)
    Abstract [en]

    This paper provides a survey and analysis of applications of Agent Based Simulation (ABS). A framework for describing and assessing the applications is presented and systematically applied. A general conclusion from the study is that even if ABS seems a promising approach to many problems involving simulation of complex systems of interacting entities, it seems as the full potential of the agent concept and previous research and development within ABS often is not utilized. We illustrate this by providing some concrete examples. Another conclusion is that important information of the applications, in particular concerning the implementation of the simulator, was missing in many papers. As an attempt to encourage improvements we provide some guidelines for writing ABS application papers.

  • 33.
    de Redelijkheid, Martijn
    et al.
    Kristianstad University, Faculty of Natural Science, Avdelningen för datavetenskap. Kristianstad University, Faculty of Business.
    Kokoneshi, Kristian
    Kristianstad University, Faculty of Natural Science, Avdelningen för datavetenskap. Kristianstad University, Faculty of Business.
    A machine learning analysis of photographs of the Öresund bridge2020Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    This study presents an exploration of several machine learning and image processing theories, as well as a literature review of several previous works on concrete crack detection systems. Through the literature review a system is selected and implemented with the Öresund bridge photograph collection. The selected system is a Convolutional Neural Network (CNN) using cropped (256x256x) images for input. The CNN has a total of 13 layers that were implemented as described in the paper. All parts of the implementation such as cropping, code, and testing are described in detail. This study found a final accuracy rate of 77% for the trained net. This is combined with a sliding window technique for handling larger images. An exploration of reasons for this accuracy rate is done at the end of the paper.

    Download full text (pdf)
    fulltext
  • 34.
    Dewangga, Brian
    Kristianstad University, School of Health and Society.
    Inspirational Filter Application for Fashion E-Commerce2012Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    Electronic commerce is becoming a growing industry as information technology has been gradually diversifying the business industry. As a result, there is greater competition between online businesses to attract and retain customers. To overcome this challenge, it is proposed that by implementing a new Inspirational Filter Application to a company’s web store’s filter will increase the growth of returning costumers. This new application is based on loose filters, which goes beyond traditional sorting mechanisms based on color and size. This technology expands searches into inspirational categories such as occasion, material and style, allowing the customer to online shop with greater variety and efficiency. By developing this application alongside with Scandinavian web shop, Boozt Fashion AB, the success rate is tracked after the establishment of this application.

    Download full text (pdf)
    BScThesisDewangga
  • 35.
    Dittrich, Yvonne
    et al.
    Danmark.
    Rönkkö, Kari
    Blekinge Institute of Technology.
    Eriksson, Jeanette
    Blekinge Institute of Technology.
    Hansson, Christina
    Blekinge Institute of Technology.
    Lindeberg, Olle
    Blekinge Institute of Technology.
    Cooperative method development: combining qualitative empirical research with method, technique and process improvement2008In: EMPIRICAL SOFTWARE ENGINEERING, ISSN 1382-3256, Vol. 13, no 3, p. 231-260Article in journal (Refereed)
    Abstract [en]

    The development of methods tools and process improvements is best to be based on the understanding of the development practice to be supported. Qualitative research has been proposed as a method for understanding the social and cooperative aspects of software development. However, qualitative research is not easily combined with the improvement orientation of an engineering discipline. During the last 6 years, we have applied an approach we call 'cooperative method development', which combines qualitative social science fieldwork, with problem-oriented method, technique and process improvement. The action research based approach focusing on shop floor software development practices allows an understanding of how contextual contingencies influence the deployment and applicability of methods, processes and techniques. This article summarizes the experiences and discusses the further development of this approach based on several research projects in cooperation with industrial partners.

  • 36.
    Dootio, Mazhar Ali
    et al.
    Research Lab of AI and Information Security, Benazir Bhutto Shaheed University Lyari, Pakistan.
    Lakhan, Abdullah
    Research Lab of AI and Information Security, Benazir Bhutto Shaheed University Lyari, Pakistan; Kristiania University College, Department of Technology, Mobile Technology Lab, Norway.
    Hassan Sodhro, Ali
    Kristianstad University, Faculty of Natural Sciences, Avdelningen för datavetenskap. Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences, China.
    Groenli, Tor Morten
    Kristiania University College, Department of Technology, Mobile Technology Lab, Norway.
    Bawany, Narmeen Zakaria
    Department of Computer Science and Software Engineering, Jinnah University for Women, Pakistan.
    Kumar, Samrat
    Charles Sturt University, Australia.
    Secure and failure hybrid delay enabled a lightweight RPC and SHDS schemes in Industry 4.0 aware IIoHT enabled fog computing2021In: Mathematical Biosciences and Engineering, ISSN 1547-1063, E-ISSN 1551-0018, Vol. 19, no 1, p. 513-536Article in journal (Refereed)
    Abstract [en]

    These days, the Industrial Internet of Healthcare Things (IIT) enabled applications have been growing progressively in practice. These applications are ubiquitous and run onto the different computing nodes for healthcare goals. The applications have these tasks such as online healthcare monitoring, live heartbeat streaming, and blood pressure monitoring and need a lot of resources for execution. In IIoHT, remote procedure call (RPC) mechanism-based applications have been widely designed with the network and computational delay constraints to run healthcare applications. However, there are many requirements of IIoHT applications such as security, network and computation, and failure efficient RPC with optimizing the quality of services of applications. In this study, the work devised the lightweight RPC mechanism for IIoHT applications and considered the hybrid constraints in the system. The study suggests the secure hybrid delay scheme (SHDS), which schedules all healthcare workloads under their deadlines. For the scheduling problem, the study formulated this problem based on linear integer programming, where all constraints are integer, as shown in the mathematical model. Simulation results show that the proposed SHDS scheme and lightweight RPC outperformed the hybrid for IIoHT applications and minimized 50% delays compared to existing RPC and their schemes.

    Download full text (pdf)
    fulltext
  • 37.
    Dyba, Tore
    et al.
    Norge.
    Prikladnicki, Rafael
    Brasilien.
    Rönkkö, Kari
    Blekinge Institute of Technology.
    Seaman, Carolyn
    USA.
    Sillito, Jonathan
    Canada.
    Qualitative research in software engineering2011In: EMPIRICAL SOFTWARE ENGINEERING, ISSN 1382-3256, Vol. 16, no 4, p. 425-429Article in journal (Refereed)
  • 38.
    Einarson, Daniel
    Kristianstad University, Faculty of Natural Science, Avdelningen för datavetenskap. Kristianstad University, Faculty of Natural Science, Research environment of Computer science (RECS).
    A communication framework in a multi-threaded environment2000In: Proceedings of NWPER'2000, 2000Conference paper (Other academic)
  • 39.
    Einarson, Daniel
    Kristianstad University, Faculty of Natural Science, Avdelningen för datavetenskap. Kristianstad University, Faculty of Natural Science, Research environment of Computer science (RECS).
    Active vs passive entities2002Conference paper (Other academic)
  • 40.
    Einarson, Daniel
    Kristianstad University, Faculty of Natural Science, Avdelningen för datavetenskap. Kristianstad University, Faculty of Natural Science, Research environment of Computer science (RECS).
    Aspects of transparent time concepts2000Conference paper (Other academic)
  • 41.
    Einarson, Daniel
    Kristianstad University, Faculty of Natural Science, Avdelningen för datavetenskap. Kristianstad University, Faculty of Natural Science, Research environment of Computer science (RECS).
    Aspects on communication and models vs processes in a model oriented language1997In: Proceedings of the 23rd conference of the ASU, 1997Conference paper (Other academic)
  • 42.
    Einarson, Daniel
    Kristianstad University, Faculty of Natural Science, Avdelningen för datavetenskap. Kristianstad University, Faculty of Natural Science, Research environment of Computer science (RECS).
    Communication and hierarchical modelling in Model Oriented Programming1999In: Proceedings of the 25th conference of the ASU, 1999Conference paper (Other academic)
  • 43.
    Einarson, Daniel
    Kristianstad University, Faculty of Natural Science, Avdelningen för datavetenskap. Kristianstad University, Faculty of Natural Science, Research environment of Computer science (RECS).
    Discussion on "An exercise for SIMULA users"1997In: ASU Newsletter, Vol. 24, no 1, p. 1-9Article in journal (Other academic)
  • 44.
    Einarson, Daniel
    Kristianstad University, School of Health and Society, Avdelningen för Design och datavetenskap.
    Hierarchical concurrent systems from a model-oriented perspective2002Doctoral thesis, monograph (Other academic)
    Abstract [en]

    Real world systems are normally considered as hierarchically organized, for example, we see those as hierarchies of systems including subsystems. Examples on this can be seen in organizations where people act in environments and carry within themselves their own internal subsystem of thinking processes. Another example relates to robotics where robots may be seen as hierarchical constructions, both physically and logically. As in the case of human actors, we can see robots as autonomous entities that need to perform internal reasoning and planning to conform well to the environment in which they act. Furthermore, actions on different levels are often inherently parallel and may be more or less independent. Object-Oriented (OO) technologies have proved to be appropriate tools in software development. Programming these kinds of hierarchical concurrent systems should therefore be gained by suitable Object-Oriented software support that reflects system level-dependent behavior. For instance, actions in a robot control system should relate to real time, while a robotÕs planning system actions relate to simulated time. However, existing OO software support mainly reflects one-level sequential systems which only by exhaustive work may conform to such hierarchically organized systems. Existing architectural design proposals that address hierarchical compositions often cover ways of collecting objects, but do normally not address issues such as concurrency and different time semantics. We have developed concepts and software support to meet the need for modeling and implementing hierarchically organized systems with concurrent level-dependent autonomous entities. We have approached the problem from two directions, i.e., on one hand from a conceptual and principle perspective, and on the other hand from a software engineering perspective. Concepts and principles are mainly treated in the context of the, so called, Model-Orientated Programming project. Model-Orientation (MO), can be seen as an extension to Object-Orientation to support concurrent models especially. We use the term model for a software representation of an autonomous entity. A model may define its own view upon matters such as time and communication, and may furthermore include further models to represent hierarchical system compositions. Within the project of Model-Oriented Programming we also develop programming language elements relating to the developed concepts. Software engineering aspects are mainly studied within the project of Hierarchical Concurrent Systems. A developed Java-based framework especially reflects hierarchical properties of systems. A general concept of timebase may be specified as either based on a real time or a simulated time concept. This implies that software of one hierarchical level may act in real-time in a control system, while an internal hierarchical level may reason about future state based on a simulated time axis. Furthermore, within the framework we also regard communication, distribution and process management as hierarchical level-dependent properties. This impels ways of software components to flexibly adjust themselves to the context they are intended to act within. Our approach, based on investigations on both modeling and implementation, has been experimented on in several case studies. Those show that encapsulating our concepts and solutions within well defined software units provide software that is both flexible and scalable.

  • 45.
    Einarson, Daniel
    Lunds universitet.
    Hierarchical models of anticipation2002In: Computing anticipatory systems: CASYS 2001, fifth international conference, Liège, Belgium, 13-18 August 2001 / [ed] Daniel M. Dubois, Melville, N.Y.: American Institute of Physics (AIP), 2002, p. 533-542Conference paper (Refereed)
    Abstract [en]

    Several architectural patterns have been proposed for the purpose of modeling autonomous robots. They do, however, lack support on anticipatory behavior. Anticipatory systems typically consist of hierarchical levels of units with similar structures but with different semantics. Close mapping between units of a reference system and components of software models put high demands on component independency, with respect to hierarchy. A concept of hierarchical modeling is proposed to provide support on anticipatory modeling and fills the gap on these matters. The concept has been developed in a context of industrial automation software and successful experiments have been based on a Java‐based framework.

  • 46.
    Einarson, Daniel
    Kristianstad University, Faculty of Natural Science, Avdelningen för datavetenskap. Kristianstad University, Faculty of Natural Science, Research environment of Computer science (RECS).
    Inheritance and coroutines1998In: ASU Newsletter, Vol. 24, no 3Article in journal (Other academic)
  • 47.
    Einarson, Daniel
    Kristianstad University, Faculty of Natural Science, Avdelningen för datavetenskap. Kristianstad University, Faculty of Natural Science, Research environment of Computer science (RECS).
    Model Oriented Programming: progress in concepts and implementation issues1998In: Proceedings of the 24th conference of the ASU, 1998Conference paper (Other academic)
  • 48.
    Einarson, Daniel
    Kristianstad University, Faculty of Natural Science, Avdelningen för datavetenskap. Kristianstad University, Faculty of Natural Science, Research environment of Computer science (RECS).
    On bounds between time flow of hierarchically organized bases of time2003Conference paper (Other academic)
  • 49.
    Einarson, Daniel
    Kristianstad University, Faculty of Natural Science, Avdelningen för datavetenskap. Kristianstad University, Faculty of Natural Science, Research environment of Computer science (RECS).
    On transparent distributed systems2001In: Proceedings of the 27th conference of the ASU, 2001Conference paper (Other academic)
  • 50.
    Einarson, Daniel
    Kristianstad University, Faculty of Natural Science, Avdelningen för datavetenskap. Kristianstad University, Faculty of Natural Science, Research environment of Computer science (RECS).
    Passing control over nested quasi-parallel systems1997In: ASU Newsletter, Vol. 24, no 1, p. 1-9Article in journal (Other academic)
123 1 - 50 of 113
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • 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