Relevant bibliographies by topics / Low-complexity

Academic literature on the topic 'Low-complexity'

Author: Grafiati
Published: 4 June 2021
Last updated: 14 March 2023

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

Select a source type:

Contents

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

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 "Low-complexity"

1

Schmidhuber, Jurgen. "Low-Complexity Art." Leonardo 30, no. 2 (1997): 97. http://dx.doi.org/10.2307/1576418.

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

Lee, Woon-Sang, Jae-Hyun Ro, Hyun-Sun Hwang, and Hyoung-Kyu Song. "Low-Complexity Adaptive Detector in Single-User MIMO System." International Journal of Signal Processing Systems 7, no. 4 (December 2019): 129–32. http://dx.doi.org/10.18178/ijsps.7.4.129-132.

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

Mier, Pablo, Lisanna Paladin, Stella Tamana, Sophia Petrosian, Borbála Hajdu-Soltész, Annika Urbanek, Aleksandra Gruca, et al. "Disentangling the complexity of low complexity proteins." Briefings in Bioinformatics 21, no. 2 (January 30, 2019): 458–72. http://dx.doi.org/10.1093/bib/bbz007.

Full text
Abstract:
Abstract There are multiple definitions for low complexity regions (LCRs) in protein sequences, with all of them broadly considering LCRs as regions with fewer amino acid types compared to an average composition. Following this view, LCRs can also be defined as regions showing composition bias. In this critical review, we focus on the definition of sequence complexity of LCRs and their connection with structure. We present statistics and methodological approaches that measure low complexity (LC) and related sequence properties. Composition bias is often associated with LC and disorder, but repeats, while compositionally biased, might also induce ordered structures. We illustrate this dichotomy, and more generally the overlaps between different properties related to LCRs, using examples. We argue that statistical measures alone cannot capture all structural aspects of LCRs and recommend the combined usage of a variety of predictive tools and measurements. While the methodologies available to study LCRs are already very advanced, we foresee that a more comprehensive annotation of sequences in the databases will enable the improvement of predictions and a better understanding of the evolution and the connection between structure and function of LCRs. This will require the use of standards for the generation and exchange of data describing all aspects of LCRs. Short abstract There are multiple definitions for low complexity regions (LCRs) in protein sequences. In this critical review, we focus on the definition of sequence complexity of LCRs and their connection with structure. We present statistics and methodological approaches that measure low complexity (LC) and related sequence properties. Composition bias is often associated with LC and disorder, but repeats, while compositionally biased, might also induce ordered structures. We illustrate this dichotomy, plus overlaps between different properties related to LCRs, using examples.
APA, Harvard, Vancouver, ISO, and other styles
4

Thiyagarajan, Karthik, Kamal El-Sankary, Yongsheng Wang, and Issam Hammad. "Low Complexity Multimedia Encryption." International Journal of Computer Network and Information Security 8, no. 4 (April 8, 2016): 1–13. http://dx.doi.org/10.5815/ijcnis.2016.04.01.

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

Jackson, Marcel. "Low Growth Equational Complexity." Proceedings of the Edinburgh Mathematical Society 62, no. 1 (September 25, 2018): 197–210. http://dx.doi.org/10.1017/s0013091518000354.

Full text
Abstract:
AbstractThe equational complexity function $\beta \nu \,:\,{\open N} \to {\open N}$ of an equational class of algebras bounds the size of equation required to determine the membership of n-element algebras in . Known examples of finitely generated varieties with unbounded equational complexity have growth in Ω(nc), usually for c ≥ (1/2). We show that much slower growth is possible, exhibiting $O(\log_{2}^{3}(n))$ growth among varieties of semilattice-ordered inverse semigroups and additive idempotent semirings. We also examine a quasivariety analogue of equational complexity, and show that a finite group has polylogarithmic quasi-equational complexity function, bounded if and only if all Sylow subgroups are abelian.
APA, Harvard, Vancouver, ISO, and other styles
6

