| Algorithm (241) |  |
| Computer science (252) | |
| Algorithm (241) | |
| Computer science (252) | |
1 1. 2. Computer sciences, the Internet and mass media...7 1. 2. 1. Example of applying environmental principles...
The invention of the computer and the quick development of computer science has had a very significant impact on our lives. 1. 2. Computer science, the Internet and mass media Computers
Google also developed a machine-learning algorithm (artificial intelligence (AI)) that learns from operational data to model plant performance
computer science, social science, physics, biology, engineering, design, architecture and philosophy. A strong multidisciplinary and collaborative approach is the key requirement for large-scale technology innovation and the development of effective applications8.
and requires collaboration between the future users, computer science and IT as well as from the social sciences. Ambient assisted living involves technologies such as sensors, specific equipment, robotics, user interaction (multimodal interfaces) and simulation platforms.
Most computer science training teaches how to think about data (classifying things), whereas artificial intelligence enables us to learn how to think about knowledge (problem-solving).
For example, the seeker can design an image processing algorithm to automatically/semiautomatically perform segmentation on stacks of images of the esophagus. 2 https://www. innocentive. com/ar/challenge.
A multidisciplinary approach ranging from computer science to molecular biology, integrating knowledge from the East and the West, is applied in this research.
example of eco-design process, Federated Conference on Computer science and Information systems, Krakow, Poland, 2013. MER 13b MERCIER-LAURENT E.,Innovating corporate management:
, 181 business model, 107 innovation, 62,126, 155 intelligence, 64,72, 113 watch, 79 computer science, 7 11,21, 26,69, 132 computers, 7, 13,15, 16,52
Computer science-Research and development, 23 (2), 47 65. Weske, M. 2007. Concepts, languages, architectures (Vol. 14. Berlin:
Driving behaviour parameters were measured by advanced signal-processing algorithms, filtering GPS data combined with sensor fusion from the accelerometer and gyroscope in the smartphone,
Just like computer science emerged as a new discipline from mathematics when computers became abundantly available,
Formal methods for web services (Lecture Notes in Computer science, Vol. 5569, pp. 42 88. Berlin:
In Sixth International Conference on Extending Database Technology (Lecture Notes in Computer science, Vol. 1377, pp. 469 483.
Proceedings of the 10th International Conference on Fundamental Approaches to Software engineering (FASE 2007)( Lecture Notes in Computer science, Vol. 4422, pp. 245 259.
International Conference on Business Process Management (BPM 2007)( Lecture Notes in Computer science, Vol. 4714, pp. 375 383.
A region-based algorithm for discovering petri nets from event logs. In Business Process Management (BPM2008)( pp. 358 373.
Business Process Management Workshops, Workshop on Business Process Intelligence (BPI 2006)( Lecture Notes in Computer science, Vol. 4103, pp. 81 92.
Business Process Management (BPM 2010)( Lecture Notes in Computer science, Vol. 6336, pp. 211 226. Berlin:
Applications and Theory of Petri Nets 2010 (Lecture Notes in Computer science, Vol. 6128, pp. 226 245.
Combining evidence from past sales data, forecasting algorithms as well as observations and evidence from how store managers operate,
M. Dumas(*)F. M. Maggi Institute of Computer science University of Tartu, J. Liivi 2, Tartu 50409, Estonia e-mail:
Here, a fault detection algorithm (local outlier factor) is used to estimate the probability of a fault occurring.
Acknowledgments This work is supported by ERDF via the Estonian Centre of Excellence in Computer science. References Birukou
Theory and experiments with perceptron algorithms. In Proceedings of the ACL conference on empirical methods in natural language processing (pp. 1 8). Philadelphia, PA:
However, most of the existing techniques and algorithms only take activities into account. There are several different approaches for the automatic detection of correspondences.
so that the algorithm is able to determine whether a node should be an activity or an event (in case of EPCS).
The Refmod-Mine/NSCM algorithm conducts an n-ary cluster matching, thus, the nodes of all models which should be matched are being compared pairwise,
& Flynn, 1999) cluster algorithms start with clusters of size 1 (activities) and consolidates two activities to a cluster
Finally, the algorithm returns binary simple or complex matches for the nodes of each model pair. 4. 2 Structural Analogies One of the main problems in reference modelling is the identification of correspondences (cf. 4. 1)
In order to match (cf. 4. 1) further elements, it is necessary to use advanced mapping algorithms that are able to identify antonyms like invoice settled and payment received.
The MCC algorithm comprises three main steps: In the first step, a set of candidaterelations is calculated out of the existing nodes and edges in given Fig. 2 Structural analogue process chains Identification of Business Process Models in a Digital World
the algorithm is also able to present a completely integrated model containing all nodes of the underlying process models
The second layer contains concepts and algorithms which support the analysis of individual enterprise models and the derivation of a reference model.
an application of the inductive method to develop new reference models and the development and application of techniques and algorithms for the corpus development.
An algorithm for suffix stripping. Readings in information retrieval (pp. 313 316. San francisco, CA: Morgan Kaufmann.
They propose using algorithms to parse labels written by modelers in order to detect grammatical mistakes and to prompt users to fix them. 3. 2 Use a Glossary As naming conventions only refer to standardizing the grammatical part,
An algorithm can then parse his sentence and deconstruct it into its parts. This allows not only a verification of the phrase structure, i e.,
Not only can this help to create more clearly arranged models (provided that the algorithm is good),
These conventions should be codified in the form of a layout algorithm which is the same for each modeler.
rmfl@cin. ufpe. br H. A. Reijers Department of mathematics and Computer science, Eindhoven University of Technology, Den Dolech 2, 5612 AZ Eindhoven, The netherlands e-mail:
Decision-making algorithms can be used to compile and present to the user recommendations about how to perform their job in alignment with the organization's priorities.
a decision algorithm is employed automatically to determine the recommended path to be followed by the user.
Then, using all these pieces of information it becomes possible to identify points for integrating concrete control activities into workflows. This can be realized by having automated search algorithms check the actual control parameters against the workflow instance information.
He has a background in business economics und computer science and has obtained his economic doctorate degree from the Martin-Luther-University Halle-Wittenberg in 2013.
Curricula Vitae 293 Ricardo Massa F. Lima Federal University of Pernambuco, Brazil Ricardo Massa F. Lima received the Ph d. degree in computer science from Federal University
He is the Vice-Coordinator of UFPE's computer science postgraduate program. His main research interests include compiler construction and optimization
He received a Ph d. in Computer science in 2010 from University of Bari. Curricula Vitae 295 Monika Malinova Vienna University of Economics and Business, Austria Monika Malinova is a teaching
of Pernambuco (Recife, Brazil) in 2008 and his Ph d. degree in computer science from the Center for Informatics, Federal University of Pernambuco (Recife, Brazil), in 2014.
He received a Ph d. in Computer science (2002), A m. Sc. in Computer science (1994), and A m. Sc. in Technology and Society (1994), all from TU/e. Hajo wrote his Ph d. thesis on the topic of BPM for the service industry
Walter studied computer science at the Brandenburg University of Technology (BTU. His research activities include business process management, software development and graph theory.
such as its search algorithms, and advertising data. 6 And as we would expect of a dynamic,
Markov Chain Monte carlo algorithm. Data imputation could lead to the minimisation of bias and the use of‘expensive to collect'data that would otherwise be discarded by case deletion.
and then apply a clustering algorithm on the object scores on the first few components,
factorial k-means analysis has a fast alternating least-squares algorithm that extends its application to large data sets.
The focus is on an algorithm, with implicit underlying assumptions which need to be verified in terms of
where the bias depends on the algorithm used to estimate the variance). Therefore, this method does not fully assess the implications of imputation
The Expected maximisation (EM) algorithm is one of these iterative methods. 13 The issue is that X contains both observable and missing values, i e.
Each step is completed once within each algorithm cycle. Cycles are repeated until a suitable convergence criterion is satisfied.
An EM algorithm is also often easy to construct conceptually and practically. Besides each step has a statistical interpretation
the following imputation algorithm can be used: Draw*from the posterior distribution of, f (Y, Xobs),
In such cases, factors generated by the factor analysis algorithm will not be comprehensible. Likewise, the inclusion of multiple definitionally-similar individual indicators representing essentially the same data will lead to tautological results.
Cronbach coefficient alpha results for the 23 countries after deleting one individual indicator (standardised values) at a time. 4. 4. Cluster analysis Cluster analysis (CLA) is a collection of algorithms to classify objects such as countries, species,
including Euclidean and non-Euclidean distances. 18 The next step is to choose the clustering algorithm,
This algorithm can be applied with continuous variables, yet it can be modified also to accommodate other types of variables.
The algorithm starts with k random clusters and moves the objects in and out of the clusters with the aim of (i) minimising the variance of elements within the clusters,
factorial k-means analysis has a fast alternating least-squares algorithm that extends its application to large data sets, i e.,
as well as to avoid having extreme values overly dominate the aggregation algorithm. That is, any observed value greater than the 97.5 percentile is lowered to match the 97.5 percentile.
and may then be solved using optimisation algorithms: k M q Q w I w s t CI I w qkqq qk qk Qq qc qc wqc c 1...
is it possible to find a ranking algorithm consistent with some desirable properties?;and conversely, is it possible to ensure that no essential property is lost?
the algorithm per se is very simple. The maximum likelihood ranking of countries is supported the ranking by the maximum number of individual indicators for each pairwise comparison,
To solve this problem it is necessary to use numerical algorithms. To conclude, consider the numerical example in Table 34 with three countries
and applying the so-called Russian roulette algorithm, e g. for 1 X, select 1 if 0, 0. 5) and 2 if 0. 5,
When BOD is selected the exclusion of individual indicators leads to a re-execution of the optimisation algorithm.
they will nevertheless be generated by the random sample generation algorithm. The constructive dimension of the Monte carlo experiment, the number of random HANDBOOK ON CONSTRUCTING COMPOSITE INDICATORS:
Haq M. 1995), Reflections on Human Development, Oxford university Press, New york. Hartigan J. A. 1975), Clustering Algorithms, New york:
Spath H. 1980), Cluster analysis Algorithms, Chichester, England: Ellis Horwood. Storrie D. and Bjurek H. 1999), Benchmarking European labour market performance with efficiency frontier technique, Discussion Paper FS I 00-2011.
and MSE is computed using all available regressors. 13 Other iterative methods include the Newton-Raphson algorithm
As a result these algorithms often require algebraic manipulations and complex programming. Numerical estimation of this matrix is also possible
as such, need algorithms to achieve the maximum power point which must be considered in the design of the power electronics interface. 3) Bidirectional power flow:
evaluating all research groups in all Netherlands universities at the same time (e g. computer science; chemistry). ) In other disciplines (e g. physics), several evaluation committees were established,
using the internet to send algorithms for 3-D printed prosthetic limbs designed for war victims in developing countries for local production and use.
How to guard against decisions being taken about peoples'lives based purely on big data, data analytics and closed algorithms?
Coursera, currently the biggest MOOC platform, was launched as a for-profit company in April 2012 by the two Stanford computer science professors Andrew Ng and Daphne Koller.
She is a computer engineer and Phd candidate, with an MA in Computer science at UNICAMP, Brazil.
Previously, she was Senior Researcher at CPQD in Brazil coordinating R&d projects related to the digital divide. 6 Dr. Maurizio Teli has recently been appointed as Research Fellow at the Department of Information Engineering and Computer science of the University of Trento (Italy.
Such evaluation can be delegated to algorithms, like in the case of Google Pagerank, where search results are ordered according to different criteria such as relative relevance, search histories, etc.
and higher level skills wherever they are available on a worldwide basis, the separate disciplines of design, engineering, computer science,
She is a computer engineer and Phd candidate, with an MA in Computer science at UNICAMP, Brazil.
Previously, she was Senior Researcher at CPQD in Brazil coordinating R&d projects related to the digital divide. 6 Dr. Maurizio Teli has recently been appointed as Research Fellow at the Department of Information Engineering and Computer science of the University of Trento (Italy.
Such evaluation can be delegated to algorithms, like in the case of Google Pagerank, where search results are ordered according to different criteria such as relative relevance, search histories, etc.
A Faster Algorithm for Betweenness Centrality, Journal of Mathematical Sociology 25 (2): 163-177. Clauset, A. et al.
Community detection algorithms can be used to find dense substructures (often called communities) within a larger and often sparse network.
Also, in the case of Digital Business Ecosystem, an isomorphic model between biological behaviour and the behaviour of the software, based on theoretical computer science implications and leading to an evolutionary, self-organising,
Computer science is concerned with the construction of new languages and algorithms in order to produce novel desired computer behaviours.
Innovations, such as those which draw on the expertise of data scientists around the world to develop algorithms to solve large-scale problems,
and interpreted by algorithms through highly normative processes. This smart infrastructure is also increasingly getting to know people by aggregating personal and social data in massive data centres with little privacy and security.
In this case, the likelihood ratio is given under two distributions fitted by the Kolmogorov-smirnov test algorithm, and it is simply the likelihood of the first ratio over the second ratio
we can run the above algorithms on it to determine if the data is sufficient. The MATLAB code developed by Aaron Clauset at the Santa fe Institute was used (http://tuvalu. santafe. edu/aaronc/powerlaws/.
Community detection algorithms can be used to find dense substructures (often called communities) within a larger sparse network.
If the data-set is of reasonable size (less than 10,000 organisations) we will use the Newman algorithm to identify communities.
Figure 13 45 We can also reverse the algorithm and find communities that need a bridge to other communities (see Figure 13).
and algorithms needed for innovative digital research. Yet, perhaps surprising, even as these digitally native companies are reaching the state of
Through the project Everyaware intends to integrate theoretical and practical techniques from the disciplines of environmental sensing, computer science,
A study based on a series of in depth interviews with central and peripheral Github users (carried out by the School of Computer science and the Center for the Future of Work, Heinz College and Carnegie mellon University;
Using a smart search algorithm the platform immediately asks the 100 closest Peerby neighbours if they have the item right after a request has been logged.
and skills levels of prospective undergraduates applying to study Computer science. Upton has hypothesised that this drop in skills
Innovations, such as those which draw on the expertise of data scientists around the world to develop algorithms to solve large-scale problems,
and interpreted by algorithms through highly normative processes. This smart infrastructure is also increasingly getting to know people by aggregating personal and social data in massive data centres with little privacy and security.
In this case, the likelihood ratio is given under two distributions fitted by the Kolmogorov-smirnov test algorithm, and it is simply the likelihood of the first ratio over the second ratio
we can run the above algorithms on it to determine if the data is sufficient. The MATLAB code developed by Aaron Clauset at the Santa fe Institute was used (http://tuvalu. santafe. edu/aaronc/powerlaws/.
Community detection algorithms can be used to find dense substructures (often called communities) within a larger sparse network.
If the data-set is of reasonable size (less than 10,000 organisations) we will use the Newman algorithm to identify communities.
Figure 13 45 We can also reverse the algorithm and find communities that need a bridge to other communities (see Figure 13).
and algorithms needed for innovative digital research. Yet, perhaps surprising, even as these digitally native companies are reaching the state of
Through the project Everyaware intends to integrate theoretical and practical techniques from the disciplines of environmental sensing, computer science,
A study based on a series of in depth interviews with central and peripheral Github users (carried out by the School of Computer science and the Center for the Future of Work, Heinz College and Carnegie mellon University;
Using a smart search algorithm the platform immediately asks the 100 closest Peerby neighbours if they have the item right after a request has been logged.
and skills levels of prospective undergraduates applying to study Computer science. Upton has hypothesised that this drop in skills
Young Global Leader Building a database and evaluating data with a clearly defined process Google Ventures uses algorithms with data from academic literature or from due diligences.
Markov Chain Monte carlo algorithm. The advantages of imputation include the minimisation of bias and the use of‘expensive to collect'data that would
In such cases, factors generated by the factor analysis algorithm will not be comprehensible. Likewise, the inclusion of multiple definitionally-similar sub-indicators representing essentially the same data will lead to tautological results. 8. Strong intercorrelations are required not mathematically,
2004) Success of software process implementation 3. 2 Grouping information on countries 3. 2. 1 Cluster analysis Cluster analysis (CLA) is given the name to a collection of algorithms used to classify objects
the next step is to choose the clustering algorithm, i e. the rules which govern how distances are measured between clusters.
Thus, this algorithm can be applied with continuous variables (yet it can be modified also to accommodate for other types of variables.
The algorithm starts with k random clusters and moves the objects in and out the clusters with the aim of (i) minimizing the variance of elements within the clusters,
frequently carrying out a PCA and then applying a clustering algorithm on the object scores on the first few components.
factorial k-means analysis has a fast alternating least-squares algorithm that extends its application to large data sets.
Markov Chain Monte carlo algorithm. The advantages of imputation include the minimisation of bias 36 and the use of‘expensive to collect'data that would
the focus is on an algorithm, with implicit underlying assumptions that should be assessed. Besides the need to carefully verify
an important limitation of the single imputation methods is that they systematically underestimate the variance of the estimates (with some exceptions for the EM method where the bias depends on the algorithm used to estimate the variance).
The EM algorithm is one of these iterative methods. 7 The issue is that X contains both observable and missing values, i e.
Each step is completed once within each algorithm cycle. Cycles are repeated until a suitable convergence criterion is satisfied.
In the following maximization step the 7 Other iterative methods include the Newton-Raphson algorithm
As a result these algorithms often require algebraic manipulations and complex programming. Numerical estimation of this matrix is also possible
its simplicity (EM algorithm are often easy to construct conceptually and practically), and each step has a statistical interpretation
the following imputation algorithm can be used: Draw*from the posterior distribution of, f (Y, Xobs) where Y denotes exogenous variables that may influence.
where the variable distributions outside the 2. 5 and 97.5 percentile scores are trimmed to partially correct for outliers as well as to avoid having extreme values overly dominate the aggregation algorithm.
and solved using optimizations algorithms k 1,..M; q 1,,...Q w 0 I w 1 s. t. CI arg max I w qkq q 1 qk qk Q q 1 qc
as calculated by the above algorithm, that does not sum up to one, making the comparison with other methods (like FA
the weights as originally produced by the algorithm can always be normalized afterwards so as to sum up to one,
each with pros and cons. One possible algorithm is the Condorcet-Kemeny-Young-Levenglick (CKYL) ranking procedure (Munda and Nardo 2003).
or an algorithm to describe a real-world issue formal coherence is a necessary property. Yet, formal coherence is not sufficient.
the exclusion of an indicator leads to a total rerun of the optimisation algorithm. When using BAL
1 and applying the so called Russian roulette algorithm, e g. for 1 X we select 1 if 0, 0. 5) and 2 if 0. 5,
When BOD is selected the exclusion of a sub-indicator leads to a re-execution of the optimisation algorithm.
they will be generated all the same by the random sample generation algorithm. 91 The constructive dimension of this Monte carlo experiment,
The main disadvantage of imputation is that the results are affected by the imputation algorithm used.
Hartigan, J. A. 1975), Clustering Algorithms, New york: John Wiley & Sons, Inc. 53. Harvey A.,(1989), Forecasting, structural time series models and the Kalman filter.
Spath, H. 1980), Cluster analysis Algorithms, Chichester, England: Ellis Horwood. 132. SPRG (2001) Report of the Scientific Peer review Group on Health Systems Performance Assessment,
Nortel alone accounts for almost 20 percent of all industrial R&d expenditures in Canada and hires one third of all Masters and Ph d. graduates in electrical engineering and computer science from Canadian universities.
thus a key success factor Many KETS require very specific skills, particularly cross-disciplinary knowledge from disciplines such as chemistry, physics, biology, computer sciences, mechanical engineering and material sciences.
Ru 1995 2000 Computer science, Lomonosov Moscow State university (MSU) Lars Mathiesen Nykredit 2002 today CIO and Executive vice president, Nykredit 1997 2002 Executive vice president Retail Business
(ICAA) Bachelor of Commerce with majors in Accountancy and Computer science, Deakin University Herman de Prins UCB 2009 today CIO
These pioneers were developing a wide range of creative digital learning tools such computer algorithms for analyzing student writing
Educators need to develop new assessment methods using the unique capabilities of digital technology, from algorithms to artificial intelligence.
In collaboration with Columbia University computer science Professor Steven Feiner the author developed in the late 1990s real-world AR enhancements described as a situated documentary (Höllerer, Feiner, & Pavlik, 1999.
The algorithms the system uses are highly effective and have attracted dozens of companies, including media enterprises,
The company's ambition is for the algorithm to write every story for an audience of 121 one.
news. Algorithm-driven news reporting and writing is already transforming a variety of journalism domains,
A Faster Algorithm for Betweenness Centrality, Journal of Mathematical Sociology 25 (2): 163-177. Clauset, A. et al.
Using some advance algorithms on the multivariate analysis results, we try to assess the patterns existing among the variables,
having built defined system architecture, a data management module and a localisation algorithm, as well as having developed information services for multimodal forms of transport.
which employs an algorithm using two different but mathematically related"keys":"one for creating a digital signature
In the following table we have the clustering algorithm results for the variable Percentage of employees that have internet access at their workplace.
The Chi-square algorithm is a statistical technique that tests the relationship between analysed variables.
The various CAD packages use a number of different algorithms to represent solid objects. To establish consistency, the STL (stereolithography,
new informational systems and human resources training increase together with the enterprises'size. 2009 International Association of Computer science and Information technology-Spring Conference 978-0-7695-3653-8
the majority of countries in the core are developed countries with a relatively 3 This algorithm is implemented in UCINET software Borgatti, S. P.,Everett, M. G. & Freeman, L. C. 2002.'
'An algorithm for modularity analysis of directed and weighted biological networks based on edge-betweenness centrality.'
combined with the Pagerank search algorithm, powered their success. There is no doubt that, at Stanford, Google's founders benefited from a very supportive
27 Of the top 50 departments in the world in different subject areas, the majority are found in the USA (39 of 50 in computer science, 33 in engineering, 37 in neuroscience)( Technopolis, 2011;
CA in 1998 by Larry page and Sergey Brin while they were Phd candidates in computer science at Stanford university.
(ex Netscape), David Cheriton (Stanford computer science Professor), and Jeff Bezos41 (Amazon). In June 1999, a $25 million round of funding was announced,
Consequently the algorithms behind Pagerank were guarded zealously. However, as Phd research students, they were expected to present their work
In many areas, KUKA has benefited from the control algorithms, technologies and software developed by DLR,
-KUKA uses DLR's model-based minimum cycle time algorithms for high-speed spot welding for car assembly lines.
36 5. 1. 2 Academic ranking of a Computer science Faculty...38 5. 1. 3 Employer Ranking of a Computer science Faculty...
40 5. 1. 4 Citations Ranking of a Computer science Faculty...42 5. 1. 5 R&d Expenditures by ICT Firms...
44 5. 1. 6 ICT FP7 Funding to Private Organisations...46 5. 1. 7 ICT FP7 Participations...
56 5. 1. 12 Scientific Publications in Computer science...58 5. 1. 13 Outward ICT R&d Internationalisation...
32 Academic ranking of a Computer science faculty Agrd 2 10 Employer ranking of a Computer science faculty Agrd 3 11 Citations ranking of a Computer science faculty Agrd 4 29 R&d
of ICT R&d centres Agrd 11 7 Scientific publications in Computer science Agrd 12 23 Internationalisation Outward ICT R&d internationalisation Intrd 1 5
18 Academic ranking of a Computer science faculty Agrd 2 7 Employer ranking of a Computer science faculty Agrd 3 3 Citations ranking of a Computer science faculty Agrd 4 6 R&d
of ICT R&d centres Agrd 11 16 Scientific publications in Computer science Agrd 12 4 Internationalisation Outward ICT R&d internationalisation Intrd 1 16
of a Computer science faculty Agrd 2 8 Employer ranking of a Computer science faculty Agrd 3 8 Citations ranking of a Computer science faculty Agrd 4 4 R&d expenditures by ICT
centres Agrd 11 4 Scientific publications in Computer science Agrd 12 13 Internationalisation Outward ICT R&d internationalisation Intrd 1 4 Inward ICT
the EIPE ID card Activity Characteristic Name of Indicator Indicator ID Nr R&d Agglomeration Universities ranked in the QS University ranking Agrd 1 1 Academic ranking of a Computer science
faculty Agrd 2 2 Employer ranking of a Computer science faculty Agrd 3 3 Citations ranking of a Computer science faculty Agrd 4 4 R&d expenditures by ICT firms
R&d centres Agrd 11 11 Scientific publications in Computer science Agrd 12 12 Internationalisation Outward ICT R&d internationalisation Intrd 1 13 Inward
Academic ranking of a Computer science Faculty Table 15: Top ranking regions according to the Academic Computer science faculty QS Ranking indicator Rank NUTS3 Code Region name Indicator Value EIPE Rank 1 UKH12
Cambridgeshire CC 100 5 2 UKJ14 Oxfordshire 87 19 3 UKI22 Outer London-South 73 114 4 UKM25 Edinburgh, City
UKE21 York 27 63 29 ITD55 Bologna 27 76 Indicator description Indicator ID Agrd 2 Name of indicator Academic ranking of a Computer science faculty
Measures the performance of the Computer science faculty according to the academic ranking of QS Unit of measurement The highest rank of a Computer science faculty in the academic ranking Definition of ICT dimension Computer science faculty Unit of observation NUTS
Frequency of the Academic Computer science faculty QS Ranking indicator values 1244 1 5 5 12 11 8 9 2 2 1 1
1 1 0 500 1000 1500 Frequency 0 20 40 60 80 100 Academic ranking of a Computer science faculty Table 16:
Descriptive statistics of the Academic Computer science faculty QS Ranking indicator Number of observations Mean value Standard deviation Variance 1303 1. 38 7. 25 52.59 40 5
. 1. 3 Employer Ranking of a Computer science Faculty Table 17: Top ranking regions according to the Employer Computer science faculty QS Ranking indicator Rank NUTS3 Code Region name Indicator Value EIPE Rank 1 UKH12
Cambridgeshire CC 100 5 2 UKJ14 Oxfordshire 95 19 3 UKI12 Inner London-East 68 2 4 UKI22 Outer London
30 GR300 Attiki 28 49 Indicator description Indicator ID Agrd 3 Name of indicator Employer ranking of a Computer science faculty What does it measure?
Measures the performance of the Computer science faculty according to the employer ranking of QS Unit of measurement The highest rank of a Computer science faculty in the employer ranking Definition of ICT dimension Computer science faculty Unit
Frequency of the Employer ranking of a Computer science faculty indicator values 1244 1 3 3 12 12 11 6 6 1 1 1 2 0
500 1000 1500 Frequency 0 20 40 60 80 100 Employer ranking of a Computer science faculty Table 18:
Descriptive statistics of Employer Computer science faculty QS Ranking indicator Number of observations Mean value Standard deviation Variance 1303 1. 47 7. 63 58.27 42 5
. 1. 4 Citations Ranking of a Computer science Faculty Table 19: Top ranking regions according to the Citations Computer science faculty QS Ranking indicator Rank NUTS3 Code Region name Indicator Value EIPE Rank 1 UKL12
Gwynedd 100 266 2 PL127 Miasto Warszawa 91 50 3 NL335 Groot-Rijnmond 77 72 4 FR101 Paris 75 3
Gent 37 94 Indicator description Indicator ID Agrd 4 Name of indicator Citations ranking of a Computer science faculty What does it measure?
Measures the performance of the Computer science faculty according to the citations ranking of QS Unit of measurement The highest rank of a Computer science faculty in the citations ranking Definition of ICT dimension Computer science faculty Unit
Frequency of the Citations Computer science faculty QS Ranking indicator values 1243 3 11 10 9 6 7 3 2 3 2 2
1 1 0 500 1000 1500 Frequency 0 20 40 60 80 100 Citations ranking of a Computer science faculty Table 20:
Descriptive statistics of Citations Computer science faculty QS Ranking indicator Number of observations Mean value Standard deviation Variance 1303 1. 94 9. 57 91.58 44 5
. 12 Scientific Publications in Computer science Table 35: Top ranking regions according to scientific publications in Computer science indicator Rank NUTS3 Code Region name Indicator Value EIPE Rank 1 NL333 Delft en
Westland 100 17 2 DE138 Konstanz 93 53 3 DE711 Darmstadt, Kreisfreie Stadt 89 7 4 UKI12 Inner London-East
Port Talbot 32 272 Indicator description Indicator ID Agrd 12 Name of indicator Scientific publications in Computer science What does it measure?
in the Computer science area produced by organisations located in the observed region Unit of measurement Region's share in the total number of publications in Computer science to a region's share in the EU population Definition of ICT dimension Computer science as defined by Web
Frequency of the scientific publications in Computer science indicator values 1172 38 18 21 13 8 12 2 3 4 1 2 1 2
Descriptive statistics of scientific publications in Computer science indicator Number of observations Mean value Standard deviation Variance 1303 2. 32 9. 45 89.45 60 5. 1. 13
of indicator Universities ranked in the QS University ranking Academic ranking of a Computer science faculty Employer ranking of a Computer science faculty Citations ranking of a Computer science faculty R&d expenditures by ICT firms ICT FP7 funding
Measures the number of universities in QS university ranking Measures the performance of the Computer science faculty according to the academic ranking of QS Measures the performance of the Computer science faculty according to the employer ranking of QS Measures the performance
of the Computer science faculty according to the citations ranking of QS Measures the average annual amount spent on R&d in the ICT sector Measures the amount received for research in ICT R&d Unit of measurement Region's share in the total
number of EU ranked universities to a region's share in the EU population The highest rank of a Computer science faculty in the academic ranking The highest rank of a Computer science faculty in the employer ranking The highest rank of a Computer science
ICT firms in the EU to a region's share in the EU population Region's share in the total EU ICT FP7 funding to a region's share in the EU population Definition of ICT dimension None Computer science faculty Based on NACE
Scientific publications in Computer science What does it measure? It measures the total number of ICT R&d FP7 projects to which organisations,
in the Computer science area produced by organisations located in the observed region Unit of measurement Region's share in the total number of ICT FP7 participations to a region's share in the EU population Region's share in the total EU ICT
in Computer science to a region''s share in the EU population Definition of ICT dimension ICT areas of the FP7 programme Based on HIS isuppli classification of the major"semiconductors influencers"Computer science as defined by Web of Science classification of Research
Areas Unit of observation NUTS 3 Source ICT FP7 by EC DG CONNECT (see Section 8. 2) R&d Centre location by IHS isuppli (Section 8
Data Sources 8. 1 QS WORLD UNIVERSITY RANKINGS by QS The Computer science and Electronic Faculties rankings originate from the QS WORLD UNIVERSITY RANKINGS,
which there is the Computer science subject considered appropriate for the EIPE study. To construct measures of faculty performance,
For the purpose of the EIPE exercise, journals classified in the Computer science research area are considered. 8. 4 R&d Centre Location by IHS isuppli The data used for the purpose of identification of R&d centre locations
< Back - Next >
Overtext Web Module V3.0 Alpha
Copyright Semantic-Knowledge, 1994-2011