Search

Fluorescence light emitted from paper following the absorption of either ultraviolet or visible light has a wavelength distribution determined by the chemical composition of the paper. This can be used both for laboratory measurements of paper characteristics and for on-line monitoring of the paper during production. Such measurements can be performed non-intrusively at sampling rates high enough to give a sub-millimetre resolution in the machine direction in a paper machine or rerewinder. In this project two types of fluorescence monitors have been constructed. They are operating at different wavelengths and thereby they monitor different substances in the paper. The monitors have been tested at newsprint producing paper mills together with an optical speedometer. The measurements in the production environment have shown that the equipment is capable of indirectly monitoring paper quality parameters which affect the local abundance of lignin. Examples of such parameters are the number of shives in the paper and wire marks. A fluorescence based method for scanning cross-directional newsprint profiles in the laboratory has been developed. From these measurements the relative shrinkage of the paper during drying can be calculated using time-frequency analysis.

Fluorescence from paper following excitation by either ultraviolet or visible light gives information on the chemical composition of the paper. This can be used for on-line monitoring of the paper during production. Such measurements can be performed non-intrusively at sampling rates high enough to give a sub-millimetre resolution at paper webs moving at velocities higher than 20 metres per second. Two types of fluorescence meters, operating at different wavelengths, have been constructed. Together with an optical speedometer they have been tested at newsprint producing paper mills. A fluorescence based method for scanning cross-directional newsprint profiles in the laboratory has been developed. From these measurements the relative shrinkage of the paper during drying can be calculated using time-frequency analysis.

The potential for electronic media in the newspaper business is interesting. The research about electronic media will bring demands on new thinking in developing new value, income generating services and related business models. An example of electronic media is electronic paper. This paper explores the added value and payment methods for the e-paper. We have conducted future workshops with our target group the reader. On the basis of future workshops this paper shows that interaction, individualization, improved selection and content, environment friendly and saving capabilities are necessities for the e-paper to be successful. We suggest that the e-paper must be more than just an online newspaper for people to buy it.

The potential for electronic media in the newspaper business is interesting. The research about electronic media will bring demands on new thinking in developing new value, income generating services and related business models. An example of electronic media is electronic paper. This paper explores the added value and payment methods for the e-paper. We have conducted future workshops with our target group the reader. On the basis of future workshops this paper shows that interaction, individualization, improved selection and content, environment friendly and saving capabilities are necessities for the e-paper to be successful. We suggest that the e-paper must be more than just an online newspaper for people to buy it.

E-papperet är ett medie som i framtiden kan komma att användas för att läsa dagstidningar. Istället för att bläck trycks på papperet så visar e-papperet informationen genom att små partiklar på papperets yta byter färg vilket innebär att samma e- pappersark kan innehålla och visa ett stort antal sidor. Nya medier blir sällan accepterade utan att det funnits länkar till tidigare eller existerade tekniker. Denna studie ämnar kartlägga tidningsläsarnas användningsmönster och papperstidningens egenskaper för att understödja utformningen av morgondagens e-papperstidning. Genom att kombinera litteratur med egna undersökningar presenteras riktlinjer för vilka egenskaper och användningsmönster som framtidens e-papper bör stödja. Studien lyfter exempelvis fram att gränssnitt och navigation bör utformas i åtanke att majoriteten av tidningsläsarna läser tidningar vi köksbord och att formatet på e-pappret bör påminna om dagens tabloid format. Resultatet som presenteras skall kunna komma till nytta för företag och organisationer som skall utforma framtidens e-papperstidning. Rapporten beskriver med utgångspunkt från bland annat "diffusion theory" en kvalitativ studie där 400 enkäter skickades ut till prenumeranter av Sundsvalls tidning för att avslutas med en diskussion där förslag på fortsatt forskning och övriga slutsatser behandlas. Studien lyfter fram de viktigaste faktorerna som bör följas, samt ger förslag på hur de kan lösas samtidigt som nya frågor och diskussioner föds ur resultaten och diskussionerna.

Today computer architectures are shifting from single core to manycores due to several reasons such as performance demands, power and heat limitations. However, shifting to manycores results in additional complexities, especially with regard to efficient development of applications. Hence there is a need to raise the abstraction level of development techniques for the manycores while exposing the inherent parallelism in the applications. One promising class of programming languages is dataflow languages and in this paper we evaluate and optimize the code generation for one such language, CAL. We have also developed a communication library to support the inter-core communication.The code generation can target multiple architectures, but the results presented in this paper is focused on Adapteva's many core architecture Epiphany.We use the two-dimensional inverse discrete cosine transform (2D-IDCT) as our benchmark and compare our code generation from CAL with a hand-written implementation developed in C. Several optimizations in the code generation as well as in the communication library are described, and we have observed that the most critical optimization is reducing the number of external memory accesses. Combining all optimizations we have been able to reduce the difference in execution time between auto-generated and hand-written implementations from a factor of 4.3x down to a factor of only 1.3x. ©2014 IEEE., The authors would like to thank Adapteva Inc. for giving access to their software development suite and hardware board. This research is part of the CERES research program funded by the Knowledge Foundation and HiPEC project funded by Swedish Foundation for Strategic Research (SSF)., HiPEC project