Mirani, Ali, Erik Agrell, and Magnus Karlsson. "Low-Complexity Geometric Shaping." Journal of Lightwave Technology 39, no. 2 (January 15, 2021): 363–71. http://dx.doi.org/10.1109/jlt.2020.3033031.

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

Ash, David W., Ian F. Blake, and Scott A. Vanstone. "Low complexity normal bases." Discrete Applied Mathematics 25, no. 3 (November 1989): 191–210. http://dx.doi.org/10.1016/0166-218x(89)90001-2.

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

Di Fiore, Carmine, Stefano Fanelli, and Paolo Zellini. "Low-complexity minimization algorithms." Numerical Linear Algebra with Applications 12, no. 8 (2005): 755–68. http://dx.doi.org/10.1002/nla.449.

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

Hajjaj, Moufida, Fadoua Mhiri, and Ridha Bouallegue. "Low-Complexity MMSE Channel Estimator for MB-OFDM UWB Systems." International Journal of Future Computer and Communication 3, no. 4 (2014): 227–31. http://dx.doi.org/10.7763/ijfcc.2014.v3.301.

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

Balmahoon, Tarika, and Hongjun Xu. "Low-complexity EDAS and low-complexity detection scheme for MPSK spatial modulation." IET Communications 10, no. 14 (September 20, 2016): 1752–57. http://dx.doi.org/10.1049/iet-com.2015.0890.

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

Dissertations / Theses on the topic "Low-complexity"

1

Cooper, D. "Classes of low complexity." Thesis, University of Oxford, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.375251.

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

Williams, Richard G. C. "Low complexity block coded modulation." Thesis, University of Manchester, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.329600.

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

Khattak, Shadan. "Low complexity multiview video coding." Thesis, De Montfort University, 2014. http://hdl.handle.net/2086/10511.

Full text
Abstract:
3D video is a technology that has seen a tremendous attention in the recent years. Multiview Video Coding (MVC) is an extension of the popular H.264 video coding standard and is commonly used to compress 3D videos. It offers an improvement of 20% to 50% in compression efficiency over simulcast encoding of multiview videos using the conventional H.264 video coding standard. However, there are two important problems associated with it: (i) its superior compression performance comes at the cost of significantly higher computational complexity which hampers the real-world realization of MVC encoder in applications such as 3D live broadcasting and interactive Free Viewpoint Television (FTV), and (ii) compressed 3D videos can suffer from packet loss during transmission, which can degrade the viewing quality of the 3D video at the decoder. This thesis aims to solve these problems by presenting techniques to reduce the computational complexity of the MVC encoder and by proposing a consistent error concealment technique for frame losses in 3D video transmission. The thesis first analyses the complexity of the MVC encoder. It then proposes two novel techniques to reduce the complexity of motion and disparity estimation. The first method achieves complexity reduction in the disparity estimation process by exploiting the relationship between temporal levels, type of macroblocks and search ranges while the second method achieves it by exploiting the geometrical relation- ship between motion and disparity vectors in stereo frames. These two methods are then combined with other state-of-the-art methods in a unique framework where gains add up. Experimental results show that the proposed low-complexity framework can reduce the encoding time of the standard MVC encoder by over 93% while maintaining similar compression efficiency performance. The addition of new View Synthesis Prediction (VSP) modes to the MVC encoding framework improves the compression efficiency of MVC. However, testing additional modes comes at the cost of increased encoding complexity. In order to reduce the encoding complexity, the thesis, next, proposes a bayesian early mode decision technique for a VSP enhanced MVC coder. It exploits the statistical similarities between the RD costs of the VSP SKIP mode in neighbouring views to terminate the mode decision process early. Results indicate that the proposed technique can reduce the encoding time of the enhanced MVC coder by over 33% at similar compression efficiency levels. Finally, compressed 3D videos are usually required to be broadcast to a large number of users where transmission errors can lead to frame losses which can degrade the video quality at the decoder. A simple reconstruction of the lost frames can lead to inconsistent reconstruction of the 3D scene which may negatively affect the viewing experience of a user. In order to solve this problem, the thesis proposes, at the end, a consistency model for recovering frames lost during transmission. The proposed consistency model is used to evaluate inter-view and temporal consistencies while selecting candidate blocks for concealment. Experimental results show that the proposed technique is able to recover the lost frames with high consistency and better quality than two standard error concealment methods and a baseline technique based on the boundary matching algorithm.
APA, Harvard, Vancouver, ISO, and other styles
4

