Log in

Relevant bibliographies by topics / Redundancy

Academic literature on the topic 'Redundancy'

Author: Grafiati

Published: 4 June 2021

Last updated: 29 July 2024

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

Select a source type:

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

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

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 "Redundancy"

1

Kanno, Yoshihiro, and Yakov Ben-Haim. "Redundancy and Robustness, or When Is Redundancy Redundant?" Journal of Structural Engineering 137, no. 9 (September 2011): 935–45. http://dx.doi.org/10.1061/(asce)st.1943-541x.0000416.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Barnard, Catherine. "Redundant approaches to redundancy." Cambridge Law Journal 59, no. 1 (March 2000): 36–39. http://dx.doi.org/10.1017/s000819730033001x.

Full text

Abstract:

THE apparently straightforward definition of redundancy contained in section 139 of the Employment Rights Act 1996 has generated a disproportionate and confused body of case law. In essence, redundancy pay is payable in three situations: the business disappears (s. 139(1)(a)(i)); the workplace disappears (s. 139(1)(a)(ii)); the job disappears (s. 139(1)(b)). As far as the disappearing workplace is concerned, recent cases have shown the courts taking a more pragmatic approach. The old contractual test laid down in UK Atomic Energy Authority v. Claydon [1974] I.C.R. 128 (where, by my contract, can I be required to work?) has been replaced by the geographic approach (where, in practice, do I work?): Bass Leisure Ltd v. Thomas [1994] I.R.L.R. 104 (E.A.T.) and High Table v. Horst [1997] I.R.L.R. 513 (C.A.). A similar pragmatism can be detected in the House of Lords' ruling in Murray v. Foyle Meats Ltd. [1999] I.R.L.R. 562 concerning the third aspect of the definition of redundancy, the disappearing job (s. 139(1)(b)).

APA, Harvard, Vancouver, ISO, and other styles

3

Harada, Takashi. "Mode changes of redundantly actuated asymmetric parallel mechanism." Proceedings of the Institution of Mechanical Engineers, Part C: Journal of Mechanical Engineering Science 230, no. 3 (May 26, 2015): 454–62. http://dx.doi.org/10.1177/0954406215588479.

Full text

Abstract:

A novel parallel mechanism which enlarges the workspace by singularity-free mode changes is proposed. The proposed mechanism has inherited the design of Linear DELTA, three translational degree-of-freedom and the moving plate driven by three linear actuators. In addition, the mechanism is extended by redundant actuation by four linear actuators and asymmetric design. New criterions about redundancy and singularity of redundantly actuated parallel mechanism using summation and product of determinants of minor matrices of the transposed Jacobian matrix are proposed. Redundant actuation and asymmetric design enables singularity-free mode changes with loss redundancy but maintains non-singularity, which is evaluated by the proposed criterions. Numerical simulations demonstrate the singularity-free mode changes of the proposed mechanism.

APA, Harvard, Vancouver, ISO, and other styles

4

Gitay, Habiba, J. Bastow Wilson, and William G. Lee. "Species Redundancy: A Redundant Concept?" Journal of Ecology 84, no. 1 (February 1996): 121. http://dx.doi.org/10.2307/2261706.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Cymek, D. H., S. Jahn, and D. H. Manzey. "Monitoring and Cross-Checking Automation." Proceedings of the Human Factors and Ergonomics Society Annual Meeting 60, no. 1 (September 2016): 143–47. http://dx.doi.org/10.1177/1541931213601033.

Full text

Abstract:

