Relevant bibliographies by topics / Delay constraint

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Delay constraint'

Author: Grafiati
Published: 3 June 2025
Last updated: 22 June 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Delay constraint.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Delay constraint"

1

Tan, Onur, Deniz Gündüz, and Vilardebó Jesús Gómez. "Linear Transmission of Composite Gaussian Measurements over a Fading Channel under Delay Constraints." IEEE Transactions on Wireless Communications 15, no. 6 (2016): 4335–47. https://doi.org/10.1109/TWC.2016.2539961.

Full text
Abstract:
Delay constrained linear transmission (LT) strategies are considered for the transmission of composite Gaussian measurements over an additive white Gaussian noise fading channel under an average power constraint. If the channel state information (CSI) is known by both the encoder and decoder, the optimal LT scheme in terms of the average mean-square error distortion is characterized under a strict delay constraint, and a graphical interpretation of the optimal power allocation strategy is presented. Then, for general delay constraints, two LT strategies are proposed based on the solution to a particular multiple measurements-parallel channels scenario. It is shown that the distortion decreases as the delay constraint is relaxed, and when the delay constraint is completely removed, both strategies achieve the optimal performance under certain matching conditions. If the CSI is known only by the decoder, the optimal LT strategy is derived under a strict delay constraint. The extension to general delay constraints is elusive. As a first step toward understanding the structure of the optimal scheme in this case, it is shown that for the multiple measurements-parallel channels scenario, any LT scheme that uses only a one-to-one linear mapping between measurements and channels is suboptimal in general.
APA, Harvard, Vancouver, ISO, and other styles
2

Li, Yuan Chen, and Wei Qun Liu. "Delay and Delay-Variation Constrained Multicast Routing Algorithm Based on Core Selection." Applied Mechanics and Materials 373-375 (August 2013): 1182–87. http://dx.doi.org/10.4028/www.scientific.net/amm.373-375.1182.

Full text
Abstract:
With the development of multimedia network, more and more real-time multimedia applications require a network capable of satisfying QoS constraints such as delay and delay-variation bound so that the messages reach each destination node at almost the same time within a certain specified time limit, and certain application also demand that different streams for each different destination node should reach with minimum cost under the constraints. Therefore, the delay and delay-variation constraint multicast routing problem is studied and a new strategy in core selection methods is proposed. The algorithm we propose guarantees that the delay from the source to any destination does not exceed a real-time constraint satisfying the delay-variation constraint under cost minimization. In addition, this core selection methods achieve a balance of optimizing cost and delay of the multicast tree. Simulation results show that the algorithm has low complexity and balances between the computational complexity and performance, it can also meet the requirements of real-time network communication.
APA, Harvard, Vancouver, ISO, and other styles
3

Gomer, Matthew R. "Accounting for population-level systematic effects using a hierarchical strategy." Proceedings of the International Astronomical Union 18, S381 (2022): 125–30. http://dx.doi.org/10.1017/s174392132300426x.

Full text
Abstract:
AbstractOne of the largest sources of systematics in time-delay cosmography arises from Mass Sheet Transformation (MST). The degeneracy associated with this transformation is often broken by an assumed profile shape, such as a power-law. A hierarchical strategy has been developed which constrains the global profile shape on a population level, constrained collectively by the kinematics measurements of the lenses. This framework allows one to include non-time-delay lenses to provide constraints to the global profile, improving the H0 constraints. This work tests the hierarchical framework using analytical profiles, and additionally tests the capacity to combine two populations which come from the same profiles but probe different radii due to a change in source redshift. We find that the hierarchical framework is able to compensate for this effect, and the addition of non-time-delay lenses improves the H0 constraint, even though these lenses have different Einstein radii than their time-delay counterparts.
APA, Harvard, Vancouver, ISO, and other styles
4

Cho, Seung-Myeong, Rina Yoon, Ilpyeong Yoon, Jihwan Moon, Seokjin Oh, and Kyeong-Sik Min. "Optimization of Memristor Crossbar’s Mapping Using Lagrange Multiplier Method and Genetic Algorithm for Reducing Crossbar’s Area and Delay Time." Information 15, no. 7 (2024): 409. http://dx.doi.org/10.3390/info15070409.

Full text
Abstract:
Memristor crossbars offer promising low-power and parallel processing capabilities, making them efficient for implementing convolutional neural networks (CNNs) in terms of delay time, area, etc. However, mapping large CNN models like ResNet-18, ResNet-34, VGG-Net, etc., onto memristor crossbars is challenging due to the line resistance problem limiting crossbar size. This necessitates partitioning full-image convolution into sub-image convolution. To do so, an optimized mapping of memristor crossbars should be considered to divide full-image convolution into multiple crossbars. With limited crossbar resources, especially in edge devices, it is crucial to optimize the crossbar allocation per layer to minimize the hardware resource in term of crossbar area, delay time, and area–delay product. This paper explores three optimization scenarios: (1) optimizing total delay time under a crossbar’s area constraint, (2) optimizing total crossbar area with a crossbar’s delay time constraint, and (3) optimizing a crossbar’s area–delay-time product without constraints. The Lagrange multiplier method is employed for the constrained cases 1 and 2. For the unconstrained case 3, a genetic algorithm (GA) is used to optimize the area–delay-time product. Simulation results demonstrate that the optimization can have significant improvements over the unoptimized results. When VGG-Net is simulated, the optimization can show about 20% reduction in delay time for case 1 and 22% area reduction for case 2. Case 3 highlights the benefits of optimizing the crossbar utilization ratio for minimizing the area–delay-time product. The proposed optimization strategies can substantially enhance the neural network’s performance of memristor crossbar-based processing-in-memory architectures, especially for resource-constrained edge computing platforms.
APA, Harvard, Vancouver, ISO, and other styles
5

Li, Yang, and Ting Yang. "Adaptive Finite-Time Constrained Attitude Stabilization for an Unmanned Helicopter System under Input Delay and Saturation." Processes 12, no. 9 (2024): 1787. http://dx.doi.org/10.3390/pr12091787.

