Relevant bibliographies by topics / Methods of representation

Academic literature on the topic 'Methods of representation'

Author: Grafiati
Published: 10 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 'Methods of representation.'

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 "Methods of representation"

1

Zhang, Shugang, Zhiqiang Wei, Jie Nie, Lei Huang, Shuang Wang, and Zhen Li. "A Review on Human Activity Recognition Using Vision-Based Method." Journal of Healthcare Engineering 2017 (2017): 1–31. http://dx.doi.org/10.1155/2017/3090343.

Full text
Abstract:
Human activity recognition (HAR) aims to recognize activities from a series of observations on the actions of subjects and the environmental conditions. The vision-based HAR research is the basis of many applications including video surveillance, health care, and human-computer interaction (HCI). This review highlights the advances of state-of-the-art activity recognition approaches, especially for the activity representation and classification methods. For the representation methods, we sort out a chronological research trajectory from global representations to local representations, and recent depth-based representations. For the classification methods, we conform to the categorization of template-based methods, discriminative models, and generative models and review several prevalent methods. Next, representative and available datasets are introduced. Aiming to provide an overview of those methods and a convenient way of comparing them, we classify existing literatures with a detailed taxonomy including representation and classification methods, as well as the datasets they used. Finally, we investigate the directions for future research.
APA, Harvard, Vancouver, ISO, and other styles
2

Wolter, Rafael. "The Structural Approach to Social Representations: Bridges between Theory and Methods." Psico-USF 23, no. 4 (December 2018): 621–31. http://dx.doi.org/10.1590/1413-82712018230403.

Full text
Abstract:
Abstract Since the publication of the works of Jean-Claude Abric and Celso Sá, the structural approach to social representation has become widely diffused. There is often a lack of congruency between theoretical aspects of the structural approach and technical characteristics of the different methods used. This paper aims at making explicit the structural characteristics that are studied by the different structural approach techniques. These characteristics are: associative power of the elements, consensual aspects of thought and object essence. With these characteristics it is possible to elaborate a classification of the different techniques of the structural approach to social representations. The conclusion focuses on the absence of the social representation dynamics on a technical level despite being a central theoretical point for a better understanding of the socio representational phenomenon.
APA, Harvard, Vancouver, ISO, and other styles
3

Reinhartz-Berger, Iris. "Representation of Situational Methods." International Journal of Information System Modeling and Design 4, no. 3 (July 2013): 32–49. http://dx.doi.org/10.4018/jismd.2013070102.

Full text
Abstract:
Method Engineering (ME) and Situational Method Engineering (SME) aim at providing effective solutions for building and supporting evolution of software and information systems development methods. For this purpose, method components are specified and composed into general-purpose development methods or situational methods, i.e., development methods that best fit the characteristics of a given project and its environment. Recently ISO/IEC 24744 has emerged for defining a metamodel and a notation for development methods. However, this standard lacks a systematic support for situational classification and maintenance. In this work, the authors suggest incorporating ISO/IEC 24744 metamodel into a domain-based framework, called Application-based DOmain Modeling for Method Engineering (ADOM-ME), which supports specifying both general-purpose and situational methods in a single, simple, accessible, and scalable frame of reference. An exploratory study on the usability of ADOM-ME indicates that the approach can be utilized by information systems students that represent non-experienced method engineers and software developers.
APA, Harvard, Vancouver, ISO, and other styles
4

Nguyễn, Tuấn, Nguyen Hai Hao, Dang Le Dinh Trang, Nguyen Van Tuan, and Cao Van Loi. "Robust anomaly detection methods for contamination network data." Journal of Military Science and Technology, no. 79 (May 19, 2022): 41–51. http://dx.doi.org/10.54939/1859-1043.j.mst.79.2022.41-51.

Full text
Abstract:
Recently, latent representation models, such as Shrink Autoencoder (SAE), have been demonstrated as robust feature representations for one-class learning-based network anomaly detection. In these studies, benchmark network datasets that are processed in laboratory environments to make them completely clean are often employed for constructing and evaluating such models. In real-world scenarios, however, we can not guarantee 100% to collect pure normal data for constructing latent representation models. Therefore, this work aims to investigate the characteristics of the latent representation of SAE in learning normal data under some contamination scenarios. This attempts to find out wherever the latent feature space of SAE is robust to contamination or not, and which contamination scenarios it prefers. We design a set of experiments using normal data contaminated with different anomaly types and different proportions of anomalies for the investigation. Other latent representation methods such as Denoising Autoencoder (DAE) and Principal component analysis (PCA) are also used for comparison with the performance of SAE. The experimental results on four CTU13 scenarios show that the latent representation of SAE often out-performs and are less sensitive to contamination than the others.
APA, Harvard, Vancouver, ISO, and other styles
5

Kreinovich, V. "Interval Methods in Knowledge Representation." International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 30, no. 02 (April 2022): 335–36. http://dx.doi.org/10.1142/s0218488522970030.

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

KREINOVICH, VLADIK. "INTERVAL METHODS IN KNOWLEDGE REPRESENTATION." International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 08, no. 01 (February 2000): 119–20. http://dx.doi.org/10.1142/s0218488500000083.

Full text
Abstract:
This section is maintained by Vladik Kreinovich. Please send your abstract (or copies of papers that you want to see reviewed here), to vladik@cs.utep.edu, or by regular mail to: Vladik Kreinovich, Department of Computer Science, University of Texas at El Paso, El Paso, TX 79968, USA.
APA, Harvard, Vancouver, ISO, and other styles
7

