Academic literature on the topic 'Reusage'

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 'Reusage.'

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

1

Nak-Hwan Choi, Chang Chen, and Jia-Ling Zhang. "Store’s Visual Sensory Cues, Emotion, and Reusage Intention." Journal of Distribution Science 16, no. 2 (2018): 35–45. http://dx.doi.org/10.15722/jds.16.2.201802.35.

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

Jelić, Aleksandra, Danijela Kovačević, Marina Stamenović, and Slaviša Putić. "Current technologies for recycling fiber-reinforced composites." Scientific Technical Review 70, no. 3 (2020): 24–28. http://dx.doi.org/10.5937/str2003024j.

Full text
Abstract:
High strength, high toughness, and low weight make fiber-reinforced composite materials important as an alternative to traditional materials. Due to their application in different fields, such as construction, aviation, marine, automotive technologies and biomedicine, their production has increased leading to the increasement of composite wastes. New technologies for managing fiber-reinforced composite wastes have been developed to solve the issue of end-of-life of these materials. The aim of this paper is to emphasize recycling technologies used for fiber reinforced composites, and their potential reusage.
APA, Harvard, Vancouver, ISO, and other styles
3

Chang, Yu-Min, Lee-Kuo Lin, and Tien-Chin Chang. "A preliminary assessment on reusage of flyash emitted from fluidized bed incineration of sludge cake." Resources, Conservation and Recycling 20, no. 4 (1997): 245–66. http://dx.doi.org/10.1016/s0921-3449(97)00019-0.

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

Liang, Xiao, Mei Chen, Qian Wang, Shaojun Guo, and Huai Yang. "Ethanol‐Precipitable, Silica‐Passivated Perovskite Nanocrystals Incorporated into Polystyrene Microspheres for Long‐Term Storage and Reusage." Angewandte Chemie International Edition 58, no. 9 (2019): 2799–803. http://dx.doi.org/10.1002/anie.201814547.

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

Liang, Xiao, Mei Chen, Qian Wang, Shaojun Guo, and Huai Yang. "Ethanol‐Precipitable, Silica‐Passivated Perovskite Nanocrystals Incorporated into Polystyrene Microspheres for Long‐Term Storage and Reusage." Angewandte Chemie 131, no. 9 (2019): 2825–29. http://dx.doi.org/10.1002/ange.201814547.

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

Huang, Xu, Mengjia Zeng, Jing Fan, Xiangxiang Fan, and Xuefeng Tang. "A Full Duplex D2D Clustering Resource Allocation Scheme Based on a K-Means Algorithm." Wireless Communications and Mobile Computing 2018 (2018): 1–8. http://dx.doi.org/10.1155/2018/1843083.

Full text
Abstract:
Although the Device-to-Device (D2D) technology in cellular networks can improve the performance of cellular systems, it creates a large amount of interference in traditional communications. In this paper, the problem of resource allocation and control in a single-cell scene is studied. First, the concept of a restricted D2D communication area and a restricted D2D user-reusage area is put forward to reduce the complexity and interference intensity of resource allocation. Second, under the premise of satisfying the QoS (Quality of Service) demands of every system user, the resource allocation algorithm is improved, the optimal allocation of resources is carried out, and the algorithm’s processes are given in detail. Our simulated experiments show that the proposed method greatly improves the spectrum efficiency and the system fairness.
APA, Harvard, Vancouver, ISO, and other styles
7

FÖRSTER, SASCHA. "Reusing Props at the National Theatre, London: Considering Theatre Materiality in a Historiographical Context." Theatre Research International 45, no. 3 (2020): 337–43. http://dx.doi.org/10.1017/s0307883320000358.

Full text
Abstract:
Over the last years, the National Theatre, London (NT) has presented props and costumes in its restaurant, the Green Room, and in its bar, the Propstore, thereby shedding a different light on theatre objects. It also widely advertises the option of hiring costumes and props from its Hire department. These practices challenge theatre studies to reconsider the usage of theatre objects and their manifold stage lives not only as stories of (in)animation, but as what I call potentials of reusage. Presenting theatre objects in unusual locations like a restaurant emphasizes that these objects are built or manipulated in theatre workshops, thereby shedding light on the craftsmanship that is foundational to every production. The labour of the workshops, as well as different backstage operations, has been ignored by theatre historiography. Analysing the NT's different staging of props invites us to look into the hidden histories of theatre materiality.
APA, Harvard, Vancouver, ISO, and other styles
8

DONG, JIAN-XIONG, CHING Y. SUEN, and ADAM KRZYŻAK. "A FAST SVM TRAINING ALGORITHM." International Journal of Pattern Recognition and Artificial Intelligence 17, no. 03 (2003): 367–84. http://dx.doi.org/10.1142/s0218001403002423.

Full text
Abstract:
A fast support vector machine (SVM) training algorithm is proposed under SVM's decomposition framework by effectively integrating kernel caching, digest and shrinking policies and stopping conditions. Kernel caching plays a key role in reducing the number of kernel evaluations by maximal reusage of cached kernel elements. Extensive experiments have been conducted on a large handwritten digit database MNIST to show that the proposed algorithm is much faster than Keerthi et al.'s improved SMO, about nine times. Combined with principal component analysis, the total training for ten one-against-the-rest classifiers on MNIST took less than an hour. Moreover, the proposed fast algorithm speeds up SVM training without sacrificing the generalization performance. The 0.6% error rate on MNIST test set has been achieved. The promising scalability of the proposed scheme paves a new way to solve more large-scale learning problems in other domains such as data mining.
APA, Harvard, Vancouver, ISO, and other styles
9

Medina-Acosta, G. A., and José A. Delgado-Penín. "On the Reusage of Primary Radio Resources through the Exploitation of the Spatiotemporal Robustness of the MIMO Transmissions." Journal of Electrical and Computer Engineering 2012 (2012): 1–7. http://dx.doi.org/10.1155/2012/909540.

Full text
Abstract:
The spatiotemporal robustness of the MIMO transmissions is exploited aiming at inducing opportunistic secondary communications on the primary radio resources. The proposed model makes use of the smallest singular values and the Extreme Value Theory for characterizing the robustness of the MIMO systems, having always the premise of preventing significant degradations in the performance of the primary communications, while at the same time an attractive number of potential opportunities for secondary are intended to be offered. So, the idea behind the suggested scheme consists in reusing the information that is already available within the primary MIMO networks aiming at cotransmitting opportunistically in a clever manner, which at the end will allow us to make a much more efficient use of both the natural and technical resources.
APA, Harvard, Vancouver, ISO, and other styles
10

Kwon, Soon-Jae. "The Effect of Fun Factors of Virtual Reality (VR) Content Leisure Satisfaction and Reusage Intention as Leisure Activities." Korean Journal of Lesure, Recreation & Park 45, no. 2 (2021): 51–60. http://dx.doi.org/10.26446/kjlrp.2021.6.45.2.51.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources
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