The present study addresses effects of human redundancy on automation monitoring and cross-checking. Thirty-six participants performed a multi-task, consisting of three subtasks that mimic basic work demands of operators in a control room of a chemical plant. One of the tasks was to monitor and cross-check a highly reliable and safety-critical automated process. Participants were randomly assigned to two groups: (1) “Non-redundant”: participants worked on all tasks alone as the only responsible operator. (2) “Redundant”: participants were informed that a second crewmate would work in parallel on the automation monitoring task and that they both were responsible for ensuring safe operation of the automation. Results provide evidence for social loafing effects in automation cross-checking. Participants working redundantly with another crewmate were found to cross-check the automation significantly less than participants, who were working alone. Even if the combined team performance of the participants working in the redundant condition was considered, the number of cross-checks did not significantly differ from the performance in the non-redundant condition. This result suggests that human redundancy can induce social loafing effects which fully compensate a possible reliability gain intended to be achieved by this measure. It challenges the often stated assumption that “four eyes see more than two” and shows that human redundancy does not necessarily lead to enhanced safety in automation monitoring.

APA, Harvard, Vancouver, ISO, and other styles

6

Liu, Lu, Xin Chen, and Dong Cao. "Research of Redundancy Management on Fight Control Computer for Unmanned Aerial Vehicle." Advanced Materials Research 383-390 (November 2011): 1573–77. http://dx.doi.org/10.4028/www.scientific.net/amr.383-390.1573.

Full text

Abstract:

Redundancy technology is very important to improve the reliability and fault tolerant of redundant flight control computer for unmanned aerial vehicle. The key technology is redundancy management strategies and methods. The redundancy management strategies and methods are researched based on hardware redundancy and software management for the sample redundant flight control computer The redundancy management strategies make full use of the advantages of distributed systems and the CAN bus transmission characteristics, and solve the problem of fault diagnosis and fault treatment and system reconfiguration. Results show that the strategies meet the design specifications of application requirements.

APA, Harvard, Vancouver, ISO, and other styles

7

Conkur, E. Sahin, and Rob Buckingham. "Clarifying the definition of redundancy as used in robotics." Robotica 15, no. 5 (September 1997): 583–86. http://dx.doi.org/10.1017/s0263574797000672.

Full text

Abstract:

Several descriptions of redundancy are presented in the literature, often from widely different perspectives. Therefore, a discussion of these various definitions and the salient points would be appropriate. In particular, any definition and redundancy needs to cover the following issues; the difference between multiple solutions and an infinite number of solutions; degenerate solutions to inverse kinematics; task redundancy; and the distinction between non-redundant, redundant and highly redundant manipulators.

APA, Harvard, Vancouver, ISO, and other styles

8

Wu, J., J.-S. Wang, L.-P. Wang, and T.-M. Li. "Dexterity and stiffness analysis of a three-degree-of-freedom planar parallel manipulator with actuation redundancy." Proceedings of the Institution of Mechanical Engineers, Part C: Journal of Mechanical Engineering Science 221, no. 8 (August 1, 2007): 961–69. http://dx.doi.org/10.1243/09544062jmes456.

Full text

Abstract:

The current paper deals with the dexterity and stiffness of a three-degree of freedom (DOF) planar parallel manipulator with actuation redundancy, which is a subpart of a four-DOF-hybrid machine tool. Based on the kinematics, the dexterity is analysed. The stiffness indices, which are the maximum deflection of the moving platform under the action of a unit force and the minimum eigenvalue of the stiffness matrix of the manipulator, are presented for investigating the stiffness. According to the minimum eigenvalue index, it is proved that actuation redundancy can improve the stiffness of the parallel manipulator. Moreover, the relationship between the singular configuration and the stiffness of the parallel manipulator is discussed. Compared with the corresponding non-redundant parallel manipulator without the redundant link, the redundantly actuated parallel manipulator has better dexterity and higher stiffness.

APA, Harvard, Vancouver, ISO, and other styles

9

Ma, Shugen, Shigeo Hirose, and Hiroshi Yoshinada. "Efficient Redundancy Control of Redundant Manipulators." Journal of the Robotics Society of Japan 14, no. 5 (1996): 703–9. http://dx.doi.org/10.7210/jrsj.14.703.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Potkonjak, Veljko. "Application of redundant robots to constrained-motion tasks." Robotica 10, no. 5 (September 1992): 397–407. http://dx.doi.org/10.1017/s0263574700010602.