KREINOVICH, VLADIK. "INTERVAL METHODS IN KNOWLEDGE REPRESENTATION." International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 08, no. 02 (April 2000): 235–38. http://dx.doi.org/10.1142/s0218488500000150.

Full text
Abstract:
This section is maintained by Vladik Kreinovich. Please send your abstract (or copies of papers that you want to see reviewed here), to vladik@cs.utep.edu, or by regular mail to: Vladik Kreinovich, Department of Computer Science, University of Texas at El Paso, El Paso, TX 79968, USA.
APA, Harvard, Vancouver, ISO, and other styles
8

KREINOVICH, VLADIK. "INTERVAL METHODS IN KNOWLEDGE REPRESENTATION." International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 08, no. 03 (June 2000): 383–84. http://dx.doi.org/10.1142/s0218488500000277.

Full text
Abstract:
This section is maintained by Vladik Kreinovich. Please send your abstracts (or copies of papers that you want to see reviewed here), to vladik@cs.utep.edu, or by regular mail to: Vladik Kreinovich, Department of Computer Science, University of Texas at El Paso, El Paso, TX 79968, USA.
APA, Harvard, Vancouver, ISO, and other styles
9

KREINOVICH, VLADIK. "INTERVAL METHODS IN KNOWLEDGE REPRESENTATION." International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 08, no. 04 (August 2000): 501–2. http://dx.doi.org/10.1142/s0218488500000356.

Full text
Abstract:
This section is maintained by Vladik Kreinovich. Please send your abstracts (or copies of papers that you want to see reviewed here), to vladik@cs.utep.edu, or by regular mail to: Vladik Kreinovich, Department of Computer Science, University of Texas at El Paso, El Paso, TX 79968, USA.
APA, Harvard, Vancouver, ISO, and other styles
10

KREINOVICH, VLADIK. "INTERVAL METHODS IN KNOWLEDGE REPRESENTATION." International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 08, no. 05 (October 2000): 619–20. http://dx.doi.org/10.1142/s0218488500000435.

Full text
Abstract:
This section is maintained by Vladik Kreinovich. Please send your abstracts (or copies of papers that you want to see reviewed here) to vladik@cs.utep.edu, or by regular mail to: Vladik Kreinovich, Department of Computer Science, University of Texas at El Paso, El Paso, TX 79968, USA.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Methods of representation"

1

Chang, William. "Representation Theoretical Methods in Image Processing." Scholarship @ Claremont, 2004. https://scholarship.claremont.edu/hmc_theses/160.

Full text
Abstract:
Image processing refers to the various operations performed on pictures that are digitally stored as an aggregate of pixels. One can enhance or degrade the quality of an image, artistically transform the image, or even find or recognize objects within the image. This paper is concerned with image processing, but in a very mathematical perspective, involving representation theory. The approach traces back to Cooley and Tukey’s seminal paper on the Fast Fourier Transform (FFT) algorithm (1965). Recently, there has been a resurgence in investigating algebraic generalizations of this original algorithm with respect to different symmetry groups. My approach in the following chapters is as follows. First, I will give necessary tools from representation theory to explain how to generalize the Discrete Fourier Transform (DFT). Second, I will introduce wreath products and their application to images. Third, I will show some results from applying some elementary filters and compression methods to spectrums of images. Fourth, I will attempt to generalize my method to noncyclic wreath product transforms and apply it to images and three-dimensional geometries.
APA, Harvard, Vancouver, ISO, and other styles
2

Henrysson, Anders. "Procedural Media Representation." Thesis, Linköping University, Department of Science and Technology, 2002. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-1220.

Full text
Abstract:

We present a concept for using procedural techniques to represent media. Procedural methods allow us to represent digital media (2D images, 3D environments etc.) with very little information and to render it photo realistically. Since not all kind of content can be created procedurally, traditional media representations (bitmaps, polygons etc.) must be used as well. We have adopted an object-based media representation where an object can be represented either with a procedure or with its traditional representation. Since the objects are created on the client the procedures can be adapted to its properties such as screen resolution and rendering performance. To keep the application as small and flexible as possible, each procedure is implemented as a library which is only loaded when needed. The media representation iswritten in XML to make it human readable and easy editable. The application is document driven where the content of the XML document determines which libraries to be loaded. The media objects resulting from the procedures is composited into the media representation preferred by the renderer together with the non-procedural objects. The parameters in the XML document are relative to parameters determined by the system properties (resolution, performance etc.) and hence adapt the procedures to the client. By mapping objects to individual libraries, the architecture is easy to make multi threaded and/or distributed.

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

Tveit, Amund. "Customizing Cyberspace : Methods for User Representation and Prediction." Doctoral thesis, Norwegian University of Science and Technology, Department of Computer and Information Science, 2004. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-1605.

Full text
Abstract:

Cyberspace plays an increasingly important role in people’s life due to its plentiful offering of services and information, e.g. the Word Wide Web, the Mobile Web and Online Games. However, the usability of cyberspace services is frequently reduced by its lack of customization according to individual needs and preferences.

In this thesis we address the cyberspace customization issue by focusing on methods for user representation and prediction. Examples of cyberspace customization include delegation of user data and tasks to software agents, automatic pre-fetching, or pre-processing of service content based on predictions. The cyberspace service types primarily investigated are Mobile Commerce (e.g. news, finance and games) and Massively Multiplayer Online Games (MMOGs).

First a conceptual software agent architecture for supporting users of mobile commerce services will be presented, including a peer-to-peer based collaborative filtering extension to support product and service recommendations.

In order to examine the scalability of the proposed conceptual software agent architecture a simulator for MMOGs is developed. Due to their size and complexity, MMOGs can provide an estimated “upper bound” for the performance requirements of other cyberspace services using similar agent architectures.

Prediction of cyberspace user behaviour is considered to be a classification problem, and because of the large and continuously changing nature of cyberspace services there is a need for scalable classifiers. This is handled by proposed classifiers that are incrementally trainable, support a large number of classes, and supports efficient decremental untraining of outdated classification knowledge, and are efficiently parallelized in order to scale well.

Finally the incremental classifier is empirically compared with existing classifiers on: 1) general classification data sets, 2) user clickstreams from an actual web usage log, and 3) a synthetic game usage log from the developed MMOG simulator. The proposed incremental classifier is shown to an order of magnitude faster than the other classifiers, significantly more accurate than the naive bayes classifier on the selected data sets, and with insignificantly different accuracy from the other classifiers.

The papers leading to this thesis have combined been cited more than 50 times in book, journal, magazine, conference, workshop, thesis, whitepaper and technical report publications at research events and universities in 20 countries. 2 of the papers have been applied in educational settings for university courses in Canada, Finland, France, Germany, Norway, Sweden and USA.

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

Jackson, Todd Robert. "Analysis of functionally graded material object representation methods." Thesis, Massachusetts Institute of Technology, 2000. http://hdl.handle.net/1721.1/9032.

Full text
Abstract:
Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Ocean Engineering, 2000.
Includes bibliographical references (leaves 218-224).
Solid Freeform Fabrication (SFF) processes have demonstrated the ability to produce parts with locally controlled composition. To exploit this potential, methods to represent and exchange parts with varying local composition need to be proposed and evaluated. In modeling such parts efficiently, any such method should provide a concise and accurate description of all of the relevant information about the part with minimal cost in terms of storage. To address these issues, several approaches to modeling Functionally Graded Material (FGM) objects are evaluated based on their memory requirements. Through this research, an information pathway for processing FGM objects based on image processing is proposed. This pathway establishes a clear separation between design of FGM objects, their processing, and their fabrication. Similar to how an image is represented by a continuous vector valued function of the intensity of the primary colors over a two-dimensional space, an FGM object is represented by a vector valued function spanning a Material Space, defined over the three dimensional Build Space. Therefore, the Model Space for FGM objects consists of a Build Space and a Material Space. The task of modeling and designing an FGM object, therefore, is simply to accurately represent the function m(x) where x E Build Space. Data structures for representing FGM objects are then described and analyzed, including a voxel based structure, finite element method, and the extension of the Radial-Edge and Cell-Tuple-Graph data structures mains in order to represent spatially varying properties. All of the methods are capable of defining the function m(x) but each does so in a different way. Along with introducing each data structure, the storage cost for each is derived in terms of the number of instances of each of its fundamental classes required to represent an object. In order to determine the optimal data structure to model FGM objects, the storage cost associated with each data structure for representing several hypothetical models is calculated. Although these models are simple in nature, their curved geometries and regions of both piece-wise constant and non-linearly graded compositions reflect the features expected to be found in real applications. In each case, the generalized cellular methods are found to be optimal, accurately representing the intended design.
by Todd Robert Jackson.
Ph.D.
APA, Harvard, Vancouver, ISO, and other styles
5

Harutunian, Vigain. "Representation methods for an axiomatic design process software." Thesis, Massachusetts Institute of Technology, 1996. http://hdl.handle.net/1721.1/39768.

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

Cureton, Paul. "Drawing in landscape architecture : fieldwork, poetics, methods, translation and representation." Thesis, Manchester Metropolitan University, 2014. http://e-space.mmu.ac.uk/580030/.

Full text
Abstract:
By analysing landscape architectural representation, particularly drawing, the thesis contribution will develop the mode and process of making - poesis: between production and representation. Extending the work of James Corner on drawing within landscape architecture (1992), the thesis will develop a positive hermeneutics from the novelist Italo Calvino (1997) in which this agency of drawing can be understood and conceived. From this framework of operation, a number of drawing methods are to be developed - particularly heuristics and scoring which creates a positive valence for landscape architectural production. The focus will lie within the process or translation of drawing into landscape, or its process of ‘becoming’ (Vesely 2006, Evans 1996, 2000, Deleuze 1992). This focus will be contextualised amongst others by the work of: Paolo Soleri (1919- 2013), Wolf Hilbertz (1938-2007) and Lawrence Halprin (1916-2009). The agency of drawing is to be situated in broader theories of space and ‘everyday life’ particularly by extracting critical neo-Marxist notions and readings of social productions of space as found in Henri Lefebvre (1901 -1991) (De Certeau 1984, 1998, Lefebvre, 1991, 1996, 2003, Soja 1996, 2000 & Harvey 1989. 1996). The thesis contribution to knowledge will thus chart drawing use, communication, alternative strategies, and new concepts of urban environments; a ‘poetic mediation on existence’ (Kundera 1987). This very movement & ‘becoming’ whilst containing analysis, in each separate component, has yet to be collectively discussed in a constructive and meaningful way. This inturn will reflect back on the role of representation in the shaping and conception of space – this is the role of drawing in landscape architecture. This knowledge is enabled using methods of interdisciplinary exhibition, educational modules, oral history interviews and the history of professional landscape architecture practices, as well by deploying a visual literacy method within the thesis (Dee 2001, 2004).
APA, Harvard, Vancouver, ISO, and other styles
7

Zhou, Ying Fu. "A study for orbit representation and simplified orbit determination methods." Thesis, Queensland University of Technology, 2003. https://eprints.qut.edu.au/15895/1/Ying_Fu_Zhou_Thesis.pdf.

Full text
Abstract:
This research effort is concerned with the methods of simplified orbit determination and orbit representation and their applications for Low Earth Orbit (LEO) satellite missions, particularly addressing the operational needs of the FedSat mission. FedSat is the first Australian-built satellite in over thirty years. The microsatellite is approximately 50cm cubed with a mass of 58 kg. The satellite was successfully placed into a low-earth near-polar orbit at an altitude of 780km by the Japanese National Space Development Agency (NASDA) H-IIA launch vehicle on 14, December 2002. Since then, it has been streaming scientific data to its ground station in Adelaide almost daily. This information is used by Australian and international researchers to study space weather, to help improve the design of space computers, communication systems and other satellite technology, and for research into navigation and satellite tracking. This research effort addresses four practical issues regarding the FedSat mission and operations. First, unlike most satellite missions, the GPS receiver onboard FedSat operates in a duty-cycle mode due to the limitations of the FedSat power supply. This causes significant difficulties for orbit tracking, Precise Orbit Determination and scientific applications. A covariance analysis was performed before the mission launch to assess the orbit performance under different operational modes. The thesis presents the analysis methods and results. Second, FedSat supports Ka-band tracking experiments that require a pointing accuracy of 0.03 degree. The QUT GPS group is obligated to provide the GPS precise orbit solution to meet this requirement. Ka-band tracking requests satellite orbital position at any instant time with respect to any of the observation stations. Because orbit determination and prediction software only provide satellite orbital data at a discrete time point, it is necessary to find a way to represent the satellite orbit as a continuous trajectory with discrete observation data, able to obtain the position of the satellite at the time of interest. For this purpose, an orbit interpolation algorithm using the Chebyshev polynomial was developed and applied to Ka-band tracking applications. The thesis will describe the software and results. Third, since the launch of FedSat, investigators have received much flight GPS data. Some research was invested in the analysis of FedSat orbit performance, GPS data quality and the quality of the onboard navigation solutions. Studies have revealed that there are many gross errors in the FedSat onboard navigation solution (ONS). Although the 1-sigma accuracy of each component is about 20 m, there are more than 11 %positioning errors that fall outside +/-50m, and 5% of the errors are outside the 100mbound. The 3D RMS values would be 35m, 87m, and 173m for the above three cases respectively. The FedSat ONS uncertainties are believed to be approximately three times greater than those from other satellite missions. Due to the high percentage of outlier solutions, it would be dangerous to use these without first applying data detection and exclusion procedures. Therefore, this thesis presents two simplified orbit determination methods that can improve the ONS. One is the "geometric method", which makes use of delta-position solutions derived from carrier phase differences between two epochs to smooth the code-based navigation solutions. The algorithms were tested using SAC-C GPS data and showing some improvement. The second method is the "dynamic method", which uses orbit dynamics information for orbit improvements. Fourth, the FedSat ground tracking team at Adelaide use the NORAD TLE orbit for daily FedSat tracking. Research was undertaken to convert an orbit trajectory into these Two Line Elements (TLE). Algorithms for the estimation of TLE solutions from the FedSat onboard GPS navigation solutions are outlined. Numerical results have shown the effects of the unmodelled forces/perturbations in the SPG4 models for the FedSat orbit determination would reach a level of ±1000m. This only includes the orbit representation errors with TLE data sets. The total FedSat orbit propagation should include both the orbit propagation and orbit representation terms. The analysis also demonstrates that the orbit presentation error can be reduced to ±200m and ±100mlevels with the EGM4x4 and EGM10x10 gravity field models respectively. This can meet the requirements for Ka-band tracking. However, a simplified tracking program based on numerical integration has to be developed to replace the SPG4 models.
APA, Harvard, Vancouver, ISO, and other styles
8

Zhou, Ying Fu. "A Study For Orbit Representation And Simplified Orbit Determination Methods." Queensland University of Technology, 2003. http://eprints.qut.edu.au/15895/.

Full text
Abstract:
This research effort is concerned with the methods of simplified orbit determination and orbit representation and their applications for Low Earth Orbit (LEO) satellite missions, particularly addressing the operational needs of the FedSat mission. FedSat is the first Australian-built satellite in over thirty years. The microsatellite is approximately 50cm cubed with a mass of 58 kg. The satellite was successfully placed into a low-earth near-polar orbit at an altitude of 780km by the Japanese National Space Development Agency (NASDA) H-IIA launch vehicle on 14, December 2002. Since then, it has been streaming scientific data to its ground station in Adelaide almost daily. This information is used by Australian and international researchers to study space weather, to help improve the design of space computers, communication systems and other satellite technology, and for research into navigation and satellite tracking. This research effort addresses four practical issues regarding the FedSat mission and operations. First, unlike most satellite missions, the GPS receiver onboard FedSat operates in a duty-cycle mode due to the limitations of the FedSat power supply. This causes significant difficulties for orbit tracking, Precise Orbit Determination and scientific applications. A covariance analysis was performed before the mission launch to assess the orbit performance under different operational modes. The thesis presents the analysis methods and results. Second, FedSat supports Ka-band tracking experiments that require a pointing accuracy of 0.03 degree. The QUT GPS group is obligated to provide the GPS precise orbit solution to meet this requirement. Ka-band tracking requests satellite orbital position at any instant time with respect to any of the observation stations. Because orbit determination and prediction software only provide satellite orbital data at a discrete time point, it is necessary to find a way to represent the satellite orbit as a continuous trajectory with discrete observation data, able to obtain the position of the satellite at the time of interest. For this purpose, an orbit interpolation algorithm using the Chebyshev polynomial was developed and applied to Ka-band tracking applications. The thesis will describe the software and results. Third, since the launch of FedSat, investigators have received much flight GPS data. Some research was invested in the analysis of FedSat orbit performance, GPS data quality and the quality of the onboard navigation solutions. Studies have revealed that there are many gross errors in the FedSat onboard navigation solution (ONS). Although the 1-sigma accuracy of each component is about 20 m, there are more than 11 %positioning errors that fall outside +/-50m, and 5% of the errors are outside the 100mbound. The 3D RMS values would be 35m, 87m, and 173m for the above three cases respectively. The FedSat ONS uncertainties are believed to be approximately three times greater than those from other satellite missions. Due to the high percentage of outlier solutions, it would be dangerous to use these without first applying data detection and exclusion procedures. Therefore, this thesis presents two simplified orbit determination methods that can improve the ONS. One is the "geometric method", which makes use of delta-position solutions derived from carrier phase differences between two epochs to smooth the code-based navigation solutions. The algorithms were tested using SAC-C GPS data and showing some improvement. The second method is the "dynamic method", which uses orbit dynamics information for orbit improvements. Fourth, the FedSat ground tracking team at Adelaide use the NORAD TLE orbit for daily FedSat tracking. Research was undertaken to convert an orbit trajectory into these Two Line Elements (TLE). Algorithms for the estimation of TLE solutions from the FedSat onboard GPS navigation solutions are outlined. Numerical results have shown the effects of the unmodelled forces/perturbations in the SPG4 models for the FedSat orbit determination would reach a level of ±1000m. This only includes the orbit representation errors with TLE data sets. The total FedSat orbit propagation should include both the orbit propagation and orbit representation terms. The analysis also demonstrates that the orbit presentation error can be reduced to ±200m and ±100mlevels with the EGM4x4 and EGM10x10 gravity field models respectively. This can meet the requirements for Ka-band tracking. However, a simplified tracking program based on numerical integration has to be developed to replace the SPG4 models.
APA, Harvard, Vancouver, ISO, and other styles
9

Karmakar, Priyabrata. "Effective and efficient kernel-based image representations for classification and retrieval." Thesis, Federation University Australia, 2018. http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/165515.

Full text
Abstract:
Image representation is a challenging task. In particular, in order to obtain better performances in different image processing applications such as video surveillance, autonomous driving, crime scene detection and automatic inspection, effective and efficient image representation is a fundamental need. The performance of these applications usually depends on how accurately images are classified into their corresponding groups or how precisely relevant images are retrieved from a database based on a query. Accuracy in image classification and precision in image retrieval depend on the effectiveness of image representation. Existing image representation methods have some limitations. For example, spatial pyramid matching, which is a popular method incorporating spatial information in image-level representation, has not been fully studied to date. In addition, the strengths of pyramid match kernel and spatial pyramid matching are not combined for better image matching. Kernel descriptors based on gradient, colour and shape overcome the limitations of histogram-based descriptors, but suffer from information loss, noise effects and high computational complexity. Furthermore, the combined performance of kernel descriptors has limitations related to computational complexity, higher dimensionality and lower effectiveness. Moreover, the potential of a global texture descriptor which is based on human visual perception has not been fully explored to date. Therefore, in this research project, kernel-based effective and efficient image representation methods are proposed to address the above limitations. An enhancement is made to spatial pyramid matching in terms of improved rotation invariance. This is done by investigating different partitioning schemes suitable to achieve rotation-invariant image representation and the proposal of a weight function for appropriate level contribution in image matching. In addition, the strengths of pyramid match kernel and spatial pyramid are combined to enhance matching accuracy between images. The existing kernel descriptors are modified and improved to achieve greater effectiveness, minimum noise effects, less dimensionality and lower computational complexity. A novel fusion approach is also proposed to combine the information related to all pixel attributes, before the descriptor extraction stage. Existing kernel descriptors are based only on gradient, colour and shape information. In this research project, a texture-based kernel descriptor is proposed by modifying an existing popular global texture descriptor. Finally, all the contributions are evaluated in an integrated system. The performances of the proposed methods are qualitatively and quantitatively evaluated on two to four different publicly available image databases. The experimental results show that the proposed methods are more effective and efficient in image representation than existing benchmark methods.
Doctor of Philosophy
APA, Harvard, Vancouver, ISO, and other styles
10

Ceci, Marcello <1983&gt. "Interpreting Judgements using Knowledge Representation Methods and Computational Models of Argument." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2013. http://amsdottorato.unibo.it/6106/1/Marcello_Ceci_tesi.pdf.

Full text
Abstract:
The goal of the present research is to define a Semantic Web framework for precedent modelling, by using knowledge extracted from text, metadata, and rules, while maintaining a strong text-to-knowledge morphism between legal text and legal concepts, in order to fill the gap between legal document and its semantics. The framework is composed of four different models that make use of standard languages from the Semantic Web stack of technologies: a document metadata structure, modelling the main parts of a judgement, and creating a bridge between a text and its semantic annotations of legal concepts; a legal core ontology, modelling abstract legal concepts and institutions contained in a rule of law; a legal domain ontology, modelling the main legal concepts in a specific domain concerned by case-law; an argumentation system, modelling the structure of argumentation. The input to the framework includes metadata associated with judicial concepts, and an ontology library representing the structure of case-law. The research relies on the previous efforts of the community in the field of legal knowledge representation and rule interchange for applications in the legal domain, in order to apply the theory to a set of real legal documents, stressing the OWL axioms definitions as much as possible in order to enable them to provide a semantically powerful representation of the legal document and a solid ground for an argumentation system using a defeasible subset of predicate logics. It appears that some new features of OWL2 unlock useful reasoning features for legal knowledge, especially if combined with defeasible rules and argumentation schemes. The main task is thus to formalize legal concepts and argumentation patterns contained in a judgement, with the following requirement: to check, validate and reuse the discourse of a judge - and the argumentation he produces - as expressed by the judicial text.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Methods of representation"

