2382274
Synthesising Timbres and Timbre-Changes from Adjectives/Adverbs
Synthesising timbres and changes to timbres from natural language descriptions is an interesting challenge for computer music. This paper describes the current state of an ongoing project which takes a machine learning approach to this problem. We discuss the challenges that are presented by this, discuss various strategies for tackling this problem, and explain some experimental work. In particular our approach is focused on the creation of a system that uses an analysis-synthesis cycle to learn and then produce such timbre changes.
2495230
Timbre interfaces using adjectives and adverbs
How can we provide interfaces to synthesis algorithms that will allow us to manipulate timbre directly, using the same timbre-words that are used by human musicians to communicate about timbre? This paper describes ongoing work that uses machine learning methods (principally genetic algorithms and neural networks) to learn (1) to recognise timbral characteristics of sound and (2) to adjust timbral characteristics of existing synthesized sounds.
15050037
Journeys in non-classical computation I: A grand challenge for computing research
1. The challengeA gateway event [35] is a change to a system that leads to the possibility of huge increases inkinds and levels of complexity. It opens up a whole new kind of phase space to the system’sdynamics.Gatewayeventsduringevolutionoflifeonearthincludetheappearanceofeukaryotes(organisms with a cell nucleus), an oxygen atmosphere, multi-cellular organisms and grass.Gatewayeventsduringthedevelopmentofmathematicsincludeeachinventionofanewclassofnumbers (negative, irrational, imaginary, ...), and dropping Euclid’s parallel postulate.A gateway event produces a profound and fundamental change to the system: Oncethrough the gateway, life is never the same again. We are currently poised on the threshold ofa signiﬁcant gateway event in computation: That of breaking free from many of our current“classical computational” assumptions. Our Grand Challenge for computer science isto journey through the gateway event obtained by breaking our current classicalcomputational assumptions, and thereby develop a mature science of Non-ClassicalComputation2. Journeys versus goals
16043224
Journeys in non-classical computation II: initial journeys and waypoints
†University of York, Heslington, York YO1 5DD, UK‡University of the West of England, Frenchay Campus, Coldharbourlane, Bristol BS16 1QY, UK{University of Portsmouth, Buckingham Building, Lion Terrace, Portsmouth PO1 3WE, UK§University of Kent, Canterbury, Kent CT2 7NZ, UKkUniversity of Cambridge, Madingley Road, Cambridge CB3 OHE, UK#University of Exeter, North Cote House, The Queen’s Drive, Exeter E4 4QJ, UK
8792186
Artificial Immune Systems and the Grand Challenge for Non-classical Computation
The UK Grand Challenges for Computing Research is an initiative to map out certain key areas that could be used to help drive research over the next 10–15 years. One of the identified Grand Challenges is Non-Classical Computation, which examines many of the fundamental assumptions of Computer Science, and asks what would result if they were systematically broken. In this discussion paper, we explain how the sub-discipline of Artificial Immune Systems sits squarely in the province of this particular Grand Challenge, and we identify certain key questions.
17446260
Genetic Programming with Fitness Based on Model Checking
Model checking is a way of analysing programs and program-like structures to decide whether they satisfy a list of temporal logic statements describing desired behaviour. In this paper we apply this to the fitness checking stage in an evolution strategy for learning finite state machines. We give experimental results consisting of learning the control program for a vending machine.
9129216
A formal and structured approach to the use of task analysis in accident modelling
Recent work (Telford & Johnson, 1996; Johnson, 1997), involving the application of formal notations to analyse accident reports has shown that the quality of these accident reports is poor, so much so that their conclusions can be misleading. The proposed solution has been to use formal notations in combination with traditional analysis to produce a report, the conclusions of which can be verified by formal reasoning. However, there are weaknesses with the formal notations used up until now. Firstly, they have not allowed the representation of all aspects of an accident or incident. For example, human factors have either not been represented or not clearly delineated from system factors. In particular, there has not been an attempt to provide a task analysis of the incident. Secondly, the notations used do not easily facilitate the system engineering concepts of modularity, encapsulation or scalability. In consequence, it is difficult to model different aspects of an accident, compose these different aspects to build up the model or make changes to parts of the model without affecting the rest of the model. The purpose of this paper is to demonstrate how a formal object-oriented specification language can be used to provide the benefits offered by an engineering approach and in particular, by using this approach, how a task analysis model can be constructed. The task analysis incorporates Hollnagel's (1993) classification of erroneous actions, so that scenarios, deriving from human error, can be reasoned about. An air accident investigation report, issued by the UK Civil Aviation Authority, is used as a case study.
14968728
Using Temporal Logic to Support the Specification and Prototyping of Interactive Control Systems
Abstract Accidents at Flixborough, Seveso, Bhopal, Three Mile Island, Windscale and Chernobyl have led to increasing concern over the safety and reliability of control systems. Human factors specialists have responded to this concern and have proposed a number of techniques which support the operator of such applications. Unfortunately, this work has not been accompanied by the provision of adequate tools which might enable a designer to carry it beyond the “laboratory bench” and on to the “shop floor”. The following paper exploits formal, mathematically based specification techniques to provide such a tool. Previous weaknesses of abstract specifications are identified and resolved. In particular, they have failed to capture the temporal properties which human factors specialists identify as crucial to the success or failure of interactive control systems. They also provide the non-formalist with an extremely poor impression of what it would be to like to interact with potential implementations. Temporal logic avoids these deficiencies. It can make explicit the sequential information which may be implicit within a design. Executable subsets of this formalization support prototyping and this provides a means of assessing the qualitative “look and feel” of potential implementations. A variety of presentation strategies, including structural decomposition and dialogue cycles, have been specified and incorporated directly into prototypes using temporal logic. Prelog, a tool for the Presentation and REndering of LOGic specifications, has been developed and its implementation is described.
846602
Incident and Accident Investigation Techniques to Inform Model-Based Design of Safety-Critical Interactive Systems
The quality of the design of an interactive safety-critical system can be enhanced by embedding data and knowledge from past experiences. Traditionally, this involves applying scenarios, usability analysis, or the use of metrics for risk analysis. In this paper, we present an approach that uses the information from incident investigations to inform the development of safety-cases that can, in turn, be used to inform a formal system model, represented using Petri nets and the ICO formalism. The foundations of the approach are first detailed and then exemplified using a fatal mining accident case study.
40520811
A note on cospectral graphs
Abstract The notion of a (1, x ) adjacency matrix is introduced, together with methods for dealing with it. It is shown that in many instances this adjacency matrix is superior to the usual (0, 1) adjacency matrix, and will distinguish cospectral pairs, when the latter will not. In those cases in which the (1, x ) adjacency matrix fares no better than the (0, 1) adjacency matrix, a good deal can be said about the matrices by which the cospectral pairs are similar.
10157262
Topology-Preserving Smoothing of Vector Fields
Proposes a technique for topology-preserving smoothing of sampled vector fields. The vector field data is first converted into a scalar representation in which time surfaces implicitly exist as level sets. We then locally analyze the dynamic behavior of the level sets by placing geometric primitives in the scalar field and by subsequently distorting these primitives with respect to local variations in this field. From the distorted primitives, we calculate the curvature normal and we use the normal magnitude and its direction to separate distinct flow features. Geometrical and topological considerations are then combined to successively smooth dense flow fields, at the same time retaining their topological structure.