Full text
Abstract:
This study focuses on addressing the constrained attitude stabilization problem for an unmanned helicopter (UH) system subject to disturbances, input delay and actuator saturation. A constrained memory sliding mode is first presented to constrain the flight attitude while handling the input delay. On this basis, an adaptive finite-time nonlinear observer is proposed to estimate the lumped disturbance with unknown upper bound. Moreover, based on the hyperbolic tangent function, a saturated attitude controller is designed to tackle the input saturation problem via the adaptive laws. The finite-time stability of the closed-loop constrained attitude system is proved by Lyapunov synthesis. Finally, the developed scheme can accomplish attitude stabilization and overcome the influence of disturbances, attitude constraint, input delay and actuator saturation in an easy way. Numerical simulations are carried out to demonstrate the effectiveness of the proposed control scheme.
APA, Harvard, Vancouver, ISO, and other styles
6

Ros, E., J. M. Marcaide, J. C. Guirado, et al. "High Precision Astrometry over Large Angular Scales with Closure Constraints: the Triplet 1803+784/1928+738/2007+777." Symposium - International Astronomical Union 175 (1996): 120–21. http://dx.doi.org/10.1017/s0074180900080268.

Full text
Abstract:
The technique of differential astrometry using the phase-delay VLBI observable promises fractional precisions of ≃2 × 10–9 in the determination of the separation of sources 5° or 6° apart on the sky (Guirado et al. 1995a; Lara et al. 1996). In our present research we seek further improvement in this technique through using triplets of radio sources, which provide a closure constraint in the determination of relative angular positions. This constraint not only eases the resolution of the phase-cycle ambiguities (a major problem in the least-squares approach to astrometry with phase delays), but it also strongly constrains the space of allowable parameter values.
APA, Harvard, Vancouver, ISO, and other styles
7

Zhang, Man, Ru Chang, and Ying Wang. "Prescribed Performance Tracking Control for Nonlinear Stochastic Time-Delay Systems with Multiple Constraints." Actuators 14, no. 1 (2025): 19. https://doi.org/10.3390/act14010019.

Full text
Abstract:
This paper proposes a prescribed performance tracking control scheme for a category of nonlinear stochastic time-delay systems with input saturation and state asymmetric time-varying constraints. First, to solve the non-differentiable problem caused by input saturation, a smooth nonlinear function was utilized to approximate the saturation function. A nonlinear mapping technique was employed to transform the constrained problem into a bounded convergence problem. The time-delay problem was then solved by constructing the corresponding Lyapunov–Krasovskii function. The error feedback controller was constructed by combining the backstepping technique, the dynamic surface technique, the neural network approximation technique, and the adaptive control method. Based on stochastic mean-square stability theory, all signals in the closed-loop system are proven to be bounded under the designed control scheme. Also, this scheme ensures that the system states always stay within the constraint range, and the tracking error meets the prescribed performance constraint. Finally, the feasibility and superiority of the proposed control scheme were validated through simulation.
APA, Harvard, Vancouver, ISO, and other styles
8

Witayakiattilerd, Wichai. "Nonlinear Fuzzy Differential Equation with Time Delay and Optimal Control Problem." Abstract and Applied Analysis 2015 (2015): 1–14. http://dx.doi.org/10.1155/2015/659072.

Full text
Abstract:
The existence and uniqueness of a mild solution to nonlinear fuzzy differential equation constrained by initial value were proven. Initial value constraint was then replaced by delay function constraint and the existence of a solution to this type of problem was also proven. Furthermore, the existence of a solution to optimal control problem of the latter type of equation was proven.
APA, Harvard, Vancouver, ISO, and other styles
9

BERETTA, E., P. FERGOLA, and C. TENNERIELLO. "CHEMOSTAT EQUATIONS FOR A PREDATOR-PREY CHAIN WITH DELAYED NUTRIENT RECYCLING." Journal of Biological Systems 03, no. 02 (1995): 483–94. http://dx.doi.org/10.1142/s0218339095000459.

Full text
Abstract:
The problem of the equilibrium stability for the chemostat equation is considered in the special case of a biotic species feeding on one limiting nutrient and predated by another biotic species. Both the biotic species through the decomposition process can return with delay to the chemostat fraction of dead biomass as new nutrient. The delay kernels of nutrient recycling are assumed to be general L2(0, +∞) non-negative functions which admit up to second order finite moments. Two approaches are adopted: the first one applies when both the biotic species have a self-regulating term in their evolution equations and can be worked out without linearizing the equations. This approach does not require any further constraint on delay kernels, whereas it introduces constraints on the remaining parameters of the model. The second approach applies to the linearized equations when the predator self-regulating term is set equal to zero. In this case the stability condition requires a constraint on the average time delays in the recycling processes. Both the approaches are performed by constructing suitable Krasovskii-Lyapunov functionals for the related functional retarded differential equations.
APA, Harvard, Vancouver, ISO, and other styles
10

Wang, Ren, Jingxiang Gao, Nanshan Zheng, et al. "Research on Accelerating Single-Frequency Precise Point Positioning Convergence with Atmospheric Constraint." Applied Sciences 9, no. 24 (2019): 5407. http://dx.doi.org/10.3390/app9245407.

Full text
Abstract:
An increasing number of researchers have conducted in-depth research on the advantages of low-cost single-frequency (SF) receivers, which can effectively use ionospheric information when compared to dual-frequency ionospheric-free combination. However, SF observations are bound to increase the unknown parameters and prolong the convergence time. It is desirable if the convergence time can be reduced by external information constraints, for example atmospheric constraints, which include ionosphere- or troposphere constraints. In this study, ionospheric delay constraints, tropospheric delay constraints, and their dual constraints were considered. Additionally, a total of 18,720 test experiments were performed. First, the nearest-neighbor extrapolation (NENE), bilinear- (BILI), bicubic- (BICU), and Junkins weighted-interpolation (JUNK) method of Global Ionospheric Map (GIM) grid products were analyzed. The statistically verified BILI in the percentage of convergence time, average convergence time, and computation time consumption of them shows a good advantage. Next, the influences of global troposphere- and ionosphere-constrained on the convergence time of SF Precise Point Positioning (PPP) were analyzed. It is verified that the ionosphere-constrained (TIC2) has significant influence on the convergence time in the horizontal and vertical components, while the troposphere-constrained (TIC1) has better effect on the convergence time in the vertical components within some thresholds. Of course, the dual constraint (TIC3) has the shortest average convergence time, which is at least 46.5% shorter in static mode and 5.4% in kinematic mode than standard SF PPP (TIC0).
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Delay constraint"