Johansson, Kenny. "Low Complexity and Low Power Bit-Serial Multipliers." Thesis, Linköping University, Department of Electrical Engineering, 2003. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-1751.

Full text
Abstract:

Bit-serial multiplication with a fixed coefficient is commonly used in integrated circuits, such as digital filters and FFTs. These multiplications can be implemented using basic components such as adders, subtractors and D flip-flops. Multiplication with the same coefficient can be implemented in many ways, using different structures. Other studies in this area have focused on how to minimize the number of adders/subtractors, and often assumed that the cost for D flip-flops is neglectable. That simplification has been proved to be far too great, and further not at all necessary. In digital devices low power consumption is always desirable. How to attain this in bit-serial multipliers is a complex problem.

The aim of this thesis was to find a strategy on how to implement bit-serial multipliers with as low cost as possible. An important step was achieved by deriving formulas that can be used to calculate the carry switch probability in the adders/subtractors. It has also been established that it is possible to design a power model that can be applied to all possible structures of bit- serial multipliers.

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

McKay, Thomas Gregory. "Soft, low complexity dielectric elastomer generators." Thesis, University of Auckland, 2010. http://hdl.handle.net/2292/7661.

Full text
Abstract:
The global demand for renewable energy is forecast to grow rapidly over the next 25 years [1]. A class of variable capacitor power generators called Dielectric Elastomer Generators (DEG), show considerable promise for harvesting from previously unviable sources. This is because they can be directly coupled to large broadband motions without gearing, while maintaining a high energy density, and they have few moving parts, and are highly flexible. At the system level DEG cannot currently realize their full potential for flexibility, simplicity and low mass because they require rigid and bulky external circuitry and often need a secondary high voltage energy source; there is a lack of modelling tools for system level optimization; and there is a lack of experimental data from explicitly described DEG systems. The objectives of this thesis are to provide solutions to these issues. First, system level DEG models with the dynamic electrical systems were developed and experimentally validated. Then the generalized Self-Priming Circuit (SPC) was introduced, an external circuit that enables DEG to operate in a wide range of conditions without a secondary high voltage energy source. These systems do not require an external high voltage energy source because they have the ability to boost their voltage from consumer battery levels up to kilovolt levels by accumulation of generated energy. Generalized SPC were then optimized for voltage boosting and energy production using the system level models. Finally, integrated self-priming systems were introduced. The SPC in these systems was integrated onto the DEG membrane using a flexible electronics technology called Dielectric Elastomer Switches (DES), so that no rigid and bulky external electronics were required. Highly explicit experimental analysis of each system was carried out. These contributions resulted in the publication of three journal articles, two provisional patents, and three conference articles. This work presents the opportunity to produce DEG systems with greater autonomy, softness, simplicity, energy density, and lower cost than previously. With further developments of DES, more complex systems with these benefits will be possible.
APA, Harvard, Vancouver, ISO, and other styles
6

Gustafsson, Oscar. "Contributions to low-complexity digital filters /." Linköping : Univ, 2003. http://www.bibl.liu.se/liupubl/disp/disp2003/tek837s.pdf.

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

Harsha, Prahladh 1976. "Small PCPs with low query complexity." Thesis, Massachusetts Institute of Technology, 2000. http://hdl.handle.net/1721.1/86448.

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

Ho, Hai Pang. "Low complexity decoding of cyclic codes." Thesis, University of Surrey, 1998. http://epubs.surrey.ac.uk/844222/.