Full text

Abstract:

SUMMARYThe problem of the constrained motion of robot end-effector is discussed. The redundant robot is considered, redundancy being added in order to improve robot working characteristics. In the phase of free motion towards the constraint the errors of basic non-redundant configuration are corrected by means of redundancy. During the constrained motion redundancy plays the role either of active or passive compliance. Between these two phases, the collision with the constraint occurs, and the impact can be absorbed by using redundancy.

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Redundancy"

1

Kabilafkas, D. "Natural redundancy and coding redundancy in information signals." Thesis, Imperial College London, 1989. http://hdl.handle.net/10044/1/47494.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Lewis, Paul. "The redundancy process and its implications for redundancy decision-making." Thesis, University of Leeds, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.288178.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Fernández, Gómez Manuel. "Binary Redundancy Elimination." Doctoral thesis, Universitat Politècnica de Catalunya, 2005. http://hdl.handle.net/10803/5985.

Full text

Abstract:

Dos de las limitaciones de rendimiento más importantes en los procesadores de hoy en día provienen de las operaciones de memoria y de las dependencias de control. Para resolver estos problemas, las memorias cache y los predictores de salto son dos alternativas hardware bien conocidas que explotan, entre otros factores, el reuso temporal de memoria y la correlación de saltos. En otras palabras, estas estructuras tratan de explotar la redundancia dinámica existente en los programas. Esta redundancia proviene parcialmente de la forma en que los programadores escriben código, pero también de limitaciones existentes en el modelo de compilación tradicional, lo cual introduce instrucciones de memoria y de salto innecesarias. Pensamos que los compiladores deberían ser muy agresivos optimizando programas, y por tanto ser capaces de eliminar una parte importante de esta redundancia.
Por otro lado, las optimizaciones aplicadas en tiempo de enlace o directamente al programa ejecutable final han recibido una atención creciente en los últimos años, debido a limitaciones existentes en el modelo de compilación tradicional. Incluso aplicando sofisticados análisis y transformaciones interprocedurales, un compilador tradicional no es capaz de optimizar un programa como una entidad completa. Un problema similar aparece aplicando técnicas de compilación dirigidas por profiling: grandes proyectos se ven forzados a recompilar todos y cada uno de sus módulos para aprovechar dicha información. Por el contrario, seria más conveniente construir la aplicación completa, instrumentarla para obtener información de profiling y optimizar entonces el binario final sin recompilar ni un solo fichero fuente.
En esta tesis presentamos nuevas técnicas de compilación dirigidas por profiling para eliminar la redundancia encontrada en programas ejecutables a nivel binario (esto es, redundancia binaria), incluso aunque estos programas hayan sido compilados agresivamente con un novísimo compilador comercial. Nuestras técnicas de eliminación de redundancia están diseñadas para eliminar operaciones de memoria y de salto redundantes, que son las más importantes para mitigar los problemas de rendimiento que hemos mencionado. Estas propuestas están basadas en técnicas de eliminación de redundancia parcial sensibles al camino de ejecución. Los resultados muestran que aplicando nuestras optimizaciones, somos capaces de alcanzar una reducción del 14% en el tiempo de ejecución de nuestro conjunto de programas.
En este trabajo también revisamos el problemas del análisis de alias en programas ejecutables, identificando el por qué la desambiguación de memoria es uno de los puntos débiles en la modificación de código objeto. Proponemos varios análisis para ser aplicados en el contexto de optimizadores binarios. Primero un análisis de alias estricto para descubrir dependencias de memoria sensibles al camino de ejecución, el cual es usado en nuestras optimizaciones para la eliminación de redundancias de memoria.
Seguidamente, dos análisis especulativos de posibles alias para detección de independencias de memoria. Estos análisis están basados en introducir información especulativa en tiempo de análisis, lo que incrementa la precisión en partes importantes de código manteniendo el análisis eficiente. Los resultados muestran que nuestras propuestas son altamente útiles para incrementar la desambiguación de memoria de código binario, lo que se traduce en oportunidades para aplicar optimizaciones.
Todos nuestros algoritmos, tanto de análisis como de optimización, han sido implementados en un optimizador binario, enfatizando los problemas más relevantes en la aplicaciones de nuestros algoritmos en código ejecutable, sin la ayuda de gran parte de la información de alto nivel presente en compiladores tradicionales.
Two of the most important performance limiters in today's processor families comes from solving the memory wall and handling control dependencies. In order to address these issues, cache memories and branch predictors are well-known hardware proposals that take advantage of, among other things, exploiting both temporal memory reuse and branch correlation. In other words, they try to exploit the dynamic redundancy existing in programs. This redundancy comes partly from the way that programmers write source code, but also from limitations in the compilation model of traditional compilers, which introduces unnecessary memory and conditional branch instructions. We believe that today's optimizing compilers should be very aggressive in optimizing programs, and then they should be expected to optimize a significant part of this redundancy away.
On the other hand, optimizations performed at link-time or directly applied to final program executables have received increased attention in recent years, due to limitations in the traditional compilation model. First, even though performing sophisticated interprocedural analyses and transformations, traditional compilers do not have the opportunity to optimize the program as a whole. A similar problem arises when applying profile-directe compilation techniques: large projects will be forced to re-build every source file to take advantage of profile information. By contrast, it would be more convenient to build the full application, instrument it to obtain profile data and then re-optimize the final binary without recompiling a single source file.
In this thesis we present new profile-guided compiler optimizations for eliminating the redundancy encountered on executable programs at binary level (i.e.: binary redundancy), even though these programs have been compiled with full optimizations using a state-ofthe- art commercial compiler. In particular, our Binary Redundancy Elimination (BRE) techniques are targeted at eliminating both redundant memory operations and redundant conditional branches, which are the most important ones for addressing the performance issues that we mentioned above in today's microprocessors. These new proposals are mainly based on Partial Redundancy Elimination (PRE) techniques for eliminating partial redundancies in a path-sensitive fashion. Our results show that, by applying our optimizations, we are able to achieve a 14% execution time reduction in our benchmark suite.
In this work we also review the problem of alias analysis at the executable program level, identifying why memory disambiguation is one of the weak points of object code modification. We then propose several alias analyses to be applied in the context of linktime or executable code optimizers. First, we present a must-alias analysis to recognize memory dependencies in a path- sensitive fashion, which is used in our optimization for eliminating redundant memory operations. Next, we propose two speculative may-alias data-flow algorithms to recognize memory independencies. These may-alias analyses are based on introducing unsafe speculation at analysis time, which increases alias precision on important portions of code while keeping the analysis reasonably cost-efficient. Our results show that our analyses prove to be very useful for increasing memory disambiguation accuracy of binary code, which turns out into opportunities for applying optimizations.
All our algorithms, both for the analyses and the optimizations, have been implemented within a binary optimizer, which overcomes most of the existing limitations of traditional source-code compilers. Therefore, our work also points out the most relevant issues of applying our algorithms at the executable code level, since most of the high-level information available in traditional compilers is lost.

