[{"has_accepted_license":"1","status":"public","user_id":"477","ddc":["040"],"publisher":"Springer","_id":"375","page":"1239--1268","project":[{"name":"SFB 901","_id":"1"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"_id":"3","name":"SFB 901 - Project Area B"}],"citation":{"ieee":"M. von Detten, M. C. Platenius, and S. Becker, “Reengineering Component-Based Software Systems with Archimetrix,” <i>Journal of Software and Systems Modeling</i>, no. 4, pp. 1239--1268, 2014.","apa":"von Detten, M., Platenius, M. C., &#38; Becker, S. (2014). Reengineering Component-Based Software Systems with Archimetrix. <i>Journal of Software and Systems Modeling</i>, (4), 1239--1268. <a href=\"https://doi.org/10.1007/s10270-013-0341-9\">https://doi.org/10.1007/s10270-013-0341-9</a>","short":"M. von Detten, M.C. Platenius, S. Becker, Journal of Software and Systems Modeling (2014) 1239--1268.","chicago":"Detten, Markus von, Marie Christin Platenius, and Steffen Becker. “Reengineering Component-Based Software Systems with Archimetrix.” <i>Journal of Software and Systems Modeling</i>, no. 4 (2014): 1239--1268. <a href=\"https://doi.org/10.1007/s10270-013-0341-9\">https://doi.org/10.1007/s10270-013-0341-9</a>.","mla":"von Detten, Markus, et al. “Reengineering Component-Based Software Systems with Archimetrix.” <i>Journal of Software and Systems Modeling</i>, no. 4, Springer, 2014, pp. 1239--1268, doi:<a href=\"https://doi.org/10.1007/s10270-013-0341-9\">10.1007/s10270-013-0341-9</a>.","bibtex":"@article{von Detten_Platenius_Becker_2014, title={Reengineering Component-Based Software Systems with Archimetrix}, DOI={<a href=\"https://doi.org/10.1007/s10270-013-0341-9\">10.1007/s10270-013-0341-9</a>}, number={4}, journal={Journal of Software and Systems Modeling}, publisher={Springer}, author={von Detten, Markus and Platenius, Marie Christin and Becker, Steffen}, year={2014}, pages={1239--1268} }","ama":"von Detten M, Platenius MC, Becker S. Reengineering Component-Based Software Systems with Archimetrix. <i>Journal of Software and Systems Modeling</i>. 2014;(4):1239--1268. doi:<a href=\"https://doi.org/10.1007/s10270-013-0341-9\">10.1007/s10270-013-0341-9</a>"},"file_date_updated":"2018-03-20T07:15:26Z","date_updated":"2022-01-06T06:59:34Z","author":[{"full_name":"von Detten, Markus","first_name":"Markus","last_name":"von Detten"},{"last_name":"Platenius","first_name":"Marie Christin","full_name":"Platenius, Marie Christin"},{"full_name":"Becker, Steffen","last_name":"Becker","first_name":"Steffen"}],"year":"2014","title":"Reengineering Component-Based Software Systems with Archimetrix","doi":"10.1007/s10270-013-0341-9","abstract":[{"lang":"eng","text":"Many software development, planning, or analysis tasks require an up-to-date software architecture documentation. However, this documentation is often outdated, unavailable, or at least not available as a formal model which analysis tools could use. Reverse engineering methods try to fill this gap. However, as they process the system’s source code, they are easily misled by design deficiencies (e.g., violations of component encapsulation) which leaked into the code during the system’s evolution. Despite the high impact of design deficiencies on the quality of the resulting software architecture models, none of the surveyed related works is able to cope with them during the reverse engineering process. Therefore, we have developed the Archimetrix approach which semi-automatically recovers the system’s concrete architecture in a formal model while simultaneously detecting and removing design deficiencies. We have validated Archi metrix on a case-study system and two implementation variants of the CoCoME benchmark system. Results show that the removal of relevant design deficiencies leads to an architecture model which more closely matches the system’s conceptual architecture."}],"issue":"4","publication":"Journal of Software and Systems Modeling","type":"journal_article","date_created":"2017-10-17T12:42:05Z","file":[{"date_created":"2018-03-20T07:15:26Z","creator":"florida","file_id":"1399","success":1,"content_type":"application/pdf","file_name":"375-sosym.pdf","file_size":3356333,"access_level":"closed","relation":"main_file","date_updated":"2018-03-20T07:15:26Z"}]},{"department":[{"_id":"75"}],"type":"dissertation","date_created":"2017-10-17T12:42:05Z","file":[{"date_created":"2018-03-20T07:14:52Z","creator":"florida","content_type":"application/pdf","success":1,"file_id":"1398","date_updated":"2018-03-20T07:14:52Z","relation":"main_file","access_level":"closed","file_size":1476366,"file_name":"376-Herlich-Dissertation.pdf"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"_id":"2","name":"SFB 901 - Project Area A"}],"abstract":[{"lang":"eng","text":"Radio access networks (RANs) have become one of the largest energy consumers of communication technology [LLH+13] and their energy consumption is predicted to increase [FFMB11]. To reduce the energy consumption of RANs different techniques have been proposed. One of the most promising techniques is the use of a low-power sleep mode. However, a sleep mode can also reduce the performance. In this dissertation, I quantify how much energy can be conserved with a sleep mode and which negative effects it has on the performance of RANs. Additionally, I analyze how a sleep mode can be enabled more often and how the performance can be kept high. First, I quantify the effect of power-cycle durations on energy consumption and latency in an abstract queuing system. This results in a trade-off between energy consumption and latency for a single base station (BS). Second, I show that considering a network as a whole (instead of each BS individually) allows the energy consumption to be reduced even further. After these analyses, which are not specific for RANs, I study RANs for the rest of the dissertation. RANs need to both detect and execute the requests of users. Because detection and execution of requests have different requirements, I analyze them independently. I quantify how the number of active BSs can be reduced if the detection ranges of BSs are increased by cooperative transmissions. Next, I analyze how more BSs can be deactivated if the remaining active BSs cooperate to transmit data to the users. However, in addition to increasing the range, cooperative transmissions also radiate more power. This results in higher interference for other users which slows their transmissions down and, thus, increases energy consumption. Therefore, I describe how the radiated power of cooperative transmissions can be reduced if instantaneous channel knowledge is available. Because the implementation in real hardware is impractical for demonstration purposes, I show the results of a simulation that incorporates all effects I studied analytically earlier. In conclusion, I show that a sleep mode can reduce the energy consumption of RANs if applied correctly. To apply a sleep mode correctly, it is necessary to consider power-cycle durations, power profiles, and the interaction of BSs. When this knowledge is combined the energy consumption of RANs can be reduced with only a slight loss of performance. Because this results in a trade-off between energy consumption and performance, each RAN operator has to decide which trade-off is preferred."}],"supervisor":[{"full_name":"Karl, Holger","first_name":"Holger","last_name":"Karl","id":"126"}],"citation":{"apa":"Herlich, M. (2014). <i>Reducing Energy Consumption of Radio Access Networks</i>. Universität Paderborn.","ieee":"M. Herlich, <i>Reducing Energy Consumption of Radio Access Networks</i>. Universität Paderborn, 2014.","chicago":"Herlich, Matthias. <i>Reducing Energy Consumption of Radio Access Networks</i>. Universität Paderborn, 2014.","short":"M. Herlich, Reducing Energy Consumption of Radio Access Networks, Universität Paderborn, 2014.","mla":"Herlich, Matthias. <i>Reducing Energy Consumption of Radio Access Networks</i>. Universität Paderborn, 2014.","ama":"Herlich M. <i>Reducing Energy Consumption of Radio Access Networks</i>. Universität Paderborn; 2014.","bibtex":"@book{Herlich_2014, title={Reducing Energy Consumption of Radio Access Networks}, publisher={Universität Paderborn}, author={Herlich, Matthias}, year={2014} }"},"file_date_updated":"2018-03-20T07:14:52Z","ddc":["040"],"user_id":"477","publisher":"Universität Paderborn","_id":"376","has_accepted_license":"1","date_updated":"2022-01-06T06:59:35Z","author":[{"first_name":"Matthias","last_name":"Herlich","full_name":"Herlich, Matthias"}],"title":"Reducing Energy Consumption of Radio Access Networks","status":"public","year":"2014"},{"date_created":"2017-10-17T12:42:05Z","file":[{"success":1,"content_type":"application/pdf","file_id":"1396","file_size":310961,"access_level":"closed","file_name":"378-re-chord_journal.pdf","date_updated":"2018-03-20T07:13:36Z","relation":"main_file","date_created":"2018-03-20T07:13:36Z","creator":"florida"}],"department":[{"_id":"79"}],"type":"journal_article","issue":"3","publication":"Theory of Computing Systems","abstract":[{"lang":"eng","text":"The Chord peer-to-peer system is considered, together with CAN, Tapestry and Pastry, as one of the pioneering works on peer-to-peer distributed hash tables (DHT) that inspired a large volume of papers and projects on DHTs as well as peer-to-peer systems in general. Chord, in particular, has been studied thoroughly, and many variants of Chord have been presented that optimize various criteria. Also, several implementations of Chord are available on various platforms. Though Chord is known to be very efficient and scalable and it can handle churn quite well, no protocol is known yet that guarantees that Chord is self-stabilizing, i.e., the Chord network can be recovered from any initial state in which the network is still weakly connected. This is not too surprising since it is known that the Chord network is not locally checkable for its current topology. We present a slight extension of the Chord network, called Re-Chord (reactive Chord), that turns out to be locally checkable, and we present a self-stabilizing distributed protocol for it that can recover the Re-Chord network from any initial state, in which the n peers are weakly connected, in O(nlogn) communication rounds. We also show that our protocol allows a new peer to join or an old peer to leave an already stable Re-Chord network so that within O(logn)^2) communication rounds the Re-Chord network is stable again."}],"doi":"10.1007/s00224-012-9431-2","author":[{"full_name":"Kniesburges, Sebastian","first_name":"Sebastian","last_name":"Kniesburges"},{"full_name":"Koutsopoulos, Andreas","first_name":"Andreas","last_name":"Koutsopoulos"},{"last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian","id":"20792"}],"title":"Re-Chord: A Self-stabilizing Chord Overlay Network","year":"2014","date_updated":"2022-01-06T06:59:35Z","citation":{"bibtex":"@article{Kniesburges_Koutsopoulos_Scheideler_2014, title={Re-Chord: A Self-stabilizing Chord Overlay Network}, DOI={<a href=\"https://doi.org/10.1007/s00224-012-9431-2\">10.1007/s00224-012-9431-2</a>}, number={3}, journal={Theory of Computing Systems}, publisher={Springer}, author={Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2014}, pages={591–612} }","ama":"Kniesburges S, Koutsopoulos A, Scheideler C. Re-Chord: A Self-stabilizing Chord Overlay Network. <i>Theory of Computing Systems</i>. 2014;(3):591-612. doi:<a href=\"https://doi.org/10.1007/s00224-012-9431-2\">10.1007/s00224-012-9431-2</a>","short":"S. Kniesburges, A. Koutsopoulos, C. Scheideler, Theory of Computing Systems (2014) 591–612.","chicago":"Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler. “Re-Chord: A Self-Stabilizing Chord Overlay Network.” <i>Theory of Computing Systems</i>, no. 3 (2014): 591–612. <a href=\"https://doi.org/10.1007/s00224-012-9431-2\">https://doi.org/10.1007/s00224-012-9431-2</a>.","ieee":"S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “Re-Chord: A Self-stabilizing Chord Overlay Network,” <i>Theory of Computing Systems</i>, no. 3, pp. 591–612, 2014.","mla":"Kniesburges, Sebastian, et al. “Re-Chord: A Self-Stabilizing Chord Overlay Network.” <i>Theory of Computing Systems</i>, no. 3, Springer, 2014, pp. 591–612, doi:<a href=\"https://doi.org/10.1007/s00224-012-9431-2\">10.1007/s00224-012-9431-2</a>.","apa":"Kniesburges, S., Koutsopoulos, A., &#38; Scheideler, C. (2014). Re-Chord: A Self-stabilizing Chord Overlay Network. <i>Theory of Computing Systems</i>, (3), 591–612. <a href=\"https://doi.org/10.1007/s00224-012-9431-2\">https://doi.org/10.1007/s00224-012-9431-2</a>"},"file_date_updated":"2018-03-20T07:13:36Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - Subproject C1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"publisher":"Springer","_id":"378","page":"591-612","ddc":["040"],"user_id":"477","status":"public","has_accepted_license":"1"},{"department":[{"_id":"63"}],"type":"conference","date_created":"2017-10-17T12:42:06Z","file":[{"date_created":"2018-03-20T07:12:57Z","creator":"florida","file_id":"1395","content_type":"application/pdf","success":1,"file_name":"379-COCOA14.pdf","access_level":"closed","file_size":214299,"relation":"main_file","date_updated":"2018-03-20T07:12:57Z"}],"abstract":[{"text":"In the leasing variant of Set Cover presented by Anthony et al.[1], elements U arrive over time and must be covered by sets from a familyF of subsets of U. Each set can be leased for K different periods of time.Let |U| = n and |F| = m. Leasing a set S for a period k incurs a cost ckS and allows S to cover its elements for the next lk time steps. The objectiveis to minimize the total cost of the sets leased, such that elements arrivingat any time t are covered by sets which contain them and are leased duringtime t. Anthony et al. [1] gave an optimal O(log n)-approximation forthe problem in the offline setting, unless P = NP [22]. In this paper, wegive randomized algorithms for variants of Set Cover Leasing in the onlinesetting, including a generalization of Online Set Cover with Repetitionspresented by Alon et al. [2], where elements appear multiple times andmust be covered by a different set at each arrival. Our results improve theO(log2(mn)) competitive factor of Online Set Cover with Repetitions [2]to O(log d log(dn)) = O(logmlog(mn)), where d is the maximum numberof sets an element belongs to.","lang":"eng"}],"publication":"Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA)","doi":"10.1007/978-3-319-12691-3_3","series_title":"LNCS","date_updated":"2022-01-06T06:59:36Z","author":[{"first_name":"Sebastian","last_name":"Abshoff","full_name":"Abshoff, Sebastian"},{"id":"37612","full_name":"Markarian, Christine","first_name":"Christine","last_name":"Markarian"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"year":"2014","title":"Randomized Online Algorithms for Set Cover Leasing Problems","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"citation":{"bibtex":"@inproceedings{Abshoff_Markarian_Meyer auf der Heide_2014, series={LNCS}, title={Randomized Online Algorithms for Set Cover Leasing Problems}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-12691-3_3\">10.1007/978-3-319-12691-3_3</a>}, booktitle={Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}, author={Abshoff, Sebastian and Markarian, Christine and Meyer auf der Heide, Friedhelm}, year={2014}, pages={25–34}, collection={LNCS} }","ama":"Abshoff S, Markarian C, Meyer auf der Heide F. Randomized Online Algorithms for Set Cover Leasing Problems. In: <i>Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>. LNCS. ; 2014:25-34. doi:<a href=\"https://doi.org/10.1007/978-3-319-12691-3_3\">10.1007/978-3-319-12691-3_3</a>","mla":"Abshoff, Sebastian, et al. “Randomized Online Algorithms for Set Cover Leasing Problems.” <i>Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 2014, pp. 25–34, doi:<a href=\"https://doi.org/10.1007/978-3-319-12691-3_3\">10.1007/978-3-319-12691-3_3</a>.","chicago":"Abshoff, Sebastian, Christine Markarian, and Friedhelm Meyer auf der Heide. “Randomized Online Algorithms for Set Cover Leasing Problems.” In <i>Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 25–34. LNCS, 2014. <a href=\"https://doi.org/10.1007/978-3-319-12691-3_3\">https://doi.org/10.1007/978-3-319-12691-3_3</a>.","short":"S. Abshoff, C. Markarian, F. Meyer auf der Heide, in: Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2014, pp. 25–34.","ieee":"S. Abshoff, C. Markarian, and F. Meyer auf der Heide, “Randomized Online Algorithms for Set Cover Leasing Problems,” in <i>Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 2014, pp. 25–34.","apa":"Abshoff, S., Markarian, C., &#38; Meyer auf der Heide, F. (2014). Randomized Online Algorithms for Set Cover Leasing Problems. In <i>Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i> (pp. 25–34). <a href=\"https://doi.org/10.1007/978-3-319-12691-3_3\">https://doi.org/10.1007/978-3-319-12691-3_3</a>"},"file_date_updated":"2018-03-20T07:12:57Z","user_id":"15504","ddc":["040"],"_id":"379","page":"25-34","has_accepted_license":"1","status":"public"},{"department":[{"_id":"63"}],"type":"conference","date_created":"2017-10-17T12:42:06Z","file":[{"access_level":"closed","file_size":166640,"file_name":"380-WINE2014.pdf","date_updated":"2018-03-20T07:05:59Z","relation":"main_file","content_type":"application/pdf","success":1,"file_id":"1394","creator":"florida","date_created":"2018-03-20T07:05:59Z"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"abstract":[{"text":"Network creation games model the creation and usage costs of networks formed by n selfish nodes. Each node v can buy a set of edges, each for a fixed price α > 0. Its goal is to minimize its private costs, i.e., the sum (SUM-game, Fabrikant et al., PODC 2003) or maximum (MAX-game, Demaine et al., PODC 2007) of distances from v to all other nodes plus the prices of the bought edges. The above papers show the existence of Nash equilibria as well as upper and lower bounds for the prices of anarchy and stability. In several subsequent papers, these bounds were improved for a wide range of prices α. In this paper, we extend these models by incorporating quality-of-service aspects: Each edge cannot only be bought at a fixed quality (edge length one) for a fixed price α. Instead, we assume that quality levels (i.e., edge lengths) are varying in a fixed interval [βˇ,β^] , 0 series = {LNCS}","lang":"eng"}],"citation":{"ieee":"A. Cord-Landwehr, A. Mäcker, and F. Meyer auf der Heide, “Quality of Service in Network Creation Games,” in <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 2014, pp. 423–428.","apa":"Cord-Landwehr, A., Mäcker, A., &#38; Meyer auf der Heide, F. (2014). Quality of Service in Network Creation Games. In <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i> (pp. 423–428). <a href=\"https://doi.org/10.1007/978-3-319-13129-0_34\">https://doi.org/10.1007/978-3-319-13129-0_34</a>","short":"A. Cord-Landwehr, A. Mäcker, F. Meyer auf der Heide, in: Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 423–428.","chicago":"Cord-Landwehr, Andreas, Alexander Mäcker, and Friedhelm Meyer auf der Heide. “Quality of Service in Network Creation Games.” In <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 423–28, 2014. <a href=\"https://doi.org/10.1007/978-3-319-13129-0_34\">https://doi.org/10.1007/978-3-319-13129-0_34</a>.","mla":"Cord-Landwehr, Andreas, et al. “Quality of Service in Network Creation Games.” <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 2014, pp. 423–28, doi:<a href=\"https://doi.org/10.1007/978-3-319-13129-0_34\">10.1007/978-3-319-13129-0_34</a>.","bibtex":"@inproceedings{Cord-Landwehr_Mäcker_Meyer auf der Heide_2014, title={Quality of Service in Network Creation Games}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-13129-0_34\">10.1007/978-3-319-13129-0_34</a>}, booktitle={Proceedings of the 10th International Conference on Web and Internet Economics (WINE)}, author={Cord-Landwehr, Andreas and Mäcker, Alexander and Meyer auf der Heide, Friedhelm}, year={2014}, pages={423–428} }","ama":"Cord-Landwehr A, Mäcker A, Meyer auf der Heide F. Quality of Service in Network Creation Games. In: <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>. ; 2014:423-428. doi:<a href=\"https://doi.org/10.1007/978-3-319-13129-0_34\">10.1007/978-3-319-13129-0_34</a>"},"file_date_updated":"2018-03-20T07:05:59Z","publication":"Proceedings of the 10th International Conference on Web and Internet Economics (WINE)","user_id":"15504","ddc":["040"],"doi":"10.1007/978-3-319-13129-0_34","_id":"380","page":"423-428","has_accepted_license":"1","date_updated":"2022-01-06T06:59:36Z","author":[{"first_name":"Andreas","last_name":"Cord-Landwehr","full_name":"Cord-Landwehr, Andreas"},{"full_name":"Mäcker, Alexander","first_name":"Alexander","last_name":"Mäcker","id":"13536"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"year":"2014","title":"Quality of Service in Network Creation Games","status":"public"},{"date_updated":"2022-01-06T06:59:36Z","author":[{"first_name":"Frank","last_name":"Brüseke","full_name":"Brüseke, Frank"},{"full_name":"Wachsmuth, Henning","first_name":"Henning","last_name":"Wachsmuth","id":"3900"},{"full_name":"Engels, Gregor","first_name":"Gregor","last_name":"Engels"},{"last_name":"Becker","first_name":"Steffen","full_name":"Becker, Steffen"}],"year":"2014","title":"PBlaman: performance blame analysis based on Palladio contracts","status":"public","user_id":"82920","_id":"3805","language":[{"iso":"eng"}],"page":"1975-2004","citation":{"ama":"Brüseke F, Wachsmuth H, Engels G, Becker S. PBlaman: performance blame analysis based on Palladio contracts. In: <i>Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment</i>. ; 2014:1975-2004.","bibtex":"@inproceedings{Brüseke_Wachsmuth_Engels_Becker_2014, title={PBlaman: performance blame analysis based on Palladio contracts}, number={12}, booktitle={Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment}, author={Brüseke, Frank and Wachsmuth, Henning and Engels, Gregor and Becker, Steffen}, year={2014}, pages={1975–2004} }","mla":"Brüseke, Frank, et al. “PBlaman: Performance Blame Analysis Based on Palladio Contracts.” <i>Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment</i>, no. 12, 2014, pp. 1975–2004.","short":"F. Brüseke, H. Wachsmuth, G. Engels, S. Becker, in: Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment, 2014, pp. 1975–2004.","chicago":"Brüseke, Frank, Henning Wachsmuth, Gregor Engels, and Steffen Becker. “PBlaman: Performance Blame Analysis Based on Palladio Contracts.” In <i>Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment</i>, 1975–2004, 2014.","apa":"Brüseke, F., Wachsmuth, H., Engels, G., &#38; Becker, S. (2014). PBlaman: performance blame analysis based on Palladio contracts. In <i>Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment</i> (pp. 1975–2004).","ieee":"F. Brüseke, H. Wachsmuth, G. Engels, and S. Becker, “PBlaman: performance blame analysis based on Palladio contracts,” in <i>Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment</i>, 2014, no. 12, pp. 1975–2004."},"publication":"Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment","issue":"12","department":[{"_id":"600"}],"type":"conference","date_created":"2018-08-02T13:38:28Z"},{"ddc":["004"],"user_id":"477","page":"203-210","_id":"382","has_accepted_license":"1","status":"public","project":[{"name":"SFB 901","_id":"1"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"name":"SFB 901 - Subproject A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"file_date_updated":"2018-11-02T13:34:46Z","citation":{"ieee":"J. Künsemöller, S. Brangewitz, H. Karl, and C.-J. Haake, “Provider Competition in Infrastructure-as-a-Service,” in <i>Proceedings of the 2014 IEEE International Conference on Services Computing (SCC)</i>, 2014, pp. 203–210.","mla":"Künsemöller, Jörn, et al. “Provider Competition in Infrastructure-as-a-Service.” <i>Proceedings of the 2014 IEEE International Conference on Services Computing (SCC)</i>, 2014, pp. 203–10, doi:<a href=\"https://doi.org/10.1109/SCC.2014.35\">10.1109/SCC.2014.35</a>.","apa":"Künsemöller, J., Brangewitz, S., Karl, H., &#38; Haake, C.-J. (2014). Provider Competition in Infrastructure-as-a-Service. In <i>Proceedings of the 2014 IEEE International Conference on Services Computing (SCC)</i> (pp. 203–210). <a href=\"https://doi.org/10.1109/SCC.2014.35\">https://doi.org/10.1109/SCC.2014.35</a>","bibtex":"@inproceedings{Künsemöller_Brangewitz_Karl_Haake_2014, title={Provider Competition in Infrastructure-as-a-Service}, DOI={<a href=\"https://doi.org/10.1109/SCC.2014.35\">10.1109/SCC.2014.35</a>}, booktitle={Proceedings of the 2014 IEEE International Conference on Services Computing (SCC)}, author={Künsemöller, Jörn and Brangewitz, Sonja and Karl, Holger and Haake, Claus-Jochen}, year={2014}, pages={203–210} }","ama":"Künsemöller J, Brangewitz S, Karl H, Haake C-J. Provider Competition in Infrastructure-as-a-Service. In: <i>Proceedings of the 2014 IEEE International Conference on Services Computing (SCC)</i>. ; 2014:203-210. doi:<a href=\"https://doi.org/10.1109/SCC.2014.35\">10.1109/SCC.2014.35</a>","short":"J. Künsemöller, S. Brangewitz, H. Karl, C.-J. Haake, in: Proceedings of the 2014 IEEE International Conference on Services Computing (SCC), 2014, pp. 203–210.","chicago":"Künsemöller, Jörn, Sonja Brangewitz, Holger Karl, and Claus-Jochen Haake. “Provider Competition in Infrastructure-as-a-Service.” In <i>Proceedings of the 2014 IEEE International Conference on Services Computing (SCC)</i>, 203–10, 2014. <a href=\"https://doi.org/10.1109/SCC.2014.35\">https://doi.org/10.1109/SCC.2014.35</a>."},"doi":"10.1109/SCC.2014.35","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:59:37Z","title":"Provider Competition in Infrastructure-as-a-Service","year":"2014","author":[{"first_name":"Jörn","last_name":"Künsemöller","full_name":"Künsemöller, Jörn"},{"full_name":"Brangewitz, Sonja","first_name":"Sonja","last_name":"Brangewitz"},{"id":"126","first_name":"Holger","last_name":"Karl","full_name":"Karl, Holger"},{"full_name":"Haake, Claus-Jochen","last_name":"Haake","first_name":"Claus-Jochen","id":"20801"}],"type":"conference","department":[{"_id":"75"},{"_id":"205"}],"file":[{"creator":"ups","date_created":"2018-11-02T13:34:46Z","relation":"main_file","date_updated":"2018-11-02T13:34:46Z","file_name":"06930535.pdf","file_size":228172,"access_level":"closed","file_id":"5250","success":1,"content_type":"application/pdf"}],"date_created":"2017-10-17T12:42:06Z","abstract":[{"text":"This paper explores how cloud provider competition influences instance pricing in an IaaS (Infrastructure-as-a-Service) market. When reserved instance pricing includes an on-demand price component in addition to a reservation fee (two-part tariffs), different providers might offer different price combinations, where the client’s choice depends on its load profile. We investigate a duopoly of providers and analyze stable market prices in two-part tariffs. Further, we study offers that allow a specified amount of included usage (three-part tariffs). Neither two-part nor three-part tariffs produce an equilibrium market outcome other than a service pricing that equals production cost, i.e., complex price structures do not significantly affect the results from ordinary Bertrand competition.","lang":"eng"}],"publication":"Proceedings of the 2014 IEEE International Conference on Services Computing (SCC)"},{"project":[{"name":"SFB 901","_id":"1"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"_id":"3","name":"SFB 901 - Project Area B"}],"file_date_updated":"2018-03-20T07:04:52Z","citation":{"ieee":"D. Wonisch, A. Schremmer, and H. Wehrheim, “Programs from Proofs -- Approach and Applications,” in <i>Proceedings of the Software Engineering Conference (SE)</i>, 2014, pp. 67–68.","apa":"Wonisch, D., Schremmer, A., &#38; Wehrheim, H. (2014). Programs from Proofs -- Approach and Applications. In <i>Proceedings of the Software Engineering Conference (SE)</i> (pp. 67–68).","mla":"Wonisch, Daniel, et al. “Programs from Proofs -- Approach and Applications.” <i>Proceedings of the Software Engineering Conference (SE)</i>, 2014, pp. 67–68.","bibtex":"@inproceedings{Wonisch_Schremmer_Wehrheim_2014, series={Lecture Notes in Informatics (LNI)}, title={Programs from Proofs -- Approach and Applications}, booktitle={Proceedings of the Software Engineering Conference (SE)}, author={Wonisch, Daniel and Schremmer, Alexander and Wehrheim, Heike}, year={2014}, pages={67–68}, collection={Lecture Notes in Informatics (LNI)} }","chicago":"Wonisch, Daniel, Alexander Schremmer, and Heike Wehrheim. “Programs from Proofs -- Approach and Applications.” In <i>Proceedings of the Software Engineering Conference (SE)</i>, 67–68. Lecture Notes in Informatics (LNI), 2014.","short":"D. Wonisch, A. Schremmer, H. Wehrheim, in: Proceedings of the Software Engineering Conference (SE), 2014, pp. 67–68.","ama":"Wonisch D, Schremmer A, Wehrheim H. Programs from Proofs -- Approach and Applications. In: <i>Proceedings of the Software Engineering Conference (SE)</i>. Lecture Notes in Informatics (LNI). ; 2014:67-68."},"user_id":"477","ddc":["040"],"page":"67-68","_id":"383","has_accepted_license":"1","status":"public","type":"conference","department":[{"_id":"77"}],"file":[{"file_name":"383-programmsFromProofsSE.pdf","file_size":66474,"access_level":"closed","relation":"main_file","date_updated":"2018-03-20T07:04:52Z","file_id":"1392","content_type":"application/pdf","success":1,"creator":"florida","date_created":"2018-03-20T07:04:52Z"}],"date_created":"2017-10-17T12:42:06Z","abstract":[{"lang":"eng","text":"Proof-carrying code approaches aim at safe execution of untrusted code by having the code producer attach a safety proof to the code which the code consumer only has to validate. Depending on the type of safety property, proofs can however become quite large and their validation - though faster than their construction - still time consuming. In this paper we introduce a new concept for safe execution of untrusted code. It keeps the idea of putting the time consuming part of proving on the side of the code producer, however, attaches no proofs to code anymore but instead uses the proof to transform the program into an equivalent but more efficiently verifiable program. Code consumers thus still do proving themselves, however, on a computationally inexpensive level only. Experimental results show that the proof effort can be reduced by several orders of magnitude, both with respect to time and space."}],"publication":"Proceedings of the Software Engineering Conference (SE)","main_file_link":[{"url":"http://eprints.uni-kiel.de/23752/"}],"series_title":"Lecture Notes in Informatics (LNI)","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:59:38Z","title":"Programs from Proofs -- Approach and Applications","year":"2014","author":[{"last_name":"Wonisch","first_name":"Daniel","full_name":"Wonisch, Daniel"},{"full_name":"Schremmer, Alexander","first_name":"Alexander","last_name":"Schremmer"},{"full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike","id":"573"}]},{"date_updated":"2022-01-06T06:59:42Z","has_accepted_license":"1","status":"public","year":"2014","title":"Privacy-Preserving Reputation Management","author":[{"first_name":"Ronald","last_name":"Petrlic","full_name":"Petrlic, Ronald"},{"last_name":"Lutters","first_name":"Sascha","full_name":"Lutters, Sascha"},{"first_name":"Christoph","last_name":"Sorge","full_name":"Sorge, Christoph"}],"doi":"10.1145/2554850.2554881","ddc":["040"],"user_id":"15504","page":"1712-1718","_id":"384","abstract":[{"lang":"eng","text":"Reputation systems provide reputation values of rated parties to users. These reputation values, typically aggregations of individual user ratings, shall be reliable, i.e. should enable a realistic assessment of the probability that the rated party behaves as expected in a transaction. In order for the reputation values to stay reliable and, thus, for the reputation system to provide a benefit, the system needs to be resistant against manipulations by users, the rated parties trying to improve their reputation values, and even against competitors trying to worsen a reputation value. At the same time, a reputation system shall provide privacy protection for users: rated parties shall not be able to learn who provided a certain rating. Otherwise users might not take part in the system as they fear bad feedback in revenge for bad ratings, or users do not want to be connected to certain transactions based on their provided ratings. In this paper we come up with a solution that provides both, reliability of reputation values on the one hand, and privacy protection for users on the other hand. In contrast to related work, our solution only makes use of a single reputation provider that needs to be trusted (to a certain extent) and does not require any bulletin boards to be present in the system. We make use of the Paillier cryptosystem to provide an aggregation of individual user ratings in a way that no party can learn which user provided a certain rating."}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"publication":"Proceedings of the 29th Symposium On Applied Computing (SAC)","file_date_updated":"2018-03-20T07:04:20Z","citation":{"apa":"Petrlic, R., Lutters, S., &#38; Sorge, C. (2014). Privacy-Preserving Reputation Management. In <i>Proceedings of the 29th Symposium On Applied Computing (SAC)</i> (pp. 1712–1718). <a href=\"https://doi.org/10.1145/2554850.2554881\">https://doi.org/10.1145/2554850.2554881</a>","ieee":"R. Petrlic, S. Lutters, and C. Sorge, “Privacy-Preserving Reputation Management,” in <i>Proceedings of the 29th Symposium On Applied Computing (SAC)</i>, 2014, pp. 1712–1718.","chicago":"Petrlic, Ronald, Sascha Lutters, and Christoph Sorge. “Privacy-Preserving Reputation Management.” In <i>Proceedings of the 29th Symposium On Applied Computing (SAC)</i>, 1712–18, 2014. <a href=\"https://doi.org/10.1145/2554850.2554881\">https://doi.org/10.1145/2554850.2554881</a>.","short":"R. Petrlic, S. Lutters, C. Sorge, in: Proceedings of the 29th Symposium On Applied Computing (SAC), 2014, pp. 1712–1718.","mla":"Petrlic, Ronald, et al. “Privacy-Preserving Reputation Management.” <i>Proceedings of the 29th Symposium On Applied Computing (SAC)</i>, 2014, pp. 1712–18, doi:<a href=\"https://doi.org/10.1145/2554850.2554881\">10.1145/2554850.2554881</a>.","ama":"Petrlic R, Lutters S, Sorge C. Privacy-Preserving Reputation Management. In: <i>Proceedings of the 29th Symposium On Applied Computing (SAC)</i>. ; 2014:1712-1718. doi:<a href=\"https://doi.org/10.1145/2554850.2554881\">10.1145/2554850.2554881</a>","bibtex":"@inproceedings{Petrlic_Lutters_Sorge_2014, title={Privacy-Preserving Reputation Management}, DOI={<a href=\"https://doi.org/10.1145/2554850.2554881\">10.1145/2554850.2554881</a>}, booktitle={Proceedings of the 29th Symposium On Applied Computing (SAC)}, author={Petrlic, Ronald and Lutters, Sascha and Sorge, Christoph}, year={2014}, pages={1712–1718} }"},"type":"conference","file":[{"date_created":"2018-03-20T07:04:20Z","creator":"florida","content_type":"application/pdf","success":1,"file_id":"1391","date_updated":"2018-03-20T07:04:20Z","relation":"main_file","access_level":"closed","file_size":505927,"file_name":"384-reputationsystem_01.pdf"}],"date_created":"2017-10-17T12:42:06Z"},{"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"citation":{"ama":"Petrlic R. <i>Privacy-Preserving Multiparty Digital Rights Management</i>. Universität Paderborn; 2014.","bibtex":"@book{Petrlic_2014, title={Privacy-Preserving Multiparty Digital Rights Management}, publisher={Universität Paderborn}, author={Petrlic, Ronald}, year={2014} }","mla":"Petrlic, Ronald. <i>Privacy-Preserving Multiparty Digital Rights Management</i>. Universität Paderborn, 2014.","short":"R. Petrlic, Privacy-Preserving Multiparty Digital Rights Management, Universität Paderborn, 2014.","chicago":"Petrlic, Ronald. <i>Privacy-Preserving Multiparty Digital Rights Management</i>. Universität Paderborn, 2014.","apa":"Petrlic, R. (2014). <i>Privacy-Preserving Multiparty Digital Rights Management</i>. Universität Paderborn.","ieee":"R. Petrlic, <i>Privacy-Preserving Multiparty Digital Rights Management</i>. Universität Paderborn, 2014."},"file_date_updated":"2018-03-20T07:03:37Z","type":"dissertation","date_created":"2017-10-17T12:42:07Z","file":[{"date_created":"2018-03-20T07:03:37Z","creator":"florida","file_id":"1390","success":1,"content_type":"application/pdf","relation":"main_file","date_updated":"2018-03-20T07:03:37Z","file_name":"385-arbeit1.pdf","access_level":"closed","file_size":2962042}],"has_accepted_license":"1","date_updated":"2022-01-06T06:59:45Z","author":[{"last_name":"Petrlic","first_name":"Ronald","full_name":"Petrlic, Ronald"}],"status":"public","title":"Privacy-Preserving Multiparty Digital Rights Management","year":"2014","user_id":"477","ddc":["040"],"_id":"385","publisher":"Universität Paderborn","language":[{"iso":"eng"}]},{"abstract":[{"text":"We present a privacy-preserving multiparty DRM scheme that does not need a trusted third party. Users anonymously buy content from content providers and anonymously execute it at content execution centers. The executions are unlinkable to each other. The license check is performed as part of the used ciphertext-policy attribute-based encryption (CP-ABE) and, thus, access control is cryptographically enforced. The problem of authorization proof towards the key center in an ABE scheme is solved by a combination with anonymous payments.","lang":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"publication":"Proceedings of the Sixth IFIP International Conference on New Technologies, Mobility and Security (NTMS)","file_date_updated":"2018-03-20T07:03:02Z","citation":{"mla":"Petrlic, Ronald, and Christoph Sorge. “Privacy-Preserving Digital Rights Management Based on Attribute-Based Encryption.” <i>Proceedings of the Sixth IFIP International Conference on New Technologies, Mobility and Security (NTMS)</i>, 2014, pp. 1–5, doi:<a href=\"https://doi.org/10.1109/NTMS.2014.6814044\">10.1109/NTMS.2014.6814044</a>.","ama":"Petrlic R, Sorge C. Privacy-Preserving Digital Rights Management based on Attribute-based Encryption. In: <i>Proceedings of the Sixth IFIP International Conference on New Technologies, Mobility and Security (NTMS)</i>. ; 2014:1-5. doi:<a href=\"https://doi.org/10.1109/NTMS.2014.6814044\">10.1109/NTMS.2014.6814044</a>","bibtex":"@inproceedings{Petrlic_Sorge_2014, title={Privacy-Preserving Digital Rights Management based on Attribute-based Encryption}, DOI={<a href=\"https://doi.org/10.1109/NTMS.2014.6814044\">10.1109/NTMS.2014.6814044</a>}, booktitle={Proceedings of the Sixth IFIP International Conference on New Technologies, Mobility and Security (NTMS)}, author={Petrlic, Ronald and Sorge, Christoph}, year={2014}, pages={1–5} }","apa":"Petrlic, R., &#38; Sorge, C. (2014). Privacy-Preserving Digital Rights Management based on Attribute-based Encryption. In <i>Proceedings of the Sixth IFIP International Conference on New Technologies, Mobility and Security (NTMS)</i> (pp. 1–5). <a href=\"https://doi.org/10.1109/NTMS.2014.6814044\">https://doi.org/10.1109/NTMS.2014.6814044</a>","ieee":"R. Petrlic and C. Sorge, “Privacy-Preserving Digital Rights Management based on Attribute-based Encryption,” in <i>Proceedings of the Sixth IFIP International Conference on New Technologies, Mobility and Security (NTMS)</i>, 2014, pp. 1–5.","short":"R. Petrlic, C. Sorge, in: Proceedings of the Sixth IFIP International Conference on New Technologies, Mobility and Security (NTMS), 2014, pp. 1–5.","chicago":"Petrlic, Ronald, and Christoph Sorge. “Privacy-Preserving Digital Rights Management Based on Attribute-Based Encryption.” In <i>Proceedings of the Sixth IFIP International Conference on New Technologies, Mobility and Security (NTMS)</i>, 1–5, 2014. <a href=\"https://doi.org/10.1109/NTMS.2014.6814044\">https://doi.org/10.1109/NTMS.2014.6814044</a>."},"type":"conference","file":[{"relation":"main_file","date_updated":"2018-03-20T07:03:02Z","file_name":"386-NTMS14.pdf","access_level":"closed","file_size":216843,"file_id":"1389","content_type":"application/pdf","success":1,"creator":"florida","date_created":"2018-03-20T07:03:02Z"}],"date_created":"2017-10-17T12:42:07Z","date_updated":"2022-01-06T06:59:46Z","has_accepted_license":"1","status":"public","title":"Privacy-Preserving Digital Rights Management based on Attribute-based Encryption","year":"2014","author":[{"last_name":"Petrlic","first_name":"Ronald","full_name":"Petrlic, Ronald"},{"last_name":"Sorge","first_name":"Christoph","full_name":"Sorge, Christoph"}],"ddc":["040"],"doi":"10.1109/NTMS.2014.6814044","user_id":"15504","page":"1-5","_id":"386"},{"doi":"10.1145/2635818","author":[{"full_name":"Awerbuch, Baruch","last_name":"Awerbuch","first_name":"Baruch"},{"last_name":"Richa","first_name":"Andrea W.","full_name":"Richa, Andrea W."},{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"},{"full_name":"Schmid, Stefan","first_name":"Stefan","last_name":"Schmid"},{"full_name":"Zhang, Jin","first_name":"Jin","last_name":"Zhang"}],"year":"2014","title":"Principles of Robust Medium Access and an Application to Leader Election","date_updated":"2022-01-06T06:59:47Z","date_created":"2017-10-17T12:42:07Z","file":[{"creator":"florida","date_created":"2018-03-20T07:02:33Z","relation":"main_file","date_updated":"2018-03-20T07:02:33Z","file_name":"387-a24-awerbuch_2_.pdf","access_level":"closed","file_size":521454,"file_id":"1388","success":1,"content_type":"application/pdf"}],"department":[{"_id":"79"}],"type":"journal_article","issue":"4","publication":"Transactions on Algorithms","abstract":[{"text":"This article studies the design of medium access control (MAC) protocols for wireless networks that are provably robust against arbitrary and unpredictable disruptions (e.g., due to unintentional external interference from co-existing networks or due to jamming). We consider a wireless network consisting of a set of n honest and reliable nodes within transmission (and interference) range of each other, and we model the external disruptions with a powerful adaptive adversary. This adversary may know the protocol and its entire history and can use this knowledge to jam the wireless channel at will at any time. It is allowed to jam a (1 − )-fraction of the timesteps, for an arbitrary constant > 0 unknown to the nodes. The nodes cannot distinguish between the adversarial jamming or a collision of two or more messages that are sent at the same time. We demonstrate, for the first time, that there is a local-control MAC protocol requiring only very limited knowledge about the adversary and the network that achieves a constant (asymptotically optimal) throughput for the nonjammed time periods under any of the aforementioned adversarial strategies. The derived principles are also useful to build robust applications on top of the MAC layer, and we present an exemplary study for leader election, one of the most fundamental tasks in distributed computing.","lang":"eng"}],"_id":"387","publisher":"ACM","user_id":"477","ddc":["040"],"status":"public","has_accepted_license":"1","citation":{"chicago":"Awerbuch, Baruch, Andrea W. Richa, Christian Scheideler, Stefan Schmid, and Jin Zhang. “Principles of Robust Medium Access and an Application to Leader Election.” <i>Transactions on Algorithms</i>, no. 4 (2014). <a href=\"https://doi.org/10.1145/2635818\">https://doi.org/10.1145/2635818</a>.","short":"B. Awerbuch, A.W. Richa, C. Scheideler, S. Schmid, J. Zhang, Transactions on Algorithms (2014).","apa":"Awerbuch, B., Richa, A. W., Scheideler, C., Schmid, S., &#38; Zhang, J. (2014). Principles of Robust Medium Access and an Application to Leader Election. <i>Transactions on Algorithms</i>, (4). <a href=\"https://doi.org/10.1145/2635818\">https://doi.org/10.1145/2635818</a>","ieee":"B. Awerbuch, A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Principles of Robust Medium Access and an Application to Leader Election,” <i>Transactions on Algorithms</i>, no. 4, 2014.","ama":"Awerbuch B, Richa AW, Scheideler C, Schmid S, Zhang J. Principles of Robust Medium Access and an Application to Leader Election. <i>Transactions on Algorithms</i>. 2014;(4). doi:<a href=\"https://doi.org/10.1145/2635818\">10.1145/2635818</a>","bibtex":"@article{Awerbuch_Richa_Scheideler_Schmid_Zhang_2014, title={Principles of Robust Medium Access and an Application to Leader Election}, DOI={<a href=\"https://doi.org/10.1145/2635818\">10.1145/2635818</a>}, number={4}, journal={Transactions on Algorithms}, publisher={ACM}, author={Awerbuch, Baruch and Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}, year={2014} }","mla":"Awerbuch, Baruch, et al. “Principles of Robust Medium Access and an Application to Leader Election.” <i>Transactions on Algorithms</i>, no. 4, ACM, 2014, doi:<a href=\"https://doi.org/10.1145/2635818\">10.1145/2635818</a>."},"file_date_updated":"2018-03-20T07:02:33Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}]},{"citation":{"bibtex":"@inproceedings{Wachsmuth_Trenkmann_Stein_Engels_2014, title={Modeling Review Argumentation for Robust Sentiment Analysis}, booktitle={Proceedings of COLING 2014, the 25th International Conference on Computational Linguistics: Technical Papers}, author={Wachsmuth, Henning and Trenkmann, Martin and Stein, Benno and Engels, Gregor}, year={2014}, pages={553–564} }","ama":"Wachsmuth H, Trenkmann M, Stein B, Engels G. Modeling Review Argumentation for Robust Sentiment Analysis. In: <i>Proceedings of COLING 2014, the 25th International Conference on Computational Linguistics: Technical Papers</i>. ; 2014:553-564.","mla":"Wachsmuth, Henning, et al. “Modeling Review Argumentation for Robust Sentiment Analysis.” <i>Proceedings of COLING 2014, the 25th International Conference on Computational Linguistics: Technical Papers</i>, 2014, pp. 553–64.","short":"H. Wachsmuth, M. Trenkmann, B. Stein, G. Engels, in: Proceedings of COLING 2014, the 25th International Conference on Computational Linguistics: Technical Papers, 2014, pp. 553–564.","chicago":"Wachsmuth, Henning, Martin Trenkmann, Benno Stein, and Gregor Engels. “Modeling Review Argumentation for Robust Sentiment Analysis.” In <i>Proceedings of COLING 2014, the 25th International Conference on Computational Linguistics: Technical Papers</i>, 553–64, 2014.","ieee":"H. Wachsmuth, M. Trenkmann, B. Stein, and G. Engels, “Modeling Review Argumentation for Robust Sentiment Analysis,” in <i>Proceedings of COLING 2014, the 25th International Conference on Computational Linguistics: Technical Papers</i>, 2014, pp. 553–564.","apa":"Wachsmuth, H., Trenkmann, M., Stein, B., &#38; Engels, G. (2014). Modeling Review Argumentation for Robust Sentiment Analysis. In <i>Proceedings of COLING 2014, the 25th International Conference on Computational Linguistics: Technical Papers</i> (pp. 553–564)."},"publication":"Proceedings of COLING 2014, the 25th International Conference on Computational Linguistics: Technical Papers","date_created":"2018-08-11T16:13:24Z","department":[{"_id":"600"}],"type":"conference","author":[{"id":"3900","last_name":"Wachsmuth","first_name":"Henning","full_name":"Wachsmuth, Henning"},{"full_name":"Trenkmann, Martin","last_name":"Trenkmann","first_name":"Martin"},{"full_name":"Stein, Benno","first_name":"Benno","last_name":"Stein"},{"first_name":"Gregor","last_name":"Engels","full_name":"Engels, Gregor"}],"title":"Modeling Review Argumentation for Robust Sentiment Analysis","status":"public","year":"2014","date_updated":"2022-01-06T06:59:47Z","_id":"3877","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://www.aclweb.org/anthology/C14-1053.pdf"}],"page":"553-564","user_id":"82920"},{"user_id":"15504","ddc":["040"],"_id":"389","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:59:49Z","has_accepted_license":"1","status":"public","title":"Ontology-based Representation of Optimization Models","year":"2014","author":[{"last_name":"Stapel","first_name":"Florian","full_name":"Stapel, Florian"},{"full_name":"Suhl, Lena","first_name":"Lena","last_name":"Suhl"}],"type":"report","file":[{"creator":"florida","date_created":"2018-03-20T07:01:29Z","access_level":"closed","file_size":595852,"file_name":"389-201x_-_Stapel__Suhl_-_Ontology-based_Representation_of_Optimization_Models.pdf","date_updated":"2018-03-20T07:01:29Z","relation":"main_file","content_type":"application/pdf","success":1,"file_id":"1386"}],"date_created":"2017-10-17T12:42:07Z","abstract":[{"text":"This article presents a new approach for representing and processing abstract optimization models. Confronted with model and data integration tasks for distributed Decision Support Systems which are especially composed out of software services, we describe model constituents such as constraints both structurally and semantically. Within our approach, typed model constituents can be integrated into complete models and the instantiation of model constituents itself with data and data models can be wrapped into semantic software services. Besides others, this supports the automated generation of adaptors and the search for and composition of services. The basic idea of our approach is to represent the optimization models as instance knowledge of different ontologies for both optimization and application domains. By separating the model expression structure from the goal and constraint conceptualizations predefined modeling constructs can be reused, where we do not only separate the model structure from data, but can also abstract the structure from a specific data model. We present an XML and ontology-query based approach for this separation and demonstrate the resulting flexible model integration procedure out of reusable goal and constraint types on a network flow problem.","lang":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"15","name":"SFB 901 - Subprojekt C3"},{"name":"SFB 901 - Project Area C","_id":"4"}],"file_date_updated":"2018-03-20T07:01:29Z","citation":{"mla":"Stapel, Florian, and Lena Suhl. <i>Ontology-Based Representation of Optimization Models</i>. Universität Paderborn, 2014.","ama":"Stapel F, Suhl L. <i>Ontology-Based Representation of Optimization Models</i>. Universität Paderborn; 2014.","bibtex":"@book{Stapel_Suhl_2014, title={Ontology-based Representation of Optimization Models}, publisher={Universität Paderborn}, author={Stapel, Florian and Suhl, Lena}, year={2014} }","apa":"Stapel, F., &#38; Suhl, L. (2014). <i>Ontology-based Representation of Optimization Models</i>. Universität Paderborn.","ieee":"F. Stapel and L. Suhl, <i>Ontology-based Representation of Optimization Models</i>. Universität Paderborn, 2014.","short":"F. Stapel, L. Suhl, Ontology-Based Representation of Optimization Models, Universität Paderborn, 2014.","chicago":"Stapel, Florian, and Lena Suhl. <i>Ontology-Based Representation of Optimization Models</i>. Universität Paderborn, 2014."}},{"citation":{"ieee":"M. Hammer, “Oblique incidence of semi-guided waves on rectangular slab waveguide discontinuities: A vectorial QUEP solver,” <i>Optics Communications</i>, vol. 338, pp. 447–456, 2014.","apa":"Hammer, M. (2014). Oblique incidence of semi-guided waves on rectangular slab waveguide discontinuities: A vectorial QUEP solver. <i>Optics Communications</i>, <i>338</i>, 447–456. <a href=\"https://doi.org/10.1016/j.optcom.2014.09.087\">https://doi.org/10.1016/j.optcom.2014.09.087</a>","chicago":"Hammer, Manfred. “Oblique Incidence of Semi-Guided Waves on Rectangular Slab Waveguide Discontinuities: A Vectorial QUEP Solver.” <i>Optics Communications</i> 338 (2014): 447–56. <a href=\"https://doi.org/10.1016/j.optcom.2014.09.087\">https://doi.org/10.1016/j.optcom.2014.09.087</a>.","short":"M. Hammer, Optics Communications 338 (2014) 447–456.","mla":"Hammer, Manfred. “Oblique Incidence of Semi-Guided Waves on Rectangular Slab Waveguide Discontinuities: A Vectorial QUEP Solver.” <i>Optics Communications</i>, vol. 338, Elsevier BV, 2014, pp. 447–56, doi:<a href=\"https://doi.org/10.1016/j.optcom.2014.09.087\">10.1016/j.optcom.2014.09.087</a>.","bibtex":"@article{Hammer_2014, title={Oblique incidence of semi-guided waves on rectangular slab waveguide discontinuities: A vectorial QUEP solver}, volume={338}, DOI={<a href=\"https://doi.org/10.1016/j.optcom.2014.09.087\">10.1016/j.optcom.2014.09.087</a>}, journal={Optics Communications}, publisher={Elsevier BV}, author={Hammer, Manfred}, year={2014}, pages={447–456} }","ama":"Hammer M. Oblique incidence of semi-guided waves on rectangular slab waveguide discontinuities: A vectorial QUEP solver. <i>Optics Communications</i>. 2014;338:447-456. doi:<a href=\"https://doi.org/10.1016/j.optcom.2014.09.087\">10.1016/j.optcom.2014.09.087</a>"},"file_date_updated":"2018-08-13T09:29:14Z","volume":338,"user_id":"55706","ddc":["530"],"publisher":"Elsevier BV","_id":"3890","page":"447-456","has_accepted_license":"1","status":"public","department":[{"_id":"61"}],"keyword":["tet_topic_waveguide","tet_topic_numerics"],"type":"journal_article","date_created":"2018-08-13T09:28:01Z","file":[{"file_name":"2015 Hammer_Oblique incidence of semi-guided waves on rectangular slab waveguide discontinuities_A vectorial QUEP solver_Optics communications.pdf","access_level":"closed","file_size":1872449,"relation":"main_file","date_updated":"2018-08-13T09:29:14Z","file_id":"3891","content_type":"application/pdf","success":1,"creator":"hclaudia","date_created":"2018-08-13T09:29:14Z"}],"abstract":[{"lang":"eng","text":"The incidenceofthin-film-guided, in-planeunguidedwavesatobliqueanglesonstraightdiscontinuities of dielectricslabwaveguides,anearlyproblemofintegratedoptics,isbeingre-considered.The3-D frequencydomainMaxwellequationsreducetoaparametrizedinhomogeneousvectorialproblemona\r\n2-D computationaldomain,withtransparent-influx boundaryconditions.Weproposearigorousvec-\r\ntorial solverbasedonsimultaneousexpansionsintopolarizedlocalslabeigenmodesalongthetwo\r\northogonal crosssectioncoordinates(quadridirectionaleigenmodepropagationQUEP).Thequasi-ana-\r\nlytical schemeisapplicabletoconfigurations with — in principle — arbitrary crosssectiongeometries.\r\nExamples forahigh-contrastfacetofanasymmetricslabwaveguide,forthelateralexcitationofa\r\nchannel waveguide,andforastepdiscontinuitybetweenslabwaveguidesofdifferentthicknessesare\r\ndiscussed."}],"publication":"Optics Communications","doi":"10.1016/j.optcom.2014.09.087","language":[{"iso":"eng"}],"article_type":"original","intvolume":"       338","publication_status":"published","date_updated":"2022-01-06T06:59:50Z","author":[{"id":"48077","full_name":"Hammer, Manfred","orcid":"0000-0002-6331-9348","last_name":"Hammer","first_name":"Manfred"}],"publication_identifier":{"issn":["0030-4018"]},"title":"Oblique incidence of semi-guided waves on rectangular slab waveguide discontinuities: A vectorial QUEP solver","year":"2014"},{"publisher":"Springer","_id":"390","page":"333-361","user_id":"477","ddc":["040"],"status":"public","has_accepted_license":"1","citation":{"short":"Z. Huma, C. Gerth, G. Engels, Computer Science - Research and Development (2014) 333–361.","chicago":"Huma, Zille, Christian Gerth, and Gregor Engels. “On-the-Fly Computing: Automatic Service Discovery and Composition in Heterogeneous Domains.” <i>Computer Science - Research and Development</i>, no. 3–4 (2014): 333–61. <a href=\"https://doi.org/10.1007/s00450-014-0254-z\">https://doi.org/10.1007/s00450-014-0254-z</a>.","ieee":"Z. Huma, C. Gerth, and G. Engels, “On-the-Fly Computing: Automatic Service Discovery and Composition in Heterogeneous Domains,” <i>Computer Science - Research and Development</i>, no. 3–4, pp. 333–361, 2014.","apa":"Huma, Z., Gerth, C., &#38; Engels, G. (2014). On-the-Fly Computing: Automatic Service Discovery and Composition in Heterogeneous Domains. <i>Computer Science - Research and Development</i>, (3–4), 333–361. <a href=\"https://doi.org/10.1007/s00450-014-0254-z\">https://doi.org/10.1007/s00450-014-0254-z</a>","bibtex":"@article{Huma_Gerth_Engels_2014, title={On-the-Fly Computing: Automatic Service Discovery and Composition in Heterogeneous Domains}, DOI={<a href=\"https://doi.org/10.1007/s00450-014-0254-z\">10.1007/s00450-014-0254-z</a>}, number={3–4}, journal={Computer Science - Research and Development}, publisher={Springer}, author={Huma, Zille and Gerth, Christian and Engels, Gregor}, year={2014}, pages={333–361} }","ama":"Huma Z, Gerth C, Engels G. On-the-Fly Computing: Automatic Service Discovery and Composition in Heterogeneous Domains. <i>Computer Science - Research and Development</i>. 2014;(3-4):333-361. doi:<a href=\"https://doi.org/10.1007/s00450-014-0254-z\">10.1007/s00450-014-0254-z</a>","mla":"Huma, Zille, et al. “On-the-Fly Computing: Automatic Service Discovery and Composition in Heterogeneous Domains.” <i>Computer Science - Research and Development</i>, no. 3–4, Springer, 2014, pp. 333–61, doi:<a href=\"https://doi.org/10.1007/s00450-014-0254-z\">10.1007/s00450-014-0254-z</a>."},"file_date_updated":"2018-03-20T07:00:58Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"_id":"3","name":"SFB 901 - Project Area B"}],"language":[{"iso":"eng"}],"doi":"10.1007/s00450-014-0254-z","author":[{"full_name":"Huma, Zille","last_name":"Huma","first_name":"Zille"},{"last_name":"Gerth","first_name":"Christian","full_name":"Gerth, Christian"},{"id":"107","first_name":"Gregor","last_name":"Engels","full_name":"Engels, Gregor"}],"title":"On-the-Fly Computing: Automatic Service Discovery and Composition in Heterogeneous Domains","year":"2014","date_updated":"2022-01-06T06:59:52Z","date_created":"2017-10-17T12:42:08Z","file":[{"date_updated":"2018-03-20T07:00:58Z","relation":"main_file","file_size":4644980,"access_level":"closed","file_name":"390-HGE14.pdf","content_type":"application/pdf","success":1,"file_id":"1385","creator":"florida","date_created":"2018-03-20T07:00:58Z"}],"department":[{"_id":"66"}],"type":"journal_article","issue":"3-4","publication":"Computer Science - Research and Development","abstract":[{"lang":"eng","text":"In software markets of the future, customer-specific software will be developed on demand based on distributed software and hardware services. Based on a customer-specific request, available service offers have to be discovered and composed into sophisticated IT services that fulfill the customer's request.A prerequisite of this vision are rich service descriptions, which comprise structural as well as behavioral aspects of the services, otherwise an accurate service discovery and composition is not possible. However, automatic matching of service requests and offers specified in rich service descriptions for the purpose of service discovery is a complex task, due to the multifaceted heterogeneity of the service partners. This heterogeneity includes the use of different specification languages, different underlying ontologies, or different levels of granularity in the specification itself.In this article, we present a comprehensive approach for service discovery and composition, which overcomes the underlying heterogeneity of the service partners. Based on a realistic case study of our industrial partner from the e-tourism domain, we first introduce an automatic matching mechanism for service requests and offers specified in a rich service description language. In addition, we propose an automatic service composition approach, which determines possible service compositions by composing the service protocols through a composition strategy based on labeled transition systems. "}]},{"department":[{"_id":"600"}],"type":"journal_article","date_created":"2018-08-14T13:35:39Z","citation":{"mla":"Abu Quba Rana, Chamsi, et al. “ISoNTRE: The Social Network Transformer into Recommendation Engine.” <i>2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)</i>, 2014, pp. 169–75.","ama":"Abu Quba Rana C, Hassas S, Usama F, Alshomary M, Gertosio C. iSoNTRE: The Social Network Transformer into Recommendation Engine. <i>2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)</i>. 2014:169-175.","bibtex":"@article{Abu Quba Rana_Hassas_Usama_Alshomary_Gertosio_2014, title={iSoNTRE: The Social Network Transformer into Recommendation Engine}, journal={2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)}, author={Abu Quba Rana, Chamsi and Hassas, Salima and Usama, Fayyad and Alshomary, Milad and Gertosio, Christine}, year={2014}, pages={169–175} }","apa":"Abu Quba Rana, C., Hassas, S., Usama, F., Alshomary, M., &#38; Gertosio, C. (2014). iSoNTRE: The Social Network Transformer into Recommendation Engine. <i>2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)</i>, 169–175.","ieee":"C. Abu Quba Rana, S. Hassas, F. Usama, M. Alshomary, and C. Gertosio, “iSoNTRE: The Social Network Transformer into Recommendation Engine,” <i>2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)</i>, pp. 169–175, 2014.","chicago":"Abu Quba Rana, Chamsi, Salima Hassas, Fayyad Usama, Milad Alshomary, and Christine Gertosio. “ISoNTRE: The Social Network Transformer into Recommendation Engine.” <i>2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)</i>, 2014, 169–75.","short":"C. Abu Quba Rana, S. Hassas, F. Usama, M. Alshomary, C. Gertosio, 2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA) (2014) 169–175."},"publication":"2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)","user_id":"73059","language":[{"iso":"eng"}],"_id":"3905","main_file_link":[{"url":"https://ieeexplore.ieee.org/document/7073195"}],"page":"169-175","date_updated":"2022-01-06T06:59:54Z","author":[{"full_name":"Abu Quba Rana, Chamsi","first_name":"Chamsi","last_name":"Abu Quba Rana"},{"last_name":"Hassas","first_name":"Salima","full_name":"Hassas, Salima"},{"full_name":"Usama, Fayyad","first_name":"Fayyad","last_name":"Usama"},{"last_name":"Alshomary","first_name":"Milad","full_name":"Alshomary, Milad","id":"73059"},{"full_name":"Gertosio, Christine","last_name":"Gertosio","first_name":"Christine"}],"year":"2014","status":"public","title":"iSoNTRE: The Social Network Transformer into Recommendation Engine"},{"citation":{"ama":"Feldkord B. <i>On Variants of the Page Migration Problem</i>. Universität Paderborn; 2014.","bibtex":"@book{Feldkord_2014, title={On Variants of the Page Migration Problem}, publisher={Universität Paderborn}, author={Feldkord, Björn}, year={2014} }","mla":"Feldkord, Björn. <i>On Variants of the Page Migration Problem</i>. Universität Paderborn, 2014.","short":"B. Feldkord, On Variants of the Page Migration Problem, Universität Paderborn, 2014.","chicago":"Feldkord, Björn. <i>On Variants of the Page Migration Problem</i>. Universität Paderborn, 2014.","apa":"Feldkord, B. (2014). <i>On Variants of the Page Migration Problem</i>. Universität Paderborn.","ieee":"B. Feldkord, <i>On Variants of the Page Migration Problem</i>. Universität Paderborn, 2014."},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"date_created":"2017-10-17T12:42:08Z","type":"mastersthesis","author":[{"full_name":"Feldkord, Björn","first_name":"Björn","last_name":"Feldkord","id":"22704"}],"year":"2014","title":"On Variants of the Page Migration Problem","status":"public","date_updated":"2022-01-06T06:59:54Z","publisher":"Universität Paderborn","_id":"391","user_id":"477"},{"author":[{"full_name":"Davis, Niki","last_name":"Davis","first_name":"Niki"},{"id":"40387","full_name":"Eickelmann, Birgit","last_name":"Eickelmann","first_name":"Birgit"}],"status":"public","year":"2014","title":"The restructuring of schooling with digital technologies and implications for policy makers and practitioners","date_updated":"2022-01-06T06:58:41Z","_id":"28936","language":[{"iso":"eng"}],"user_id":"50923","citation":{"apa":"Davis, N., &#38; Eickelmann, B. (2014). The restructuring of schooling with digital technologies and implications for policy makers and practitioners. <i>Proceedings of the American Educational Research Association Annual Meeting (AERA)</i>.","ieee":"N. Davis and B. Eickelmann, “The restructuring of schooling with digital technologies and implications for policy makers and practitioners,” 2014.","short":"N. Davis, B. Eickelmann, in: Proceedings of the American Educational Research Association Annual Meeting (AERA), Philadelphia, PA, 2014.","chicago":"Davis, Niki, and Birgit Eickelmann. “The Restructuring of Schooling with Digital Technologies and Implications for Policy Makers and Practitioners.” In <i>Proceedings of the American Educational Research Association Annual Meeting (AERA)</i>. Philadelphia, PA, 2014.","mla":"Davis, Niki, and Birgit Eickelmann. “The Restructuring of Schooling with Digital Technologies and Implications for Policy Makers and Practitioners.” <i>Proceedings of the American Educational Research Association Annual Meeting (AERA)</i>, 2014.","ama":"Davis N, Eickelmann B. The restructuring of schooling with digital technologies and implications for policy makers and practitioners. In: <i>Proceedings of the American Educational Research Association Annual Meeting (AERA)</i>. ; 2014.","bibtex":"@inproceedings{Davis_Eickelmann_2014, place={Philadelphia, PA}, title={The restructuring of schooling with digital technologies and implications for policy makers and practitioners}, booktitle={Proceedings of the American Educational Research Association annual meeting (AERA)}, author={Davis, Niki and Eickelmann, Birgit}, year={2014} }"},"publication":"Proceedings of the American Educational Research Association annual meeting (AERA)","date_created":"2021-12-15T10:20:04Z","place":"Philadelphia, PA","department":[{"_id":"462"}],"type":"conference"},{"language":[{"iso":"eng"}],"_id":"28937","user_id":"50923","title":"Computer and internet in primary mathematics and science education and its relationship with student achievement– International findings from TIMSS 2011","status":"public","year":"2014","author":[{"id":"40387","full_name":"Eickelmann, Birgit","first_name":"Birgit","last_name":"Eickelmann"},{"first_name":"Mario","last_name":"Vennemann","full_name":"Vennemann, Mario"},{"full_name":"Gerick, Julia","last_name":"Gerick","first_name":"Julia"},{"last_name":"Lorenz","first_name":"Ramona","full_name":"Lorenz, Ramona"}],"date_updated":"2022-01-06T06:58:41Z","place":"Philadelphia, PA","date_created":"2021-12-15T10:22:25Z","type":"conference","department":[{"_id":"462"}],"publication":"Proceedings of the American Educational Research Association annual meeting (AERA)","citation":{"apa":"Eickelmann, B., Vennemann, M., Gerick, J., &#38; Lorenz, R. (2014). Computer and internet in primary mathematics and science education and its relationship with student achievement– International findings from TIMSS 2011. <i>Proceedings of the American Educational Research Association Annual Meeting (AERA)</i>.","ieee":"B. Eickelmann, M. Vennemann, J. Gerick, and R. Lorenz, “Computer and internet in primary mathematics and science education and its relationship with student achievement– International findings from TIMSS 2011,” 2014.","chicago":"Eickelmann, Birgit, Mario Vennemann, Julia Gerick, and Ramona Lorenz. “Computer and Internet in Primary Mathematics and Science Education and Its Relationship with Student Achievement– International Findings from TIMSS 2011.” In <i>Proceedings of the American Educational Research Association Annual Meeting (AERA)</i>. Philadelphia, PA, 2014.","short":"B. Eickelmann, M. Vennemann, J. Gerick, R. Lorenz, in: Proceedings of the American Educational Research Association Annual Meeting (AERA), Philadelphia, PA, 2014.","mla":"Eickelmann, Birgit, et al. “Computer and Internet in Primary Mathematics and Science Education and Its Relationship with Student Achievement– International Findings from TIMSS 2011.” <i>Proceedings of the American Educational Research Association Annual Meeting (AERA)</i>, 2014.","ama":"Eickelmann B, Vennemann M, Gerick J, Lorenz R. Computer and internet in primary mathematics and science education and its relationship with student achievement– International findings from TIMSS 2011. In: <i>Proceedings of the American Educational Research Association Annual Meeting (AERA)</i>. ; 2014.","bibtex":"@inproceedings{Eickelmann_Vennemann_Gerick_Lorenz_2014, place={Philadelphia, PA}, title={Computer and internet in primary mathematics and science education and its relationship with student achievement– International findings from TIMSS 2011}, booktitle={Proceedings of the American Educational Research Association annual meeting (AERA)}, author={Eickelmann, Birgit and Vennemann, Mario and Gerick, Julia and Lorenz, Ramona}, year={2014} }"},"extern":"1"}]