Abrantes-Metz, R, Froeb, L, Geweke, J & Taylor, C 2006, 'A Variance Screen for Collusion', International Journal Of Industrial Organisation, vol. 24, no. 3, pp. 467-486.
View/Download from: UTS OPUS or Publisher's site
View description>>
Abstract: In this paper, we examine price movements over time around the collapse of a bid-rigging conspiracy. While the mean decreased by sixteen percent, the standard deviations increased by over two hundred percent. We hypothesize that conspiracies in other industries would exhibit similar characteristics and search for "pockets" of low price variation as indicators of collusion in the retail gasoline industry in Louisville. We observe no such areas around Louisville in 1996-2002.
Cao, L & Zhang, C 2006, 'Domain-driven data mining: A practical methodology', International Journal of Data Warehousing and Mining, vol. 2, no. 4, pp. 49-65.
View/Download from: UTS OPUS
View description>>
Extant data mining is based on data-driven methodologies. It either views data mining as an autonomous data-driven, trial-and-error process or only analyzes business issues in an isolated, case-by-case manner. As a result, very often the knowledge discovered generally is not interesting to real business needs. Therefore, this article proposes a practical data mining methodology referred to as domain-driven data mining, which targets actionable knowledge discovery in a constrained environment for satisfying user preference. The domain-driven data mining consists of a DDID-PD framework that considers key components such as constraint-based context, integrating domain knowledge, human-machine cooperation, in-depth mining, actionability enhancement, and iterative refinement process. We also illustrate some examples in mining actionable correlations in Australian Stock Exchange, which show that domain-driven data mining has potential to improve further the actionability of patterns for practical use by industry and business.
Cao, L, Zhang, C & Liu, J 2006, 'Ontology-Based Integration Of Business Intelligence', Web Intelligence and Agent Systems: An International Journal, vol. 4, no. 3, pp. 313-325.
View/Download from: UTS OPUS
View description>>
The integration of Business Intelligence (BI) has been taken bybusiness decision-makers as an effective means to enhance enterprise "soft power" and added value in the reconstruction and revolution oftraditional industries. The existing solutions based on structuralintegration are to pack together data warehouse (DW), OLAP, data mining(DM) and reporting systems from different vendors. BI system users arefinally delivered a reporting system in which reports, data models,dimensions and measures are predefined by system designers. As aresult of a survey in the US, 85% of DW projects based on the above solutions failed to meet their intended objectives. In this paper, wesummarize our investigation on the integration of BI on the basis ofsemantic integration and structural interaction. Ontology-basedintegration of BI is discussed for semantic interoperability inintegrating DW, OLAP and DM. A hybrid ontological structure isintroduced which includes conceptual view, analytical view and physicalview. These views are matched with user interfaces, DW and enterpriseinformation systems, respectively. Relevant ontological engineeringtechniques are developed for ontology namespace, semantic relationships,and ontological transformation, mapping and query in this ontologicalspace. The approach is promising for business-oriented, adaptive andautomatic integration of BI in the real world. Operational decisionmaking experiments within a telecom company have demonstrated that a BI system utilizing the proposed approach is more flexible.
Chiarella, C, He, X & Hommes, C 2006, 'A dynamic analysis of moving average rules', Journal of Economic Dynamics and Control, vol. 30, no. 9-10, pp. 1729-1753.
View/Download from: UTS OPUS or Publisher's site
View description>>
The use of various moving average (MA) rules remains popular with financial market practitioners. These rules have recently become the focus of a number empirical studies, but there have been very few studies of financial market models where some agents
Chiarella, C, He, X & Hommes, C 2006, 'Moving average rules as a source of market instability', Physica A: Statistical Mechanics and its Applications, vol. 370, no. 1, pp. 12-17.
View/Download from: UTS OPUS or Publisher's site
View description>>
Despite the pervasiveness of the efficient markets paradigm in the academic finance literature, the use of various moving average (MA) trading rules remains popular with financial market practitioners. This paper proposes a stochastic dynamic financial m
Chiarella, C, He, X & Wang, D 2006, 'A behavioral asset pricing model with a time-varying second moment', Chaos, Solitons and Fractals, vol. 29, no. 3, pp. 535-555.
View/Download from: UTS OPUS or Publisher's site
View description>>
We develop a simple behavioral asset pricing model with fundamentalists and chartists in order to study price behavior in financial markets when chartists estimate both conditional mean and variance by using a weighted averaging process. Through a stabil
Chiarella, C, He, X, Hung, H & Zhu, P 2006, 'An analysis of the cobweb model with boundedly rational heterogeneous producers', Journal of Economic Behavior & Organization, vol. 61, no. 4, pp. 750-768.
View/Download from: UTS OPUS or Publisher's site
View description>>
This paper considers the traditional cobweb model with heterogenous risk averse producers whose supply functions involve their estimates of the conditional mean and variance of the future price. The producers seek to learn these quantities by applying geometric decay processes (GDP) to past prices. The heterogeneity manifests itself in the lag lengths and memory parameters applied to past prices as well as in risk aversion coefficients. We find that each dimension of heterogeneity changes/enriches the cobweb dynamics with respect to the case of homogeneous producers.
Choi, AL, Levy, JI, Dockery, DW, Ryan, LM, Tolbert, PE, Altshul, LM & Korrick, SA 2006, 'Does living near a Superfund site contribute to higher polychlorinated biphenyl (PCB) exposure?', Environmental Health Perspectives, vol. 114, no. 7, pp. 1092-1098.
View/Download from: UTS OPUS or Publisher's site
View description>>
We assessed determinants of cord serum polychlorinated biphenyl (PCB) levels among 720 infants born between 1993 and 1998 to mothers living near a PCB-contaminated Superfund site in Massachusetts, measuring the sum of 51 PCB congeners (SPCB) and ascertaining maternal address, diet, sociodemographics, and exposure risk factors. Addresses were geocoded to obtain distance to the Superfund site and neighborhood characteristics. We modeled log10(SPCB) as a function of potential individual and neighborhood risk factors, mapping model residuals to assess spatial correlates of PCB exposure. Similar analyses were performed for light (mono-tetra) and heavy (penta-deca) PCBs to assess potential differences in exposure pathways as a function of relative volatility. PCB-118 (relatively prevalent in site sediments and cord serum) was assessed separately. The geometric mean of SPCB levels was 0.40 (range, 0.06818.14) ng/g serum. Maternal age and birthplace were the strongest predictors of SPCB levels. Maternal consumption of organ meat and local dairy products was associated with higher and smoking and previous lactation with lower SPCB levels. Infants born later in the study had lower SPCB levels, likely due to temporal declines in exposure and site remediation in 19941995. No association was found between SPCB levels and residential distance from the Superfund site. Similar results were found with light and heavy PCBs and PCB-118. Previously reported demographic (age) and other (lactation, smoking, diet) correlates of PCB exposure, as well as local factors (consumption of local dairy products and Superfund site dredging) but not residential proximity to the site, were important determinants of cord serum PCB levels in the study community.
Davis, E, Smith, TJ, Laden, F, Hart, JE, Ryan, LM & Garshick, E 2006, 'Modeling particle exposure in U.S. trucking terminals', Environmental Science & Technology, vol. 40, no. 13, pp. 4226-4232.
View/Download from: UTS OPUS or Publisher's site
View description>>
Multi-tiered sampling approaches are common in environmental and occupational exposure assessment, where exposures for a given individual are often modeled based on simultaneous measurements taken at multiple indoor and outdoor sites. The monitoring data from such studies is hierarchical by design, imposing a complex covariance structure that must be accounted for in order to obtain unbiased estimates of exposure. Statistical methods such as structural equation modeling (SEM) represent a useful alternative to simple linear regression in these cases, providing simultaneous and unbiased predictions of each level of exposure based on a set of covariates specific to the exposure setting. We test the SEM approach using data from a large exposure assessment of diesel and combustion particles in the U. S. trucking industry. The exposure assessment includes data from 36 different trucking terminals across the United States sampled between 2001 and 2005, measuring PM2.5 and its elemental carbon (EC), organic carbon (OC) components, by personal monitoring, and sampling at two indoor work locations and an outdoor "background" location. Using the SEM method, we predict the following: (1) personal exposures as a function of work-related exposure and smoking status; (2) work-related exposure as a function of terminal characteristics, indoor ventilation, job location, and background exposure conditions; and ( 3) background exposure conditions as a function of weather, nearby source pollution, and other regional differences across terminal sites. The primary advantage of SEMs in this setting is the ability to simultaneously predict exposures at each of the sampling locations, while accounting for the complex covariance structure among the measurements and descriptive variables. The statistically significant results and high R-2 values observed from the trucking industry application supports the broader use of this approach in exposure assessment modeling.
Dieci, R, Foroni, I, Gardini, L & He, X 2006, 'Market mood, adaptive beliefs and asset price dynamics', Chaos, Solitons and Fractals, vol. 29, no. 3, pp. 520-534.
View/Download from: UTS OPUS or Publisher's site
View description>>
Empirical evidence has suggested that, facing different trading strategies and complicated decision, the proportions of agents relying on particular strategies may stay at constant level or vary over time. This paper presents a simple dynamic market frac
Du, C., Yang, J., Wu, Q., Zhang, T., Wang, H., Chen, L. & Wu, Z. 2006, 'Extended fitting methods of active shape model for the location of facial feature points', Lecture notes in computer science, vol. 4338, pp. 610-618.
View/Download from: UTS OPUS
View description>>
In this study, we propose three extended fitting methods to the standard ASM(active shape model). Firstly, profiles are extended from ID to 2D; Secondly, profiles of different landmarks are constructed individually; Thirdly, length of the profiles is determined adaptively with the change of level during searching, and the displacements in the last level are constrained. Each method and the combination of three methods are tested on the SJTU(Shanghai Jiaotong University) face database. In all cases, compared to the standard ASM, each method improves the accuracy or speed in a way, and the combination of three methods improves the accuracy and speed greatly.
Gold, DR, Willwerth, BM, Tantisira, KG, Finn, PW, Schaub, B, Perkins, DL, Tzianabos, A, Ly, NP, Schroeter, C, Gibbons, F, Campos, H, Oken, E, Gillman, MW, Palmer, LJ, Ryan, LM & Weiss, ST 2006, 'Associations of cord blood fatty acids with lymphocyte proliferation, IL-13, and IFN-gamma', Journal of Allergy and Clinical Immunology, vol. 117, no. 4, pp. 931-938.
View/Download from: UTS OPUS or Publisher's site
View description>>
Background N-3 and n-6 polyunsaturated fatty acids (PUFAs) have been hypothesized to have opposing influences on neonatal immune responses that might influence the risk of allergy or asthma. However, both n-3 eicosapentaenoic acid (EPA) and n-6 arachidonic acid (AA) are required for normal fetal development. Objective We evaluated whether cord blood fatty acid levels were related to neonatal immune responses and whether n-3 and n-6 PUFA responses differed. Methods We examined the relation of cord blood plasma n-3 and n-6 PUFAs (n = 192) to antigen- and mitogen-stimulated cord blood lymphocyte proliferation (n = 191) and cytokine (IL-13 and IFN-?; n = 167) secretion in a US birth cohort. Results Higher levels of n-6 linoleic acid were correlated with higher IL-13 levels in response to Bla g 2 (cockroach, P = .009) and Der f 1 (dust mite, P = .02). Higher n-3 EPA and n-6 AA levels were each correlated with reduced lymphocyte proliferation and IFN-? levels in response to Bla g 2 and Der f 1 stimulation. Controlling for potential confounders, EPA and AA had similar independent effects on reduced allergen-stimulated IFN-? levels. If neonates had either EPA or AA levels in the highest quartile, their Der f 1 IFN-? levels were 90% lower (P = .0001) than those with both EPA and AA levels in the lowest 3 quartiles. Reduced AA/EPA ratio was associated with reduced allergen-stimulated IFN-? level. Conclusion Increased levels of fetal n-3 EPA and n-6 AA might have similar effects on attenuation of cord blood lymphocyte proliferation and IFN-? secretion. Clinical implications The implications of these findings for allergy or asthma development are not yet known.
Gunes, H & Piccardi, M 2006, 'Assessing facial beauty through proportion analysis by image processing and supervised learning', Int Journal of Human-Computer Studies, vol. 64, no. 12, pp. 1184-1199.
View/Download from: UTS OPUS or Publisher's site
He, S & Arabnia, H 2006, 'Design of a Uni-Directional multi ring switch', International Journal of Computer Science and Network Security, vol. 6, pp. 130-138.
View/Download from: UTS OPUS
He, S, Jia, W, Wu, Q & Hintz, TB 2006, 'Description of the cardiac movement using hexagonal image structures', Computerised medical imaging and graphics, vol. 30, no. 6-7, pp. 377-382.
View/Download from: UTS OPUS or Publisher's site
View description>>
The most notable characteristic of the heart is its movement. Detection of dynamic information describing cardiac movement such as amplitude, speed and acceleration facilitates interpretation of normal and abnormal function. In recent years, the Omni-directional M-mode Echocardiography System (OMES) has been developed as a process that builds moving information from a sequence of echocardiography image frames. OMES detects cardiac movement through construction and analysis of PositionTime Grey Waveform (PTGW) images on some feature points of the boundaries of the ventricles. Image edge detection plays an important role in determining the feature boundary points and their moving directions as the basis for extraction of PTGW imagesSpiral Architecture (SA) has proved efficient for image edge detection. SA is a hexagonal image structure in which an image is represented as a collection of hexagonal pixels. There are two operations called spiral addition and spiral multiplication defined on SA. They correspond to image translation and rotation, respectively. In this paper, we perform ventricle boundary detection based on SA using various defined chain codes. The gradient direction of each boundary point is determined at the same time. PTGW images at each boundary point are obtained through a series of spiral additions according to the directions of boundary points. Unlike the OMES system, our new approach is no longer affected by the translation movement of the heart. As its result, three curves representing the amplitude, speed and acceleration of cardiac movement can be easily drawn from the PTGW images obtained. Our approach is more efficient and accurate than OMES, and our results contain a more robust and complete description of cardiac motion.
Houseman, EA, Coull, BA & Ryan, LM 2006, 'A functional-based distribution diagnostic for a linear model with correlated outcomes', Biometrika, vol. 93, no. 4, pp. 911-926.
View/Download from: UTS OPUS or Publisher's site
View description>>
In this paper we present an easy-to-implement graphical distribution diagnostic for linear models with correlated errors. Houseman et al. (2004) constructed quantile-quantile plots for the marginal residuals of such models, suitably transformed. We extend the pointwise asymptotic theory to address the global stochastic behaviour of the corresponding empirical cumulative distribution function, and describe a simulation technique that serves as a computationally efficient parametric bootstrap for generating representatives of its stochastic limit. Thus, continuous functionals of the empirical cumulative distribution function may be used to form global tests of normality. Through the use of projection matrices, we generalised our methods to include tests that are directed at assessing the normality of particular components of the error. Thus, tests proposed by Lange & Ryan (1989) follow as a special case. Our method works well both for models having independent units of sampling and for those in which all observations are correlated.
Hussain, O, Chang, E, Hussain, FK & Dillon, TS 2006, 'A methodology for Risk measurement in e-transactions', Computer Systems Science And Engineering, vol. 21, no. 1, pp. 17-31.
View description>>
Risk is present in almost every activity. Alternately speaking, almost every activity may have some undesired outcomes which the person doing the activity hopes that they do not occur when it undertakes that particular activity. The quantification of tho
Kazienko, P & Musial, K 2006, 'Recommendation framework for online social networks', ADVANCES IN WEB INTELLIGENCE AND DATA MINING, vol. 23, pp. 111-+.
Larsen, L, Mandleco, B, Williams, M & Tiedeman, M 2006, 'Childhood obesity: Prevention practices of nurse practitioners', Journal of the American Academy of Nurse Practitioners, vol. 18, no. 2, pp. 70-79.
View/Download from: Publisher's site
View description>>
Purpose: The purposes or this study were to (a) describe the prevention practices of nurse practitioners (NPs) regarding childhood obesity, (b) compare the practices of NPs by specialty, practice setting, and awareness of childhood obesity prevention guidelines, (c) identify relationships between prevention practices and demographic variables of NPs, and (d) examine the resources for and barriers to implementing prevention practices. Data sources: A convenience sample of 99 family NPs (FNPs) and pediatric NPs (PNPs) from the Intermountain area was used. Participants completed a questionnaire based on documented risk factors for childhood obesity as well as prevention guidelines developed by the American Academy of Pediatrics (AAP). Conclusions: NPs working in family practice or general pediatric practice settings were not consistently using the BMI-for-age index to screen for childhood obesity, as recommended by the AAP. However, they were teaching parents to promote healthy food choices and physical activity in their families. PNPs and FNPs working in a pediatric practice setting and NPs who were aware of prevention guidelines were more likely to perform several prevention strategies than FNPs working in a family practice setting and those who were unaware of guidelines. Major barriers to implementing childhood obesity prevention strategies included parental attitudes, the American lifestyle, and lack of resources for both the NP and the family. The main resources NPs used in preventing childhood obesity were a dietician, journal articles, and Web sites. Implications for practice: Although the majority of the NPs in this study reported being aware of childhood obesity prevention guidelines (73.7%), most were not consistently using BMI for age or monitoring children at increased risk for obesity. Because childhood obesity is escalating at such a rapid rate, it is critical that NPs working in family practice and pediatric practice settings take the necessary steps...
Li, H, Li, J & Wong, L 2006, 'Discovering Motif Pairs At Interaction Sites From Protein Sequences On A Proteome-wide Scale', Bioinformatics, vol. 22, no. 8, pp. 989-996.
View/Download from: UTS OPUS or Publisher's site
View description>>
Motivation: Protein-protein interaction, mediated by protein interaction sites, is intrinsic to many functional processes in the cell. In this paper, we propose a novel method to discover patterns in protein interaction sites. We observed from protein in
Li, J, Allinson, N, Tao, D & Li, X 2006, 'Multitraining support vector machine for image retrieval', IEEE Transactions On Image Processing, vol. 15, no. 11, pp. 3597-3601.
View/Download from: UTS OPUS or Publisher's site
View description>>
Relevance feedback (RF) schemes based on support vector machines (SVMs) have been widely used in content-based image retrieval (CBIR). However, the performance of SVM-based RF approaches is often poor when the number of labeled feedback samples is small.
Li, Y & Ryan, LM 2006, 'Inference on survival data with covariate measurement error - an imputation approach', Scandinavian Journal of Statistics, vol. 33, no. 2, pp. 169-190.
View/Download from: UTS OPUS or Publisher's site
View description>>
We propose a new method for fitting proportional hazards models with error-prone covariates. Regression coefficients are estimated by solving an estimating equation that is the average of the partial likelihood scores based on imputed true covariates. For the purpose of imputation, a linear spline model is assumed on the baseline hazard. We discuss consistency and asymptotic normality of the resulting estimators, and propose a stochastic approximation scheme to obtain the estimates. The algorithm is easy to implement, and reduces to the ordinary Cox partial likelihood approach when the measurement error has a degenerate distribution. Simulations indicate high efficiency and robustness. We consider the special case where error-prone replicates are available on the unobserved true covariates. As expected, increasing the number of replicates for the unobserved covariates increases efficiency and reduces bias. We illustrate the practical utility of the proposed method with an Eastern Cooperative Oncology Group clinical trial where a genetic marker, c-myc expression level, is subject to measurement error.
Liu, D & He, S 2006, 'Novel block matching compression algorithm for video images', Xitong Fangzhen Xuebao / Journal of System Simulation, vol. 18, no. 1, pp. 47-49.
View description>>
At present, video image compression is the hot topic of image compression and coding. Many useful results of bivariable functions have been obtained by studying the bivariable fractal space. A block matching intra-frame video image compression algorithm based on bivariable fractal function space theory has been proposed. The framework of the algorithm and an effective cost function of inter-frame coding were given. A novel block matching compression algorithm for video images was formed. The reliable result is available.
Louis, GB, Dukic, V, Heagerty, PJ, Louis, TA, Lynch, CD, Ryan, LM, Schisterman, EF & Trumble, A 2006, 'Analysis of repeated pregnancy outcomes', Statistical Methods in Medical Research, vol. 15, no. 2, pp. 103-126.
View/Download from: UTS OPUS or Publisher's site
View description>>
Women tend to repeat reproductive outcomes, with past history of an adverse outcome being associated with an approximate two-fold increase in subsequent risk. These observations support the need for statistical designs and analyses that address this clus
Ly, NP, Ruiz-Pérez, B, Onderdonk, AB, Tzianabos, AO, Litonjua, AA, Liang, C, Laskey, D, Delaney, ML, DuBois, AM, Levy, H, Gold, DR, Ryan, LM, Weiss, ST & Celedón, JC 2006, 'Mode of delivery and cord blood cytokines: A birth cohort study', Clinical and Molecular Allergy, vol. 4.
View/Download from: Publisher's site
View description>>
Background: The mechanisms for the association between birth by cesarean section and atopy and asthma are largely unknown. Objective: To examine whether cesarean section results in neonatal secretion of cytokines that are associated with increased risk of atopy and/or asthma in childhood. To examine whether the association between mode of delivery and neonatal immune responses is explained by exposure to the maternal gut flora (a marker of the vaginal flora). Methods: CBMCs were isolated from 37 neonates at delivery, and secretion of IL- 13, IFN-γ, and IL- 10 (at baseline and after stimulation with antigens [dust mite and cat dander allergens, phytohemagglutinin, and lipopolysaccharide]) was quantified by ELISA. Total and specific microbes were quantified in maternal stool. The relation between mode of delivery and cord blood cytokines was examined by linear regression. The relation between maternal stool microbes and cord blood cytokines was examined by Spearman's correlation coefficients. Results: Cesarean section was associated with increased levels of IL-13 and IFN-γ. In multivariate analyses, cesarean section was associated with an increment of 79.4 pg/ml in secretion of IL-13 by CBMCs after stimulation with dust mite allergen (P < 0.001). Among children born by vaginal delivery, gram-positive anaerobes and total anaerobes in maternal stool were positively correlated with levels of IL-10, and gram-negative aerobic bacteria in maternal stool were negatively correlated with levels of IL-13 and IFN-γ. Conclusion: Cesarean section is associated with increased levels of IL-13 and IFN-γ, perhaps because of lack of labor and/or reduced exposure to specific microbes (e.g., gram-positive anaerobes) at birth. © 2006 Ly et al; licensee BioMed Central Ltd.
Mauger, L & Stoianoff, NP 2006, 'Protecting Australia's Trade Mark Interests through the Australia-China Free Trade Agreement', LawAsia Journal, vol. 2006, no. 1, pp. 125-162.
View/Download from: UTS OPUS
View description>>
Intellectual property provisions and trade marks consideration in the proposed Australia-China Free Trade Agreement - significant implications for Australian interests.
McCarty, KM, Houseman, EA, Quamruzzaman, Q, Rahman, M, Mahiuddin, G, Smith, T, Ryan, LM & Christiani, DC 2006, 'The impact of diet and betel nut use on skin lesions associated with drinking-water arsenic in Pabna, Bangladesh', Environmental Health Perspectives, vol. 114, no. 3, pp. 334-340.
View/Download from: UTS OPUS or Publisher's site
View description>>
An established exposure-response relationship exists between water arsenic levels and skin lesions. Results of previous studies with limited historical exposure data, and laboratory animal studies suggest that diet may modify arsenic metabolism and toxicity. In this study, we evaluated the effect of diet on the risk of arsenic-related skin lesions in Pabna, Bangladesh. Six hundred cases and 600 controls loosely matched on age and sex were enrolled at Dhaka Community Hospital, Bangladesh, in 2001-2002. Diet, demographic data, and water samples were collected. Water samples were analyzed for arsenic using inductively coupled plasma mass spectroscopy. Betel nut use was associated with a greater risk of skin lesions in a multivariate model [odds ratio (OR)=1.67; 95% confidence interval (CI), 1.18-2.36]. Modest decreases in risk of skin lesions were associated with fruit intake 1-3 times/month (OR=0.68; 95% CI, 0.51-0.89) and canned goods at least 1 time/month (OR=0.41; 95% CI, 0.20-0.86). Bean intake at least 1 time/day (OR=1.89; 95% CI, 1.11-3.22) was associated with increased odds of skin lesions. Betel nut use appears to be associated with increased risk of developing skin lesions in Bangladesh. Increased intake of fruit and canned goods may be associated with reduced risk of lesions. Increased intake of beans may be associated with an increased risk of skin lesions. The results of this study do not provide clear support for a protective effect of vegetable and overall protein consumption against the development of skin lesions, but a modest benefit cannot be excluded.
Meeker, JD, Ryan, L, Barr, DB & Hauser, R 2006, 'Exposure to nonpersistent insecticides and male reproductive hormones', EPIDEMIOLOGY, vol. 17, no. 1, pp. 61-68.
View/Download from: Publisher's site
Morales, KH, Ibrahim, JG, Chen, C & Ryan, LM 2006, 'Bayesian model averaging with applications to benchmark dose estimation for arsenic in drinking water', Journal Of The American Statistical Association, vol. 101, no. 473, pp. 9-17.
View/Download from: UTS OPUS or Publisher's site
View description>>
An important component of quantitative risk assessment involves characterizing the dose-response relationship between an environmental exposure and adverse health outcome and then computing a benchmark dose, or the exposure level that yields a suitably low risk. This task is often complicated by model choice considerations, because risk estimates depend on the model parameters. We pro pose using Bayesian methods to address the problem of model selection and derive a model-averaged version of the benchmark dose. We illustrate the methods through application to data on arsenic-induced lung cancer from Taiwan.
Morris, JS, Arroyo, C, Coull, BA, Ryan, LM, Herrick, R & Gortmaker, SL 2006, 'Using wavelet-based functional mixed models to characterize population heterogeneity in accelerometer profiles: A case study', Journal of the American Statistical Association, vol. 101, no. 476, pp. 1352-1364.
View/Download from: UTS OPUS or Publisher's site
View description>>
We present a case study illustrating the challenges of analyzing accelerometer data taken from a sample of children participating in an intervention study designed to increase physical activity. An accelerometer is a small device worn on the hip that records the minute-by-minute activity levels throughout the day for each day it is worn. The resulting data are irregular functions characterized by many peaks representing short bursts of intense activity. We model these data using the wavelet-based functional mixed model. This approach incorporates multiple fixed-effects and random-effects functions of arbitrary form, the estimates of which are adaptively regularized using wavelet shrinkage. The method yields posterior samples for all functional quantities of the model, which can be used to perform various types of Bayesian inference and prediction. In our case study, a high proportion of the daily activity profiles are incomplete (i.e., have some portion of the profile missing), and thus cannot be modeled directly using the previously described method. We present a new method for stochastically imputing the missing data that allows us to incorporate these incomplete profiles in our analysis. Our approach borrows strength from both the observed measurements within the incomplete profiles and from other profiles, from the same child as well as from other children with similar covariate levels, while appropriately propagating the uncertainty of the imputation throughout all subsequent inference. We apply this method to our case study, revealing some interesting insights into children's activity patterns. We point out some strengths and limitations of using this approach to analyze accelerometer data.
O'Hara, ML, Sample, S & Williams, MA 2006, 'Heart failure: from the ICU to step-down--and home.', Nursing management, vol. 37, no. 8, pp. 36-41.
Pham, TD, Beck, D & Yan, H 2006, 'Spectral pattern comparison methods for cancer classification based on microarray gene expression data', IEEE Transactions on Circuits and Systems I: Regular Papers, vol. 53, no. 11, pp. 2425-2430.
View/Download from: Publisher's site
View description>>
We present, in this paper, two spectral pattern comparison methods for cancer classification using microarray gene expression data. The proposed methods are different from other current classifiers in the ways features are selected and pattern similarities measured. In addition, these spectral methods do not require any data preprocessing which is neccessary for many other classification techniques. Expertimental results using three popular microarray data sets demonstrate the robustness and effectiveness of the spectral pattern classifiers. © 2006 IEEE.
Ruan, D & He, X 2006, 'Global Stability In Chemostat-type Competition Models With Nutrient Recycling (vol 58, Pg 170, 1998)', Siam Journal On Applied Mathematics, vol. 66, no. 6, pp. 2204-2205.
View description>>
This note corrects some typos and errors in the paper [S. Ruan and X.-Z. He, SIAM J. Appl. Math., 58 (1998), pp. 170-192].
Ruan, S & He, XZ 2006, 'Erratum: Global stability in chemostat-type competition models with nutrient recycling (SIAM Journal on Applied Mathematics (1998) 58 (170-192))', SIAM Journal on Applied Mathematics, vol. 66, no. 6, pp. 2204-2205.
View/Download from: Publisher's site
Tao, D, Tang, X, Li, X & Rui, Y 2006, 'Direct kernel biased discriminant analysis: A new content-based image retrieval relevance feedback algorithm', IEEE Transactions On Multimedia, vol. 8, no. 4, pp. 716-727.
View/Download from: UTS OPUS or Publisher's site
View description>>
In recent years, a variety of relevance feedback (RF) schemes have been developed to improve the performance of content-based image retrieval (CBIR). Given user feedback information, the key to a RF scheme is how to select a subset of image features to c
Tao, D, Tang, X, Li, X & Wu, X 2006, 'Asymmetric bagging and random subspace for support vector machines-based relevance feedback in image retrieval', IEEE Transactions On Pattern Analysis And Machine Intelligence, vol. 28, no. 7, pp. 1088-1099.
View/Download from: UTS OPUS
View description>>
Relevance feedback schemes based on support vector machines (SVM) have been widely used in content-based image retrieval (CBIR). However, the performance of SVM-based relevance feedback is often poor when the number of labeled positive feedback samples i
Wu, Q, He, S, Hintz, TB & Ye, Y 2006, 'A novel and uniform image partitioning on spiral architecture', International journal of computational science and engineering, vol. 2, no. 1, pp. 57-63.
View/Download from: UTS OPUS
Wu, Q, He, X, Hintz, T & Ye, Y 2006, 'A novel and uniform image partitioning on spiral architecture', International Journal of Computational Science and Engineering, vol. 2, no. 1-2, pp. 57-63.
View/Download from: Publisher's site
View description>>
Uniform image partitioning based on spiral architecture plays an important role in parallel image processing in many aspects such as uniform data partitioning, load balancing, zero data exchange between the processing nodes et al. However, when the number of partitions is not the power of seven like 7, 49, every sub-image except one is split into a few fragments which are mixed together. We could not tell which fragments belong to which subimage. It is an unacceptable flaw to parallel image processing. This paper proposes a method to resolve the problem mentioned above. From the experimental results, it is shown that the proposed method correctly identifies the fragments belonging to the same subimage and successfully collects them together to be a complete subimage. Then, these subimages can be distributed into the different processing nodes for further processing. Copyright © 2006, Inderscience Publishers.
Xu, D, Yan, S, Tao, D, Zhang, L, Li, X & Zhang, H 2006, 'Human gait recognition with matrix representation', IEEE Transactions On Circuits And Systems For Video Technology, vol. 16, no. 7, pp. 896-903.
View/Download from: UTS OPUS or Publisher's site
View description>>
Human gait is an important biometric feature. It can be perceived from a great distance and has recently attracted greater attention in video-surveillance-related applications, such as closed-circuit television. We explore gait recognition based on a mat
Zhang, C, Ying, M & Qiao, B 2006, 'Universal Programmable Devices For Unambiguous Discrimination', Physical Review A, vol. 74, no. 4, pp. 1-9.
View/Download from: UTS OPUS
View description>>
We discuss the problem of designing unambiguous programmable discriminators for any n unknown quantum states in an m-dimensional Hilbert space. The discriminator is a fixed measurement that has two kinds of input registers: the program registers and the
Zhang, H, He, S & Wu, Q 2006, 'Generic Object Detection', Journal of Yunnan Nationalities University, vol. 15, no. 4, pp. 261-267.
View/Download from: UTS OPUS
Zhen, MC, Huang, XH, Wang, Q, Sun, K, Liu, YJ, Li, W, Zhang, LJ, Cao, LQ & Chen, XL 2006, 'Green tea polyphenol epigallocatechin-3-gallate suppresses rat hepatic stellate cell invasion by inhibition of MMP-2 expression and its activation', Acta Pharmacologica Sinica, vol. 27, no. 12, pp. 1600-1607.
View/Download from: Publisher's site
View description>>
Aim: Epigallocatechin-3-gallate (EGCG) is the major component of green tea polyphenols, whose wide range of biological properties includes anti-fibrogenic activity. Matrix metalloproteinases (MMP) that participate in extracellular matrix degradation are involved in the development of hepatic fibrosis. The present study investigates whether EGCG inhibits activation of the major gelatinase matrix metalloproteinase-2 (MMP-2) in rat hepatic stellate cells (HSC). Methods: The expression of MMP-2, tissue inhibitors of metalloproteinases-2 (TIMP-2), and membrane-type 1-MMP (MT1-MMP) was assessed by RT-PCR and Western blot analyses. MMP-2 activity was evaluated by zymography and MT 1-MMP activity was assessed by an enzymatic assay. HSC migration was measured by a wound healing assay and cell invasion was performed using Transwell cell culture chambers. Results: The expression of MMP-2 mRNA and protein in HSC was substantially reduced by EGCG treatment. EGCG treatment also reduced con-canavalin A (ConA)-induced activation of secreted MMP-2 and reduced MT1-MMP activity in a dose-dependent manner. In addition, EGCG inhibited either HSC migration or invasion. Conclusion: The abilities of EGCG to suppress MMP-2 activation and HSC invasiveness suggest that EGCG may be useful in the treatment and prevention of hepatic fibrosis. © 2006 CPS and SIMM.
Abolhasan, M & Lipman, J 2006, 'Self-selection route discovery strategies for reactive routing in ad hoc networks', Self-selection route discovery strategies for reactive routing in ad hoc networks, InterSense '06, ACM, Nice, France.
View/Download from: UTS OPUS or Publisher's site
View description>>
Routing in Ad hoc Networks has received a significant amount of attention. In recent years, the focus of research has been in on-demand (or reactive) routing protocols due to the recognition that these protocols have the potential to achieve higher levels of scalability than proactive routing strategies. However, most on-demand routing protocols proposed to date attempt to increase routing efficiency by using existing knowledge about the destination or by increasing the stability of the routes. Little research has been done to reduce route discovery overhead when no previous destination information is available. We present a number of different strategies, which encourage a more distributed and localised approach to route discovery by allowing each intermediate node during route discovery to make forwarding decisions using localised knowledge and self-selection. The use of self-selection for route discovery enables nodes to independently make route request (RREQ) forwarding decisions based upon a selection criterion or by satisfying certain conditions. The nodes which do not satisfy the selection criterion do not rebroadcast the RREQs. This provides a more effective and efficient search strategy than the use of traditional brute force blind flooding. We implemented our self-selecting route discovery strategies over AODV using the GloMoSim network simulation package, and compared the performance with existing routing protocols. Our simulation results show that a significant drop in the number of control packets can be achieved by giving each intermediate node more authority for self-selection during route discovery. Furthermore, a significant increase in routing performance is achieved as the number of nodes in the network is increased.
Aloqaily, A & Kennedy, PJ 2006, 'Using a kernel-based approach to visualize integrated chronic fatigue syndrome datasets', proceedings of the fifth Australasian data mining conference (AUSDM06), Australian Data Mining Conference, ACS, Sydney Australia, pp. 53-61.
View/Download from: UTS OPUS
Beauregard, M & Kennedy, PJ 2006, 'Robust simulation of Lamprey Tracking', Parallel problem solving from nature - PPSN, Parallel Problem Solving from Nature, Springer, Rejkavik, Iceland, pp. 641-650.
View/Download from: UTS OPUS or Publisher's site
View description>>
Biologically realistic computer simulation of vertebrates is a challenging problem with exciting applications in computer graphics and robotics. Once the mechanics of locomotion are available it is interesting to mediate this locomotion with higher level behavior such as target tracking. One recent approach simulates a relatively simple vertebrate, the lamprey, using recurrent neural networks to model the central pattern generator of the spine and a physical model for the body. Target tracking behavior has also been implemented for such a model. However, previous approaches suffer from deficiencies where particular orientations of the body to the target cause the central pattern generator to shutdown. This paper describes an approach to making target tracking more robust.
Beauregard, M, Kennedy, PJ & Debenham, JK 2006, 'Fast simulation of animal locomotion: lamprey swimming', Professional Practice In Artificial Intelligence, World Computer Congress, Springer, Santiago, Chile, pp. 247-256.
View/Download from: UTS OPUS or Publisher's site
View description>>
Biologically realistic computer simulation of vertebrate locomotion is an interesting and challenging problem with applications in computer graphics and robotics. One current approach simulates a relatively simple vertebrate, the lamprey, using recurrent
Cao, L 2006, 'Activity mining: Challenges and prospects', Advanced Data Mining And Applications, Proceedings, Lecture Notes in Artificial Intelligence, International Conference on Advanced Data Mining and Applications, Springer-Verlag Berlin, Xi'an, China, pp. 582-593.
View/Download from: UTS OPUS or Publisher's site
View description>>
Activity data accumulated in real life, e.g. in terrorist activities and fraudulent customer contacts, presents special structural and semantic complexities. However, it may lead to or be associated with significant business impacts. For instance, a seri
Cao, L & Zhang, C 2006, 'Domain-driven actionable knowledge discovery in the real world', Advances In Knowledge Discovery And Data Mining, Proceedings, Lecture Notes in Artificial Intelligence, Pacific-Asia Conference on Knowledge Discovery and Data Mining, Springer-Verlag Berlin, Singapore, pp. 821-830.
View/Download from: UTS OPUS or Publisher's site
View description>>
Actionable knowledge discovery is one of Grand Challenges in KDD. To this end, many methodologies have been developed. However, they either view data mining as an autonomous data-driven trial-and-error process, or only analyze the issues in an isolated a
Cao, L, Luo, C, Ni, J, Luo, D & Zhang, C 2006, 'Stock data mining through fuzzy genetic algorithm', Proceedings of the 9th Joint Conference on Information Sciences, JCIS 2006.
View/Download from: Publisher's site
View description>>
Stock data mining such as financial pairs mining is useful for trading supports and market surveillance. Financial pairs mining targets mining pair relationships between financial entities such as stocks and markets. This paper introduces a fuzzy genetic algorithm framework and strategies for discovering pair relationship in stock data such as in high dimensional trading data by considering user preference. The developed techniques have a potential to mine pairs between stocks, between stock-trading rules, and between markets. Experiments in real stock data show that the proposed approach is useful for mining pairs helpful for real trading decision-support and market surveillance.
Cao, L, Luo, D & Zhang, C 2006, 'Fuzzy genetic algorithms for pairs mining', PRICAI 2006: Trends In Artificial Intelligence, Proceedings, Lecture Notes in Artificial Intelligence, Pacific Rim International Conference on Artificial Intelligence, Springer-Verlag Berlin, Guilin, China, pp. 711-720.
View/Download from: UTS OPUS or Publisher's site
View description>>
Pairs mining targets to mine pairs relationship between entities such as between stocks and markets in financial data mining. It has emerged as a kind of promising data mining applications. Due to practical complexities in the real-world pairs mining suc
Cao, L, Ni, J & Luo, D 2006, 'Ontological engineering in data warehousing', Frontiers Of WWW Research And Development - Apweb 2006, Proceedings - Lecture Notes in Computer Science, Asia Pacific Web Conference, Springer-Verlag Berlin, Harbin, China, pp. 923-929.
View/Download from: UTS OPUS or Publisher's site
View description>>
In our previous work, we proposed the ontology-based integration of data warehousing to make existing data warehouse system more user-friendly, adaptive and automatic. This paper further outlines a high-level picture of the ontological engineering in dat
Chang, E, Hussain, FK & Dillon, T 2006, 'Reputation ontology for reputation systems', On the Move to Meaningful Internet Systems 2006: OTM 2006 Workshops, Pt 2, Proceedings, pp. 1724-1733.
Chen, J, Shen, J, Zhang, J & Wangsa, K 2006, 'A novel multimedia database system for efficient image/video retrieval based on hybrid-tree structure', Proceedings of the 2006 International Conference on Machine Learning and Cybernetics, 2006 International Conference on Machine Learning and Cybernetics, NA, Dalian, pp. 4353-4358.
View/Download from: Publisher's site
View description>>
With recent advances in computer vision, image processing and analysis, a retrieval process based on visual content has became a key component in achieving high efficiency image query for large multimedia databases. In this paper, we propose and develop
Chen, L, Bhowmick, SS & Li, J 2006, 'COWES: Clustering web users based on historical web sessions', Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 541-556.
View/Download from: Publisher's site
View description>>
Clustering web users is one of the most important research topics in web usage mining. Existing approaches cluster web users based on the snapshots of web user sessions. They do not take into account the dynamic nature of web usage data. In this paper, we focus on discovering novel knowledge by clustering web users based on the evolutions of their historical web sessions. We present an algorithm called COWES to cluster web users in three steps. First, given a set of web users, we mine the history of their web sessions to extract interesting patterns that capture the characteristics of their usage data evolution. Then, the similarity between web users is computed based on their common interesting patterns. Then, the desired clusters are generated by a partitioning clustering technique. Web user clusters generated based on their historical web sessions are useful in intelligent web advertisement and web caching. © Springer-Verlag Berlin Heidelberg 2006.
Chen, L, Bhowmick, SS & Li, J 2006, 'Mining temporal indirect associations', Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 425-434.
View description>>
This paper presents a novel pattern called temporal indirect association. An indirect association pattern refers to a pair of items that rarely occur together but highly depend on the presence of a mediator itemset. The existing model of indirect association does not consider the lifespan of items. Consequently, some discovered patterns may be invalid while some useful patterns may not be covered. To overcome this drawback, in this paper, we take into account the lifespan of items to extend the current model to be temporal. An algorithm, MG-Grvwth, that finds the set of mediators in pattern-growth manner is developed. Then, we extend the framework of the algorithm to discover temporal indirect associations. Our experimental results demonstrated the efficiency and effectiveness of the proposed algorithms. © Springer-Verlag Berlin Heidelberg 2006.
Chen, Q, Chen, PY, Zhang, C & Li, L 2006, 'Mining frequent itemsets for protein kinase regulation', PRICAI 2006: Trends in Artificial Intelligence, Pacific Rim International Conference on Artificial Intelligence, Springer, Guilin, China, pp. 222-230.
View/Download from: UTS OPUS or Publisher's site
View description>>
Protein kinases, a family of enzymes, have been viewed as an important signaling intermediary by living organisms for regulating critical biological processes such as memory, hormone response and cell growth. The unbalanced kinases are known to cause cancer and other diseases. With the increasing efforts to collect, store and disseminate information about the entire kinase family, it not only leads to valuable data set to understand cell regulation but also poses a big challenge to extract valuable knowledge about metabolic pathway from the data. Data mining techniques that have been widely used to find frequent patterns in large datasets can be extended and adapted to kinase data as well. This paper proposes a framework for mining frequent itemsets from the collected kinase dataset. An experiment using AMPK regulation data demonstrates that our approaches are useful and efficient in analyzing kinase regulation data.
Chen, Q, Chen, PY, Zhang, S & Zhang, C 2006, 'Detecting collusion attacks in security protocols', Frontiers Of WWW Research And Development - Apweb 2006, Proceedings - Lecture Notes in Computer Science, Asia Pacific Web Conference, Springer-Verlag Berlin, Harbin, China, pp. 297-306.
View/Download from: UTS OPUS or Publisher's site
View description>>
Security protocols have been widely used to safeguard secure electronic transactions. We usually assume that principals are credible and shall not maliciously disclose their individual secrets to someone else. Nevertheless, it is impractical to completel
Chen, Q, Chen, PY, Zhang, S & Zhang, C 2006, 'Detecting Collusion in Security protocols', Frontiers of WWW Research and Development, Asia Pacific Web Conference, Springer, Harbin, China, pp. 297-306.
View/Download from: UTS OPUS
Chen, X, Liu, W & Williams, MA 2006, 'ACM International Conference Proceeding Series: Preface', ACM International Conference Proceeding Series.
Chen, Y, Zhang, J & Jayalath, ADS 2006, 'Multiband-ofdm uwb vs ieee802. 11n: system level design considerations', Vehicular Technology Conference, 2006. VTC 2006-Spring. IEEE 63rd, IEEE, pp. 1972-1976.
Cheng, E & Piccardi, M 2006, 'Matching of objects moving across disjoint cameras', Proceedings of IEEE ICIP 2006, IEEE International Conference on Image Processing, IEEE, Atlanta, USA, pp. 1769-1772.
View/Download from: UTS OPUS or Publisher's site
View description>>
Matching of single individuals as they move across disjoint camera views is a challenging task in video surveillance. In this paper, we present a novel algorithm capable of matching single individuals in such a scenario based on appearance features. In order to reduce the variable illumination effects in a typical disjoint camera environment, a cumulative color histogram transformation is first applied to the segmented moving object. Then, an incremental major color spectrum histogram representation (IMCSHR) is used to represent the appearance of a moving object and cope with small pose changes occurring along the track. An IMCHSR-based similarity measurement algorithm is also proposed to measure the similarity of any two segmented moving objects. A final step of post-matching integration along the object's track is eventually applied. Experimental results show that the proposed approach proved capable of providing correct matching in typical situations
Cheng, E, Piccardi, M & Madden, CS 2006, 'Mitigating the effects of variable illumination for tracking across disjoint camera views', Proceedings of the IEEE Int Conf on Video and Signal Based Surveillance (AVSS 2006), Advanced Video and Signal Based Surveillance, IEEE Computer Society, Sydney, Australia, pp. 32-37.
View/Download from: UTS OPUS
Cheng, E. & Piccardi, M. 2006, 'Matching Moving Objects by parts with a maximum likelihood criterion', Proceedings of Image and Vision Computing New Zealand 2006, Image and Vision Computing Conference, University of Auckland, New Zealand, pp. 373-378.
View/Download from: UTS OPUS
Chiarella, C, Dieci, R & He, X 2006, 'A dynamic heterogenous beliefs CAPM', Complex Behavior in Economics: Modelling, Computing and Mastering Complexity, Complex Behavior in Economics: Modelling, Computing and Mastering Complexity, GREQAM, Aix-en-Provence, France, pp. 1-26.
Chiarella, C, Dieci, R & He, X 2006, 'A dynamic heterogenous beliefs CAPM', Workshop on Financial Market Dynamics, Piacenza, Italy.
Chiarella, C, Dieci, R & He, X 2006, 'Aggregation of heterogeneous beliefs and asset pricing: A mean-variance analysis.', 12th International Conference on Computing in Economics and Finance, Limassol, Cyprus.
Chiarella, C, Dieci, R & He, X 2006, 'Aggregation of heterogenous beliefs and asset pricing: A mean-variance analysis', Workshop on Economics of Heterogenous Interacting Agents, Bologna, Italy.
Chiarella, C, Dieci, R & He, X 2006, 'On the dynamic behavior of asset prices in disequilibrium: Where are we after three decades?', MDEF 2006, Urbino, Italy.
Chiarella, C, Dieci, R & He, X 2006, 'On the dynamic behaviour of asset prices in disequilibrium: Where are we after three decades?', WIVA 3 Conference, Sienna, Italy.
Chiarella, C, He, X & Hommes, C 2006, 'A dynamic analysis of moving average rules', Workshop on Dynamic Models in Economics and Finance, Piacenza, Italy.
Chiarella, C, He, X & Li, Y 2006, 'A dynamic heterogenous beliefs CAPM', 1st International Conference on Economic Science with Heterogenous Interacting Agents, Bologna, Italy.
Christen, P, Kennedy, PJ, Li, J, Simoff, SJ & Williams, GJ 2006, 'Preface', Conferences in Research and Practice in Information Technology Series.
Christen, P., Kennedy, P.J., Li, J., Simoff, S.J. & Williams, G. 2006, 'Data Mining 2006: Proceedings of the Australasian Data Mining Conference (AusDM 2006)', Data Mining 2006: Proceedings of the Australasian Data Mining Conference (AusDM 2006), Australian Data Mining Conference, Australian Computer Society, Sydney.
Davis, M, Smith, T, Laden, F, Hart, J, Ryan, L & Garshick, E 2006, 'Structural equation modeling in exposure assessment', EPIDEMIOLOGY, pp. S466-S466.
View/Download from: Publisher's site
Elliot, S, Williams, M & Bjorn-Anderson, N 2005, 'Strategic Management of technology-enabled disruptive innovation: Next generation web technologies', Proceedings of CIMCA 2005 jointly with International Conference on Intelligent Agents, Web Technologies, and Internet Commerce 2005, International Conference on Intelligent Agents, Web Technologies, and Internet Commerce, IEEE, Vienna, Australia, pp. 113-120.
View/Download from: UTS OPUS
View description>>
Technology-enabled business innovation presents the potential to structurally transform enterprise and industry practice, but uncertainty remains as to how such transformations might be managed. The search for higher returns from technology-enabled business innovation will inevitably lead to the adoption and exploitation of powerful, but disruptive technologies that bring with them higher levels of risk. Disruptive innovation is placed into context through the literature and through examples of past IT innovations with disruptive impact. This paper examines how organizations could obtain improved management of the adoption of potentially disruptive future generation Web technologies. The Business Innovation Technology Adoption Model (BITAM) is applied to emerging Web technologies to help identify the nature and extent of their potentially disruptive impact on business practice and management strategies so as to better enable mitigation of business risk.
Gao, F, He, S, Li, Y & Wang, J 2006, 'MAC performance analysis on two stage HFC access networks', IEEE international conference on computer and information technology (CIT 2006), IEEE International Conference on Computer and Information Technology, IEEE CS, Seoul, Korea, pp. 96-99.
View/Download from: UTS OPUS or Publisher's site
View description>>
Two-stage access network structure is widely used in fixed and mobile access networks such as HFC (Hybrid Fibre/Coaxial) and BSS (Base Station System). In this paper, we introduce a new two-stage access scheme that employs random access and centralized polling methods corresponding to the two stages respectively. The new schemeÂs MAC (Medium Access Control) protocol procedure is presented based on DOCSIS standard. The performance of the mechanism in terms of access delay and throughput is evaluated and analyzed using computer simulating experiments. The results show the new access mechanism is efficient.
Gunes, H & Piccardi, M 2006, 'A bimodal face and body gesture database for automatic analysis of human nonverbal affective behavior', 18Th International Conference On Pattern Recognition, Vol 1, Proceedings, International Conference on Pattern Recognition, IEEE Computer Soc, Hong Kong, China, pp. 1148-1153.
View/Download from: UTS OPUS or Publisher's site
View description>>
To be able to develop and test robust affective multimodal systems, researchers need access to novel databases containing representative samples of human multi-modal expressive behavior. The creation of such databases requires a major effort in the defin
Gunes, H & Piccardi, M 2006, 'Creating and annotating affect databases from face and body display: a contemporary survey', Proceedings of SMC 2006, IEEE Conference on Systems, Man and Cybernetics, IEEE, Taipei, Taiwan, pp. 2426-2433.
View/Download from: UTS OPUS or Publisher's site
View description>>
Databases containing representative samples of human multi-modal expressive behavior are needed for the development of affect recognition systems. However, at present publicly-available databases exist mainly for single expressive modalities such as facial expressions, static and dynamic hand postures, and dynamic hand gestures. Only recently, a first bimodal affect database consisting of expressive face and upper-body display has been released. To foster development of affect recognition systems, this paper presents a comprehensive survey of the current state-of-the art in affect database creation from face and body display and elicits the requirements of an ideal multi-modal affect database
Gunes, H. & Piccardi, M. 2006, 'Observer Annotation of Affective Display and Evaluation of Expressivity: Face vs. Face-and-body', Use of Vision in Human-Computer Interaction: Proceedings of the HCSNet Workshop on the use of vision in human-computer interaction, the HCSNet Workshop on the use of vision in human-computer interaction, Australian Computer Society, Canberra, Australia, pp. 35-42.
View/Download from: UTS OPUS
View description>>
A first step in developing and testing a robust affective multimodal system is to obtain or access data representing human multimodal expressive behaviour. Collected affect data has to be further annotated in order to become usable for the automated systems. Most of the existing studies of emotion or affect annotation are monomodal. Instead, in this paper, we explore how independent human observers annotate affect display from monomodal face data compared to bimodal face-and-body data. To this aim we collected visual affect data by recording the face and face-and-body simultaneously. We then conducted a survey by asking human observers to view and label the face and face-and-body recordings separately. The results obtained show that in general, viewing face-and-body simultaneously helps with resolving the ambiguity in annotating emotional behaviours.
He, S, Hintz, TB, Wu, Q, Wang, H & Jia, W 2006, 'A new simulation of spiral architecture', IPCU 06 procedings, International Conference on Image Processing, Computer Vision and Pattern Recognition, CSREA Press, Las Vegas, USA, pp. 570-575.
View/Download from: UTS OPUS
He, S, Jia, W, Hur, N, Wu, Q & Kim, JC 2006, 'Image translation and rotation on hexagonal structure', Sixth IEEE International conference on computer and information technology, IEEE International Conference on Computer and Information Technology, IEEE CS, Seoul, Korea, pp. 1-6.
View/Download from: UTS OPUS or Publisher's site
View description>>
Image translation and rotation are becoming essential operations in many application areas such as image processing, computer graphics and pattern recognition. Conventional translation moves image from pixels to pixels and conventional rotation usually comprises of computation-intensive CORDIC operations. Traditionally, images are represented on a square pixel structure. In this paper, we perform reversible and fast image translation and rotation based on a hexagonal structure. An image represented on the hexagonal structure is a collection of hexagonal pixels of equal size. The hexagonal structure provides a more flexible and efficient way to perform image translation and rotation without losing image information. As there is not yet any available hardware for capturing image and for displaying image on a hexagonal structure, we apply a newly developed virtual hexagonal structure. The virtual hexagonal structure retains image resolution during the process of image transformations, and almost does not introduce distortion. Furthermore, images can be smoothly and easily transferred between the traditional square structure and the hexagonal structure.
He, S, Jia, W, Hur, N, Wu, Q, Kim, J & Hintz, TB 2006, 'Bi-lateral edge detection on a virtual hexagonal structure', International Symposium on Visual Computing 2006 - Lecture notes in computing science, International Symposium on Visual Computing, Springer, United States, pp. 176-185.
View/Download from: UTS OPUS
He, S, Jia, W, Wu, Q, Hur, N, Hintz, TB, Wang, H & Kim, JC 2006, 'Basic transformation on virtual hexagonal structure', Proceedings. 2006 international conference on computer graphics, imaging and visualisation, International Conference Computer Graphics, Imaging and Visualization, IEEE Computer society, Sydney, Australia, pp. 243-248.
View/Download from: UTS OPUS or Publisher's site
View description>>
Hexagonal structure is different from the traditional square structure for image representation. The geometrical arrangement of pixels on hexagonal structure can be described in terms of a hexagonal grid. Hexagonal structure provides an easy way for image translation and rotation transformations. However, all the existing hardware for capturing image and for displaying image are produced based on square architecture. It has become a serious problem affecting the advanced research based on hexagonal structure. In this paper, we introduce a new virtual hexagonal structure. Based on this virtual structure, a more flexible and powerful image translation and rotation are performed. The virtual hexagonal structure retains image resolution during the process of image transformations, and does not introduce distortion. Furthermore, images can be smoothly and easily transferred between the traditional square structure and the hexagonal structure.
He, S, Wang, H, Hur, N, Jia, W, Wu, Q, Kim, JC & Hintz, TB 2006, 'Uniformly partitioning images on a virtual hexagonal structure', 2006 8th International conference on control automation robotics and vision (ICARCV 2006), International Conference on Control, Automation, Robotics and Vision, IEEE, Singapore, pp. 891-896.
View/Download from: UTS OPUS or Publisher's site
View description>>
Hexagonal structure is different from the traditional square structure for image representation. The geometrical arrangement of pixels on hexagonal structure can be described in terms of a hexagonal grid. Uniformly separating image into seven similar copies with a smaller scale has commonly been used for parallel and accurate image processing on hexagonal structure. However, all the existing hardware for capturing image and for displaying image are produced based on square architecture. It has become a serious problem affecting the advanced research based on hexagonal structure. Furthermore, the current techniques used for uniform separation of images on hexagonal structure do not coincide with the rectangular shape of images. This has been an obstacle in the use of hexagonal structure for image processing. In this paper, we briefly review a newly developed virtual hexagonal structure that is scalable. Based on this virtual structure, algorithms for uniform image separation are presented. The virtual hexagonal structure retains image resolution during the process of image separation, and does not introduce distortion. Furthermore, images can be smoothly and easily transferred between the traditional square structure and the hexagonal structure while the image shape is kept in rectangle
He, S, Wang, H, Wu, Q, Hintz, TB & Hur, N 2006, 'Fractal image compression on spiral architecture', Proceeding 2006 international conference on computer graphics imaging and visualisation, International Conference Computer Graphics, Imaging and Visualization, IEEE computer society, Sydney, Australia, pp. 76-83.
View/Download from: UTS OPUS or Publisher's site
View description>>
Image compression has many applications. For example, it is an important step for distributed and network based pattern recognition. For real time object recognition or reconstruction, image compression can greatly reduce the image size, and hence increase the processing speed and enhance performance. Fractal image compression is a relatively recent image compression method. Its basic idea is to represent images as a fixed point of a contractive Iterated Function System (IFS). Spiral Architecture (SA) is a novel image structure on which images are displayed as a collection of hexagonal pixels. The efficiency and accuracy of image processing on SA have been demonstrated in many recently published papers. We have shown the existence of contractive IFS?s through the construction of a Complete Metric Space on SA. The selection of range and domain blocks for fractal image compression is highly related to the uniform image separation specific to SA. In this paper, we will review the current research work on fractal image compression based on SA. We will compare the results obtained on SA and the traditional square structure in terms of compression ratio and PSNR.
He, S, Zhang, H, Hur, N, Kim, J, Kim, T & Wu, Q 2006, 'Complete camera calibration using line-shape objects', Tencon 2006 Hong Kong IEE region 10 conference, IEEE Tencon (IEEE Region 10 Conference), IEEE, Honk Kong, China, pp. 1-4.
View/Download from: UTS OPUS
He, S, Zhang, H, Hur, N, Kim, J, Wu, Q & Kim, T 2006, 'Estimation of internal paramenters and external paramenters for camera calibration using ID pattern', Proceedings of the international conference on video and signal based surveillance 2006 (AVSS 2006), Advanced Video and Signal Based Surveillance, IEEE Computer Society, Sydney, Australia, pp. 93-98.
View/Download from: UTS OPUS
He, X & Li, Y 2006, 'Long memory, heterogeneity and trend chasing', 17th Annual Asian Finance Association/ FMA Conference, 17th Annual Asian Finance Association/ FMA Conference, Asian Finance Association, Auckland, New Zealand, pp. 1-33.
Hussain, FK, Chang, E & Dillon, T 2006, 'Defining trustworthiness in service oriented environment', Proceedings - 2006 International Conference on Information and Communication Technologies: From Theory to Applications, ICTTA 2006, pp. 3616-3621.
View/Download from: Publisher's site
View description>>
© 2006 IEEE. In the existing literature we note that there has been no effort in proposing a definition of trustworthiness. In this paper, we propose a definition of trustworthiness with focus on service oriented environments. In addition, we propose and discuss in detail the various factors which can affect the trustworthiness assigned by the trusting agent to the trusted agent.
Hussain, FK, Chang, E & Dillon, TS 2006, 'Aspects influencing trustworthiness in service oriented environments', ICDEW 2006 - Proceedings of the 22nd International Conference on Data Engineering Workshops.
View/Download from: Publisher's site
View description>>
© 2006 IEEE. Transactions have moved away from faceto- face encounters to more being on the Internet. The infrastructure for the business and information exchange activities could be client-server, peer-To-peer (P2P), or mobile networks. In this paper we refer to 'peer' as an entity involved in a transaction. Trust between two interacting peers involved in an electronic transaction is a major issue that needs to be addressed in order to make the internet a safe medium for carrying out transactions. In this paper, we propose the aspects that can influence the trustworthiness assigned to the trusted peer. Furthermore we catalogue these factors into three classes and discuss the relationship between these factors.
Hussain, FK, Chang, E & Dillon, TS 2006, 'Comparative analysis of trust and security', 2006 IEEE International Conference on Service Operations and Logistics, and Informatics, SOLI 2006, pp. 1019-1023.
View/Download from: Publisher's site
View description>>
In the literature, there is a lot of confusion regarding the relationship between the 'trust' and 'security'. Most of the times, these terms are regarded as being synonymous with each other. The existing literature does not draw a clear line how and when the terms of 'trust' and 'security' are synonymous and when they are not synonymous. In this paper we address this issue and discuss when the distinct terms of 'trust' and 'security' can be regarded as being synonymous with each other and when they could be regarded as not being synonymous with each other. © 2006 IEEE.
Hussain, FK, Chang, E & Dillon, TS 2006, 'Defining reputation in service oriented environment', Proceedings of the Advanced International Conference on Telecommunications and International Conference on Internet and Web Applications and Services, AICT/ICIW'06, p. 177.
View/Download from: Publisher's site
View description>>
Reputation has a profound impact on the Trusting Agent and Trusted Agent in business interactions. Moral, ethical and legal guidelines are implemented as a result of the promotion of fair trading practices, honesty from all parties, consumer protection legislation, service quality assessment, and assurance for customers, e-businesses and service-oriented environments. In this paper we propose a definition of reputation that is more suited to service oriented environments. Additionally we explain in detail, all the terms in the definition. © 2006 IEEE.
Hussain, FK, Chang, E & Dillon, TS 2006, 'Ontological manifestations of trust for service oriented environment', 2006 IEEE interenational cinference on industrial informatics, IEEE interenational cinference on industrial informatics, IEEE, Singapore, pp. 593-598.
View/Download from: UTS OPUS or Publisher's site
View description>>
Trust and reputation are vital components for trusted e-business. In the literature however there has been no effort in proposing ontology for trust. The trusted agent in service oriented environment may trust a software agent or human agent or a service or a product. Based on this distinction, trust ontology could be proposed for different domains .The trust ontology for the individual domains is proposed and discussed.
Hussain, FK, Chang, E & Dillon, TS 2006, 'Quantification Of The Effectiveness Of The Markov Model For Trustworthiness Prediction', Computational Intelligence, Theory And Application, International Conference on Dortmund Fuzzy Days, Springer-verlag Berlin, Dortmund, GERMANY, pp. 191-200.
View/Download from: Publisher's site
View description>>
In this paper we propose a method for determining the effectiveness of the Markov Model for predicting the future trustworthiness value of a given agent by utilizing simulation methods. This paper presents in detail the simulation method that we employed
Hussain, FK, Chang, E & Dillon, TS 2006, 'Quantification of the effectiveness of the Markov model for trustworthiness prediction', Advances in Soft Computing, pp. 191-200.
View description>>
In this paper we propose a method for determining the effectiveness of the Markov Model for predicting the future trustworthiness value of a given agent by utilizing simulation methods. This paper presents in detail the simulation method that we employed in order to determine the effectiveness of the Markov Model. Additionally the paper presents the results that we obtained form the simulation experiments.
Hussain, FK, Chang, E & Dillon, TS 2006, 'Reputation Relationship And Its Inner Relationships For Service Oriented Environments', 2006 IEEE International Conference On Computer Systems And Applications, Vols 1-3, IEEE/ACS International Conference on Computer Systems and Applications, IEEE, Sharjah, UAE, pp. 641-646.
View/Download from: UTS OPUS or Publisher's site
View description>>
Trust and Reputation are vital components for trusted e-business. In this paper, we propose a definition of trust relationship. Additionally we discuss in depth about the concept of trust relationship. A definition for reputation relationship is proposed
Hussain, FK, Chang, E & Dillon, TS 2006, 'Trust issues in service oriented environment', 2006 IEEE International Conference on Service Operations and Logistics, and Informatics, SOLI 2006, pp. 790-793.
View/Download from: Publisher's site
View description>>
Service Oriented Environment (SOE) is new paradigm for carrying out business activities on the internet. In this paper I give an introduction to the concept of service oriented environment and discuss the different activities carried out in the SOE and different entities involved in SOE. The issues related to trust in service oriented environment and proposed and explained. © 2006 IEEE.
Hussain, FK, Chang, E & Dillon, TS 2012, 'Trust Ontology For Service-oriented Environment', 2006 IEEE International Conference On Computer Systems And Applications, Vols 1-3, IEEE/ACS International Conference on Computer Systems and Applications, IEEE, Sharjah, UAE, pp. 320-325.
View/Download from: UTS OPUS or Publisher's site
View description>>
Trust and Reputation are vital components for trusted e-business. In the literature however there has been no effort in proposing ontology for trust. The trusted agent in service oriented environment may trust a software agent or human agent or a service
Hussain, FK, Chang, E & Dillon, TS 2006, 'Trust Relationships And Reputation Relationships For Service Oriented Environments', 2006 IEEE International Conference On Computer Systems And Applications, Vols 1-3, IEEE/ACS International Conference on Computer Systems and Applications, IEEE, Sharjah, UAE, pp. 508-510.
View/Download from: UTS OPUS or Publisher's site
View description>>
Trust and Reputation are vital components for trusted e-business. In this paper, we propose a definition of trust relationship. Additionally we discuss in depth about the concept of trust relationship. A definition for reputation relationship is proposed
Hussain, FK, Chang, E & Dillon, TS 2006, 'Trustworthiness Measurement Methodology For E-business', Advances In Web Intelligence And Data Mining, International Atlantic Web Intelligence Conference, Springer-verlag Berlin, Beer Sheva, ISRAEL, pp. 21-30.
View description>>
The purpose of the Trustworthiness Measure is to (a) to determine the quality of the Trusted Agents and (b) once the trusting agent has determined and recorded the trustworthiness of the trusted agent or the quality of the trusted agent, the trusting age
Hussain, FK, Sidhu, A, Dillon, TS & Chang, E 2006, 'Engineering Trustworthy Ontologies: Case Study Of Protein Ontology', 19th IEEE International Symposium On Computer-based Medical Systems, Proceedings, IEEE Symposium on Computer-Based Medical Systems, IEEE Computer Soc, Salt Lake City, UT, pp. 617-620.
View/Download from: Publisher's site
View description>>
Biomedical Ontologies are huge. It is not possible for any one person to manage and engineer a complete ontology. They would need the help of Research Assistants and other people to develop and maintain the ontology. In the process of developing and main
Hussain, O, Chang, E, Hussain, FK & Dillon, TS 2006, 'A Fuzzy Approach to Risk Based Decision Making', Lecture Notes in Computer Science 4278 - On the Move to Meaningful Internet Systems 2006: OTM 2006 W Part II, On the Move to Meaningful Internet Systems Workshops, Springer-Verlag Berlin Heidelberg, Montpellier, France, pp. 1765-1775.
View/Download from: UTS OPUS or Publisher's site
View description>>
Decision making is a tough process. It involves dealing with a lot of uncertainty and projecting what the final outcome might be. Depending on the projection of the uncertain outcome, a decision has to be taken. In a peer-to-peer financial interaction, the trusting agent in order to analyze the Risk has to consider the possible likelihood of failure of the interaction and the possible consequences of failure to its resources involved in the interaction before concluding whether to interact with the probable trusted agent or not. Further it might also have to choose and decide on an agent to interact with from a set of probable trusted agents. In this paper we propose a Fuzzy Risk based decision making system that would assist the trusting agent to ease its decision making process.
Hussain, O, Chang, E, Hussain, FK & Dillon, TS 2006, 'A Methodology For Determining The Creditability Of Recommending Agents', Knowledge-based Intelligent Information And Engineering Systems, Pt 3, Proceedings, International Conference on Knowledge-Based and Intelligent Information and Engineering Systems, Springer-verlag Berlin, Bournemouth, ENGLAND, pp. 1119-1127.
View description>>
The trusting agent in order to analyze the Risk that could be present in its future interaction with a trusted agent might solicit for its recommendations from other agents. Based on the recommendations achieved the trusting agent can decide whether to i
Hussain, O, Chang, E, Hussain, FK & Dillon, TS 2006, 'A Methodology For Risk Based Decision Making In A Service Oriented Environment', IEEE International Conference On Sensor Networks, Ubiquitous, And Trustworthy Computing, Vol 1, Proceedings, IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing, IEEE Computer Soc, Tai Chung, TAIWAN, pp. 506-513.
View description>>
Decision making is a complex process. It involves in dealing with a lot of uncertainty and projecting in mind what the final outcome might be at the end. Based on the Projection of the final outcome a decision is taken. Decision making in a peer-to-peer
Hussain, O, Chang, E, Hussain, FK & Dillon, TS 2006, 'Quantifying risk in financial terms in an e-transaction', 2006 IEEE international conference on industrial informatics, International IEEE conference on industrial informatics, IEEE, Singapore, pp. 587-592.
View/Download from: UTS OPUS or Publisher's site
View description>>
An outcome of risk is the possible loss that could incur in an interaction. In a peer-to-peer financial interaction, the possible loss that could incur is usually the financial loss in the resources of the trusting agent that are involved in the interaction. Hence, a consideration for the trusting agent to analyze the risk in interacting with any probable trusted agent in order to decide whether to interact with it or not, is to determine the potential loss in its resources that may occur. In this paper, we will propose a methodology by which the trusting agent can determine beforehand the possible loss that could be incurred to it as a result of interacting with a probable trusted agent.
Hussain, O, Chang, E, Hussain, FK & Dillon, TS 2006, 'Towards Ascertaining Risk In Digital Business Ecosystem Interactions', 2006 Innovations In Information Technology, Innovations in Information Technology Conference, IEEE, Dubai, U ARAB EMIRATES, pp. 227-231.
View description>>
In digital business ecosystem architecture, it is rational for the trusting agent to analyse the possible risk in interacting with a probable trusted agent beforehand. Doing so would assist the trusting agent in its decision process. The possible risk in
Hussain, O, Chang, E, Hussain, FK, Dillon, TS & Soh, B 2006, 'Context And Time Dependent Risk Based Decision Making', 20th International Conference On Advanced Information Networking And Applications, Vol 1, Proceedings, International Conference on Advanced Information Networking and Applications, IEEE, Vienna, AUSTRIA, pp. 585-590.
View description>>
As there is a lack of central management in an e-commerce interaction carried out based on peer-to-peer architecture, it is obvious for the trusting peer to analyze the Risk beforehand that could be involved in dealing with a trusted peer in these types
Hussain, O, Chang, E, Hussain, FK, Dillon, TS & Soh, B 2006, 'Predicting The Dynamic Nature Of Risk', 2006 IEEE International Conference On Computer Systems And Applications, Vols 1-3, IEEE/ACS International Conference on Computer Systems and Applications, IEEE, Sharjah, UAE, pp. 500-507.
View/Download from: UTS OPUS or Publisher's site
View description>>
The trusting peer in order to determine the likelihood of the loss in its resources might analyze the Risk before engaging in an interaction with any trusted peer. This likelihood of the loss in the resources is termed as Risk in the interaction. Risk an
Hussain, OK, Chang, E, Hussain, FK, Dillon, TS & Soh, B 2006, 'Context and time based riskiness assessment for decision making', Proceedings of the Advanced International Conference on Telecommunications and International Conference on Internet and Web Applications and Services, AICT/ICIW'06, p. 104.
View/Download from: Publisher's site
View description>>
In an e-commerce interaction carried out in a Peer-to-Peer environment it is rational for the trusting peer to analyze the Risk that could be involved in dealing with a trusted peer as there is a lack of central management in these type of interactions. Risk analysis can be done by assimilating recommendations from other peers if there is no previous interaction history between the trusting peer and the trusted peer. But the assimilated recommendations might be according to the criteria of the recommending peer with the trusted peer, and it is not necessary for the trusting peer to have the same criteria in its interaction with the trusted peer as that of the recommending peer even thought it is interacting in the same context. Further it might interact in a different time as that of the recommending peer. The Risk that was present in a particular context and at a particular time might not be the same at a different time. Hence in this paper we discuss the process of the trusting peer assimilating the recommendations from the recommending peers according to the context, criteria and time of its interaction in order to determine the Riskiness value of the trusted peer, which would help it considerably in decision making. © 2006 IEEE.
Jia, W, He, S & Tien, D 2006, 'Automatically detecting road sign text from natural scene video', Proceedings of IEEE region 10 conference 2006, IEEE Tencon (IEEE Region 10 Conference), IEEE, Hong Kiong, pp. 1-4.
View/Download from: UTS OPUS
Jia, W, Zhang, H, He, S & Wu, Q 2006, 'A comparison on histogram based image matching methods', Proceedings of the IEEE international conference on video and signal based surveillance, Advanced Video and Signal Based Surveillance, IEEE Computer Society, Sydney, Australia, pp. 1-6.
View/Download from: UTS OPUS
Jia, W, Zhang, H, He, S & Wu, Q 2006, 'Gaussian weighted histogram intersection for license plate classification', 18Th International Conference On Pattern Recognition, Vol 3, Proceedings, International Conference on Pattern Recognition, IEEE Computer Soc, Hong Kong, PEOPLES R CHINA, pp. 574-577.
View/Download from: UTS OPUS or Publisher's site
View description>>
The conventional histogram intersection (HI) algorithm computes the intersected section of the corresponding color histograms in order to measure the matching rate between two color images. Since this algorithm is strictly based on the matching between b
Jia, W, Zhang, H, He, S & Wu, Q 2006, 'Image matching using color edge coocurrence histogram', Proceedings of the 2006 IEEE international conference on systems, man and cybernetics, IEEE Conference on Systems, Man and Cybernetics, IEEE, Taipei, Taiwan, pp. 2413-2419.
View/Download from: UTS OPUS or Publisher's site
View description>>
In this paper, a novel colour edge cooccurrence histogram (CECH) method is proposed to match images by measuring similarities between their CECH histograms. Unlike the previous colour edge cooccurrence histogram proposed by Crandall and Luo (2004 ) we only investigate those pixels which are located at the two sides of edge points in their gradient direction lines and at a distance away from the edge points. When measuring similarities between two CECH histograms, a newly proposed Gaussian weighted histogram intersection (GWHI) method is extended for this purpose. Both identical colour pairs and similar colour pairs are taken into account in our algorithm, and the weights are decided by the larger distance between two colour pairs involved in matching. The proposed algorithm is tested for matching vehicle number plate images captured under various illumination conditions. Experimental results demonstrate that the proposed algorithm can be used to compare images in real-time, and is robust to illumination variations and insensitive to the model images selected.
Jia, W, Zhang, H, He, S & Wu, Q 2006, 'Refined gaussian weighted histogram intersection and its application in number plate categorization', Proceedings, computer graphics, imaging and visualisation, International Conference Computer Graphics, Imaging and Visualization, IEEE Computer Society, Sydney Australia, pp. 249-254.
View/Download from: UTS OPUS or Publisher's site
View description>>
This paper proposes a refined Gaussian weighted histogram intersection for content-based image matching and applies the method for number plate categorization. Number plate images are classified into two groups based on their colour similarities with the model image of each group. The similarities of images are measured by the matching rates between their colour histograms. Histogram intersection (HI) is used to calculate the matching rates of histograms. Since the conventional histogram intersection algorithm is strictly based on the matching between bins of identical colours, the final matching rate could easily be affected by colour variation caused by various environment changes. In our recent paper [9], a Gaussian weighted histogram intersection (GWHI) algorithm has been proposed to facilitate the histogram matching via taking into account matching of both identical colours and similar colours. The weight is determined by the distance between two colours. When applied to number plate categorization, the GWHI algorithm demonstrates to be more robust to colour variations and produces a classification with much lower intra-class distance and much higher interclass distance than previous HI algorithms. However, the processing speed of this GWHI method is still not satisfying. In this paper, the GWHI method is further refined, where a colour quantization method is utilized to reduce the number of colours without introducing apparent perceptual colour distortion. New experimental results demonstrate that using the refined GWHI method, image categorization can be done more efficiently.
Jia, W, Zhang, H, He, S & Wu, Q 2006, 'Symmetric color ratio in spiral architecture', Computer Vision - ACCV 2006, Pt ii, Lecture Notes in Computer Science, Asian Conference on Computer Vision, Springer-Verlag Berlin, Hyderabad, India, pp. 204-213.
View/Download from: UTS OPUS or Publisher's site
View description>>
Color ratio gradient (CRG) is a robust method used for color image retrieval and object recognition. It has been proven to be illumination-independent and geometry-insensitive when tested on scenery images. However, the color ratio gradient produces unsa
Karol, A & Williams, M 2005, 'Distributed sensor fusion for object tracking', Robocup 2005: Robot Soccer World Cup ix, Lecture Notes in Artificial Intelligence, Robot Soccer World Cup, Springer-Verlag Berlin, Japan, pp. 504-511.
View/Download from: UTS OPUS or Publisher's site
View description>>
In a dynamic situation like robot soccer any individual player can only observe a limited portion of their environment at any given time. As such to develop strategies based upon planning and cooperation between different players it is imperative that th
Karol, A, Williams, M & Elliot, S 2006, 'The evolution of IS: Treasury decision support & management past, present & future', Past And Future Of Information Systems: 1976-2006 And Beyond, World Computer Congress, Springer, Santiago, CHILE, pp. 89-100.
View/Download from: UTS OPUS or Publisher's site
View description>>
This paper contributes to the discipline of Information Systems (IS) by illustrating the continuing evolution of IS applications to a single, core business function. Historical developments in IS and the major global treasury activity, foreign exchange t
Kazienko, P & Musial, K 2006, 'Social capital in Online social networks', KNOWLEDGE-BASED INTELLIGENT INFORMATION AND ENGINEERING SYSTEMS, PT 2, PROCEEDINGS, 10th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems, SPRINGER-VERLAG BERLIN, Bournemouth, ENGLAND, pp. 417-424.
Li, J, Li, H, Wong, L, Pei, J & Dong, G 2006, 'Minimum description length principle: Generators are preferable to closed patterns', Proceedings of the National Conference on Artificial Intelligence, pp. 409-414.
View description>>
The generators and the unique closed pattern of an equivalence class of itemsets share a common set of transactions. The generators are the minimal ones among the equivalent itemsets, while the closed pattern is the maximum one. As a generator is usually smaller than the closed pattern in cardinality, by the Minimum Description Length Principle, the generator is preferable to the closed pattern in inductive inference and classification. To efficiently discover frequent generators from a large dataset, we develop a depth-first algorithm called Gr-growth. The idea is novel in contrast to traditional breadth-first bottom-up generator-mining algorithms. Our extensive performance study shows that Gr-growth is significantly faster (an order or even two orders of magnitudes when the support thresholds are low) than the existing generator mining algorithms. It can be also faster than the state-of-the-art frequent closed itemset mining algorithms such as FPclose and CLOSET+. Copyright © 2006, American Association for Artificial Intelligence (www.aaai.org). All rights reserved.
Liu, G, Li, J, Wong, L & Hsu, W 2006, 'Positive Borders or Negative Borders: How to Make Lossless Generator Based Representations Concise', PROCEEDINGS OF THE SIXTH SIAM INTERNATIONAL CONFERENCE ON DATA MINING, 6th SIAM International Conference on Data Mining, SIAM, Bethesda, MD, pp. 469-+.
Liu, G, Sim, K & Li, J 2006, 'Efficient mining of large maximal bicliques', DATA WAREHOUSING AND KNOWLEDGE DISCOVERY, PROCEEDINGS, 8th International Conference on Data Warehousing and Knowledge Discovery (DaWaK 2006), SPRINGER-VERLAG BERLIN, Cracow, POLAND, pp. 437-448.
Lu, S, Zhang, J & Feng, D 2006, 'A knowledge-based approach for detecting unattended packages in surveillance video', Proceedings - IEEE International Conference on Video and Signal Based Surveillance 2006, AVSS 2006, IEEE International Conference on Video and Signal Based Surveillance 2006, AVSS 2006, NA, Sydney, NSW, pp. 0-0.
View/Download from: Publisher's site
View description>>
This paper describes a novel approach for detecting unattended packages in surveillance video. Unlike the traditional approach to just detecting stationary objects in monitored scenes, our approach detects unattended packages based on accumulated knowled
Luu, J & Kennedy, PJ 2006, 'Investigating the size and value effect in determining performance of Australian listed companies: a neural network approach', Proceedings of the 5th Australasian Data Mining Conference, Australian Data Mining Conference, ACS, Sydney, Australia, pp. 155-161.
View/Download from: UTS OPUS
Marychurch, J & Stoianoff, NP 2006, 'Blurring the Lines of Environmental Responsibility: How Corporate and Public Governance was Circumvented in the Ok Tedi Mining Limited Disaster', Legal Knowledge: Learning, Communicating and Doing: Australasian Law Teachers Association - ALTA 2006 Refereed Conference Papers, ALTA, Australasian Law Teachers Association, Victoria University, Melbourne, Australia, pp. 3-25.
View/Download from: UTS OPUS
View description>>
This paper will present the preliminary findings of a research project into the impact of legislative legitimation of environmental damage on corporate governance in multinational companies and on public governance in the nation state. The environmental devastation of the Ok Tedi mine in Papua New Guinea (PNG) will be the focus of the paper.
Mathew, R, Yu, Z & Zhang, J 2006, 'Detecting new stable objects in surveillance video', 2005 IEEE 7th Workshop on Multimedia Signal Processing, 2005 IEEE 7th Workshop on Multimedia Signal Processing, MMSP 2005, NA, Shanghai, pp. 0-0.
View/Download from: Publisher's site
View description>>
We describe a novel method to detect new stable objects in video. This includes detecting new objects that appear in a scene and remain stationary for a period of time. Examples include detecting a dropped bag or a parked car. Our method utilizes the sta
McCracken, J, Diaz, A, Castro, E, Edwards, R, Ryan, L, Schwartz, J, Chowdhury, Z & Smith, KR 2006, 'Biomass smoke exposure among Guatemalan infants participating in a randomized trial of chimney stoves', EPIDEMIOLOGY, pp. S35-S36.
View/Download from: Publisher's site
Ni, J & Zhang, C 2006, 'A dynamic storage method for stock transaction data', Proceedings of the 2nd International Conference on Computational Intelligence, IASTED International Conference on Computational Intelligence, ACTA Press, San Francisco, USA, pp. 338-342.
View/Download from: UTS OPUS
Ni, J & Zhang, C 2006, 'A human-friendly MAS for mining stock data', Proceedings of 2006 IEEE/ACM/WIC International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT 2006 Workshops), IEEE/WIC/ACM international Conference on Web Intelligence and Intelligent Agent Technology, IEEE Computer Society press, Hong Kong, China, pp. 19-22.
View/Download from: UTS OPUS or Publisher's site
View description>>
Mining stock data can be beneficial to the participants and researchers in the stock market. However, it is very difficult for a normal trader or researcher to apply data mining techniques to the data on his own due to the complexity involved in the whole data mining process. In this paper, we present a multi-agent system that can help users easily deal with their data mining jobs on stock data. This system guides users to specify their mining tasks by simply specifying the data sets to be mined and selecting pre-defined and/or user-added data mining agents. This approach offers normal traders a practical and flexible solution to mining stock data.
Ni, J & Zhang, C 2006, 'Mining better technical trading strategies with genetic algorithms', Proceedings of the International Workshop on Integrating AI and Data Mining, International Workshop on Integrating AI and Data Mining, IEEE Computer Society, Hobart, Australia, pp. 26-33.
View/Download from: UTS OPUS or Publisher's site
View description>>
Technical analysis is one of the two main schools of thought in the analysis of security prices. It is widely believed and applied by many professional and amateur traders. However, it is often criticized for lacking scientific rigour or worse, for lacking any basis whatsoever. We propose to explore the feasibility and/or limitation of technical analysis by the optimization of technical trading strategies over historical stock data with genetic algorithms. This paper presents the optimization problem in detail and discusses the potential problems to be tackled during the optimization. Preliminary experiments show that it can identify the limitations quickly.
Ni, J, Cao, L & Zhang, C 2006, 'Agent services-oriented architectural design of a framework for artificial stock markets', Advances in Intelligent IT: Active Media Technology 2006, International Conference on Active Media Technology, IOS Press, Brisbane, Australia, pp. 396-399.
View/Download from: UTS OPUS
Piccardi, M 2006, 'Human-focused computer vision applications', Proceedings - Computer Graphics, Imaging and Visualisation: Techniques and Applications, CGIV'06, p. 5.
View/Download from: Publisher's site
View description>>
Recent years have seen an increasing number of computer vision applications focusing on humans as their objects of interest. Such applications include video surveillance, domotics, multimedia semantic annotation and indexing, human-computer interfaces, affective computing, just to cite a few. What exactly are their "objects of interest"? A broad range of human-related features: motion, gestures, actions, interactions, activities, attitudes, behaviours, identity. This keynote will offer a survey of this field and present some current work from the speaker and his collaborators in the areas of emotion recognition and people tracking within camera networks. © 2006 IEEE.
Piccardi, M, Hintz, T, Pavlidis, I, Regazzoni, C & Xiangjiang, H 2006, 'Message from the chairs', Proceedings - IEEE International Conference on Video and Signal Based Surveillance 2006, AVSS 2006.
View/Download from: Publisher's site
Piccardi, M. & Cheng, E. 2006, 'Multi-Frame Moving object track matching based on an incremental major colour spectrum histogram matching algorithm', Proceedings 3rd Joint IEEE International workshop on Object tracking and classification in any beyond the visible spectrum (OTCBVS 06), Joint IEEE International workshop on Object tracking and clissification in any beyond the visible spectrum (OTCBVS 06), IEEE, New York, USA, pp. 1-6.
View/Download from: UTS OPUS
Qin, Z, Zhang, S & Zhang, C 2006, 'Missing or absent? A question in Cost-sensitive Decision Tree', Advances in intelligent IT, IEEE ACtive Media Technology, IOS Press, Brisbane, Australia, pp. 118-126.
View/Download from: UTS OPUS
Sidhu, AS, Dillon, TS, Hussain, FK & Chang, E 2006, 'Accomplishments and challenges of protein Ontology', Proceedings - International Computer Software and Applications Conference, pp. 71-76.
View/Download from: Publisher's site
View description>>
Recent progress in proteomics, computational biology, and ontology development has presented an opportunity to investigate protein data sources from a unique perspective that is, examining protein data sources through structure and hierarchy of Protein Ontology (PO). Various data mining algorithms and mathematical models provide methods for analyzing protein data sources; however, there are two issues that need to be addressed: (1) the need for standards for defining protein data description and exchange and (2) eliminating errors which arise with the data integration methodologies for complex queries. Protein Ontology is designed to meet these needs by providing a structured protein data specification for Protein Data Representation. Protein Ontology is a standard for representing protein data in a way that helps in defining data integration and data mining models for Protein Structure and Function. We report here our development of PO; a semantic heterogeneity framework based on relationships between PO concepts; and analysis of resultant PO Data of Human Proteins. We also talk in this paper briefly about our ongoing work of designing a trustworthy framework around PO. © 2006 IEEE.
Sim, K, Li, J, Gopalkrishnan, V & Liu, G 2006, 'Mining maximal Quasi-Bicliques to co-cluster stocks and financial ratios for value investment', ICDM 2006: SIXTH INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS, 6th IEEE International Conference on Data Mining, IEEE COMPUTER SOC, Hong Kong, PEOPLES R CHINA, pp. 1059-1063.
Stanton, CJ & Williams, M 2005, 'A novel and practical approach towards color constancy for mobile robots using overlapping color space signatures', Robocup 2005: Robot Soccer World Cup ix, Lecture Notes in Artificial Intelligence, Robot Soccer World Cup, Springer-Verlag Berlin, Osaka, Japan, pp. 444-451.
View/Download from: UTS OPUS or Publisher's site
View description>>
Color constancy is the ability to correctly perceive an object's color regardless of illumination. Within the controlled, color-coded environments in which many robots operate (such as RoboCup), engineers have been able to avoid the color constancy probl
Stoianoff, NP 2006, 'China and the Protection of Intellectual Property', China: The New Legal Scene: Opportunities and Risks, Centre for Continuing Legal Education, University of New South Wales, Kensington, New South Wales.
Stoianoff, NP 2006, 'Convergent Law, Divergent Behaviour: The Enforcement of Intellectual Property Rights in the People's Republic of China', The Development of Law in Asia: Convergence versus Divergence?, Asian Law Institute, East China University of Politics and Law, Shanghai, China, pp. 967-972.
Stoianoff, NP 2006, 'Legislation, Citizens' Rights and the Self Determination of a Developing Country: A Case Study', IUCN Academy of Environmental Law 2006 Colloquium, Implementing Environmental Legislation: The Critical Role of Enhancement and Compliance, Pace University School of Law in White Plains, New York.
Stoianoff, NP 2006, 'The Problem of Intellectual Property Enforcement in China: a cultural issue or just a stage in the making of a new Superpower?', UNSW School of Law Seminar Series, University of New South Wales.
Suglia, SF, Ryan, L, Bellinger, D & Wright, R 2006, 'The influence of the social and physical environment on child behavior', EPIDEMIOLOGY, pp. S387-S387.
View/Download from: Publisher's site
Suglia, SF, Ryan, L, Bellinger, D & Wright, RJ 2006, 'Violence exposure predicts adverse child behavior: Use of item response theory to characterize violence experience.', AMERICAN JOURNAL OF EPIDEMIOLOGY, pp. S233-S233.
Sun, J, Tao, D & Faloutsos, C 2006, 'Beyond Streams and Graphs Dynamic Tensor Analysis', Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, International Conference on Knowledge Discovery and Data Mining, ACM Press, Philadelphia PA USA, pp. 374-383.
View/Download from: UTS OPUS or Publisher's site
View description>>
How do we find patterns in author-keyword associations, evolving over time? Or in DataCubes, with product-branchcustomer sales information? Matrix decompositions, like principal component analysis (PCA) and variants, are invaluable tools for mining, dimensionality reduction, feature selection, rule identification in numerous settings like streaming data, text, graphs, social networks and many more. However, they have only two orders, like author and keyword, in the above example. We propose to envision such higher order data as tensors, and tap the vast literature on the topic. However, these methods do not necessarily scale up, let alone operate on semi-infinite streams. Thus, we introduce the dynamic ten- sor analysis (DTA) method, and its variants. DTA provides a compact summary for high-order and high-dimensional data, and it also reveals the hidden correlations. Algorithmically, we designed DTA very carefully so that it is (a) scalable, (b) space efficient (it does not need to store the past) and (c) fully automatic with no need for user defined parameters. Moreover, we propose STA, a streaming tensor analysis method, which provides a fast, streaming approximation to DTA. We implemented all our methods, and applied them in two real settings, namely, anomaly detection and multi-way latent semantic indexing. We used two real, large datasets, one on network flow data (100GB over 1 month) and one from DBLP (200MB over 25 years). Our experiments show that our methods are fast, accurate and that they find interesting patterns and outliers on the real datasets.
Tao, D, Li, X, Wu, X & Maybank, S 2006, 'Elapsed time in human gait recognition: A new approach', ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings.
View description>>
Human gait is an effective biometric source for human identification and visual surveillance; therefore human gait recognition becomes to be a hot topic in recent research. However, the elapsed time problem, which is in its infancy, still receives poor performance. In this paper, we introduce a novel discriminant analysis method to improve the performance. The new model inherits the merits from the tensor rank one analysis, which handles the small samples size problem naturally, and the linear discriminant analysis, which is optimal for classification. Although 2DLDA and DATR also benefit from these two methods, they cannot converge during the training procedure. This means they can be hardly utilized for practical applications. Based on a lot of experiments on elapsed time problem in human gait recognition, the new method is demonstrated to significantly outperform the existing appearance-based methods, such as the principle component analysis, the linear discriminant analysis, and the tensor rank one analysis. © 2006 IEEE.
Tao, D, Li, X, Wu, X & Maybank, S 2006, 'Human Carrying Status in Visual Surveillance', Proceedings 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, IEEE Computer Society Conference on Computer Vision and Pattern Recognition, IEEE Computer Society, New York, NY, USA, pp. 1670-1677.
View/Download from: UTS OPUS or Publisher's site
View description>>
A personâs gait changes when he or she is carrying an object such as a bag, suitcase or rucksack. As a result, human identification and tracking are made more difficult because the averaged gait image is too simple to represent the carrying status. Therefore, in this paper we first introduce a set of Gabor based human gait appearance models, because Gabor functions are similar to the receptive field profiles in the mammalian cortical simple cells. The very high dimensionality of the feature space makes training difficult. In order to solve this problem we propose a general tensor discriminant analysis (GTDA), which seamlessly incorporates the object (Gabor based human gait appearance model) structure information as a natural constraint. GTDA differs from the previous tensor based discriminant analysis methods in that the training converges. Existing methods fail to converge in the training stage. This makes them unsuitable for practical tasks. Experiments are carried out on the USF baseline data set to recognize a humanâs ID from the gait silhouette. The proposed Gabor gait incorporated with GTDA is demonstrated to significantly outperform the existing appearance-based methods.
Trieu, M & Williams, MA 2006, 'Grounded representation driven robot design', ACM International Conference Proceeding Series, pp. 63-72.
View/Download from: Publisher's site
View description>>
Grounding robot perceptions is an important problem in Artificial Intelligence. In this paper we show how a new grounding framework guided the development of an improved locomotion engine [3] for the AIBO. The improvements stemmed from higher quality representations that were grounded better than those in the previous system [1]. Since the AIBO is more grounded under the new locomotion engine it makes better decisions and achieves its design goals more efficiently and effectively. Furthermore, a well grounded robot offers significant software engineering benefits since its behaviours can be developed with less effort, and even more importantly they can be debugged and tested on the fly. Copyright © held by author.
Vellaisamy, K & Li, J 2006, 'Bayesian approaches to ranking sequential patterns interestingness', Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 241-250.
View description>>
One of the main issues in the rule/pattern mining is of measuring the interestingness of a pattern. The interestingness has been evaluated previously in literature using several approaches for association as well as for sequential mining. These approaches generally view a sequence as another form of association for computations and understanding. But, by doing so, a sequence might not be fully understood for its statistical significance such as dependence and applicability. This paper proposes a new framework to study sequences' interestingness. It suggests two kinds of Markov processes, namely Bayesian networks, to represent the sequential patterns. The patterns are studied for statistical dependencies in order to rank the sequential patterns interestingness. This procedure is very shown when the domain knowledge is not easily accessible. © Springer-Verlag Berlin Heidelberg 2006.
Wang, H, He, S, Wu, Q & Hintz, TB 2006, 'A new approach for Fractal Image Compression on a virtual hexagonal structure', 18Th International Conference On Pattern Recognition, Vol 3, Proceedings, International Conference on Pattern Recognition, IEEE Computer Soc, Hong Kong, China, pp. 909-912.
View/Download from: UTS OPUS or Publisher's site
View description>>
In this paper, we propose a Fractal Image Compression method on a virtual hexagonal image structure by adopting Fisher's basic method on the traditional square image structure. The modification on the definition of range block and domain block is impleme
Wang, H, He, S, Wu, Q & Hintz, TB 2006, 'Improvement of fractual image coding base on the different image', WISTSP '06 proceedings, Workshop in Information Security Theory and Practices, DSP for communication systems, Hobert, Australia, pp. 1-5.
View/Download from: UTS OPUS
Wang, H, Wu, Q, He, S & Hintz, TB 2006, 'A new approach for SA-based fractal image compression', ICIP 2006 Proceedings, IEEE International Conference on Image Processing, IEEE, Atlanta, USA, pp. 3101-3104.
View/Download from: UTS OPUS or Publisher's site
View description>>
Spiral Architecture based fractal image compression is proposed in this paper. Perceptually, a new definition of range block and domain block is presented on such enhanced image structure. Compared with the common square image architecture, spiral architecture provides higher fidelity to fractal image compression, which is demonstrated by the experimental results.
Wang, H, Wu, Q, He, S & Hintz, TB 2006, 'A novel interactive progressive decoding method for fractal image compression', Icicic 2006: First International Conference On Innovative Computing, Information And Control, Vol 3, Proceedings, International Conference on Innovative Computing, Information and Control, IEEE Computer Soc, Beijing, PEOPLES R CHINA, pp. 613-616.
View/Download from: UTS OPUS or Publisher's site
View description>>
Fractal image compression is an efficient and effective technique in image coding. This paper presents a novel interactive progressive fractal decoding method, with which the compressed file can be transmitted incrementally and reconstructed progressivel
Wang, H, Wu, Q, He, S & Hintz, TB 2006, 'Prelimenary research on fractual video compression on spiral architecture', IPCU 2006 Proceeding, International Conference on Image Processing, Computer Vision and Pattern Recognition, CSREA Press, Las Vegas, USA, pp. 557-562.
View/Download from: UTS OPUS
Wang, J & Zhang, C 2006, 'Dynamic Focus Strategies for Electronic Trade Execution in Limit Order', Proceedings Joint Conference 8th IEEE International Conference on E-Commerce and Technology (CEC 2006); 3rd IEEE International Conference on Enterprise Computing, E-Commerce and E-Services (EEE 2006), IEEE Conference on Electronic Commerce Technology, IEEE, San Francisco, California, USA, pp. 1-8.
View/Download from: UTS OPUS or Publisher's site
View description>>
Trade execution has attracted lots of attention from academia and financial industry due to its significant impact on investment return. Recently, limit order strategies for trade execution were backtested on historical order/trade data and dynamic price adjustment was proposed to respond state variables in execution. This paper emphasizes the effect of dynamic volume adjustment on limit order strategies and proposes dynamic focus (DF) strategies, which incorporate a series of market orders of different volume into the limit order strategy and dynamically adjusts their volume by monitoring state variables such as inventory and order book imbalance in real-time. The sigmoid function is suggested as the quantitative model to represent the relationship between the state variables and the volume to be adjusted. The empirical results on historical order/trade data of the Australian Stock Exchange show that the DF strategy can outperform the limit order strategy, which does not adopt dynamic volume adjustment.
Wang, J, Zhang, C, Wu, X, Qi, H & Wang, J 2003, 'SVM-OD: SVM method to detect outliers', Foundations And Novel Approaches In Data Mining, 2nd Workshop on Foundations and New Directions of Data Mining, Springer-Verlag Berlin, Melbourne, FL, pp. 129-141.
View/Download from: UTS OPUS
View description>>
Outlier detection is an important task in data mining because outliers can be either useful knowledge or noise. Many statistical methods have been applied to detect outliers, but they usually assume a given distribution of data and it is difficult to dea
Wang, JCP, ElGindy, H & Lipman, J 2006, 'On cache prefetching strategies for integrated infostation-cellular network', Proceedings - Conference on Local Computer Networks, LCN, pp. 185-192.
View/Download from: Publisher's site
View description>>
Infostations provide an inexpensive and high speed wireless disseminator that features discontinuous coverage by bounding many low cost, limited transmission range and high-bandwidth local wireless stations over an extended terrain. In this paper, we provide a system model in which several infostations are placed within the coverage area of a low bandwidth wide-area cellular network to form an Integrated Infostation-Cellular Network (HCN). In this model, the infostation continuously broadcasts data to its clients, while cellular network provides information to clients via explicit requests from clients. Based on this new model, we proposed a prefetching scheme that is capable of selectively prefetching information at client's local storage. From experimental results, the proposed model and technique show a reduction in number of requests made via expensive cellular network, thereby alleviating cost of wireless data access. Moreover, since the number of requests is reduced, the load on the cellular system is reduced. Further the cost of wireless data access is significantly reduced from both client and server perspectives. © 2006 IEEE.
Wu, Q, Zhang, H, Jia, W, He, S, Yang, J & Hintz, TB 2006, 'Car plate detection using cascaded tree-style learner based on hybrid object features', Proceedings of international conference on video and signal based surveillance 2006, Advanced Video and Signal Based Surveillance, IEEE, Sydney, Australia, pp. 1-6.
View/Download from: UTS OPUS
Xu, G, Zhang, Y & Begg, R 2006, 'Mining Gait Pattern For Clinical Locomotion Diagnosis Based On Clustering Techniques', Advanced Data Mining And Applications, Proceedings, 2nd International Conference on Advanced Data Mining and Applications, Springer-verlag Berlin, Xian, PEOPLES R CHINA, pp. 296-307.
View/Download from: UTS OPUS
View description>>
Scientific gait (walking) analysis provides valuable information about an individual's locomotion function, in turn, to assist clinical diagnosis and prevention, such as assessing treatment for patients with impaired postural control and detecting risk o
Xu, G, Zhang, Y & Zhou, X 2006, 'Discovering task-oriented usage pattern for web recommendation', Database Technologies 2006, Proceedings of the 17th Australasian Database Conference, 17th Australasian Database Conference, Australian Computer Society, Hobart, Tasmania, Australia, pp. 167-174.
View/Download from: UTS OPUS
Xu, K, Chen, X, Liu, W & Williams, M 2006, 'Legged Robot Gait Locus Generation Based on Genetic Algorithms', International Symposium on Practical Cognitive Agents and Robots (PCAR 2006) - Proceedings, International Symposium on Practical Cognitive Agents and Robots, ACM digital library, Perth, Australia, pp. 51-62.
View/Download from: UTS OPUS or Publisher's site
View description>>
Achieving an effective gait locus for legged robots is a challenging task. It is often done manually in a laborious way due to the lack of research in automatic gait locus planning. Bearing this problem in mind, this article presents a gait locus planning method using inverse kinematics while incorporating genetic algorithms. Using quadruped robots as a platform for evaluation, this method is shown to generate a good gait locus for legged robots.
Xu, RYD & Jin, JS 2006, 'Individual object interaction for camera control and multimedia synchronization', ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings.
View description>>
In recent times, most of the computer-vision assisted automatic camera control policies are based on human events, such as speaker position changes. In addition to these events, in this paper, we introduce a set of natural camera control and multimedia synchronization schemes based on individual object interaction. We present our methods in detail, including head-pose calculation and laser pointer guidance, which are used to estimate the region of interest (ROI) for both hand-held and object-at-distance. We explain, from our results, of how these set of approaches have achieved robustness, efficiency and unambiguous object interaction during real-time video shooting. © 2006 IEEE.
Zhang, C & Cao, L 2006, 'Domain-driven mining: Methodologies and applications', Advances in Intelligent IT: Active Media Technology 2006, International Conference on Active Media, IOS Press, Brisbane, Australia, pp. 13-16.
View/Download from: UTS OPUS
Zhang, C, Chen, F, Wu, X & Zhang, S 2006, 'Identifying bridging rules between conceptual clusters', International Conference on Knowledge Discovery and Data Mining, ACM International Conference on Knowledge Discovery and Data Mining, ACM Press, Philadelphia, USA, pp. 815-820.
View/Download from: UTS OPUS or Publisher's site
View description>>
A bridging rule in this paper has its antecedent and action from different conceptual clusters. We first design two algorithms for mining bridging rules between clusters in a database, and then propose two non-linear metrics for measuring the interestingness of bridging rules. Bridging rules can be distinct from association rules (or frequent itemsets). This is because (1) bridging rules can be generated by infrequent itemsets that are pruned in association rule mining; and (2) bridging rules are measured by the importance that includes the distance between two conceptual clusters, whereas frequent itemsets are measured by only the support.
Zhang, C, Qin, Y, Zhu, X, Zhang, J & Zhang, S 2006, 'Clustering-based missing value imputation for data pre-processing', Industrial Informatics, 2006 IEEE International Conference, IEEE International Conference on Industrial Informatics, IEEE, Singapore, pp. 1081-1086.
View/Download from: UTS OPUS
Zhang, C-J, Zhao, D-Z & Hao, L-Y 2006, 'An induction motor control strategy with full order speed observer', PROCEEDINGS OF THE EIGHTH IASTED INTERNATIONAL CONFERENCE ON CONTROL AND APPLICATIONS, 8th IASTED International Conference on Control and Applications, ACTA PRESS ANAHEIM, Montreal, CANADA, pp. 1-+.
Zhang, H, Jia, W, He, S & Wu, Q 2006, 'A fast algorithm for license plate detection in various conditions', Proceedings of the 2006 IEEE International Conference on System, Man and Cybernetics, IEEE Conference on Systems, Man and Cybernetics, IEEE, Taibei, China, pp. 2420-2425.
View/Download from: UTS OPUS or Publisher's site
View description>>
This paper proposes a fast algorithm detecting license plates in various conditions. There are three main contributions in this paper. The first contribution is that we define a new vertical edge map, with which the license plate detection algorithm is extremely fast. The second contribution is that we construct a cascade classifier which is composed of two kinds of classifiers. The classifiers based on statistical features decrease the complexity of the system. They are followed by the classifiers based on Haar-features, which make it possible to detect license plate in various conditions. Our algorithm is robust to the variance of the illumination, view angle, the position, size and color of the license plates when working in complex environment. The third contribution is that we experimentally analyze the relations of the scaling factor with detection rate and processing time. On the basis of the analysis, we select the optimal scaling factor in our algorithm. In the experiments, both high detection rate (with low false positive rate) and high speed are achieved when the algorithm is used to detect license plates in various complex conditions.
Zhang, H, Jia, W, He, S & Wu, Q 2006, 'Learning based license plate detection using global and local features', 18th International Conference on Pattern Recognition, International Conference on Pattern Recognition, IEEE Computer Society, Hong Kong, pp. 1102-1105.
View/Download from: UTS OPUS or Publisher's site
View description>>
This paper proposes a license plate detection algorithm using both global statistical features and local Haar-like features. Classifiers using global statistical features are constructed firstly through simple learning procedures. Using these classifiers, more than 70% of background area can be excluded from further training or detecting. Then the AdaBoost learning algorithm is used to build up the other classifiers based on selected local Haar-like features. Combining the classifiers using the global features and the local features, we obtain a cascade classifier. The classifiers based on global features decrease the complexity of the system. They are followed by the classifiers based on local Haar-like features, which makes the final classifier invariant to the brightness, color, size and position of license plates. The encouraging detection rate is achieved in the experiments
Zhang, H, Jia, W, He, S & Wu, Q 2006, 'Real-time license plate detection under various conditions', Third International Conference, International Conference on Ubiquitous and Intelligence Computing 2006 - Lecture Notes in Computer Sciences, International Conference on Ubiquitous and Intelligence Computing, Springer, Wuhan, China, pp. 192-199.
View/Download from: UTS OPUS or Publisher's site
View description>>
This paper proposes an algorithm for real-time license plate detection. In this algorithm, the relatively easy car plate features are adopted including the simple statistical feature and Harr-like feature. The simplicity of the object features used is very helpful to real-time processing. The classifiers based on statistical features decrease the complexity of the system. They are followed by the classifiers based on Haar-like features, which makes the final classifier invariant to the brightness, color, size and position of license plates. The experimental results obtained by the proposed algorithm exhibit the encouraging performance.
Zhang, S, Qin, Y, Zhu, X, Zhang, J & Zhang, C 2006, 'Kernel-based multi-imputation for missing data', Advances in intelligent IT, International Conference on Active Media, IOS Press, Brisbane, Australia, pp. 106-111.
View/Download from: UTS OPUS
Zhang, S, Qin, Y, Zhu, X, Zhang, J & Zhang, C 2006, 'Optimized parameters for missing data imputation', PRICAI 2006: 9th Pacific rim international conference on artificial intelligence, Pacific Rim International Conference on Artificial Intelligence, Springer, Guilin, China, pp. 1010-1016.
View/Download from: UTS OPUS
View description>>
To complete missing values, a solution is to use attribute correlations within data. However, it is difficult to identify such relations within data containing missing values. Accordingly, we develop a kernel-based missing data imputation method in this
Zhang, S, Yu, JX, Lu, J & Zhang, C 2006, 'Is frequency enough for decision makers to make decisions?', Advances in Knowledge Discovery and Data Mining, Pacific-Asia Conference on Knowledge Discovery and Data Mining, Springer, Singapore, pp. 499-503.
View/Download from: UTS OPUS or Publisher's site
View description>>
There are many advanced techniques that can efficiently mine frequent itemsets using a minimum support. However, the question that remains unanswered is whether the minimum support can really help decision makers to make decisions. In this paper, we stud
Zhao, Y, Cao, L, Morrow, YK, Ou, Y, Ni, J & Zhang, C 2006, 'Discovering debtor patterns of Centrelink customers', Data mining 2006; Proceedings of AusDM 2006, Australian Data Mining Conference, ACS Inc, Sydney, Australia, pp. 135-144.
View/Download from: UTS OPUS
Zhao, Y, Zhang, C & Zhang, S 2006, 'Efficient frequent itemsets mining by sampling', Advances in Intelligent IT: Active Media Technology 2006, International Conference on Active Media Technology, IOS Press, Brisbane, Australia, pp. 112-117.
View/Download from: UTS OPUS
Zhao, Y, Zhang, C & Zhang, S 2006, 'Enhancing DWT for recent-biased dimension reduction of time', AI 2006: Advances in Artificial Intelligence, Australasian Joint Conference on Artificial Intelligence, Springer, Hobart, Australia, pp. 1048-1053.
View/Download from: UTS OPUS or Publisher's site
View description>>
In many applications, old data in time series become less important as time elapses, which is a big challenge to traditional techniques for dimension reduction. To improve Discrete Wavelet Transform (DWT) for effective dimension reduction in this kind of applications, a new method, largest-latest-DWT, is designed by keeping the largest k coefficients out of the latest w coefficients at each level of DWT transform. Its efficiency and effectiveness is demonstrated by our experiments.
Zhao, Y, Zhang, C, Zhang, S & Zhao, L 2006, 'Adapting K-Means Algorithm for Discovering Clusters in Subspaces', Frontiers of WWW Research and Development - APWb 2006, Asia Pacific Web Conference, Springer, Habin, China, pp. 53-62.
View/Download from: UTS OPUS
Zheng, L & He, S 2006, 'Number plater recognition based on SVMs', Proceeding of the IEEE international conference on advanced video and signal based surveillance 2006, Advanced Video and Signal Based Surveillance, IEEE, Sydney, Australia, pp. 1-5.
View/Download from: UTS OPUS or Publisher's site
Zheng, L, He, S, Wu, Q & Hintz, TB 2006, 'Learning based number recognition on spiral architecture', Proceedings of 2006 9th international conference on control, automation, robotics and vision, International Conference on Control, Automation, Robotics and Vision, IEEE, Grand Hyatt, Singapore, pp. 897-901.
View/Download from: UTS OPUS or Publisher's site
View description>>
In this paper, a number recognition algorithm is proposed on spiral architecture, a hexagonal image structure. This algorithm employs RULES-3 inductive learning method to recognize numbers. The algorithm starts from a collection of samples of numbers from number plates. Edge maps of the samples are then detected based on spiral architecture. A set of rules are extracted using these samples by RULES-3. The rules describe the frequencies of 9 different edge masks appearing in the samples. Each mask is a cluster of 7 hexagonal pixels. In order to recognize a number plate, all numbers are tested one by one using the extracted rules. The number recognition is achieved by counting the frequencies of the 9 masks. In this paper, a comparison between results based on rectangular structure and the results based on spiral architecture is given. From the experimental results, we can make the conclusion that Spiral Architecture is better than rectangular structure for inductive learning-based number recognition