Full text
Abstract:
This thesis presents three novel low complexity decoding algorithms for Cyclic codes. These algorithms are the Extended Kasami Algorithm (EKA), Permutation Error Trapping (PET) and the Modified Dorsch Algorithm (MDA). The Extended Kasami Algorithm is a novel decoding algorithm combining the Error Trapping Algorithm with cover polynomial techniques. With a revised searching method to locate the best combination of cover positions, the Extended Kasami Algorithm can achieve bounded distance performance with complexity many times lower than other efficient decoding algorithms. In comparison with the Minimum Weight Decoding (MWD) Algorithm on (31,16) BCH codes, the complexity of EKA is only 5% of MWD at 0 dB Eb/No. Comparing EKA with the Kasami Algorithm on the (23,12) Golay code, EKA reduces the complexity consistently for all values of Eb/No. When dealing with Reed Solomon codes, it is found that the additional complexity incurred by finding the error values is a function that increases exponentially with the number of bits in each symbol. To eliminate the problem of finding the error values, Permutation Error Trapping uses a specific cyclic code property to re-shuffle symbol positions. This complements well the Error Trapping approach and most decodable error patterns can be trapped by using this simple approach. PET achieves performance close to that of MWD on the (15,9) RS code with much lower complexity. For more complex codes, like the four-symbol-error correcting (15,7) RS code. Modified Permutation Error Trapping combines part of the cover polynomial approach of EKA with PET resulting in retaining good performance with low complexity. For attempting to decode Reed Solomon codes using soft decision values, the application of a modified Dorsch Algorithm to Reed Solomon codes on various issues has been evaluated. Using a binary form of Reed Solomon codes has been found to be able to achieve near maximum likelihood performance with very few decodings.
APA, Harvard, Vancouver, ISO, and other styles
9

Sridharan, Arun. "Low Complexity Scheduling in Wireless Networks." The Ohio State University, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=osu1366072589.

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

Detert, Thorben. "Low complexity co-channel interference cancellation." Göttingen Sierke, 2008. http://d-nb.info/991223314/04.

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

Books on the topic "Low-complexity"

1

Bai, Lin, Jinho Choi, and Quan Yu. Low Complexity MIMO Receivers. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-04984-7.

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

Bai, Lin, and Jinho Choi. Low Complexity MIMO Detection. Boston, MA: Springer US, 2012. http://dx.doi.org/10.1007/978-1-4419-8583-5.

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

Bai, Lin. Low Complexity MIMO Detection. Boston, MA: Springer US, 2012.

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

Qu, Qing. Nonconvex Recovery of Low-complexity Models. [New York, N.Y.?]: [publisher not identified], 2018.

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

Johansson, Kenny. Low power and low complexity shift-and-add based computations. Linköping: Department of Electrical Engineering, Linköping University, 2008.

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

Johansson, Kenny. Low power and low complexity constant multiplication using serial arithmetic. Linko ping: Department of Electrical Engineering, Linko pings universitet, 2006.

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

Seuret, Alexandre, Hitay Özbay, Catherine Bonnet, and Hugues Mounier, eds. Low-Complexity Controllers for Time-Delay Systems. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-05576-3.

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

Peng, Xiaohong. Low complexity error control for block codes. Manchester: University of Manchester, 1994.

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

Edgar, James. Low complexity public key encryption employing the McEliece algorithm. [s.l.]: typescript, 1993.

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

Goedecker, S. Low complexity algorithms for density functional electronic structure calculations. Ithaca, N.Y: Cornell Theory Center, Cornell University, 1993.

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

Book chapters on the topic "Low-complexity"

1

Rauzy, Gerard. "Low Complexity and Geometry." In Nonlinear Phenomena and Complex Systems, 147–77. Dordrecht: Springer Netherlands, 1996. http://dx.doi.org/10.1007/978-94-017-1323-8_4.

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

