971 research outputs found
Structuring Urban Redevelopment Projects: Moving Participants Up the Learning Curve
Urban redevelopment projects implemented through public-private partnerships are the preferred way to revitalize inner-city areas. As the numbers of participants increase and deal structures become more complex, participants need more detailed knowledge of one anotherās motivations and behaviors to achieve feasible redevelopment projects. This research describes the expectations and behaviors of private sources of debt and equity, especially their financial return requirements, and the actions public participants can take to reduce project risks. With this knowledge, lead public and private participants should be able to forge economically viable projects that generate greater public benefits while reducing the risks of urban redevelopment.
Office Market Analysis: Improving Best-Practice Techniques
This article focuses on ways to improve market analysis for proposed office projects, taking time and data limitations into account. The discussion moves sequentially through the three primary components of systematic, logical market analysis: the market overview, the market study and the marketability study. Key suggestions cover: (1) discussing megatrends affecting office user preferences and product design; (2) estimating long-term attractiveness of the office location and site; (3) forecasting balance or imbalance between future demand and supply of office space at the metropolitan level; (4) segmenting and differentiating supply and demand at the submarket level for the purpose of assigning market capture rates; and (5) conducting sensitivity analysis of the key variables affecting project net operating income.
A novel characterization of the complexity class based on counting and comparison
This is the author's accepted versionFinal version available from Elsevier via the DOI in this recordThe complexity class Ī2P, which is the class of languages recognizable by deterministic Turing machines in polynomial time with at most logarithmic many calls to an NP oracle, received extensive attention in the literature. Its complete problems can be characterized by different specific tasks, such as deciding whether the optimum solution of an NP problem is unique, or whether it is in some sense āoddā (e.g., whether its size is an odd number). In this paper, we introduce a new characterization of this class and its generalization ĪkP to the k-th level of the polynomial hierarchy. We show that problems in ĪkP are also those whose solution involves deciding, for two given sets A and B of instances of two Ī£kā1P-complete (or Ī kā1P-complete) problems, whether the number of āyesā-instances in A is greater than those in B. Moreover, based on this new characterization, we provide a novel sufficient condition for ĪkP-hardness. We also define the general problem Comp-Validk, which is proven here Īk+1P-complete. Comp-Validk is the problem of deciding, given two sets A and B of quantified Boolean formulas with at most k alternating quantifiers, whether the number of valid formulas in A is greater than those in B. Notably, the problem Comp-Sat of deciding whether a set contains more satisfiable Boolean formulas than another set, which is a particular case of Comp-Valid1, demonstrates itself as a very intuitive Ī2P-complete problem. Nonetheless, to our knowledge, it eluded its formal definition to date. In fact, given its strict adherence to the count-and-compare semantics here introduced, Comp-Validk is among the most suitable tools to prove ĪkP-hardness of problems involving the counting and comparison of the number of āyesā-instances in two sets. We support this by showing that the Ī2P-hardness of the Max voting scheme over mCP-nets is easily obtained via the new characterization of ĪkP introduced in this paper.This work was supported by the UK EPSRC grants EP/J008346/1, EP/L012138/1, and EP/M025268/1, and by The Alan Turing Institute under the EPSRC grant EP/N510129/1. We thank Dominik Peters and the anonymous reviewers for their helpful comments on a preliminary version of the paper
On the complexity of mCP-nets
This is the author accepted manuscript. The final version is available from AAAI Publications via the link in this recordmCP-nets are an expressive and intuitive formalism based on CP-nets to reason about preferences of groups of agents. The dominance semantics of mCP-nets is based on the concept of voting, and different voting schemes give rise to different dominance semantics for the group. Unlike CP-nets, which received an extensive complexity analysis, mCP-nets, as reported multiple times in the literature, lack a precise study of the voting tasks' complexity. Prior to this work, only a complexity analysis of brute-force algorithms for these tasks was available, and this analysis only gave EXPTIME upper bounds for most of those problems. In this paper, we start to fill this gap by carrying out a precise computational complexity analysis of voting tasks on acyclic binary polynomially connected mCP-nets whose constituents are standard CP-nets. Interestingly, all these problems actually belong to various levels of the polynomial hierarchy, and some of them even belong to PTIME or LOGSPACE. Furthermore, for most of these problems, we provide completeness results, which show tight lower bounds for problems that (up to date) did not have any explicit non-obvious lower bound.This work has received funding from the EPSRC grants
EP/J008346/1, EP/L012138/1, and EP/M025268/1
Emergency Management in the Event of Radiological Dispersion in an Urban Environment
Dispersion of a radiological source is a complex scenario in terms of first response, especially when it occurs in an urban environment. The authors in this paper designed, simulated, and analyzed the data from two different scenarios with the two perspectives of an unintentional fire event and a Radiological Dispersal Device (RDD) intentional explosion. The data of the simulated urban scenario are taken from a real case of orphan sources abandoned in a garage in the center of the city of Milan (Italy) in 2012. The dispersion and dose levels are simulated using Parallel Micro Swift Spray (PMSS) software, which takes into account the topographic and meteorological information of the reference scenarios. Apart from some differences in the response system of the two scenarios analyzed, the information provided by the modeling technique used, compared to other models not able to capture the actual urban and meteorological contexts, make it possible to modulate a response system that adheres to the real impact of the scenario. The authors, based on the model results and on the evidence provided by the case study, determine the various countermeasures to adopt to mitigate the impact for the population and to reduce the risk factors for the first responders
Applicability and Limitations in the Use of National Input-Output Tables for Regional Studies
Complexity of Approximate Query Answering under Inconsistency in Datalog+/-
This is the author accepted manuscript. The final version is available from the publisher via the link in this recordSeveral semantics have been proposed to query inconsistent ontological
knowledge bases, including the intersection of repairs and the intersection of closed
repairs as two approximate inconsistency-tolerant semantics. In this paper, we
analyze the complexity of conjunctive query answering under these two semantics
for a wide range of DatalogĀ± languages. We consider both the standard setting,
where errors may only be in the database, and the generalized setting, where also
the rules of a DatalogĀ± knowledge base may be erroneous.This work was supported by The Alan Turing Institute under the
UK EPSRC grant EP/N510129/1, and by the EPSRC grants EP/R013667/1, EP/L012138/1,
and EP/M025268/1
Complexity of Inconsistency-Tolerant Query Answering in Datalog+/- under Cardinality-Based Repairs
This is the author accepted manuscript. The final version is available from Association for the Advancement of Artificial Intelligence (AAAI) via the link in this recordQuerying inconsistent ontological knowledge bases is an important
problem in practice, for which several inconsistencytolerant
query answering semantics have been proposed, including
query answering relative to all repairs, relative to
the intersection of repairs, and relative to the intersection of
closed repairs. In these semantics, one assumes that the input
database is erroneous, and the notion of repair describes a
maximally consistent subset of the input database, where different
notions of maximality (such as subset and cardinality
maximality) are considered. In this paper, we give a precise
picture of the computational complexity of inconsistencytolerant
(Boolean conjunctive) query answering in a wide
range of DatalogĀ± languages under the cardinality-based versions
of the above three repair semantics.This work was supported by the Alan
Turing Institute under the UK EPSRC grant EP/N510129/1,
and by the EPSRC grants EP/R013667/1, EP/L012138/1,
and EP/M025268/1
Complexity of Approximate Query Answering under Inconsistency in Datalog+/-
This is the author accepted manuscript. The final version is freely available from IJCAI via the link in this recordSeveral semantics have been proposed to query inconsistent
ontological knowledge bases, including
the intersection of repairs and the intersection of
closed repairs as two approximate inconsistencytolerant
semantics. In this paper, we analyze the
complexity of conjunctive query answering under
these two semantics for a wide range of DatalogĀ±
languages. We consider both the standard setting,
where errors may only be in the database, and the
generalized setting, where also the rules of a DatalogĀ±
knowledge base may be erroneous.This work was supported by The Alan Turing Institute under
the UK EPSRC grant EP/N510129/1, and by the EPSRC
grants EP/R013667/1, EP/L012138/1, and EP/M025268/1
- ā¦