Fast content-based file type identification

Digital forensic examiners often need to identify the type of a file or file fragment based only on the content of the file. Content-based file type identification schemes typically use a byte frequency distribution with statistical machine learning to classify file types. Most algorithms analyze the entire file content to obtain the byte frequency distribution, a technique that is inefficient and time consuming. This paper proposes two techniques for reducing the classification time. The first technique selects a subset of features based on the frequency of occurrence. The second speeds classification by sampling several blocks from the file. Experimental results demonstrate that up to a fifteen-fold reduction in file size analysis time can be achieved with limited impact on accuracy.

What the experts think : fast bowling expertise acquisition and talent development

For applied sport scientists charged with developing talented performers an essential requirement is to identify components contributing to the development and maintenance of expertise. Previous qualitative analysis has revealed several psychological (e.g., mental focus, goal-setting and selfevaluation), socio-cultural (e.g. community and family support, cultural influence), physical (e.g., strength, height) and environmental (e.g., access to facilities and climate) constraints on successful Olympian development (Abbott et al., 2005). Open-ended interviews with expert athletes and/or expert coaches have been used to reveal competencies of elite performers to derive factors associated with success (Durand-Bush et al., 2002). However, the influence of these factors is likely to be sport-specific due to different task constraints and the changing nature of the performer-environment relationship through practice, coaching and competing (Vaeyens et al., 2008). So far, only one study on expertise acquisition in cricket has been undertaken. Weissensteiner, et al. (2009) found that development of expertise in cricket batting in Australia may be facilitated by early unstructured play (i.e. ‘backyard cricket’), a wide range of sport experience during development, and early exposure to playing with seniors.

Quantifying variability within technique and performance in elite fast bowlers : is technical variability dysfunctional or functional?

In fast bowling, cricketers are expected to produce a range of delivery lines and lengths while maximising ball speed. From a coaching perspective, technique consistency has been typically associated with superior performance in these areas. However, although bowlers are required to bowl consistently, at the elite level they must also be able to vary line, length and speed to adapt to opposition batters’ strengths and weaknesses. The relationship between technique and performance variability (and consistency) has not been investigated in previous fast bowling research. Consequently, the aim of this study was to quantify both technique (bowling action and coordination) and performance variability in elite fast bowlers from Australian Junior and National Pace Squads. Technique variability was analysed to investigate whether it could be classified as functional or dysfunctional in relation to speed and accuracy.

Fast rates for estimation error and oracle inequalities for model section

We consider complexity penalization methods for model selection. These methods aim to choose a model to optimally trade off estimation and approximation errors by minimizing the sum of an empirical risk term and a complexity penalty. It is well known that if we use a bound on the maximal deviation between empirical and true risks as a complexity penalty, then the risk of our choice is no more than the approximation error plus twice the complexity penalty. There are many cases, however, where complexity penalties like this give loose upper bounds on the estimation error. In particular, if we choose a function from a suitably simple convex function class with a strictly convex loss function, then the estimation error (the difference between the risk of the empirical risk minimizer and the minimal risk in the class) approaches zero at a faster rate than the maximal deviation between empirical and true risks. In this paper, we address the question of whether it is possible to design a complexity penalized model selection method for these situations. We show that, provided the sequence of models is ordered by inclusion, in these cases we can use tight upper bounds on estimation error as a complexity penalty. Surprisingly, this is the case even in situations when the difference between the empirical risk and true risk (and indeed the error of any estimate of the approximation error) decreases much more slowly than the complexity penalty. We give an oracle inequality showing that the resulting model selection method chooses a function with risk no more than the approximation error plus a constant times the complexity penalty.

The Kinaesthetic Fusion Effect : fast-forward 30 years

This study investigated the Kinaesthetic Fusion Effect (KFE) first described by Craske and Kenny in 1981. The current study did not replicate these findings following a change in the reporting method used by participants. Participants did not perceive any reduction in the sagittal separation of a button pressed by the index finger of one arm and a probe touching the other, following repeated exposure to the tactile stimuli present on both unseen arms. This study’s failure to replicate the widely-cited KFE as described by Craske et al. (1984) suggests that it may be contingent on several aspects of visual information, especially the availability of a specific visual reference, the role of instructions regarding gaze direction, and the potential use of a line of sight strategy when referring felt positions to an interposed surface. In addition, a foreshortening effect was found; this may result from a line-of-sight judgment and represent a feature of the reporting method used. Finally, this research will benefit future studies that require participants to report the perceived locations of the unseen limbs.

A multidisciplinary examination of fast bowling talent development in cricket