Shabtay, Lior, and Adrian Segall. "Low complexity network synchronization." In Distributed Algorithms, 223–37. Berlin, Heidelberg: Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/bfb0020436.

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

Bai, Lin, and Jinho Choi. "Introduction." In Low Complexity MIMO Detection, 1–11. Boston, MA: Springer US, 2011. http://dx.doi.org/10.1007/978-1-4419-8583-5_1.

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

Bai, Lin, and Jinho Choi. "Background of MIMO Detection." In Low Complexity MIMO Detection, 15–42. Boston, MA: Springer US, 2011. http://dx.doi.org/10.1007/978-1-4419-8583-5_2.

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

Bai, Lin, and Jinho Choi. "List and Lattice Reduction-Based Methods." In Low Complexity MIMO Detection, 43–90. Boston, MA: Springer US, 2011. http://dx.doi.org/10.1007/978-1-4419-8583-5_3.

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

Bai, Lin, and Jinho Choi. "Partial MAP-Based Detection." In Low Complexity MIMO Detection, 91–112. Boston, MA: Springer US, 2011. http://dx.doi.org/10.1007/978-1-4419-8583-5_4.

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

Bai, Lin, and Jinho Choi. "Lattice Reduction-Based List Detection." In Low Complexity MIMO Detection, 113–40. Boston, MA: Springer US, 2011. http://dx.doi.org/10.1007/978-1-4419-8583-5_5.

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

Bai, Lin, and Jinho Choi. "Detection for Underdetermined MIMO Systems." In Low Complexity MIMO Detection, 141–65. Boston, MA: Springer US, 2011. http://dx.doi.org/10.1007/978-1-4419-8583-5_6.

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

Bai, Lin, and Jinho Choi. "Selection Criteria of Single User." In Low Complexity MIMO Detection, 169–83. Boston, MA: Springer US, 2011. http://dx.doi.org/10.1007/978-1-4419-8583-5_7.

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

Bai, Lin, and Jinho Choi. "Selection Criteria of Multiple Users." In Low Complexity MIMO Detection, 185–216. Boston, MA: Springer US, 2011. http://dx.doi.org/10.1007/978-1-4419-8583-5_8.

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

Conference papers on the topic "Low-complexity"

1

Cheung, Shiufun, and Robert A. Ulichney. "Low-memory low-complexity inverse dithering." In Electronic Imaging '99, edited by Giordano B. Beretta and Reiner Eschbach. SPIE, 1998. http://dx.doi.org/10.1117/12.334598.

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

Gengfeng Qiu, Shaoshuai Gao, and Guofang Tu. "Low-complexity low-delay distributed video coding." In 2013 18th International Conference on Digital Signal Processing (DSP). IEEE, 2013. http://dx.doi.org/10.1109/icdsp.2013.6622739.

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

Sackenreuter, Benjamin, Niels Hadaschik, Marc Fassbinder, and Christopher Mutschler. "Low-complexity PDoA-based localization." In 2016 International Conference on Indoor Positioning and Indoor Navigation (IPIN). IEEE, 2016. http://dx.doi.org/10.1109/ipin.2016.7743692.

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

Khattak, S., R. Hamzaoui, S. Ahmad, and P. Frossard. "Low-complexity multiview video coding." In 2012 Picture Coding Symposium (PCS). IEEE, 2012. http://dx.doi.org/10.1109/pcs.2012.6213295.

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

Chen, Xianyu, and Ming Jiang. "Low-Complexity Adaptive Channel Estimation." In 2018 IEEE 88th Vehicular Technology Conference (VTC-Fall). IEEE, 2018. http://dx.doi.org/10.1109/vtcfall.2018.8690909.

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

Kant, Shashi, Gabor Fodor, Mats Bengtsson, Bo Goransson, and Carlo Fischione. "Low-Complexity OFDM Spectral Precoding." In 2019 IEEE 20th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC). IEEE, 2019. http://dx.doi.org/10.1109/spawc.2019.8815554.

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