In this paper we present a novel method for remote breathing detection based on ultra-wide-band (UWB) radar. This is a method that does not require any wearable sensors, making it more comfortable and convenient for users. Furthermore, because of the wall penetrating characteristics of the transmitted signal, our system is useful in emergency situations such as monitoring people who may be trapped under earthquake rubble. For our investigation we used a Novelda UWB radar that provides high processing speed and low power consumption. In this paper we present two new convolution-based methods to extract breathing rate information from the received radar signal. This method was tested on several people who were monitored while laying down on a bed. The subject's position and breathing rate were calculated. Experimental results including 20 different subjects are provided, showing that this is a viable method for monitoring breathing rate using a low-power UWB radar.

This paper presents work on a switched Ethernet network extended to allow for periodic real-time traffic, using earliest deadline first (EDF) scheduling. A scheme of asymmetrically dividing deadlines of real-time channels between the in and outgoing links to/from the switch is proposed (ADPS). The result of the simulations of setting up RT channels over a full-duplex switched Ethernet network is presented. The simulations show that the ADPS performs well when master-slave communication is assumed over the network. thin layer is needed between the Ethernet protocols and the TCP/IP suite in the end-stations. The switch is responsible for admission control, while both end-stations and the switch have EDF (Earliest Deadline First) scheduling (7). The deadlines of messages over the network are end-to-end based, insofar as it is the maximum time to deliver, from the release time in the source node, to the arrival in the destination. In this paper, we assume a single switch, with one node connected to each physical port. The messages originating from the source do therefore traverse two links, and we need to provide guarantees for the time to deliver over both links. We approach this problem by dividing the end-to- end deadline into two, one for the source to the switch, and one from the switch to the destination. The deadline can be partitioned in a number of ways. The method we choose affects the system. The paper is concerned with analyzing the partitioning of deadlines, and to propose a way that is more suitable for master slave communication, which is a common demand in industrial applications. The results, and indeed the method in its current form, do not refer to a mixed topology. The network topology is confined to a star, with one centralized switch connected to one node on each physical port. A full-duplex network is assumed. The rest of the paper is organized as follows. The network architecture is presented in Section 2. In Section 3, a feasibility analysis is

This paper presents work on a switched Ethernet network extended to allow for periodic real-time traffic, using earliest deadline first (EDF) scheduling. A scheme of asymmetrically dividing deadlines of real-time channels between the in and outgoing links to/from the switch is proposed (ADPS). The result of the simulations of setting up RT channels over a full-duplex switched Ethernet network is presented. The simulations show that the ADPS performs well when master-slave communication is assumed over the network. thin layer is needed between the Ethernet protocols and the TCP/IP suite in the end-stations. The switch is responsible for admission control, while both end-stations and the switch have EDF (Earliest Deadline First) scheduling (7). The deadlines of messages over the network are end-to-end based, insofar as it is the maximum time to deliver, from the release time in the source node, to the arrival in the destination. In this paper, we assume a single switch, with one node connected to each physical port. The messages originating from the source do therefore traverse two links, and we need to provide guarantees for the time to deliver over both links. We approach this problem by dividing the end-to- end deadline into two, one for the source to the switch, and one from the switch to the destination. The deadline can be partitioned in a number of ways. The method we choose affects the system. The paper is concerned with analyzing the partitioning of deadlines, and to propose a way that is more suitable for master slave communication, which is a common demand in industrial applications. The results, and indeed the method in its current form, do not refer to a mixed topology. The network topology is confined to a star, with one centralized switch connected to one node on each physical port. A full-duplex network is assumed. The rest of the paper is organized as follows. The network architecture is presented in Section 2. In Section 3, a feasibility analysis is

This paper presents work on a switched Ethernet network extended to allow for periodic real-time traffic, using earliest deadline first (EDF) scheduling. A scheme of asymmetrically dividing deadlines of real-time channels between the in and outgoing links to/from the switch is proposed (ADPS). The result of the simulations of setting up RT channels over a full-duplex switched Ethernet network is presented. The simulations show that the ADPS performs well when master-slave communication is assumed over the network. thin layer is needed between the Ethernet protocols and the TCP/IP suite in the end-stations. The switch is responsible for admission control, while both end-stations and the switch have EDF (Earliest Deadline First) scheduling (7). The deadlines of messages over the network are end-to-end based, insofar as it is the maximum time to deliver, from the release time in the source node, to the arrival in the destination. In this paper, we assume a single switch, with one node connected to each physical port. The messages originating from the source do therefore traverse two links, and we need to provide guarantees for the time to deliver over both links. We approach this problem by dividing the end-to- end deadline into two, one for the source to the switch, and one from the switch to the destination. The deadline can be partitioned in a number of ways. The method we choose affects the system. The paper is concerned with analyzing the partitioning of deadlines, and to propose a way that is more suitable for master slave communication, which is a common demand in industrial applications. The results, and indeed the method in its current form, do not refer to a mixed topology. The network topology is confined to a star, with one centralized switch connected to one node on each physical port. A full-duplex network is assumed. The rest of the paper is organized as follows. The network architecture is presented in Section 2. In Section 3, a feasibility analysis is

