This research book aims is to establish that: a transaction graph leads to better understanding of the concepts and relations in transactions and their semantics within enterprise architecture. Enterprise architecture comprises of complex transactional information systems that carry out repetitive and bespoke business transactions to meet business goals. When enterprise systems transact with each other there needs to be an exchange of meaning through transactions, so that agent A has the same conceptual understanding as agent B in the business transaction. If we accept that agents may not use the same terms to mean the same things, we need a way to discover what another agent means when it transacts. Conceptual Graphs are used to capture and to model business transactions and their semantics within enterprise architecture. Using case studies in a health domain and a financial domain this research investigates and develops an approach and design artefacts for the specification of semantics in transactions within enterprise architecture. Model automation is used to provide both accurate semantic and syntactic refinement, aiding the designer to capture semantics through ontology.
Book DescriptionIn modern economies a substantial proportion of resources is increasingly allocated to transaction costs. An improvement in the definition of transaction costs to include both the information role and efficiency role requires an integration of the approaches of positive economics and normative economics. In The Economics of Transaction Costs P.K. Rao provides a comprehensive analytical treatment of the subject and suggests a few directions for formal economic models.
Restricted Neighborhood Search Algorithm(R.N.S.C)is a cost-based clustering technique for clustering the graph into separate clusters, where each cluster has some similar properties.Based on a practitioner's insights, the book focuses on the basic principles and dwells on the complex details of graph clustering using Restricted Neighbourhood Search. The book covers the following: Introduction Experimental results Test Data Random graph Color benchmark graph Parameter training and statistical results Cluster limit Diversification Tabu length Search length Graph coloring
Data management technology changes the world we live in by providing efficient access to huge volumes of constantly changing data and by enabling sophisticated analysis of those data. In parallel, we witness a tremendous shift in the underlying hardware technology toward highly parallel multicore processors. Data management systems need to fully exploit the abundantly available hardware parallelism. Transaction processing is one of the most important and challenging database workloads and this dissertation contributes to the quest for scalable transaction processing software. It shows that conventional transaction processing has inherent scalability limitations due to the unpredictable access patterns caused by the request-oriented execution model it follows. Instead, it proposes adopting a data-oriented execution model, and shows that transaction processing systems designed around data-oriented execution break the inherent limitations of conventional execution. The data-oriented design paves the way for transaction processing systems to maintain scalability as parallelism increases for the foreseeable future; as hardware parallelism increases, the benefits will only increase.
Hardbound. Algorithmic Graph Theory and Perfect Graphs, first published in 1980, has become the classic introduction to the field. This new Annals version continues to convey the message that intersection graph models are a necessary and important tool for solving real-world problems. It remains a stepping stone from which the reader may embark on one of many fascinating research trails. The past twenty years have been an amazingly fruitful period of research in algorithmic graph theory and structured families of graphs. Especially important have been the theory and applications of new intersection graph models such as generalizations of permutation graphs and interval graphs. These have lead to new families of perfect graphs and many algorithmic results. A new Epilogue chapter in this second edition surveys many of the recent results in the area. It also gives pointers for further study. The book has served to unify the topic and to act as a sp
Graph databases have become an indispensable tool for the analysis of linked data and interrelated data. As with any graph data representation, the need for using graph database systems emerge when they increase in size and complexity. Affiliated to those needs, graph database benchmarks emerge to assess the performance of such systems in application scenarios, representative of use cases. I proposed graph database benchmarks based on the idea of social network application. The benchmark implements and proposes a data generator that synthetically generate graphs. Also a set of high level application queries on this application that model parts of the behavior of social network users. I also studied the graph database benchmarks results that affects the performance of graph database systems. I proposed graph database benchmarks in terms of data model, query workload, large datasets and usage scenarios. I discussed the characteristics of Neo4j and DEX graph databases to be included in the benchmarks. Also I studied, the characteristics of these graph databases queries that are important in the application of graph analysis.
Graph labeling is one of the fascinating areas of graph theory with wide ranging applications. Graph labelings were first introduced in the 1960’s where the vertices and edges are assigned real values or subsets of a set subject to certain conditions. An enormous body of literature has grown around graph labeling in the last five decades. Labeled graphs provide mathematical models for a broad range of applications. The qualitative labelings of a graph element have been used in diverse fields such as Conflict resolutions in Social psychology, Energy crises etc. Quantitative labelings of graph elements have been used in Missile guidance codes, Radar location codes, Coding theory, X-Ray Crystallography, Radio-Astronomy, Circuit design, Communication Network and the like Most popular graph labelings trace their origin to one introduced by Rosa This thesis is devoted to the study of magic strength of several graphs, super edge-magic labeling, and super edge-magic strength of several graphs, super vertex-magic labeling, total super magic labeling and anti super edge-magic labeling and the corresponding strengths.
Kerberos is a network authentication protocol & is designed to provide strong authentication for client/server applications by using secret-key cryptography. Our research was aimed at enhancing the security of transactions over a network. In this study, we used Kerberos Encryption Technique for authentication and transaction security in the network. Further, we created an Authentication Server that used to derive a 64 bit key from user’s password. This password was of arbitrary length. The generated key then was used by authentication server, to encrypt ticket granting ticket + session key. The key generated by authentication server was then used by the client at the time of transaction through the transaction server to validate an authentic transaction. However, there was an issue of cross-validation of the ticket by the transaction server for which we included a database and encryption of all the text sent by any client to the transaction server. In this work we tried to implement authentication and transaction security in a Network using Kerberos. This project is embedded with Authentication Server application and used to derive a 64 bit key from user’s password.
The Making of Economic Policy – A Transaction Cost Politics Perspective (Paper)
One of the long standing unsolved problems in Graph Theory is the Graph Reconstruction Problem, proposed by S.M.Ulam and P.J.Kelly in 1942. This book mainly deals with three recent reductions of the Graph Reconstruction Problem, which may lead to the final solution of the problem. It is suitable for postgraduate students in Mathematics. It can also be effectively used for senior undergraduate level. The authors have taken great pain in presenting the results in a cogent manner and with enough clarity, so that a student can do self-study. Several figures are included as visual aids for enhancing the understanding. On the whole, this book will be a welcome addition to the existing literature on the theory of Graph Reconstruction and anticipates all success.
In this book a dynamic models have been developed for the following: variable speed wind energy conversion systems and power electronic interfacing devices. These dynamic models are suitable for both detailed fast transient and large time scale performance evaluation studies. They can be used to expedite the research processes in the related alternative energy areas, such as system control, performance optimization studies and diagnosis. One of the original points is that this work is the use of a new the fault detection and isolation method (FDI). The proposed method avoids the exploration of all the combinations for its application to the diagnostic of this system operation. The causal paths are used to generate the analytical redundancy relations (ARR) at each computation step based on the constitutive and structural junction relations. This is shown through an algorithm for monitoring the system by sensors placements on the corresponding bond graph model.
The industrial robot is more and more common conveyance in the manufacturing systems. More and more widespread use of computer aided process engineering means is observed due to the high equipment idle time cost, which makes development of machining programs possible without employment of the physical equipment. Results of analysis carried out reveal that the off-line robots programming systems vulnerability are the weak mechanisms for the collision-free path planning among the objects. For lack of an effective tool for the automatic planning of the robots safe trajectories programmer has to anticipate always a possibility of collisions, therefore, the path programming time is extended significantly. Lack of algorithmization of the decision making process referring to the assumed tool path causes that the robot program quality is dependant, in the first place, on its programmer's experience. All issues mentioned above were the reason for an attempt to develop the effective robots programming aid tool in the area of the automatic planning and optimization of the safe trajectories. The following chapters describe concepts, methods and practise application for solving these problems.
Reducibility of Graphs is one of the importent subject in the restrection problem in Graph Theory.In fact the deletion of vertices(edges) from the graph with certain property, may not maintain the property of the graph. When the graph maintain its property after deletion vertex(edge) from its vertex(edge) set means that we can study the graph with fewer vertices(edges) which simpilfie our study for this graph.
The improvement of milk production is a key issue in Kenya since the country relies heavily on Agriculture for economic growth. However, there is inadequate empirical evidence on the extent to which transaction costs constrain or prevent access to information and markets, especially for small scale dairy farmers. This book therefore assesses marketing constraints as a result of transaction costs faced by small scale dairy farmers in Nandi North and Uasin Gishu counties. It provides a pragmatic policy and recommends actions which enhance market participation among small scale dairy farmers, converting them from subsistence to commercial farmers, hence stimulating the rural economy through higher produce incomes. The work is guided by Transaction, Cost Economic and New Institutional Economics’ concepts and theories. This book is resourceful to stakeholders in the milk industry, business professionals, and business education students in higher learning institutions.
Far too little is known about the impact of market coordination failures on agrocredit supply arrangements and how agrocredit suppliers are coping with high transaction costs. This book applies an New Institutional Economics (NIE) approach, principally the Transaction Cost Economics (TCE) theory to first, analyse demand side primary information on the typology of agrocredit borrowers and their demand for agrocredit in relation to their farming systems; and second to analyse the supply side by describing agrocredit transaction arrangements and analyse the impact of transaction costs on preference by agrocredit suppliers for the most efficient transaction cost minimizing transaction arrangements. This book concludes that neither the markets Credit Transaction Arrangements (CTAs) nor the state CTAs are efficient in minimising all sorts of transaction costs implying that a blend of the private-public partnership is essential in the efficient delivery of agrocredit to smallholder farmers. Therefore this book should be very helpful to shed some practical insights on the understanding of the structure, conduct and performance of markets in agrarian economies.