Bhise, Archana, and Prakash D. Vyavahare. "Low Complexity Hybrid Turbo Codes." In 2008 IEEE Wireless Communications and Networking Conference. IEEE, 2008. http://dx.doi.org/10.1109/wcnc.2008.190.

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

Mainali, Pradip, Qiong Yang, Gauthier Lafruit, Rudy Lauwereins, and Luc Van Gool. "Lococo: low complexity corner detector." In 2010 IEEE International Conference on Acoustics, Speech and Signal Processing. IEEE, 2010. http://dx.doi.org/10.1109/icassp.2010.5494944.

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

Vermeir, Thijs, Jurgen Slowack, Glenn Van Wallendael, Peter Lambert, and Rik Van De Walle. "Low Delay Complexity Constrained Encoding." In 2016 Data Compression Conference (DCC). IEEE, 2016. http://dx.doi.org/10.1109/dcc.2016.54.

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

Nayyef, S., C. Tsimenidis, B. Sharif, A. Al-Dweik, and S. Boussakta. "Low complexity precoded OFDM system." In ICC 2013 - 2013 IEEE International Conference on Communications. IEEE, 2013. http://dx.doi.org/10.1109/icc.2013.6655378.

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

Reports on the topic "Low-complexity"

1

Le, Qiang. Low Complexity Track Initialization and Fusion for Multi-Modal Sensor Networks. Fort Belvoir, VA: Defense Technical Information Center, November 2012. http://dx.doi.org/10.21236/ada569636.

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

Xia, Xiang-Gen. Low Complexity Receiver Based Space-Time Codes for Broadband Wireless Communications. Fort Belvoir, VA: Defense Technical Information Center, January 2011. http://dx.doi.org/10.21236/ada549377.

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

Ariyawansa, K. A. Low-Complexity Interior Point Algorithms for Stochastic Programming: Derivation Analysis and Performance Evaluation. Fort Belvoir, VA: Defense Technical Information Center, January 2000. http://dx.doi.org/10.21236/ada418278.

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

Wu, An-Yeu, and K. J. Liu. Algorithm-Based Low-Power Transform Coding Architectures. Part 2. Logarithmic Complexity, Unified Architecture, and Finite-Precision Analysis. Fort Belvoir, VA: Defense Technical Information Center, January 1995. http://dx.doi.org/10.21236/ada445617.

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

Coleman, Todd P. Low-Complexity Methods for Provably Good Information Transmission and Network Anomaly Detection via Packet Timings In Networks. Fort Belvoir, VA: Defense Technical Information Center, March 2011. http://dx.doi.org/10.21236/ada549164.

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

Zapata Hernández, Vicente Manuel. Irregular maritime migration and managing arrivals in the Canary Islands. Observatorio de la Inmigración de Tenerife, 2021. http://dx.doi.org/10.25145/r.obitfact.2021.03.

Full text
Abstract:
The Canary Islands are witnessing a new cycle of intense migratory influx by sea, coinciding in time with the progression of the current coronavirus pandemic. Irregular arrivals have increased, and, after a decade of low arrivals through this Atlantic route, the archipelago’s reception system was initially insufficient and highly debilitated. This system now takes on renewed prominence as the always perilous crossings bring with them a more diverse range of vulnerable migrants. The institutional response has had to deal with greater complexity, conditioning the constant urgency to adopt incomplete and inappropriate solutions in certain cases, according to many of the evaluations carried out. The migratory process continues its course and more and more voices are demanding that a suitable reception strategy be defined, one based on a model that also integrates the principles of interculturality and is built with input from all the stakeholders involved
APA, Harvard, Vancouver, ISO, and other styles
7

Akinleye, Taiwo, Idil Deniz Akin, Amanda Hohner, Indranil Chowdhury, Richards Watts, Xianming Shi, Brendan Dutmer, James Mueller, and Will Moody. Evaluation of Electrochemical Treatment for Removal of Arsenic and Manganese from Field Soil. Illinois Center for Transportation, June 2021. http://dx.doi.org/10.36501/0197-9191/21-019.