1

Nourani-Dargiri, Mehrdad. "Area and delay estimation for constraint-driven high-level synthesis." Case Western Reserve University School of Graduate Studies / OhioLINK, 1994. http://rave.ohiolink.edu/etdc/view?acc_num=case1057603424.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Kuroiwa, Yohei. "Sensitivity Shaping under Degree Constraint : Nevanlinna-Pick Interpolation for Multivarible and Time-Delay Systems." Licentiate thesis, KTH, Mathematics (Dept.), 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-4821.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Loxton, Ryan Christopher. "Optimal control problems involving constrained, switched, and delay systems." Thesis, Curtin University, 2010. http://hdl.handle.net/20.500.11937/1479.

Full text
Abstract:
In this thesis, we develop numerical methods for solving five nonstandard optimal control problems. The main idea of each method is to reformulate the optimal control problem as, or approximate it by, a nonlinear programming problem. The decision variables in this nonlinear programming problem influence its cost function (and constraints, if it has any) implicitly through the dynamic system. Hence, deriving the gradient of the cost and the constraint functions is a difficult task. A major focus of this thesis is on developing methods for computing these gradients. These methods can then be used in conjunction with a gradient-based optimization technique to solve the optimal control problem efficiently.The first optimal control problem that we consider has nonlinear inequality constraints that depend on the state at two or more discrete time points. These time points are decision variables that, together with a control function, should be chosen in an optimal manner. To tackle this problem, we first approximate the control by a piecewise constant function whose values and switching times (the times at which it changes value) are decision variables. We then apply a novel time-scaling transformation that maps the switching times to fixed points in a new time horizon. This yields an approximate dynamic optimization problem with a finite number of decision variables. We develop a new algorithm, which involves integrating an auxiliary dynamic system forward in time, for computing the gradient of the cost and constraints in this approximate problem.The second optimal control problem that we consider has nonlinear continuous inequality constraints. These constraints restrict both the state and the control at every point in the time horizon. As with the first problem, we approximate the control by a piecewise constant function and then transform the time variable. This yields an approximate semi-infinite programming problem, which can be solved using a penalty function algorithm. A solution of this problem immediately furnishes a suboptimal control for the original optimal control problem. By repeatedly increasing the number of parameters used in the approximation, we can generate a sequence of suboptimal controls. Our main result shows that the cost of these suboptimal controls converges to the minimum cost.The third optimal control problem that we consider is an applied problem from electrical engineering. Its aim is to determine an optimal operating scheme for a switchedcapacitor DC-DC power converter—an electronic device that transforms one DC voltage into another by periodically switching between several circuit topologies. Specifically, the optimal control problem is to choose the times at which the topology switches occur so that the output voltage ripple is minimized and the load regulation is maximized. This problem is governed by a switched system with linear subsystems (each subsystem models one of the power converter’s topologies). Moreover, its cost function is non-smooth. By introducing an auxiliary dynamic system and transforming the time variable (so that the topology switching times become fixed), we derive an equivalent semi-infinite programming problem. This semi-infinite programming problem, like the one that approximates the continuously-constrained optimal control problem, can be solved using a penalty function algorithm.The fourth optimal control problem that we consider involves a general switched system, which includes the model of a switched-capacitor DC-DC power converter as a special case. This switched system evolves by switching between several subsystems of nonlinear ordinary differential equations. Furthermore, each subsystem switch is accompanied by an instantaneous change in the state. These instantaneous changes—so-called state jumps—are influenced by control variables that, together with the subsystem switching times, should be selected in an optimal manner. As with the previous optimal control problems, we tackle this problem by transforming the time variable to obtain an equivalent problem in which the switching times are fixed. However, the functions governing the state jumps in this new problem are discontinuous. To overcome this difficulty, we introduce an approximate problem whose state jumps are governed by smooth functions. This approximate problem can be solved using a nonlinear programming algorithm. We prove an important convergence result that links the approximate problem’s solution with the original problem’s solution.The final optimal control problem that we consider is a parameter identification problem. The aim of this problem is to use given experimental data to identify unknown state-delays in a nonlinear delay-differential system. More precisely, the optimal control problem involves choosing the state-delays to minimize a cost function measuring the discrepancy between predicted and observed system output. We show that the gradient of this cost function can be computed by solving an auxiliary delay-differential system. On the basis of this result, the optimal control problem can be formulated—and hence solved—as a standard nonlinear programming problem.
APA, Harvard, Vancouver, ISO, and other styles
4

Holmberg, Jonas. "OFFLINE SCHEDULING OF TASK SETS WITH COMPLEX END-TO-END DELAY CONSTRAINTS." Thesis, Mälardalens högskola, Akademin för innovation, design och teknik, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-35694.

Full text
Abstract:
Software systems in the automotive domain are generally safety critical and subject to strict timing requirements. Systems of this character are often constructed utilizing periodically executed tasks, that have a hard deadline. In addition, these systems may have additional deadlines that can be specified on cause-effect chains, or simply task chains. They are defined by existing tasks in the system, hence the chains are not stand alone additions to the system. Each chain provide an end-to-end timing constraint targeting the propagation of data through the chain of tasks. These constraints specify the additional timing requirements that need to be fulfilled, when searching for a valid schedule. In this thesis, an offline non-preemptive scheduling method is presented, designed for single core systems. The scheduling problem is defined and formulated utilizing Constraint Programming. In addition, to ensure that end-to-end timing requirements are met, job-level dependencies are considered during the schedule generation. Utilizing this approach can guarantee that individual task periods along with end-to-end timing requirements are always met, if a schedule exists. The results show a good increase in schedulability ratio when utilizing job-level dependencies compared to the case where job-level dependencies are not specified. When the system utilization increases this improvement is even greater. Depending on the system size and complexity the improvement can vary, but in many cases it is more than double. The scheduling generation is also performed within a reasonable time frame. This would be a good benefit during the development process of a system, since it allows fast verification when changes are made to the system. Further, the thesis provide an overview of the entire process, starting from a system model and ending at a fully functional schedule executing on a hardware platform.
APA, Harvard, Vancouver, ISO, and other styles
5

