Finding coverage using incremental attribute combinations

Coverage is the range that covers only positive samples in attribute (or feature) space. Finding coverage is the kernel problem in induction algorithms because of the fact that coverage can be used as rules to describe positive samples. To reflect the characteristic of training samples, it is desirable that the large coverage that cover more positive samples. However, it is difficult to find large coverage, because the attribute space is usually very high dimensionality. Many heuristic methods such as ID3, AQ and CN2 have been proposed to find large coverage. A robust algorithm also has been proposed to find the largest coverage, but the complexities of time and space are costly when the dimensionality becomes high. To overcome this drawback, this paper proposes an algorithm that adopts incremental feature combinations to effectively find the largest coverage. In this algorithm, the irrelevant coverage can be pruned away at early stages because potentially large coverage can be found earlier. Experiments show that the space and time needed to find the largest coverage has been significantly reduced.

Situating situatedness through Æffect and the architectural body of Arakawa and Gins

This paper explores the situated body by briefly surveying the historical studies of effect and of affect which converge in current work on attention. This common approach to the situated body through attention prompted the coining of a more inclusive term, Æffect, to indicate the situated body’s mode of observation. Examples from the work of artist-turned-architects, Arakawa and Gins, will be discussed to show how architectural environments can act as heuristic tools that allow the situated body to research its own conditions. Rather than isolating effect from affect, observer from subject, organism from environment, Arakawa and Gins’ work optimises the use of situated complexity in the study of the site of person. By constructing surrounding in which to observe and learn about the shape of awareness, their procedural architecture suggests ways in which the interaction of top-down conceptual knowledge and bottom-up perceptual learning may construct possibilities in emergent rather than programmatic ways.

Unleashing the vermin : vectored route-length minimization

We have posed a simple but interesting graph theoretic problem and posited a heuristic solution procedure, which we have christened as Vectored Route-length Minimization (VeRMin). Basically, it constitutes a re-casting of the classical “shortest route” problem in a strictly Euclidean space. We have presented only a heuristic solution process hoping that a formal proof will eventually emerge as the problem receives wider exposure within mathematical circles.

Law and theology in Gilbert of Foliot's (c. 1105/10-1187/88) correspondence

Lord Peter Stein, eminent historian of Roman law, described the interaction of law and theology in the writings of one twelfth-century writer as a kind of 'universal jurisprudence' , The twelfth-century figure to whom he referred was Master Vacarius (c. 1115/2O-c. 1200), well-known English Roman lawyer and Anglo-Norman canonist. While Stein drew this conclusion largely on the basis of an analysis of Vacatius' strictly 'legal' work, the Liber pauperum, I have shown elsewhere, following a systematic study ofVacarius' other works, dealing with maniage, christology and heresy, that, when seen together, they demonstrate a use of law as a universal heuristic device to resolve conflict in law and theology.

Comparison theory in economic psychology regarding the easterlin paradox and decreasing marginal utility : a critique

This paper challenges the assumption within Economics that the relationship between money and subjective wellbeing is determined by processes of cognitive comparison. An alternative explanation for such well known phenomena as the Easterlin Paradox and Decreasing Marginal Utility are provided through a consideration of affect. The theoretical basis for such explanations relies on theory from Psychology usually overlooked by Economists, such as affect heuristics and Subjective Wellbeing Homeostasis. The presented evidence for this alternative source of explanation melds psychological theory with empirical data. It is concluded that affective processes offer a coherent alternative explanation for the phenomena under discussion.

Integrated modelling of cost-effective siting and operation of flow-control infrastructure for river ecosystem conservation

Wetland and floodplain ecosystems along many regulated rivers are highly stressed, primarily due to a lack of environmental flows of appropriate magnitude, frequency, duration, and timing to support ecological functions. In the absence of increased environmental flows, the ecological health of river ecosystems can be enhanced by the operation of existing and new flow-control infrastructure (weirs and regulators) to return more natural environmental flow regimes to specific areas. However, determining the optimal investment and operation strategies over time is a complex task due to several factors including the multiple environmental values attached to wetlands, spatial and temporal heterogeneity and dependencies, nonlinearity, and time-dependent decisions. This makes for a very large number of decision variables over a long planning horizon. The focus of this paper is the development of a nonlinear integer programming model that accommodates these complexities. The mathematical objective aims to return the natural flow regime of key components of river ecosystems in terms of flood timing, flood duration, and interflood period. We applied a 2-stage recursive heuristic using tabu search to solve the model and tested it on the entire South Australian River Murray floodplain. We conclude that modern meta-heuristics can be used to solve the very complex nonlinear problems with spatial and temporal dependencies typical of environmental flow allocation in regulated river ecosystems. The model has been used to inform the investment in, and operation of, flow-control infrastructure in the South Australian River Murray.

