978 resultados para Dynamic Capability
Resumo:
Information and technology and its use in organisation transformation presents unprecedented opportunities and risks. Increasingly, the Governance of Enterprise Information and Technology (GEIT) competency in the board room and executive is needed. Whether your organization is small or large, public, private or not for profit or whether your industry is not considered high-tech, IT is impacting your sector – no exceptions. But there is a skill shortage in boards: GEIT capability is concerningly low. This capability is urgently needed across the board, including those directors who come from finance, legal, marketing, operations and HR backgrounds. Digital disruption also affects all occupations. Putting in place a vision will help ensure emergency responses will meet technology-related duty of care responsibilities. When GEIT-related forward thinking and planning is carried out at the same time that you put your business strategy and plan in place, your organization has a significantly increased chance of not only surviving, but thriving into the future. Those organizations that don’t build GEIT capability risk joining the growing list of once-leading firms left behind in the digital ‘cloud of smoke’. Those organizations that do will be better placed to reap the benefits and hedge against the risks of a digital world. This chapter provides actionable, research-based considerations and processes for boards to use, to build awareness, knowledge and skills in governing technology-related organization strategy, risk and value creation.
Resumo:
There are 23,500 level crossings in Australia. In these types of environments it is important to understand what human factor issues are present and how road users and pedestrians engage with crossings. A series of on-site observations were performed over a 2-day period at a 3-track active crossing. This was followed by 52 interviews with local business owners and members of the public. Data were captured using a manual-coding scheme for recording and categorising violations. Over 700 separate road user and pedestrian violations were recorded, with representations in multiple categories. Time stamping revealed that the crossing was active for 59% of the time in some morning periods. Further, trains could take up to 4-min to arrive following its first activation. Many pedestrians jaywalked under side rails and around active boom gates. In numerous cases pedestrians put themselves at risk in order to beat or catch the approaching train, ignored signs to stop walking when the lights were flashing. Analysis of interview data identified themes associated with congestion, safety, and violations. This work offers insight into context specific issues associated with active level crossing protection.
Resumo:
In this paper, we propose a self Adaptive Migration Model for Genetic Algorithms, where parameters of population size, the number of points of crossover and mutation rate for each population are fixed adaptively. Further, the migration of individuals between populations is decided dynamically. This paper gives a mathematical schema analysis of the method stating and showing that the algorithm exploits previously discovered knowledge for a more focused and concentrated search of heuristically high yielding regions while simultaneously performing a highly explorative search on the other regions of the search space. The effective performance of the algorithm is then shown using standard testbed functions, when compared with Island model GA(IGA) and Simple GA(SGA).
Resumo:
Many optimal control problems are characterized by their multiple performance measures that are often noncommensurable and competing with each other. The presence of multiple objectives in a problem usually give rise to a set of optimal solutions, largely known as Pareto-optimal solutions. Evolutionary algorithms have been recognized to be well suited for multi-objective optimization because of their capability to evolve a set of nondominated solutions distributed along the Pareto front. This has led to the development of many evolutionary multi-objective optimization algorithms among which Nondominated Sorting Genetic Algorithm (NSGA and its enhanced version NSGA-II) has been found effective in solving a wide variety of problems. Recently, we reported a genetic algorithm based technique for solving dynamic single-objective optimization problems, with single as well as multiple control variables, that appear in fed-batch bioreactor applications. The purpose of this study is to extend this methodology for solution of multi-objective optimal control problems under the framework of NSGA-II. The applicability of the technique is illustrated by solving two optimal control problems, taken from literature, which have usually been solved by several methods as single-objective dynamic optimization problems. (C) 2004 Elsevier Ltd. All rights reserved.
Resumo:
The viscosity of five binary gas mixtures - namely, oxygen-hydrogen, oxygen-nitrogen, oxygen-carbon dioxide, carbon dioxide-nitrogen, carbon dioxide-hydrogen - and two ternary mixtures - oxygen-nitrogen-carbon dioxide and oxygen-hydrogen-carbon dioxide - were determined at ambient temperature and pressure using an oscillating disk viscometer. The theoretical expressions of several investigators were in good agreement with the experimental results obtained with this viscometer. In the case of the ternary gas mixture oxygen-carbon dioxide-nitrogen, as long as the volumetric ratio of oxygen to carbon dioxide in the mixture was maintained at 11 to 8, the viscosity of the ternary mixture at ambient temperature and pressure remained constant irrespective of the percentage of nitrogen present in the mixture.
Resumo:
In this paper, we propose a self Adaptive Migration Model for Genetic Algorithms, where parameters of population size, the number of points of crossover and mutation rate for each population are fixed adaptively. Further, the migration of individuals between populations is decided dynamically. This paper gives a mathematical schema analysis of the method stating and showing that the algorithm exploits previously discovered knowledge for a more focused and concentrated search of heuristically high yielding regions while simultaneously performing a highly explorative search on the other regions of the search space. The effective performance of the algorithm is then shown using standard testbed functions, when compared with Island model GA(IGA) and Simple GA(SGA).
Resumo:
Layered LiNi1/3Co1/3Mn1/3O2, which is isostructural with LiCoO2, is considered as a potential cathode material for Li-ion batteries. Submicrometer sized porous particles are useful for high discharge rates. The present work involves a synthesis of submicrometer sized porous particles of LiNi1/3Co1/3Mn1/3O2 using a triblock copolymer as a soft template. The precursor obtained from the reaction is heated at different temperatures between 600 and 900 degrees C for 6 h to get the final product samples. The compound attains increased crystallinity with an increase in the temperature of preparation. However, there is a decrease in the surface area and also in the porosity of the sample. Nevertheless, the LiNi1/3Co1/3Mn1/3O2 sample prepared at 900 degrees C exhibits a high rate capability and stable capacity retention on cycling. The electrochemical performance of LiNi1/3Co1/3Mn1/3O2 prepared in the absence of the polymer template is inferior to that of the sample prepared in the presence of the polymer template. (C) 2010 The Electrochemical Society. [DOI: 10.1149/1.3364944] All rights reserved.
Resumo:
In this work a single edge notched plate (SEN(T)) subjected to a tensile stress pulse is analysed, using a 2D plane strain dynamic finite element procedure. The interaction of the notch with a pre-nucleated hole ahead of it is examined. The background material is modelled by the Gurson constitutive law and ductile failure by microvoid coalescence in the ligament connecting the notch and the hole is simulated. Both rate independent and rate dependent material behaviour is considered. The notch tip region is subjected to a range of loading rates j by varying the peak value and the rise time of the applied stress pulse. The results obtained from these simulations are compared with a three point bend (TPB) specimen subjected to impact loading analysed in an earlier work [3] The variation of J at fracture initiation, J(c), with average loading rate j is obtained from the finite element simulations. It is found that the functional relationship between J(c) and j is fairly independent of the specimen geometry and is only dependent on material behaviour.
Resumo:
The growth of characteristic length scales associated with dynamic heterogeneity in glass-forming liquids is investigated in an extensive computational study of a four-point, time-dependent structure factor defined from spatial correlations of mobility, for a model liquid for system sizes extending up to 351 232 particles, in constant-energy and constant-temperature ensembles. Our estimates for dynamic correlation lengths and susceptibilities are consistent with previous results from finite size scaling. We find scaling exponents that are inconsistent with predictions from inhomogeneous mode coupling theory and a recent simulation confirmation of these predictions.
Resumo:
Despite thirty years of research in interorganizational networks and project business within the industrial networks approach and relationship marketing, collective capability of networks of business and other interorganizational actors has not been explicitly conceptualized and studied within the above-named approaches. This is despite the fact that the two approaches maintain that networking is one of the core strategies for the long-term survival of market actors. Recently, many scholars within the above-named approaches have emphasized that the survival of market actors is based on the strength of their networks and that inter-firm competition is being replaced by inter-network competition. Furthermore, project business is characterized by the building of goal-oriented, temporary networks whose aims, structures, and procedures are clarified and that are governed by processes of interaction as well as recurrent contracts. This study develops frameworks for studying and analysing collective network capability, i.e. collective capability created for the network of firms. The concept is first justified and positioned within the industrial networks, project business, and relationship marketing schools. An eclectic source of conceptual input is based on four major approaches to interorganizational business relationships. The study uses qualitative research and analysis, and the case report analyses the empirical phenomenon using a large number of qualitative techniques: tables, diagrams, network models, matrices etc. The study shows the high level of uniqueness and complexity of international project business. While perceived psychic distance between the parties may be small due to previous project experiences and the benefit of existing relationships, a varied number of critical events develop due to the economic and local context of the recipient country as well as the coordination demands of the large number of involved actors. The study shows that the successful creation of collective network capability led to the success of the network for the studied project. The processes and structures for creating collective network capability are encapsulated in a model of governance factors for interorganizational networks. The theoretical and management implications are summarized in seven propositions. The core implication is that project business success in unique and complex environments is achieved by accessing the capabilities of a network of actors, and project management in such environments should be built on both contractual and cooperative procedures with local recipient country parties.
Resumo:
CMPs enable simultaneous execution of multiple applications on the same platforms that share cache resources. Diversity in the cache access patterns of these simultaneously executing applications can potentially trigger inter-application interference, leading to cache pollution. Whereas a large cache can ameliorate this problem, the issues of larger power consumption with increasing cache size, amplified at sub-100nm technologies, makes this solution prohibitive. In this paper in order to address the issues relating to power-aware performance of caches, we propose a caching structure that addresses the following: 1. Definition of application-specific cache partitions as an aggregation of caching units (molecules). The parameters of each molecule namely size, associativity and line size are chosen so that the power consumed by it and access time are optimal for the given technology. 2. Application-Specific resizing of cache partitions with variable and adaptive associativity per cache line, way size and variable line size. 3. A replacement policy that is transparent to the partition in terms of size, heterogeneity in associativity and line size. Through simulation studies we establish the superiority of molecular cache (caches built as aggregations of molecules) that offers a 29% power advantage over that of an equivalently performing traditional cache.
Resumo:
Non-uniform sampling of a signal is formulated as an optimization problem which minimizes the reconstruction signal error. Dynamic programming (DP) has been used to solve this problem efficiently for a finite duration signal. Further, the optimum samples are quantized to realize a speech coder. The quantizer and the DP based optimum search for non-uniform samples (DP-NUS) can be combined in a closed-loop manner, which provides distinct advantage over the open-loop formulation. The DP-NUS formulation provides a useful control over the trade-off between bitrate and performance (reconstruction error). It is shown that 5-10 dB SNR improvement is possible using DP-NUS compared to extrema sampling approach. In addition, the close-loop DP-NUS gives a 4-5 dB improvement in reconstruction error.
Resumo:
802.11 WLANs are characterized by high bit error rate and frequent changes in network topology. The key feature that distinguishes WLANs from wired networks is the multi-rate transmission capability, which helps to accommodate a wide range of channel conditions. This has a significant impact on higher layers such as routing and transport levels. While many WLAN products provide rate control at the hardware level to adapt to the channel conditions, some chipsets like Atheros do not have support for automatic rate control. We first present a design and implementation of an FER-based automatic rate control state machine, which utilizes the statistics available at the device driver to find the optimal rate. The results show that the proposed rate switching mechanism adapts quite fast to the channel conditions. The hop count metric used by current routing protocols has proven itself for single rate networks. But it fails to take into account other important factors in a multi-rate network environment. We propose transmission time as a better path quality metric to guide routing decisions. It incorporates the effects of contention for the channel, the air time to send the data and the asymmetry of links. In this paper, we present a new design for a multi-rate mechanism as well as a new routing metric that is responsive to the rate. We address the issues involved in using transmission time as a metric and presents a comparison of the performance of different metrics for dynamic routing.
Resumo:
Most of the structural elements like beams, cables etc. are flexible and should be modeled as distributed parameter systems (DPS) to represent the reality better. For large structures, the usual approach of 'modal representation' is not an accurate representation. Moreover, for excessive vibrations (possibly due to strong wind, earthquake etc.), external power source (controller) is needed to suppress it, as the natural damping of these structures is usually small. In this paper, we propose to use a recently developed optinial dynamic inversion technique to design a set of discrete controllers for this purpose. We assume that the control force to the structure is applied through finite number of actuators, which are located at predefined locations in the spatial domain. The method used in this paper determines control forces directly from the partial differential equation (PDE) model of the system. The formulation has better practical significance, both because it leads to a closed form solution of the controller (hence avoids computational issues) as well as because a set of discrete actuators along the spatial domain can be implemented with relative ease (as compared to a continuous actuator).