Showing papers on "Network theory published in 1994"

The limits of silicon valley: a critique of network theory

Abstract: During the 1980s, the idea ofthe dynamic network was putforward as a new model of flexible production and applied to Silicon Valley, the home ofthe US semiconductor industry. This paper arguss that the Silicon Valley network (a collaborating group of high technology firms incapable of realizing the main rewards from its innovations. Although the dynamic network may be appropriate for the early stage of the product life cycle, it lacks the necessary complementary assets to secure the Profits generakd during the growth and maturity stapes. The network lacks the scale-intensive process capabilities, the global marketing outbts and the large financial resources needed to capture the rewards om mass market innovations. These assets, by necessity tend to be embodied in large integated corporations. A simple model is offered to show the limits of the networkform compared with the integrated ‘Chandlerian’ corporation. During the 1990s, large firms will continue to capture the profits from innovation, not only in ...

Integrating case-based reasoning, knowledge-based approach and Dijkstra algorithm for route finding

Abstract: Imagine you rent a car and plan to drive around an unfamiliar city. Before you go from one place to another, you need to know a good route. In network theory, this is the shortest path problem. Dijkstra's algorithm is often used for solving this problem. However, when the road network of the city is very complicated and dense, which is usually the case, it will take too long for the algorithm to find the shortest path. Furthermore, in reality, things are not as simple as those stated in network theory. For instance, the cost of travel for the same part of the city at different times may not be the same. In this project, we have integrated Dijkstra's algorithm with a knowledge-based approach and case-based reasoning in solving the problem. With this integration, knowledge about the geographical information and past cases are used to help Dijkstra's algorithm in finding a solution. This approach dramatically reduces the computation time required for route finding. A prototype system has been implemented for route finding in Singapore. >

Introduction to Computer Performance Analysis With Mathematica

Abstract: Capacity Planning. Understanding the Current Environment. Setting Performance Objectives. Prediction of Future Workload. Evaluation of Future Configurations. Validation. The Ongoing Management Process. Performance Management Tools. Organizations and Journals for Performance Analysis. Components of Computer Performance: Central Processing Units. The Memory Hierarchy. Input Output. Basic Calculations: Model Definitions, Single Workload Class Models. Multiple Workloads Models. Basic Queueing Network Theory. Queue discipline. Queueing Network Performance. Queueing Network Laws. Little's Law. Utilization Law . Response Time Law. Forced Flow Law. Bounds and Bottlenecks. Bounds for Single Class Networks. Modeling Study Paradigm. Advantages of Queueing Theory Models. Analytic Solution Methods: Analytic Queueing Theory Network Models. Single Class Models. Multiclass Models. Priority Queueing Systems. Modeling Main Computer Memory. Model Parameterization: Measurement Tools. Model Parameterization. The Modeling Paradigm. Calculating the Parameters. Simulation and Benchmarking: Introduction to Simulation. Writing a Simulator. Simulation Languages. Simulation Summary. Benchmarking. Forecasting: NFU Time Series Forecasting. Afterward.

Diakoptics-a parallel processing approach for the analysis of large-scale power systems

Abstract: The structure, the quality and the dimension of the power systems are subject to change and to become more complex. For the analysis of such vast power systems the use of computers is indispensable. In the computer-aided power system analysis, the computational cost and the accuracy are two important factors. The computational cost, i.e. computational time and memory needed for the analysis, are related to the dimension of system being analyzed. The increase in the system dimension will directly increase these requirements and creates several difficulties. Some new approaches for the mathematical formulation of power systems have been considered to find a more convenient way to simulate large-scale power systems. However, a literature survey on the analyses of large-scale power systems has shown that the advantages to be gained by the use of the concept of multi-terminal component introduced in network theory have not been fully utilised. This paper deals with the application of the concept of multi-terminal components to the analysis of large-scale power systems. The new approach, which is perfectly general and can be applied to both the analysis of asymmetric and symmetric systems, aims to obtain the coefficient matrix of the system as a block-diagonal-band matrix. Instead of solving the whole matrix by using a processor, blocks representing the sub-networks can be solved simultaneously via parallel processors to speed up the process. >