Institutions
|
About Us
|
Help
|
Gaeilge
0
1000
Home
Browse
Advanced Search
Search History
Marked List
Statistics
A
A
A
Show search options
Hide search options
Search using:
All
Any
None of these
Exact Phrase
in
Keyword (All Fields)
Title
Author
Subject
Institution
Funder
All
Any
None of these
Exact Phrase
in
Keyword (All Fields)
Title
Author
Subject
Institution
Funder
All
Any
None of these
Exact Phrase
in
Keyword (All Fields)
Title
Author
Subject
Institution
Funder
From
2104
2027
2019
2018
2017
2016
2015
2014
2013
2012
2011
2010
2009
2008
2007
2006
2005
2004
2003
2002
2001
2000
1999
1998
1997
1996
1995
1994
1993
1992
1991
1990
1989
1988
1987
1986
1985
1984
1983
1982
1981
1980
1979
1978
1977
1976
1975
1974
1973
1972
1971
1970
1969
1968
1967
1966
1965
1964
1963
1962
1961
1960
1959
1958
1957
1956
1955
1954
1953
1952
1951
1950
1949
1948
1947
1946
1945
1944
1943
1942
1941
1940
1939
1938
1937
1936
1935
1934
1933
1932
1931
1930
1929
1928
1927
1926
1925
1924
1923
1920
1919
1917
1916
1915
1914
1913
1912
1911
1910
1909
1908
1907
1906
1905
1904
1903
1902
1901
1900
1899
1898
1897
1896
1895
1894
1893
1892
1891
1890
1889
1888
1887
1886
1885
1884
1883
1882
1881
1880
1879
1878
1877
1876
1875
1874
1873
1872
1871
1870
1869
1868
1867
1866
1865
1864
1862
1861
1860
1859
1858
1857
1856
1855
1854
1853
1852
1851
1850
1849
1846
1842
1840
1835
1827
1825
1821
1820
1818
1817
1815
1812
1811
1810
1809
1808
1807
1806
1805
1804
1803
1802
1801
1800
1792
1790
1770
1713
1111
1000
To
2019
2104
2027
2018
2017
2016
2015
2014
2013
2012
2011
2010
2009
2008
2007
2006
2005
2004
2003
2002
2001
2000
1999
1998
1997
1996
1995
1994
1993
1992
1991
1990
1989
1988
1987
1986
1985
1984
1983
1982
1981
1980
1979
1978
1977
1976
1975
1974
1973
1972
1971
1970
1969
1968
1967
1966
1965
1964
1963
1962
1961
1960
1959
1958
1957
1956
1955
1954
1953
1952
1951
1950
1949
1948
1947
1946
1945
1944
1943
1942
1941
1940
1939
1938
1937
1936
1935
1934
1933
1932
1931
1930
1929
1928
1927
1926
1925
1924
1923
1920
1919
1917
1916
1915
1914
1913
1912
1911
1910
1909
1908
1907
1906
1905
1904
1903
1902
1901
1900
1899
1898
1897
1896
1895
1894
1893
1892
1891
1890
1889
1888
1887
1886
1885
1884
1883
1882
1881
1880
1879
1878
1877
1876
1875
1874
1873
1872
1871
1870
1869
1868
1867
1866
1865
1864
1862
1861
1860
1859
1858
1857
1856
1855
1854
1853
1852
1851
1850
1849
1846
1842
1840
1835
1827
1825
1821
1820
1818
1817
1815
1812
1811
1810
1809
1808
1807
1806
1805
1804
1803
1802
1801
1800
1792
1790
1770
1713
1111
1000
Optionally, filter by:
(Leave unchecked to search all fields)
Item Type
Book
Book chapter
Conference item
Contribution to newspaper/magazine
Doctoral thesis
Journal article
Master thesis (research)
Master thesis (taught)
Multimedia
Patent
Report
Review
Working paper
Other
Peer Review Status
Peer reviewed
Non peer reviewed
Unknown
Institution
All Ireland Public Health Repository
Connacht-Ulster Alliance
Dublin City University
Dublin Institute of Technology
Dundalk Institute of Technology
Lenus
Marine Institute
Mary Immaculate College
Maynooth University
NUI Galway
Royal College of Surgeons in Ireland
Teagasc
Trinity College Dublin
University College Cork
University College Dublin
University of Limerick
Funder
Enterprise Ireland (EI)
Environmental Protection Agency (EPA)
Health Research Board (HRB)
Higher Education Authority (HEA)
Irish Aid
Irish Research Council for Humanities and Social Sciences (IRCHSS)
Irish Research Council for Science Engineering and Technology (IRCSET)
Marine Institute
Science Foundation Ireland (SFI)
Teagasc
Language
Irish
English
Bulgarian
Catalan; Valencian
Czech
Danish
Dutch; Flemish
French
German
Greek, Modern (1453-)
Croatian
Interlingue; Occidental
Italian
Japanese
Norwegian
Romanian; Moldavian; Moldovan
Spanish; Castilian
Serbian
Current Search:
All of 'computer' and 'science' in all fields;
2969 items found
Sort by
Relevance
Title
Author
Item type
Date
Institution
Peer review status
Language
Order
Ascending
Descending
25
50
100
per page
9
10
11
12
13
14
15
16
17
18
19
Bibtex
CSV
EndNote
RefWorks
RIS
XML
Displaying Results 326 - 350 of 2969 on page 14 of 119
Marked
Mark
A Unified Security Framework for Networked Applications
(2003)
Abendroth, Joerg; Jensen, Christian D.
A Unified Security Framework for Networked Applications
(2003)
Abendroth, Joerg; Jensen, Christian D.
Abstract:
TCD-CS-2003-11
Various security models have been proposed for different types of applications and numerous types of execution environments. These models are typically reinforced by adding code to the application, which authenticates principals, authorises operations and establishes secure communication among distributed software components (e.g., clients and servers). This code is often application and context-specific, which makes it difficult to integrate an application with other each other. In this paper we propose a new unified access control mechanism that supports most of the existing security models and offers a number of additional controls that are not normally provided by security mechanisms. Moreover, the proposed mechanism integrates well with existing programming paradigms for distributed application, e.g., client/server technology and component based programming. This means that it can be seamlessly integrated with most existing distributed applications. We have i...
http://hdl.handle.net/2262/12539
Marked
Mark
Partial Outsourcing: A New Paradigm for Access Control
(2003)
Abendroth, Joerg; Jensen, Christian D.
Partial Outsourcing: A New Paradigm for Access Control
(2003)
Abendroth, Joerg; Jensen, Christian D.
Abstract:
TCD-CS-2003-12
Various security models have been proposed in recent years for different purposes. Each of these aims to ease administration by introducing new types of security policies and models. This increases the complexity a system administrator is faced with. Ultimately, the resources expended in choosing amongst all of these models leads to less efficient administration. In this paper, we propose a new access control paradigm, which is already well established in virus and SPAM protection as partial delegation of administration to external expertise centres. Well-known vulnerabilities can be filtered out and known sources of attacks can be automatically blocked. We describe how partial outsourcing can be achieved in a secure way. A framework, which enables this process has already been developed.
http://hdl.handle.net/2262/12540
Marked
Mark
Risk Probability Estimating Based on Clustering
(2003)
Chen, Yong; Jensen, Christian D.; Gray, Elizabeth; Seigneur, Jean-Marc
Risk Probability Estimating Based on Clustering
(2003)
Chen, Yong; Jensen, Christian D.; Gray, Elizabeth; Seigneur, Jean-Marc
Abstract:
TCD-CS-2003-17
Ubiquitous computing environments are highly dynamic, with new unforeseen circumstances and constantly changing environments, which introduces new risks that cannot be assessed through traditional means of risk analysis. Mobile entities in a ubiquitous computing environment require the ability to perform an autonomous assessment of the risk incurred by a specific interaction with another entity in a given context. This assessment will allow a mobile entity to decide whether sufficient evidence exists to mitigate the risk and allow the interaction to proceed. Such evidence might include records of prior experiences, recommendations from a trusted entity or the reputation of the other entity. In this paper we propose a dynamic mechanism for estimating the risk probability of a certain interaction in a given environment using hybrid neural networks. We argue that traditional risk assessment models from the insurance industry do not directly apply to ubiquitous comput...
http://hdl.handle.net/2262/12542
Marked
Mark
On the use of CBR in optimisation problems such as the TSP
(1995)
Cunningham, Padraig; Smyth, Barry; Hurley, Neil
On the use of CBR in optimisation problems such as the TSP
(1995)
Cunningham, Padraig; Smyth, Barry; Hurley, Neil
Abstract:
TCD-CS-95-19
The particular strength of CBR is normally considered to be its use in weak theory domains where solution quality is compiled into cases and is reusable. In this paper we explore an alternative use of CBR in optimisation problems where cases represent highly optimised structures in a huge highly constrained solution space. Our analysis focuses on the Travelling Salesman Problem where difficulty arises from the computational complexity of the problem rather than any difficulty associated with the domain theory. We find that CBR is good for producing medium quality solutions in very quick time. We have difficulty getting CBR to produce high quality solutions because solution quality seems to be lost in the adaptation process. We also argue that experiments with CBR on transparent problems such as the TSP tell us a lot about aspects of CBR such as; the quality of CBR solutions, the coverage that cases in the casebase offer and the utility of extending a case-base.
http://hdl.handle.net/2262/19021
Marked
Mark
Proof methodologies for behavioural equivalence in DPI
(2005)
HENNESSY, MATTHEW
Proof methodologies for behavioural equivalence in DPI
(2005)
HENNESSY, MATTHEW
Abstract:
We focus on techniques for proving behavioural equivalence between systems in Dpi, a distributed version of the picalculus in which processes may migrate between dynamically created locations, and where resource access policies are implemented by means of capability types. We devise a tractable collection of auxiliary proof methods, relying mainly on the use of bisimulations up-to -reductions, which considerably relieve the burden of exhibiting witness bisimulations. Using such methods we model simple distributed protocols, such as crossing a firewall, the interaction between a server and its clients, metaservers installing memory services, and address their correctness in a relatively simple manner.
http://hdl.handle.net/2262/56467
Marked
Mark
Architecture for Location Independent CORBA Environments
(1998)
Cunningham, Raymond
Architecture for Location Independent CORBA Environments
(1998)
Cunningham, Raymond
Abstract:
The construction of distributed applications is a complex and time consuming task, which has been addressed by the Object Management Group's Common Object Request Broker Architecture. However implementations of this standard are typically designed for stationary hosts connected to a fixed network and do not take into account the problems associated with mobile computing. These problems include limited processing resources on the mobile host and the use of unreliable and low-bandwidth wireless networks. A full CORBA implementation is unsuitable for use on mobile hosts, such as laptops and personal digital assistants, since it is too resource intensive. It is however desirable for mobile hosts to be able to interopate with existing CORBA applications while simultaneously taking advantage of mobility. This dissertation describes the design and implementation of a collection of components suitable for building applications, which are capable of interoperating with CORBA implementat...
http://hdl.handle.net/2262/737
Marked
Mark
Traffic-Aware Channel Assignment for Multi-Radio Wireless Networks
(2012)
DA SILVA, LUIZ
Traffic-Aware Channel Assignment for Multi-Radio Wireless Networks
(2012)
DA SILVA, LUIZ
Abstract:
This paper studies channel assignment in multi-hop wireless networks in which nodes are equipped with multiple radios, each of which can be assigned to a channel. We argue for an approach that rst assigns channels independently of tra c, to achieve basic connectivity and support light loads such as control tra c, and then dynamically assigns channels to the remaining radios in response to tra c demand. The objective is to balance the need for a stable baseline topology and the desire to maximize throughput by dynamically adapting the topology to current network conditions. We call this a tra c-aware (TA) approach, in contrast to both tra c-independent (TI) and tra c-driven (TD) channel assignment and topology control schemes found in the literature. We formulate the problem as a two-stage mixed integer linear program (MILP), and nd that our approach supports good connectivity and data rates comparable to those achieved with a TD channel assignment, while achieving lower resource u...
http://hdl.handle.net/2262/68256
Marked
Mark
Subtyping and Locality in Distributed Higher Order Mobile Processes (extended abstract).
(1999)
HENNESSY, MATTHEW
Subtyping and Locality in Distributed Higher Order Mobile Processes (extended abstract).
(1999)
HENNESSY, MATTHEW
Abstract:
This paper studies one important aspect of distributed systems, locality, using a calculus of distributed higher-order processes in which not only basic values or channels, but also parameterised processes are transferred across distinct locations. An integration of the subtyping of l-calculus and IO-subtyping of the p-calculus offers a tractable tool to control the locality of channel names in the presence of distributed higher order processes. Using a local restriction on channel capabilities together with a subtyping relation, locality is preserved during reductions even if we allow new receptors to be dynamically created by instantiation of arbitrary higher-order values and processes. We also show that our method is applicable to a more general channel constraints studied by Sewell in a higher-order distributed setting.
http://hdl.handle.net/2262/56481
Marked
Mark
Type-safe execution of mobile agents in anonymous networks (Extended Abstract).
(1999)
HENNESSY, MATTHEW
Type-safe execution of mobile agents in anonymous networks (Extended Abstract).
(1999)
HENNESSY, MATTHEW
Abstract:
We study type-safety properties of open distributed systems of mobile agents, where not all sites are known to be well-typed. We adopt the underlying model of an anonymous network, allowing that code may be corrupted on transmission and that the source of incoming code is unknowable. Nonetheless, we are able to guarantee a weak form of type-safety at ?good? sites using a mix of static and dynamic typing.
http://hdl.handle.net/2262/56486
Marked
Mark
Adding Recursion to Dpi. (Extended Abstract)
(2006)
HENNESSY, MATTHEW
Adding Recursion to Dpi. (Extended Abstract)
(2006)
HENNESSY, MATTHEW
Abstract:
Dpi is a distributed version of the pi-calculus, in which processes are explicitly located, and a migration construct may be used for moving between locations. We argue that adding a recursion operator to the language increases significantly its descriptive power. But typing recursive processes requires the use of potentially infinite types. We show that the capability-based typing system of Dpi can be extended to co-inductive types so that recursive processes can be successfully supported. We also show that, as in the pi-calculus, recursion can be implemented via iteration. This translation improves on the standard ones by being compositional but still requires co-inductive types and comes with a significant migration overhead in our distributed setting.
http://hdl.handle.net/2262/56468
Marked
Mark
Concurrent Models of Flash Memory Device Behaviour
(2009)
BUTTERFIELD, ANDREW
Concurrent Models of Flash Memory Device Behaviour
(2009)
BUTTERFIELD, ANDREW
Abstract:
We present a CSP model of the internal behaviour of Flash Memory, based on its specification by the Open Nand-Flash Interface (ONFi) consortium. This contributes directly to the low-level modelling of the data-storage technology that is the target of the POSIX filestore mini-challenge. The key objective was to ensure that the internal behaviour was well-specified, and that it was consistent with the specification of the external interface of such devices. The FDR toolkit was used to perform the revelent refinement/model-checking. In addition to uncovering errors and possible sources of misinterpretation in the ONFi standard, this work also describes a methodology for model data-entry based on a ?state-chart? dialect of XML (SCXML) using XSLT to translate into CSP, and HTML, to support validation.
http://hdl.handle.net/2262/38386
Marked
Mark
Concurrent semantics for structured design methods
(1996)
Nixon, Patrick
Concurrent semantics for structured design methods
(1996)
Nixon, Patrick
Abstract:
TCD-CS-96-03
Design methods can be ambiguous due to di#11;erent interpretations of symbols or concepts. This paper presents a formal semantics for the Ward/Mellor Structured Analysis Method for Real Time systems. These semantics ensures that an unambiguous meaning can be attributed to a particular design. Speci#12;cally, it ensures that concurrent and real-time properties of the design can be captured and analysed. This paper concentrates on the concurrent properties.
http://hdl.handle.net/2262/12950
Marked
Mark
Retrieval Issues in Real-World CBR Applications How far can we go with discrimination-nets?
(1993)
Cunningham, Padraig; Smyth, Barry; Finn, Donal; Cahill, Eamonn
Retrieval Issues in Real-World CBR Applications How far can we go with discrimination-nets?
(1993)
Cunningham, Padraig; Smyth, Barry; Finn, Donal; Cahill, Eamonn
Abstract:
TCD-CS-93-04
We propose that analogical reasoning and case based reasoning (CBR) tasks can be usefully characterised as a continuum reflecting the remoteness of the remindings involved. Remindings in CBR are generally between semantically close cases while analogical reasoning depends on more abstract remindings. Rather than there being a strict demarcation between CBR and analogical reasoning on these grounds (with analogical reasoning concerned with inter domain remindings and CBR dealing with remindings within one domain) there is a continuum of cognitive tasks that draw on past experience during reasoning. Simpler tasks like diagnosis and classification are located near the CBR end while more complex tasks like creative design are located towards the analogical reasoning end. The question is how far towards the abstract end of the continuum can the index-based retrieval techniques that are effective in CBR be used (eg. discrimination networks). We are considering episode ret...
http://hdl.handle.net/2262/12638
Marked
Mark
Student Work Placement: Friend or Foe? A study of the perceptions of university students on industrial work placement
(2013)
O'Briain, Sian; Bergin, Susan; Bourgoin, Martina; Mooney, Aidan; Murray, Paula; Zh...
Student Work Placement: Friend or Foe? A study of the perceptions of university students on industrial work placement
(2013)
O'Briain, Sian; Bergin, Susan; Bourgoin, Martina; Mooney, Aidan; Murray, Paula; Zhao, Qingyang
Abstract:
At the National University of Ireland Maynooth, Computer Science and Software Engineering students are required to undertake an industrial work placement module as part of their course. The work placement is typically six to eighteen months long and takes place in the penultimate year of the degree. This paper evaluates students’ perception of the quality of the learning experience they received through work placement. The voice of many key players involved in the process is captured, including, the students themselves, members of the academic department and the Industrial Work Placement Office; and importantly this paper is authored by representatives of each of these groups. In particular, the paper evaluates the types of preparations students make prior to commencing a placement, the transferable skills acquired and improved during their placement, and student perceptions of the advantages and disadvantages of their placement. A mixed data acquisition model is used for gathering ...
http://eprints.maynoothuniversity.ie/5030/
Marked
Mark
Arís: Analogical Reasoning for reuse of Implementation & Specification.
(2013)
Pitu, M.; Grijincu, D.; Li, P.; Saleem, A.; Monahan, Rosemary; O'Donoghue, Diarmui...
Arís: Analogical Reasoning for reuse of Implementation & Specification.
(2013)
Pitu, M.; Grijincu, D.; Li, P.; Saleem, A.; Monahan, Rosemary; O'Donoghue, Diarmuid P.
Abstract:
Formal methods and formal verification of source code has been used extensively in the past few years to create dependable software systems. However, although formal languages like Spec# or JML are quite popular, the set of verified implementations remains small. Our work aims to automate some of the steps involved in writing specifications and their implementations, by reusing existing verified programs i.e. for a given implementation, we aim to retrieve similar verified code and then reapply the missing specification that accompanies that code. Similarly, for a given specification, we aim to retrieve code with a similar specification and use its implementation to generate the missing implementation.
http://eprints.maynoothuniversity.ie/4497/
Marked
Mark
Martingale Families and Dimension in P
(2008)
Moser, Philippe
Martingale Families and Dimension in P
(2008)
Moser, Philippe
Abstract:
We introduce a new measure notion on small complexity classes (called F-measure), based on martingale families, that gets rid of some drawbacks of previous measure notions: it can be used to define dimension because martingale families can make money on all strings, and it yields random sequences with an equal frequency of 0’s and 1’s. As applications to F-measure, we answer a question raised in [1] by improving their result to: for almost every language A decidable in subexponential time, PA = BPPA. We show that almost all languages in PSPACE do not have small non-uniform complexity. We compare F-measure to previous notions and prove that martingale families are strictly stronger than Γ-measure [1], we also discuss the limitations of martingale families concerning finite unions. We observe that all classes closed under polynomial many-one reductions have measure zero in EXP iff they have measure zero in SUBEXP. We use martingale families to introduce a natural generalization of Lut...
http://eprints.maynoothuniversity.ie/3502/
Marked
Mark
Parallel and sequential optical computing
(2008)
Woods, Damien; Naughton, Thomas J.
Parallel and sequential optical computing
(2008)
Woods, Damien; Naughton, Thomas J.
Abstract:
We present a number of computational complexity results for an optical model of computation called the continuous space machine. We also describe an implementation for an optical computing algorithm that can be easily defined within the model. Our optical model is designed to model a wide class of optical computers, such as matrix vector multipliers and pattern recognition architectures. It is known that the model solves intractable PSPACE problems in polynomial time, and NC problems in polylogarithmic time. Both of these results use large spatial resolution (number of pixels). Here we look at what happens when we have constant spatial resolution. It turns out that we obtain similar results by exploiting other resources, such as dynamic range and amplitude resolution. However, with certain other restrictions we essentially have a sequential device. Thus we are exploring the border between parallel and sequential computation in optical computing. We describe an optical architecture f...
http://eprints.maynoothuniversity.ie/2821/
Marked
Mark
RF SDR for Wideband PMR
(2009)
Gao, Ling; Farrell, Ronan
RF SDR for Wideband PMR
(2009)
Gao, Ling; Farrell, Ronan
Abstract:
TErrestrial Trunked Radio (TETRA) offers capabilities equivalent to the second generation of mobile phones with voice and limited data capabilities. TETRA needs to evolve to satisfy increasing user demand for new services and facilities as well as gleaning the benefits of new technology. An initial enhancement (TETRA Enhanced Data Service, TEDS) has been agreed. The enhanced TETRA services allows for more flexibility in the communication modes used, so as to provide adaptability in applications. We propose that it is possible to deploy Software Defined Radio (SDR) technologies into the basestation to economically provide this level of flexibility and to further extend the capability of TETRA services by deploying a WiMAX channel into the proposed TETRA tuning range. Thus delivering true broadband data service while simultaneously supporting the original and enhanced TETRA services.
http://eprints.maynoothuniversity.ie/2592/
Marked
Mark
Automatic Recognition of Head Movement Gestures in Sign Language Sentences
(2009)
Kelly, Daniel; Reilly Delannoy, Jane; McDonald, John; Markham, Charles
Automatic Recognition of Head Movement Gestures in Sign Language Sentences
(2009)
Kelly, Daniel; Reilly Delannoy, Jane; McDonald, John; Markham, Charles
Abstract:
A novel system for the recognition of head movement gestures used to convey non-manual information in sign language is presented. We propose a framework for recognizing a set of head movement gestures and identifying head movements outside of this set. Experiments show our proposed system is capable of classifying three different head movement gestures and identifying 15 other head movements as movements which are outside of the training set. In this paper we perform experiments to investigate the best feature vectors for discriminating between positive a negative head movement gestures and a ROC analysis of the systems classifications performance showed an area under the curve measurement of 0:936 for the best performing feature vector.
http://eprints.maynoothuniversity.ie/2548/
Marked
Mark
Filtered Gaussian Processes for Learning with Large Data-Sets
(2005)
Shi, Jian Qing; Murray-Smith, Roderick; Titterington, D. Mike; Pearlmutter, Barak A.
Filtered Gaussian Processes for Learning with Large Data-Sets
(2005)
Shi, Jian Qing; Murray-Smith, Roderick; Titterington, D. Mike; Pearlmutter, Barak A.
Abstract:
Kernel-based non-parametric models have been applied widely over recent years. However, the associated computational complexity imposes limitations on the applicability of those methods to problems with large data-sets. In this paper we develop a filtering approach based on a Gaussian process regression model. The idea is to generate a smalldimensional set of filtered data that keeps a high proportion of the information contained in the original large data-set. Model learning and prediction are based on the filtered data, thereby decreasing the computational burden dramatically.
http://eprints.maynoothuniversity.ie/2511/
Marked
Mark
Polylog space compression is incomparable with Lempel-Ziv and pushdown compression
(2009)
Mayordomo, Elvira; Moser, Philippe
Polylog space compression is incomparable with Lempel-Ziv and pushdown compression
(2009)
Mayordomo, Elvira; Moser, Philippe
Abstract:
This paper considers online compression algorithms that use at most polylogarithmic space (plogon). These algorithms correspond to compressors in the data stream model. We study the performance attained by these algorithms and show they are incomparable with both pushdown compressors and the Lempel-Ziv compression algorithm.
http://eprints.maynoothuniversity.ie/2498/
Marked
Mark
A Multi-lingual pedestrian navigation and campus guidance system using CloudMade API
(2009)
Jacob, Ricky; Zheng, Jianghua; Winstanley, Adam C.; Ciepłuch, Błażej; Mooney, Peter
A Multi-lingual pedestrian navigation and campus guidance system using CloudMade API
(2009)
Jacob, Ricky; Zheng, Jianghua; Winstanley, Adam C.; Ciepłuch, Błażej; Mooney, Peter
Abstract:
The importance of a good campus navigation system cannot be ignored as the users will vary from students, special guests, visitors and multi-lingual attendees. Providing a navigation and guidance system with a multi-lingual interface helps in personalizing the system according to the user’s preference for the language of interaction. [Pascal Neis, 2009] is an example of a multi-lingual routing application for navigation developed at the University of Bonn where optimal paths are generated with textual description in the user’s preferred language. Natural language generation (NLG) is the subfield of artificial intelligence and computational linguistics. It is concerned with the construction of computer systems that can produce understandable texts in human languages and form some underlying non-linguistic representation of information in order to meet specified communicative goals [McDonald D.D., 1987].
http://eprints.maynoothuniversity.ie/2489/
Marked
Mark
Using a fully open source approach to working with OpenStreetMap
(2010)
Ciepłuch, Błażej; Mooney, Peter; Jacob, Ricky; Corcoran, Padraig; Winstanley, Adam C.
Using a fully open source approach to working with OpenStreetMap
(2010)
Ciepłuch, Błażej; Mooney, Peter; Jacob, Ricky; Corcoran, Padraig; Winstanley, Adam C.
Abstract:
OpenStreetMap is a very exciting and vibrant project aiming to make accessing geographic data easier. Our research group at the Department of Computer Science NUI Maynooth Ireland is carrying out research into a broad range of topics including: map data generalisation, geographic shape complexity, web map services, map-based interface for pedestrian navigation. One of the common themes across this research is the use of OpenStreetMap as the principal source of geospatial data. In this paper we describe how our research productivity, research collaboration, and general data interoperability have been greatly enhanced from our early adoption of a fully open source GIS approach to working with OpenStreetMap. While one can work successfully with OpenStreetMap in non-Open Source environments the flexibility offered by an open source approach is a major advantage. This flexibility is delivered in many flavours including: a wide choice of software, inter-connectability of software packages...
http://eprints.maynoothuniversity.ie/2478/
Marked
Mark
Stereo vision based approach for extracting features from digital holograms
(2009)
Pitkäaho, Tomi; Naughton, Thomas J.
Stereo vision based approach for extracting features from digital holograms
(2009)
Pitkäaho, Tomi; Naughton, Thomas J.
Abstract:
With digital holography one can record and reconstruct real world three-dimensional (3D) objects [1,2]. The recorded interference pattern includes information about both amplitude and phase of a wavefront reflected from or transmitted through the object. However, some of the hologram capture setups pose a problem for the reliable reconstruction of quantitative phase information. This can be because the twin image or noise corrupts the reconstructed phase. In such cases it is usual that only amplitude is reconstructed and used as the basis for metrology. A focus criterion is often applied to this reconstructed amplitude to extract depth information from the sensed 3D scene [3,4]. In this paper we present an alternative technique based on applying conventional computer stereo vision algorithms to amplitude reconstructions. We show the effectiveness of our technique using digital holograms of both macroscopic and microscopic real-world 3D objects. We discuss sensitivity to the depth of...
http://eprints.maynoothuniversity.ie/2443/
Marked
Mark
Viewpoint Invariant Features from Single Images Using 3D Geometry
(2009)
Cao, Yanpeng; McDonald, John
Viewpoint Invariant Features from Single Images Using 3D Geometry
(2009)
Cao, Yanpeng; McDonald, John
Abstract:
In this paper we present a novel approach for generating viewpoint invariant features from single images and demonstrate their application for robust matching over widely separated views. The key idea consists of retrieving building structure from single images and then utlising the recovered 3D geometry to improve the performances of feature extraction and matching. Urban environments usually contain many structured regularities, so that the images of those environments contain straight parallel lines and vanishing points, which can be efficiently exploited for 3D reconstruction. We present an effective scheme to recover 3D planar surfaces using the extracted line segments and their associated vanishing points. The viewpoint invariant features are then computed on the normalized front-parallel views of the obtained 3D planes. The advantages of the proposed approach include: (1) the new feature is very robust against perspective distortions and viewpoint changes due to its considera...
http://eprints.maynoothuniversity.ie/2398/
Displaying Results 326 - 350 of 2969 on page 14 of 119
9
10
11
12
13
14
15
16
17
18
19
Bibtex
CSV
EndNote
RefWorks
RIS
XML
Item Type
Book (8)
Book chapter (180)
Conference item (1364)
Doctoral thesis (159)
Journal article (702)
Master thesis (research) (124)
Master thesis (taught) (113)
Multimedia (10)
Report (221)
Review (2)
Working paper (3)
Other (83)
Institution
Dublin City University (321)
NUI Galway (74)
Maynooth University (726)
Trinity College Dublin (728)
University College Cork (62)
University College Dublin (215)
University of Limerick (262)
Dublin Institute of Technology (458)
Lenus (2)
Dundalk Institute of Techno... (111)
Marine Institute (1)
Teagasc (1)
Royal College of Surgeons i... (5)
Connacht-Ulster Alliance (3)
Peer Review Status
Peer reviewed (2054)
Non peer reviewed (578)
Unknown (337)
Year
2017 (48)
2016 (88)
2015 (83)
2014 (116)
2013 (143)
2012 (209)
2011 (259)
2010 (296)
2009 (375)
2008 (205)
2007 (176)
2006 (178)
2005 (181)
2004 (129)
2003 (87)
2002 (75)
2001 (57)
2000 (41)
1999 (51)
1998 (27)
1997 (20)
1996 (19)
1995 (22)
1994 (18)
1993 (18)
built by Enovation Solutions