Li, Ruogu. "Principles and Methods of Adaptive Network Algorithm Design under Various Quality-of-Service Requirements." The Ohio State University, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=osu1354642003.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Horák, Michael. "Určení polohy stanic v síti Internet pomocí přenosového zpoždění." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2013. http://www.nusl.cz/ntk/nusl-220305.

Full text
Abstract:
This thesis covers the topic of determination of geographical location of a host in internet network while utilizing measurement of the end to end delay and implementation of Constraint-Based Geolocation. Gradually I go through issue of the delay in computer networks and ways how to measure it. Next chapter describes a few ways to geolocate host in internet network with emphasis on the CBG method. Another chapter is dedicated to describing a way to project spherical coordinates to the two dimensional space, which has been used in implementation of geolocation method. Chapter about implementation builds upon the facts given in previous chapters while functions of the program written in the JAVA programing language are being explained. Two similar geolocation methods were implemented. By comparing the results gained by implementation, new method of geolocation is proposed and devised. It combines properities of both previous methods. There are results of the implemented methods and their comparation to the one of the source documents used in creation of this thesis in summary section.
APA, Harvard, Vancouver, ISO, and other styles
7

Nikbakht, Homa. "Networks with mixed-delay constraints." Electronic Thesis or Diss., Institut polytechnique de Paris, 2020. http://www.theses.fr/2020IPPAT046.

Full text
Abstract:
Les réseaux de communication sans fil modernes doivent s'adapter à différents types de trafic de données avec des contraintes de latence différentes. Les applications vidéo sensibles à la latence, en particulier, représentent une part croissante du trafic de données. En outre, les réseaux modernes doivent accepter des débits de données élevés, ce qu'ils peuvent faire par exemple avec des terminaux coopératifs ou avec l'assistance de relais tels que les drones. Cependant, la coopération introduit généralement des retards de communication supplémentaires et n'est donc pas applicable au trafic de données sensibles à la latence.Cette thèse porte sur les réseaux d'interférence avec des contraintes de latence mixtes et sur les architectures de systèmes où des émetteurs et/ou des récepteurs voisins peuvent coopérer. Dans de tels systèmes, les messages sensibles à la latence doivent être encodés et décodés sans délai et ainsi ne peuvent pas bénéficier des liens de coopération disponibles. Nous proposons différents schémas de codage pour permettre la transmission simultanée de messages sensibles et insensibles à la latence. Pour les schémas proposés, nous analysons les gains de multiplexage (MG) qu'ils réalisent sur le réseau de transfert intercellulaire souple de Wyner, le réseau symétrique de Wyner, le réseau hexagonal et le réseau hexagonal sectorisé. Pour le réseau de transfert souple de Wyner et le réseau symétrique de Wyner, nous identifions aussi des résultats étroits s'agissant de leurs limites en théorie de l'information et nous définissons ainsi l'ensemble exact de paires MG qui peuvent être obtenus simultanément pour les données sensibles et insensibles à la latence. Ces résultats montrent que lorsque les émetteurs et les récepteurs peuvent coopérer et que les taux de coopération sont suffisamment élevés, il est possible d'obtenir le plus grand MG possible pour les messages sensibles à la latence sans pénaliser la somme maximale des MG pour l'ensemble des messages sensibles et insensibles à la latence. Cependant, la somme des MG des systèmes que nous proposons pour le modèle hexagonal est diminuée en présence de données sensibles à la latence. Cette pénalité disparaît dans le cas du réseau hexagonal sectorisé quand chaque cellule est divisée en trois secteurs non interférents en équipant les stations de base d'antennes directionnelles.Nous proposons, de surcroît, des schémas de codage similaires en fonction de différents types d'activité aléatoire de la part des usagers du réseau. Nous considérons plus particulièrement deux configurations. Dans la première configuration, l'augmentation du taux de MG correspondant aux données sensibles à la latence diminue toujours la somme des MG. En revanche, dans la seconde configuration, pour certains paramètres, la plus grande somme des MG est obtenue au maximum du taux de MG correspondant aux données sensibles à la latence et donc l'augmentation des MG sensibles à la latence améliore la somme des MG.Nous étudions aussi un réseau d'accès radio "cloud" avec des contraintes de latence mixtes, c'est-à-dire où chaque utilisateur mobile peut simultanément envoyer un flux sensible à la latence et un flux qui la tolère et où seules les données sensibles sont décodées conjointement au sein du cloud. Pour ce réseau, nous dérivons les limites intérieures et extérieures de la région de capacité sous des contraintes de latence mixtes, et nous caractérisons précisément la région MG optimale. Lorsque le rapport signal/bruit (SNR) est élevé, nos résultats démontrent que, pour des capacités frontales modérées, le MG maximal pour les messages sensibles à la latence reste inchangé sur une large gamme de petits et moyens MG de messages sensibles à la latence. Pour un SNR modéré, les résultats montrent que lorsque le débit de messages sensibles à la latence est faible ou modéré, nous obtenons une somme de débit de données constante<br>Modern wireless communication networks have to accommodate different types of data traffic with different latency constraints. In particular, delay-sensitive video-applications represent an increasing portion of data traffic. Modern networks also have to accommodate high total data rates, which they can accomplish for example with cooperating terminals or with helper relays such as drones. However, cooperation typically introduces additional communication delays, and is thus not applicable to delay-sensitive data traffic.This thesis focuses on interference networks with mixed-delay constraints and on system architectures where neighbouring transmitters and/or neighbouring receivers can cooperate. In such systems, delay-sensitive messages have to be encoded and decoded without further delay and thus cannot benefit from available cooperation links.We propose various coding schemes that can simultaneously accommodate the transmission of both delay-sensitive and delay-tolerant messages. For the proposed schemes we analyze the multiplexing gains (MG) they achieve over Wyner's soft hand-off network, Wyner's symmetric network, the hexagonal network and the sectorized hexagonal network. For Wyner's soft hand-off network and Wyner's symmetric network, we also provide tight information-theoretic converse results and thus establish the exact set of MG pairs that can simultaneously be achieved for delay-sensitive and delay-tolerant data. These results demonstrate that when both transmitters and receivers cooperate and the cooperation rates are sufficiently large, it is possible to achieve the largest MG for delay-sensitive messages without penalizing the maximum sum MG of both delay-sensitive and delay-tolerant messages. In contrast, under our proposed schemes, the sending of delay-sensitive data in hexagonal models decreases the maximum sum MG. This penalty vanishes when we consider the sectorized hexagonal network where each cell is divided into three non-interfering sectors by employing directional antennas at the base stations.We further propose similar coding schemes for scenarios with different types of random user activity. We specifically consider two setups. In the first setup, each active transmitter always has delay-tolerant data to send and delay-sensitive data arrival is random. In the second setup, both delay-tolerant and delay-sensitive data arrivals are random. The obtained MG regions show that in the first setup, increasing the delay-sensitive MG always decreases the sum MG. In contrast, in the second setup, for certain parameters, the highest sum MG is achieved at maximum delay-sensitive MG and thus increasing the delay-sensitive MG provides a gain in sum MG.Additionally, we also study a cloud radio access network with mixed delay constraints, i.e., where each mobile user can simultaneously send a delay-sensitive and a delay-tolerant stream and only the delay-tolerant data is jointly decoded at the cloud unit. For this network, we derive inner and outer bounds on the capacity region under mixed delay constraints, and we exactly characterize the optimal MG region. At high signal-to-noise ratio (SNR), our results show that for moderate fronthaul capacities, the maximum MG for delay-sensitive messages remains unchanged over a large regime of small and moderate MGs of delay-sensitive messages. The sum MG is thus improved if some of the messages can directly be decoded at the base stations. At moderate SNR, the results show that when the data rate of delay-sensitive messages is small or moderate, the achievable sum rate is constant
APA, Harvard, Vancouver, ISO, and other styles
8

