951 resultados para Arbitrary detention
Resumo:
Massive multiple-input multiple-output (MIMO) systems are cellular networks where the base stations (BSs) are equipped with unconventionally many antennas, deployed on colocated or distributed arrays. Huge spatial degrees-of-freedom are achieved by coherent processing over these massive arrays, which provide strong signal gains, resilience to imperfect channel knowledge, and low interference. This comes at the price of more infrastructure; the hardware cost and circuit power consumption scale linearly/affinely with the number of BS antennas N. Hence, the key to cost-efficient deployment of large arrays is low-cost antenna branches with low circuit power, in contrast to today’s conventional expensive and power-hungry BS antenna branches. Such low-cost transceivers are prone to hardware imperfections, but it has been conjectured that the huge degrees-of-freedom would bring robustness to such imperfections. We prove this claim for a generalized uplink system with multiplicative phasedrifts, additive distortion noise, and noise amplification. Specifically, we derive closed-form expressions for the user rates and a scaling law that shows how fast the hardware imperfections can increase with N while maintaining high rates. The connection between this scaling law and the power consumption of different transceiver circuits is rigorously exemplified. This reveals that one can make the circuit power increase as p N, instead of linearly, by careful circuit-aware system design.
Resumo:
There is extensive theoretical work on measures of inconsistency for arbitrary formulae in knowledge bases. Many of these are defined in terms of the set of minimal inconsistent subsets (MISes) of the base. However, few have been implemented or experimentally evaluated to support their viability, since computing all MISes is intractable in the worst case. Fortunately, recent work on a related problem of minimal unsatisfiable sets of clauses (MUSes) offers a viable solution in many cases. In this paper, we begin by drawing connections between MISes and MUSes through algorithms based on a MUS generalization approach and a new optimized MUS transformation approach to finding MISes. We implement these algorithms, along with a selection of existing measures for flat and stratified knowledge bases, in a tool called mimus. We then carry out an extensive experimental evaluation of mimus using randomly generated arbitrary knowledge bases. We conclude that these measures are viable for many large and complex random instances. Moreover, they represent a practical and intuitive tool for inconsistency handling.
Resumo:
The statistical properties of the multivariate GammaGamma (ΓΓ) distribution with arbitrary correlation have remained unknown. In this paper, we provide analytical expressions for the joint probability density function (PDF), cumulative distribution function (CDF) and moment generation function of the multivariate ΓΓ distribution with arbitrary correlation. Furthermore, we present novel approximating expressions for the PDF and CDF of the su m of ΓΓ random variables with arbitrary correlation. Based on this statistical analysis, we investigate the performance of radio frequency and optical wireless communication systems. It is noteworthy that the presented expressions include several previous results in the literature as special cases.
Resumo:
A RkNN query returns all objects whose nearest k neighbors
contain the query object. In this paper, we consider RkNN
query processing in the case where the distances between
attribute values are not necessarily metric. Dissimilarities
between objects could then be a monotonic aggregate of dissimilarities
between their values, such aggregation functions
being specified at query time. We outline real world cases
that motivate RkNN processing in such scenarios. We consider
the AL-Tree index and its applicability in RkNN query
processing. We develop an approach that exploits the group
level reasoning enabled by the AL-Tree in RkNN processing.
We evaluate our approach against a Naive approach
that performs sequential scans on contiguous data and an
improved block-based approach that we provide. We use
real-world datasets and synthetic data with varying characteristics
for our experiments. This extensive empirical
evaluation shows that our approach is better than existing
methods in terms of computational and disk access costs,
leading to significantly better response times.
Resumo:
A new algorithm is proposed for scheduling preemptible arbitrary-deadline sporadic task systems upon multiprocessor platforms, with interprocessor migration permitted. This algorithm is based on a task-splitting approach - while most tasks are entirely assigned to specific processors, a few tasks (fewer than the number of processors) may be split across two processors. This algorithm can be used for two distinct purposes: for actually scheduling specific sporadic task systems, and for feasibility analysis. Simulation- based evaluation indicates that this algorithm offers a significant improvement on the ability to schedule arbitrary- deadline sporadic task systems as compared to the contemporary state-of-art. With regard to feasibility analysis, the new algorithm is proved to offer superior performance guarantees in comparison to prior feasibility tests.
Resumo:
RESUMO: OS distúrbios mentais, neurológicos e devidos ao abuso de substâncias tem uma grande prevalência e peso em todo o Mundo. O objetivo principal deste estudo é contribuir para a melhoria dos direitos humanos das pessoas com deficiências mentais na Gâmbia, através de uma revisão e análise críticas de uma obsoleta legislação de saúde mental do País o "Lunatic Act Detention (LDA) de 1917".----- ABSTRACT: Mental, neurological, and substance use disorders are highly prevalente and burdensome worlwide. The violations of human rights directed towards people with this disorders compound the problam. This study mainly aims to contribute do the improvement of human rights of people with mental disabilities in Gambia by doing a critical review and analysis to the countries outdated mental health legislation - Lunatic Detention ct (LDA) from 1917.
Resumo:
The rationalizability of a choice function on arbitrary domains by means of a transitive relation has been analyzed thoroughly in the literature. Moreover, characterizations of various versions of consistent rationalizability have appeared in recent contributions. However, not much seems to be known when the coherence property of quasi-transitivity or that of P-acyclicity is imposed on a rationalization. The purpose of this paper is to fill this significant gap. We provide characterizations of all forms of rationalizability involving quasi-transitive or P-acyclical rationalizations on arbitrary domains.
Resumo:
Les agents des services correctionnels sont appelés à travailler et à intervenir quotidiennement auprès des individus incarcérés et se trouvent au cœur du fonctionnement des établissements de détention provinciaux du Québec. Leurs pratiques disciplinaires envers les individus incarcérés étaient auparavant considérées comme arbitraires et prenaient place dans un milieu défini comme autonome, autosuffisant, fermé sur l’extérieur et ne nécessitant pas le support de la société (Goffman, 1961). Les dernières décennies ont apporté de nombreux changements, tels la reconnaissance des droits des individus incarcérés, l’ouverture du milieu carcéral sur la société ou encore la normalisation des conditions de détention. A ceux-ci se sont ajoutés la Loi sur le système correctionnel du Québec et son Règlement d’application qui vient régir le processus disciplinaire. L’objet de cette recherche vise la compréhension des pratiques des agents correctionnels en matière de poursuites disciplinaires suite à ces changements. Cette étude vise également à comprendre les éléments venant influencer la décision, par un agent correctionnel, de dresser un rapport disciplinaire. Nos résultats se divisent en deux volets. Le premier suggère que le droit disciplinaire est une question d’équilibre carcéral. Les agents correctionnels, ayant la mission de maintenir la sécurité et l’ordre au sein du milieu carcéral, prennent également part à la mission de réinsertion sociale des individus incarcérés. Les agents doivent moduler leurs pratiques disciplinaires selon des éléments administratifs et institutionnels, tout en entretenant une relation avec les individus incarcérés basée sur la négociation et le marchandage. Le deuxième suggère que le droit disciplinaire est une question de pouvoir. En effet, malgré l’encadrement des établissements carcéraux par des textes légaux, les agents correctionnels détiennent un pouvoir discrétionnaire reconnu et accepté dans l’application de la discipline.
Resumo:
Cette thèse jette un œil sceptique sur plusieurs théories courantes de l’état d’urgence. La plupart de ces théories de l’état d’urgence présupposent que la notion d'une « urgence » est claire, conceptuellement et pratiquement. J'argue que ceci n'est pas le cas et que cette certitude mal placée produit des problèmes pratiques et conceptuels avec ses théories. De plus, cette thèse démontre que cette certitude mal placée dans la clarté du concept de l'urgence mène les autorités gouvernementales à agir arbitrairement plutôt que selon des principes libéraux et démocratiques pendant des états d’urgence. Contre cette certitude mal placée et contre plusieurs théories contemporaines influentes des états d'urgence, j'offre une théorie rigoureuse et analytique du concept de l’« urgence. » Une fois que le concept de l'urgence est défini, et que cette conception est défendue, la thèse démontre les diverses manières dont les malentendus du concept, mènent aux utilisations arbitraires (de la puissance monopole de l'état) en situation d’urgence. En considérant les états d’urgences, comme événements rares, la thèse évite la tentation de les considérer comme événements exceptionnels capable de fragmenter l'ordre politique établi (comme d’autres théories le font). La thèse argue que les mesures prises par le gouvernent pendant l’état d’urgence devraient être compatibles plus généralement avec les valeurs démocratiques et libérales. En rejetant l'idée que les états d'urgence sont des événements exceptionnels, la thèse crée un espace conceptuel dans lequel des propositions plus constructives concernant la gestion des états d'urgence peuvent être entendues. De plus, en analysant les diverses manières dont les autorités gouvernementales utilisent leur forces de façon arbitraire pendant les états d’urgence, la thèse argue clairement pour la supervision institutionnelle accrue en ce qui concerne les procédures d’urgence et leur déploiement pendant des états d'urgence. En conclusion, la thèse argue que les démocraties libérales n'ont pas besoin de craindre les états d’urgences tandis que les démocraties libérales ont déjà les ressources requise pour administrer les états d’urgence. Contrairement à ce que d’autres théories l’état d'urgence recommandent, les démocraties libérales ont déjà les ressources institutionnelles et conceptuelles pour administrer les états d’urgences.
Resumo:
Mesh generation is an important step inmany numerical methods.We present the “HierarchicalGraphMeshing” (HGM)method as a novel approach to mesh generation, based on algebraic graph theory.The HGM method can be used to systematically construct configurations exhibiting multiple hierarchies and complex symmetry characteristics. The hierarchical description of structures provided by the HGM method can be exploited to increase the efficiency of multiscale and multigrid methods. In this paper, the HGMmethod is employed for the systematic construction of super carbon nanotubes of arbitrary order, which present a pertinent example of structurally and geometrically complex, yet highly regular, structures. The HGMalgorithm is computationally efficient and exhibits good scaling characteristics. In particular, it scales linearly for super carbon nanotube structures and is working much faster than geometry-based methods employing neighborhood search algorithms. Its modular character makes it conducive to automatization. For the generation of a mesh, the information about the geometry of the structure in a given configuration is added in a way that relates geometric symmetries to structural symmetries. The intrinsically hierarchic description of the resulting mesh greatly reduces the effort of determining mesh hierarchies for multigrid and multiscale applications and helps to exploit symmetry-related methods in the mechanical analysis of complex structures.
Computing the continuous-spectrum linearised bounded standing wave on a plane bed of arbitrary slope