This paper presents work on a switched Ethernet network extended to allow for periodic real-time traffic, using earliest deadline first (EDF) scheduling. A scheme of asymmetrically dividing deadlines of real-time channels between the in and outgoing links to/from the switch is proposed (ADPS). The result of the simulations of setting up RT channels over a full-duplex switched Ethernet network is presented. The simulations show that the ADPS performs well when master-slave communication is assumed over the network. thin layer is needed between the Ethernet protocols and the TCP/IP suite in the end-stations. The switch is responsible for admission control, while both end-stations and the switch have EDF (Earliest Deadline First) scheduling (7). The deadlines of messages over the network are end-to-end based, insofar as it is the maximum time to deliver, from the release time in the source node, to the arrival in the destination. In this paper, we assume a single switch, with one node connected to each physical port. The messages originating from the source do therefore traverse two links, and we need to provide guarantees for the time to deliver over both links. We approach this problem by dividing the end-to- end deadline into two, one for the source to the switch, and one from the switch to the destination. The deadline can be partitioned in a number of ways. The method we choose affects the system. The paper is concerned with analyzing the partitioning of deadlines, and to propose a way that is more suitable for master slave communication, which is a common demand in industrial applications. The results, and indeed the method in its current form, do not refer to a mixed topology. The network topology is confined to a star, with one centralized switch connected to one node on each physical port. A full-duplex network is assumed. The rest of the paper is organized as follows. The network architecture is presented in Section 2. In Section 3, a feasibility analysis is

This paper presents work on a switched Ethernet network extended to allow for periodic real-time traffic, using earliest deadline first (EDF) scheduling. A scheme of asymmetrically dividing deadlines of real-time channels between the in and outgoing links to/from the switch is proposed (ADPS). The result of the simulations of setting up RT channels over a full-duplex switched Ethernet network is presented. The simulations show that the ADPS performs well when master-slave communication is assumed over the network. thin layer is needed between the Ethernet protocols and the TCP/IP suite in the end-stations. The switch is responsible for admission control, while both end-stations and the switch have EDF (Earliest Deadline First) scheduling (7). The deadlines of messages over the network are end-to-end based, insofar as it is the maximum time to deliver, from the release time in the source node, to the arrival in the destination. In this paper, we assume a single switch, with one node connected to each physical port. The messages originating from the source do therefore traverse two links, and we need to provide guarantees for the time to deliver over both links. We approach this problem by dividing the end-to- end deadline into two, one for the source to the switch, and one from the switch to the destination. The deadline can be partitioned in a number of ways. The method we choose affects the system. The paper is concerned with analyzing the partitioning of deadlines, and to propose a way that is more suitable for master slave communication, which is a common demand in industrial applications. The results, and indeed the method in its current form, do not refer to a mixed topology. The network topology is confined to a star, with one centralized switch connected to one node on each physical port. A full-duplex network is assumed. The rest of the paper is organized as follows. The network architecture is presented in Section 2. In Section 3, a feasibility analysis is

This paper presents work on a switched Ethernet network extended to allow for periodic real-time traffic, using earliest deadline first (EDF) scheduling. A scheme of asymmetrically dividing deadlines of real-time channels between the in and outgoing links to/from the switch is proposed (ADPS). The result of the simulations of setting up RT channels over a full-duplex switched Ethernet network is presented. The simulations show that the ADPS performs well when master-slave communication is assumed over the network. thin layer is needed between the Ethernet protocols and the TCP/IP suite in the end-stations. The switch is responsible for admission control, while both end-stations and the switch have EDF (Earliest Deadline First) scheduling (7). The deadlines of messages over the network are end-to-end based, insofar as it is the maximum time to deliver, from the release time in the source node, to the arrival in the destination. In this paper, we assume a single switch, with one node connected to each physical port. The messages originating from the source do therefore traverse two links, and we need to provide guarantees for the time to deliver over both links. We approach this problem by dividing the end-to- end deadline into two, one for the source to the switch, and one from the switch to the destination. The deadline can be partitioned in a number of ways. The method we choose affects the system. The paper is concerned with analyzing the partitioning of deadlines, and to propose a way that is more suitable for master slave communication, which is a common demand in industrial applications. The results, and indeed the method in its current form, do not refer to a mixed topology. The network topology is confined to a star, with one centralized switch connected to one node on each physical port. A full-duplex network is assumed. The rest of the paper is organized as follows. The network architecture is presented in Section 2. In Section 3, a feasibility analysis is

This thesis presents the research and development of a microwave in-strument to capture tomographic information from the inner structure ofthe biological sample. The principle of the instrument is based on theanisotropy introduced by the fibres in materials such as wood and musclesin terms of information regarding changes in the fibre structure. The in-formation is presented as images representing the state of polarization us-ing Stokes parameters, the complex polarization ratio, and the ellipticityand the linear tilt angles. The theory of wave propagation in anisotropicmedia is discussed and related to the dielectric properties of wood. Ex-periments have shown that the developed instrument can be utilized invarious applications such as localizing knots and cavities in wood andto detect mechanical contamination of meat. A second instrument hasbeen improved by introducing a new signal analysis step to estimate therelative shrinkage profile of paper. The estimator is based on trackingfrequency variations in the joint time frequency spectrum and follows thelower bound of the problem for the relevant noise levels., [Paper A] Kaestner, A.P. & Bååth, L.B., Microwave polarimetry based scanning for internal defects, Submitted to IEEE Transactions on Antennas and Propagation.Scopus-ID: 2-s2.0-0036389438

Online newspapers and their audience are explored in this paper. Based upon an online questionnaire at four Swedish newspapers with a sample of more than 3800 answers collected, the paper presents some users’ experiences of the online newspapers. The paper reports on the users regarding age, gender and location. Reading frequency and reading habits are explored as well. The findings show that almost two thirds of the respondents are men and almost 65% are in the ages between 21-40. Almost two thirds of the respondents do not read the online newspaper in any specific order, and more than 80% prefer the paper edition of the newspaper. Several findings regarding navigation purposes were found and the paper also discusses the navigation and search aspects of the news sites.