Lombardi, Warody. "Constrained control for time-delay systems." Phd thesis, Supélec, 2011. http://tel.archives-ouvertes.fr/tel-00631507.

Full text
Abstract:
The main interest of the present thesis is the constrained control of time-delay system, more specifically taking into consideration the discretization problem (due to, for example, a communication network) and the presence of constraints in the system's trajectories and control inputs. The effects of data-sampling and modeling problem are studied in detail, where an uncertainty is added into the system due to additional effect of the discretization and delay. The delay variation with respect to the sampling instants is characterized by a polytopic supra-approximation of the discretization/delay induced uncertainty. Some stabilizing techniques, based on Lyapunov's theory, are then derived for the unconstrained case. Lyapunov-Krasovskii candidates were also used to obtain LMI conditions for a state feedback, in the ''original" state-space of the system. For the constrained control purposes, the set invariance theory is used intensively, in order to obtain a region where the system is ''well-behaviored", despite the presence of constraints and (time-varying) delay. Due to the high complexity of the maximal delayed state admissible set obtained in the augmented state-space approach, in the present manuscript we proposed the concept of set invariance in the ''original" state-space of the system, called D-invariance. Finally, in the las part of the thesis, the MPC scheme is presented, in order to take into account the constraints and the optimality of the control solution.
APA, Harvard, Vancouver, ISO, and other styles
9

Ward, Tyler. "Delay tolerance for constrained IPv6 networks." Thesis, University of Southampton, 2017. https://eprints.soton.ac.uk/411270/.

Full text
Abstract:
Low power sensor networks have traditionally been regarded as not having the capabilities required to connect them to the internet. New research into the Internet of Things has challenged this concept and is opening up new possibilities for sensor network capabilities. Environmental sensor networks are just one of the areas which will greatly benefit from this connectivity improvement. However, there are many challenges to be solved in order to make full and ecient use of these advancements. One of the major challenges which has been identied is the lack of connectivity when sensors are in low power sleep states. Previous solutions for low power devices have relied on application layer gateways to proxy communications to the sensors, but this restricts the exibility of the network as it is limited to the capabilities of the proxy. Delay Tolerant Networking (DTN) oers a solution to this problem by allowing sensors to respond and handle communications at their convenience. This thesis presents and evaluates a novel method and implementation of Delay Tolerant Networking using IPv6 extension headers. The proposed DTN extension header is found to have a signicantly lower packet size overhead than other DTN protocols. In addition, the protocol and systems to support it are entirely backwards and forwards compatible with the existing internet infrastructure allowing for it to be incorporated into existing deployments. The developed protocol forms a new state of the art for DTN on constrained sensor networks using end to end IP connectivity. Using this, a new range of low power IoT devices can be developed, featuring long battery lives and reliable connectivity.
APA, Harvard, Vancouver, ISO, and other styles
10

Chen, J. "Resource allocation for delay constrained wireless communications." Thesis, University College London (University of London), 2010. http://discovery.ucl.ac.uk/19637/.