Multicast lifetime maximization using network coding in lossy wireless ad-hoc networks

In traditional stop-and-wait strategy for reliable communications, such as ARQ, retransmission for the packet loss problem would incur a great number of packet transmissions in lossy wireless ad-hoc networks. We study the reliable multicast lifetime maximization problem by alternatively exploring the random linear network coding in this paper. We formulate such problem as a min-max problem and propose a heuristic algorithm, called maximum lifetime tree (MLT), to build a multicast tree that maximizes the network lifetime. Simulation results show that the proposed algorithms can significantly increase the network lifetime when compared with the traditional algorithms under various distributions of error probability on lossy wireless links.

Unicast and broadcast throughput maximization in amplify-and-forward relay networks

Cooperative communication (CC) offers an efficient and low-cost way to achieve spatial diversity by forming a virtual antenna array among single-antenna nodes that cooperatively share their antennas. It has been well recognized that the selection of relay nodes plays a critical role in the performance of CC. Most existing relay selection strategies focus on optimizing the outage probability or energy consumption. To fill in the vacancy of research on throughput improvement via CC, we study the relay selection problem with the objective of optimizing the throughput in this paper. For unicast, it is a P problem, and an optimal relay selection algorithm is provided with a correctness proof. For broadcast, we show the challenge of relay selection by proving it nonprobabilistic hard (NP-hard). A greedy heuristic algorithm is proposed to effectively choose a set of relay nodes that maximize the broadcast throughput. Simulation results show that the proposed algorithms can achieve high throughput under various network settings.

Upgrading arc median shortest path problem for an urban transportation network

In this paper, we propose an algorithm for an upgrading arc median shortest path problem for a transportation network. The problem is to identify a set of nondominated paths that minimizes both upgrading cost and overall travel time of the entire network. These two objectives are realistic for transportation network problems, but of a conflicting and noncompensatory nature. In addition, unlike upgrading cost which is the sum of the arc costs on the path, overall travel time of the entire network cannot be expressed as a sum of arc travel times on the path. The proposed solution approach to the problem is based on heuristic labeling and exhaustive search techniques, in criteria space and solution space, respectively. The first approach labels each node in terms of upgrading cost, and deletes cyclic and infeasible paths in criteria space. The latter calculates the overall travel time of the entire network for each feasible path, deletes dominated paths on the basis of the objective vector and identifies a set of Pareto optimal paths in the solution space. The computational study, using two small-scale transportation networks, has demonstrated that the algorithm proposed herein is able to efficiently identify a set of nondominated median shortest paths, based on two conflicting and noncompensatory objectives.

Fusion of GRNN and FA for online noisy data regression

A new online neural-network-based regression model for noisy data is proposed in this paper. It is a hybrid system combining the Fuzzy ART (FA) and General Regression Neural Network (GRNN) models. Both the FA and GRNN models are fast incremental learning systems. The proposed hybrid model, denoted as GRNNFA-online, retains the online learning properties of both models. The kernel centers of the GRNN are obtained by compressing the training samples using the FA model. The width of each kernel is then estimated by the K-nearest-neighbors (kNN) method. A heuristic is proposed to tune the value of Kof the kNN dynamically based on the concept of gradient-descent. The performance of the GRNNFA-online model was evaluated using two benchmark datasets, i.e., OZONE and Friedman#1. The experimental results demonstrated the convergence of the prediction errors. Bootstrapping was employed to assess the performance statistically. The final prediction errors are analyzed and compared with those from other systems.Bootstrapping was employed to assess the performance statistically. The final prediction errors are analyzed and compared with those from other systems.

Death

While death is a central topic from Kierkegaard's earliest journals to the last writings leading up to his 'martyrdom,' he treats death as essentially mysterious. In the Concluding Unscientific Postscript, Johannes Climacus insists that he has not understood death, while the discourse "At a Graveside" speaks of death as "undefinable" and a "riddle." Kierkegaard is also particularly averse to discussing the nature of the afterlife, leading some to claim he views the afterlife merely as a heuristic device for teaching the living to live well. However, Kierkegaard rejects neither the Christian doctrine of resurrection nor the notion of posthumous survival more broadly; rather, the essential moral meaning of death for the living has the interesting effect of making many ways of talking about death morally illegitimate

Cumulative morbidity and prognostic staging of illness in the systematic treatment enhancement program for Bipolar Disorder (STEP-BD)

Objective: Staging models may provide heuristic utility for intervention selection in psychiatry. Although a few proposals have been put forth, there is a need for empirical validation if they are to be adopted. Using data from the Systematic Treatment Enhancement Program for Bipolar Disorder (STEP-BD), we tested a previously elaborated hypothesis on the utility of using the number of previous episodes as a relevant prognostic variable for staging in bipolar disorder.

Methods: This report utilizes data from the multisite, prospective, open-label study ‘Standard Care Pathways’ and the subset of patients with acute depressive episodes who participated in the randomized trial of adjunctive antidepressant treatment. Outpatients meeting DSM-IV diagnostic criteria for bipolar disorder (n = 3345) were included. For the randomized pathway, patients met criteria for an acute depressive episode (n = 376). The number of previous episodes was categorized as less than 5, 5–10 and more than 10. We used disability at baseline, number of days well in the first year and longitudinal scores of depressive and manic symptoms, quality of life and functioning as validators of models constructed a priori.

Results: Patients with multiple previous episodes had consistently poorer cross-sectional and prospective outcomes. Functioning and quality of life were worse, disability more common, and symptoms more chronic and severe. There was no significant effect for staging with regard to antidepressant response in the randomized trial.

Conclusions: These findings confirm that bipolar disorder can be staged with prognostic validity. Stages can be used to stratify subjects in clinical trials and develop specific treatments.

An algorithm to median shortest path problem (MSPP) in the design of urban transportation networks

This paper proposes an efficient solution algorithm for realistic multi-objective median shortest path problems in the design of urban transportation networks. The proposed problem formulation and solution algorithm to median shortest path problem is based on three realistic objectives via route cost or investment cost, overall travel time of the entire network and total toll revenue. The proposed solution approach to the problem is based on the heuristic labeling and exhaustive search technique in criteria space and solution space of the algorithm respectively. The first labels each node in terms of route cost and deletes cyclic and infeasible paths in criteria space imposing cyclic break and route cost constraint respectively. The latter deletes dominated paths in terms of objectives vector in solution space in order to identify a set of Pareto optimal paths. The approach, thus, proposes a non-inferior solution set of Pareto optimal paths based on non-dominated objective vector and leaves the ultimate decision to decision-makers for purpose specific final decision during applications. A numerical experiment is conducted to test the proposed algorithm using artificial transportation network. Sensitivity analyses have shown that the proposed algorithm is advantageous and efficient over existing algorithms to find a set of Pareto optimal paths to median shortest paths problems.

Turning the spotlight to international students’ internal negotiations: critical thinking in academic writing

The case study reported in this chapter explores how four Chinese and Vietnamese international students from two disciplines, Economics and Education, mediated their ways of displaying critical thinking in disciplinary writing at an Australian university. It draws on a modified version of Lillis’s (2001) heuristic and positioning theory (Harre´ & van Langenhove, 1999) for the interpretation of students’ writing practices within an institutional context. The study includes four talks around texts, which engage the students in an exploration of their practices in demonstrating their critical thinking in their first texts at the university, and four in-depth interviews six months later, which aim to examine how students negotiated their writing practices as they progressed through their course.

Committed, face‐value, hybrid or mutual adaptation? The experiences of international students in Australian higher education

This paper explores the adaptation patterns of international Chinese and Vietnamese students in relation to academic writing practices in a higher education context. The study utilises a trans‐disciplinary framework for interpreting students’ and lecturers’ practices within institutional structures. This framework has been developed by infusing a modified version of Lillis’ heuristic for exploring students’ meaning making with positioning theory.

A prominent finding of the study indicates the emergence of three main forms of adaptation, committed adaptation, face‐value adaptation and hybrid adaptation, that the students employed to gain access to their disciplinary practices. The findings of the study give insights into ways that a dialogical pedagogic model for mutual adaptation can be developed between international students and academics. The aim is to enhance the education of international students in this increasingly internationalised environment.