Based on repetitive visits to three Scandinavian newspaper organizations, this paper presents trajectories of evolution for three Scandinavian news sites from 1996to 1999. Genre awareness is an explanation of how usersand designers create and maintain web site awareness beyond the individual site. In the paper genre iselaborated in terms of content, form and rationale. From the data it is concluded that web news by 1999 possess characteristics that makes it distinctive from print mediaand web news sites from 1996. The immediacy of the web affords the provision of news in a continuous pattern similar to “live” reporting. Primary content of web newsis hard news that affords users to visit news sites throughout the day in order to stay informed. In comparison to print media, the web genre has introduced composites to support the users in overview, navigation and browsing of the content of a news site., ©2000 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

Based on repetitive visits to three Scandinavian newspaper organizations, this paper presents trajectories of evolution for three Scandinavian news sites from 1996to 1999. Genre awareness is an explanation of how usersand designers create and maintain web site awareness beyond the individual site. In the paper genre iselaborated in terms of content, form and rationale. From the data it is concluded that web news by 1999 possess characteristics that makes it distinctive from print mediaand web news sites from 1996. The immediacy of the web affords the provision of news in a continuous pattern similar to “live” reporting. Primary content of web newsis hard news that affords users to visit news sites throughout the day in order to stay informed. In comparison to print media, the web genre has introduced composites to support the users in overview, navigation and browsing of the content of a news site., ©2000 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

Based on repetitive visits to three Scandinavian newspaper organizations, this paper presents trajectories of evolution for three Scandinavian news sites from 1996to 1999. Genre awareness is an explanation of how usersand designers create and maintain web site awareness beyond the individual site. In the paper genre iselaborated in terms of content, form and rationale. From the data it is concluded that web news by 1999 possess characteristics that makes it distinctive from print mediaand web news sites from 1996. The immediacy of the web affords the provision of news in a continuous pattern similar to “live” reporting. Primary content of web newsis hard news that affords users to visit news sites throughout the day in order to stay informed. In comparison to print media, the web genre has introduced composites to support the users in overview, navigation and browsing of the content of a news site., ©2000 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

In modern and future radar applications there are high demands on the signal processing chain in terms of computational power and generality. At the same time, there are hard size and power consumption constraints. This paper reports on a project whose aim is to find a good scalable computer architecture that is flexible, programmable and as general-purpose as possible without too much performance loss. The proposed architecture consists of multiple SIMD computing modules, each based on a number of small mesh arrays. The modules are fully programmable and work globally as a MIMD machine and locally as SIMD machines. The data network is modular and provides both high bandwidth capacity and fast response. It has a fiber-optic stars topology, and employs time and wavelength division multiplexing, together with a medium access method specially developed for real-time systems. In this paper, we use a radar system with 64 processing channels to illustrate the algorithms and the usage of the processor modules. We show that it is possible to use a machine, consisting of small mesh processor arrays forming larger modules, with good efficiency. The building blocks show good balance between computational power and I/O bandwidth, and the SIMD approach seems good from algorithm-mapping point of view.

In modern and future radar applications there are high demands on the signal processing chain in terms of computational power and generality. At the same time, there are hard size and power consumption constraints. This paper reports on a project whose aim is to find a good scalable computer architecture that is flexible, programmable and as general-purpose as possible without too much performance loss. The proposed architecture consists of multiple SIMD computing modules, each based on a number of small mesh arrays. The modules are fully programmable and work globally as a MIMD machine and locally as SIMD machines. The data network is modular and provides both high bandwidth capacity and fast response. It has a fiber-optic stars topology, and employs time and wavelength division multiplexing, together with a medium access method specially developed for real-time systems. In this paper, we use a radar system with 64 processing channels to illustrate the algorithms and the usage of the processor modules. We show that it is possible to use a machine, consisting of small mesh processor arrays forming larger modules, with good efficiency. The building blocks show good balance between computational power and I/O bandwidth, and the SIMD approach seems good from algorithm-mapping point of view.

In modern and future radar applications there are high demands on the signal processing chain in terms of computational power and generality. At the same time, there are hard size and power consumption constraints. This paper reports on a project whose aim is to find a good scalable computer architecture that is flexible, programmable and as general-purpose as possible without too much performance loss. The proposed architecture consists of multiple SIMD computing modules, each based on a number of small mesh arrays. The modules are fully programmable and work globally as a MIMD machine and locally as SIMD machines. The data network is modular and provides both high bandwidth capacity and fast response. It has a fiber-optic stars topology, and employs time and wavelength division multiplexing, together with a medium access method specially developed for real-time systems. In this paper, we use a radar system with 64 processing channels to illustrate the algorithms and the usage of the processor modules. We show that it is possible to use a machine, consisting of small mesh processor arrays forming larger modules, with good efficiency. The building blocks show good balance between computational power and I/O bandwidth, and the SIMD approach seems good from algorithm-mapping point of view.