Full text
Abstract:
The ultimate goal of future generation wireless communications is to provide ubiquitous seamless connections between mobile terminals such as mobile phones and computers so that users can enjoy high-quality services at anytime anywhere without wires. The feature to provide a wide range of delay constrained applications with diverse quality of service (QoS) requirements, such as delay and data rate requirements, will require QoS-driven wireless resource allocation mechanisms to efficiently allocate wireless resources, such as transmission power, time slots and spectrum, for accommodating heterogeneous mobile data. In addition, multiple-input-multiple-output (MIMO) antenna technique, which uses multiple antennas at the transmitter and receiver, can improve the transmission data rate significantly and is of particular interests for future high speed wireless communications. In the thesis, we develop smart energy efficient scheduling algorithms for delay constrained communications for single user and multi-user single-input-single-output (SISO) and MIMO transmission systems. Specifically, the algorithms are designed to minimize the total transmission power while satisfying individual user’s QoS constraints, such as rate, delay and rate or delay violation. Statistical channel information (SCI) and instantaneous channel state information (CSI) at the transmitter side are considered respectively, and the proposed design can be applied for either uplink or downlink. We propose to jointly deal with scheduling of the users that access to the channel for each frame time (or available spectrum) and how much power is allocated when accessing to the channel. In addition, the algorithms are applied with modifications for uplink scheduling in IEEE 802.16 Worldwide Interoperability for Microwave Access (WiMAX). The success of the proposed research will significantly improve the ways to design wireless resource allocation for delay constrained communications.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Delay constraint"

1

Valmorbida, Giorgio, Wim Michiels, and Pierdomenico Pepe, eds. Accounting for Constraints in Delay Systems. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-89014-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Lee, Hyung Jin. Distributed delay-constrained minimum cost multicasting. National Library of Canada, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Le-Ngoc, Tho, and Khoa Tran Phan. Radio Resource Allocation Over Fading Channels Under Statistical Delay Constraints. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-57693-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Altshuller, Dmitry. Frequency Domain Criteria for Absolute Stability: A Delay-integral-quadratic Constraints Approach. Springer London, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Gabriel, William F. Constrained beamspace sidelobe canceller (SLC) with a tapped delay line in each beam. Naval Research Laboratory, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Christofides, Panagiotis D. Control of nonlinear and hybrid process systems: Designs for uncertainty, constraints and time-delays. Springer, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Christofides, Panagiotis D. Control of nonlinear and hybrid process systems: Designs for uncertainty, constraints and time-delays. Springer, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

H, El-Farra Nael, ed. Control of nonlinear and hybrid process systems: Designs for uncertainty, constraints and time-delays. Springer, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Michiels, Wim, Giorgio Valmorbida, and Pierdomenico Pepe. Accounting for Constraints in Delay Systems. Springer International Publishing AG, 2021.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Accounting for Constraints in Delay Systems. Springer International Publishing AG, 2023.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Delay constraint"

1

Petrini, Matteo. "Testing of Delay Lines Breaking Bandwidth-Delay Constraint." In Synthesis Lectures on Digital Circuits & Systems. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-60811-7_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Verle, A., X. Michel, P. Maurine, N. Azémard, and D. Auvergne. "CMOS Gate Sizing under Delay Constraint." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-39762-5_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Shu, Feng, and Jiangzhou Wang. "IRS-Aided Covert Wireless Communications with Delay Constraint." In Wireless Networks. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-41812-9_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Zhou, Neng-Fa. "Channel Routing with Constraint Logic Programming and Delay." In Industrial and Engineering Applications of Artificial Intelligence and Expert Systems. CRC Press, 2022. http://dx.doi.org/10.1201/9780429332111-66.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Zhang, Xiwen. "The Influence of Partial Constraint on Delay at Priority Junctions." In Intersections without Traffic Signals. Springer Berlin Heidelberg, 1988. http://dx.doi.org/10.1007/978-3-642-83373-1_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Huynh, Trong-Thua, Bui Cong Giao, Cong-Hung Tran, and Anh-Vu Dinh-Duc. "Optimizing Energy Consumption with Delay Constraint in Wireless Sensor Networks." In Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-46909-6_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Chen, Wenping, Si Chen, and Deying Li. "Minimum-Delay POIs Coverage under Obstacle-Constraint in Emergency Management." In Web-Age Information Management. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-39527-7_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Liu, Jingyong, Lemin Li, and Bo Li. "Network Capacity of Wireless Ad Hoc Networks with Delay Constraint." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11599463_45.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Sun, Haifeng, Jun Wang, Haixia Peng, Lili Song, and Mingwei Qin. "Delay Constraint Energy Efficient Cooperative Offloading in MEC for IoT." In Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-67537-0_40.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Ren, Lili, Qingshan Wang, Shasha Fu, and Yanping Liu. "Energy Efficient Multicast Routing with Delay Constraint in Bus-Based DTNs." In Advanced Technologies in Ad Hoc and Sensor Networks. Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-642-54174-2_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Delay constraint"

1

Zhou, Lingfeng, Shanlin Xiao, Huiyao Wang, et al. "An Efficient Asynchronous Circuits Design Flow with Backward Delay Propagation Constraint." In 2024 Design, Automation & Test in Europe Conference & Exhibition (DATE). IEEE, 2024. http://dx.doi.org/10.23919/date58400.2024.10546503.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Abel, Imoleayo, Mrdjan Janković, and Miroslav Krstić. "Constrained Control of Input Delayed Systems With Partially Compensated Input Delays." In ASME 2020 Dynamic Systems and Control Conference. American Society of Mechanical Engineers, 2020. http://dx.doi.org/10.1115/dscc2020-3271.

Full text
Abstract:
Abstract Control Barrier Functions (CBFs) have become popular for enforcing — via barrier constraints — the safe operation of nonlinear systems within an admissible set. For systems with input delay(s) of the same length, constrained control has been achieved by combining a CBF for the delay free system with a state predictor that compensates the single input delay. Recently, this approach was extended to multi input systems with input delays of different lengths. One limitation of this extension is that barrier constraint adherence can only be guaranteed after the longest input delay has been compensated and all input channels become available for control. In this paper, we consider the problem of enforcing constraint adherence when only a subset of input delays have been compensated. In particular, we propose a new barrier constraint formulation that ensures that when possible, a subset of input channels with shorter delays will be utilized for keeping the system in the admissible set even before longer input delays have been compensated. We include a numerical example to demonstrate the effectiveness of the proposed approach.
APA, Harvard, Vancouver, ISO, and other styles
3

