Application of the analytic hierarchy process (AHP) in multi-criteria analysis of the selection of intelligent building systems

The availability of innumerable intelligent building (IB) products, and the current dearth of inclusive building component selection methods suggest that decision makers might be confronted with the quandary of forming a particular combination of components to suit the needs of a specific IB project. Despite this problem, few empirical studies have so far been undertaken to analyse the selection of the IB systems, and to identify key selection criteria for major IB systems. This study is designed to fill these research gaps. Two surveys: a general survey and the analytic hierarchy process (AHP) survey are proposed to achieve these objectives. The first general survey aims to collect general views from IB experts and practitioners to identify the perceived critical selection criteria, while the AHP survey was conducted to prioritize and assign the important weightings for the perceived criteria in the general survey. Results generally suggest that each IB system was determined by a disparate set of selection criteria with different weightings. ‘Work efficiency’ is perceived to be most important core selection criterion for various IB systems, while ‘user comfort’, ‘safety’ and ‘cost effectiveness’ are also considered to be significant. Two sub-criteria, ‘reliability’ and ‘operating and maintenance costs’, are regarded as prime factors to be considered in selecting IB systems. The current study contributes to the industry and IB research in at least two aspects. First, it widens the understanding of the selection criteria, as well as their degree of importance, of the IB systems. It also adopts a multi-criteria AHP approach which is a new method to analyse and select the building systems in IB. Further research would investigate the inter-relationship amongst the selection criteria.

Problem-solving courts, therapeutic jurisprudence and the constitution : if two is company, is three a crowd?

Court costs, resource-intensive trials, booming prison populations and the obduracy of recidivism rates all present as ugly excesses of the criminal law adversarial paradigm. To combat these excesses, problem-solving courts have evolved with an edict to address the underlying issues that have caused an individual to commit a crime. When a judge seeks to help a problem-solving court participant deal with issues like addiction, mental health or poverty, they are performing a very different role to that of a judicial officer in the traditional court hierarchy. They are no longer the removed, independent arbiter — a problem-solving court judge steps into the ‘arena’ with the participant and makes active use of their judicial authority to assist in rehabilitation and positive behavioural change. Problem-solving court judges employing the principles of therapeutic jurisprudence appreciate that their interaction with participants can have therapeutic and anti-therapeutic consequences. This article will consider how the deployment of therapeutic measures (albeit with good intention) can lead to the behavioural manifestation of partiality and bias on the part of problem-solving court judges. Chapter III of the Commonwealth Constitution will then be analysed to highlight why the operation and functioning of problem solving courts may be deemed unconstitutional. Part IV of this article will explain how a problem-solving court judge who is not acting impartially or independently will potentially contravene the requirements of the Constitution. It will finally be suggested that judges who possess a high level of emotional intelligence will be the most successful in administering an independent and impartial problem solving court.

An application of the analytic hierarchy process and fuzzy logic inference in a decision support system for forage selection

Forage selection plays a prominent role in the process of returning cultivated lands back into grasslands. The conventional method of selecting forage species can only provide attempts for problem-solving without considering the relationships among the decision factors globally. Therefore, this study is dedicated to developing a decision support system to help farmers correctly select suitable forage species for the target sites. After collecting data through a field study, we developed this decision support system. It consists of three steps: (1) the analytic hierarchy process (AHP), (2) weights determination, and (3) decision making. In the first step, six factors influencing forage growth were selected by reviewing the related references and by interviewing experts. Then a fuzzy matrix was devised to determine the weight of each factor in the second step. Finally, a gradual alternative decision support system was created to help farmers choose suitable forage species for their lands in the third step. The results showed that the AHP and fuzzy logic are useful for forage selection decision making, and the proposed system can provide accurate results in a certain area (Gansu Province) of China.

Learning Classes Correlated to a Hierarchy

Trees are a common way of organizing large amounts of information by placing items with similar characteristics near one another in the tree. We introduce a classification problem where a given tree structure gives us information on the best way to label nearby elements. We suggest there are many practical problems that fall under this domain. We propose a way to map the classification problem onto a standard Bayesian inference problem. We also give a fast, specialized inference algorithm that incrementally updates relevant probabilities. We apply this algorithm to web-classification problems and show that our algorithm empirically works well.

Multilevel refinement for the vehicle routing problem

