2024-03-29T08:49:07Zhttp://uobrep.openrepository.com/oai/requestoai:uobrep.openrepository.com:10547/1435342020-04-23T07:28:19Zcom_10547_132192com_10547_129915col_10547_132231col_10547_129931
Amusa, Ebenezer Olukayode
2011-09-29T08:58:36Z
2011-09-29T08:58:36Z
2010-11
Amusa, E. (2010) 'An enhanced cross-layer routing protocol for wireless mesh networks based on received signal strength'. PhD Thesis. University of Bedfordshire.
http://hdl.handle.net/10547/143534
The research work presents an enhanced cross-layer routing solution for Wireless Mesh Networks (WMN) based on Received Signal Strength. WMN is an emerging technology with varied applications due to inherent advantages ranging from self-organisation to auto-con guration. Routing in WMN is fundamen- tally achieved by hop counts which have been proven to be de cient in terms of network performance. The realistic need to enhance the link quality metric to improve network performance has been a growing concern in recent times. The cross-Layer routing approach is one of the identi ed methods of improving routing process in Wireless technology. This work presents an RSSI-aware routing metric implemented on Optimized Link-State Routing (OLSR) for WMN. The embedded Received Signal Strength Information (RSSI) from the mesh nodes on the network is extracted, processed, transformed and incorporated into the routing process. This is to estimate efficiently the link quality for network path selections to improved network performance. The measured RSSI data is filtered by an Exponentially Weighted Moving Average (EWMA) filter. This novel routing metric method is called RSSI-aware ETT (rETT). The performance of rETT is then optimised and the results compared with the fundamental hop count metric and the link quality metric by Expected Transmission Counts (ETX). The results reveal some characteristics of RSSI samples and link conditions through the analysis of the statistical data. The divergence or variability of the samples is a function of interference and multi-path e effect on the link. The implementation results show that the routing metric with rETT is more intelligent at choosing better network paths for the packets than hop count and ETX estimations. rETT improvement on network throughput is more than double (120%) compared to hop counts and 21% improvement compared to ETX. Also, an improvement of 33% was achieved in network delay compared to hop counts and 28% better than ETX. This work brings another perspective into link-quality metric solutions for WMN by using RSSI to drive the metric of the wireless routing protocol. It was carried out on test-beds and the results obtained are more realistic and practical. The proposed metric has shown improvement in performance over the classical hop counts metric and ETX link quality metric.
en
wireless networks
wireless mesh networks
wireless network performance
An enhanced cross-layer routing protocol for wireless mesh networks based on received signal strength
Thesis or dissertation
oai:uobrep.openrepository.com:10547/2160312018-06-25T13:01:47Zcom_10547_132192col_10547_132231
Sipal, Vit
Gelabert, Javier
Allen, Ben
Stevens, Christopher
Edwards, David J.
2012-03-19T16:07:02Z
2012-03-19T16:07:02Z
2011-08
Sipal, V., Gelabert, J., Allen, B., Stevens, C., Edwards, D.J. (2011) 'Frequency-selective fading of ultrawideband wireless channels in confined environments', IET Microwaves, Antennas & Propagation 5 (11):1328
17518725
10.1049/iet-map.2010.0511
http://hdl.handle.net/10547/216031
IET Microwaves, Antennas & Propagation
Frequency-selective fading of ultrawideband wireless channels in confined environments
Article
oai:uobrep.openrepository.com:10547/2166892013-03-04T14:51:57Zcom_10547_132192col_10547_132231
Hong, Xuemin
Wang, Cheng-Xiang
Thompson, John
Allen, Ben
Malik, Wasim Q.
Ge, Xiaohu
2012-03-27T07:23:40Z
2012-03-27T07:23:40Z
2010-11
Hong, X., Wang, C., Thompson, J., Allen, B., Malik, W.Q. & Ge, X. (2010) 'On Space–Frequency Correlation of UWB MIMO Channels', IEEE Transactions on Vehicular Technology, 59 (9):4201
0018-9545
1939-9359
10.1109/TVT.2010.2075947
http://hdl.handle.net/10547/216689
IEEE Transactions on Vehicular Technology. Pages: 4201-4213
en
Archived with thanks to IEEE Transactions on Vehicular Technology
On space–frequency correlation of UWB MIMO channels
Article
oai:uobrep.openrepository.com:10547/2245172012-07-09T11:35:17Zcom_10547_132192col_10547_132224
Liu, Qiang
Prakash, Edmond C.
Srinivasan, Mandayam A.
2012-05-18T08:12:13Z
2012-05-18T08:12:13Z
2012-05-18
Liu, Q., Prakash, E. & Srinivasan, M. (2007) Interactive deformable geometry maps, The Visual Computer, 23 (2) pp.119-131
0178-2789
1432-2315
10.1007/s00371-006-0033-3
http://hdl.handle.net/10547/224517
The Visual Computer, pp.119-131
en
Archived with thanks to The Visual Computer
Interactive deformable geometry maps
Article
oai:uobrep.openrepository.com:10547/2213762019-09-23T10:26:43Zcom_10547_132192col_10547_132224
Liu, Baoquan
Clapworthy, Gordon J.
Dong, Feng
Kolokotroni, Eleni
Stamatakos, Georgios
2012-05-01T13:39:37Z
2012-05-01T13:39:37Z
2011-07
Liu, B., Clapworthy, G., Dong, F., Kolokotroni, E. & Stamatakos, G. (2011) 'Accelerating tumour growth simulations on many-core architectures: A case study on the use of GPGPU within VPH', International Conference on Information Visualisation (IV), 2011 15th , pp.601 - 609.
1550-6037
10.1109/IV.2011.45
http://hdl.handle.net/10547/221376
Information Visualisation (IV), 2011 15th International Conference on
en
adaptation models
biological system modeling
computational modeling
computer architecture
graphics processing unit
instruction sets
tumours
medical computing
parallel processing
software architecture
virtual reality
GPGPU
VPH
graphics engine
many-core architectures
parallel processing architectures
parallel programmable processor
tumour growth simulations
virtual physiological human
Accelerating tumour growth aimulations on many-core architectures: a case study on the use of GPGPU within VPH
Article
Meetings and Proceedings
oai:uobrep.openrepository.com:10547/2213402014-12-09T13:57:36Zcom_10547_132192col_10547_132224
Testi, Debora
Clapworthy, Gordon J.
Aylward, S.
Frangi, A.
Christie, R.
2012-05-01T13:13:54Z
2012-05-01T13:13:54Z
2011-10
http://hdl.handle.net/10547/221340
en
An error occurred getting the license - uri.
An error occurred on the license name.
Interactive visualization of multiscale biomedical data: an integrated approach
Article
Technical Report
oai:uobrep.openrepository.com:10547/2213412020-04-23T08:39:58Zcom_10547_132192col_10547_132224
Viceconti, Marco
Clapworthy, Gordon J.
Testi, Debora
Taddei, Fulvia
McFarlane, Nigel J.B.
2012-05-01T13:38:01Z
2012-05-01T13:38:01Z
2011-06
Viceconti, M. et al (2011) 'Multimodal fusion of biomedical data at different temporal and dimensional scales' Computer Methods and Programs in Biomedicine 102 (3):227
0169-2607
10.1016/j.cmpb.2010.04.017
http://hdl.handle.net/10547/221341
Computer Methods and Programs in Biomedicine
en
Multimodal fusion of biomedical data at different temporal and dimensional scales
Article
oai:uobrep.openrepository.com:10547/2213422019-01-08T13:48:46Zcom_10547_132192col_10547_132224
Zhao, Xia
Liu, Enjie
Clapworthy, Gordon J.
Ye, Na
Lu, Yueming
2012-05-01T13:47:11Z
2012-05-01T13:47:11Z
2011-10
Zhao, X., Liu, E., Clapworthy, G., Ye, N., Lu, Y. (2011) 'RESTful web service composition: Extracting a process model from Linear Logic theorem proving' Next Generation Web Services Practices (NWeSP), 7th International Conference on, pp. 398 - 403
10.1109/NWeSP.2011.6088212
http://hdl.handle.net/10547/221342
Next Generation Web Services Practices (NWeSP), International Conference on
en
RESTful web service composition: extracting a process model from Linear Logic theorem proving
Article
oai:uobrep.openrepository.com:10547/2213442019-01-08T13:49:23Zcom_10547_132192col_10547_132224
Zhao, Xia
Liu, Enjie
Clapworthy, Gordon J.
2012-05-01T14:45:32Z
2012-05-01T14:45:32Z
2011-09
Zhao, X., Liu, E., Clapworthy, G. (2011) 'A Two-Stage RESTful Web Service Composition Method Based on Linear Logic' Web Services (ECOWS), Ninth IEEE European Conference on. pp.39 - 46
9781457715327
10.1109/ECOWS.2011.11
http://hdl.handle.net/10547/221344
Web Services (ECOWS), 2011 Ninth IEEE European Conference on. pp.39 - 46
en
A two-stage RESTful web Service composition method based on linear logic
Article
oai:uobrep.openrepository.com:10547/2213432019-09-23T10:25:58Zcom_10547_132192col_10547_132224
Tao, Yubo
Lin, Hai
Dong, Feng
Clapworthy, Gordon J.
2012-05-01T13:50:17Z
2012-05-01T13:50:17Z
2011-09
Tao, Y., Lin, H., Dong, F., Clapworthy, G. (2011) 'Opacity Volume Based Halo Generation for Enhancing Depth Perception' Computer-Aided Design and Computer Graphics (CAD/Graphics), 12th International Conference on, pp.418 - 422
10.1109/CAD/Graphics.2011.81
http://hdl.handle.net/10547/221343
Computer-Aided Design and Computer Graphics (CAD/Graphics) International Conference
en
Opacity volume based halo generation for enhancing depth perception
Article
oai:uobrep.openrepository.com:10547/2213462018-10-19T10:44:42Zcom_10547_132192col_10547_132224
Lai, Zhihua
De La Roche, Guillaume
Bessis, Nik
Kuonen, Pierre
Clapworthy, Gordon J.
Zhou, Dibin
Zhang, Jie
2012-05-01T14:48:03Z
2012-05-01T14:48:03Z
2011-06
Lai, Z., Roche, D.L., Bessis, N., Kuonen, P., Clapworthy, G.J., Zhou, D. & Zhang, J. 'Intelligent ray launching algorithm for indoor scenarios' (2011), Radioengineering, 20(2), pp.398-408
1210-2512
http://hdl.handle.net/10547/221346
Radioengineering
en
Intelligent ray launching algorithm for indoor scenarios
Article
oai:uobrep.openrepository.com:10547/2213922019-09-23T10:27:07Zcom_10547_132192col_10547_132224
McFarlane, Nigel J.B.
Lin, X.
Zhao, Youbing
Clapworthy, Gordon J.
Dong, Feng
Redaelli, A.
Parodi, O.
Testi, Debora
2012-05-01T15:09:20Z
2012-05-01T15:09:20Z
2011-03
Visualization and simulated surgery of the left ventricle in the virtual pathological heart of the Virtual Physiological Human 2011, 1 (3):374 Interface Focus
2042-8898
2042-8901
10.1098/rsfs.2010.0040
http://hdl.handle.net/10547/221392
Interface Focus
en
Archived with thanks to Interface Focus
Visualization and simulated surgery of the left ventricle in the virtual pathological heart of the Virtual Physiological Human
Article
oai:uobrep.openrepository.com:10547/2213962012-11-12T13:39:15Zcom_10547_132192col_10547_132224
Lai, Zhihua
Bessis, Nik
De La Roche, Guillaume
Kuonen, Pierre
Zhang, Jie
Clapworthy, Gordon J.
2012-05-01T15:23:02Z
2012-05-01T15:23:02Z
2011
Lai, Z., Bessis, N., Roche, D.L., Kuonen, P., Zhang, J. & Clapworthy, G.J. (2011) 'The development of a parallel ray launching algorithm for wireless network planning', International Journal of Distributed Systems and Technologies, 2 (2), pp.1-19.
1947-3532
1947-3540
10.4018/jdst.2011040101
http://hdl.handle.net/10547/221396
International Journal of Distributed Systems and Technologies
en
Archived with thanks to International Journal of Distributed Systems and Technologies
The development of a parallel ray launching algorithm for wireless network planning
Article
oai:uobrep.openrepository.com:10547/2213972019-01-08T13:51:23Zcom_10547_132192col_10547_132224
Wei, Hui
Liu, Enjie
Zhao, Xia
McFarlane, Nigel J.B.
Clapworthy, Gordon J.
2012-05-01T15:37:29Z
2012-05-01T15:37:29Z
2011-07
Wei, H., Liu, E., Zhao, X., McFarlane, NJB., Clapworthy, GJ. (2011) 'Web-based 3D visualisation for biomedical applications' Information Visualisation (IV), 15th International Conference on, pp. 632 - 637
10.1109/IV.2011.74
http://hdl.handle.net/10547/221397
Information Visualisation (IV), 2011 15th International Conference on
en
Web-based 3D visualisation for biomedical applications
Article
oai:uobrep.openrepository.com:10547/2213992019-09-23T10:26:16Zcom_10547_132192col_10547_132224
Zhao, Youbing
Clapworthy, Gordon J.
Tao, Yubo
Dong, Feng
Wei, Hui
Wang, Tao
2012-05-01T15:39:59Z
2012-05-01T15:39:59Z
2011-07
Zhao, Y., Clapworthy, GJ, Tao, Y, Dong, F., Wei, H., Wang, T. (2011) 'CCVis: a software plugin for unified visualisation in ContraCancrum based on VTK extensions' Information Visualisation (IV), 2011 15th International Conference on, pp. 610 - 615
10.1109/IV.2011.80
http://hdl.handle.net/10547/221399
Information Visualisation (IV), 2011 15th International Conference on, pp. 610 - 615
en
DICOM
data models
isosurfaces
rendering (computer graphics)
transfer functions
tumors
tumours
data visualisation
medical image processing
ContraCancrum
DrEye plugin
VTK extensions
multi-dimensional transfer function
multi-layered isosurface
slice views
time-varying
CCVis: a software plugin for unified visualisation in ContraCancrum based on VTK extensions
Article
oai:uobrep.openrepository.com:10547/2230922018-06-28T12:56:25Zcom_10547_132192col_10547_132231
Kothris, D.
Beach, Mark
Allen, Ben
Karlsson, Peter
2012-05-10T16:14:33Z
2012-05-10T16:14:33Z
2001
Kothris, D., Beach, M., Allen, B., & Karlsson, P. (2001) 'Performance assessment of terrestrial and satellite based position location systems,' 3G Mobile Communication Technologies, 2001. Second International Conference on (Conf. Publ. No. 477), pp.211-215
10.1049/cp:20010043
http://hdl.handle.net/10547/223092
3G Mobile Communication Technologies, 2001. Second International Conference on (Conf. Publ. No. 477)
en
wireless
location
mobile networks
Performance assessment of terrestrial and satellite based position location systems
Meetings and Proceedings
oai:uobrep.openrepository.com:10547/2237322020-04-23T07:28:28Zcom_10547_132192col_10547_132224
Viceconti, Marco
Clapworthy, Gordon J.
Jan, Serge Van Sint
2012-05-15T08:01:28Z
2012-05-15T08:01:28Z
2008-12
Viceconti, M., Clapworthy, G., Jan, S. (2008) 'The Virtual Physiological Human — A European Initiative for in silico Human Modelling' The Journal of Physiological Sciences 58 (7): 441-446
1880-6546
1880-6562
10.2170/physiolsci.RP009908
http://hdl.handle.net/10547/223732
The Journal of Physiological Sciences
The Virtual Physiological Human (VPH) is an initiative, strongly supported by the European Commission (EC), that seeks to develop an integrated model of human physiology at multiple scales from the whole body through the organ, tissue, cell and molecular levels to the genomic level. VPH had its beginnings in 2005 with informal discussions amongst like-minded scientists, which led to the STEP project, a Coordination Action funded by the EC that began in early 2006. The STEP project greatly accelerated the progress of the VPH and proved to be a catalyst for wide-ranging discussions within Europe and for outreach activities designed to develop a broad international approach to the huge scientific and technological challenges involved in this area. This paper provides an overview of the VPH and the developments it has engendered in the rapidly expanding worldwide activities associated with the physiome. It then uses one particular project, the Living Human Project, to illustrate the type of advances that are taking place to further the aims of the VPH and similar initiatives worldwide.
en
integrative research
multiscale modelling
musculoskeletal system
physiome
virtual physiological human
The virtual physiological human — a European initiative for in silico human modelling
Article
oai:uobrep.openrepository.com:10547/2237782020-04-23T07:28:28Zcom_10547_132192col_10547_132224
John, Tng C. H.
Prakash, Edmond C.
Chaudhari, Narendra S.
2012-05-15T10:55:52Z
2012-05-15T10:55:52Z
2008
John, T., Prakash, E. & Chaudhari, N. (2008) 'Strategic team AI path plans: Probabilistic pathfinding', International Journal of Computer Games Technology, 2008, pp.1-6.
1687-7047
10.1155/2008/834616
http://hdl.handle.net/10547/223778
International Journal of Computer Games Technology
This paper proposes a novel method to generate strategic team AI pathfinding plans for computer games and simulations using probabilistic pathfinding. This method is inspired by genetic algorithms (Russell and Norvig, 2002), in that, a fitness function is used to test the quality of the path plans. The method generates high-quality path plans by eliminating the low-quality ones. The path plans are generated by probabilistic pathfinding, and the elimination is done by a fitness test of the path plans. This path plan generation method has the ability to generate variation or different high-quality paths, which is desired for games to increase replay values. This work is an extension of our earlier work on team AI: probabilistic pathfinding (John et al., 2006). We explore ways to combine probabilistic pathfinding and genetic algorithm to create a new method to generate strategic team AI pathfinding plans.
en
Archived with thanks to International Journal of Computer Games Technology
Strategic team AI path plans: probabilistic pathfinding
Article
oai:uobrep.openrepository.com:10547/2237922016-01-15T14:15:14Zcom_10547_132192col_10547_132224
Zhi Zheng
Prakash, Edmond C.
Chan, T.K.Y.
2012-05-15T10:47:33Z
2012-05-15T10:47:33Z
2008-05
Zhi Z., Prakash, E.C., Chan, T.K.Y. (2008) 'Interactive View-Dependent Rendering over Networks' IEEE Transactions on Visualization and Computer Graphics 14 (3):576-589
1077-2626
10.1109/TVCG.2007.70626
http://hdl.handle.net/10547/223792
IEEE Transactions on Visualization and Computer Graphics
en
Interactive view-dependent rendering over networks
Article
oai:uobrep.openrepository.com:10547/2237342018-06-29T10:21:29Zcom_10547_132192col_10547_132224
Fenner, J.W
Brook, B.
Clapworthy, Gordon J.
Coveney, Peter V.
Feipel, V.
Gregersen, H.
Hose, D.R.
Kohl, Peter
Lawford, Patricia
McCormack, K.M.
Pinney, D.
Thomas, S.R.
Van Sint Jan, S.
Waters, S.
Viceconti, Marco
2012-05-15T08:04:27Z
2012-05-15T08:04:27Z
2008-09
Fenner, J.W., Brook, B., Clapworthy, G.J., Coveney, P.V., Feipel, V., Gregersen, H., Hose, D.R., Kohl, P., Lawford, P., McCormack, K.M., Pinney, D., Thomas, S.R., Van, S.J., Waters, S. & Viceconti, M. (2008) 'The EuroPhysiome, STEP and a roadmap for the virtual physiological human', Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 366 (1878), pp.2979-2999.
1364-503X
1471-2962
10.1098/rsta.2008.0089
http://hdl.handle.net/10547/223734
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
en
The EuroPhysiome, STEP and a roadmap for the virtual physiological human
Article
oai:uobrep.openrepository.com:10547/2237362020-04-23T07:28:28Zcom_10547_132192col_10547_132224
Wang, Chao
Sun, Li-Feng
Yang, Bo
Liu, Yi-Ming
Yang, Shi-Qiang
2012-05-15T08:10:34Z
2012-05-15T08:10:34Z
2008-05
Wang, C., Sun, L., Yang, B., Liu, Y., Yang, S. (2008) 'Video Enhancement Using Adaptive Spatio-Temporal Connective Filter and Piecewise Mapping' EURASIP Journal on Advances in Signal Processing (1): 1-13.
1687-6180
10.1155/2008/165792
http://hdl.handle.net/10547/223736
EURASIP Journal on Advances in Signal Processing
This paper presents a novel video enhancement system based on an adaptive spatio-temporal connective (ASTC) noise filter and an adaptive piecewise mapping function (APMF). For ill-exposed videos or those with much noise, we first introduce a novel local image statistic to identify impulse noise pixels, and then incorporate it into the classical bilateral filter to form ASTC, aiming to reduce the mixture of the most two common types of noises - Gaussian and impulse noises in spatial and temporal directions. After noise removal, we enhance the video contrast with APMF based on the statistical information of frame segmentation results. The experiment results demonstrate that, for diverse low-quality videos corrupted by mixed noise, underexposure, overexposure, or any mixture of the above, the proposed system can automatically produce satisfactory results.
en
http://creativecommons.org/licenses/by-nc-nd/4.0/
Archived with thanks to EURASIP Journal on Advances in Signal Processing
video enhancement
Video enhancement using adaptive spatio-temporal connective filter and piecewise mapping
Article
oai:uobrep.openrepository.com:10547/2237942019-09-23T10:31:10Zcom_10547_132192col_10547_132224
Liu, Baoquan
Clapworthy, Gordon J.
Dong, Feng
2012-05-15T10:57:20Z
2012-05-15T10:57:20Z
2009-07-27
Liu, B., Clapworthy, G. & Dong, F. (2009) 'Accelerating volume raycasting using proxy spheres', Computer Graphics Forum, 28 (3), pp.839-846.
01677055
14678659
10.1111/j.1467-8659.2009.01466.x
http://hdl.handle.net/10547/223794
Computer Graphics Forum
en
Accelerating volume raycasting using proxy spheres
Article
oai:uobrep.openrepository.com:10547/2237792019-09-23T10:31:28Zcom_10547_132192col_10547_132224
Tao, Yubo
Lin, Hai
Bao, Hujun
Dong, Feng
Clapworthy, Gordon J.
2012-05-15T10:58:01Z
2012-05-15T10:58:01Z
2009-04
Feature enhancement by volumetric unsharp masking 2009, 25 (5-7):581-588 The Visual Computer
0178-2789
1432-2315
10.1007/s00371-009-0328-2
http://hdl.handle.net/10547/223779
The Visual Computer
en
Feature enhancement by volumetric unsharp masking
Article
oai:uobrep.openrepository.com:10547/2237772019-09-23T10:30:48Zcom_10547_132192col_10547_132224
Dong, Feng
Clapworthy, Gordon J.
Lin, Hai
2012-05-15T10:53:42Z
2012-05-15T10:53:42Z
2009-10-08
Dong, F., Clapworthy, G.J. & Lin, H. (2009) 'Contour synthesis by least-squares construction', Electronics Letters, 45 (21), pp.1072-1074
00135194
10.1049/el.2009.1871
http://hdl.handle.net/10547/223777
Electronics Letters
en
Contour synthesis by least-squares construction
Article
oai:uobrep.openrepository.com:10547/2237952019-09-23T10:30:33Zcom_10547_132192col_10547_132224
Liu, Baoquan
Clapworthy, Gordon J.
Dong, Feng
2012-05-15T10:58:36Z
2012-05-15T10:58:36Z
2009-12
Liu, B., Clapworthy, G. & Dong, F. (2009) 'Fast isosurface rendering on a GPU by cell rasterization', Computer Graphics Forum, 28 (8), pp.2151-2164.
0167-7055
1467-8659
10.1111/j.1467-8659.2009.01422.x
http://hdl.handle.net/10547/223795
Computer Graphics Forum
en
Fast isosurface rendering on a GPU by cell rasterization
Article
oai:uobrep.openrepository.com:10547/2237802019-09-23T10:29:38Zcom_10547_132192col_10547_132224
Dong, Feng
Clapworthy, Gordon J.
Lin, Hai
2012-05-15T11:00:31Z
2012-05-15T11:00:31Z
2009-12-03
Dong, F., Clapworthy, G.J. & Lin, H. (2009) 'Rendering of novel views from photographs using inference in markov random field', Electronics Letters, 45 (25), pp.1312-1313.
00135194
10.1049/el.2009.1872
http://hdl.handle.net/10547/223780
Electronics Letters
en
Rendering of novel views from photographs using inference in Markov random field
Article
oai:uobrep.openrepository.com:10547/2237812020-04-23T07:28:30Zcom_10547_132192col_10547_132224
Loh, Peter K. K.
Prakash, Edmond C.
2012-05-15T11:08:44Z
2012-05-15T11:08:44Z
2009
Loh, P.K.K. & Prakash, E.C. (2009) 'Performance simulations of moving target search algorithms', International Journal of Computer Games Technology, pp.1-6
1687-7047
1687-7055
10.1155/2009/745219
http://hdl.handle.net/10547/223781
International Journal of Computer Games Technology
The design of appropriate moving target search (MTS) algorithms for computer-generated bots poses serious challenges as they have to satisfy stringent requirements that include computation and execution efficiency. In this paper, we investigate the performance and behaviour of existing moving target search algorithms when applied to search-and-capture gaming scenarios. As part of the investigation, we also introduce a novel algorithm known as abstraction MTS. We conduct performance simulations with a game bot and moving target within randomly generated mazes of increasing sizes and reveal that abstraction MTS exhibits competitive performance even with large problem spaces.
en
Archived with thanks to International Journal of Computer Games Technology
moving target search algorithms
computer-generated bots
Performance simulations of moving target search algorithms
Article
oai:uobrep.openrepository.com:10547/2237962012-07-09T11:44:55Zcom_10547_132192col_10547_132224
Loh, Peter K. K.
Prakash, Edmond C.
2012-05-15T11:08:06Z
2012-05-15T11:08:06Z
2009-06
Loh, P. & Prakash, E. (2009) 'Novel moving target search algorithms for computer gaming', Computers in Entertainment, 7 (2), pp.1-31.
15443574
10.1145/1541895.1541907
http://hdl.handle.net/10547/223796
Computers in Entertainment
en
Archived with thanks to Computers in Entertainment
Novel moving target search algorithms for computer gaming
Article
oai:uobrep.openrepository.com:10547/2241522020-04-23T07:28:30Zcom_10547_132192col_10547_132224
Zhang, Yu
Prakash, Edmond C.
2012-05-16T11:24:02Z
2012-05-16T11:24:02Z
2009
Zhang, Y. (2009) 'Face to Face: Anthropometry-Based Interactive Face Shape Modeling Using Model Priors' International Journal of Computer Games Technology 2009:1
1687-7047
1687-7055
10.1155/2009/573924
http://hdl.handle.net/10547/224152
International Journal of Computer Games Technology
This paper presents a new anthropometrics-based method for generating realistic, controllable face models. Our method establishes an intuitive and efficient interface to facilitate procedures for interactive 3D face modeling and editing. It takes 3D face scans as examples in order to exploit the variations presented in the real faces of individuals. The system automatically learns a model prior from the data-sets of example meshes of facial features using principal component analysis (PCA) and uses it to regulate the naturalness of synthesized faces. For each facial feature, we compute a set of anthropometric measurements to parameterize the example meshes into a measurement space. Using PCA coefficients as a compact shape presentation, we formulate the face modeling problem in a scattered data interpolation framework which takes the user-specified nthropometric parameters as input. Solving the interpolation problem in a reduced subspace allows us to generate a natural face shape that satisfies the user-specified constraints. At runtime, the new face shape can be generated at an interactive rate. We demonstrate the utility of our method by presenting several applications, including analysis of facial features of subjects in different race groups, facial feature transfer, and adapting face models to a particular population group.
en
Archived with thanks to International Journal of Computer Games Technology
Face to face: anthropometry-based interactive face shape modeling using model priors
Article
oai:uobrep.openrepository.com:10547/2241532016-01-15T13:26:04Zcom_10547_132192col_10547_132224
Prakash, Edmond C.
Brindle, G.
Jones, K.
Zhou, S.
Chaudhari, Narendra S.
Wong, K.-W.
2012-05-16T11:24:51Z
2012-05-16T11:24:51Z
2009-12
Prakash E.C. (2009) 'Advances in Games Technology: Software, Models, and Intelligence' Simulation & Gaming 40 (6):752-801
1046-8781
10.1177/1046878109335120
http://hdl.handle.net/10547/224153
Simulation & Gaming
en
Advances in games technology : software, models, and intelligence
Article
oai:uobrep.openrepository.com:10547/2241552012-05-21T11:53:50Zcom_10547_132192col_10547_132224
Tao, Yubo
Lin, Hai
Bao, Hujun
2012-05-16T11:26:04Z
2012-05-16T11:26:04Z
2010-02
GPU-Based Shooting and Bouncing Ray Method for Fast RCS Prediction 2010, 58 (2):494-502 IEEE Transactions on Antennas and Propagation
0018-926X
1558-2221
10.1109/TAP.2009.2037694
http://hdl.handle.net/10547/224155
IEEE Transactions on Antennas and Propagation
en
Archived with thanks to IEEE Transactions on Antennas and Propagation
GPU-Based Shooting and Bouncing Ray Method for Fast RCS Prediction
Article
oai:uobrep.openrepository.com:10547/2241052019-09-23T10:29:21Zcom_10547_132192col_10547_132224
Chen, D.
Dong, Feng
2012-05-16T11:35:05Z
2012-05-16T11:35:05Z
2010-01-01
Chen, D. & Dong, F. (2010) 'Shape from shading using wavelets and weighted smoothness constraints', IET Computer Vision, 4 (1), pp.1-11.
17519632
10.1049/iet-cvi.2007.0043
http://hdl.handle.net/10547/224105
IET Computer Vision
en
Shape from shading using wavelets and weighted smoothness constraints
Article
oai:uobrep.openrepository.com:10547/2241062020-04-23T07:34:46Zcom_10547_132192col_10547_132224
Wang, Chao
Sun, Li-Feng
Chen, ZhuoYuan
Zhang, JianWei
Yang, ShiQiang
2012-05-16T11:36:17Z
2012-05-16T11:36:17Z
2010-01
Wang, C., Sun, L-F., Chen, Z., Zhang, J., Yang, S. (2010) 'Multi-scale blind motion deblurring using local minimum' Inverse Problems 26 (1):015003
0266-5611
1361-6420
10.1088/0266-5611/26/1/015003
http://hdl.handle.net/10547/224106
Inverse Problems
Blind deconvolution, a chronic inverse problem, is the recovery of the latent sharp image from a blurred one when the blur kernel is unknown. Recent algorithms based on the MAP approach encounter failures since the global minimum of the negative MAP scores really favors the blurry image. The goal of this paper is to demonstrate that the sharp image can be obtained from the local minimum by using the MAP approach. We first propose a cross-scale constraint to make the sharp image correspond to a good local minimum. Then the cross-scale initialization, iterative likelihood update and the iterative residual deconvolution are adopted to trap the MAP approach in the desired local minimum. These techniques result in our cross-scale blind deconvolution approach which constrains the solution from coarse to fine. We test our approach on the standard dataset and many other challenging images. The experimental results suggest that our approach outperforms all existing alternatives.
en
Multi-scale blind motion deblurring using local minimum
Article
oai:uobrep.openrepository.com:10547/2241572012-09-12T10:35:11Zcom_10547_132192col_10547_132224
Tao, Yubo
Lin, Hai
Bao, Hu Jun
2012-05-16T11:30:24Z
2012-05-16T11:30:24Z
2011-09
Adaptive Aperture Partition in Shooting and Bouncing Ray Method 2011, 59 (9):3347-3357 IEEE Transactions on Antennas and Propagation
0018-926X
10.1109/TAP.2011.2161435
http://hdl.handle.net/10547/224157
IEEE Transactions on Antennas and Propagation
en
Archived with thanks to IEEE Transactions on Antennas and Propagation
acceleration
acoustic beams
apertures
electron tubes
geometry
ray tracing
structural beams
geometrical optics
radar cross-sections
radiowave propagation
synthetic aperture radar
RCS prediction
THz band
adaptive aperture partition algorithm
beam triangle intersection
geometric optics
irregular beams
ray tube
shooting and bouncing ray method
virtual aperture
Adaptive aperture partition in shooting and bouncing ray method
Article
oai:uobrep.openrepository.com:10547/2241022019-09-23T10:29:01Zcom_10547_132192col_10547_132224
Agrawal, Anupam
Kohout, Josef
Clapworthy, Gordon J.
McFarlane, Nigel J.B.
Dong, Feng
Viceconti, Marco
Taddei, Fulvia
Testi, Debora
2012-05-16T11:29:51Z
2012-05-16T11:29:51Z
2010
Agrawal, A., Kohout, J., Clapworthy, G.J., McFarlane, N.J.B., Dong, F., Viceconti, M., Taddei, F. & Testi, D. (2009) 'Enabling the interactive display of large medical volume datasets by multiresolution bricking', The Journal of Supercomputing, 51 (1), pp.3-19.
0920-8542
1573-0484
10.1007/s11227-009-0289-2
http://hdl.handle.net/10547/224102
The Journal of Supercomputing
en
medical visualization
large volume data sets
out-of-core processing
multiresolution bricking
VTK
Enabling the interactive display of large medical volume datasets by multiresolution bricking
Article
oai:uobrep.openrepository.com:10547/2240992019-01-08T13:52:33Zcom_10547_132192col_10547_132224
Zhao, Xia
Wang, Tao
Liu, Enjie
Clapworthy, Gordon J.
2012-05-16T11:26:58Z
2012-05-16T11:26:58Z
2010
Zhao, X., Wang, T., Liu, E., Clapworthy, G. (2010) 'Web Services in Distributed Information Systems' International Journal of Distributed Systems and Technologies 1 (1):1-16
1947-3532
1947-3540
10.4018/jdst.2010090801
http://hdl.handle.net/10547/224099
International Journal of Distributed Systems and Technologies
en
Web services in distributed information systems
Article
oai:uobrep.openrepository.com:10547/2240952019-09-23T10:27:54Zcom_10547_132192col_10547_132224
Liu, Baoquan
Clapworthy, Gordon J.
Dong, Feng
2012-05-16T10:36:44Z
2012-05-16T10:36:44Z
2010-06
Liu, B., Clapworthy, G. & Dong, F. (2010) 'Multi-layer depth peeling by single-pass rasterisation for faster isosurface raytracing on GPUs', Computer Graphics Forum, 29 (3), pp.1231-1240.
01677055
10.1111/j.1467-8659.2009.01674.x
http://hdl.handle.net/10547/224095
Computer Graphics Forum
en
Multi-layer depth peeling by single-pass rasterisation for faster isosurface raytracing on GPUs
Article
oai:uobrep.openrepository.com:10547/2241542019-09-23T10:28:42Zcom_10547_132192col_10547_132224
Liu, Baoquan
Clapworthy, Gordon J.
Dong, Feng
2012-05-16T11:25:25Z
2012-05-16T11:25:25Z
2010
Liu, B., Clapworthy, G. & Dong, F. (2010) 'Wavefront raycasting using larger filter kernels for on-the-fly GPU gradient reconstruction', The Visual Computer, 6 (8), pp.1079-1089.
0178-2789
1432-2315
10.1007/s00371-010-0493-3
http://hdl.handle.net/10547/224154
The Visual Computer
en
Wavefront raycasting using larger filter kernels for on-the-fly GPU gradient reconstruction
Article
oai:uobrep.openrepository.com:10547/2241042020-04-23T08:42:05Zcom_10547_132192col_10547_132224
Zhao, Xia
Liu, Enjie
Clapworthy, Gordon J.
Viceconti, Marco
Testi, Debora
2012-05-16T11:33:53Z
2012-05-16T11:33:53Z
2012-06
Zhao, X. et al (2012) 'SOA-based digital library services and composition in biomedical applications' Computer Methods and Programs in Biomedicine 106 (3):219-233
0169-2607
10.1016/j.cmpb.2010.08.009
http://hdl.handle.net/10547/224104
Computer Methods and Programs in Biomedicine
en
SOA-based digital library services and composition in biomedical applications
Article
oai:uobrep.openrepository.com:10547/2241592020-01-14T10:30:27Zcom_10547_132192col_10547_132224
Marias, Kostas
Dionysiou, D.
Sakkalis, Vangelis
Graf, N.
Bohle, R.M.
Coveney, Peter V.
Wan, S.
Folarin, A.
Buchler, P.
Reyes, M.
Clapworthy, Gordon J.
Liu, Enjie
Sabczynski, J.
Bily, T.
Roniotis, A.
Tsiknakis, Manolis
Kolokotroni, Eleni
Giatili, S.
Veith, C.
Messe, E.
Stenzhorn, H.
Kim, Y.-J.
Zasada, Stefan J.
Haidar, A.N.
May, C.
Bauer, S.
Wang, T.
Zhao, Y.
Karasek, M.
Grewer, R.
Franz, A.
Stamatakos, Georgios
2012-05-16T11:34:27Z
2012-05-16T11:34:27Z
2011-06-06
Marias, K., Dionysiou, D., Sakkalis, V., Graf, N., Bohle, R.M., Coveney, P.V., Wan, S., Folarin, A., Buchler, P., Reyes, M., Clapworthy, G.J., Liu, E., Sabczynski, J., Bily, T., Roniotis, A., Tsiknakis, M., Kolokotroni, E., Giatili, S., Veith, C., Messe, E., Stenzhorn, H., Kim, Y.-., Zasada, S., Haidar, A.N., May, C., Bauer, S., Wang, T., Zhao, Y., Karasek, M., Grewer, R., Franz, A. & Stamatakos, G. (2011) 'Clinically driven design of multi-scale cancer models: The ContraCancrum project paradigm', Interface Focus, 1 (3), pp.450-461.
2042-8898
2042-8901
10.1098/rsfs.2010.0037
http://hdl.handle.net/10547/224159
Interface Focus
en
Clinically driven design of multi-scale cancer models: the ContraCancrum project paradigm
Article
oai:uobrep.openrepository.com:10547/2241582014-11-20T11:00:41Zcom_10547_132192col_10547_132224
Liu, Baoquan
Wei, Li-Yi
Yang, Xu
Ma, Chongyang
Xu, Ying-Qing
Guo, Baining
Wu, Enhua
2012-05-16T11:30:59Z
2012-05-16T11:30:59Z
2011-12
Liu, B., Wei, L., Yang, X., Ma, C., Xu, Y., Guo, B. & Wu, E. (2011) 'Non-linear beam tracing on a GPU', Computer Graphics Forum, 30 (8), pp.2156-2169.
0167-7055
10.1111/j.1467-8659.2011.01905.x
http://hdl.handle.net/10547/224158
Computer Graphics Forum
en
nonlinear beam tracing
real-time rendering
GPU techniques
reflection
refraction
Non-linear beam tracing on a GPU
Article
oai:uobrep.openrepository.com:10547/2241032012-09-12T10:58:14Zcom_10547_132192col_10547_132224
Wang, Chao
Sun, Lifeng
Cui, Peng
Zhang, Jianwei
Yang, Shiqiang
2012-05-16T11:32:34Z
2012-05-16T11:32:34Z
2012
Analyzing Image Deblurring Through Three Paradigms 2012, 21 (1):115-129 IEEE Transactions on Image Processing
1057-7149
1941-0042
10.1109/TIP.2011.2159985
http://hdl.handle.net/10547/224103
IEEE Transactions on Image Processing
en
Archived with thanks to IEEE Transactions on Image Processing
Bayesian methods
electric shock
image edge detection
image restoration
kernel
noise
tin
Bayes methods
estimation theory
filtering theory
image restoration
conjunctive deblurring algorithm
deterministic filter
image deblurring
limitation latent
Bayesian estimation
Analyzing image deblurring through three paradigms
Article
oai:uobrep.openrepository.com:10547/2241072020-04-23T08:39:55Zcom_10547_132192col_10547_132224
Murgia, Alessio
Harwin, William
Prakoonwit, Simant
Brownlow, Harry
2012-05-16T11:36:46Z
2012-05-16T11:36:46Z
2011-07
Murgia, A. et al (2011) 'Preliminary observations on the presence of sustained tendon strain and eccentric contractions of the wrist extensors during a common manual task: Implications for lateral epicondylitis' Medical Engineering & Physics 33 (6):793-797
1350-4533
10.1016/j.medengphy.2011.02.002
http://hdl.handle.net/10547/224107
Medical Engineering & Physics
en
Preliminary observations on the presence of sustained tendon strain and eccentric contractions of the wrist extensors during a common manual task: Implications for lateral epicondylitis
Article
oai:uobrep.openrepository.com:10547/2241092017-02-23T10:02:22Zcom_10547_132192col_10547_132231
Cheung, Gene
Velisavljević, Vladan
Ortega, Antonio
2012-05-16T11:42:46Z
2012-05-16T11:42:46Z
2011-11
Cheung, G., Velisavljevic, V. & Ortega, A. (2011) 'On dependent bit allocation for multiview image coding with depth-image-based rendering', IEEE Transactions on Image Processing, 20 (11), pp.3179-3194.
1057-7149
1941-0042
10.1109/TIP.2011.2158230
http://hdl.handle.net/10547/224109
IEEE Transactions on Image Processing
en
On dependent bit allocation for multiview image coding with depth-image-based rendering
Article
oai:uobrep.openrepository.com:10547/2241082016-01-15T14:01:09Zcom_10547_132192col_10547_132231
Waharte, Sonia
Ishibashi, Brent
Boutaba, Raouf
Meddour, Djamal-Eddine
2012-05-16T11:37:58Z
2012-05-16T11:37:58Z
2009-10
Waharte, S. et al (2009) 'Design and Performance Evaluation of IAR: Interference-Aware Routing Metric for Wireless Mesh Networks' Mobile Networks and Applications 14 (5):649-660
1383-469X
1572-8153
10.1007/s11036-009-0156-7
http://hdl.handle.net/10547/224108
Mobile Networks and Applications
en
Design and performance evaluation of IAR: Interference-Aware Routing metric for Wireless Mesh Networks
Article
oai:uobrep.openrepository.com:10547/2241722013-03-04T14:56:49Zcom_10547_132192col_10547_132231
Sipal, Vit
Allen, Ben
Edwards, David J.
2012-05-16T11:44:16Z
2012-05-16T11:44:16Z
2010-08-05
Analysis and mitigation of antenna effects on wideband wireless channel 2010, 46 (16):1159-1160 Electronics Letters
00135194
10.1049/el.2010.1106
http://hdl.handle.net/10547/224172
Electronics Letters
en
Archived with thanks to Electronics Letters
Analysis and mitigation of antenna effects on wideband wireless channel
Article
oai:uobrep.openrepository.com:10547/2241732013-03-04T14:57:54Zcom_10547_132192col_10547_132231
Sipal, Vit
Allen, Ben
Edwards, David J.
2012-05-16T11:44:52Z
2012-05-16T11:44:52Z
2011-04-14
Exploration of Nakagami fading in ultra-wideband wireless channels 2011, 47 (8):520-521 Electronics Letters
00135194
10.1049/el.2011.0088
http://hdl.handle.net/10547/224173
Electronics Letters
en
Archived with thanks to Electronics Letters
Exploration of Nakagami fading in ultra-wideband wireless channels
Article
oai:uobrep.openrepository.com:10547/2241012020-04-23T07:28:31Zcom_10547_132192col_10547_132231
Safdar, Ghazanfar Ali
O'Neill, M.P.
2012-05-16T11:28:38Z
2012-05-16T11:28:38Z
2009-01
Safdar, G., O'Neill, M. (2009) 'Performance Analysis of Novel Randomly Shifted Certification Authority Authentication Protocol for MANETs' EURASIP Journal on Wireless Communications and Networking (1):243956 EURASIP Journal on Wireless Communications and Networking
1687-1499
10.1155/2009/243956
http://hdl.handle.net/10547/224101
EURASIP Journal on Wireless Communications and Networking
The provision of security in mobile ad hoc networks is of paramount importance due to their wireless nature. However, when conducting research into security protocols for ad hoc networks it is necessary to consider these in the context of the overall system. For example, communicational delay associated with the underlying MAC layer needs to be taken into account. Nodes in mobile ad hoc networks must strictly obey the rules of the underlying MAC when transmitting security-related messages while still maintaining a certain quality of service. In this paper a novel authentication protocol, RASCAAL, is described and its performance is analysed by investigating both the communicational-related effects of the underlying IEEE 802.11 MAC and the computational-related effects of the cryptographic algorithms employed. To the best of the authors' knowledge, RASCAAL is the first authentication protocol which proposes the concept of dynamically formed short-lived random clusters with no prior knowledge of the cluster head. The performance analysis demonstrates that the communication losses outweigh the computation losses with respect to energy and delay. MAC-related communicational effects account for 99% of the total delay and total energy consumption incurred by the RASCAAL protocol. The results also show that a saving in communicational energy of up to 12.5% can be achieved by changing the status of the wireless nodes during the course of operation.
en
http://creativecommons.org/licenses/by-nc-nd/4.0/
Archived with thanks to EURASIP Journal on Wireless Communications and Networking
mobile networks
network security
authentication
Performance analysis of novel randomly shifted Certification Authority Authentication Protocol for MANETs
Article
oai:uobrep.openrepository.com:10547/2241602018-08-01T18:59:12Zcom_10547_132192col_10547_132231
Ajmal, Tahmina
Walker, Stuart D.
2012-05-16T11:37:15Z
2012-05-16T11:37:15Z
2008-10
Ajmal, T. & Walker, S. (2008) '1.562 Gb/s phase-encrypted secure communication'. IET Optoelectronics, 2008, 2 (5):201-208
17518768
10.1049/iet-opt:20070089
http://hdl.handle.net/10547/224160
IET Optoelectronics
en
1.562 Gb/s phase-encrypted secure communication
Article
oai:uobrep.openrepository.com:10547/2241102017-02-23T10:02:51Zcom_10547_132192col_10547_132231
Ekmekcioglu, Erhan
Velisavljević, Vladan
Worrall, Stewart T.
2012-05-16T11:43:17Z
2012-05-16T11:43:17Z
2011-04
Ekmekcioglu, E., Velisavljevic, V. & Worrall, S.T. (2011) 'Content adaptive enhancement of multi-view depth maps for free viewpoint video', IEEE Journal of Selected Topics in Signal Processing, 5 (2), pp.352-361.
1932-4553
1941-0484
10.1109/JSTSP.2010.2052783
http://hdl.handle.net/10547/224110
IEEE Journal of Selected Topics in Signal Processing
en
Archived with thanks to IEEE Journal of Selected Topics in Signal Processing
Content adaptive enhancement of multi-view depth maps for free viewpoint video
Article
oai:uobrep.openrepository.com:10547/2241712017-02-23T10:07:46Zcom_10547_132192col_10547_132231
Velisavljević, Vladan
2012-05-16T11:43:52Z
2012-05-16T11:43:52Z
2009-09
Velisavljevic, V. (2009) 'Low-Complexity Iris Coding and Recognition Based on Directionlets' IEEE Transactions on Information Forensics and Security 4 (3):410-417
1556-6013
10.1109/TIFS.2009.2024025
http://hdl.handle.net/10547/224171
IEEE Transactions on Information Forensics and Security
en
iris recognition
directionlets
Low-complexity iris coding and recognition based on directionlets
Article
oai:uobrep.openrepository.com:10547/2241622020-04-23T07:28:31Zcom_10547_132192col_10547_132231
Safdar, Ghazanfar Ali
O'Neill, M.
2012-05-16T11:45:42Z
2012-05-16T11:45:42Z
2012
Safdar, G.A. and O'Neill, M. (2012) 'A novel Common control channel security framework for cognitive radio networks', International Journal of Autonomous and Adaptive Communications Systems, 5 (2) pp. 125-145
1754-8632
http://hdl.handle.net/10547/224162
International Journal of Autonomous and Adaptive Communications Systems (IJAACS)
Cognitive radio technology makes use of the underutilised spectrum opportunistically without causing interference to the primary users. Cooperatively communicating cognitive radio devices use the common control channel of the cognitive radio medium access control to perform free channel announcements, channel selection and channel reservation before any actual data transmission. Common control channel security is vital in order to ensure security in the subsequent communication among the cognitive radio nodes. Additional to well-known security problems in wireless networks, cognitive radio networks introduce new classes of security threats and challenges, such as misbehaviours in spectrum sensing, licensed user emulation and attacks in the common control channel transactions. This paper presents a novel common control channel security framework (protocol) for cooperatively communicating cognitive radio networks. To the best of the authors knowledge, this is the first paper to address the security requirements of the common control channel. An implementation of the proposed security protocol is discussed illustrating how two cognitive radio nodes can authenticate each other prior to any confidential common control channel negotiations. The protocol is formally validated by GNY logic and a security analysis of the protocol illustrates that it meets the principal security requirements of authentication, confidentiality, integrity and non-repudiation.
en
A novel common control channel security framework for cognitive radio networks
Article
oai:uobrep.openrepository.com:10547/2241632016-10-20T14:00:13Zcom_10547_132192col_10547_132231
Safdar, Ghazanfar Ali
Scanlon, W.G.
2012-05-16T11:46:08Z
2012-05-16T11:46:08Z
2008-03
Safdar, G., Scanlon, W. (2008) 'Performance Analysis of Improved IEEE 802.11 Infrastructure Power Saving Under Time-Correlated Channel Errors' International Journal of Wireless Information Networks 15 (1):36-42
1068-9605
1572-8129
10.1007/s10776-008-0071-z
http://hdl.handle.net/10547/224163
International Journal of Wireless Information Networks
en
Performance analysis of improved IEEE 802.11 infrastructure power saving under time-correlated channel errors
Article
oai:uobrep.openrepository.com:10547/2241742020-04-23T08:39:56Zcom_10547_132192col_10547_132231
Cheng, Hui
Yang, Shengxiang
2012-05-16T11:46:36Z
2012-05-16T11:46:36Z
2011-03
Cheng, H. & Yang, S. (2011) 'Joint QoS multicast routing and channel assignment in multiradio multichannel wireless mesh networks using intelligent computational methods', Applied Soft Computing, 11 (2), pp.1953-1964.
15684946
10.1016/j.asoc.2010.06.011
http://hdl.handle.net/10547/224174
Applied Soft Computing
en
Archived with thanks to Applied Soft Computing
Joint QoS multicast routing and channel assignment in multiradio multichannel wireless mesh networks using intelligent computational methods
Article
oai:uobrep.openrepository.com:10547/2241752013-07-09T09:15:06Zcom_10547_132192col_10547_132231
Yang, Shengxiang
Cheng, Hui
Wang, Fang
2012-05-16T11:47:07Z
2012-05-16T11:47:07Z
2010-01
Yang, S., Cheng, H. & Wang, F. (2010) 'Genetic Algorithms With Immigrants and Memory Schemes for Dynamic Shortest Path Routing Problems in Mobile Ad Hoc Networks', IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews) 40 (1):52-63
1094-6977
1558-2442
10.1109/TSMCC.2009.2023676
http://hdl.handle.net/10547/224175
IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews)
en
Archived with thanks to IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews)
Genetic algorithms with immigrants and memory schemes for dynamic shortest path routing problems in mobile ad hoc networks
Article
oai:uobrep.openrepository.com:10547/2241762020-04-23T08:39:56Zcom_10547_132192col_10547_132231
Cheng, Hui
Yang, Shengxiang
2012-05-16T11:47:32Z
2012-05-16T11:47:32Z
2010-08
Cheng, H. & Yang, S. (2010) 'Genetic algorithms with immigrants schemes for dynamic multicast problems in mobile ad hoc networks', Engineering Applications of Artificial Intelligence. 23 (5):806-819
09521976
10.1016/j.engappai.2010.01.021
http://hdl.handle.net/10547/224176
Engineering Applications of Artificial Intelligence
en
Archived with thanks to Engineering Applications of Artificial Intelligence
Genetic algorithms with immigrants schemes for dynamic multicast problems in mobile ad hoc networks
Article
oai:uobrep.openrepository.com:10547/2241772012-07-06T12:22:56Zcom_10547_132192col_10547_132231
Cheng, Hui
Cao, Jiannong
Fan, Xiaopeng
2012-05-16T11:47:55Z
2012-05-16T11:47:55Z
2009-04
Cheng, H., Cao, J. & Fan, X. (2009) 'GMZRP: Geography-aided multicast zone routing protocol in mobile ad hoc networks', Mobile Networks and Applications, 14 (2), pp.165-177.
1383-469X
1572-8153
10.1007/s11036-008-0135-4
http://hdl.handle.net/10547/224177
Mobile Networks and Applications
en
Archived with thanks to Mobile Networks and Applications
GMZRP: Geography-aided Multicast Zone Routing Protocol in Mobile Ad Hoc Networks
Article
oai:uobrep.openrepository.com:10547/2241822012-07-06T12:18:16Zcom_10547_132192col_10547_132231
Cheng, Hui
Cao, Jiannong
Chen, Hsiao-Hwa
Zhang, Hongke
2012-05-16T13:33:57Z
2012-05-16T13:33:57Z
2008
Cheng, H., Cao, J., Chen, H. & Zhang, H. (2008) 'GrLS: Group-based location service in mobile ad hoc networks', IEEE Transactions on Vehicular Technology, 57 (6), pp.3693-3707.
0018-9545
1939-9359
10.1109/TVT.2008.919614
http://hdl.handle.net/10547/224182
IEEE Transactions on Vehicular Technology
en
Archived with thanks to IEEE Transactions on Vehicular Technology
GrLS: Group-Based Location Service in Mobile Ad Hoc Networks
Article
oai:uobrep.openrepository.com:10547/2245182020-04-23T08:42:53Zcom_10547_132192col_10547_132230
Şenyiğit, Ercan
Düğenci, Muharrem
Aydin, Mehmet Emin
Zeydan, Mithat
2012-05-18T08:13:54Z
2012-05-18T08:13:54Z
2012-05-18
Şenyiğit, E., Düğenci, M., Aydin, M.E. & Zeydan, M. (2012) 'Heuristic-based neural networks for stochastic dynamic lot sizing problem', Applied Soft Computing, .
15684946
10.1016/j.asoc.2012.02.026
http://hdl.handle.net/10547/224518
Applied Soft Computing
Multi-period single-item lot sizing problem under stochastic environment has been tackled by few researchers and remains in need of further studies. It is mathematically intractable due to its complex structure. In this paper, an optimum lot-sizing policy based on minimum total relevant cost under price and demand uncertainties was studied by using various artificial neural networks trained with heuristic-based learning approaches; genetic algorithm (GA) and bee algorithm (BA). These combined approaches have been examined with three domain-specific costing heuristics comprising revised silver meal (RSM), revised least unit cost (RLUC), cost benefit (CB). It is concluded that the feed-forward neural network (FF-NN) model trained with BA outperforms the other models with better prediction results. In addition, RLUC is found the best operating domain-specific heuristic to calculate the total cost incurring of the lot-sizing problem. Hence, the best paired heuristics to help decision makers are suggested as RLUC and FF-NN trained with BA.
en
http://creativecommons.org/licenses/by-nc-nd/4.0/
Archived with thanks to Applied Soft Computing
G400 Computer Science
heuristic-based learning approaches
genetic algorithm
bee algorithm
revised silver meal
revised least unit cost
cost benefit
feed-forward neural network model
neural networks
Heuristic-based neural networks for stochastic dynamic lot sizing problem
Article
oai:uobrep.openrepository.com:10547/2244712020-04-23T08:42:54Zcom_10547_132192col_10547_132230
Aydin, Mehmet Emin
Kwan, Raymond
Leung, Cyril
Maple, Carsten
Zhang, Jie
2012-05-17T16:11:37Z
2012-05-17T16:11:37Z
2012-05-17
Aydin, M.E., Kwan, R., Leung, C., Maple, C. & Zhang, J. (2012) 'A hybrid swarm intelligence algorithm for multiuser scheduling in HSDPA', Applied Soft Computing.
15684946
10.1016/j.asoc.2011.12.007
http://hdl.handle.net/10547/224471
Applied Soft Computing
Multiuser scheduling is an important aspect in the performance optimization of a wireless network since it allows multiple users to access a shared channel efficiently by exploiting multiuser diversity. To perform efficient scheduling, channel state information (CSI) for users is required, and is obtained via their respective feedback channels. In this paper, a more realistic imperfect CSI feedback, in the form of a finite set of Channel Quality Indicator (CQI) values, is assumed as specified in the HSDPA standard. A mathematical model of the problem is developed for use in the optimization process. A hybrid heuristic approach based on particle swarm optimization and simulated annealing is used to solve the problem. Simulation results indicate that the hybrid approach outperforms individual implementations of both simulated annealing and particle swarm optimisation.
en
http://creativecommons.org/licenses/by-nc-nd/4.0/
Archived with thanks to Applied Soft Computing
multiuser scheduling
wireless networks
channel state information
channel quality indicator
HSDPA
particle swarm optimization
simulated annealing
A hybrid swarm intelligence algorithm for multiuser scheduling in HSDPA
Article
oai:uobrep.openrepository.com:10547/2244512020-04-23T08:39:57Zcom_10547_132192col_10547_132230
Aydin, Mehmet Emin
Kwan, Raymond
Wu, Joyce
2012-05-17T15:54:19Z
2012-05-17T15:54:19Z
2012-05-17
Aydin, M.E., Kwan, R. & Wu, J. (2012) 'Multiuser scheduling on the LTE downlink with meta-heuristic approaches', Physical Communication.
18744907
10.1016/j.phycom.2012.01.004
http://hdl.handle.net/10547/224451
Physical Communication
en
Archived with thanks to Physical Communication
Multiuser scheduling on the LTE downlink with meta-heuristic approaches
Article
oai:uobrep.openrepository.com:10547/2252932020-04-23T07:28:37Zcom_10547_132192col_10547_132230
Aydin, Mehmet Emin
2012-05-22T13:43:15Z
2012-05-22T13:43:15Z
2010-07
Aydin, M. (2010) 'Coordinating metaheuristic agents with swarm intelligence'. Journal of Intelligent Manufacturing
23 (4) pp 991-999
0956-5515
1572-8145
10.1007/s10845-010-0435-y
http://hdl.handle.net/10547/225293
Journal of Intelligent Manufacturing
Coordination of multi agent systems remains as a problem since there is no prominent method suggests any universal solution. Metaheuristic agents are specific implementations of multi-agent systems, which imposes working together to solve optimisation problems using metaheuristic algorithms. An idea for coordinating metaheuristic agents borrowed from swarm intelligence is introduced in this paper. This swarm intelligence-based coordination framework has been implemented as swarms of simulated annealing agents collaborated with particle swarm optimization for multidimensional knapsack problem. A comparative performance analysis is also reported highlighting that the implementation has produced much better results than the previous works.
en
metaheuristic agents
swarm intelligence
particle swarm optimization
simulated annealing
Coordinating metaheuristic agents with swarm intelligence
Animation
oai:uobrep.openrepository.com:10547/2252952020-04-23T07:28:39Zcom_10547_132192col_10547_132230
Kwan, Raymond
Aydin, Mehmet Emin
Leung, Cyril
Zhang, J.
2012-05-22T13:46:07Z
2012-05-22T13:46:07Z
2009-08
Kwan, R., Aydin, M., Leung, C. & Zhang, J. (2009) 'Multiuser scheduling in high speed downlink packet access', IET Communications, 3 (8), pp.1363-70.
17518628
10.1049/iet-com.2008.0340
http://hdl.handle.net/10547/225295
IET Communications
Multiuser scheduling is an important aspect in the performance optimisation of a wireless network as it allows multiple users to efficiently access a shared channel by exploiting multiuser diversity. For example, the 3GPP cellular standard supports multiuser scheduling in the high speed downlink packet access (HSDPA) feature. To perform efficient scheduling, channel state information (CSI) for users is required, and is obtained via their respective feedback channels. Multiuser scheduling is studied assuming the availability of perfect CSI, which would require a high bandwidth overhead. A more realistic imperfect CSI feedback in the form of a finite set of channel quality indicator values is assumed, as specified in the HSDPA standard. A global optimal approach and a simulated annealing (CSA) approach are used to solve the optimisation problem. Simulation results suggest that the performances of the two approaches are very close even though the complexity of the simulated annealing (SA) approach is much lower. The performance of a simple greedy approach is found to be significantly worse.
en
Archived with thanks to IET Communications
Multiuser scheduling in high speed downlink packet access
Article
oai:uobrep.openrepository.com:10547/2260122020-04-23T07:37:14Zcom_10547_132192col_10547_132224
Zhou, Zhiguang
Tao, Yubo
Lin, Hai
Dong, Feng
Clapworthy, Gordon J.
2012-05-25T13:21:32Z
2012-05-25T13:21:32Z
2011
Zhou, Z., Tao, Y., Lin, H., Dong, F. & Clapworthy, G.J. (2011) 'Shape-enhanced maximum intensity projection', The Visual Computer, 6 (8), pp.677-686.
0178-2789
1432-2315
10.1007/s00371-011-0570-2
http://hdl.handle.net/10547/226012
The Visual Computer
Maximum intensity projection (MIP) displays the voxel with the maximum intensity along the viewing ray, and this offers simplicity in usage, as it does not require a complex transfer function, the specification of which is a highly challenging and time-consuming process in direct volume rendering (DVR). However, MIP also has its inherent limitation, the loss of spatial context and shape information. This paper proposes a novel technique, shape-enhanced maximum intensity projection (SEMIP), to resolve this limitation. Inspired by lighting in DVR to emphasize surface structures, SEMIP searches a valid gradient for the maximum intensity of each viewing ray, and applies gradient-based shading to improve shape and depth perception of structures. As SEMIP may result in the pixel values over the maximum intensity of the display device, a tone reduction technique is introduced to compress the intensity range of the rendered image while preserving the original local contrast. In addition, depth-based color cues are employed to enhance the visual perception of internal structures, and a focus and context interaction is used to highlight structures of interest. We demonstrate the effectiveness of the proposed SEMIP with several volume data sets, especially from the medical field.
en
Archived with thanks to The Visual Computer
maximum intensity projection
phong shading
tone reduction
depth-based colour
shape perception
Shape-enhanced maximum intensity projection
Article
oai:uobrep.openrepository.com:10547/2280942013-07-19T13:09:45Zcom_10547_132192col_10547_132224
McFarlane, Nigel J.B.
Clapworthy, Gordon J.
Agrawal, Anupam
Viceconti, Marco
Taddei, Fulvia
Schileo, E.
Baruffaldi, F.
2012-06-08T15:01:10Z
2012-06-08T15:01:10Z
2012-06-08
McFarlane, N.J.B., Clapworthy, G.J., Agrawal, A., Viceconti, M., Taddei, F., Schileo, E. & Baruffaldi, F. (2008) '3D Multiscale Visualisation for Medical Datasets',Proc. 5th IEEE Int. Conf on Biomedical visualization, Medivis08, pp 47-52.
10.1109/MediVis.2008.14
http://hdl.handle.net/10547/228094
en
datasets
data visualisation
biomedical imaging
data visualization
medical image processing
3D multiscale visualisation for medical datasets
Meetings and Proceedings
oai:uobrep.openrepository.com:10547/2280772019-09-23T10:24:12Zcom_10547_132192col_10547_132224
Lin, X.
McFarlane, Nigel J.B.
Zhao, Youbing
Clapworthy, Gordon J.
Dong, Feng
Redaelli, A.
2012-06-08T15:06:19Z
2012-06-08T15:06:19Z
2012-06-08
Lin, X., McFarlane, N., Zhao, Y., Clapworthy, G., Dong, F. & Redaelli, A. (2010) Visualisation of Left Ventricular Dysfunction in the Virtual Pathological Heart, In Proc. 7th IEEE Int. Conf on Biomedical visualization (Medivis10), pp 635-640, July 27-29, London, UK (doi: 10.1109/IV.2010.92)
10.1109/IV.2010.92
http://hdl.handle.net/10547/228077
en
G400 Computer Science
Visualisation of left ventricular dysfunction in the virtual pathological heart
Meetings and Proceedings
oai:uobrep.openrepository.com:10547/2280952019-09-23T10:23:59Zcom_10547_132192col_10547_132224
Agrawal, Anupam
Testi, Debora
Taddei, Fulvia
Viceconti, Marco
Dong, Feng
McFarlane, Nigel J.B.
Clapworthy, Gordon J.
Kohout, Josef
2012-06-08T15:04:31Z
2012-06-08T15:04:31Z
2012-06-08
A. Agrawal, J. Kohout, G.J. Clapworthy, N.J.B. McFarlane, F. Dong, M. Viceconti, F. Taddei and D. Testi (2008) 'Interactive Out-of-Core Exploration of Large Volume Datasets in VTK-Based Visualisation Systems', Proc. EGUK TP.CG.08 - Theory and practice of computer graphics, pp 1-8, June 9-11, Manchester, UK
http://hdl.handle.net/10547/228095
en
G400 Computer Science
data visualisation
datasets
Interactive out-of-core exploration of large volume datasets in VTK-based visualisation systems
Meetings and Proceedings
oai:uobrep.openrepository.com:10547/2280782020-04-23T07:28:47Zcom_10547_132192col_10547_132231
Ajmal, Tahmina
Bain, Robert Edward Shenton
Gundry, Stephen
Walsh, Philip
Wightman, Craig Ian
2012-06-08T15:14:38Z
2012-06-08T15:14:38Z
2010-11-04
Ajmal, T., Bain, R., Gundry, S., Walsh, p. & Wightman, C. (2010) Apparatus for testing the quality of a fluid sample. UK Intellectual Property Office Patent no. WO/2010/125404. Available at http://patentscope.wipo.int/search/en/WO2010125404
http://hdl.handle.net/10547/228078
Apparatus for testing the quality of a fluid sample comprising a body defining an interior space including a primary chamber and one or more secondary chambers, the apparatus having a first configuration in which it is arranged to hold at least some of the fluid sample in the primary chamber and a second configuration in which it is arranged to isolate a first portion of the fluid sample within the one or more secondary chambers whilst retaining a second portion of the fluid sample in the primary chamber
en
fluid sample
quality testing
Apparatus for testing the quality of a fluid sample
Patent
oai:uobrep.openrepository.com:10547/2509322020-04-23T07:37:04Zcom_10547_132192col_10547_132224
Liang, Ronghua
Wu, Yunfei
Dong, Feng
Clapworthy, Gordon J.
2012-11-05T09:27:52Z
2012-11-05T09:27:52Z
2012-06
Accumulation of local maximum intensity for feature enhanced volume rendering 2012, 28 (6-8):625-633 The Visual Computer
0178-2789
1432-2315
10.1007/s00371-012-0680-5
http://hdl.handle.net/10547/250932
The Visual Computer
Maximum Intensity Difference Accumulation (MIDA) combines the advantage of Direct Volume Rendering (DVR) and Maximum Intensity Projection (MIP). However, many features with local maximum intensity are still missing in the final rendering image. This paper presents a novel approach to focus on features with local maximum intensity within the dataset. Moving Least Squares (MLS) is used to smooth each ray profile during the raycasting in order to eliminate noise in the data and to highlight significant transition points on the profile. We then adopt a local minimum-point searching method to analyze the ray profile, and identify the transition points that mark the local maximum intensity points within the dataset. At the rendering stage, we implement a novel local intensity difference accumulation (LIDA) to accumulate the colors and opacity. Surface shading is introduced to improve the spatial cues of the features. We also employ tone-reduction to preserve the original local contrast. Our approach can highlight local features in the dataset without involving the adjustment of transfer functions. The experiments demonstrate high-quality rendering results at an interactive frame rate.
en
Archived with thanks to The Visual Computer
Accumulation of local maximum intensity for feature enhanced volume rendering
Article
oai:uobrep.openrepository.com:10547/2509332020-04-23T07:37:25Zcom_10547_132192col_10547_132224
Ersotelos, Nikolaos
Dong, Feng
2012-11-05T09:29:51Z
2012-11-05T09:29:51Z
2008
Building highly realistic facial modeling and animation: a survey 2007, 24 (1):13-30 The Visual Computer
0178-2789
1432-2315
10.1007/s00371-007-0175-y
http://hdl.handle.net/10547/250933
The Visual Computer
This paper provides a comprehensive survey on the techniques for human facial modeling and animation. The survey is carried out from two different perspectives: facial modeling, which concerns how to produce 3D face models, and facial animation, which regards how to synthesize dynamic facial expressions. To generate an individual face model, we can either perform individualization of a generic model or combine face models from an existing face collection. With respect to facial animation, we have further categorized the techniques into simulation-based, performance-driven and shape blend-based approaches. The strength and weakness of these techniques within each category are discussed, alongside with the applications of these techniques to various exploitations. In addition, a brief historical review of the technique evolution is provided. Limitations and future trend are discussed. Conclusions are drawn at the end of the paper.
en
facial modeling
facial expression and animation
generic model adaptation
morphable modeling
pseudo muscles
performance-driven animation
blend shapes
Building highly realistic facial modeling and animation: a survey
Article
oai:uobrep.openrepository.com:10547/2509342020-04-23T07:37:04Zcom_10547_132192col_10547_132224
Liu, Baoquan
Clapworthy, Gordon J.
Dong, Feng
Prakash, Edmond C.
2012-11-05T09:33:44Z
2012-11-05T09:33:44Z
2012-08-10
Liu, B. et al (2012) 'Octree Rasterization: Accelerating High-Quality Out-of-Core GPU Volume Rendering' 1 IEEE Transactions on Visualization and Computer Graphics Vol PP Issue 99
1077-2626
10.1109/TVCG.2012.151
http://hdl.handle.net/10547/250934
IEEE Transactions on Visualization and Computer Graphics
We present a novel approach for GPU-based high quality volume rendering of large out-of-core volume data. By focusing on the locations and costs of ray traversal, we are able to significantly reduce the rendering time over traditional algorithms. We store a volume in an octree (of bricks); in addition, every brick is further split into regular macro-cells. Our solutions move the branch-intensive accelerating structure traversal out of the GPU raycasting loop and introduce an efficient empty-space culling method by rasterizing the proxy geometry of a view-dependent cut of the octree nodes. This rasterization pass can capture all of the bricks that the ray penetrates in a per-pixel list. Since the per-pixel list is captured in a front-to-back order, our raycasting pass needs only to cast rays inside the tighter ray segments. As a result, we achieve two levels of empty space skipping: the brick level and the macro-cell level. During evaluation and testing, this technique achieved 2 to 4 times faster rendering speed than a current state-of-the-art algorithm across a variety of data sets.
en
octrees
graphics processing unit
rendering (computer graphics)
acceleration
interpolation
cameras
casting
ray casting
GPU techniques
volume rendering
Octree rasterization: accelerating high-quality out-of-core GPU volume rendering
Article
oai:uobrep.openrepository.com:10547/2509382020-04-23T07:29:08Zcom_10547_132192col_10547_132230
Kang, Xiaoming
Yue, Yong
Li, Dayou
Maple, Carsten
2012-11-05T09:43:28Z
2012-11-05T09:43:28Z
2011
Genetic algorithm based solution to dead-end problems in robot navigation 2011, 41 (3/4):177-184 International Journal of Computer Applications in Technology
0952-8091
1741-5047
10.1504/IJCAT.2011.042693
http://hdl.handle.net/10547/250938
International Journal of Computer Applications in Technology
In robot navigation, mobile robots can suffer from dead-end problems, that is, they can be stuck in areas which are surrounded by obstacles. Attempts have been reported to avoid a robot entering into such a dead-end area. However, in some applications, for example, rescue work, the dead-end areas must be explored. Therefore, it is vital for the robot to come out from the dead-end areas after exploration. This paper presents an approach which enables a robot to come out from dead-end areas. There are two main parts: a dead-end detection mechanism and a genetic algorithm (GA) based online training mechanism. When the robot realises that it is stuck in a dead-end area, it will operate the online training to produce a new best chromosome that will enable the robot to escape from the area.
en
Archived with thanks to International Journal of Computer Applications in Technology
dead end areas
genetic algorithms
obstacle avoidance
robot navigation
mobile robots
robotic exploration
dead-end detection
escape mechanisms
dead ends
Genetic algorithm based solution to dead-end problems in robot navigation
Article
oai:uobrep.openrepository.com:10547/2509182020-04-23T07:37:09Zcom_10547_132192col_10547_132231
Comşa, Ioan-Sorin
Aydin, Mehmet Emin
Zhang, Sijing
Kuonen, Pierre
Wagen, Jean–Frédéric
2012-11-05T10:46:13Z
2012-11-05T10:46:13Z
2012
Comşa, I.S., Aydin, M.E., Zhang, S., Kuonen, P., Wagen, J.F. (2012) 'Multi Objective Resource Scheduling in LTE Networks Using Reinforcement Learning' International Journal of Distributed Systems and Technologies 3 (2):39 - 57
1947-3532
1947-3540
10.4018/jdst.2012040103
http://hdl.handle.net/10547/250918
International Journal of Distributed Systems and Technologies
The use of the intelligent packet scheduling process is absolutely necessary in order to make the radio resources usage more efficient in recent high-bit-rate demanding radio access technologies such as Long Term Evolution (LTE). Packet scheduling procedure works with various dispatching rules with different behaviors. In the literature, the scheduling disciplines are applied for the entire transmission sessions and the scheduler performance strongly depends on the exploited discipline. The method proposed in this paper aims to discuss how a straightforward schedule can be provided within the transmission time interval (TTI) sub-frame using a mixture of dispatching disciplines per TTI instead of a single rule adopted across the whole transmission.
en
Multi objective resource scheduling in LTE networks using reinforcement learning
Article
oai:uobrep.openrepository.com:10547/2509462020-04-23T07:29:09Zcom_10547_132192col_10547_132231
Huang, Wei
Li, Ru
Maple, Carsten
Yang, Hong-Ji
Foskett, David
Cleaver, Vince
2012-11-05T10:47:46Z
2012-11-05T10:47:46Z
2010
Huang, W. et al (2010) 'A novel lifecycle model for Web-based application development in small and medium enterprises' International Journal of Automation and Computing 7 (3):389-398
1476-8186
1751-8520
10.1007/s11633-010-0519-3
http://hdl.handle.net/10547/250946
International Journal of Automation and Computing
Software engineering's lifecycle models have proven to be very important for traditional software development. However, can these models be applied to the development of Web-based applications as well? In recent years, Web-based applications have become more and more complicated and a lot of efforts have been placed on introducing new technologies such as J2EE, PhP, and .NET, etc., which have been universally accepted as the development technologies for Web-based applications. However, there is no universally accepted process model for the development of Web-based applications. Moreover, shaping the process model for small medium-sized enterprises (SMEs), which have limited resources, has been relatively neglected. Based on our previous work, this paper presents an expanded lifecycle process model for the development of Web-based applications in SMEs. It consists of three sets of processes, i.e., requirement processes, development processes, and evolution processes. Particularly, the post-delivery evolution processes are important to SMEs to develop and maintain quality web applications with limited resources and time.
en
Web
Web-based applications
lifecycle models
small to medium-sized enterprises
A novel lifecycle model for Web-based application development in small and medium enterprises
Article
oai:uobrep.openrepository.com:10547/2509472020-04-23T07:29:15Zcom_10547_132192col_10547_132231
Viduto, Valentina
Maple, Carsten
Huang, Wei
2012-11-05T10:48:50Z
2012-11-05T10:48:50Z
2011
Viduto, V., Maple, C., Huang, W. (2011) 'Managing threats by the use of visualisation techniques' International Journal of Space-Based and Situated Computing 1 (2/3):204-212
2044-4893
2044-4907
10.1504/IJSSC.2011.040347
http://hdl.handle.net/10547/250947
International Journal of Space-Based and Situated Computing
Identification of threats in networked systems is one of the important risk management processes that should be followed in order to be aware of all risks. In general, risk assessment guidelines for threat analysis propose to use historical organisation's data, thus, novel and unheard threats often are skipped from an analysis. In this paper, we propose a novel onion skin model (OSM) which consists of visualisation techniques, such as attack graphs, often applied for qualitative and quantitative risk assessment analyses. The model can be used to facilitate in threat identification and decision-making process by focusing on attack scenarios that illustrate vulnerable nodes, threats and shortest attack paths to the attacker's goal. The model can be used as part of risk management practices to improve security awareness through different attack scenarios and manage all system risks.
en
onion skin model
OSM
visualisation techniques
risk management
attack graphs
attack trees
network hardening
network threats
risk assessment
network attacks
threat identification
decision making
vulnerable nodes
vulnerability
network security
attack scenarios
Managing threats by the use of visualisation techniques
Article
oai:uobrep.openrepository.com:10547/2509502020-04-23T07:29:09Zcom_10547_132192col_10547_132230
Oussena, Samia
French, Tim
2012-11-05T11:09:28Z
2012-11-05T11:09:28Z
2011
Integrating the Semiotic into UML via Enhancing and Cross-validating Use Case with an Enriched Domain Model 2009, 1 (3):15-31 International Journal of Sociotechnology and Knowledge Development
1941-6253
1941-6261
10.4018/jskd.2009070102
http://hdl.handle.net/10547/250950
International Journal of Sociotechnology and Knowledge Development
Use case models are a representation of the way in which users of the system interact with it. The UML specification driven approach to system development enable the use case model to be continuously refined and cross-validated from a number of system viewpoints. However, little has been done for validating the model against the organisational and workgroup setting in which the system will reside. This article aims to address this gap by the use of techniques derived from organisational semiotics for validating use case models against a wider aspect of organisational culture and meaning making at the organisational, workgroup and actor level of abstraction. Such approach will enhance the system development by providing “goodness of fit” between system model and organisational values and beliefs.
en
Archived with thanks to International Journal of Sociotechnology and Knowledge Development
Integrating the semiotic into UML via enhancing and cross-validating use case with an enriched domain model
Article
oai:uobrep.openrepository.com:10547/2509132020-04-23T07:29:08Zcom_10547_132192col_10547_132231
Sipal, Vit
Allen, Ben
Edwards, David J.
2012-11-05T09:36:26Z
2012-11-05T09:36:26Z
2012-07-03
Sipal, V., Allen, B., Edwards, D.J. (2012) 'Multi-tone frequency shift keying for ultrawideband wireless communications' IET Communications 6 (10):1170-1178
17518628
10.1049/iet-com.2010.1080
http://hdl.handle.net/10547/250913
IET Communications
The study explores the performance of multi-tone frequency shift keying (MT-FSK) in ultrawideband (UWB) wireless communications as an alternative to the standard modulation techniques. Its advantage is its ability to provide multiple user access even within the recently tightened regulations on UWB communications. Unlike previous works that discussed MT-FSK from the information theory perspective, here the possibility of practical implementation is explored. The basic system parameters such as tone bandwidth, number of frequencies and duty cycle are studied in terms of propagation characteristics, optimum data rate and system complexity. With optimum parameters, the authors show that a system using MT-FSK is capable of data transmission at a data rate of 250 Mbps with bit-error-rate below 10-5 whereas the receiver complexity is lower than for standard methods utilising the UWB spectrum by means of impulse radio or multi-band orthogonal frequency division multiplexing (OFDM).
en
Multi-tone frequency shift keying for ultrawideband wireless communications
Article
oai:uobrep.openrepository.com:10547/2509372020-04-23T07:29:08Zcom_10547_132192col_10547_132230
Wang, Zuobin
Li, Dayou
Zhang, Jin
Ji, Ze
Qiu, Renxi
2012-11-05T09:42:36Z
2012-11-05T09:42:36Z
2011
Wang, Z. et al (2011) 'Robotic nanoassembly: current developments and challenges' International Journal of Computer Applications in Technology 41 (3/4):185-194
0952-8091
1741-5047
10.1504/IJCAT.2011.042694
http://hdl.handle.net/10547/250937
International Journal of Computer Applications in Technology
Robotic nanoassembly is an emerging field that deals with the controlled manipulation, handling and assembly of atoms, molecules and nano objects by robots for manufacturing of nano structures, devices and systems. Nanoassembly is expected to have revolutionary applications in almost all the scientific and technological areas. This paper presents a general review of nanoassembly by robots considering its current developments and challenges. It discusses scanning probe-based 2D nanomanipulation, gripper-based 3D nanohandling, object-oriented nanoassembly and hybrid nanoassembly techniques, which are the main topics of interest in the field. The challenging issues in robotic nanoassembly are outlined together with the topics.
en
robotic nanoassembly
robotics
nanomanipulation
nanohandling
nanometrology
nanomanufacturing
nanotechnology
robotic assembly
object-oriented nanoassembly
Robotic nanoassembly: current developments and challenges
Article
oai:uobrep.openrepository.com:10547/2509142020-04-23T08:42:53Zcom_10547_132192col_10547_132230
Chan, K.Y.
Kwong, C.K.
Jiang, H.
Aydin, Mehmet Emin
Fogarty, T.C.
2012-11-05T09:50:03Z
2012-11-05T09:50:03Z
2010-05
Chan, K.Y. et al (2010) 'A new orthogonal array based crossover, with analysis of gene interactions, for evolutionary algorithms and its application to car door design' Expert Systems with Applications 37 (5):3853-3862
0957-4174
10.1016/j.eswa.2009.11.033
http://hdl.handle.net/10547/250914
Expert Systems with Applications
Recent research shows that orthogonal array based crossovers outperform standard and existing crossovers in evolutionary algorithms in solving parametrical problems with high dimensions and multi-optima. However, those crossovers employed so far, ignore the consideration of interactions between genes. In this paper, we propose a method to improve the existing orthogonal array based crossovers by integrating information of interactions between genes. It is empirically shown that the proposed orthogonal array based crossover outperforms significantly both the existing orthogonal array based crossovers and standard crossovers on solving parametrical benchmark functions that interactions exist between variables. To further compare the proposed orthogonal array based crossover with the existing crossovers in evolutionary algorithms, a validation test based on car door design is used in which the effectiveness of the proposed orthogonal array based crossover is studied.
en
A new orthogonal array based crossover, with analysis of gene interactions, for evolutionary algorithms and its application to car door design
Article
oai:uobrep.openrepository.com:10547/2509422020-04-23T07:36:21Zcom_10547_132192col_10547_132231
Zhang, Yue
Zhang, Chunhui
Cosmas, John
Kok-Keong Loo
Owens, T.
Di Bari, R.
Lostanlen, Y.
Bard, M.
2012-11-05T09:55:13Z
2012-11-05T09:55:13Z
2008-09
Zhang, Y. et al (2008) 'Analysis of DVB-H Network Coverage With the Application of Transmit Diversity' IEEE Transactions on Broadcasting 54 (3):568-577
0018-9316
10.1109/TBC.2008.2002165
http://hdl.handle.net/10547/250942
IEEE Transactions on Broadcasting
This paper investigates the effects of the cyclic delay diversity (CDD) transmit diversity scheme on DVB-H networks. Transmit diversity improves reception and quality of service (QoS) in areas of poor coverage such as sparsely populated or obscured locations. The technique not only provides robust reception in mobile environments thus improving QoS, but it also reduces network costs in terms of the transmit power, number of infrastructure elements, antenna height and the frequency reuse factor over indoor and outdoor environments. In this paper, the benefit and effectiveness of CDD transmit diversity is tackled through simulation results for comparison in several scenarios of coverage in DVB-H networks. The channel model used in the simulations is based on COST207 and a basic radio planning technique is used to illustrate the main principles developed in this paper. The work reported in this paper was supported by the European Commission IST project - PLUTO (physical layer DVB transmission optimization).
en
Analysis of DVB-H network coverage with the application of transmit diversity
Article
oai:uobrep.openrepository.com:10547/2509432020-04-23T07:36:21Zcom_10547_132192col_10547_132231
Di Bari, R.
Bard, M.
Zhang, Yue
Nasr, K.M.
Cosmas, John
Kok-Keong Loo
Nilavalan, R.
Shirazi, H.
Krishnapillai, K.
2012-11-05T09:56:41Z
2012-11-05T09:56:41Z
2008-09
Di Bari, R. et al (2008) 'Laboratory Measurement Campaign of DVB-T Signal With Transmit Delay Diversity', IEEE Transactions on Broadcasting 54 (3):532-541
0018-9316
1557-9611
10.1109/TBC.2008.2000462
http://hdl.handle.net/10547/250943
IEEE Transactions on Broadcasting
The requirements for future DVB-T/H networks demand that broadcasters design and deploy networks that provide ubiquitous reception in challenging indoors and other obstructed situations. It is essential that such networks are designed cost-effectively and with minimized environmental impact. The EC funded project PLUTO has since its start in 2006 explored the use of diversity to improve coverage in these difficult situations. The purpose of this paper is to investigate the performance of Transmit Delay Diversity (DD) with two antennas to improve the reception of DVB-T/H systems operating in different realistic propagation conditions through a series of tests using a SPIRENT SR5500 dual channel emulator. The relationship between correlation coefficient between channels, receiver velocity and diversity gain is investigated. It is shown that transmit delay diversity significantly improves the quality of reception particularly in simulated fast fading mobile broadcasting applications. This paper documents research conducted by Brunel University and Broadreach Systems.
en
Laboratory measurement campaign of DVB-T signal with transmit delay diversity
Article
oai:uobrep.openrepository.com:10547/2509152020-04-23T07:37:12Zcom_10547_132192col_10547_132231
Dyo, Vladimir
Yousef, Kharsim
Ellwood, Stephen A.
Macdonald, David W.
Markham, Andrew
Trigoni, Niki
Wohlers, Ricklef
Mascolo, Cecilia
Pásztor, Bence
Scellato, Salvatore
2012-11-05T09:59:39Z
2012-11-05T09:59:39Z
2012-09
Dyo, V. et al (2012) 'WILDSENSING' ACM Transactions on Sensor Networks 8 (4):1 (article No. 29)
1550-4859
10.1145/2240116.2240118
http://hdl.handle.net/10547/250915
ACM Transactions on Sensor Networks
The increasing adoption of wireless sensor network technology in a variety of applications, from agricultural to volcanic monitoring, has demonstrated their ability to gather data with unprecedented sensing capabilities and deliver it to a remote user. However, a key issue remains how to maintain these sensor network deployments over increasingly prolonged deployments. In this article, we present the challenges that were faced in maintaining continual operation of an automated wildlife monitoring system over a one-year period. This system analyzed the social colocation patterns of European badgers (Meles meles) residing in a dense woodland environment using a hybrid RFID-WSN approach. We describe the stages of the evolutionary development, from implementation, deployment, and testing, to various iterations of software optimization, followed by hardware enhancements, which in turn triggered the need for further software optimization. We highlight the main lessons learned: the need to factor in the maintenance costs while designing the system; to consider carefully software and hardware interactions; the importance of rapid prototyping for initial deployment (this was key to our success); and the need for continuous interaction with domain scientists which allows for unexpected optimizations.
en
WILDSENSING: design and deployment of a sustainable sensor network for wildlife monitoring
Article
oai:uobrep.openrepository.com:10547/2509452020-04-23T08:42:53Zcom_10547_132192col_10547_132231
Wang, Jun
Zhang, Sijing
Maple, Carsten
Zhao, Zhengxu
2012-11-05T10:27:48Z
2012-11-05T10:27:48Z
2009-03
Guaranteeing hard real-time traffic with legitimately short deadlines with the timed token protocol 2009, 31 (3):557-565 Computer Standards & Interfaces
09205489
10.1016/j.csi.2008.03.019
http://hdl.handle.net/10547/250945
Computer Standards & Interfaces
Synchronous bandwidth, defined as the maximum time a node is allowed to send its synchronous messages while holding the token, is a sensitive parameter for deadline guarantees of synchronous messages in any timed token network. In order to offer such guarantees, synchronous bandwidth has to be allocated carefully to each individual node. This paper studies the synchronous bandwidth allocated to those synchronous message streams whose deadlines are less than twice the Target Token Rotation Time (TTRT). A new approach for allocating synchronous bandwidth to such streams, which can be used with any previously published local synchronous bandwidth allocation (SBA) for guaranteeing a general synchronous message set with its minimum deadline (D"m"i"n) no less than 2.TTRT, is proposed. The proposed scheme can be applied efficiently in practice to any general synchronous message set with D"m"i"n>TTRT. Numerical examples are presented to demonstrate the enhanced performance of this new local scheme over any of the previously published local SBA schemes.
en
Archived with thanks to Computer Standards & Interfaces
Guaranteeing hard real-time traffic with legitimately short deadlines with the timed token protocol
Article
oai:uobrep.openrepository.com:10547/2509172020-04-23T07:29:09Zcom_10547_132192col_10547_132231
Wang, Jun
Zhang, Sijing
Maple, Carsten
2012-11-05T10:28:29Z
2012-11-05T10:28:29Z
2011-03
Guaranteeing the timely transmission of periodic messages with arbitrary deadline constraints using the timed token media access control protocol 2011, 5 (4):519-533 IET Communications
17518628
10.1049/iet-com.2010.0006
http://hdl.handle.net/10547/250917
IET Communications
Synchronous bandwidth, defined as the maximum time a node is allowed to send its synchronous messages while holding the token, is a sensitive parameter for deadline guarantees of synchronous messages in a timed token network. In order to offer such guarantees, synchronous bandwidth has to be allocated carefully. The allocation of synchronous bandwidths to a general synchronous message set with the minimum message deadline (Dmin) larger than the target token rotation time is studied. A new approach for allocating synchronous bandwidth, which can be easily implemented in practice, is proposed. It is demonstrated, through simulations and numerical examples, that the proposed approach performs better than any of previously proposed local synchronous bandwidth allocation schemes, in terms of its ability in guaranteeing hard real-time traffic.
en
Archived with thanks to IET Communications
Guaranteeing the timely transmission of periodic messages with arbitrary deadline constraints using the timed token media access control protocol
Article
oai:uobrep.openrepository.com:10547/2509482020-04-23T08:42:54Zcom_10547_132192col_10547_132230
Bessis, Nik
Huang, Ye
Norrington, Peter
Brown, Antony
Kuonen, Pierre
Hirsbrunner, Beat
2012-11-05T10:58:14Z
2012-11-05T10:58:14Z
2011-01
Bessis, N. et al (2011) 'Modelling of a self-led critical friend topology in inter-cooperative grid communities' Simulation Modelling Practice and Theory 19 (1):5-16
1569190X
10.1016/j.simpat.2010.06.020
http://hdl.handle.net/10547/250948
Simulation Modelling Practice and Theory
For decades, much work has been done to increase the effectiveness and efficiency of job sharing amongst available computational resources. Resources can be organized into a variety of topologies, and recent work has shown that a decentralized distributed resource topology is a crucial but complicated scenario. This is because decentralized resources are normally grouped into independent virtual organizations (VOs) and isolated from each other by VO boundaries. To convey jobs across gaps between various virtual organizations, a novel resource topology called the self-led critical friend model (CFM) is proposed in this work. The CFM deals with trust credits between resources according to their historical collaboration records. This trust reveals a feasible, realistic, and transferable correlation to facilitate the resource selection process for job delegation between arbitrarily connected physical resources. Consequently, the CFM is able to overcome the constraints caused by virtual organization boundaries.
en
grid
grid scheduling
critical friend model
CFM
self-led critical friend
inter-cooperative grid
Modelling of a self-led critical friend topology in inter-cooperative grid communities
Article
oai:uobrep.openrepository.com:10547/2509202020-04-23T07:29:09Zcom_10547_132192col_10547_132230
Bessis, Nik
Brown, Antony
Asimakopoulou, Eleana
2012-11-05T10:59:38Z
2012-11-05T10:59:38Z
2010
A Mathematical Analysis of a Disaster Management Data-Grid Push Service 2010, 1 (3):56-70 International Journal of Distributed Systems and Technologies
1947-3532
1947-3540
10.4018/jdst.2010070104
http://hdl.handle.net/10547/250920
International Journal of Distributed Systems and Technologies
Much work is under way within the Grid technology community on issues associated with the development of services fostering the integration and exploitation of multiple autonomous, distributed data sources through a seamless and flexible virtualized interface. These developments involve fluid and dynamic, ad hoc based interactions between dispersed service providers and consumers. However, several obstacles arise in the design and implementation of such services. In this article, the authors examine a notable obstacle, namely how to keep service consumers informed of relevant changes about data committed in multiple and distributed service provider levels, and most importantly, when these changes can affect others’ well-being. To achieve this, the authors use aggregated case scenarios to demonstrate the need for a data-Grid push service in a disaster management situation. In this regard, the article describes in detail the service architecture, as well as its mathematical analysis for keeping interested stakeholders informed automatically about relevant and critical data changes.
en
Archived with thanks to International Journal of Distributed Systems and Technologies
A mathematical analysis of a disaster management data-grid push service
Article
oai:uobrep.openrepository.com:10547/2509212020-04-23T07:29:09Zcom_10547_132192col_10547_132230
Brown, Antony
Sant, Paul
Bessis, Nik
French, Tim
Maple, Carsten
2012-11-05T11:02:25Z
2012-11-05T11:02:25Z
2010
Modelling Self-Led Trust Value Management in Grid and Service Oriented Infrastructures 2010, 1 (4):1-18 International Journal of Systems and Service-Oriented Engineering
1947-3052
1947-3060
10.4018/jssoe.2010100101
http://hdl.handle.net/10547/250921
International Journal of Systems and Service-Oriented Engineering
Current developments in grid and service oriented technologies involve fluid and dynamic, ad hoc based interactions between delegates, which in turn, serves to challenge conventional centralised structured trust and security assurance approaches. Delegates ranging from individuals to large-scale VO (Virtual Organisations) require the establishment of trust across all parties as a prerequisite for trusted and meaningful e-collaboration. In this paper, a notable obstacle, namely how such delegates (modelled as nodes) operating within complex collaborative environment spaces can best evaluate in context to optimally and dynamically select the most trustworthy ad hoc based resource/service for e-consumption. A number of aggregated service case scenarios are herein employed in order to consider the manner in which virtual consumers and provider ad hoc based communities converge. In this paper, the authors take the view that the use of graph-theoretic modelling naturally leads to a self-led trust management decision based approach in which delegates are continuously informed of relevant up-to-date trust levels. This will lead to an increased confidence level, which trustful service delegation can occur. The key notion is of a self-led trust model that is suited to an inherently low latency, decentralised trust security paradigm.
en
Archived with thanks to International Journal of Systems and Service-Oriented Engineering
Modelling self-led trust value management in grid and service oriented infrastructures
Article
oai:uobrep.openrepository.com:10547/2509492020-04-23T07:29:09Zcom_10547_132192col_10547_132230
Shenoy, Aruna
Anthony, Sue
Frank, Ray
Davey, Neil
2012-11-05T11:05:27Z
2012-11-05T11:05:27Z
2011-09
Categorizing facial expressions: a comparison of computational models 2011, 20 (6):815-823 Neural Computing and Applications
0941-0643
1433-3058
10.1007/s00521-010-0446-9
http://hdl.handle.net/10547/250949
Neural Computing and Applications
Recognizing expressions is a key part of human social interaction, and processing of facial expression information is largely automatic for humans, but it is a non-trivial task for a computational system. The purpose of this work is to develop computational models capable of differentiating between a range of human facial expressions. Raw face images are examples of high-dimensional data, so here we use two dimensionality reduction techniques: principal component analysis and curvilinear component analysis. We also preprocess the images with a bank of Gabor filters, so that important features in the face images may be identified. Subsequently, the faces are classified using a support vector machine. We show that it is possible to differentiate faces with a prototypical expression from the neutral expression. Moreover, we can achieve this with data that has been massively reduced in size: in the best case the original images are reduced to just 5 components. We also investigate the effect size on face images, a concept which has not been reported previously on faces. This enables us to identify those areas of the face that are involved in the production of a facial expression.
en
Archived with thanks to Neural Computing and Applications
Categorizing facial expressions: a comparison of computational models
Article
oai:uobrep.openrepository.com:10547/2509232020-04-23T07:29:09Zcom_10547_132192col_10547_132230
French, Tim
2012-11-05T11:06:47Z
2012-11-05T11:06:47Z
2009
Virtual Organisational Trust Requirements 2009, 5 (2):1-16 International Journal of Intelligent Information Technologies
1548-3657
1548-3665
10.4018/jiit.2009040101
http://hdl.handle.net/10547/250923
International Journal of Intelligent Information Technologies
It is suggested that the use of the semiotic ladder, together with a supportive trust agent can be used together to better explicate “soft” trust issues in the context of Grid services. The contribution offered here is intended to fill a gap in current understanding and modelling of such issues and to support Grid service designers to better conceptualise, hence manage trust issues. The semiotic paradigm is intended to offer an integrative viewpoint within which to explicate “soft” trust issues throughout the Grid life-cycle. A computationally lightweight trust agent is described that can be used to verify high level trust of a Virtual Organisation. The potential benefits of the approach that is advocated here include the reduction of risk and potential improvements in the quality and reliability of Grid service partnerships. For these benefits to accrue, explicit “soft” as well as “hard” trust management is essential as is an integrative viewpoint.
en
Archived with thanks to International Journal of Intelligent Information Technologies
Virtual organisational trust requirements
Article
oai:uobrep.openrepository.com:10547/2509252020-04-23T07:29:09Zcom_10547_132192col_10547_132230
French, Tim
Bessis, Nik
Xhafa, Fatos
Maple, Carsten
2012-11-05T11:10:15Z
2012-11-05T11:10:15Z
2011
Towards a corporate governance trust agent scoring model for collaborative virtual organisations 2011, 2 (2):98-108 International Journal of Grid and Utility Computing
1741-847X
1741-8488
10.1504/IJGUC.2011.040597
http://hdl.handle.net/10547/250925
International Journal of Grid and Utility Computing
In this 'visionary' paper, we describe how a semiotic ladder, together with a supportive trust agent, can be used to address 'soft' trust issues in the context of collaborative Virtual Organisations (VOs). The intention is to offer all parties better support for trust (as reputation) management, including the reduction of risk and improved reliability of VO e-services. The semiotic ladder is intended to support the VO e-service life cycle through the articulation of e-trust at various levels of system abstraction, including trust as a measurable confidence level. A novel trust agent is used to provide the consumer with an objective measure of the trustworthiness of the e-service at runtime, just prior to its actual consumption. Specifically, VO consumer confidence level is informed via a set of Corporate Governance (CG) scores, which are used as a trust proxy for the 'real' owner of the VO.
en
Archived with thanks to International Journal of Grid and Utility Computing
semiotic ladders
lightweight trust agents
scoring systems
corporate governance scores
past performance historys
grid services
cloud computing
collaborative virtual organisations
context-aware trust
grid computing
collaboration
trust management
reputation management
e-services
electronic services
online services
trustworthiness
Towards a corporate governance trust agent scoring model for collaborative virtual organisations
Article
oai:uobrep.openrepository.com:10547/2509242020-04-23T07:29:09Zcom_10547_132192col_10547_132230
French, Tim
Bessis, Nik
Maple, Carsten
Asimakopoulou, Eleana
2012-11-05T11:07:55Z
2012-11-05T11:07:55Z
2012
Trust Issues on Crowd-Sourcing Methods for Urban Environmental Monitoring 2012, 3 (1):35-48 International Journal of Distributed Systems and Technologies
1947-3532
1947-3540
10.4018/jdst.2012010103
http://hdl.handle.net/10547/250924
International Journal of Distributed Systems and Technologies
This paper explores trust related issues arising from the use of a crowd-sourcing method. Crowd-sourcing is a relatively new method that utilises modern technologies to gather, analyse and visualise specific “on-the-fly” data. The data is typically acquired through the employment of mobile technology, with each device running a bespoke application that captures the desired information. The resulting “crowd sourced” data is readily available and the corresponding maps produced can in turn, be used to support strategic planning and to facilitate overall, more informed decision-making. The purpose is to provide insights into this novel approach to data collection, aggregation and subsequent visualisation. Specifically, the focus centres upon issues of trust and security that are inherent not merely to the use of crowd sourced data capture itself, but also crucially, to the stewardship and usage of the resultant data sets within e-government settings. A novel community centric usage scenario is presented that seeks to show how issues of trust pervade the technology. Hence, both rewards and risks are revealed and we go on to outline a preliminary approach intended to support a trusted and reputable “crowdy” data architecture.
en
Archived with thanks to International Journal of Distributed Systems and Technologies
Trust issues on crowd-sourcing methods for urban environmental monitoring
Article
oai:uobrep.openrepository.com:10547/2509222020-04-23T07:29:09Zcom_10547_132192col_10547_132230
Sotiriadis, Stelios
Bessis, Nik
Huang, Ye
Sant, Paul
Maple, Carsten
2012-11-05T11:03:57Z
2012-11-05T11:03:57Z
2011
Defining Minimum Requirements of Inter-Collaborated Nodes by Measuring the Weight of Node Interactions 2011, 2 (3):19-37 International Journal of Distributed Systems and Technologies
1947-3532
1947-3540
10.4018/jdst.2011070102
http://hdl.handle.net/10547/250922
International Journal of Distributed Systems and Technologies
This paper focuses on defining the minimum requirements to support the inter-cooperation between various scales, dynamically evolved Virtual Organizations (VOs). This proposed method is able to assign a weighted value to each pair-wise path that each member (node) can select in order to locate neighbouring nodes according to their preferences. The method also takes into account the communication overhead between each node interaction. The weight of each path is to be measured by the analysis of prerequisites in order to achieve a mutually agreed interaction between nodes. Requirements are defined as the least parameters or conditions that a node needs to achieve in order to determine its accessibility factor. The motivation behind this work is the vision of the Critical Friends Community model, which is a suitable topology for interoperable grid environments. The topology suggests that capturing inter-cooperated nodes interactions that can be publicly available could lead to knowledge of neighbouring VO members which, in turn, could be used for facilitating a more effective resource discovery and selection decision.
en
Archived with thanks to International Journal of Distributed Systems and Technologies
Defining minimum requirements of inter-collaborated nodes by measuring the weight of node interactions
Article
oai:uobrep.openrepository.com:10547/2509162020-04-23T08:42:53Zcom_10547_132192col_10547_132230
Liu, Jiamin
Yue, Yong
Dong, Zongran
Maple, Carsten
Keech, Malcolm
2012-11-05T10:26:39Z
2012-11-05T10:26:39Z
2011-04
Liu, J. et al (2011) 'A novel hybrid tabu search approach to container loading' Computers & Operations Research 38 (4):797-807
0305-0548
10.1016/j.cor.2010.09.002
http://hdl.handle.net/10547/250916
Computers & Operations Research
The container loading problem, which is significant for a number of industrial sectors, aims to obtain a high space utilisation in the container while satisfying practical constraints. This paper presents a novel hybrid tabu search approach to the container loading problem. A loading heuristic is devised to incorporate heuristic strategies with a handling method for remaining spaces to generate optimal loading arrangements of boxes with stability considered. The tabu search technique, which covers the encoding, evaluation criteria and configuration of neighbourhood and candidate solutions, is used to improve the performance of the loading heuristic. Experimental results with benchmark data show that the hybrid approach provides a better space utilisation than the published approaches under the condition of all loaded boxes with one hundred percent support from below. Moreover, it is shown that the hybrid tabu search can solve problems with the constraints of weight limit and weight distribution with real world data.
en
heuristic
tabu search
container loading
stability
weight distribution
A novel hybrid tabu search approach to container loading
Article
oai:uobrep.openrepository.com:10547/2509442020-04-23T07:35:29Zcom_10547_132192col_10547_132230
Ahmed, Ejaz
Bessis, Nik
Norrington, Peter
Yue, Yong
2012-11-05T10:07:28Z
2012-11-05T10:07:28Z
2010
Managing Inconsistencies in Data Grid Environments 2010, 2 (4):51-65 International Journal of Grid and High Performance Computing
1938-0259
1938-0267
10.4018/jghpc.2010100105
http://hdl.handle.net/10547/250944
International Journal of Grid and High Performance Computing
Much work has been done in the area of data access and integration using various data mapping, matching, and loading techniques. One of the main concerns when integrating data from heterogeneous data sources is data redundancy. The concern is mainly due to the different business contexts and purposes from which the data systems were originally built. A common process for accessing data from integrated databases involves the use of each data source’s own catalogue or metadata schema. In this article, the authors take the view that there is a greater chance of data inconsistencies, such as data redundancies when integrating them within a grid environment as compared to traditional distributed paradigms. The importance of improving the data search and matching process is briefly discussed, and a partial service oriented generic strategy is adopted to consolidate distinct catalogue schemas of federated databases to access information seamlessly. To this end, a proposed matching strategy between structure objects and data values across federated databases in a grid environment is presented.
en
Archived with thanks to International Journal of Grid and High Performance Computing
Managing inconsistencies in data grid environments
Article
oai:uobrep.openrepository.com:10547/2509412020-04-23T07:29:10Zcom_10547_132192col_10547_132230
Yong Yue
Clark, J.W.
Khoury, D.S.
2012-11-05T09:49:10Z
2012-11-05T09:49:10Z
2008-10
Speckle Tracking in Intracardiac Echocardiography for the Assessment of Myocardial Deformation 2009, 56 (2):416-425 IEEE Transactions on Biomedical Engineering
0018-9294
1558-2531
10.1109/TBME.2008.2006036
http://hdl.handle.net/10547/250941
IEEE Transactions on Biomedical Engineering
Intracardiac echocardiography has proven to be useful for online anatomical imaging during catheterization. Our objective was to develop a speckle tracking method for myocardial motion estimation from intracardiac echocardiographic image sequences in order to provide a mean for regional functional imaging. Our approach was to solve two problems in motion estimation from two-dimensional intracardiac echocardiographic image sequences: non-rigid myocardial deformation and speckle decorrelation. To achieve robust noise resistance, we employed maximum likelihood estimation while fully exploiting ultrasound speckle statistics, and treated the maximization of motion probability as the minimization of an energy function. Non-rigid myocardial deformation was estimated by optimizing this energy function within a framework of parametric elastic registration. Evaluation of the method was carried out using a computer model that synthesized echocardiographic image sequences, and subsequently an animal model that provided continuous intracardiac echocardiographic images as well as reference measurements using sonomicrometry crystals. In conclusion, accurate estimation of regional myocardial deformation from intracardiac echocardiography by novel speckle tracking is feasible. This approach may have important clinical implications for multimodal imaging during catheterization.
en
Archived with thanks to IEEE Transactions on Biomedical Engineering
cardiac imaging
myocardial strain
elastic registration
non-rigid deformation
sonomicrometry
Speckle tracking in intracardiac echocardiography for the assessment of myocardial deformation
Article
oai:uobrep.openrepository.com:10547/2509402020-04-23T08:42:53Zcom_10547_132192col_10547_132230
Viduto, Valentina
Maple, Carsten
Huang, Wei
López-Peréz, David
2012-11-05T09:47:02Z
2012-11-05T09:47:02Z
2012-06
Viduto, V. et al (2012) 'A novel risk assessment and optimisation model for a multi-objective network security countermeasure selection problem' Decision Support Systems 53 (3):599-610
0167-9236
10.1016/j.dss.2012.04.001
http://hdl.handle.net/10547/250940
Decision Support Systems
Budget cuts and the high demand in strengthening the security of computer systems and services constitute a challenge. Poor system knowledge and inappropriate selection of security measures may lead to unexpected financial and data losses. This paper proposes a novel Risk Assessment and Optimisation Model (RAOM) to solve a security countermeasure selection problem, where variables such as financial cost and risk may affect a final decision. A Multi-Objective Tabu Search (MOTS) algorithm has been developed to construct an efficient frontier of non-dominated solutions, which can satisfy organisational security needs in a cost-effective manner.
en
financial decision support
risk assessment
countermeasure selection problem
multi-objective optimisation
tabu search
A novel risk assessment and optimisation model for a multi-objective network security countermeasure selection problem
Article
oai:uobrep.openrepository.com:10547/2509192020-04-23T07:36:54Zcom_10547_132192col_10547_132230
Conrad, Marc
Neale, Jo
Charles, Alec
2012-11-05T10:57:08Z
2012-11-05T10:57:08Z
2010-12
Conrad, M.,Neale, J.,Charles, A. (2010) 'This Is My Body: The Uses and Effects of the Avatar in the Virtual World', International Journal for Infonomics, 3 (4): 360-368
1742-4712
http://hdl.handle.net/10547/250919
International Journal for Infonomics
The study focuses on the relationship users of virtual worlds, such as Second Life, may or may not develop toward the avatar they use. A questionnaire was developed to collect both qualitative and quantitative data from students engaged in a university assignment that required them to use an avatar in Second Life. The findings are contextualized and discussed: The distinctions between software, hardware and self are blurred.
en
This is my body: the uses and effects of the avatar in the virtual world
Article
oai:uobrep.openrepository.com:10547/2509392020-04-23T07:30:53Zcom_10547_132192col_10547_132230
Trinitis, Carsten
Küstner, Tilman
Weidendorfer, Josef
Smajic, Jasmin
2012-11-05T09:45:43Z
2012-11-05T09:45:43Z
2010
Trinitis, C. et al (2010) 'Sparse matrix operations on several multi-core architectures' The Journal of Supercomputing 57 (2):132-140
0920-8542
1573-0484
10.1007/s11227-010-0428-9
http://hdl.handle.net/10547/250939
The Journal of Supercomputing
This paper compares various contemporary multicore-based microprocessor architectures from different vendors with different memory interconnects regarding performance, speedup, and parallel efficiency. Sparse matrix decomposition is used as a benchmark application. The example matrix used in the experiments comes from an electrical engineering application, where numerical simulation of physical processes plays an important role in the design of industrial products. Within this context, thread-to-core pinning and cache optimization are two important aspects which are investigated in more detail.
en
multicore
pinning
cache optimization
performance optimization
sparse matrices
Sparse matrix operations on several multi-core architectures
Article
oai:uobrep.openrepository.com:10547/2518142020-04-23T07:29:13Zcom_10547_132192col_10547_132230
Trinitis, Carsten
Weidendorfer, Josef
2012-11-12T13:29:24Z
2012-11-12T13:29:24Z
2008-11
Weidendorfer, J., Trinitis, C.
(2008) 'Off-loading application controlled data prefetching in numerical codes for multicore
processors', 4 (1): 22-28, Int. J. of Computational Science and Engineering
1742-7185
http://hdl.handle.net/10547/251814
1742-7193
International Journal of Computational Science and Engineering
An important issue when designing numerical code in High Performance Computing is cache optimisation in order to exploit the performance potential of a given target architecture. This includes techniques to improve memory access locality as well as prefetching. Inherent algorithm constrains often limit the first approach, which typically uses a blocking technique. While there exist automatic prefetching mechanisms in hardware and/or compilers, they can not complement blocking with additional prefetching. We provide an infrastructure for off-loading application controlled prefetching on a chip multiprocessor, allowing to further improve numerical code already optimised by standard cache optimisation. Clear benefits are shown for real workloads on existing hardware.
en
Off-loading application controlled data prefetching in numerical codes for multi-core processors
Article
oai:uobrep.openrepository.com:10547/2550522018-06-19T10:34:36Zcom_10547_132192col_10547_132230
Chen, Weiru
Lu, Jing
Keech, Malcolm
2012-12-10T08:16:52Z
2012-12-10T08:16:52Z
2010
Chen, w. Lu, J, Keech, M (2010) Discovering exclusive patterns in frequent sequences. International Journal of Data Mining, Modelling and Management,Vol.2,(3) pp.252 - 267
1759-1163
1759-1171
http://hdl.handle.net/10547/255052
International Journal of Data Mining, Modelling and Management
en
An error occurred getting the license - uri.
An error occurred on the license name.
G560 Data Management
G510 Information Modelling
data mining
Discovering exclusive patterns in frequent sequences
Article
mods///com_10547_132192/100