SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(Haugland Dag) "

Sökning: WFRF:(Haugland Dag)

  • Resultat 1-8 av 8
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • Balsnes, Anne Haugland, et al. (författare)
  • Unfreezing identities: Exploring choral singing in the workplace
  • 2015
  • Ingår i: International Journal of Community Music. - : Intellect. - 1752-6299 .- 1752-6302. ; 8, s. 163-178
  • Tidskriftsartikel (refereegranskat)abstract
    • © 2015, Intellect Ltd Article. The topic of this article is the emerging trend of singing at work. The discussion is exemplified by results from case studies of singing interventions carried out at two different work places. The research comprised group interviews, participant observation and questionnaires. Our phenomenological and hermeneutic approach focuses mainly on the employees’ experience of singing at work. The analysis was driven by thematic coding. The discussion is illuminated mainly by Etienne Wenger’s community of practice theory. The following research questions were developed: how do the members of a workplace community experience choral singing? What implications do the participants see for themselves as individuals and for the organization? We identified four axes of impact: enjoyment, comfort zone, communality, and identity and roles. A workplace choir can challenge perceptions about how collegues view each other and transform individual identities. Consequently, the choir may also change the workplace as a practice community.
  •  
2.
  • Bauer, Joanna, et al. (författare)
  • A fast local search method for minimum energy broadcast in wireless ad hoc networks
  • 2009
  • Ingår i: OPERATIONS RESEARCH LETTERS. - : Elsevier BV. - 0167-6377. ; 37:2, s. 75-79
  • Tidskriftsartikel (refereegranskat)abstract
    • Local search methods are often used to reduce the power consumption of broadcast routing in wireless networks. For a classic method, sweep, the best available time complexity result is O(vertical bar V vertical bar(4)). We present an O(vertical bar V vertical bar(2))-time method, which exhaustively removes unnecessary transmissions yielding a solution comparable to that of sweep.
  •  
3.
  • Bauer, Joanna, et al. (författare)
  • New results on the time complexity and approximation ratio of the Broadcast Incremental Power algorithm
  • 2009
  • Ingår i: INFORMATION PROCESSING LETTERS. - : Elsevier BV. - 0020-0190. ; 109:12, s. 615-619
  • Tidskriftsartikel (refereegranskat)abstract
    • The Broadcast Incremental Power (BIP) algorithm is the most frequently cited method for the minimum energy broadcast routing problem. A recent survey concluded that BIP has O(|V|(3)) time complexity, and that its approximation ratio is at least 4.33. We strengthen these results to O(|V|(2)) and 4.598, respectively.
  •  
4.
  • Haugland, Dag, et al. (författare)
  • Compact Integer Programming Models for Optimal Tress in Wireless Networks
  • 2011
  • Ingår i: Wireless Network Design. - : Springer. - 9781441961105 - 9781441961112 ; , s. 219-246
  • Bokkapitel (övrigt vetenskapligt/konstnärligt)abstract
    • This book surveys state-of-the-art optimization modeling for design, analysis, and management of wireless networks, such as cellular and wireless local area networks (LANs), and the services they deliver. The past two decades have seen a tremendous growth in the deployment and use of wireless networks. The current-generation wireless systems can provide mobile users with high-speed data services at rates substantially higher than those of the previous generation. As a result, the demand for mobile information services with high reliability, fast response times, and ubiquitous connectivity continues to increase rapidly. The optimization of system performance has become critically important both in terms of practical utility and commercial viability, and presents a rich area for research. In the editors' previous work on traditional wired networks, we have observed that designing low cost, survivable telecommunication networks involves extremely complicated processes. Commercial products available to help with this task typically have been based on simulation and/or proprietary heuristics.  As demonstrated in this book, however, mathematical programming deserves a prominent place in the designer's toolkit. Convenient modeling languages and powerful optimization solvers have greatly facilitated the implementation of mathematical programming theory into the practice of commercial network design. These points are equally relevant and applicable in today’s world of wireless network technology and design. But there are new issues as well: many wireless network design decisions, such as routing and facility/element location, must be dealt with in innovative ways that are unique and distinct from wired (fiber optic) networks. The book specifically treats the recent research and the use of modeling languages and network optimization techniques that are playing particularly important and distinctive roles in the wireless domain.
  •  