APA, Harvard, Vancouver, ISO, and other styles

4

Du, Xinli. "High redundancy actuator." Thesis, Loughborough University, 2008. https://dspace.lboro.ac.uk/2134/12232.

Full text

Abstract:

High Redundancy Actuation (HRA) is a novel type of fault tolerant actuator. By comprising a relatively large number of actuation elements, faults in the elements can be inherently accommodated without resulting in a failure of the complete actuation system. By removing the possibility of faults detection and reconfiguration, HRA can provide high reliability and availability. The idea is motivated by the composition of human musculature. Our musculature can sustain damage and still function, sometimes with reduced performance, and even complete loss of a muscle group can be accommodated through kinematics redundancy, e.g. the use of just one leg. Electro-mechanical actuation is used as single element inside HRA. This thesis is started with modelling and simulation of individual actuation element and two basic structures to connect elements, in series and in parallel. A relatively simple HRA is then modelled which engages a two-by-two series-in-parallel configuration. Based on this HRA, position feedback controllers are designed using both classical and optimal algorithms under two control structures. All controllers are tested under both healthy and faults injected situations. Finally, a hardware demonstrator is set up based simulation studies. The demonstrator is controlled in real time using an xPC Target system. Experimental results show that the HRA can continuously work when one element fails, although performance degradation can be expected.

