987 resultados para sound processing
Resumo:
In this paper three problems related to the analysis of facial images are addressed: the illuminant direction, the compensation of illumination effects and, finally, the recovery of the pose of the face, restricted to in-depth rotations. The solutions proposed for these problems rely on the use of computer graphics techniques to provide images of faces under different illumination and pose, starting from a database of frontal views under frontal illumination.
Resumo:
This report describes Processor Coupling, a mechanism for controlling multiple ALUs on a single integrated circuit to exploit both instruction-level and inter-thread parallelism. A compiler statically schedules individual threads to discover available intra-thread instruction-level parallelism. The runtime scheduling mechanism interleaves threads, exploiting inter-thread parallelism to maintain high ALU utilization. ALUs are assigned to threads on a cycle byscycle basis, and several threads can be active concurrently. Simulation results show that Processor Coupling performs well both on single threaded and multi-threaded applications. The experiments address the effects of memory latencies, function unit latencies, and communication bandwidth between function units.
Resumo:
A cellular automaton is an iterative array of very simple identical information processing machines called cells. Each cell can communicate with neighboring cells. At discrete moments of time the cells can change from one state to another as a function of the states of the cell and its neighbors. Thus on a global basis, the collection of cells is characterized by some type of behavior. The goal of this investigation was to determine just how simple the individual cells could be while the global behavior achieved some specified criterion of complexity ??ually the ability to perform a computation or to reproduce some pattern. The chief result described in this thesis is that an array of identical square cells (in two dimensions), each cell of which communicates directly with only its four nearest edge neighbors and each of which can exist in only two states, can perform any computation. This computation proceeds in a straight forward way. A configuration is a specification of the states of all the cells in some area of the iterative array. Another result described in this thesis is the existence of a self-reproducing configuration in an array of four-state cells, a reduction of four states from the previously known eight-state case. The technique of information processing in cellular arrays involves the synthesis of some basic components. Then the desired behaviors are obtained by the interconnection of these components. A chapter on components describes some sets of basic components. Possible applications of the results of this investigation, descriptions of some interesting phenomena (for vanishingly small cells), and suggestions for further study are given later.
Resumo:
Cox, S.J., Bradley, G. and Weaire, D. (2001) Metallic foam processing from the liquid state: the competition between solidification and drainage. Eur. Phys. J. AP 14:87-97. Sponsorship: This research was supported by the Prodex programme of ESA, and is a contribution to ESA contract C14308/AO-075-99. SJC was supported by Enterprise Ireland and a Marie Curie fellowship. GB was supported by the HPC Programme of TCD.
Resumo:
IEEE Transactions on Knowledge and Data Engineering, vol. 15, no. 5, pp. 1338-1343, 2003.
Resumo:
Huelse, M, Barr, D R W, Dudek, P: Cellular Automata and non-static image processing for embodied robot systems on a massively parallel processor array. In: Adamatzky, A et al. (eds) AUTOMATA 2008, Theory and Applications of Cellular Automata. Luniver Press, 2008, pp. 504-510. Sponsorship: EPSRC
Resumo:
The problem of the acquisition of first language phonology is dealt with within the general information-processing perspective. In this sense, language acquisition is viewed as a process of biologically founded pattern formation due to information exchanges between an adult and a child. Moreover, the process is cognitive in that the child, as a goal-seeking and error correcting individual, undertakes an intricate task of compressing a huge variety of linguistic stimuli in order to build an effective information code. It is further assumed that the basic mechanism which leads to the establishment of fully articulate linguistic ability is that of simulation. The mechanism works through a compression of a set of initial variables (i.e. initial conditions) into a minimum length algorithm and a subsequent construction of an integrated system of language-specific attractors. It is only then that the language user is capable of participating in an information transaction in a fully developed manner.
Resumo:
The aim of the present paper is to provide insight into the issue of idiom comprehension in pa- tients who are in the process of recovery from the syndrome of aphasia. Research in figurative language comprehension has seen a robust development in the recent decades. However, it has not been until quite recently that psycholinguists began to delve into the aspect of metaphorical language comprehension in brain damaged populations. It was observed that even though the ability to produce and understand language is recovered in the majority of patients with head trauma, the impairment of some aspects of comprehension may protract. The understanding of idioms, metaphors, similes and proverbs, due to their specific, non-literal character, has been evi- denced to pose a serious problem to aphasic patients, as they fail to decipher the figurative mean- ing of the utterance, and, instead, tend to process the message literally (Papagno et al. 2004). In the present study, three patients who suffered from aphasic disorder were tested for com- prehension of idioms by means of two multiple choice tasks. The obtained results corroborated the hypothesis that patients who are in the process of recovery from aphasia encounter various pitfalls in the comprehension of idiomatic language. Predominantly, they exhibit an inclination to choose the erroneous, literal paraphrases of the presented idioms over their correct, idiomatic counterparts. The present paper aims at accounting for the reasons underlying such a tendency.
Resumo:
In the ocean, natural and artificial processes generate clouds of bubbles which scatter and attenuate sound. Measurements have shown that at the individual bubble resonance frequency, sound propagation in this medium is highly attenuated and dispersive. Theory to explain this behavior exists in the literature, and is adequate away from resonance. However, due to excessive attenuation near resonance, little experimental data exists for comparison. An impedance tube was developed specifically for exploring this regime. Using the instrument, unique phase speed and attenuation measurements were made for void fractions ranging from 6.2 × 10^−5 to 2.7 × 10^−3 and bubble sizes centered around 0.62 mm in radius. Improved measurement speed, accuracy and precision is possible with the new instrument, and both instantaneous and time-averaged measurements were obtained. Behavior at resonance was observed to be sensitive to the bubble population statistics and agreed with existing theory, within the uncertainty of the bubble population parameters. Scattering from acoustically compact bubble clouds can be predicted from classical scattering theory by using an effective medium description of the bubbly fluid interior. Experimental verification was previously obtained up to the lowest resonance frequency. A novel bubble production technique has been employed to obtain unique scattering measurements with a bubbly-liquid-filled latex tube in a large indoor tank. The effective scattering model described these measurements up to three times the lowest resonance frequency of the structure.
Resumo:
We investigate adaptive buffer management techniques for approximate evaluation of sliding window joins over multiple data streams. In many applications, data stream processing systems have limited memory or have to deal with very high speed data streams. In both cases, computing the exact results of joins between these streams may not be feasible, mainly because the buffers used to compute the joins contain much smaller number of tuples than the tuples contained in the sliding windows. Therefore, a stream buffer management policy is needed in that case. We show that the buffer replacement policy is an important determinant of the quality of the produced results. To that end, we propose GreedyDual-Join (GDJ) an adaptive and locality-aware buffering technique for managing these buffers. GDJ exploits the temporal correlations (at both long and short time scales), which we found to be prevalent in many real data streams. We note that our algorithm is readily applicable to multiple data streams and multiple joins and requires almost no additional system resources. We report results of an experimental study using both synthetic and real-world data sets. Our results demonstrate the superiority and flexibility of our approach when contrasted to other recently proposed techniques.
Resumo:
Personal communication devices are increasingly equipped with sensors that are able to collect and locally store information from their environs. The mobility of users carrying such devices, and hence the mobility of sensor readings in space and time, opens new horizons for interesting applications. In particular, we envision a system in which the collective sensing, storage and communication resources, and mobility of these devices could be leveraged to query the state of (possibly remote) neighborhoods. Such queries would have spatio-temporal constraints which must be met for the query answers to be useful. Using a simplified mobility model, we analytically quantify the benefits from cooperation (in terms of the system's ability to satisfy spatio-temporal constraints), which we show to go beyond simple space-time tradeoffs. In managing the limited storage resources of such cooperative systems, the goal should be to minimize the number of unsatisfiable spatio-temporal constraints. We show that Data Centric Storage (DCS), or "directed placement", is a viable approach for achieving this goal, but only when the underlying network is well connected. Alternatively, we propose, "amorphous placement", in which sensory samples are cached locally, and shuffling of cached samples is used to diffuse the sensory data throughout the whole network. We evaluate conditions under which directed versus amorphous placement strategies would be more efficient. These results lead us to propose a hybrid placement strategy, in which the spatio-temporal constraints associated with a sensory data type determine the most appropriate placement strategy for that data type. We perform an extensive simulation study to evaluate the performance of directed, amorphous, and hybrid placement protocols when applied to queries that are subject to timing constraints. Our results show that, directed placement is better for queries with moderately tight deadlines, whereas amorphous placement is better for queries with looser deadlines, and that under most operational conditions, the hybrid technique gives the best compromise.
Resumo:
Office of Naval Research (N00014-01-1-0624)
Resumo:
Air Force Office of Scientific Research (F49620-01-1-0423); National Geospatial-Intelligence Agency (NMA 201-01-1-2016); National Science Foundation (SBE-035437, DEG-0221680); Office of Naval Research (N00014-01-1-0624)
Resumo:
National Science Foundation (SBE-0354378); Office of Naval Research (N00014-95-1-0657)