5.
  • Jansson, Dag, et al. (författare)
  • Choral conducting education: The lifelong entanglement of competence, identity and meaning
  • 2020
  • Ingår i: Research Studies in Music Education. - 1321-103X .- 1834-5530.
  • Tidskriftsartikel (refereegranskat)abstract
    • © The Author(s) 2020. Choral singing is one of the most widespread musical activities, and choral conductors work in a variety of social settings that involve every imaginable type of choir and musical genre. The conductor role draws on a number of skills and competencies that are partly acquired through education but, equally importantly, through experience. Choral conductors shape their practice in highly individual fashions as amalgamations of background, formal education, career development and working situation. The present qualitative study seeks to uncover how choral conductor practices arise and unfold, by using Etienne Wenger’s theory of communities of practice and situated learning as the key analytical framework. The study elucidates the choral conducting practice as an ongoing educational project and theorises the dimensions of variety in choral conductors’ trajectories. The study situates the conducting practice in a Western choral tradition, based on interviews with a diverse sample of 20 conductors in Norway. The theoretical framework proved to be highly appropriate; however, applying it to the choral conducting practice requires the explicit positioning with regard to the academic debates on the theory’s development following Wenger’s original conceptualisation. The study therefore contributes to knowledge development in three ways – (1) by shedding new light on the theory, (2) by proposing a sub-structure to the main theory for its application to choral conducting and (3) by tracing some initial implications for choral conducting education. One of the key findings is that a conductor’s background continues to impact competence and identity throughout a conductor’s work-life, while practice seems to be predominant over formal education.
  •  
6.
  • Jansson, Dag, et al. (författare)
  • Nordic choral conductor education : Overview and research agenda
  • 2018
  • Ingår i: Nordisk musikkpedagogisk forskning Årbok 19. - Oslo : Norges musikkhøgskole. - 9788278532560 - 9788278532577 ; , s. 137-170
  • Bokkapitel (refereegranskat)abstract
    • The choral movement holds a prominent position in the Nordic countries,and choral singing is one of the top social activities in terms of the number ofpeople involved. While all these choirs need conductors and depend on choralleadership competence, we have limited knowledge of the existence and levelof available competence, qualitatively or quantitatively. Music academiesand universities are key providers of competence and capacity to meet thedemands of amateur and professional ensembles alike. This paper seeks toestablish a picture of university/academy-based education in choral conducting,with focus on the Scandinavian countries. Existing research is scarce, and theoverall aim of this initial effort is to provide a foundation for further research.We have pursued the following related research questions; which educationalprogrammes exist, what are their profiles in terms of the underlying thinkingand ensemble needs they serve, and what is the capacity in terms of number ofstudents? A variety of research data has been gathered, including curriculumreviews and interviews with conducting teachers and students from selectedinstitutions. Although we have been able to answer the research questionsto some degree, the study opens a series of new questions, which suggest anagenda for further research.
  •  
7.
  • Yuan, Di, et al. (författare)
  • Dual Decomposition for Computational Optimization of Minimum-Power Shared Broadcast Tree in Wireless Networks
  • 2012
  • Ingår i: IEEE Transactions on Mobile Computing. - : Institute of Electrical and Electronics Engineers (IEEE). - 1536-1233 .- 1558-0660. ; 11:12, s. 2008-2019
  • Tidskriftsartikel (refereegranskat)abstract
    • We consider the problem of constructing a shared broadcast tree (SBT) in wireless networks, such that the total power required for supporting broadcast initiated by all source nodes is minimal. In the well-studied minimum-energy broadcast (MEB) problem, the optimal tree varies by source. In contrast, SBT is source-independent, thus substantially reducing the overhead for information storage and processing. The SBT problem also differs from the range assignment problem (RAP), because the power for message forwarding in SBT, although being source-independent, depends on from which tree neighbor the message is received. We approach SBT from a computational optimization standpoint, and present a dual decomposition method applied to an optimization model that embeds multiple directed trees into a shared tree. For the dual decomposition method, some of the constraints in the model are preferably formulated implicitly. The dual decomposition scheme is coupled with a fast local search algorithm. We report computational results demonstrating the effectiveness of the proposed approach. In average, the performance gap to global optimality is less than three percent.
  •  
8.
  • Yuan, Di, et al. (författare)
  • Minimum-Energy Broadcast and Multicast in Wireless Networks: An Integer Programming Approach and Improved Heuristic Algorithms
  • 2008
  • Ingår i: Ad hoc networks. - : Institutionen för teknik och naturvetenskap. - 1570-8705 .- 1570-8713. ; 6:5, s. 696-717
  • Tidskriftsartikel (refereegranskat)abstract
    • Both integer programming models and heuristic algorithms have been proposed for finding minimum-energy broadcast and multicast trees in wireless ad hoc networks. Among heuristic algorithms, the broadcast/multicast incremental power (BIP/MIP) algorithm is most known. The theoretical performance of BIP/MIP has been quantified in several studies. To assess the empirical performance of BIP/MIP and other heuristic algorithms, it is necessary to compute an optimal tree or a very good lower bound of the optimum. In this paper, we present an integer programming approach as well as improved heuristic algorithms. Our integer programming approach comprises a novel integer model and a relaxation scheme. Unlike previously proposed models, the continuous relaxation of our model leads to a very sharp lower bound of the optimum. Our relaxation scheme allows for performance evaluation of heuristics without having to compute optimal trees. Our contributions to heuristic algorithms consist of the power-improving algorithm successive power adjustment (SPA), and improved time complexity of some previously suggested algorithms. We report extensive numerical experiments. Algorithm SPA finds better solutions in comparison to a host of other algorithms. Moreover, the integer programming approach shows that trees found by algorithm SPA are optimal or near-optimal.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-8 av 8

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy