representation scheme
Recently Published Documents


TOTAL DOCUMENTS

306
(FIVE YEARS 30)

H-INDEX

28
(FIVE YEARS 1)

Sensors ◽  
2022 ◽  
Vol 22 (2) ◽  
pp. 491
Author(s):  
Woong Seo ◽  
Sanghun Park ◽  
Insung Ihm

Cluster computing has attracted much attention as an effective way of solving large-scale problems. However, only a few attempts have been made to explore mobile computing clusters that can be easily built using commodity smartphones and tablets. To investigate the possibility of mobile cluster-based rendering of large datasets, we developed a mobile GPU ray tracer that renders nontrivial 3D scenes with many millions of triangles at an interactive frame rate on a small-scale mobile cluster. To cope with the limited processing power and memory space, we first present an effective 3D scene representation scheme suitable for mobile GPU rendering. Then, to avoid performance impairment caused by the high latency and low bandwidth of mobile networks, we propose using a static load balancing strategy, which we found to be more appropriate for the vulnerable mobile clustering environment than a dynamic strategy. Our mobile distributed rendering system achieved a few frames per second when ray tracing 1024 × 1024 images, using only 16 low-end smartphones, for large 3D scenes, some with more than 10 million triangles. Through a conceptual demonstration, we also show that the presented rendering scheme can be effectively explored for augmenting real scene images, captured or perceived by augmented and mixed reality devices, with high quality ray-traced images.


2021 ◽  
Vol 8 (4) ◽  
pp. 1-25
Author(s):  
Saleh Khalaj Monfared ◽  
Omid Hajihassani ◽  
Vahid Mohsseni ◽  
Dara Rahmati ◽  
Saeid Gorgin

In this work, we present a novel bitsliced high-performance Viterbi algorithm suitable for high-throughput and data-intensive communication. A new column-major data representation scheme coupled with the bitsliced architecture is employed in our proposed Viterbi decoder that enables the maximum utilization of the parallel processing units in modern parallel accelerators. With the help of the proposed alteration of the data scheme, instead of the conventional bit-by-bit operations, 32-bit chunks of data are processed by each processing unit. This means that a single bitsliced parallel Viterbi decoder is capable of decoding 32 different chunks of data simultaneously. Here, the Viterbi’s Add-Compare-Select procedure is implemented with our proposed bitslicing technique, where it is shown that the bitsliced operations for the Viterbi internal functionalities are efficient in terms of their performance and complexity. We have achieved this level of high parallelism while keeping an acceptable bit error rate performance for our proposed methodology. Our suggested hard and soft-decision Viterbi decoder implementations on GPU platforms outperform the fastest previously proposed works by 4.3{\times } and 2.3{\times } , achieving 21.41 and 8.24 Gbps on Tesla V100, respectively.


2021 ◽  
Vol 28 (1) ◽  
Author(s):  
Stefano D’Alesio

AbstractWe introduce a derived representation scheme associated with a quiver, which may be thought of as a derived version of a Nakajima variety. We exhibit an explicit model for the derived representation scheme as a Koszul complex and by doing so we show that it has vanishing higher homology if and only if the moment map defining the corresponding Nakajima variety is flat. In this case we prove a comparison theorem relating isotypical components of the representation scheme to equivariant K-theoretic classes of tautological bundles on the Nakajima variety. As a corollary of this result we obtain some integral formulas present in the mathematical and physical literature since a few years, such as the formula for Nekrasov partition function for the moduli space of framed instantons on $$S^4$$ S 4 . On the technical side we extend the theory of relative derived representation schemes by introducing derived partial character schemes associated with reductive subgroups of the general linear group and constructing an equivariant version of the derived representation functor for algebras with a rational action of an algebraic torus.


2021 ◽  
Vol 2090 (1) ◽  
pp. 012118
Author(s):  
Mario Einax

Abstract Energy conversion in nanosized devices is studied in the framework of state-space models. We use a network representation of the underlying master equation to describe the dynamics by a graph. Particular segments of this network represent input and output processes that provide a way to introduce a coupling to several heat reservoirs and particle reservoirs. In addition, the network representation scheme allows one to decompose the stationary dynamics as cycles. The cycle analysis is a convenient tool for analyse models of machine operations, which are characterized by different nanoscale energy conversion processes. By introducing the cycle affinity, we are able to calculate the zero-current limit. The zero-current limit can be mapped to the zero-affinity limit in a network representation scheme. For example, for systems with competing external driving forces the open-circuit voltage can be determined by setting the cycle affinity zero. This framework is used to derive open-circuit voltage with respect to microscopic material energetics and different coupling to particle and temperature reservoirs.


2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Sayed Mahmood Bakhshayesh ◽  
Abbas Ahmadi ◽  
Azadeh Mohebi