1

Kazuhiko, Koike, and Nihon Sūgakkai, eds. Combinatorial methods in representation theory. Tokyo: Published for the Mathematical Society of Japan by Kinokuniya, 2000.

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

Geometric methods in representation theory. Paris: Société Mathématique de France, 2012.

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

Topological methods in Galois representation theory. New York: Wiley, 1989.

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

Roach, Victor D. Guides to methods of graphical representation. Port of Spain: The Office, 1987.

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

Principal structures and methods of representation theory. Providence, R.I: American Mathematical Society, 2005.

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

Assem, Ibrahim, and Sonia Trepode, eds. Homological Methods, Representation Theory, and Cluster Algebras. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-74585-5.

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

Bent, Orsted, Schlichtkrull Henrik 1954-, and European School of Group Theory (1994 : Sønderborg, Denmark), eds. Algebraic and analytic methods in representation theory. San Diego: Academic Press, 1997.

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

Brion, Michel, and Shrawan Kumar. Frobenius Splitting Methods in Geometry and Representation Theory. Boston, MA: Birkhäuser Boston, 2005. http://dx.doi.org/10.1007/b137486.

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

A, Romberg Thomas, Fennema Elizabeth, and Carpenter Thomas P, eds. Integrating research on the graphical representation of functions. Hillsdale, N.J: Lawrence Erlbaum Associates, 1993.

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

Florack, Luc, Remco Duits, Geurt Jongbloed, Marie-Colette van Lieshout, and Laurie Davies, eds. Mathematical Methods for Signal and Image Analysis and Representation. London: Springer London, 2011. http://dx.doi.org/10.1007/978-1-4471-2353-8.

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

Book chapters on the topic "Methods of representation"

1

Pukelsheim, Friedrich. "Double-Proportional Divisor Methods: Technicalities." In Proportional Representation, 275–95. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-64707-4_15.

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

Pukelsheim, Friedrich. "Exposing Methods: The 2009 European Parliament Elections." In Proportional Representation, 1–29. Cham: Springer International Publishing, 2013. http://dx.doi.org/10.1007/978-3-319-03856-8_1.

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

Pukelsheim, Friedrich. "Divisor Methods of Apportionment: Divide and Round." In Proportional Representation, 55–70. Cham: Springer International Publishing, 2013. http://dx.doi.org/10.1007/978-3-319-03856-8_4.

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

Pukelsheim, Friedrich. "Quota Methods of Apportionment: Divide and Rank." In Proportional Representation, 71–79. Cham: Springer International Publishing, 2013. http://dx.doi.org/10.1007/978-3-319-03856-8_5.

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

Pukelsheim, Friedrich. "Exposing Methods: The 2014 European Parliament Elections." In Proportional Representation, 1–40. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-64707-4_1.

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

Pukelsheim, Friedrich. "Divisor Methods of Apportionment: Divide and Round." In Proportional Representation, 71–93. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-64707-4_4.

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

Pukelsheim, Friedrich. "Quota Methods of Apportionment: Divide and Rank." In Proportional Representation, 95–105. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-64707-4_5.

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

Feagin, James M. "Momentum Representation." In Quantum Methods with Mathematica®, 121–43. New York, NY: Springer New York, 1994. http://dx.doi.org/10.1007/978-1-4612-4328-1_11.

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

Feagin, James M. "Lattice Representation." In Quantum Methods with Mathematica®, 145–87. New York, NY: Springer New York, 1994. http://dx.doi.org/10.1007/978-1-4612-4328-1_12.

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

Treu, Siegfried. "Representation Models and Methods." In User Interface Design, 151–67. Boston, MA: Springer US, 1994. http://dx.doi.org/10.1007/978-1-4615-2429-8_7.

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

Conference papers on the topic "Methods of representation"

1

Nozawa, Kento, and Issei Sato. "Evaluation Methods for Representation Learning: A Survey." 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/776.

Full text
Abstract:
Representation learning enables us to automatically extract generic feature representations from a dataset to solve another machine learning task. Recently, extracted feature representations by a representation learning algorithm and a simple predictor have exhibited state-of-the-art performance on several machine learning tasks. Despite its remarkable progress, there exist various ways to evaluate representation learning algorithms depending on the application because of the flexibility of representation learning. To understand the current applications of representation learning, we review evaluation methods of representation learning algorithms. On the basis of our evaluation survey, we also discuss the future direction of representation learning. The extended version, https://arxiv.org/abs/2204.08226, gives more detailed discussions and a survey on theoretical analyses.
APA, Harvard, Vancouver, ISO, and other styles
2

Cheng, Nancy Yen-wen. "Teaching CAD with Language Learning Methods." In ACADIA 1997: Representation and Design. ACADIA, 1997. http://dx.doi.org/10.52842/conf.acadia.1997.173.

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

Santhosh Kumar, G., and S. H. Shiji. "DNA sequence representation methods." In the International Symposium. New York, New York, USA: ACM Press, 2010. http://dx.doi.org/10.1145/1722024.1722073.

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

Zhu, Hanhua. "Generalized Representation Learning Methods for Deep Reinforcement Learning." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/748.

Full text
Abstract:
Deep reinforcement learning (DRL) increases the successful applications of reinforcement learning (RL) techniques but also brings challenges such as low sample efficiency. In this work, I propose generalized representation learning methods to obtain compact state space suitable for RL from a raw observation state. I expect my new methods will increase sample efficiency of RL by understandable representations of state and therefore improve the performance of RL.
APA, Harvard, Vancouver, ISO, and other styles
5

Frakes, W. B., and P. B. Gandel. "Representation methods for software reuse." In the conference. New York, New York, USA: ACM Press, 1989. http://dx.doi.org/10.1145/74261.74283.

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

Xie, Ruobing, Zhiyuan Liu, Huanbo Luan, and Maosong Sun. "Image-embodied Knowledge Representation Learning." In Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/438.

Full text
Abstract:
Entity images could provide significant visual information for knowledge representation learning. Most conventional methods learn knowledge representations merely from structured triples, ignoring rich visual information extracted from entity images. In this paper, we propose a novel Image-embodied Knowledge Representation Learning model (IKRL), where knowledge representations are learned with both triple facts and images. More specifically, we first construct representations for all images of an entity with a neural image encoder. These image representations are then integrated into an aggregated image-based representation via an attention-based method. We evaluate our IKRL models on knowledge graph completion and triple classification. Experimental results demonstrate that our models outperform all baselines on both tasks, which indicates the significance of visual information for knowledge representations and the capability of our models in learning knowledge representations with images.
APA, Harvard, Vancouver, ISO, and other styles
7

Bates, Larry, Richard Cushman, Mark Hamilton, Jȩdrzej Śniatycki, Piotr Kielanowski, Anatol Odzijewicz, Martin Schlichenmaier, and Theodore Voronov. "Decomposition of the Quantization Representation of an SU(2) Action." In GEOMETRIC METHODS IN PHYSICS. AIP, 2008. http://dx.doi.org/10.1063/1.3043871.

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

Qian, Sheng, Guanyue Li, Wen-Ming Cao, Cheng Liu, Si Wu, and Hau San Wong. "Improving representation learning in autoencoders via multidimensional interpolation and dual regularizations." In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/453.

Full text
Abstract:
Autoencoders enjoy a remarkable ability to learn data representations. Research on autoencoders shows that the effectiveness of data interpolation can reflect the performance of representation learning. However, existing interpolation methods in autoencoders do not have enough capability of traversing a possible region between two datapoints on a data manifold, and the distribution of interpolated latent representations is not considered.To address these issues, we aim to fully exert the potential of data interpolation and further improve representation learning in autoencoders. Specifically, we propose the multidimensional interpolation to increase the capability of data interpolation by randomly setting interpolation coefficients for each dimension of latent representations. In addition, we regularize autoencoders in both the latent and the data spaces by imposing a prior on latent representations in the Maximum Mean Discrepancy (MMD) framework and encouraging generated datapoints to be realistic in the Generative Adversarial Network (GAN) framework. Compared to representative models, our proposed model has empirically shown that representation learning exhibits better performance on downstream tasks on multiple benchmarks.
APA, Harvard, Vancouver, ISO, and other styles
9

Jain, Paras, Ajay Jain, Tianjun Zhang, Pieter Abbeel, Joseph Gonzalez, and Ion Stoica. "Contrastive Code Representation Learning." In Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing. Stroudsburg, PA, USA: Association for Computational Linguistics, 2021. http://dx.doi.org/10.18653/v1/2021.emnlp-main.482.

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

Wang, Xichen, and Luzi Wang. "Representation Methods of Reusable Software Components." In 2010 Third International Joint Conference on Computational Science and Optimization. IEEE, 2010. http://dx.doi.org/10.1109/cso.2010.61.

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

Reports on the topic "Methods of representation"

1

Piliouras, Anastasia, and Tabatha Clevenger. Methods for Improving Representation of Arctic Coastal Environments. Office of Scientific and Technical Information (OSTI), September 2020. http://dx.doi.org/10.2172/1663166.

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

Powell, Warren B. Information Acquisition and Representation Methods for Real-Time Asset Management. Fort Belvoir, VA: Defense Technical Information Center, June 2008. http://dx.doi.org/10.21236/ada484498.

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

Zelenskyi, Arkadii A. Relevance of research of programs for semantic analysis of texts and review of methods of their realization. [б. в.], December 2018. http://dx.doi.org/10.31812/123456789/2884.

Full text
Abstract:
One of the main tasks of applied linguistics is the solution of the problem of high-quality automated processing of natural language. The most popular methods for processing natural-language text responses for the purpose of extraction and representation of semantics should be systems that are based on the efficient combination of linguistic analysis technologies and analysis methods. Among the existing methods for analyzing text data, a valid method is used by the method using a vector model. Another effective and relevant means of extracting semantics from the text and its representation is the method of latent semantic analysis (LSA). The LSA method was tested and confirmed its effectiveness in such areas of processing the native language as modeling the conceptual knowledge of the person; information search, the implementation of which LSA shows much better results than conventional vector methods.
APA, Harvard, Vancouver, ISO, and other styles
4

Weinan, E. Overcoming the Curse of Dimension: Methods Based on Sparse Representation and Adaptive Sampling. Fort Belvoir, VA: Defense Technical Information Center, February 2011. http://dx.doi.org/10.21236/ada564054.

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

Chervinchuk, Alina. THE CONCEPT OF ENEMY: REPRESENTATION IN THE UKRAINIAN MILITARY DOCUMENTARIES. Ivan Franko National University of Lviv, February 2021. http://dx.doi.org/10.30970/vjo.2021.49.11063.