APA, Harvard, Vancouver, ISO, and other styles

5

Cai, Qiong Computer Science &amp Engineering Faculty of Engineering UNSW. "Profile-guided redundancy elimination." Awarded by:University of New South Wales. School of Computer Science and Engineering, 2006. http://handle.unsw.edu.au/1959.4/25156.

Full text

Abstract:

Program optimizations analyze and transform the programs such that better performance results can be achieved. Classical optimizations mainly use the static properties of the programs to analyze program code and make sure that the optimizations work for every possible combination of the program and the input data. This approach is conservative in those cases when the programs show the same runtime behaviors for most of their execution time. On the other hand, profile-guided optimizations use runtime profiling information to discover the aforementioned common behaviors of the programs and explore more optimization opportunities, which are missed in the classical, non-profile-guided optimizations. Redundancy elimination is one of the most powerful optimizations in compilers. In this thesis, a new partial redundancy elimination (PRE) algorithm and a partial dead code elimination algorithm (PDE) are proposed for a profile-guided redundancy elimination framework. During the design and implementation of the algorithms, we address three critical issues: optimality, feasibility and profitability. First, we prove that both our speculative PRE algorithm and our region-based PDE algorithm are optimal for given edge profiling information. The total number of dynamic occurrences of redundant expressions or dead codes cannot be further eliminated by any other code motion. Moreover, our speculative PRE algorithm is lifetime optimal, which means that the lifetimes of new introduced temporary variables are minimized. Second, we show that both algorithms are practical and can be efficiently implemented in production compilers. For SPEC CPU2000 benchmarks, the average compilation overhead for our PRE algorithm is 3%, and the average overhead for our PDE algorithm is less than 2%. Moreover, edge profiling rather than expensive path profiling is sufficient to guarantee the optimality of the algorithms. Finally, we demonstrate that the proposed profile-guided redundancy elimination techniques can provide speedups on real machines by conducting a thorough performance evaluation. To the best of our knowledge, this is the first performance evaluation of the profile-guided redundancy elimination techniques on real machines.

APA, Harvard, Vancouver, ISO, and other styles

6

Jibrin, Shafiu. "Redundancy in semidefinite programming." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape15/PQDD_0010/NQ32337.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Jibrin, Shafiu Carleton University Dissertation Mathematics and Statistics. "Redundancy in semidefinite programming." Ottawa, 1997.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

Tai, Cheng-Tao. "Time dependant redundancy optimization." Thesis, This resource online, 1993. http://scholar.lib.vt.edu/theses/available/etd-01312009-063418/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Zang, Joanna Q. "Design of a redundancy protocol /." free to MU campus, to others for purchase, 2003. http://wwwlib.umi.com/cr/mo/fullcit?p1418080.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Doherty, Noeleen. "Managerial perceptions of the personal and career transitions of redundant executives and suvivors of redundancy." Thesis, Cranfield University, 2000. http://hdl.handle.net/1826/3678.

Full text

Abstract:

