| 1. |
- Kalaivaani, P. C. D., et al.
(författare)
-
Advanced lightweight feature interaction in deep neural networks for improving the prediction in click through rate
- 2021
-
Ingår i: Annals of Operations Research. - : Springer. - 0254-5330 .- 1572-9338.
-
Tidskriftsartikel (refereegranskat)abstract
- Online advertising has expanded to a hundred-dollar billion industry in recent years, with sales growing at faster rate in every year. Prediction of the click-through rate (CTR) is an important role in recommended systems and online ads. Click through rating (CTR) is the newest evolution in the advertising and marketing digital world. It is essential for any online advertising company in real time to display the appropriate ads to the right users in the correct context. A huge amount of research work proposed considers each ad separately and does not takes in the relationship with other ads that may have an impact on Click Through Rate. A Factorization machine, a more generalized predictor like support vector machines (SVM) is not able to estimate reliable parameters under sparsity. The main drawback is that the primary features and existing algorithms considers the large weighted parameters. KGCN (Knowledge graph-based convolution network) overcomes the drawback and works on alternating graphs which creates additional clustering and node comparison with high latency and performance. A new framework DeepLight Weight is proposed to resolve the high server latency and high usage of memory issues in online advertising. This work presents a framework to improve the CTR predictions with an objective to accelerate the model inference, prune redundant parameters and the dense embedding vectors. Field Weighed Factorization machine helps to organize the data features with high structure to improve the accuracy. For clearing latency issues, structural pruning makes the algorithm work with dense matrices by combining and executing the individual matrix values or neural nodes.
|
|
| 2. |
- Winter, Jeff, et al.
(författare)
-
Identifying organizational barriers : a case study of usability work when developing software in the automation industry
- 2014
-
Ingår i: JOURNAL OF SYSTEMS AND SOFTWARE. - : Elsevier. - 0164-1212 .- 1873-1228. ; 88, s. 54-73
-
Tidskriftsartikel (refereegranskat)abstract
- This study investigates connections between usability efforts and organizational factors. This is an important field of research which so far appears to be insufficiently studied and discussed. It illustrates problems when working with software engineering tasks and usability requirements. It deals with a large company that manufactures industrial robots with an advanced user interface, which wanted to introduce usability KPIs, to improve product quality. The situation in the company makes this difficult, due to a combination of organizational and behavioural factors that led to a "wicked problem" that caused conflicts, breakdowns and barriers. Addressing these problems requires a holistic view that places context in the foreground and technological solutions in the background. Developing the right product requires communication and collaboration between multiple stakeholders. The inclusion of end users, who fully understand their own work context, is vital. Achieving this is dependent on organizational change, and management commitment. One step to beginning this change process may be through studying ways to introduce user-centred design processes. (C) 2013 Elsevier Inc. All rights reserved.
|
|
| 3. |
- Faraon, Montathar, 1983-
(författare)
-
Webbutveckling med PHP och MySQL
- 2016. - 2
-
Bok (övrigt vetenskapligt/konstnärligt)abstract
- PHP är ett av de ledande programmeringsspråken för webbutveckling. Det är ett flexibelt och enkelt språk som används för att skapa dynamiska webbplatser. Denna bok ger en tillgänglig introduktion till PHP och databashantering. Läsaren får den kunskap som krävs för att snabbt utveckla egna webbapplikationer.Boken förutsätter inga tidigare erfarenheter av webbprogrammering. Läsaren leds framåt genom ett rikt utbud av övningar som ger möjlighet att tillämpa innehållet.Denna andra utgåva av boken har reviderats och uppdaterats grundligt. Bland nyheterna finns PHP 7, databashantering med PHP Data Objects (PDO), fler helhetsexempel samt kodexempel i färg.Webbutveckling med PHP och MySQL är avsedd för universitets- och gymnasiestudier i webbprogrammering, men är även en handbok för yrkesverksamma webbutvecklare och programmerare.
|
|
| 4. |
- Sodhro, Ali Hassan, 1986-, et al.
(författare)
-
Internet of medical things for independent living and re-learning
- 2021
-
Ingår i: GLOBAL HEALTH 2021 : The Tenth International Conference on Global Health Challenges At: Barcelona, Spain. - 9781612088921 ; , s. 1-5, s. 1-5
-
Konferensbidrag (övrigt vetenskapligt/konstnärligt)abstract
- This position paper gives better insight about the role and importance of Internet of Medical Things (IoMT) for independent living and re-learning for older adults. Sensing Technologies are the paradigm shift for transforming conventional healthcare practices into the smart, and self-assisted activities, which are envisioned for today's medical world. Internet of Things (IoT) and IoMT are the interrelated technologies for promoting independent living and re-learning practices. In this paper, re-learning is defined as the process for adults to recover useful instrumental activities of daily living skills that have been lost after an impairment.
|
|
| 5. |
- Wang, Qinghua, et al.
(författare)
-
Smart Sewage Water Management and Data Forecast
- 2021
-
Ingår i: 33rd Workshop of the Swedish Artificial Intelligence Society, SAIS 2021. - USA : Institute of Electrical and Electronics Engineers (IEEE). - 9781665442367
-
Konferensbidrag (övrigt vetenskapligt/konstnärligt)abstract
- There is currently an ongoing digital transformation for sewage and wastewater management. By automating data collection and enabling remote monitoring, we will not only be able to save abundant human resources but also enabling predictive maintenance which is based on big data analytics. This paper presents a smart sewage water management system which is currently under development in southern Sweden. Real-time data can be collected from over 500 sensors which have already been partially deployed. Preliminary data analysis shows that we can build statistical data models for ground water, rainfall, and sewage water flows, and use those models for data forecast and anomaly detection.
|
|
| 6. |
- Andersson, Anders-Petter, 1969-, et al.
(författare)
-
Same but different : composing for interactivity
- 2008
-
Ingår i: Audio Mostly Conference. - Luleå University, Interactive Institute, Sonic. ; , s. 80-85
-
Konferensbidrag (refereegranskat)abstract
- 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.
|
|
| 7. |
- Chen, Eric Zhi, 1963-, et al.
(författare)
-
A database of linear codes over F13 with minimum distance bounds and new quasi-twisted codes from a heuristic search algorithm
- 2015
-
Ingår i: Journal of Algebra Combinatorics Discrete Structures and Application. - Turkey. - 2148-838X. ; 2:1, s. 1-16
-
Tidskriftsartikel (refereegranskat)abstract
- 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.
|
|
| 8. |
- Arvidsson, Åke, 1957-, et al.
(författare)
-
Modelling user experience of adaptive streaming video over fixed capacity links
- 2021
-
Ingår i: Performance evaluation (Print). - 0166-5316 .- 1872-745X. ; 148, s. 1-12
-
Tidskriftsartikel (refereegranskat)abstract
- 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.
|
|
| 9. |
- Arvidsson, Åke, 1957-, et al.
(författare)
-
Web metrics for the next generation performance enhancing proxies
- 2019
-
Ingår i: 2019 27TH INTERNATIONAL CONFERENCE ON SOFTWARE, TELECOMMUNICATIONS AND COMPUTER NETWORKS (SOFTCOM). - : IEEE. - 9789532900880 ; , s. 171-176
-
Konferensbidrag (refereegranskat)abstract
- 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).
|
|
| 10. |
- Atxutegi, Eneko, et al.
(författare)
-
On the move with TCP in current and future mobile networks
- 2017
-
Ingår i: Proceedings of the 8th International Conference on the Network of the Future, London, United Kingdom, November 2017.
-
Konferensbidrag (övrigt vetenskapligt/konstnärligt)abstract
- 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.
|
|
| 11. |
- Carlsson, Bengt, et al.
(författare)
-
Differences between the iterated prisoner's dilemma and the chicken game under noisy conditions
- 2002
-
Konferensbidrag (övrigt vetenskapligt/konstnärligt)abstract
- 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.
|
|
| 12. |
- Chen, Eric Zhi, 1963-
(författare)
-
Constructions of 2-generator quasi-cyclic codes
- 2006
-
Ingår i: Proceedings of the tenth International Workshop on Algebraic and Combinatorial Coding Theory. - Zvenigorod : Institute of Information Transmission Problems of Russian Academy of Sciences. ; , s. 60-63
-
Konferensbidrag (refereegranskat)
|
|
| 13. |
- Chen, Eric Zhi, 1963-
(författare)
-
Constructions of quasi-cyclic two-weigh codes
- 2006
-
Ingår i: Proc. of the tenth International Workshop on Algebraic and Combinatorial Coding Theory (ACCT-10). ; , s. 56-59
-
Konferensbidrag (refereegranskat)abstract
- 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.
|
|
| 14. |
- Chen, Eric Zhi, 1963-
(författare)
-
Further results on difference triangle sets
- 1994
-
Ingår i: IEEE Transactions on Information Theory. - 0018-9448 .- 1557-9654. ; 40:4, s. 1268-1270
-
Tidskriftsartikel (refereegranskat)abstract
- 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.
|
|
| 15. |
- Chen, Eric Zhi, 1963-
(författare)
-
Good quasi-cyclic codes derived from irreducible cyclic codes
- 2005
-
Ingår i: Proceedings of Optimal Codes and Related Topics (OC2005). ; , s. 74-81
-
Konferensbidrag (refereegranskat)abstract
- 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.
|
|
| 16. |
- Chen, Eric Zhi, 1963-
(författare)
-
New binary h-generator quasi-cyclic codes by augmentation and new minimum distance bounds
- 2016
-
Ingår i: Designs, Codes and Cryptography. - 0925-1022 .- 1573-7586. ; 80:1, s. 1-10
-
Tidskriftsartikel (refereegranskat)abstract
- 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.
|
|
| 17. |
- Chen, Eric Zhi, 1963-
(författare)
-
New constructions of a family of 2-generator quasi-cyclic two-weight codes and related codes
- 2007
-
Ingår i: Proc. of 2007 IEEE Internat. Symp. on Inform. Theory. - Piscataway, NJ : IEEE. - 9781424413973 ; , s. 2191-2195
-
Konferensbidrag (refereegranskat)abstract
- 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.
|
|
| 18. |
- Chen, Eric Zhi, 1963-
(författare)
-
New constructions of combinatorial designs and related codes
- 2002
-
Ingår i: Proceedings of the 8th International Workshop on Algebraic coding and Combinatorial Theory (ACCT-VIII). ; , s. 264-267
-
Konferensbidrag (refereegranskat)abstract
- 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.
|
|
| 19. |
- Chen, Eric Zhi, et al.
(författare)
-
New quasi-twisted codes over F11— minimum distance bounds and a new database
- 2015
-
Ingår i: Journal of Information and Optimization Sciences. - 0252-2667 .- 2169-0103. ; 36:1-2, s. 129-157
-
Tidskriftsartikel (refereegranskat)abstract
- One fundamental and challenging problem in coding theory is to optimize the parameters [n, k,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.
|
|
| 20. |
- Chen, Eric Zhi, 1963-
(författare)
-
New results on binary quasi-cyclic codes
- 2000
-
Ingår i: 2000 Ieee International Symposium on Information Theory. - : IEEE conference proceedings. - 0780358570 ; , s. 197-
-
Konferensbidrag (refereegranskat)abstract
- 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.
|
|
| 21. |
- Chen, Eric Zhi, 1963-
(författare)
-
Quasi-cyclic codes derived from cyclic codes
- 2004
-
Ingår i: Proceedings of Int. Symp. on Information Theory and its Applications (ISITA2004), Parma, Italy. ; , s. 162-165
-
Konferensbidrag (refereegranskat)
|
|
| 22. |
- Chen, Eric Zhi, 1963-
(författare)
-
Six new binary quasi-cyclic codes
- 1994
-
Ingår i: IEEE Transactions on Information Theory. - 0018-9448 .- 1557-9654. ; 40:5, s. 1666-1667
-
Tidskriftsartikel (refereegranskat)abstract
- 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.
|
|
| 23. |
- Chen, Wende, et al.
(författare)
-
New constructions of disjoint distinct difference sets
- 1998
-
Ingår i: Designs, Codes and Cryptography. - 0925-1022 .- 1573-7586. ; 15:2, s. 157-165
-
Tidskriftsartikel (refereegranskat)abstract
- New constructions of regular disjoint distinct difference sets (DDDS) are presented. In particular,multiplicative and additive DDDS are considered.
|
|
| 24. |
- Dootio, Mazhar Ali, et al.
(författare)
-
Secure and failure hybrid delay enabled a lightweight RPC and SHDS schemes in Industry 4.0 aware IIoHT enabled fog computing
- 2021
-
Ingår i: Mathematical Biosciences and Engineering. - 1547-1063 .- 1551-0018. ; 19:1, s. 513-536
-
Tidskriftsartikel (refereegranskat)abstract
- 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.
|
|
| 25. |
|
|
| 26. |
- Einarson, Daniel, et al.
(författare)
-
A participatory action research approach to developing assistive technologies for people suffering from cognitive disorders
- 2014
-
Ingår i: Abstract book. - 9788793053014
-
Konferensbidrag (refereegranskat)abstract
- Cognitive disorders, such as disorders on the autistic spectrum, Downs’s syndrome, etc. often imply significant constraints on communication between persons suffering from those, and the environment where they act. Meanwhile, governmental propositions on human rights emphasize equality concerning information, where overcoming such interaction challenges should be considered as strongly encouraged. This contribution discusses studies that have been performed towards municipalities, public institutions, and non-profit organizations, in southern Sweden. The studies aim to involve users throughout the development of an innovative concept of communication assistive software technology, by involving multiple types of users, such as: persons with disabilities, personal assistants, teachers for students with special needs, academics, and others. The studies and the resulted findings are discussed in regard to the participatory action research framework.
|
|
| 27. |
|
|
| 28. |
|
|
| 29. |
|
|
| 30. |
|
|
| 31. |
|
|
| 32. |
- Einarson, Daniel, 1960-
(författare)
-
Inheritance and coroutines
- 1998
-
Ingår i: ASU Newsletter. ; 24:3
-
Tidskriftsartikel (övrigt vetenskapligt/konstnärligt)
|
|
| 33. |
- Einarson, Daniel, et al.
(författare)
-
Learning structures of CDIO based projects in contexts of Demola
- 2015
-
Konferensbidrag (refereegranskat)abstract
- Academia plays a main role in knowledge discovery and dissemination of knowledge. Amongst the fundamental reasons behind university education lies preparing students to use and contribute with that knowledge within contexts of industry, as well as society in large. We here see three types of actors, i.e., universities, students, and industry, which by several reasons all are gained by close cooperation already in university education. Quite often though we see a gap between education and possible student recruitment. Here, the value of being employable increases through work based projects supported by education. Even though we can see willingness according such kind of cooperation from both academia and industry, experiences show that there are barriers towards actually implementing this. That may in turn depend on common lack of knowledge on how to establish university-industry connections, and how to negotiate on student involvement, ownership of work, etc. Conclusions therefore show a need for an established organization that mediates between academia and industry, and that have well developed structures for project workflow, project result ownership, etc. Demola may here have that role as an award winning platform for industry driven projects with focus on students. Demola provides a win-win-win relationship between university, students, and industry, and has clear structures for cooperation between those. Experiences have shown that Demola is promising as a mediator, as well as a provider of multi-disciplinary industry close projects, where those may be plugged into educational programs in suitable ways. This contribution will provide an overview of Demola as a platform for industry close student projects. Demola may furthermore be used as a platform for research projects. Experiences will here be covered as a concrete example on a Demola student project. Moreover, learning outcomes in contexts of CDIO Syllabus, evaluations, and corresponding CDIO-standards, will be presented.
|
|
| 34. |
|
|
| 35. |
|
|
| 36. |
- Einarson, Daniel, 1960-
(författare)
-
On transparent distributed systems
- 2001
-
Ingår i: Proceedings of the 27th conference of the ASU.
-
Konferensbidrag (övrigt vetenskapligt/konstnärligt)
|
|
| 37. |
|
|
| 38. |
|
|
| 39. |
- Einarson, Daniel, 1960-, et al.
(författare)
-
Smart home techniques for young people with functional disabilities
- 2020
-
Ingår i: ACHI 2020. - 9781612087610 ; , s. 294-300
-
Konferensbidrag (refereegranskat)abstract
- A purpose behind the United Nation’s Agenda 2030is that no one shall be left behind, which implies that supportfor vulnerable people shall be seen as clearly significant. Inthat context, assistive technologies serve purposes of improvingdisabled individuals’ inclusiveness and overall well-being. Thiscontribution covers ongoing experiments on techniquesdeveloped for Smart Homes, where the outcomes of suchdevelopments are targeted towards young people withfunctional disabilities, in order to provide them withindependence in their own living space.
|
|
| 40. |
|
|
| 41. |
|
|
| 42. |
|
|
| 43. |
- Habtegebreil, Haile, et al.
(författare)
-
Impact of TCP BBR on CUBIC traffic : a mixed workload evaluation
- 2018
-
Konferensbidrag (refereegranskat)abstract
- A recently proposed congestion control algorithm (CCA) called BBR (Bottleneck Bandwidth and Round-trip propagation time) has shown a lot of promise in avoiding some of the problems that have plagued loss-based CCAs. Nevertheless, deployment of a new alternative algorithm requires a thorough evaluation of the effect of the proposed alternative on established transport protocols like TCP CUBIC. Furthermore, evaluations that consider the heterogeneity of Internet traffic sizes would provide a useful insight into the deployability of an algorithm that introduces sweeping changes across multiple algorithm components. Yet, most evaluations of BBR’s impact and competitive fairness have focused on the steady-state performance of large flows. This work expands on previous studies of BBR by evaluating BBR’s impact when the traffic consists of flows of different sizes. Our experiments show that under certain circumstances BBR’s startup phase can result in a significant reduction of the throughput of competing large CUBIC flows and the utilization of the bottleneck link. In addition, the steady-state operation of BBR can have negative impact on the performance of bursty flows using loss-based CCAs over bottlenecks with buffer sizes as high as two times the bandwidth-delay product.
|
|
| 44. |
- Johansson, Michael, 1962-
(författare)
-
The eight continent : design for an intentional surprise
- 2013
-
Ingår i: Proceedings. - Los Alamitos : IEEE Computer Society. - 9781479922451 ; , s. 232-239
-
Konferensbidrag (refereegranskat)abstract
- In this paper I will present and discuss the design thinking, methods, processes and some examples of work, that demonstrates how I together with different co-creators set up a work practice, using digital 3d objects and images. That in different ways and formats helps us to explore how a database, a set of rules can be used in a dialogue with artistic work practice and how such a process can be used to create images and animation in a variety of design and art projects. The main example is a project called Conversation China that still is in its making, here we work with rather complex processes, involving several digital analogue techniques as the basis for creating the images for a 150 pieces porcelain dinner set. My interest in this work is how the intention of the artist or designer is transferred and later embedded in the procedural or algorithmic process and how this intent is organized and set up to secure an desired outcome, mixing the possibilities of the digital media object with manual editing and artistic craftsmanship. With the idea of design fiction, we continue to ask and explore how intent can be critical to the design process as well as the final result, that is rendered between the procedural techniques and the artistic intention. What this paper tries to put forward is how we designed and set up environments for working with non linear and procedural media, their different expressions and forms by using explorable prototypes and design thinking?
|
|
| 45. |
- Lakhan, Abdullah, et al.
(författare)
-
Multi-layer latency aware workload assignment of E-Transport IoT applications in mobile sensors cloudlet cloud networks
- 2021
-
Ingår i: Electronics. - Switzerland : MDPI. - 2079-9292. ; 10:14, s. 1-25
-
Tidskriftsartikel (refereegranskat)abstract
- These days, with the emerging developments in wireless communication technologies, such as 6G and 5G and the Internet of Things (IoT) sensors, the usage of E-Transport applications has been increasing progressively. These applications are E-Bus, E-Taxi, self-autonomous car, E-Train and E-Ambulance, and latency-sensitive workloads executed in the distributed cloud network. Nonetheless, many delays present in cloudlet-based cloud networks, such as communication delay, round-trip delay and migration during the workload in the cloudlet-based cloud network. However, the distributed execution of workloads at different computing nodes during the assignment is a challenging task. This paper proposes a novel Multi-layer Latency (e.g., communication delay, round-trip delay and migration delay) Aware Workload Assignment Strategy (MLAWAS) to allocate the workload of E-Transport applications into optimal computing nodes. MLAWAS consists of different components, such as the Q-Learning aware assignment and the Iterative method, which distribute workload in a dynamic environment where runtime changes of overloading and overheating remain controlled. The migration of workload and VM migration are also part of MLAWAS. The goal is to minimize the average response time of applications. Simulation results demonstrate that MLAWAS earns the minimum average response time as compared with the two other existing strategies.
|
|
| 46. |
- Mengistu, Dawit, et al.
(författare)
-
A grid based simulation environment for mobile distributed applications
- 2007
-
Ingår i: 2007 International Conference on Multimedia and Ubiquitous Engineering. - Los Alamitos, Calif. : IEEE Computer Society. - 9780769527772 ; , s. 1093-1099
-
Konferensbidrag (refereegranskat)abstract
- Using simulation environments to support mobile distributed application development has many benefits. Since mobile devices can be modeled as autonomous intelligent agents, the multi agent based simulation (MABS) approach is useful for such applications. In this paper, we propose a MABS platform on the computational Grid for mobile distributed computing. A prototype of the proposed platform is implemented and its performance characteristics are studied The findings of the experiment show that a Grid based MABS platform can provide a scalable simulation environment for mobile distributed applications.
|
|
| 47. |
- Mengistu, Dawit, et al.
(författare)
-
Middleware support for performance improvement of MABS applications in the Grid environment
- 2008
-
Ingår i: Multi-agent-based simulation VIII. - Berlin : Springer Berlin/Heidelberg. - 9783540709152 - 9783540709169 ; , s. 20-35
-
Konferensbidrag (refereegranskat)abstract
- The computational Grid is an infrastructure which enables the execution of applications demanding huge computing resources. Hence, it can be the right environment for large-scale Multi-agent based simulation (MABS) applications. However, due to the nature of the Grid and the characteristics of MABS, achieving optimum performance poses a great challenge. Performance study of MABS applications is therefore a necessary undertaking which requires an understanding of these characteristics and the extent of their influence. Moreover, owing to the dynamicity and heterogeneity of the Grid, it is difficult to achieve performance gains without a middleware support for application deployment and dynamic reconfiguration. This paper presents a study of the key features of MABS applications that affect performance and proposes a supportive middleware to MABS platforms. Experiments show that the proposed middleware can bring performance improvement for MABS applications on the Grid.
|
|
| 48. |
|
|
| 49. |
- Mengistu, Dawit, et al.
(författare)
-
Performance prediction of multi-agent based simulation applications on the Grid
- 2007
-
Ingår i: International Journal of Intelligent Technology. - 1305-6417. ; 2:3, s. 166-171
-
Tidskriftsartikel (refereegranskat)abstract
- A major requirement for Grid application developers is ensuring performance and scalability of their applications. Predicting the performance of an application demands understanding its specific features. This paper discusses performance modeling and prediction of multi-agent based simulation (MABS) applications on the Grid. An experiment conducted using a synthetic MABS workload explains the key features to be included in the performance model. The results obtained from the experiment show that the prediction model developed for the synthetic workload can be used as a guideline to understand to ,estimate the performance characteristics of real world simulation applications.
|
|
| 50. |
|
|