Purpose Many search engines in digital libraries are restricted to the terms presented in users’ queries. When users cannot represent their information needs in terms of keywords in a query, the search engine fails to provide appropriate results. In addition, most search engines do not have the ability to visualize search results for users to help them in their information journey. The purpose of this paper is to develop a new approach for search result visualization in digital libraries. The visualization approach enables subject-based visualization of search results and search queries. Design/methodology/approach To enable subject-based visualization of search results in digital libraries, new subject-based document retrieval is proposed in which each document is represented as a vector of subjects as well. Then, using a vector space model for information retrieval, along with the subject-based vector, related documents to the user’s query are retrieved, whilst each document is visualized through a ring chart, showing the inherent subjects within each document and the query. Findings The proposed subject-based retrieval and visualization approach is evaluated from various perspectives to amplify the impact of the visualization approach from users’ opinions. Users have evaluated the performance of the proposed subject-based retrieval and search result visualization, whilst 67% of users prefer subject-based document retrieval and 80% of them believe that the proposed visualization approach is practical. Research limitations/implications This research has provided a subject-based representation scheme for search result visualization in a digital library. The implication of this research can be viewed from two perspectives. First, the subject-based retrieval approach provides an opportunity for the users to understand their information needs, beyond the explicit terms in the query, leading to results, which are semantically relevant to the query. Second, the simple subject-based visualization scheme, helps users to explore the results easily, whilst allowing them to build their knowledge experience. Originality/value A new vectorized subject-based representation of documents and queries is proposed. This representation determines the semantic and subject-based relationship between a given query and documents within a digital scientific library. In addition, it also provides a subject-based representation of the retrieved documents through which users can track the semantic relationship between the query and retrieve documents, visually.


Author(s):  
Jian Zhou ◽  
Suling Bo ◽  
Hao Wang ◽  
Lei Zheng ◽  
Pengfei Liang ◽  
...  

The 2-oxoglutarate/Fe (II)-dependent (2OG) oxygenase superfamily is mainly responsible for protein modification, nucleic acid repair and/or modification, and fatty acid metabolism and plays important roles in cancer, cardiovascular disease, and other diseases. They are likely to become new targets for the treatment of cancer and other diseases, so the accurate identification of 2OG oxygenases is of great significance. Many computational methods have been proposed to predict functional proteins to compensate for the time-consuming and expensive experimental identification. However, machine learning has not been applied to the study of 2OG oxygenases. In this study, we developed OGFE_RAAC, a prediction model to identify whether a protein is a 2OG oxygenase. To improve the performance of OGFE_RAAC, 673 amino acid reduction alphabets were used to determine the optimal feature representation scheme by recoding the protein sequence. The 10-fold cross-validation test showed that the accuracy of the model in identifying 2OG oxygenases is 91.04%. Besides, the independent dataset results also proved that the model has excellent generalization and robustness. It is expected to become an effective tool for the identification of 2OG oxygenases. With further research, we have also found that the function of 2OG oxygenases may be related to their polarity and hydrophobicity, which will help the follow-up study on the catalytic mechanism of 2OG oxygenases and the way they interact with the substrate. Based on the model we built, a user-friendly web server was established and can be friendly accessed at http://bioinfor.imu.edu.cn/ogferaac.


2021 ◽  
Vol 28 ◽  
pp. 3-20
Author(s):  
Isabella M. Lami ◽  
Beatrice Mecca

Reflecting on how economic evaluation is taught in architecture courses opens up a discussion between those who structure problems with design and those who structure problems with different approaches (specifically estimation approaches) and where this design and these methods can intersect and hybridise. The paper presents some reflections, and a methodological proposal, related to the way of teaching economic evaluation in architecture courses. The aim of this paper is to propose an integrated assessment operative framework applied according to the active learning strategy, aimed at supporting students in dealing with design decision-making processes in a structured way and providing them with a problem representation scheme. Riflettere sulle modalità insegnamento della valutazione economica nei corsi di architettura consente di aprire una discussione tra chi struttura i problemi con il progetto e chi struttura i problemi con approcci diversi (nello specifico quelli estimativi) e dove questo progetto e questi metodi si possono incrociare e ibridare. L’articolo illustra alcune riflessioni, e una proposta metodologica, relative alla modalità di insegnamento della valutazione economica nei corsi di architettura. Lo scopo di questo documento è di proporre un quadro operativo di valutazione integrato applicato secondo la strategia dell’apprendimento attivo, volto a sostenere gli studenti nell’affrontare processi decisionali di progettazione in modo strutturato e a fornire loro uno schema di rappresentazione del problema.


Sign in / Sign up

Export Citation Format

Share Document