Full text
Abstract:
Research methodology. The following methods were used in this research: general scientific methods (descriptive, analysis, synthesis, comparison) and special (structural, hermeneutic, narrative, method of content analysis). We identified words related to the concept of the enemy and determined the context in which they are used by the authors of the collections Results. The formats of reflection of military reality in collections of military documentaries are investigated. It is emphasized that the authors-observers of events as professional communicators form a vision of events based on categories understandable to the audience – «own» and «others». Instead, the authors-participants go events have more creative space and pay more attention to their own emotional state and reflections. It is defined how the enemy is depicted and what place he occupies in the military reality represented by the authors. It is emphasized that the authors reflect the enemy in different ways. In particular, the authors-observers of the events tried to form a comprehensive vision of the events, and therefore paid much attention to the opposite side of the military conflict. Authors-participants of the events tend to show the enemy as a mass to be opposed. In such collections, the enemy is specified only in the presence of evidence confirming the presence of Russians or militants. Novelty. The research for the first time investigates the methods of representation of mi­litary activity in the collections of Ukrainian military documentaries. The article is devoted to the analysis of how the authors represent the enemy. Practical importance. The analysis of collections of military documentaries will allow to study the phenomenon of war and to trace the peculiarities of the authors’ representation of military reality.
APA, Harvard, Vancouver, ISO, and other styles
6

Mishra, Umakant, and Sagar Gautam. Improving and testing machine learning methods for benchmarking soil carbon dynamics representation of land surface models. Office of Scientific and Technical Information (OSTI), September 2022. http://dx.doi.org/10.2172/1891184.

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

Tselioudis, George. Advancing cloud lifecycle representation in numerical models using innovative analysis methods that bridge arm observations over a breadth of scales. Office of Scientific and Technical Information (OSTI), March 2016. http://dx.doi.org/10.2172/1240272.

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

Kollias, Pavlos. Advancing Clouds Lifecycle Representation in Numerical Models Using Innovative Analysis Methods that Bridge ARM Observations and Models Over a Breadth of Scales. Office of Scientific and Technical Information (OSTI), September 2016. http://dx.doi.org/10.2172/1319810.

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

Kud, A. A. Figures and Tables. Reprinted from “Comprehensive сlassification of virtual assets”, A. A. Kud, 2021, International Journal of Education and Science, 4(1), 52–75. KRPOCH, 2021. http://dx.doi.org/10.26697/reprint.ijes.2021.1.6.a.kud.

Full text
Abstract:
Figure. Distributed Ledger Token Accounting System. Figure. Subjects of Social Relations Based on the Decentralized Information Platform. Figure. Derivativeness of a Digital Asset. Figure. Semantic Features of the Concept of a “Digital Asset” in Economic and Legal Aspects. Figure. Derivativeness of Polyassets and Monoassets. Figure. Types of Tokenized Assets Derived from Property. Figure. Visual Representation of the Methods of Financial and Management Accounting of Property Using Various Types of Tokenized Assets. Figure. Visual Representation of the Classification of Virtual Assets Based on the Complexity of Their Nature. Table. Comparison of Properties of Various Types of Virtual Assets of the Distributed Ledger Derivative of the Original Asset. Table. Main Properties and Parameters of Types of Tokenized Assets. Table. Classification of Virtual Assets as Tools for Implementing the Methods of Financial and Management Accounting of Property.
APA, Harvard, Vancouver, ISO, and other styles
10

Yan, Yujie, and Jerome F. Hajjar. Automated Damage Assessment and Structural Modeling of Bridges with Visual Sensing Technology. Northeastern University, May 2021. http://dx.doi.org/10.17760/d20410114.

Full text
Abstract:
Recent advances in visual sensing technology have gained much attention in the field of bridge inspection and management. Coupled with advanced robotic systems, state-of-the-art visual sensors can be used to obtain accurate documentation of bridges without the need for any special equipment or traffic closure. The captured visual sensor data can be post-processed to gather meaningful information for the bridge structures and hence to support bridge inspection and management. However, state-of-the-practice data postprocessing approaches require substantial manual operations, which can be time-consuming and expensive. The main objective of this study is to develop methods and algorithms to automate the post-processing of the visual sensor data towards the extraction of three main categories of information: 1) object information such as object identity, shapes, and spatial relationships - a novel heuristic-based method is proposed to automate the detection and recognition of main structural elements of steel girder bridges in both terrestrial and unmanned aerial vehicle (UAV)-based laser scanning data. Domain knowledge on the geometric and topological constraints of the structural elements is modeled and utilized as heuristics to guide the search as well as to reject erroneous detection results. 2) structural damage information, such as damage locations and quantities - to support the assessment of damage associated with small deformations, an advanced crack assessment method is proposed to enable automated detection and quantification of concrete cracks in critical structural elements based on UAV-based visual sensor data. In terms of damage associated with large deformations, based on the surface normal-based method proposed in Guldur et al. (2014), a new algorithm is developed to enhance the robustness of damage assessment for structural elements with curved surfaces. 3) three-dimensional volumetric models - the object information extracted from the laser scanning data is exploited to create a complete geometric representation for each structural element. In addition, mesh generation algorithms are developed to automatically convert the geometric representations into conformal all-hexahedron finite element meshes, which can be finally assembled to create a finite element model of the entire bridge. To validate the effectiveness of the developed methods and algorithms, several field data collections have been conducted to collect both the visual sensor data and the physical measurements from experimental specimens and in-service bridges. The data were collected using both terrestrial laser scanners combined with images, and laser scanners and cameras mounted to unmanned aerial vehicles.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Methods of representation' 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