A new frequency offset estimation for OFDM-based systems

A new carrier frequency offset estimation scheme in orthogonal frequency division multiplexing (OFDM) is proposed. The scheme includes coarse frequency offset estimation and fine frequency offset estimation. The coarse frequency offset estimation method we present is a improvement of Zhang's method. The estimation range of the new method is as large as the overall signal-band width. A new fine frequency offset estimation algorithm is also discussed in this paper. The new algorithm has a better performance than the Schmidl's algorithm. The system we use to calculate and simulate is based on the high rate WLAN standard adopted by the IEEE 802.11 stanidardization group. Numerical results are presented to demonstrate the performance of the proposed algorithm.

A new frequency offset estimation for OFDM-Based systems

A-new-carrier-frequency offset estimation scheme in orthogonal frequency division multiplexing (OFDM) is proposed. The scheme includes coarse frequency offset estimation and fine frequency offset estimation. The coarse frequency offset estimation method we present is a improvement of Zhang's method. The estimation range of the new method is as large as the overall signal-band width. A new fine frequency offset estimation algorithm is also discussed in this paper. The new algorithm has a better performance than the Schmidt's algorithm. The system we use to calculate and simulate is based on the high rate WLAN standard adopted by the IEEE 802.11 standardization group. Numerical results are presented to demonstrate the performance of the proposed algorithm.

semantic oriented ontology cohesion metrics for ontology-based systems

Ontologies play a core role to provide shared knowledge models to semantic-driven applications targeted by Semantic Web. Ontology metrics become an important area because they can help ontology engineers to assess ontology and better control project management and development of ontology based systems, and therefore reduce the risk of project failures. In this paper, we propose a set of ontology cohesion metrics which focuses on measuring (possibly inconsistent) ontologies in the context of dynamic and changing Web. They are: Number of Ontology Partitions (NOP), Number of Minimally Inconsistent Subsets (NMIS) and Average Value of Axiom Inconsistencies (AVAI). These ontology metrics are used to measure ontological semantics rather than ontological structure. They are theoretically validated for ensuring their theoretical soundness, and further empirically validated by a standard test set of debugging ontologies. The related algorithms to compute these ontology metrics also are discussed. These metrics proposed in this paper can be used as a very useful complementarity of existing ontology cohesion metrics.

Computing explanations for interactive constraint-based systems

Constraint programming has emerged as a successful paradigm for modelling combinatorial problems arising from practical situations. In many of those situations, we are not provided with an immutable set of constraints. Instead, a user will modify his requirements, in an interactive fashion, until he is satisfied with a solution. Examples of such applications include, amongst others, model-based diagnosis, expert systems, product configurators. The system he interacts with must be able to assist him by showing the consequences of his requirements. Explanations are the ideal tool for providing this assistance. However, existing notions of explanations fail to provide sufficient information. We define new forms of explanations that aim to be more informative. Even if explanation generation is a very hard task, in the applications we consider, we must manage to provide a satisfactory level of interactivity and, therefore, we cannot afford long computational times. We introduce the concept of representative sets of relaxations, a compact set of relaxations that shows the user at least one way to satisfy each of his requirements and at least one way to relax them, and present an algorithm that efficiently computes such sets. We introduce the concept of most soluble relaxations, maximising the number of products they allow. We present algorithms to compute such relaxations in times compatible with interactivity, achieving this by indifferently making use of different types of compiled representations. We propose to generalise the concept of prime implicates to constraint problems with the concept of domain consequences, and suggest to generate them as a compilation strategy. This sets a new approach in compilation, and allows to address explanation-related queries in an efficient way. We define ordered automata to compactly represent large sets of domain consequences, in an orthogonal way from existing compilation techniques that represent large sets of solutions.

Zone based systems design framework for the realisation of efficient block cipher based message authentication code algorithms

A zone based systems design framework is described and utilised in the implementation of a message authentication code (MAC) algorithm based on symmetric key block ciphers. The resulting block cipher based MAC algorithm may be used to provide assurance of the authenticity and, hence, the integrity of binary data. Using software simulation to benchmark against the de facto cipher block chaining MAC (CBC-MAC) variant used in the TinySec security protocol for wireless sensor networks and the NIST cipher block chaining MAC standard, CMAC; we show that our zone based systems design framework can lead to block cipher based MAC constructs that point to improvements in message processing efficiency, processing throughput and processing latency.

The ‘Public Interest’ Agency of International Organizations? The case of the OECD Principles of Corporate Governance

This article seeks to outline and explore some of the conditions necessary for International Organizations (IOs) to perform in a public interest fashion through a case study of the Principles of corporate governance formulated by the OECD. Rather than the more commonly documented pathological and dysfunctional behavioural forms of IOs, the case of the Principles, both in their formulation by the OECD, and in their assessment by the World Bank through the ROSC process, represent an episode of IO agency protecting and promoting a wider public interest. In exercising their agency, IO staff, have made the Principles more agreeable to a wider range of interested parties, giving them a general interest orientation, in accordance with a proceduralist definition of public interest. This case should therefore encourage IPE scholars to consider carefully and systematically the sets of circumstances and conditions, which might be required for IO agency to take more socially useful forms. In the final section, three indicators are identified which might be evaluated in future research into the positive public interest agency of IOs across a range of cases.

The role of operations management in public sector policy and practice alignment: a local government analysis