Although redundancy became widespread in the late 2Wh century, research was lacking on the perceived impact of redundancy and redundancy management policies on the individual. During the 1980s redundancy became more prevalent for managerial populations and outplacement was used increasingly for redundant executives. Survey data gathered in 1990 indicated that, the practical nature of outplacement, and the help in overcoming personal and career transitions, were valued by redundant executives. Redundant executives were dissatisfied with the fact that outplacement did not always secure them a job. Another survey in 1992 identified the corporate rationale for outplacement policies. Perceived benefits included professional, objective help to facilitate the transition for redundant individuals and a potentially ameliorating effect on the survivors of redundancy. However, a survey in 1994 indicated that companies were more focussed on managing organisational needs than the personal or career transition issues of survivors. The research suggested that outplacement had become a normative HR policy response which may have been instrumental in setting new parameters for the psychological contracts of redundant executives, such as re-balancing work and non-work life, and reviewing commitment and attachment to a corporate entity. For the survivors of redundancy, a psychological contract based on a looser association appeared to be the corporate offer. As highlighted by the study of the employment deal for graduates in the mid 1990s, against the backdrop of large scale redundancy, companies were quite ekplicitly offering developmental opportunities rather than a career, even to those destined for senior management levels. These combined data signalled shifts in the employment relationship. This thesis describes and analyses some of the apparent ambiguities between theory and practice relating to redundancy management, and outcomes at the individual level. It seeks clarification through the development of a model of redundancy management.

APA, Harvard, Vancouver, ISO, and other styles

More sources

Books on the topic "Redundancy"

1

Firth, Judith. Redundancy. 3rd ed. London: Chartered Institute of Personnel and Development, 2003.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Dale, Jeannette. Redundancy. Birmingham: West Midlands Low Pay Unit, 1996.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Association, British Dental. Redundancy. London: British Dental Association, 2000.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Services, Incomes Data, ed. Redundancy. London: Incomes Data Services, 1991.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Services, Incomes Data, ed. Redundancy. London: Incomes Data Services, 1996.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Services, Incomes Data, ed. Redundancy. London: Incomes Data Services, 1991.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

Directorate, Great Britain Employment Rights. Redundancy. [U.K.]: Department of Trade and Industry, 2000.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

Institute of Personnel Management. Information Department. Redundancy. London: The Institute, 1985.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Services, Incomes Data, ed. Redundancy. London: Incomes Data Services, 1987.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

Carby-Hall, Jo. Redundancy. Hull: Barmarick, 1988.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Book chapters on the topic "Redundancy"

1

Marelli, A., and R. Micheloni. "Redundancy." In Inside NAND Flash Memories, 353–92. Dordrecht: Springer Netherlands, 2010. http://dx.doi.org/10.1007/978-90-481-9431-5_13.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Caron, Richard J., Arnon Boneh, and Shahar Boneh. "Redundancy." In Advances in Sensitivity Analysis and Parametric Programming, 464–504. Boston, MA: Springer US, 1997. http://dx.doi.org/10.1007/978-1-4615-6103-3_13.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Burchill, Frank, and Alice Casey. "Redundancy." In Human Resource Management, 147–56. London: Macmillan Education UK, 1996. http://dx.doi.org/10.1007/978-1-349-24806-3_9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Lockton, Deborah J. "Redundancy." In Employment Law, 235–50. London: Macmillan Education UK, 1999. http://dx.doi.org/10.1007/978-1-349-15002-1_10.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Fuchs, Maurice Bernard. "Redundancy." In Structures and Their Analysis, 167–94. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-31081-7_11.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Tantra, Ratna. "Redundancy." In A Survival Guide for Research Scientists, 207–13. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-05435-9_20.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Geffroy, Jean-Claude, and Gilles Motet. "Redundancy." In Design of Dependable Computing Systems, 175–98. Dordrecht: Springer Netherlands, 2002. http://dx.doi.org/10.1007/978-94-015-9884-2_8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Benson, Edward. "Redundancy." In A Guide to Redundancy Law, 44–67. London: Palgrave Macmillan UK, 1985. http://dx.doi.org/10.1007/978-1-349-07878-3_3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Lockton, Deborah J. "Redundancy." In Employment Law, 304–21. London: Macmillan Education UK, 2014. http://dx.doi.org/10.1007/978-1-137-08551-1_10.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Charles, Barrow, and Lyon Ann. "Redundancy." In Modern Employment Law, 173–85. Abingdon, Oxon; New York, NY : Routledge, 2018.: Routledge, 2018. http://dx.doi.org/10.4324/9781315713861-10.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Redundancy"