In modern and future radar applications there are high demands on the signal processing chain in terms of computational power and generality. At the same time, there are hard size and power consumption constraints. This paper reports on a project whose aim is to find a good scalable computer architecture that is flexible, programmable and as general-purpose as possible without too much performance loss. The proposed architecture consists of multiple SIMD computing modules, each based on a number of small mesh arrays. The modules are fully programmable and work globally as a MIMD machine and locally as SIMD machines. The data network is modular and provides both high bandwidth capacity and fast response. It has a fiber-optic stars topology, and employs time and wavelength division multiplexing, together with a medium access method specially developed for real-time systems. In this paper, we use a radar system with 64 processing channels to illustrate the algorithms and the usage of the processor modules. We show that it is possible to use a machine, consisting of small mesh processor arrays forming larger modules, with good efficiency. The building blocks show good balance between computational power and I/O bandwidth, and the SIMD approach seems good from algorithm-mapping point of view.

In modern and future radar applications there are high demands on the signal processing chain in terms of computational power and generality. At the same time, there are hard size and power consumption constraints. This paper reports on a project whose aim is to find a good scalable computer architecture that is flexible, programmable and as general-purpose as possible without too much performance loss. The proposed architecture consists of multiple SIMD computing modules, each based on a number of small mesh arrays. The modules are fully programmable and work globally as a MIMD machine and locally as SIMD machines. The data network is modular and provides both high bandwidth capacity and fast response. It has a fiber-optic stars topology, and employs time and wavelength division multiplexing, together with a medium access method specially developed for real-time systems. In this paper, we use a radar system with 64 processing channels to illustrate the algorithms and the usage of the processor modules. We show that it is possible to use a machine, consisting of small mesh processor arrays forming larger modules, with good efficiency. The building blocks show good balance between computational power and I/O bandwidth, and the SIMD approach seems good from algorithm-mapping point of view.

In modern and future radar applications there are high demands on the signal processing chain in terms of computational power and generality. At the same time, there are hard size and power consumption constraints. This paper reports on a project whose aim is to find a good scalable computer architecture that is flexible, programmable and as general-purpose as possible without too much performance loss. The proposed architecture consists of multiple SIMD computing modules, each based on a number of small mesh arrays. The modules are fully programmable and work globally as a MIMD machine and locally as SIMD machines. The data network is modular and provides both high bandwidth capacity and fast response. It has a fiber-optic stars topology, and employs time and wavelength division multiplexing, together with a medium access method specially developed for real-time systems. In this paper, we use a radar system with 64 processing channels to illustrate the algorithms and the usage of the processor modules. We show that it is possible to use a machine, consisting of small mesh processor arrays forming larger modules, with good efficiency. The building blocks show good balance between computational power and I/O bandwidth, and the SIMD approach seems good from algorithm-mapping point of view.

Embedded DSP computing is currently shifting towards manycore architectures in order to cope with the ever growing computational demands. Actor based dataflow languages are being considered as a programming model. In this paper we present a code generator for CAL, one such dataflow language. We propose to use a compilation tool with two intermediate representations. We start from a machine model of the actors that provides an ordering for testing of conditions and firing of actions. We then generate an Action Execution Intermediate Representation that is closer to a sequential imperative language like C and Java. We describe our two intermediate representations and show the feasibility and portability of our approach by compiling a CAL implementation of the Two-Dimensional Inverse Discrete Cosine Transform on a general purpose processor, on the Epiphany manycore architecture and on the Ambric massively parallel processor array. © 2014 IEEE., HiPEC

Embedded DSP computing is currently shifting towards manycore architectures in order to cope with the ever growing computational demands. Actor based dataflow languages are being considered as a programming model. In this paper we present a code generator for CAL, one such dataflow language. We propose to use a compilation tool with two intermediate representations. We start from a machine model of the actors that provides an ordering for testing of conditions and firing of actions. We then generate an Action Execution Intermediate Representation that is closer to a sequential imperative language like C and Java. We describe our two intermediate representations and show the feasibility and portability of our approach by compiling a CAL implementation of the Two-Dimensional Inverse Discrete Cosine Transform on a general purpose processor, on the Epiphany manycore architecture and on the Ambric massively parallel processor array. © 2014 IEEE., HiPEC

Embedded DSP computing is currently shifting towards manycore architectures in order to cope with the ever growing computational demands. Actor based dataflow languages are being considered as a programming model. In this paper we present a code generator for CAL, one such dataflow language. We propose to use a compilation tool with two intermediate representations. We start from a machine model of the actors that provides an ordering for testing of conditions and firing of actions. We then generate an Action Execution Intermediate Representation that is closer to a sequential imperative language like C and Java. We describe our two intermediate representations and show the feasibility and portability of our approach by compiling a CAL implementation of the Two-Dimensional Inverse Discrete Cosine Transform on a general purpose processor, on the Epiphany manycore architecture and on the Ambric massively parallel processor array. © 2014 IEEE., HiPEC