Research on expertise, talent identification and development has tended to be mono-disciplinary, typically adopting geno-centric or environmentalist positions, with an overriding focus on operational issues. In this thesis, the validity of dualist positions on sport expertise is evaluated. It is argued that, to advance understanding of expertise and talent development, a shift towards a multidisciplinary and integrative science focus is necessary, along with the development of a comprehensive multidisciplinary theoretical rationale. Dynamical systems theory is utilised as a multidisciplinary theoretical rationale for the succession of studies, capturing how multiple interacting constraints can shape the development of expert performers. Phase I of the research examines experiential knowledge of coaches and players on the development of fast bowling talent utilising qualitative research methodology. It provides insights into the developmental histories of expert fast bowlers, as well as coaching philosophies on the constraints of fast bowling expertise. Results suggest talent development programmes should eschew the notion of common optimal performance models and emphasize the individual nature of pathways to expertise. Coaching and talent development programmes should identify the range of interacting constraints that impinge on the performance potential of individual athletes, rather than evaluating current performance on physical tests referenced to group norms. Phase II of this research comprises three further studies that investigate several of the key components identified as important for fast bowling expertise, talent identification and development extrapolated from Phase I of this research. This multidisciplinary programme of work involves a comprehensive analysis of fast bowling performance in a cross-section of the Cricket Australia high performance pathways, from the junior, emerging and national elite fast bowling squads. Briefly, differences were found in trunk kinematics associated with the generation of ball speed across the three groups. These differences in release mechanics indicated the functional adaptations in movement patterns as bowlers’ physical and anatomical characteristics changed during maturation. Second to the generation of ball speed, the ability to produce a range of delivery types was highlighted as a key component of expertise in the qualitative phase. The ability of athletes to produce consistent results on different surfaces and in different environments has drawn attention to the challenge of measuring consistency and flexibility in skill assessments. Examination of fast bowlers in Phase II demonstrated that national bowlers can make adjustments to the accuracy of subsequent deliveries during performance of a cricket bowling skills test, and perform a range of delivery types with increased accuracy and consistency. Finally, variability in selected delivery stride ground reaction force components in fast bowling revealed the degenerate nature of this complex multi-articular skill where the same performance outcome can be achieved with unique movement strategies. Utilising qualitative and quantitative methodologies to examine fast bowling expertise, the importance of degeneracy and adaptability in fast bowling has been highlighted alongside learning design that promotes dynamic learning environments.

Fast and effective focused retrieval

Building an efficient and an effective search engine is a very challenging task. In this paper, we present the efficiency and effectiveness of our search engine at the INEX 2009 Efficiency and Ad Hoc Tracks. We have developed a simple and effective pruning method for fast query evaluation, and used a two-step process for Ad Hoc retrieval. The overall results from both tracks show that our search engine performs very competitively in terms of both efficiency and effectiveness.

A fast tabu search algorithm for the group shop scheduling problem

Three types of shop scheduling problems, the flow shop, the job shop and the open shop scheduling problems, have been widely studied in the literature. However, very few articles address the group shop scheduling problem introduced in 1997, which is a general formulation that covers the three above mentioned shop scheduling problems and the mixed shop scheduling problem. In this paper, we apply tabu search to the group shop scheduling problem and evaluate the performance of the algorithm on a set of benchmark problems. The computational results show that our tabu search algorithm is typically more efficient and faster than the other methods proposed in the literature. Furthermore, the proposed tabu search method has found some new best solutions of the benchmark instances.

Measuring bitrate and quality trade-off in a fast region-of-interest based video coding

Prevailing video adaptation solutions change the quality of the video uniformly throughout the whole frame in the bitrate adjustment process; while region-of-interest (ROI)-based solutions selectively retains the quality in the areas of the frame where the viewers are more likely to pay more attention to. ROI-based coding can improve perceptual quality and viewer satisfaction while trading off some bandwidth. However, there has been no comprehensive study to measure the bitrate vs. perceptual quality trade-off so far. The paper proposes an ROI detection scheme for videos, which is characterized with low computational complexity and robustness, and measures the bitrate vs. quality trade-off for ROI-based encoding using a state-of-the-art H.264/AVC encoder to justify the viability of this type of encoding method. The results from the subjective quality test reveal that ROI-based encoding achieves a significant perceptual quality improvement over the encoding with uniform quality at the cost of slightly more bits. Based on the bitrate measurements and subjective quality assessments, the bitrate and the perceptual quality estimation models for non-scalable ROI-based video coding (AVC) are developed, which are found to be similar to the models for scalable video coding (SVC).

Fast detection of exact clones in business process model repositories

As organizations reach higher levels of business process management maturity, they often find themselves maintaining very large process model repositories, representing valuable knowledge about their operations. A common practice within these repositories is to create new process models, or extend existing ones, by copying and merging fragments from other models. We contend that if these duplicate fragments, a.k.a. ex- act clones, can be identified and factored out as shared subprocesses, the repository’s maintainability can be greatly improved. With this purpose in mind, we propose an indexing structure to support fast detection of clones in process model repositories. Moreover, we show how this index can be used to efficiently query a process model repository for fragments. This index, called RPSDAG, is based on a novel combination of a method for process model decomposition (namely the Refined Process Structure Tree), with established graph canonization and string matching techniques. We evaluated the RPSDAG with large process model repositories from industrial practice. The experiments show that a significant number of non-trivial clones can be efficiently found in such repositories, and that fragment queries can be handled efficiently.