Multilevel approaches to computational problems are pervasive across many areas of applied mathematics and scientific computing. The multilevel paradigm uses recursive coarsening to create a hierarchy of approximations to the original problem, then an initial solution is found for the coarsest problem and iteratively refined and improved at each level, coarsest to finest. The solution process is aided by the global perspective (or `global view') imparted to the optimisation by the coarsening. This paper looks at their application to the Vehicle Routing Problem.

Multilevel refinement strategies for the capacity vehicle routing problem

We discuss the application of the multilevel (ML) refinement technique to the Vehicle Routing Problem (VRP), and compare it to its single-level (SL) counterpart. Multilevel refinement recursively coarsens to create a hierarchy of approximations to the problem and refines at each level. A SL algorithm, which uses a combination of standard VRP heuristics, is developed first to solve instances of the VRP. A ML version, which extends the global view of these heuristics, is then created, using variants of the construction and improvement heuristics at each level. Finally some multilevel enhancements are developed. Experimentation is used to find suitable parameter settings and the final version is tested on two well-known VRP benchmark suites. Results comparing both SL and ML algorithms are presented.

The application of multilevel refinement to the vehicle routing problem

We discuss the application of the multilevel (ML) refinement technique to the Vehicle Routing Problem (VRP), and compare it to its single-level (SL) counterpart. Multilevel refinement recursively coarsens to create a hierarchy of approximations to the problem and refines at each level. A SL heuristic, termed the combined node-exchange composite heuristic (CNCH), is developed first to solve instances of the VRP. A ML version (the ML-CNCH) is then created, using the construction and improvement heuristics of the CNCH at each level. Experimentation is used to find a suitable combination, which extends the global view of these heuristics. Results comparing both SL and ML are presented.

Valved Dataflow For FPGA Memory Hierarchy Synthesis

For modern FPGA, implementation of memory intensive processing applications such as high end image and video processing systems necessitates manual design of complex multilevel memory hierarchies incorporating off-chip DDR and onchip BRAM and LUT RAM. In fact, automated synthesis of multi-level memory hierarchies is an open problem facing high level synthesis technologies for FPGA devices. In this paper we describe the first automated solution to this problem.
By exploiting a novel dataflow application modelling dialect, known as Valved Dataflow, we show for the first time how, not only can such architectures be automatically derived, but also that the resulting implementations support real-time processing for current image processing application standards such as H.264. We demonstrate the viability of this approach by reporting the performance and cost of hierarchies automatically generated for Motion Estimation, Matrix Multiplication and Sobel Edge Detection applications on Virtex-5 FPGA.

The use of analytical hierarchy process in spatial decision support system for land use management

Geographic information systems give us the possibility to analyze, produce, and edit geographic information. Furthermore, these systems fall short on the analysis and support of complex spatial problems. Therefore, when a spatial problem, like land use management, requires a multi-criteria perspective, multi-criteria decision analysis is placed into spatial decision support systems. The analytic hierarchy process is one of many multi-criteria decision analysis methods that can be used to support these complex problems. Using its capabilities we try to develop a spatial decision support system, to help land use management. Land use management can undertake a broad spectrum of spatial decision problems. The developed decision support system had to accept as input, various formats and types of data, raster or vector format, and the vector could be polygon line or point type. The support system was designed to perform its analysis for the Zambezi river Valley in Mozambique, the study area. The possible solutions for the emerging problems had to cover the entire region. This required the system to process large sets of data, and constantly adjust to new problems’ needs. The developed decision support system, is able to process thousands of alternatives using the analytical hierarchy process, and produce an output suitability map for the problems faced.

Hierarchy and Expansiveness in Two-Dimensional Subshifts of Finite Type

Subshifts are sets of configurations over an infinite grid defined by a set of forbidden patterns. In this thesis, we study two-dimensional subshifts offinite type (2D SFTs), where the underlying grid is Z2 and the set of for-bidden patterns is finite. We are mainly interested in the interplay between the computational power of 2D SFTs and their geometry, examined through the concept of expansive subdynamics. 2D SFTs with expansive directions form an interesting and natural class of subshifts that lie between dimensions 1 and 2. An SFT that has only one non-expansive direction is called extremely expansive. We prove that in many aspects, extremely expansive 2D SFTs display the totality of behaviours of general 2D SFTs. For example, we construct an aperiodic extremely expansive 2D SFT and we prove that the emptiness problem is undecidable even when restricted to the class of extremely expansive 2D SFTs. We also prove that every Medvedev class contains an extremely expansive 2D SFT and we provide a characterization of the sets of directions that can be the set of non-expansive directions of a 2D SFT. Finally, we prove that for every computable sequence of 2D SFTs with an expansive direction, there exists a universal object that simulates all of the elements of the sequence. We use the so called hierarchical, self-simulating or fixed-point method for constructing 2D SFTs which has been previously used by Ga´cs, Durand, Romashchenko and Shen.

Integrable hierarchy for multidimensional Toda equations and topological-anti-topological fusion

The negative symmetry flows are incorporated into the Riemann-Hilbert problem for the homogeneous A(m)-hierarchy and its (gl) over cap (m + 1, C) extension.A loop group automorphism of order two is used to define a sub-hierarchy of (gl) over cap (m + 1, C) hierarchy containing only the odd symmetry flows. The positive and negative flows of the +/-1 grade coincide with equations of the multidimensional Toda model and of topological-anti-topological fusion. (C) 2002 Elsevier B.V. B.V. All rights reserved.

The higher grading structure of the WKI hierarchy and the two-component short pulse equation

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Nonvanishing boundary condition for the mKdV hierarchy and the Gardner equation

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Supersymmetry of Affine Toda Models as Fermionic Symmetry Flows of the Extended mKdV Hierarchy

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Hierarchy-Based Access Control in Distributed Environments

Access control is a fundamental concern in any system that manages resources, e.g., operating systems, file systems, databases and communications systems. The problem we address is how to specify, enforce, and implement access control in distributed environments. This problem occurs in many applications such as management of distributed project resources, e-newspaper and payTV subscription services. Starting from an access relation between users and resources, we derive a user hierarchy, a resource hierarchy, and a unified hierarchy. The unified hierarchy is then used to specify the access relation in a way that is compact and that allows efficient queries. It is also used in cryptographic schemes that enforce the access relation. We introduce three specific cryptography based hierarchical schemes, which can effectively enforce and implement access control and are designed for distributed environments because they do not need the presence of a central authority (except perhaps for set- UP).