Då datorer i alla dess former har kommit att bära betydande mängder relevant information för diverse forensiska utredningar så krävs en ingående kunskap gällande hur denna data lämpligast infångas. En typ av klient som nyligen har gjort sitt kommersiella intåg på marknaden är den internetbaserade tunna klienten. Det existerar i dagsläget begränsat med underlag gällande huruvida en sådan klient bär information som är relevant för en IT-forensisk utredning. Inom denna uppsats har därför en internetbaserad tunn klient av typen Chromebook varit mål för undersökning. Syftet har varit att kartlägga vilka sårbarheter som existerar, samt om möjligt huruvida dessa kan brukas som underlag vid en forensisk utredning. För detta ändamål har klientens lagrings- samt kommunikationsmönster analyserats. För genomförandet av detta brukades experimentella metodiker i form av penetrationstest samt IT-forensisk undersökning. Det har även kartlagts huruvida programvaror avsedda för operativsystemet Linux kan exekveras på klienten. Ändamålet med detta var att fastställa om klientens volatila minne kan utvinnas med hjälp av verktyg för just Linux. Rapportens resultat påvisar att det inom en klient av denna typ finns forensiskt värdefull information att inhämta. Det påvisas även att Chrome OS från en användares perspektiv kan anses som säkert., Computers in various forms have come to carry a significant amount of relevant information for various forensic investigations. Therefore, detailed knowledge is required regarding how this data is best acquired. One type of client that has recently made its entry onto the commercial market is the Web Thin Client. As it is today, only a limited amount of relevant information can be found regarding in what capacity such a client contains data that is relevant to an IT-forensic investigation. For this reason, a Web thin client of the model Google Chromebook has been evaluated in this paper. The purpose of this examination has been to identify the vulnerabilities that currently exist, and if possible whether these can be used as a basis for a forensic investigation. To achieve this, the client's storage and communication patterns have been analyzed by implementation of experimental methodologies. The methods used for the purpose are penetration testing and an IT forensic investigation. Tests have also been performed to evaluate whether software for the Linux operating system can be executed on the client. The purpose of this was to determine whether the client's volatile memory can be extracted using tools created for Linux. The results presented in this paper demonstrate the fact that within a client of this type, valuable forensic information can be located. It is also established that Chrome OS from a user's perspective can be considered as safe.

Offentliga trådlösa nätverk finns idag mer tillgängliga än någonsin. Samtidigt haralla dessa nätverk något gemensamt – de går alla att avlyssna och risken finns attanvändarens information kan komma i fel händer. Uppsatsen behandlarallmänhetens säkerhetsmedvetenhet med avseende på denna typ av nätverk genomtvå undersökningar. Den första undersökningen sker via ett tekniskt experiment därdet på flera geografiska platser har erbjudits ett trådlöst nätverk till allmänheten. Pådetta nätverk har det i realtid getts möjligheten att bedöma användarnassäkerhetsmedvetenhet genom att analysera deras nätverkstrafik. Den andraundersökningen sker via en enkät för att få ett resultat från ett teoretiskt perspektiv,hur användarna tror sig agera vid användning av ett sådant nätverk. Således ger denen inblick i den kunskap och säkerhetsmedvetenhet människor i allmänhet tror sigbesitta.Resultaten från undersökningarna tyder på att människors säkerhetsmedvetenhetkan och bör förbättras. Ett första steg är ytterligare utbildning angående de riskersom existerar och hur man undviker dem, något som tas upp i denna uppsats., Public wireless networks are more available than ever. The networks all havesomething in common—they can be tapped in to, which poses the risk of sensitiveuser information being compromised. This research paper explores the public’ssecurity awareness with regards to public wireless networks by two differentmethods. One technical experiment in which, access to a public wireless networks inseveral different locations were offered. This allowed us to, in real-time, assess thesafety awareness of the users of our public wireless network, by analyzing theirnetwork traffic. The second was a survey, which were distributed to our sample ofpeople. It asked the sample questions about how they perceive their own behavioron a public wireless network. Thus, the survey allowed us to get an idea of theknowledge and the security awareness the public in general believe that they have.The results from our research indicate that people’s security awareness can andshould be improved. One first step towards improvement would be educationconcerning the risks that exist and how to avoid them, which is something that will be brought up in this paper.

Embedded DSP computing is currently shifting towards manycore architectures in order to cope with the ever growing computational demands. Actor based dataflow languages are being considered as a programming model. In this paper we present a code generator for CAL, one such dataflow language. We propose to use a compilation tool with two intermediate representations. We start from a machine model of the actors that provides an ordering for testing of conditions and firing of actions. We then generate an Action Execution Intermediate Representation that is closer to a sequential imperative language like C and Java. We describe our two intermediate representations and show the feasibility and portability of our approach by compiling a CAL implementation of the Two-Dimensional Inverse Discrete Cosine Transform on a general purpose processor, on the Epiphany manycore architecture and on the Ambric massively parallel processor array. © 2014 IEEE., HiPEC

Då datorer i alla dess former har kommit att bära betydande mängder relevant information för diverse forensiska utredningar så krävs en ingående kunskap gällande hur denna data lämpligast infångas. En typ av klient som nyligen har gjort sitt kommersiella intåg på marknaden är den internetbaserade tunna klienten. Det existerar i dagsläget begränsat med underlag gällande huruvida en sådan klient bär information som är relevant för en IT-forensisk utredning. Inom denna uppsats har därför en internetbaserad tunn klient av typen Chromebook varit mål för undersökning. Syftet har varit att kartlägga vilka sårbarheter som existerar, samt om möjligt huruvida dessa kan brukas som underlag vid en forensisk utredning. För detta ändamål har klientens lagrings- samt kommunikationsmönster analyserats. För genomförandet av detta brukades experimentella metodiker i form av penetrationstest samt IT-forensisk undersökning. Det har även kartlagts huruvida programvaror avsedda för operativsystemet Linux kan exekveras på klienten. Ändamålet med detta var att fastställa om klientens volatila minne kan utvinnas med hjälp av verktyg för just Linux. Rapportens resultat påvisar att det inom en klient av denna typ finns forensiskt värdefull information att inhämta. Det påvisas även att Chrome OS från en användares perspektiv kan anses som säkert., Computers in various forms have come to carry a significant amount of relevant information for various forensic investigations. Therefore, detailed knowledge is required regarding how this data is best acquired. One type of client that has recently made its entry onto the commercial market is the Web Thin Client. As it is today, only a limited amount of relevant information can be found regarding in what capacity such a client contains data that is relevant to an IT-forensic investigation. For this reason, a Web thin client of the model Google Chromebook has been evaluated in this paper. The purpose of this examination has been to identify the vulnerabilities that currently exist, and if possible whether these can be used as a basis for a forensic investigation. To achieve this, the client's storage and communication patterns have been analyzed by implementation of experimental methodologies. The methods used for the purpose are penetration testing and an IT forensic investigation. Tests have also been performed to evaluate whether software for the Linux operating system can be executed on the client. The purpose of this was to determine whether the client's volatile memory can be extracted using tools created for Linux. The results presented in this paper demonstrate the fact that within a client of this type, valuable forensic information can be located. It is also established that Chrome OS from a user's perspective can be considered as safe.