Wang, Qi, Qingshan Wang, and Da Liu. "Delay constraint encoding algorithm in MANETs." In 2012 IEEE International Conference on Computer Science and Automation Engineering (CSAE). IEEE, 2012. http://dx.doi.org/10.1109/csae.2012.6272798.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Shafieirad, Hossein, and Raviraj S. Adve. "On Meeting a Maximum Delay Constraint." In GLOBECOM 2021 - 2021 IEEE Global Communications Conference. IEEE, 2021. http://dx.doi.org/10.1109/globecom46510.2021.9685672.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Azemard, Nadine, Michel Aline, and Daniel Auvergne. "Delay-bound determination for path constraint satisfaction." In International Symposium on Microelectronics and Assembly, edited by Bernard Courtois, Serge N. Demidenko, and Lee Y. Lau. SPIE, 2000. http://dx.doi.org/10.1117/12.405403.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Lin, Yuda, Liang Jin, Kaizhi Huang, Feihu Wang, and Jinmei Yang. "Multi-Antenna Covert Communications with Delay Constraint." In 2021 IEEE 94th Vehicular Technology Conference (VTC2021-Fall). IEEE, 2021. http://dx.doi.org/10.1109/vtc2021-fall52928.2021.9625207.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Heid, Sefan, Arunselvan Ramaswamy, and Eyke Hüllermeier. "Constrained Multi-Agent Optimization with Unbounded Information Delay." In 30. Workshop Computational Intelligence. KIT Scientific Publishing, 2020. http://dx.doi.org/10.58895/ksp/1000124139-15.

Full text
Abstract:
A multi-agent system (MAS) consists of a group of agents that solve a common task through cooperation. Many problems arising in this setting can be formulated as distributed constrained optimization. In recent work, we considered the unconstrained version of the problem. In particular, we developed a theory to understand distributed gradient-based optimization methods, wherein the local (state) information is communicated via a lossy wireless network. A key contribution of the theory is that the information delay could be unbounded, however, it does not consider constraints. In this work, we present preliminary experimental results aimed towards extending the aforementioned work to the constrained setting. First, the constrained optimization problem is transformed into an unconstrained one using the penalty-based method. Then, we employ the distributed gradient approach from our previous work to solve the unconstrained optimization in a decentralized manner. The illustrative experiments are based on autonomous pattern formation tasks for robotic swarms. The (simulated) robots cooperate to form a specified pattern (line, circle), with the constraint that the distances between neighboring robots equal a given constant.
APA, Harvard, Vancouver, ISO, and other styles
8

Abbas, Ali, Babar Shah, Feras Al-Obeidat, and Farkhund Iqbal. "Bounded message delay with threshold time constraint in delay tolerant networks (DTNs)." In 2016 3rd MEC International Conference on Big Data and Smart City (ICBDSC). IEEE, 2016. http://dx.doi.org/10.1109/icbdsc.2016.7460368.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Soret, Beatriz, M. Carmen Aguayo-Torres, and J. Tomas Entrambasaguas. "Capacity with Probabilistic Delay Constraint for Rayleigh Channels." In IEEE GLOBECOM 2007-2007 IEEE Global Telecommunications Conference. IEEE, 2007. http://dx.doi.org/10.1109/glocom.2007.628.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Cohen, Reuven, and Adrian Segall. "Distributed priority algorithms under one-bit-delay constraint." In the eleventh annual ACM symposium. ACM Press, 1992. http://dx.doi.org/10.1145/135419.135422.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Delay constraint"

1

Tan, Sheu-Sheu, Dong Zheng, Junsham Zhang, and James Zeidler. Distributed Opportunistic Scheduling For Ad-Hoc Communications Under Delay Constraint. Defense Technical Information Center, 2010. http://dx.doi.org/10.21236/ada515840.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Chazel, Simon, Sophie Bernard, and Hassan Benchekroun. Energy transition under mineral constraints and recycling: A low-carbon supply peak. CIRANO, 2023. http://dx.doi.org/10.54932/ezhr6690.

Full text
Abstract:
What are the implications of primary mineral constraints for the energy transition? Low-carbon energy production uses green capital, which requires primary minerals. We build on the seminal framework for the transition from a dirty to a clean energy in Golosov et al. (2014) to incorporate the role played by primary minerals and their potential recycling. We characterize the optimal paths of the energy transition under various mineral constraint scenarios. Mineral constraints limit the development of green energy in the long run: low-carbon energy production eventually reaches a plateau. We run our simulations using copper as the limiting mineral and we allow for its full recycling. Even in the limiting case of a 100% recycling rate, after five to six decades green energy production is 50% lower than in the scenario with unlimited primary copper, and after 30 decades, GDP is 3–8% lower. In extension scenarios, we confirm that a longer life duration of green capital delays copper extraction and the green energy peak, whereas reduced recycling caps moves the peak in green energy production forward.
APA, Harvard, Vancouver, ISO, and other styles
3

Arnowitt, R., and P. Nath. Supergravity grand unification, proton decay and cosmological constraints. Office of Scientific and Technical Information (OSTI), 1995. http://dx.doi.org/10.2172/102325.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Hvozdyk, Lyudmyla, and Valerie Mercer-Blackman. What Determines Investment in the Oil Sector?: A New Era for National and International Oil Companies. Inter-American Development Bank, 2010. http://dx.doi.org/10.18235/0011114.

