42,667 research outputs found
Language Identification Using Visual Features
Automatic visual language identification (VLID) is the technology of using information derived from the visual appearance and movement of the speech articulators to iden- tify the language being spoken, without the use of any audio information. This technique for language identification (LID) is useful in situations in which conventional audio processing is ineffective (very noisy environments), or impossible (no audio signal is available). Research in this field is also beneficial in the related field of automatic lip-reading. This paper introduces several methods for visual language identification (VLID). They are based upon audio LID techniques, which exploit language phonology and phonotactics to discriminate languages. We show that VLID is possible in a speaker-dependent mode by discrimi- nating different languages spoken by an individual, and we then extend the technique to speaker-independent operation, taking pains to ensure that discrimination is not due to artefacts, either visual (e.g. skin-tone) or audio (e.g. rate of speaking). Although the low accuracy of visual speech recognition currently limits the performance of VLID, we can obtain an error-rate of < 10% in discriminating between Arabic and English on 19 speakers and using about 30s of visual speech
Polymerization of perfluorobutadiene
Diisopropyl peroxydicarbonate dissolved in liquid perfluorobutadiene is conducted in a sealed vessel at the autogenous pressure of polymerization. Reaction temperature, ratio of catalyst to monomer, and amount of agitation determine degree of polymerization and product yield
Fitness-dependent topological properties of the World Trade Web
Among the proposed network models, the hidden variable (or good get richer)
one is particularly interesting, even if an explicit empirical test of its
hypotheses has not yet been performed on a real network. Here we provide the
first empirical test of this mechanism on the world trade web, the network
defined by the trade relationships between world countries. We find that the
power-law distributed gross domestic product can be successfully identified
with the hidden variable (or fitness) determining the topology of the world
trade web: all previously studied properties up to third-order correlation
structure (degree distribution, degree correlations and hierarchy) are found to
be in excellent agreement with the predictions of the model. The choice of the
connection probability is such that all realizations of the network with the
same degree sequence are equiprobable.Comment: 4 Pages, 4 Figures. Final version accepted for publication on
Physical Review Letter
Speciational view of macroevolution: are micro and macroevolution decoupled?
We introduce a simple computational model that, with a microscopic dynamics
driven by natural selection and mutation alone, allows the description of true
speciation events. A statistical analysis of the so generated evolutionary tree
captures realistic features showing power laws for frequency distributions in
time and size. Albeit these successful predictions, the difficulty in obtaining
punctuated dynamics with mass extinctions suggests the necessity of decoupling
micro and macro-evolutionary mechanisms in agreement with some ideas of Gould's
and Eldredge's theory of punctuated equilibrium.Comment: Europhys. Lett. 75:342--34
Sign-time distributions for interface growth
We apply the recently introduced distribution of sign-times (DST) to
non-equilibrium interface growth dynamics. We are able to treat within a
unified picture the persistence properties of a large class of relaxational and
noisy linear growth processes, and prove the existence of a non-trivial scaling
relation. A new critical dimension is found, relating to the persistence
properties of these systems. We also illustrate, by means of numerical
simulations, the different types of DST to be expected in both linear and
non-linear growth mechanisms.Comment: 4 pages, 5 ps figs, replaced misprint in authors nam
Mean-field solution of the small-world network model
The small-world network model is a simple model of the structure of social
networks, which simultaneously possesses characteristics of both regular
lattices and random graphs. The model consists of a one-dimensional lattice
with a low density of shortcuts added between randomly selected pairs of
points. These shortcuts greatly reduce the typical path length between any two
points on the lattice. We present a mean-field solution for the average path
length and for the distribution of path lengths in the model. This solution is
exact in the limit of large system size and either large or small number of
shortcuts.Comment: 14 pages, 2 postscript figure
New polymers of perfluorobutadiene and method of manufacture Patent application
Synthesis of polyfluorobutadiene by polymerization of perfluorobutadiene with diisopropyl peroxydicarbonat
Identity and Search in Social Networks
Social networks have the surprising property of being "searchable": Ordinary
people are capable of directing messages through their network of acquaintances
to reach a specific but distant target person in only a few steps. We present a
model that offers an explanation of social network searchability in terms of
recognizable personal identities: sets of characteristics measured along a
number of social dimensions. Our model defines a class of searchable networks
and a method for searching them that may be applicable to many network search
problems, including the location of data files in peer-to-peer networks, pages
on the World Wide Web, and information in distributed databases.Comment: 4 page, 3 figures, revte
- …