Embedded DSP computing is currently shifting towards manycore architectures in order to cope with the ever growing computational demands. Actor based dataflow languages are being considered as a programming model. In this paper we present a code generator for CAL, one such dataflow language. We propose to use a compilation tool with two intermediate representations. We start from a machine model of the actors that provides an ordering for testing of conditions and firing of actions. We then generate an Action Execution Intermediate Representation that is closer to a sequential imperative language like C and Java. We describe our two intermediate representations and show the feasibility and portability of our approach by compiling a CAL implementation of the Two-Dimensional Inverse Discrete Cosine Transform on a general purpose processor, on the Epiphany manycore architecture and on the Ambric massively parallel processor array. © 2014 IEEE., HiPEC

Embedded DSP computing is currently shifting towards manycore architectures in order to cope with the ever growing computational demands. Actor based dataflow languages are being considered as a programming model. In this paper we present a code generator for CAL, one such dataflow language. We propose to use a compilation tool with two intermediate representations. We start from a machine model of the actors that provides an ordering for testing of conditions and firing of actions. We then generate an Action Execution Intermediate Representation that is closer to a sequential imperative language like C and Java. We describe our two intermediate representations and show the feasibility and portability of our approach by compiling a CAL implementation of the Two-Dimensional Inverse Discrete Cosine Transform on a general purpose processor, on the Epiphany manycore architecture and on the Ambric massively parallel processor array. © 2014 IEEE., HiPEC

Offentliga trådlösa nätverk finns idag mer tillgängliga än någonsin. Samtidigt haralla dessa nätverk något gemensamt – de går alla att avlyssna och risken finns attanvändarens information kan komma i fel händer. Uppsatsen behandlarallmänhetens säkerhetsmedvetenhet med avseende på denna typ av nätverk genomtvå undersökningar. Den första undersökningen sker via ett tekniskt experiment därdet på flera geografiska platser har erbjudits ett trådlöst nätverk till allmänheten. Pådetta nätverk har det i realtid getts möjligheten att bedöma användarnassäkerhetsmedvetenhet genom att analysera deras nätverkstrafik. Den andraundersökningen sker via en enkät för att få ett resultat från ett teoretiskt perspektiv,hur användarna tror sig agera vid användning av ett sådant nätverk. Således ger denen inblick i den kunskap och säkerhetsmedvetenhet människor i allmänhet tror sigbesitta.Resultaten från undersökningarna tyder på att människors säkerhetsmedvetenhetkan och bör förbättras. Ett första steg är ytterligare utbildning angående de riskersom existerar och hur man undviker dem, något som tas upp i denna uppsats., Public wireless networks are more available than ever. The networks all havesomething in common—they can be tapped in to, which poses the risk of sensitiveuser information being compromised. This research paper explores the public’ssecurity awareness with regards to public wireless networks by two differentmethods. One technical experiment in which, access to a public wireless networks inseveral different locations were offered. This allowed us to, in real-time, assess thesafety awareness of the users of our public wireless network, by analyzing theirnetwork traffic. The second was a survey, which were distributed to our sample ofpeople. It asked the sample questions about how they perceive their own behavioron a public wireless network. Thus, the survey allowed us to get an idea of theknowledge and the security awareness the public in general believe that they have.The results from our research indicate that people’s security awareness can andshould be improved. One first step towards improvement would be educationconcerning the risks that exist and how to avoid them, which is something that will be brought up in this paper.

Traffic merge on express-ways creates bottlenecks for traffic flow that potentially lead to traffic jams, especially in dense traffic. Cooperative speed harmonization (CSH), where vehicles are grouped and associated to virtual speed waves for group-wise joining at intersections, is proven to be efficient for on-ramp traffic merge. Based on CSH and considering variations of traffic density from joining roads, an adaptive wavelength adjustment (AWLA) mechanism is proposed in this paper. AWLA extends CSH by dynamically adjusting the length of segments in virtual waves according to the traffic densities of the joining roads. Therefore, roads with denser traffic may have larger segments to carry more vehicles through the intersection, which may improve the overall performance. Simulation results have shown that AWLA can achieve lower CO2 emissions and shorter travel time compared to CSH with static segment settings.