Full text
Abstract:
Soils containing inorganic compounds are frequently encountered by transportation agencies during construction within the right-of-way, and they pose a threat to human health and the environment. As a result, construction activities may experience project delays and increased costs associated with management of inorganic compounds containing soils required to meet environmental regulations. Recalcitrance of metal-contaminated soils toward conventional treatment technologies is exacerbated in clay or organic content-rich fine-grained soils with low permeability and high sorption capacity because of increased treatment complexity, cost, and duration. The objective of this study was to develop an accelerated in situ electrochemical treatment approach to extract inorganic compounds from fine-grained soils, with the treatment time comparable to excavation and off-site disposal. Three reactor experiments were conducted on samples collected from two borehole locations from a field site in Illinois that contained arsenic (As)(~7.4 mg/kg) and manganese (Mn)(~700 mg/kg). A combination of hydrogen peroxide (H2O2) and/or citrate buffer solution was used to treat the soils. A low-intensity electrical field was applied to soil samples using a bench-scale reactor that resembles field-scale in situ electrochemical systems. For the treatment using 10% H2O2 and citrate buffer solution, average removal of 23% and 8% were achieved for Mn and As, respectively. With 4% H2O2 and citrate buffer, 39% and 24% removal were achieved for Mn and As; while using only citrate buffer as the electrolyte, 49% and 9% removal were achieved for Mn and As, respectively. All chemical regimes adopted in this study reduced the inorganic compound concentrations to below the maximum allowable concentration for Illinois as specified by the Illinois Environmental Protection Agency. The results from this work indicate that electrochemical systems that leverage low concentrations of hydrogen peroxide and citrate buffer can be effective for remediating soils containing manganese and arsenic.
APA, Harvard, Vancouver, ISO, and other styles
8

Collyer, Michael, Tahir Zaman, and Dolf te Lintelo. Displacement and Social Assistance. Institute of Development Studies (IDS), February 2022. http://dx.doi.org/10.19088/basic.2022.029.

Full text
Abstract:
Displacement forms part of virtually any major crisis. It introduces a level of complexity when providing social assistance that leads to a specific, usually context-dependent set of challenges. It is widely recognised that the vast majority of displaced people will travel as short a distance as possible to reach safety, whether as Internally Displaced Persons (IDPs), refugees or irregular migrants in neighbouring countries. Displaced people are disproportionately hosted in low- and middle-income countries, and the length of their displacement is increasing. This highlights the urgent priority of displacement; indeed, it has received sustained attention from the highest levels of global decision-making, particularly since 2016, including two Global Compacts in 2018 (Global Compact for Migration, Global Compact for Safe, Orderly and Regular Migration). Although some have argued that such global summits offer a replacement for meaningful action, these events at least highlight clear political will to shift the emphasis from humanitarian responses to a much longer-term development focus. Interest in social assistance and displacement has also grown since 2018 and resulting policy must respond to this concern for more sustainable responses. High-level commitments are slowly filtering through to policy, while recent research has provided clear frameworks for analysing developing policy approaches. Gaps remain in the analysis of policy implementation and in the assessment of how to access social assistance beyond official state channels.
APA, Harvard, Vancouver, ISO, and other styles
9

Pelletier, Austin, Amanda Hohner, Idil Deniz Akin, Indranil Chowdhury, Richard Watts, Xianming Shi, Brendan Dutmer, and James Mueller. Bench-scale Electrochemical Treatment of Co-contaminated Clayey Soil. Illinois Center for Transportation, June 2021. http://dx.doi.org/10.36501/0197-9191/21-018.

