To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
Federal and local agencies have identified a need to create building databases to help ensure that critical infrastructure and residential buildings are accounted for in disaster preparedness and to aid the decision-making processes in subsequent recovery efforts. To respond effectively, we need to understand the built environment—where people live, work, and the critical infrastructure they rely on. Yet, a major discrepancy exists in the way data about buildings are collected across the United SStates There is no harmonization in what data are recorded by city, county, or state governments, let alone at the national scale. We demonstrate how existing open-source datasets can be spatially integrated and subsequently used as training for machine learning (ML) models to predict building occupancy type, a major component needed for disaster preparedness and decision -making. Multiple ML algorithms are compared. We address strategies to handle significant class imbalance and introduce Bayesian neural networks to handle prediction uncertainty. The 100-year flood in North Carolina is provided as a practical application in disaster preparedness.
The Cambridge Handbook of Emerging Issues at the Intersection of Commercial Law and Technology is a timely and interdisciplinary examination of the legal and societal implications of nascent technologies in the global commercial marketplace. Featuring contributions from leading international experts in the field, this volume offers fresh and diverse perspectives on a range of topics, including non-fungible tokens, blockchain technology, the Internet of Things, product liability for defective goods, smart readers, liability for artificial intelligence products and services, and privacy in the era of quantum computing. This work is an invaluable resource for academics, policymakers, and anyone seeking a deeper understanding of the social and legal challenges posed by technological innovation, as well as the role of commercial law in facilitating and regulating emerging technologies.
Analysing hierarchical design processes is difficult due to the technical and organizational dependencies spanning over multiple levels. The V-Model of Systems Engineering considers multiple levels. It is, however, not quantitative. We propose a model for simulating hierarchical product design processes based on the V-Model. It includes, first, a product model which structures physical product properties in a hierarchical dependency graph; second, an organizational model which formalizes the assignment of stakeholder responsibility; third, a process model which describes the top-down and bottom-up flow of design information; fourth, an actor model which simulates the combination of product, organization and process by using computational agents. The quantitative model is applied to a simple design problem with three stakeholders and three separate areas of responsibility. The results show the following phenomena observed in real-world product design: design iterations occur naturally as a consequence of the designers’ individual behaviour; inconsistencies in designs emerge and are resolved. The simple design problem is used to compare point-based and interval-based requirement decomposition quantitatively. It is shown that development time can be reduced significantly by using interval-based requirements if requirements are always broken down immediately.
A modeling method of multi-objective optimization design for parallel mechanisms (PMs) is proposed, whose implementation is illustrated with 2RPU-RPS mechanism as an example. The orientation of biased output axis on moving platform is depicted by spherical attitude angles, and its kinematic model is deduced through vector method. With screw theory as mathematic tool, a comprehensive evaluation method of kinematic performance for PM is established. On this basis, the expensive constrained multi-objective optimization model of dimensional parameters for the discussed mechanism is constructed. The NSDE-II algorithm, formed by replacing the genetic algorithm operators in non-dominated sorting genetic algorithm II (NSGA-II) with DE operators, is utilized to solve this multi-objective optimization problem, thus obtaining multiple Pareto optimal solutions with engineering application significance, which proves the feasibility and effectiveness of the proposed modeling method and algorithm. Moreover, the normalization coverage space and the minimum adjacent vector angle are proposed to evaluate the computational performance of NSDE-II. Finally, the potential engineering application value for the optimized 2RPU-RPS PM is presented.
This paper initiates the explicit study of face numbers of matroid polytopes and their computation. We prove that, for the large class of split matroid polytopes, their face numbers depend solely on the number of cyclic flats of each rank and size, together with information on the modular pairs of cyclic flats. We provide a formula which allows us to calculate $f$-vectors without the need of taking convex hulls or computing face lattices. We discuss the particular cases of sparse paving matroids and rank two matroids, which are of independent interest due to their appearances in other combinatorial and geometric settings.
In this paper, fractional-order (FO), intelligent, and robust sliding mode control (SMC) and stabilization of inherently nonlinear, multi-input, multi-output 6-DOF robot manipulators are investigated. To ensure robust control and better performance of the robot system, significant studies on various control transactions have been explored. First, a sliding proportional-integral-derivative (PID) surface is conceived and then its FO constitute is developed. It is an important fact that in SMC, the reaching phase is fast and the chattering is abated in the sliding phase. In particular, the discontinuity in the SMC is prevented in view of the boundary layer obtained by recommending the sigmoid function together with fuzzy logic to eliminate the chattering phenomenon. A hybrid tuning method consisting of gray wolf optimization and particle swarm optimization (GWO-PSO) algorithms is applied to tune the parameters of PID sliding mode control (PIDSMC), FO PIDSMC (FOPIDSMC), fuzzy PIDSMC (FPIDSMC), and FO fuzzy PIDSMC (FOFPIDSMC) controllers. In simulation results, the tuned FOFPIDSMC controller consistently outperforms PIDSMC, FOPIDSMC, and FPIDSMC controllers tuned by the GWO-PSO in dynamic performance, trajectory tracking, disturbance rejection, and mass uncertainty scenarios. It has been seen through a thorough performance analysis that 91.93% and 44.13% improvement are, respectively, obtained for mean absolute error (MAE) and torques root mean square (RMS) values of the joints when using from the PIDSMC to the FOFPIDSMC. Finally, the simulation outcomes reveal the superior aspects of the designed FOFPIDSMC and also demonstrate that the FOFPIDSMC controller enhances the dynamic performances of the 6-revolute universal robots 5 (6R UR5) robot manipulator under a variety of operating conditions.
Sexual and gender–based violence (SGBV) is a multifaceted, endemic, and nefarious phenomenon that remains poorly measured and understood, despite greater global awareness of the issue. While efforts to improve data collection methods have increased–including the implementation of the Demographic and Health Survey (DHS) in some countries–the lack of reliable SGBV data remains a significant challenge to developing targeted policy interventions and advocacy initiatives. Using a recent mixed–methods research project conducted by the authors in Sierra Leone as a case study, this paper discusses the current status of SGBV data, challenges faced, and potential research a pproaches.
Climate change exacerbates existing risks and vulnerabilities for people globally, and migration is a longstanding adaptation response to climate risk. The mechanisms through which climate change shapes human mobility are complex, however, and gaps in data and knowledge persist. In response to these gaps, the United Nations Development Programme’s (UNDP) Predictive Analytics, Human Mobility, and Urbanization Project employed a hybrid approach that combined predictive analytics with participatory foresight to explore climate change-related mobility in Pakistan and Viet Nam from 2020 to 2050. Focusing on Karachi and Ho Chi Minh City, the project estimated temporal and spatial mobility patterns under different climate change scenarios and evaluated the impact of such in-migration across key social, political, economic, and environmental domains. Findings indicate that net migration into these cities could significantly increase under extreme climate scenarios, highlighting both the complex spatial patterns of population change and the potential for anticipatory policies to mitigate these impacts. While extensive research exists on foresight methods and theory, process reflections are underrepresented. The innovative approach employed within this project offers valuable insights on foresight exercise design choices and their implications for effective stakeholder engagement, as well as the applicability and transferability of insights in support of policymaking. Beyond substantive findings, this paper offers a critical reflection on the methodological alignment of data-driven and participatory foresight with the aim of anticipatory policy ideation, seeking to contribute to the enhanced effectiveness of foresight practices.
This informative Handbook provides a comprehensive overview of the legal, ethical, and policy implications of AI and algorithmic systems. As these technologies continue to impact various aspects of our lives, it is crucial to understand and assess the challenges and opportunities they present. Drawing on contributions from experts in various disciplines, the book covers theoretical insights and practical examples of how AI systems are used in society today. It also explores the legal and policy instruments governing AI, with a focus on Europe. The interdisciplinary approach of this book makes it an invaluable resource for anyone seeking to gain a deeper understanding of AI's impact on society and how it should be regulated. This title is also available as Open Access on Cambridge Core.
One of the key challenges of regulating internet platforms is international cooperation. This chapter offers some insights into platform responsibility reforms by relying on forty years of experience in regulating cross-border financial institutions. Internet platforms and cross-border banks have much in common from a regulatory perspective. They both operate in an interconnected global market that lacks a supranational regulatory framework. And they also tend to generate cross-border spillovers that are difficult to control. Harmful content and systemic risks – the two key regulatory challenges for platforms and banks, respectively – can be conceptualized as negative externalities.
One of the main lessons learned in regulating cross-border banks is that, under certain conditions, international regulatory cooperation is possible. We have witnessed that in the successful design and implementation of the Basel Accord – the global banking standard that regulates banks’ solvency and liquidity risks. In this chapter, I will analyze the conditions under which cooperation can ensue and what the history of the Basel Accord can teach to platform responsibility reforms. In the last part, I will discuss what can be done when cooperation is more challenging.
Digital behavior does not occur in isolation within space, but is instead ever-present, vying for a user’s time against other alternative behaviors. The determinants of behavior choice are diverse, yet in behavioral sciences, this “behavioral competition” is operationalized by alterations in the value of the contingent reinforcer to latent behaviors. In this competitive environment, where the user has limited time to enact certain behaviors, they must choose by seeking a balance that maximizes their satisfaction (law of diminishing marginal utility & utility maximization model). This shifting process is known as behavioral contrast, which reflects a variation in some behavioral component due to the change in the value of reinforcers associated with any of the present behaviors. In the design of digital behaviors, understanding this process is fundamental, as it directs the designer towards potential enhancements of the digital service (through improving the reinforcers) to better its positioning against competitors.
The conditional legal immunity for hosting unlawful content (safe harbour) provided by Section 79 of the Information Technology Act, 2000 (IT Act) is central to the regulation of online platforms in India for two reasons. First, absent this immunity, platforms in India risk being secondarily liable for a wide range of civil and criminal offences. Second, the Indian Government has recognised that legal immunity for user-generated content is key to platform operations and has sought to regulate platform behaviour by prescribing several pre-conditions to safe harbour. This chapter examines the different obligations set out in the Intermediary Guidelines and evaluates the efforts of the Indian government to regulate platform behaviour in India through the pre-conditions for safe harbour. This chapter finds that the obligations set out in the Intermediary Guidelines are enforced in a patchwork and inconsistent manner through courts. However, the Indian Government retains powerful controls over content and platform behaviour by virtue of its power to block content under Section 69A of the IT Act and the ability to impose personal liability on platform employees within India.
Jiří Adámek, Czech Technical University in Prague,Stefan Milius, Friedrich-Alexander-Universität Erlangen-Nürnberg, Germany,Lawrence S. Moss, Indiana University, Bloomington
Corecursive algebras are algebras that admit unique solutions of recursive equation systems. We study these and a generalization: completely iterative algebras. The terminal coalgebra turns out to be the initial corecursive algebra as well as the initial completely iterative algebra. Dually, the initial algebra is the initial (parametrically) recursive coalgebra. These results explain the title of the chapter. We apply recursive coalgebras in order to obtain a new proof of the Initial Algebra Theorem from Chapter 6.
Jiří Adámek, Czech Technical University in Prague,Stefan Milius, Friedrich-Alexander-Universität Erlangen-Nürnberg, Germany,Lawrence S. Moss, Indiana University, Bloomington
Well-founded coalgebras generalize well-foundedness for graphs, and they capture the induction principle for well-founded orders on an abstract level. Taylor’s General Recursion Theorem shows that, under hypotheses, every well-founded coalgebra is parametrically recursive. We give a new proof of this result, and we show that it holds for all set functors, and for all endofunctors preserving monomorphisms on a complete and well-powered category with smooth monomorphisms. The converse of the theorem holds for set functors preserving inverse images. We provide an iterative construction of the well-founded part of a given coalgebra: It is carried by the least fixed point of Jacobs’ next-time operator.
Jiří Adámek, Czech Technical University in Prague,Stefan Milius, Friedrich-Alexander-Universität Erlangen-Nürnberg, Germany,Lawrence S. Moss, Indiana University, Bloomington
This chapter presents a number of sufficient conditions to guarantee that an endofunctor has an initial algebra or a terminal coalgebra. We generalize Kawahara and Mori’s notion of a bounded set functor and prove that for a cocomplete and co-well-powered category with a terminal object, every endofunctor bounded by a generating set has a terminal coalgebra. We use this to show that every accessible endofunctor on a locally presentable category has an initial algebra and a terminal coalgebra. We introduce pre-accessible functors and prove that on a cocomplete and co-well-powered category, the initial-algebra chain of a pre-accessible functor converges, and so the initial algebra exists. If the base category is locally presentable and the functor preserves monomorphisms, then the terminal coalgebra exists.
This paper considers the goals of regulators in different countries working on regulating online platforms and how those varied motivations influence the potential for international coordination and cooperation on platform governance. different policy debates and goals surrounding online platform responsibility. The analysis identifies different policy goals related to three different types of obligations that regulators may impose on online platforms: responsibilities to target particular categories of unwanted content, responsibilities for platforms that wield particularly significant influence, and responsibilities to be transparent about platform decision-making. Reviewing the proposals that have emerged in each of these categories across different countries, the paper examines which of these three policy goals present the greatest opportunities for international coordination and agreement and which of them actually require such coordination in order to be effectively implemented. Finally, it considers what lessons can be drawn from existing policy efforts for how to foster greater coordination around areas of common interest related to online platforms.
Jiří Adámek, Czech Technical University in Prague,Stefan Milius, Friedrich-Alexander-Universität Erlangen-Nürnberg, Germany,Lawrence S. Moss, Indiana University, Bloomington