1

Zhou, Xiang Sean, Ute Feuerlein, Zhigang Peng, Yiqiang Zhan, Maneesh Dewan, Bing Jian, Arun Krishnan, Yimo Tao, Martin Harder, and Stefan Grosskopf. "Redundancy, redundancy, redundancy." In the international conference. New York, New York, USA: ACM Press, 2010. http://dx.doi.org/10.1145/1743384.1743416.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Babenko, M., A. Tchernykh, E. Golimblevskaia, H. N. Viet, and V. Chaurasiya. "Computationally secure threshold secret sharing scheme with minimal redundancy." In The International Workshop on Information, Computation, and Control Systems for Distributed Environments. Crossref, 2020. http://dx.doi.org/10.47350/iccs-de.2020.02.

Full text

Abstract:

When designing and using distributed storage systems with cloud technology, the security issues become crucial. One of the promising mechanisms is the computationally secure threshold secret sharing scheme. We propose a computationally secure secret sharing scheme based on the minimally redundant modular code. It reduces the computational complexity of data encoding and decoding and reduce data redundancy. We show that it is computationally secure and provides data redundancy equivalent to the redundancy of the Rabin system. We demonstrate that the minimally redundant modular code does not satisfy the criterion of compactness of a sequence, but it can be used as an asymptotically ideal secret sharing scheme.

APA, Harvard, Vancouver, ISO, and other styles

3

Gong, Lei, Sihang Zhou, Wenxuan Tu, and Xinwang Liu. "Attributed Graph Clustering with Dual Redundancy Reduction." In Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. California: International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/418.

Full text

Abstract:

Attributed graph clustering is a basic yet essential method for graph data exploration. Recent efforts over graph contrastive learning have achieved impressive clustering performance. However, we observe that the commonly adopted InfoMax operation tends to capture redundant information, limiting the downstream clustering performance. To this end, we develop a novel method termed attributed graph clustering with dual redundancy reduction (AGC-DRR) to reduce the information redundancy in both input space and latent feature space. Specifically, for the input space redundancy reduction, we introduce an adversarial learning mechanism to adaptively learn a redundant edge-dropping matrix to ensure the diversity of the compared sample pairs. To reduce the redundancy in the latent space, we force the correlation matrix of the cross-augmentation sample embedding to approximate an identity matrix. Consequently, the learned network is forced to be robust against perturbation while discriminative against different samples. Extensive experiments have demonstrated that AGC-DRR outperforms the state-of-the-art clustering methods on most of our benchmarks. The corresponding code is available at https://github.com/gongleii/AGC-DRR.

APA, Harvard, Vancouver, ISO, and other styles

4

Barriére, Caroline. "Redundancy." In the 17th international conference. Morristown, NJ, USA: Association for Computational Linguistics, 1998. http://dx.doi.org/10.3115/980451.980863.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Barriére, Caroline. "Redundancy." In the 36th annual meeting. Morristown, NJ, USA: Association for Computational Linguistics, 1998. http://dx.doi.org/10.3115/980845.980863.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Subedi, Dipendra, Ilya Tyapin, and Geir Hovland. "Control of Redundant Flexible Manipulators with Redundancy Resolution." In 2022 8th International Conference on Mechatronics and Robotics Engineering (ICMRE). IEEE, 2022. http://dx.doi.org/10.1109/icmre54455.2022.9734097.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