Full text
Abstract:
Industrial soil contamination is frequently unearthed by transportation agencies during construction within the right-of-way. As a result, transportation agencies may experience construction delays. Soils co-contaminated with high-molecular-weight polycyclic aromatic hydrocarbons (HMW-PAHs) and metals are commonly encountered in Illinois and exhibit recalcitrance towards conventional treatment technologies. This issue is exacerbated in the fine-grained soils common to Illinois, where low-permeability and immense sorption capacity increase treatment complexity, cost, and duration. Contaminated sites are spatially and temporally restrictive and require rapid in situ treatments, whereas conventional soil remediation requires 1 to 3 years on average. Consequently, transportation agencies typically pursue excavation and off-site disposal for expediency. However, this solution is expensive, so a comparatively expeditious and affordable treatment alternative is needed to combat the increasing cost of hazardous waste disposal. The objective of this work was to develop an accelerated in situ treatment approach adaptable for use at any construction site to cost-effectively remove HMW-PAHs and metals from clayey soil. It was hypothesized that an in situ electrochemical treatment which augments electrokinetics with H2O2 could remediate both HMW-PAHs and metals in less than a month. Bench-scale reactors resemblant of field-scale in situ electrokinetic systems were designed and fabricated to assess the electrochemical treatment of clayey soils contaminated with HMW-PAHs and metals. Pyrene, chromium, and manganese were used as model contaminants, spiked into kaolinite as a model clay. Electrokinetics were imposed by a low-intensity electrical field distributed by graphite rods. Electrolytic H2O2 systems were leveraged to distribute electrical current and facilitate contaminant removal. Average contaminant removals of 100%, 42.3%, and 4.5% were achieved for pyrene, manganese, and chromium, respectively. Successful development of this bench-scale treatment approach will serve to guide transportation agencies in field-scale implementation. The results from this work signify that electrochemical systems that leverage eco-friendly oxidant addition can replace excavation and disposal as a means of addressing clayey soils co-contaminated with HMW-PAHs and metals.
APA, Harvard, Vancouver, ISO, and other styles
10

Peitz, David. White-tailed deer monitoring at Wilson’s Creek National Battlefield, Missouri: 2005–2022 trend report. Edited by Tani Hubbard. National Park Service, November 2022. http://dx.doi.org/10.36967/2295163.

Full text
Abstract:
The Heartland Inventory and Monitoring Network has monitored white-tailed deer over an 18-year period (2005–2022) within a defined survey area of Wilson’s Creek National Battlefield, documenting both a rapid decline and recovery in the population. The rapid die-off was the result of a region-wide hemorrhagic disease outbreak reported by the Missouri Department of Conservation that started in the fall of 2005, six months after we initiated deer monitoring. Although declines occurred 2005 to 2007, 2016 to 2017, and 2019 to 2022, the deer population still increased on average by 7.2% annually. The number of deer in the survey area ranged from a low of 14.9 ± 10.1 (mean ± 95% CI) individuals/km2 in 2007 to a high of 167.2 ± 57.4 individuals/km2 in 2016. The visible area surveyed each year varied between 0.7 and 1.1 km2 (coefficient of variation = 14.1%). Annual deer harvest data in the area nearby Wilson’s Creek National Battlefield exhibit similar trends to our annual adjusted counts suggesting that factors other than hunting maybe driving annual changes in deer population size in most years. However, these trends were not significantly correlated (r = 0.34, p = 0.33), so this relationship is only speculative. Overall, the increasing number of deer pose several problems for Wilson’s Creek National Battlefield. First, increasing deer populations add a level of complexity to implementing Wilson’s Creek National Battlefield Cultural Landscape Report recommendations. Deer preferentially browse native vegetation over exotic vegetation, promoting the spread of exotic species, and the success of tree plantings can be curtailed by heavy deer browsing. Second, controlling deer-related disease, some of which can affect domestic livestock and human health in and around the park, becomes increasingly harder as the deer population increases. Third, as additional ancillary data suggests, the largely unreported and costly deer-vehicle collisions in and around Wilson’s Creek National Battlefield have the potential to increase when there are more deer.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Low-complexity' 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