Embedded DSP computing is currently shifting towards manycore architectures in order to cope with the ever growing computational demands. Actor based dataflow languages are being considered as a programming model. In this paper we present a code generator for CAL, one such dataflow language. We propose to use a compilation tool with two intermediate representations. We start from a machine model of the actors that provides an ordering for testing of conditions and firing of actions. We then generate an Action Execution Intermediate Representation that is closer to a sequential imperative language like C and Java. We describe our two intermediate representations and show the feasibility and portability of our approach by compiling a CAL implementation of the Two-Dimensional Inverse Discrete Cosine Transform on a general purpose processor, on the Epiphany manycore architecture and on the Ambric massively parallel processor array. © 2014 IEEE., HiPEC

User involvement in information system development, as well as in digital innovation processes, is viewed as a key element for success. By introducing users in IS projects, ethical consideration is needed. Even though ethical theoretical frameworks are available in the IS (and other) spheres; cheap and fast methods and tools for applying ethics efficiently and effectively in everyday design and development work remain scarce. This paper presents a suggested heuristics-based tool that bears the promise of quick integration, and effective and efficient application of ethics in user-involved IS projects.

User involvement in information system development, as well as in digital innovation processes, is viewed as a key element for success. By introducing users in IS projects, ethical consideration is needed. Even though ethical theoretical frameworks are available in the IS (and other) spheres; cheap and fast methods and tools for applying ethics efficiently and effectively in everyday design and development work remain scarce. This paper presents a suggested heuristics-based tool that bears the promise of quick integration, and effective and efficient application of ethics in user-involved IS projects.

User involvement in information system development, as well as in digital innovation processes, is viewed as a key element for success. By introducing users in IS projects, ethical consideration is needed. Even though ethical theoretical frameworks are available in the IS (and other) spheres; cheap and fast methods and tools for applying ethics efficiently and effectively in everyday design and development work remain scarce. This paper presents a suggested heuristics-based tool that bears the promise of quick integration, and effective and efficient application of ethics in user-involved IS projects.

User involvement in information system development, as well as in digital innovation processes, is viewed as a key element for success. By introducing users in IS projects, ethical consideration is needed. Even though ethical theoretical frameworks are available in the IS (and other) spheres; cheap and fast methods and tools for applying ethics efficiently and effectively in everyday design and development work remain scarce. This paper presents a suggested heuristics-based tool that bears the promise of quick integration, and effective and efficient application of ethics in user-involved IS projects.

User involvement in information system development, as well as in digital innovation processes, is viewed as a key element for success. By introducing users in IS projects, ethical consideration is needed. Even though ethical theoretical frameworks are available in the IS (and other) spheres; cheap and fast methods and tools for applying ethics efficiently and effectively in everyday design and development work remain scarce. This paper presents a suggested heuristics-based tool that bears the promise of quick integration, and effective and efficient application of ethics in user-involved IS projects.

The three dimensional structure tensor algorithm (3D-STA) is often used in image processing applications to compute the optical flow or to detect local 3D structures and their directions. This algorithm is computationally expensive due to many computations that are required to calculate the gradient, the tensor, and to smooth every pixel of the image frames. Therefore, it is important to parallelize the implementation to achieve high performance. In this paper we present two parallel implementations of 3D-STA; namely moderately parallelized and highly parallelized implementation, on a massively parallel reconfigurable array. Finally, we evaluate the performance of the generated code and results are compared with another optical flow implementation. The throughput achieved by the moderately parallelized implementation is approximately half of the throughput of the Optical flow implementation, whereas the highly parallelized implementation results in a 2x gain in throughput as compared to the optical flow implementation. © 2012 IEEE.

User involvement in information system development, as well as in digital innovation processes, is viewed as a key element for success. By introducing users in IS projects, ethical consideration is needed. Even though ethical theoretical frameworks are available in the IS (and other) spheres; cheap and fast methods and tools for applying ethics efficiently and effectively in everyday design and development work remain scarce. This paper presents a suggested heuristics-based tool that bears the promise of quick integration, and effective and efficient application of ethics in user-involved IS projects.

Recently we proposed occam-pi as a high-levellanguage for programming coarse grained reconfigurable architectures. The constructs of occam-pi combine ideas from CSPand pi-calculus to facilitate expressing parallelism, communication, and reconfigurability. The feasability of this approachwas illustrated by developing a compiler framework to compile occam-pi implementations to the Ambric architecture. In this paper, we demonstrate the applicability of occam-pif or programing an array of functional units, eXtreme ProcessingPlatform (XPP). This is made possible by extending the compilerframework to target the XPP architecture, including automatic floating to fixed-point conversion. Different implementations of a FIR filter and a DCT algorithm were developed and evaluated on the basis of performance and resource consumption. The reported results reveal that the approach of using occam-pito program the category of coarse grained reconfigurable architectures appears to be promising. The resulting implementations are generally much superior to those programmed in C and comparable to those hand-coded in the low-level native language NML.

Advances on wireless communication and sensor systems enabled the growing usage of Wireless Sensor Networks. This kind of network is being used to support a number of new emerging applications, thus the importance in studying the efficiency of new approaches to program them. This paper proposes a performance study of an application using high-level mobile agent model for Wireless Sensor Networks. The analysis is based on a mobile object tracking system, a classical WSN application. It is assumed that the sensor nodes are static, while the developed software is implemented as mobile agents by using the AFME framework. The presented project follows a Model-Driven Development (MDD) methodology using UML (Unified Modeling Language) models. Metrics related to dynamic features of the implemented solution are extracted from the deployed application, allowing a design space exploration in terms of metrics such as performance, memory and energy consumption. © Springer-Verlag Berlin Heidelberg 2011.