In responding to the demand for change and improvement, local government has applied a plethora of operations management-based methods, tools and techniques. This article explores how these methods, specifically in the form of performance management models, are used to improve alignment between central government policy and local government practice, an area which has thus far been neglected in the literature. Using multiple case studies from Environmental Waste Management Services, this research reports that models derived in the private sector are often directly ‘implanted’ into the public sector. This has challenged the efficacy of all performance management models. However, those organisations which used models most effectively did so by embedding (contextualisation) and extending (reconceptualisation) them beyond their original scope. Moreover, success with these models created a cumulative effect whereby other operations management approaches were probed, adapted and used.

Tools for Finding Inconsistencies in Real-world Logic-based Systems

Currently there is extensive theoretical work on inconsistencies in logic-based systems. Recently, algorithms for identifying inconsistent clauses in a single conjunctive formula have demonstrated that practical application of this work is possible. However, these algorithms have not been extended for full knowledge base systems and have not been applied to real-world knowledge. To address these issues, we propose a new algorithm for finding the inconsistencies in a knowledge base using existing algorithms for finding inconsistent clauses in a formula. An implementation of this algorithm is then presented as an automated tool for finding inconsistencies in a knowledge base and measuring the inconsistency of formulae. Finally, we look at a case study of a network security rule set for exploit detection (QRadar) and suggest how these automated tools can be applied.

A normative framework for agent-based systems

One of the key issues in the computational representation of open societies relates to the introduction of norms that help to cope with the heterogeneity, the autonomy and the diversity of interests among their members. Research regarding this issue presents two omissions. One is the lack of a canonical model of norms that facilitates their implementation, and that allows us to describe the processes of reasoning about norms. The other refers to considering, in the model of normative multi-agent systems, the perspective of individual agents and what they might need to effectively reason about the society in which they participate. Both are the concerns of this paper, and the main objective is to present a formal normative framework for agent-based systems.

Japanese Scientific And Technology Information in the United States - Public Policy and Private Initiatives

In January 1983 a group of US government, industry and university information specialists gathered at MIT to take stock of efforts to monitor, acquire, assess, and disseminate Japanese scientific and technical information (JSTI). It was agreed that these efforts were uncoordinated and poorly conceived, and that a clearer understanding of Japanese technical information systems and a clearer sense of its importance to end users was necessary. That meeting led to formal technology assessments, Congressinal hearings, and legislation; it also helped stimulate several private initiatives in JSTI provision. Four years later there exist better coordinated and better conceived JSTI programs in both the public and private sectors, but there remains much room for improvement. This paper will recount their development and assess future directions.

Articulating ‘public interest’ through complexity theory

The ‘Public interest’, even if viewed with ambiguity or scepticism, has been one of the primary means by which various professional roles of planners have been justified. Many objections to the concept have been advanced by writers in planning academia. Notwithstanding these, ‘public interest’ continues to be mobilised, to justify, defend or argue for planning interventions and reforms. This has led to arguments that planning will have to adopt and recognise some form of public interest in practice to legitimise itself.. This paper explores current debates around public interest and social justice and advances a vision of the public interest informed by complexity theory. The empirical context of the paper is the poverty alleviation programme, the Kudumbashree project in Kerala, India.

Equations to predict methane emissions from cows fed at maintenance energy level in pasture-based systems

Ruminant production is a vital part of food industry but it raises environmental concerns, partly due to the associated methane outputs. Efficient methane mitigation and estimation of emissions from ruminants requires accurate prediction tools. Equations recommended by international organizations or scientific studies have been developed with animals fed conserved forages and concentrates and may be used with caution for grazing cattle. The aim of the current study was to develop prediction equations with animals fed fresh grass in order to be more suitable to pasture-based systems and for animals at lower feeding levels. A study with 25 nonpregnant nonlactating cows fed solely fresh-cut grass at maintenance energy level was performed over two consecutive grazing seasons. Grass of broad feeding quality, due to contrasting harvest dates, maturity, fertilisation and grass varieties, from eight swards was offered. Cows were offered the experimental diets for at least 2 weeks before housed in calorimetric chambers over 3 consecutive days with feed intake measurements and total urine and faeces collections performed daily. Methane emissions were measured over the last 2 days. Prediction models were developed from 100 3-day averaged records. Internal validation of these equations, and those recommended in literature, was performed. The existing in greenhouse gas inventories models under-estimated methane emissions from animals fed fresh-cut grass at maintenance while the new models, using the same predictors, improved prediction accuracy. Error in methane outputs prediction was decreased when grass nutrient, metabolisable energy and digestible organic matter concentrations were added as predictors to equations already containing dry matter or energy intakes, possibly because they explain feed digestibility and the type of energy-supplying nutrients more efficiently. Predictions based on readily available farm-level data, such as liveweight and grass nutrient concentrations were also generated and performed satisfactorily. New models may be recommended for predictions of methane emissions from grazing cattle at maintenance or low feeding levels.

EXPLOITING A GENERIC APPROACH TO CONSTRUCT COMPONENT-BASED SYSTEMS SOFTWARE IN LINUX ENVIRONMENTS

Component-based software engineering has recently emerged as a promising solution to the development of system-level software. Unfortunately, current approaches are limited to specific platforms and domains. This lack of generality is particularly problematic as it prevents knowledge sharing and generally drives development costs up. In the past, we have developed a generic approach to component-based software engineering for system-level software called OpenCom. In this paper, we present OpenComL an instantiation of OpenCom to Linux environments and show how it can be profiled to meet a range of system-level software in Linux environments. For this, we demonstrate its application to constructing a programmable router platform and a middleware for parallel environments.