Refine
Year of publication
- 2016 (215) (remove)
Document Type
- Conference Proceeding (81)
- Article (48)
- Other Publications (28)
- Part of a Book (20)
- Book (14)
- Doctoral Thesis (7)
- Journal (Complete Issue of a Journal) (5)
- Working Paper (5)
- Report (3)
- Bachelor Thesis (1)
Language
- German (123)
- English (91)
- Multiple languages (1)
Keywords
- Abstract interpretation (1)
- Arbeitsrecht (1)
- Aufsatzsammlung (1)
- Bernstein polynomial (1)
- Block codes (1)
- Blomeier (1)
- Bodenplatten (1)
- Body sensor networks (1)
- Business life-cycle (1)
- Business plan (3)
- Bytecode (1)
- CO2-Bilanz (1)
- Cauchon algorithm (2)
- Chassis dynamometer (1)
- Checkerboard ordering (1)
- Code Generation (1)
- Cognitive radio (1)
- Computational linguistics (1)
- Concatenated codes (1)
- Condition monitoring (1)
- Content analysis (2)
- Content analysis (keywords) (1)
- Corporate Social Responsibility (1)
- Corporate modelling (1)
- Correlation analysis (1)
- Cyberphysische Produkte (1)
- Damages (1)
- Data acquisition (1)
- Data compression (1)
- Data privacy (1)
- Decoding (1)
- Denkmalschutz (1)
- Deutschland (2)
- Disturbance rejection (1)
- Diversity (1)
- Document image processing (1)
- Domain-Specific Language (DSL) (3)
- Domain-Specific-Language (DSL) (1)
- EMF (1)
- ERP systems (1)
- Eclipse Modeling Framework (EMF) (1)
- Electrocardiography (1)
- Electroencephalography (1)
- Electromagnetic actuators (2)
- Electromagnetic devices (1)
- Energiewende (1)
- Enterprise systems (1)
- Entry-wise perturbation (1)
- Error correction (1)
- Extended Perron complement (1)
- Extended linearisation (1)
- Factory automation (1)
- Fallsammlung (2)
- Fault diagnosis (1)
- Finite-element (1)
- Flash memories (1)
- Footbridges (1)
- Friction (1)
- Fuel consumption (1)
- Future tools and methods (1)
- Gain scheduling (1)
- Gebäudehülle (1)
- Gesellschaftsrecht (1)
- Graphical Online Editor (1)
- Handelsrecht (1)
- Handwriting recognition (1)
- Hankel matrix (1)
- Hidden Markov models (1)
- Huffman codes (1)
- Hurwitz matrix (1)
- Hydraulic actuators (1)
- Hysteresis modeling (1)
- IT risk (1)
- IT service governance (1)
- Immutability (1)
- Industrial training (1)
- Industrie 4.0 (1)
- Internet (1)
- Internet of Things (1)
- Joint building venture (1)
- Kommunikation (1)
- Lake constance (1)
- Lean Production (1)
- Learning (artificial intelligence) (1)
- Magnetic fields (1)
- Marketing (1)
- Marketingpolitik (1)
- Markov processes (1)
- Matlab (1)
- Matrix interval (1)
- Maximum likelihood estimation (1)
- Measurement methods (2)
- Measurements (1)
- Metamodel (1)
- Metamodel Definition (1)
- Metamodel Model-Driven Architecture (MDA) (1)
- Military land redevelopment (1)
- Mittelstand (1)
- Mobile computing (1)
- Model-Driven Architecture (MDA) (2)
- Model-Driven Software Development (MDSD) (3)
- Model-Driven-Development (MDD) (1)
- Modelling (1)
- Motion estimation (1)
- Movement patterns (1)
- Multicast communication (1)
- NEDC (1)
- Natural frequency (1)
- Nichtrostender Stahl (1)
- Observers (1)
- Parameter estimation (3)
- Pedestrian (1)
- Perron complement (1)
- Platten (1)
- Prediction (1)
- Probability (1)
- Production management (1)
- Quality of service (1)
- R-function (1)
- Radio spectrum management (1)
- Range bounding (1)
- Rapid Protoryping (1)
- Rational function (1)
- Recht (1)
- Redundancy (1)
- Region Konstanz (1)
- Relation (1)
- Rissbreitenbeschränkung (1)
- Sanierung (1)
- Scala (1)
- Schrumpfen (1)
- Schur complement (1)
- Shadow IT (2)
- Shadow systems (1)
- Ship control (1)
- Sign regular matrix (2)
- Simulation (1)
- Sleep (1)
- Software radio (1)
- Spectral analysers (1)
- Sprachakustik (1)
- Street sweeper (1)
- Task allocation (1)
- Technology transfer (1)
- Telecommunication traffic (2)
- Timber bridges (1)
- Totally nonnegative matrix (4)
- Totally nonpositive matrix (1)
- Totally nonpositve matrix (1)
- Totally positive matrix (2)
- Trajectory tracking (1)
- Transaction cost economics (1)
- Transaction relations (2)
- Treibhausgasemissionen (1)
- Triangulation (1)
- Umweltstrategie (1)
- Unscented Kalman Filter (1)
- Urban development pattern (1)
- Urbanity (1)
- Value network (1)
- Venture emergence (2)
- Vertex matrix (1)
- WLTC (1)
- WLTP (1)
- Wave filtering (1)
- Wessenberg-Schule (1)
- Xtext (2)
- Zugfestigkeit (1)
- algebraic codes (1)
- greenhouse gas protocol (1)
- modulation coding (1)
- nachhaltige Universität (1)
The business plan is one of the most frequently available artifacts to innovation intermediaries of technology-based ventures' presentations in their early stages [1]–[4]. Agreement on the evaluations of venturing projects based on the business plans highly depends on the individual perspective of the readers [5], [6]. One reason is that little empirical proof exists for descriptions in business plans that suggest survival of early-stage technology ventures [7]–[9]. We identified descriptions of transaction relations [10]–[13] as an anchor of the snapshot model business plan to business reality [13]. In the early-stage, surviving ventures are building transaction relations to human resources, financial resources, and suppliers on the input side, and customers on the output side of the business towards a stronger ego-centric value network [10]–[13]. We conceptualized a multidimensional measurement instrument that evaluates the maturity of this ego-centric value networks based on the transaction relations of different strength levels that are described in business plans of early-stage technology ventures [13]. In this paper, the research design and the instrument are purified to achieve high agreement in the evaluation of business plans [14]–[16]. As a result, we present an overall research design that can reach acceptable quality for quantitative research. The paper so contributes to the literature on business analysis in the early-stage of technology-based ventures and the research technique of content analysis.
Digital cameras are used in a large variety of scientific and industrial applications. For most applications the acquired data should represent the real light intensity per pixel as accurately as possible. However, digital cameras are subject to different sources of noise which distort the resulting image. Noise includes photon noise, fixed pattern noise and read noise. The aim of the radiometric calibration is to improve the quality of the resulting images by reducing the influence of the different types of noise on the measured data. In this paper, a new approach for the radiometric calibration of digital cameras using sparse Gaussian process regression is presented. Gaussian process regression is a kernel based supervised machine learning technique. It is used to learn the response of a camera system from a set of training images to allow for the calibration of new images. Compared to the standard Gaussian process method or flat field correction our sparse approach allows for faster calibration and higher reconstruction quality.
In this paper totally nonnegative (positive) matrices are considered which are matrices having all their minors nonnegative (positve); the almost totally positive matrices form a class between the totally nonnegative matrices and the totally positive ones. An efficient determinantal test based on the Cauchon algorithm for checking a given matrix for falling in one of these three classes of matrices is applied to matrices which are related to roots of polynomials and poles of rational functions, specifically the Hankel matrix associated with the Laurent series at infinity of a rational function and matrices of Hurwitz type associated with polynomials. In both cases it is concluded from properties of one or two finite sections of the infinite matrix that the infinite matrix itself has these or related properties. Then the results are applied to derive a sufficient condition for the Hurwitz stability of an interval family of polynomials. Finally, interval problems for a subclass of the rational functions, viz. R-functions, are investigated. These problems include invariance of exclusively positive poles and exclusively negative roots in the presence of variation of the coefficients of the polynomials within given intervals.
Measuring the natural frequency of buildings and bridges is a possibility to get information about the stiffness of the construction. Decreasing stiffness can be detected be repeatedly measurements. Damaged parts of the construction or too high wood moisture can be reasons for decreasing stiffness. The earlier the failure is detected the better is the chance to repair it with low costs. The method of monitoring by repeatedly measuring the natural frequency is applied at timber bridges, especially on footbridges. As damages due to high wood moisture cannot be seen easily, measuring the natural frequency is a good possibility to detect them and then to repair them. Equations to calculate the natural frequencies regarding the damaged parts are shown and applied to a simple supported beam.
Cognitive radio (CR) is a key enabler of wireless in industrial applications especially for those with strict quality-of-service (QoS) requirements. The cornerstone of CR is spectrum occupancy prediction that enables agile and proactive spectrum access and efficient utilization of spectral resources. Hidden Markov Models (HMM) provide powerful and flexible tools for statistical spectrum prediction. In this paper we introduce a HMM-based spectrum prediction algorithm for industrial applications that accurately predicts multiple slots in the future. Traditional HMM prediction approaches use two hidden states enabling the prediction of only one step ahead in the future. This one step is most often not enough due to internal hardware delays that render it outdated. We show in this work that extending the number of hidden states and formulating the prediction problem as a maximum likelihood (ML) classification approach enables a prediction span of multiple slots in the future even with fine spectrum sensing resolution. We verify the suitability of our approach to industrial wireless through extensive simulations that utilize a realistic measurement-based traffic model specifically tailored for industrial automotive settings.
Recent years have seen the proposal of several different gradient-based optimization methods for training artificial neural networks. Traditional methods include steepest descent with momentum, newer methods are based on per-parameter learning rates and some approximate Newton-step updates. This work contains the result of several experiments comparing different optimization methods. The experiments were targeted at offline handwriting recognition using hierarchical subsampling networks with recurrent LSTM layers. We present an overview of the used optimization methods, the results that were achieved and a discussion of why the methods lead to different results.
Creating cages that enclose a 3D-model of some sort is part of many preprocessing pipelines in computational geometry. Creating a cage of preferably lower resolution than the original model is of special interest when performing an operation on the original model might be to costly. The desired operation can be applied to the cage first and then transferred to the enclosed model. With this paper the authors present a short survey of recent and well known methods for cage computation.
The authors would like to give the reader an insight in common methods and their differences.
The corporate entrepreneur
(2016)
Corporate entrepreneurship is one tool for established companies to strengthen their capabilities for strategic renewal and innovativeness. The question, however, which factors are influencing the success of a corporate entrepreneurship initiative requires further attention. The corporate entrepreneur who is acting as both the leader of embedded entrepreneurial teams and linking pin to the corporate, is providing one possible perspective. Based on 6 interviews conducted in 6 German organizations this study contributes to the understanding of the role of the corporate entrepreneur and how this role can be distinguished from other roles in the context of innovation.
Scoring LSP tasks
(2016)
This paper broadens the resource-based approach to explaining survival of new technology-based firms (NTBFs) by focusing on the entrepreneur's ability to transform resources in response to triggers resulting from market interactions. Network theory is used to define a construct that allows determining the status of venture emergence (VE).The operationalization of the VE construct is built on the firm's value network maturity in the four market dimensions customer, investor, partner, and human resource. Business plans of NTBFs represent the artifact that contains this data in the form of transaction relation descriptions. Using content analysis, a multi-step combined human and computer coding process has been developed to empirically determine NTBFs' status of VE.Results of the business plan analysis suggests that the level of transaction relations allows to draw conclusions on the status of VE. Moreover, applying the developed process, a business plan coding test shows that the transaction relation based VE status significantly relates to NTBFs' survival capabilities.
This paper builds upon the widely-used resource-based approach to explaining survival of new technology-based firms (NTBFs). However, instead of looking at the NTBF's initial resource configuration, a process-oriented perspective is taken by focusing on the entrepreneur's ability to transform resources in response to triggers resulting from market interactions. Transaction relations reflect these interactions and are thus operationalized with a suggested method for measuring the status of venture emergence (VE) applicable to early-stage NTBFs. NTBFs' value network maturity is reflected in the number and strength of their transaction relations in the four market dimensions customer, investor, partner, and human resource. Business plans of NTBFs represent the artifact that contains this data in the form of transaction relation descriptions. Using content analysis, a multi-step combined human and computer coding process has been developed to annotate and classify transaction relations from business plans in order to empirically determine NTBFs' status of VE. Results of the business plan analysis suggest that the level of transaction relations allows to draw conclusions on the VE status. Moreover, applying the developed process, first analysis of a business plan coding test shows that the transaction relation based VE status significantly relates to NTBF survival capability.