"REDUNDANCY 2019 Committees." In 2019 XVI International Symposium "Problems of Redundancy in Information and Control Systems" (REDUNDANCY). IEEE, 2019. http://dx.doi.org/10.1109/redundancy48165.2019.9003327.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

"Redundancy 2023 Committees." In 2023 XVIII International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY). IEEE, 2023. http://dx.doi.org/10.1109/redundancy59964.2023.10330196.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Mu¨ller, Andreas. "On the Terminology for Redundant Parallel Manipulators." In ASME 2008 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2008. http://dx.doi.org/10.1115/detc2008-49112.

Full text

Abstract:

Different types of redundancy in parallel kinematics machines (PKM) can be used to improve their kinematic and dynamic properties. The meaning of redundancy of PKM is often differently understood in the literature. In this paper a terminology for redundant PKM is proposed. The basis for this classification is a general mathematical model. With the help of this model PKM are regarded as non-linear control systems. The different types of redundancy are clearly distinguished, and their potential applications are discussed. Redundancy is considered from a geometric point of view. Redundancy is a means to deal with singularities of PKM. The different types of singular configurations are considered in the paper, and the potential of redundancy to cope with such situations is discussed. Again singularities are considered from a geometric point of view.

APA, Harvard, Vancouver, ISO, and other styles

10

Amari, Suprasad V., and Glenn Dill. "Redundancy optimization problem with warm-standby redundancy." In 2010 Annual Reliability and Maintainability Symposium (RAMS). IEEE, 2010. http://dx.doi.org/10.1109/rams.2010.5448068.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Redundancy"

1

Muley, P., M. Aissaoui, and M. Bocci. Pseudowire Redundancy. RFC Editor, August 2012. http://dx.doi.org/10.17487/rfc6718.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Knight, S., D. Weaver, D. Whipple, R. Hinden, D. Mitzel, P. Hunt, P. Higginson, M. Shand, and A. Lindem. Virtual Router Redundancy Protocol. RFC Editor, April 1998. http://dx.doi.org/10.17487/rfc2338.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Brzozowski, J., J. Tremblay, J. Chen, and T. Mrugalski. DHCPv6 Redundancy Deployment Considerations. RFC Editor, February 2013. http://dx.doi.org/10.17487/rfc6853.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Hinden, R., ed. Virtual Router Redundancy Protocol (VRRP). RFC Editor, April 2004. http://dx.doi.org/10.17487/rfc3768.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Xie, Q., R. Stewart, M. Stillman, M. Tuexen, and A. Silverton. Endpoint Handlespace Redundancy Protocol (ENRP). RFC Editor, September 2008. http://dx.doi.org/10.17487/rfc5353.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Reiter, Michael. Scalable Redundancy for Infrastructure Services. Fort Belvoir, VA: Defense Technical Information Center, May 2004. http://dx.doi.org/10.21236/ada424144.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Reiter, Michael K., and Gregory R. Ganger. Increasing Intrusion Tolerance via Scalable Redundancy. Fort Belvoir, VA: Defense Technical Information Center, July 2006. http://dx.doi.org/10.21236/ada455860.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Xie, Q. Forward-Shifted RTP Redundancy Payload Support. RFC Editor, August 2011. http://dx.doi.org/10.17487/rfc6354.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Kaplan, Alan J. Incorporating Redundancy Considerations Into Stockage Models. Fort Belvoir, VA: Defense Technical Information Center, January 1987. http://dx.doi.org/10.21236/ada179306.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Unseren, M. A., and D. B. Reister. A comparison of three redundancy resolution methods. Office of Scientific and Technical Information (OSTI), October 1997. http://dx.doi.org/10.2172/631238.

Full text

APA, Harvard, Vancouver, ISO, and other styles

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!