| 1. |
- Smith, Göran, et al.
(författare)
-
Catalyzing knowledge transfer in innovation ecosystems through contests
- 2016
-
Ingår i: AMCIS 2016.
-
Konferensbidrag (refereegranskat)abstract
- Open innovation practices are gaining traction. Hence, the relevance of measures for engaging and managing heterogeneous groups of distributed complementors is rising. This mixed-method case study defines a pilot demonstration of emergent technology as an innovation ecosystem and utilizes a knowledge transfer lens to explore the impact of an open innovation contest. The contribution to the IS research stream is threefold. Firstly, the paper portrays that open innovation contests can spark coupled open innovation and facilitate innovation management, without lowering the generative capability. Secondly, it explains these gains by concluding that contests can catalyze cross-border knowledge transfer within innovation ecosystems. Thirdly, the paper moreover proposes that additional innovation deployment measures are needed in order for sustaining established relations and for aiding the implementation of innovation ideas beyond the contests.
|
|
| 2. |
- Smith, Göran, et al.
(författare)
-
ElectriCity innovation challenge 2015 : Experiences
- 2016
-
Ingår i: World Electric Vehicle Journal. - : MDPI AG. - 2032-6653. ; 8:3, s. 690-698
-
Tidskriftsartikel (refereegranskat)abstract
- ElectriCity Innovation Challenge 2015 was an open innovation contest in Gothenburg, Sweden. The main purpose was to surge public interest and involvement in ElectriCity, a demonstration arena for next-generation's electrified bus systems. The contest furthermore aimed to catalyse innovation that can contribute to making public transport more attractive, and to test a novel innovation platform that assembles data from buses and bus stops. The outcome was six events with a total of more than 800 attendants, 48 viable prototypes with potential to increase the modal share of electrified public transport and feedback on the innovation platform's potential for development.
|
|
| 3. |
|
|
| 4. |
- Ferizbegovic, Mina, et al.
(författare)
-
Willems' fundamental lemma based on second-order moments
- 2021
-
Ingår i: 2021 60TH IEEE CONFERENCE ON DECISION AND CONTROL (CDC). - : Institute of Electrical and Electronics Engineers (IEEE). - 9781665436595 ; , s. 396-401
-
Konferensbidrag (refereegranskat)abstract
- In this paper, we propose variations of Willems' fundamental lemma that utilize second-order moments such as correlation functions in the time domain and power spectra in the frequency domain. We believe that using a formulation with estimated correlation coefficients is suitable for data compression, and possibly can reduce noise. Also, the formulations in the frequency domain can enable modeling of a system in a frequency region of interest.
|
|
| 5. |
- Parsa, Javad, et al.
(författare)
-
Optimal Input Design Through Infinity Norm Minimization Using Proximal Mapping
- 2021
-
Ingår i: 2021 60TH IEEE CONFERENCE ON DECISION AND CONTROL (CDC). - : Institute of Electrical and Electronics Engineers (IEEE). ; , s. 4442-4447
-
Konferensbidrag (refereegranskat)abstract
- To avoid non-convexity of the criterion, various relaxations are typically used in input design. For example, the input may be assumed to be stationary and the design problem may be formulated in terms of the correlation coefficients. In this contribution, we instead propose a method to directly design the input sequence. This allows to maximize the information obtained from short-time (transient) experiments using non-stationary inputs. We do this by fitting the achieved Fisher matrix to a desired target matrix in a matrix sense, using the infinity norm. The target matrix can either be the desired Fisher matrix, obtained from quality considerations of the intended use of the model, or a matrix directly representing the performance of the application. An often used quantity is the Hessian of the so called the application cost. Thus, the method is formulated as a time domain optimization problem that is non-convex. This optimization problem is solved by alternative minimization and proximal mapping, where we split the problem in three steps where in each step, the cost function is minimized in respect to one of the variables and other variables are kept fix. We repeat these three steps until convergence. The procedure of the algorithm is summarized in a pseudo code. Finally, we illustrate our method in two numerical examples.
|
|