Full text
Abstract:
This paper discusses recent trends in investment in the oil sector, amid new challenges for national and international oil companies in an increasingly supply-constrained environment. After more than a decade of stagnant investment rates, nominal investment has picked up sharply over the three years ending in 2007, but soaring costs (including from higher tax rates and royalties) meant that investment growth was minimal in real terms. The paper performs econometric tests using the Arellano-Bond GMM technique. It finds that `below ground¿ risks are statistically very important in deterring real investment. Companies are taking on increasingly complex geological challenges, which are putting upward pressure on production costs and are leading to greater project delays compared to the past. As many of these factors are expected to persist, supply constraints are likely to remain a dominant factor behind oil price fluctuations during the next several years.
APA, Harvard, Vancouver, ISO, and other styles
5

Aubert, B. Study of the Decay B0 (anti-B0) ->rho+rho- and Constraints on the CKM Angle Alpha. Office of Scientific and Technical Information (OSTI), 2004. http://dx.doi.org/10.2172/826858.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

S. Luo, T.L. Ku, V. Todd, et al. IN-SITU RADIONUCLIDE TRANSPORT NEAR THE NOPAL I URANIUM DEPOSIT AT PENA BLANCA, MEXICO: CONSTRAINTS FROM SHORT-LIVED DECAY-SERIES RADIONUCLIDES. Office of Scientific and Technical Information (OSTI), 2005. http://dx.doi.org/10.2172/859189.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Eggers Prieto, Carlos, Lucia Martin Rivero, Laucel Muñoz, and Álvaro Salamanca. Nowcasting Poverty in Central America, Panama, and the Dominican Republic: A Micro-simulation Approach. Inter-American Development Bank, 2024. http://dx.doi.org/10.18235/0012890.

Full text
Abstract:
Assessing the development of countries relies on poverty rates as a key indicator. However, official poverty rates are derived from household surveys that often have limited frequency, unexpected gaps due to field work constraints, and substantial delays in processing and publication. This paper presents a novel micro-simulation method for estimating poverty, which introduces changes in demographic and labor variables into the surveys, that can be derived from just a few observed or forecasted macroeconomic indicators. We apply this method for the case of Central America, Panama, and the Dominican Republic (CAPDR) and show that it outperforms the fit of other methods that solely rely on direct imputations from GDP to households income. Lastly, our approach can be easily replicated across countries and in different time periods, which is not the case for the majority of other micro-simulation techniques.
APA, Harvard, Vancouver, ISO, and other styles
8

Mohammadian, Abolfazl, Mohammad Miralinaghi, Alireza Talebpour, Sajad Askari, and Sanaz Kazemzadehazad. State Department of Transportation Support for Operationalizing Transit Signal Priority. Illinois Center for Transportation, 2025. https://doi.org/10.36501/0197-9191/25-005.

Full text
Abstract:
Transit signal priority (TSP) systems have become an integral part of regional intelligent transportation systems integration. They modify signal operations to facilitate faster transit through intersections, improve transit service reliability, reduce delays, and enhance overall transit operational efficiency. Agencies are planning and implementing next-generation TSP systems. However, multifaceted challenges complicate TSP implementation, particularly in urban regions with high traffic density and multiple stakeholders. Exploring these challenges can help develop more efficient deployment strategies and improve system performance. This study’s researchers, therefore, examined TSP implementation challenges in the metropolitan Chicago area and interviewed stakeholders and experts from Illinois and other states to identify successes and obstacles in TSP deployment. They applied a thematic analysis and a non-negative matrix factorization method to identify key barriers. To prioritize these challenges, they developed a survey using the fuzzy analytic hierarchy process framework and had experts directly involved in TSP operations in the Chicago region participate in this survey. Study findings indicated that organizational factors—such as interagency coordination issues and labor shortages—are significant challenges. Regulatory and policy constraints, including the absence of standardized regional guidelines and concerns over equipment compatibility, further hinder TSP deployment. Financial constraints, particularly the reliance on fragmented funding sources, create uncertainty in project execution. Technological limitations, such as integration difficulties with legacy traffic control systems and the high costs of infrastructure upgrades, also impede implementation.
APA, Harvard, Vancouver, ISO, and other styles
9

Chioda, Laura, Paul Gertler, and Nicole Perales. Empowering Women: Teaching Leadership Skills to Youth in Uganda. Centre for Excellence and Development Impact and Learning (CEDIL), 2023. http://dx.doi.org/10.51744/crpp10.

Full text
Abstract:
Empowering adolescent girls through education has become a priority among numerous stakeholder. However, recent evidence suggests that education alone may not be suffcient if women remain in a low-empowerment equilibrium and face internal constraints as they relate to aspirations, self-efficacy, leadership, and other life (soft) skills. We study the long-term impacts of a school-based upper-secondary intervention, the Educate! Experience, designed to enhance adolescents’ leadership and social entrepreneurship skills in Uganda. The program was implemented as a cluster randomized controlled trial (RCT) in 48 schools. Four years post-intervention, we document lasting impacts on a wide array of leadership and soft skills. Overall, Educate! graduates developed skills that are traditionally associated with greater focus on long-term goals; they reported being more in control of aspects of their lives (self-efficacy and grit) and more empowered to implement actions towards their plans. Young women in the treatment group are also more likely to complete secondary education, delay family formation, enroll in tertiary education, and pursue STEM and Business majors relative to their counterparts in the control group. The program yielded socially desirable and gender relevant spillovers, including expansions in women’s agency. Both male and female Educate! graduates embraced more progressive views concerning women’s standing in the society and women’s ability to exercise their agency to engage in the labor market and refuse sex. The incidence of intimate partner violence (IPV) also improved among Educate! graduates, as did their attitudes toward IPV social acceptability.
APA, Harvard, Vancouver, ISO, and other styles
10

Dedeken, Chiara, and Kevin Osborne. Repatriating FTFs from Syria: Learning from the Western Balkans. RESOLVE Network, 2021. http://dx.doi.org/10.37805/pn2021.23.wb.

Full text
Abstract:
Four countries in the Western Balkan region (Kosovo, Bosnia and Herzegovina, North Macedonia, and Montenegro) are in the top ten countries with the most foreign terrorist fighters (FTFs) per capita. The political will to repatriate FTFs remains strong, at least in the Western Balkans, despite delays in 2020 due to COVID-19. In other parts of the world, especially high-income countries, political will to repatriate is considerably lower. COVID-19 has further constrained nations in their efforts to repatriate law-abiding citizens, which is less controversial than FTF families. Based on discussions with government officials and security officers in the Western Balkans as well as international experts and donors, this policy note provides operational recommendations to move forward with repatriation, rehabilitation, and reintegration of returnees building on lessons from repatriations in Albania, Kosovo, and North Macedonia. It urges governments globally to double down on repatriation efforts and to call on experience from governments in the Balkans to bring back their FTFs now. The recommendations in this policy note are relevant to any country where political will to repatriate FTFs can be generated.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Delay constraint' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography