---
_id: '3198'
abstract:
- lang: eng
text: 'In this paper we present a new approach for establishing correspondences
between sparse image features related by an unknown non-rigid mapping and corrupted
by clutter and occlusion, such as points extracted from a pair of images containing
a human figure in distinct poses. We formulate this matching task as an energy
minimization problem by defining a complex objective function of the appearance
and the spatial arrangement of the features. Optimization of this energy is an
instance of graph matching, which is in general a NP-hard problem. We describe
a novel graph matching optimization technique, which we refer to as dual decomposition
(DD), and demonstrate on a variety of examples that this method outperforms existing
graph matching algorithms. In the majority of our examples DD is able to find
the global minimum within a minute. The ability to globally optimize the objective
allows us to accurately learn the parameters of our matching model from training
examples. We show on several matching tasks that our learned model yields results
superior to those of state-of-the-art methods. '
alternative_title:
- LNCS
author:
- first_name: Lorenzo
full_name: Torresani, Lorenzo
last_name: Torresani
- first_name: Vladimir
full_name: Vladimir Kolmogorov
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Carsten
full_name: Rother, Carsten
last_name: Rother
citation:
ama: 'Torresani L, Kolmogorov V, Rother C. Feature correspondence via graph matching:
Models and global optimization. In: Vol 5303. Springer; 2008:596-609. doi:10.1007/978-3-540-88688-4_44'
apa: 'Torresani, L., Kolmogorov, V., & Rother, C. (2008). Feature correspondence
via graph matching: Models and global optimization (Vol. 5303, pp. 596–609). Presented
at the ECCV: European Conference on Computer Vision, Springer. https://doi.org/10.1007/978-3-540-88688-4_44'
chicago: 'Torresani, Lorenzo, Vladimir Kolmogorov, and Carsten Rother. “Feature
Correspondence via Graph Matching: Models and Global Optimization,” 5303:596–609.
Springer, 2008. https://doi.org/10.1007/978-3-540-88688-4_44.'
ieee: 'L. Torresani, V. Kolmogorov, and C. Rother, “Feature correspondence via graph
matching: Models and global optimization,” presented at the ECCV: European Conference
on Computer Vision, 2008, vol. 5303, pp. 596–609.'
ista: 'Torresani L, Kolmogorov V, Rother C. 2008. Feature correspondence via graph
matching: Models and global optimization. ECCV: European Conference on Computer
Vision, LNCS, vol. 5303, 596–609.'
mla: 'Torresani, Lorenzo, et al. Feature Correspondence via Graph Matching: Models
and Global Optimization. Vol. 5303, Springer, 2008, pp. 596–609, doi:10.1007/978-3-540-88688-4_44.'
short: L. Torresani, V. Kolmogorov, C. Rother, in:, Springer, 2008, pp. 596–609.
conference:
name: 'ECCV: European Conference on Computer Vision'
date_created: 2018-12-11T12:01:58Z
date_published: 2008-01-01T00:00:00Z
date_updated: 2021-01-12T07:41:44Z
day: '01'
doi: 10.1007/978-3-540-88688-4_44
extern: 1
intvolume: ' 5303'
main_file_link:
- open_access: '0'
url: http://research-srv.microsoft.com/pubs/70610/eccv08-MatchingMRF.pdf
month: '01'
page: 596 - 609
publication_status: published
publisher: Springer
publist_id: '3485'
quality_controlled: 0
status: public
title: 'Feature correspondence via graph matching: Models and global optimization'
type: conference
volume: 5303
year: '2008'
...
---
_id: '3224'
abstract:
- lang: eng
text: 'We propose a new mode of operation, enciphered CBC, for domain extension
of length-preserving functions (like block ciphers), which is a variation on the
popular CBC mode of operation. Our new mode is twice slower than CBC, but has
many (property-preserving) properties not enjoyed by CBC and other known modes.
Most notably, it yields the first constant-rate Variable Input Length (VIL) MAC
from any length preserving Fixed Input Length (FIL) MAC. This answers the question
of Dodis and Puniya from Eurocrypt 2007. Further, our mode is a secure domain
extender for PRFs (with basically the same security as encrypted CBC). This provides
a hedge against the security of the block cipher: if the block cipher is pseudorandom,
one gets a VIL-PRF, while if it is "only" unpredictable, one "at
least" gets a VIL-MAC. Additionally, our mode yields a VIL random oracle
(and, hence, a collision-resistant hash function) when instantiated with length-preserving
random functions, or even random permutations (which can be queried from both
sides). This means that one does not have to re-key the block cipher during the
computation, which was critically used in most previous constructions (analyzed
in the ideal cipher model). '
alternative_title:
- LNCS
author:
- first_name: Yevgeniy
full_name: Dodis, Yevgeniy
last_name: Dodis
- first_name: Krzysztof Z
full_name: Krzysztof Pietrzak
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Prashant
full_name: Puniya, Prashant
last_name: Puniya
citation:
ama: 'Dodis Y, Pietrzak KZ, Puniya P. A new mode of operation for block ciphers
and length preserving MACs. In: Vol 4965. Springer; 2008:198-219. doi:10.1007/978-3-540-78967-3_12'
apa: 'Dodis, Y., Pietrzak, K. Z., & Puniya, P. (2008). A new mode of operation
for block ciphers and length preserving MACs (Vol. 4965, pp. 198–219). Presented
at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Springer.
https://doi.org/10.1007/978-3-540-78967-3_12'
chicago: Dodis, Yevgeniy, Krzysztof Z Pietrzak, and Prashant Puniya. “A New Mode
of Operation for Block Ciphers and Length Preserving MACs,” 4965:198–219. Springer,
2008. https://doi.org/10.1007/978-3-540-78967-3_12.
ieee: 'Y. Dodis, K. Z. Pietrzak, and P. Puniya, “A new mode of operation for block
ciphers and length preserving MACs,” presented at the EUROCRYPT: Theory and Applications
of Cryptographic Techniques, 2008, vol. 4965, pp. 198–219.'
ista: 'Dodis Y, Pietrzak KZ, Puniya P. 2008. A new mode of operation for block ciphers
and length preserving MACs. EUROCRYPT: Theory and Applications of Cryptographic
Techniques, LNCS, vol. 4965, 198–219.'
mla: Dodis, Yevgeniy, et al. A New Mode of Operation for Block Ciphers and Length
Preserving MACs. Vol. 4965, Springer, 2008, pp. 198–219, doi:10.1007/978-3-540-78967-3_12.
short: Y. Dodis, K.Z. Pietrzak, P. Puniya, in:, Springer, 2008, pp. 198–219.
conference:
name: 'EUROCRYPT: Theory and Applications of Cryptographic Techniques'
date_created: 2018-12-11T12:02:07Z
date_published: 2008-04-28T00:00:00Z
date_updated: 2021-01-12T07:41:55Z
day: '28'
doi: 10.1007/978-3-540-78967-3_12
extern: 1
intvolume: ' 4965'
month: '04'
page: 198 - 219
publication_status: published
publisher: Springer
publist_id: '3456'
quality_controlled: 0
status: public
title: A new mode of operation for block ciphers and length preserving MACs
type: conference
volume: 4965
year: '2008'
...
---
_id: '3225'
abstract:
- lang: eng
text: 'A robust multi-property combiner for a set of security properties merges
two hash functions such that the resulting function satisfies each of the properties
which at least one of the two starting functions has. Fischlin and Lehmann (TCC
2008) recently constructed a combiner which simultaneously preserves collision-resistance,
target collision-resistance, message authentication, pseudorandomness and indifferentiability
from a random oracle (IRO). Their combiner produces outputs of 5n bits, where
n denotes the output length of the underlying hash functions. In this paper we
propose improved combiners with shorter outputs. By sacrificing the indifferentiability
from random oracles we obtain a combiner which preserves all of the other aforementioned
properties but with output length 2n only. This matches a lower bound for black-box
combiners for collision-resistance as the only property, showing that the other
properties can be achieved without penalizing the length of the hash values. We
then propose a combiner which also preserves the IRO property, slightly increasing
the output length to 2n + ω(logn). Finally, we show that a twist on our combiners
also makes them robust for one-wayness (but at the price of a fixed input length). '
alternative_title:
- LNCS
author:
- first_name: Marc
full_name: Fischlin, Marc
last_name: Fischlin
- first_name: Anja
full_name: Lehmann, Anja
last_name: Lehmann
- first_name: Krzysztof Z
full_name: Krzysztof Pietrzak
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: 'Fischlin M, Lehmann A, Pietrzak KZ. Robust multi property combiners for hash
functions revisited. In: Vol 5126. Springer; 2008:655-666. doi:10.1007/978-3-540-70583-3_53'
apa: 'Fischlin, M., Lehmann, A., & Pietrzak, K. Z. (2008). Robust multi property
combiners for hash functions revisited (Vol. 5126, pp. 655–666). Presented at
the ICALP: Automata, Languages and Programming, Springer. https://doi.org/10.1007/978-3-540-70583-3_53'
chicago: Fischlin, Marc, Anja Lehmann, and Krzysztof Z Pietrzak. “Robust Multi Property
Combiners for Hash Functions Revisited,” 5126:655–66. Springer, 2008. https://doi.org/10.1007/978-3-540-70583-3_53.
ieee: 'M. Fischlin, A. Lehmann, and K. Z. Pietrzak, “Robust multi property combiners
for hash functions revisited,” presented at the ICALP: Automata, Languages and
Programming, 2008, vol. 5126, no. PART 2, pp. 655–666.'
ista: 'Fischlin M, Lehmann A, Pietrzak KZ. 2008. Robust multi property combiners
for hash functions revisited. ICALP: Automata, Languages and Programming, LNCS,
vol. 5126, 655–666.'
mla: Fischlin, Marc, et al. Robust Multi Property Combiners for Hash Functions
Revisited. Vol. 5126, no. PART 2, Springer, 2008, pp. 655–66, doi:10.1007/978-3-540-70583-3_53.
short: M. Fischlin, A. Lehmann, K.Z. Pietrzak, in:, Springer, 2008, pp. 655–666.
conference:
name: 'ICALP: Automata, Languages and Programming'
date_created: 2018-12-11T12:02:07Z
date_published: 2008-08-06T00:00:00Z
date_updated: 2025-09-29T11:09:55Z
day: '06'
doi: 10.1007/978-3-540-70583-3_53
extern: 1
intvolume: ' 5126'
issue: PART 2
month: '08'
page: 655 - 666
publication_status: published
publisher: Springer
publist_id: '3454'
quality_controlled: 0
related_material:
record:
- id: '2852'
relation: later_version
status: public
status: public
title: Robust multi property combiners for hash functions revisited
type: conference
volume: 5126
year: '2008'
...
---
_id: '3226'
abstract:
- lang: eng
text: 'A family of functions is weakly pseudorandom if a random member of the family
is indistinguishable from a uniform random function when queried on random inputs.
We point out a subtle ambiguity in the definition of weak PRFs: there are natural
weak PRFs whose security breaks down if the randomness used to sample the inputs
is revealed. To capture this ambiguity we distinguish between public-coin and
secret-coin weak PRFs. We show that the existence of a secret-coin weak PRF which
is not also a public-coin weak PRF implies the existence of two pass key-agreement
(i.e. public-key encryption). So in Minicrypt, i.e. under the assumption that
one-way functions exist but public-key cryptography does not, the notion of public-
and secret-coin weak PRFs coincide. Previous to this paper all positive cryptographic
statements known to hold exclusively in Minicrypt concerned the adaptive security
of constructions using non-adaptively secure components. Weak PRFs give rise to
a new set of statements having this property. As another example we consider the
problem of range extension for weak PRFs. We show that in Minicrypt one can beat
the best possible range expansion factor (using a fixed number of distinct keys)
for a very general class of constructions (in particular, this class contains
all constructions that are known today). '
acknowledgement: This work was partially supported by the Zurich Information Security
Center.
alternative_title:
- LNCS
author:
- first_name: Krzysztof Z
full_name: Krzysztof Pietrzak
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Johan
full_name: Sjödin, Johan
last_name: Sjödin
citation:
ama: 'Pietrzak KZ, Sjödin J. Weak pseudorandom functions in minicrypt. In: Vol 5126.
Springer; 2008:423-436. doi:10.1007/978-3-540-70583-3_35'
apa: 'Pietrzak, K. Z., & Sjödin, J. (2008). Weak pseudorandom functions in minicrypt
(Vol. 5126, pp. 423–436). Presented at the ICALP: Automata, Languages and Programming,
Springer. https://doi.org/10.1007/978-3-540-70583-3_35'
chicago: Pietrzak, Krzysztof Z, and Johan Sjödin. “Weak Pseudorandom Functions in
Minicrypt,” 5126:423–36. Springer, 2008. https://doi.org/10.1007/978-3-540-70583-3_35.
ieee: 'K. Z. Pietrzak and J. Sjödin, “Weak pseudorandom functions in minicrypt,”
presented at the ICALP: Automata, Languages and Programming, 2008, vol. 5126,
no. PART 2, pp. 423–436.'
ista: 'Pietrzak KZ, Sjödin J. 2008. Weak pseudorandom functions in minicrypt. ICALP:
Automata, Languages and Programming, LNCS, vol. 5126, 423–436.'
mla: Pietrzak, Krzysztof Z., and Johan Sjödin. Weak Pseudorandom Functions in
Minicrypt. Vol. 5126, no. PART 2, Springer, 2008, pp. 423–36, doi:10.1007/978-3-540-70583-3_35.
short: K.Z. Pietrzak, J. Sjödin, in:, Springer, 2008, pp. 423–436.
conference:
name: 'ICALP: Automata, Languages and Programming'
date_created: 2018-12-11T12:02:07Z
date_published: 2008-08-06T00:00:00Z
date_updated: 2021-01-12T07:41:56Z
day: '06'
doi: 10.1007/978-3-540-70583-3_35
extern: 1
intvolume: ' 5126'
issue: PART 2
month: '08'
page: 423 - 436
publication_status: published
publisher: Springer
publist_id: '3455'
quality_controlled: 0
status: public
title: Weak pseudorandom functions in minicrypt
type: conference
volume: 5126
year: '2008'
...
---
_id: '3227'
abstract:
- lang: eng
text: Large amount of data management can cause a lot of troubles which can be solved
by dedicated computer system. To facilitate management of measurement data which
are gathered in Institute of Power Engineering - Insulation Department a special
system called Elektrowiz® was developed. It allows storing measurement results
which concern partial discharges in insulation of turbo- and hydrogenerators in
power stations. Multilayer architecture of the system allows reaching gathered
data independently on user localization. There are possible different access methods
to the system and dependency on current requirements data exploration can be realized
with read-only or edit rights.
author:
- first_name: Piotr
full_name: Zubielik, Piotr
last_name: Zubielik
- first_name: Jerzy
full_name: Nadaczny, Jerzy
last_name: Nadaczny
- first_name: Krzysztof Z
full_name: Krzysztof Pietrzak
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Marcin
full_name: Lawenda, Marcin
last_name: Lawenda
citation:
ama: Zubielik P, Nadaczny J, Pietrzak KZ, Lawenda M. Elektrowiz – system of measurement
data management. Przeglad Elektrotechniczny. 2008;84(10):239-242.
apa: Zubielik, P., Nadaczny, J., Pietrzak, K. Z., & Lawenda, M. (2008). Elektrowiz
– system of measurement data management. Przeglad Elektrotechniczny. SIGMA-NOT.
chicago: Zubielik, Piotr, Jerzy Nadaczny, Krzysztof Z Pietrzak, and Marcin Lawenda.
“Elektrowiz – System of Measurement Data Management.” Przeglad Elektrotechniczny.
SIGMA-NOT, 2008.
ieee: P. Zubielik, J. Nadaczny, K. Z. Pietrzak, and M. Lawenda, “Elektrowiz – system
of measurement data management,” Przeglad Elektrotechniczny, vol. 84, no.
10. SIGMA-NOT, pp. 239–242, 2008.
ista: Zubielik P, Nadaczny J, Pietrzak KZ, Lawenda M. 2008. Elektrowiz – system
of measurement data management. Przeglad Elektrotechniczny. 84(10), 239–242.
mla: Zubielik, Piotr, et al. “Elektrowiz – System of Measurement Data Management.”
Przeglad Elektrotechniczny, vol. 84, no. 10, SIGMA-NOT, 2008, pp. 239–42.
short: P. Zubielik, J. Nadaczny, K.Z. Pietrzak, M. Lawenda, Przeglad Elektrotechniczny
84 (2008) 239–242.
date_created: 2018-12-11T12:02:08Z
date_published: 2008-10-01T00:00:00Z
date_updated: 2021-01-12T07:41:56Z
day: '01'
extern: 1
intvolume: ' 84'
issue: '10'
main_file_link:
- open_access: '0'
url: http://pe.org.pl/abstract_pl.php?nid=1917
month: '10'
page: 239 - 242
publication: Przeglad Elektrotechniczny
publication_status: published
publisher: SIGMA-NOT
publist_id: '3452'
quality_controlled: 0
status: public
title: Elektrowiz – system of measurement data management
type: journal_article
volume: 84
year: '2008'
...
---
_id: '3228'
abstract:
- lang: eng
text: |2-
A black-box combiner for collision resistant hash functions (CRHF) is a construction which given black-box access to two hash functions is collision resistant if at least one of the components is collision resistant. In this paper we prove a lower bound on the output length of black-box combiners for CRHFs. The bound we prove is basically tight as it is achieved by a recent construction of Canetti et al [Crypto'07]. The best previously known lower bounds only ruled out a very restricted class of combiners having a very strong security reduction: the reduction was required to output collisions for both underlying candidate hash-functions given a single collision for the combiner (Canetti et al [Crypto'07] building on Boneh and Boyen [Crypto'06] and Pietrzak [Eurocrypt'07]). Our proof uses a lemma similar to the elegant "reconstruction lemma" of Gennaro and Trevisan [FOCS'00], which states that any function which is not one-way is compressible (and thus uniformly random function must be one-way). In a similar vein we show that a function which is not collision resistant is compressible. We also borrow ideas from recent work by Haitner et al. [FOCS'07], who show that one can prove the reconstruction lemma even relative to some very powerful oracles (in our case this will be an exponential time collision-finding oracle). © 2008 Springer-Verlag Berlin Heidelberg.
alternative_title:
- LNCS
author:
- first_name: Krzysztof Z
full_name: Krzysztof Pietrzak
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: 'Pietrzak KZ. Compression from collisions or why CRHF combiners have a long
output. In: Vol 5157. Springer; 2008:413-432. doi:10.1007/978-3-540-85174-5_23'
apa: 'Pietrzak, K. Z. (2008). Compression from collisions or why CRHF combiners
have a long output (Vol. 5157, pp. 413–432). Presented at the CRYPTO: International
Cryptology Conference, Springer. https://doi.org/10.1007/978-3-540-85174-5_23'
chicago: Pietrzak, Krzysztof Z. “Compression from Collisions or Why CRHF Combiners
Have a Long Output,” 5157:413–32. Springer, 2008. https://doi.org/10.1007/978-3-540-85174-5_23.
ieee: 'K. Z. Pietrzak, “Compression from collisions or why CRHF combiners have a
long output,” presented at the CRYPTO: International Cryptology Conference, 2008,
vol. 5157, pp. 413–432.'
ista: 'Pietrzak KZ. 2008. Compression from collisions or why CRHF combiners have
a long output. CRYPTO: International Cryptology Conference, LNCS, vol. 5157, 413–432.'
mla: Pietrzak, Krzysztof Z. Compression from Collisions or Why CRHF Combiners
Have a Long Output. Vol. 5157, Springer, 2008, pp. 413–32, doi:10.1007/978-3-540-85174-5_23.
short: K.Z. Pietrzak, in:, Springer, 2008, pp. 413–432.
conference:
name: 'CRYPTO: International Cryptology Conference'
date_created: 2018-12-11T12:02:08Z
date_published: 2008-09-11T00:00:00Z
date_updated: 2021-01-12T07:41:57Z
day: '11'
doi: 10.1007/978-3-540-85174-5_23
extern: 1
intvolume: ' 5157'
month: '09'
page: 413 - 432
publication_status: published
publisher: Springer
publist_id: '3453'
quality_controlled: 0
status: public
title: Compression from collisions or why CRHF combiners have a long output
type: conference
volume: 5157
year: '2008'
...
---
_id: '3229'
abstract:
- lang: eng
text: 'We construct a stream-cipher S whose implementation is secure even if a bounded
amount of arbitrary (adversarially chosen) information on the internal state ofS
is leaked during computation. This captures all possible side-channel attacks
on S where the amount of information leaked in a given period is bounded, but
overall can be arbitrary large. The only other assumption we make on the implementation
of S is that only data that is accessed during computation leaks information.
The stream-cipher S generates its output in chunks K1, K2, . . . and arbitrary
but bounded information leakage is modeled by allowing the adversary to adaptively
chose a function fl : {0,1}* rarr {0, 1}lambda before Kl is computed, she then
gets fl(taul) where taul is the internal state ofS that is accessed during the
computation of Kg. One notion of security we prove for S is that Kg is indistinguishable
from random when given K1,..., K1-1,f1(tau1 ),..., fl-1(taul-1) and also the complete
internal state of S after Kg has been computed (i.e. S is forward-secure). The
construction is based on alternating extraction (used in the intrusion-resilient
secret-sharing scheme from FOCS''07). We move this concept to the computational
setting by proving a lemma that states that the output of any PRG has high HILLpseudoentropy
(i.e. is indistinguishable from some distribution with high min-entropy) even
if arbitrary information about the seed is leaked. The amount of leakage lambda
that we can tolerate in each step depends on the strength of the underlying PRG,
it is at least logarithmic, but can be as large as a constant fraction of the
internal state of S if the PRG is exponentially hard.'
author:
- first_name: Stefan
full_name: Dziembowski, Stefan
last_name: Dziembowski
- first_name: Krzysztof Z
full_name: Krzysztof Pietrzak
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: 'Dziembowski S, Pietrzak KZ. Leakage resilient cryptography. In: IEEE; 2008:293-302.
doi:10.1109/FOCS.2008.56'
apa: 'Dziembowski, S., & Pietrzak, K. Z. (2008). Leakage resilient cryptography
(pp. 293–302). Presented at the FOCS: Foundations of Computer Science, IEEE. https://doi.org/10.1109/FOCS.2008.56'
chicago: Dziembowski, Stefan, and Krzysztof Z Pietrzak. “Leakage Resilient Cryptography,”
293–302. IEEE, 2008. https://doi.org/10.1109/FOCS.2008.56.
ieee: 'S. Dziembowski and K. Z. Pietrzak, “Leakage resilient cryptography,” presented
at the FOCS: Foundations of Computer Science, 2008, pp. 293–302.'
ista: 'Dziembowski S, Pietrzak KZ. 2008. Leakage resilient cryptography. FOCS: Foundations
of Computer Science, 293–302.'
mla: Dziembowski, Stefan, and Krzysztof Z. Pietrzak. Leakage Resilient Cryptography.
IEEE, 2008, pp. 293–302, doi:10.1109/FOCS.2008.56.
short: S. Dziembowski, K.Z. Pietrzak, in:, IEEE, 2008, pp. 293–302.
conference:
name: 'FOCS: Foundations of Computer Science'
date_created: 2018-12-11T12:02:08Z
date_published: 2008-10-28T00:00:00Z
date_updated: 2021-01-12T07:41:57Z
day: '28'
doi: 10.1109/FOCS.2008.56
extern: 1
month: '10'
page: 293 - 302
publication_status: published
publisher: IEEE
publist_id: '3451'
quality_controlled: 0
status: public
title: Leakage resilient cryptography
type: conference
year: '2008'
...
---
_id: '3291'
abstract:
- lang: eng
text: 'The filamentous fungus Aspergillus fumigatus is responsible for a lethal
disease called Invasive Aspergillosis that affects immunocompromised patients.
This disease, like other human fungal diseases, is generally treated by compounds
targeting the primary fungal cell membrane sterol. Recently, glucan synthesis
inhibitors were added to the limited antifungal arsenal and encouraged the search
for novel targets in cell wall biosynthesis. Although galactomannan is a major
component of the A. fumigatus cell wall and extracellular matrix, the biosynthesis
and role of galactomannan are currently unknown. By a targeted gene deletion approach,
we demonstrate that UDP-galactopyranose mutase, a key enzyme of galactofuranose
metabolism, controls the biosynthesis of galactomannan and galactofuranose containing
glycoconjugates. The glfA deletion mutant generated in this study is devoid of
galactofuranose and displays attenuated virulence in a low-dose mouse model of
invasive aspergillosis that likely reflects the impaired growth of the mutant
at mammalian body temperature. Furthermore, the absence of galactofuranose results
in a thinner cell wall that correlates with an increased susceptibility to several
antifungal agents. The UDP-galactopyranose mutase thus appears to be an appealing
adjunct therapeutic target in combination with other drugs against A. fumigatus.
Its absence from mammalian cells indeed offers a considerable advantage to achieve
therapeutic selectivity. '
author:
- first_name: Philipp S
full_name: Philipp Schmalhorst
id: 309D50DA-F248-11E8-B48F-1D18A9856A87
last_name: Schmalhorst
orcid: 0000-0002-5795-0133
- first_name: Sven
full_name: Krappmann, Sven
last_name: Krappmann
- first_name: Wouter
full_name: Vervecken, Wouter
last_name: Vervecken
- first_name: Manfred
full_name: Rohde, Manfred
last_name: Rohde
- first_name: Meike
full_name: Müller, Meike
last_name: Müller
- first_name: Gerhard
full_name: Braus, Gerhard H.
last_name: Braus
- first_name: Roland
full_name: Contreras, Roland
last_name: Contreras
- first_name: Armin
full_name: Braun, Armin
last_name: Braun
- first_name: Hans
full_name: Bakker, Hans
last_name: Bakker
- first_name: Françoise
full_name: Routier, Françoise H
last_name: Routier
citation:
ama: Schmalhorst PS, Krappmann S, Vervecken W, et al. Contribution of galactofuranose
to the virulence of the opportunistic pathogen Aspergillus fumigatus. Eukaryotic
Cell. 2008;7(8):1268-1277. doi:10.1128/EC.00065-08
apa: Schmalhorst, P. S., Krappmann, S., Vervecken, W., Rohde, M., Müller, M., Braus,
G., … Routier, F. (2008). Contribution of galactofuranose to the virulence of
the opportunistic pathogen Aspergillus fumigatus. Eukaryotic Cell. American
Society for Microbiology. https://doi.org/10.1128/EC.00065-08
chicago: Schmalhorst, Philipp S, Sven Krappmann, Wouter Vervecken, Manfred Rohde,
Meike Müller, Gerhard Braus, Roland Contreras, Armin Braun, Hans Bakker, and Françoise
Routier. “Contribution of Galactofuranose to the Virulence of the Opportunistic
Pathogen Aspergillus Fumigatus.” Eukaryotic Cell. American Society for
Microbiology, 2008. https://doi.org/10.1128/EC.00065-08.
ieee: P. S. Schmalhorst et al., “Contribution of galactofuranose to the virulence
of the opportunistic pathogen Aspergillus fumigatus,” Eukaryotic Cell,
vol. 7, no. 8. American Society for Microbiology, pp. 1268–1277, 2008.
ista: Schmalhorst PS, Krappmann S, Vervecken W, Rohde M, Müller M, Braus G, Contreras
R, Braun A, Bakker H, Routier F. 2008. Contribution of galactofuranose to the
virulence of the opportunistic pathogen Aspergillus fumigatus. Eukaryotic Cell.
7(8), 1268–1277.
mla: Schmalhorst, Philipp S., et al. “Contribution of Galactofuranose to the Virulence
of the Opportunistic Pathogen Aspergillus Fumigatus.” Eukaryotic Cell,
vol. 7, no. 8, American Society for Microbiology, 2008, pp. 1268–77, doi:10.1128/EC.00065-08.
short: P.S. Schmalhorst, S. Krappmann, W. Vervecken, M. Rohde, M. Müller, G. Braus,
R. Contreras, A. Braun, H. Bakker, F. Routier, Eukaryotic Cell 7 (2008) 1268–1277.
date_created: 2018-12-11T12:02:29Z
date_published: 2008-06-13T00:00:00Z
date_updated: 2021-01-12T07:42:26Z
day: '13'
doi: 10.1128/EC.00065-08
extern: 1
intvolume: ' 7'
issue: '8'
month: '06'
page: 1268 - 1277
publication: Eukaryotic Cell
publication_status: published
publisher: American Society for Microbiology
publist_id: '3354'
quality_controlled: 0
status: public
title: Contribution of galactofuranose to the virulence of the opportunistic pathogen
Aspergillus fumigatus
type: journal_article
volume: 7
year: '2008'
...
---
_id: '3307'
abstract:
- lang: eng
text: A complete mitochondrial (mt) genome sequence was reconstructed from a 38,000
year-old Neandertal individual with 8341 mtDNA sequences identified among 4.8
Gb of DNA generated from ∼0.3 g of bone. Analysis of the assembled sequence unequivocally
establishes that the Neandertal mtDNA falls outside the variation of extant human
mtDNAs, and allows an estimate of the divergence date between the two mtDNA lineages
of 660,000 ± 140,000 years. Of the 13 proteins encoded in the mtDNA, subunit 2
of cytochrome c oxidase of the mitochondrial electron transport chain has experienced
the largest number of amino acid substitutions in human ancestors since the separation
from Neandertals. There is evidence that purifying selection in the Neandertal
mtDNA was reduced compared with other primate lineages, suggesting that the effective
population size of Neandertals was small.
author:
- first_name: Richard
full_name: Green, Richard E
last_name: Green
- first_name: Anna
full_name: 'Malaspinas, Anna-Sapfo '
last_name: Malaspinas
- first_name: Johannes
full_name: Krause, Johannes
last_name: Krause
- first_name: Adrian
full_name: Briggs, Adrian W
last_name: Briggs
- first_name: Philip
full_name: Johnson, Philip L
last_name: Johnson
- first_name: Caroline
full_name: Caroline Uhler
id: 49ADD78E-F248-11E8-B48F-1D18A9856A87
last_name: Uhler
orcid: 0000-0002-7008-0216
- first_name: Matthias
full_name: Meyer, Matthias
last_name: Meyer
- first_name: Jeffrey
full_name: Good, Jeffrey M
last_name: Good
- first_name: Tomislav
full_name: Maricic, Tomislav
last_name: Maricic
- first_name: Udo
full_name: Stenzel, Udo
last_name: Stenzel
- first_name: Kay
full_name: Prüfer, Kay
last_name: Prüfer
- first_name: Michael
full_name: Siebauer, Michael F
last_name: Siebauer
- first_name: Hernän
full_name: Burbano, Hernän A
last_name: Burbano
- first_name: Michael
full_name: Ronan, Michael T
last_name: Ronan
- first_name: Jonathan
full_name: Rothberg, Jonathan M
last_name: Rothberg
- first_name: Michael
full_name: Egholm, Michael
last_name: Egholm
- first_name: Pavao
full_name: Rudan, Pavao
last_name: Rudan
- first_name: Dejana
full_name: Brajković, Dejana
last_name: Brajković
- first_name: Željko
full_name: Kućan, Željko
last_name: Kućan
- first_name: Ivan
full_name: Gušić, Ivan
last_name: Gušić
- first_name: Mårten
full_name: Wikström, Mårten K
last_name: Wikström
- first_name: Liisa
full_name: Laakkonen, Liisa J
last_name: Laakkonen
- first_name: Janet
full_name: Kelso, Janet F
last_name: Kelso
- first_name: Montgomery
full_name: Slatkin, Montgomery
last_name: Slatkin
- first_name: Svante
full_name: Pääbo, Svante H
last_name: Pääbo
citation:
ama: Green R, Malaspinas A, Krause J, et al. A complete neandertal mitochondrial
genome sequence determined by highhhroughput sequencing. Cell. 2008;134:416-426.
doi:10.1016/j.cell.2008.06.021
apa: Green, R., Malaspinas, A., Krause, J., Briggs, A., Johnson, P., Uhler, C.,
… Pääbo, S. (2008). A complete neandertal mitochondrial genome sequence determined
by highhhroughput sequencing. Cell. Cell Press. https://doi.org/10.1016/j.cell.2008.06.021
chicago: Green, Richard, Anna Malaspinas, Johannes Krause, Adrian Briggs, Philip
Johnson, Caroline Uhler, Matthias Meyer, et al. “A Complete Neandertal Mitochondrial
Genome Sequence Determined by Highhhroughput Sequencing.” Cell. Cell Press,
2008. https://doi.org/10.1016/j.cell.2008.06.021.
ieee: R. Green et al., “A complete neandertal mitochondrial genome sequence
determined by highhhroughput sequencing,” Cell, vol. 134. Cell Press, pp.
416–426, 2008.
ista: Green R, Malaspinas A, Krause J, Briggs A, Johnson P, Uhler C, Meyer M, Good
J, Maricic T, Stenzel U, Prüfer K, Siebauer M, Burbano H, Ronan M, Rothberg J,
Egholm M, Rudan P, Brajković D, Kućan Ž, Gušić I, Wikström M, Laakkonen L, Kelso
J, Slatkin M, Pääbo S. 2008. A complete neandertal mitochondrial genome sequence
determined by highhhroughput sequencing. Cell. 134, 416–426.
mla: Green, Richard, et al. “A Complete Neandertal Mitochondrial Genome Sequence
Determined by Highhhroughput Sequencing.” Cell, vol. 134, Cell Press, 2008,
pp. 416–26, doi:10.1016/j.cell.2008.06.021.
short: R. Green, A. Malaspinas, J. Krause, A. Briggs, P. Johnson, C. Uhler, M. Meyer,
J. Good, T. Maricic, U. Stenzel, K. Prüfer, M. Siebauer, H. Burbano, M. Ronan,
J. Rothberg, M. Egholm, P. Rudan, D. Brajković, Ž. Kućan, I. Gušić, M. Wikström,
L. Laakkonen, J. Kelso, M. Slatkin, S. Pääbo, Cell 134 (2008) 416–426.
date_created: 2018-12-11T12:02:35Z
date_published: 2008-08-01T00:00:00Z
date_updated: 2021-01-12T07:42:32Z
day: '01'
doi: 10.1016/j.cell.2008.06.021
extern: 1
intvolume: ' 134'
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2602844/
month: '08'
oa: 1
page: 416 - 426
publication: Cell
publication_status: published
publisher: Cell Press
publist_id: '3333'
quality_controlled: 0
status: public
title: A complete neandertal mitochondrial genome sequence determined by highhhroughput
sequencing
type: journal_article
volume: 134
year: '2008'
...
---
_id: '3409'
abstract:
- lang: eng
text: With the introduction of single-molecule force spectroscopy (SMFS) it has
become possible to directly access the interactions of various molecular systems.
A bottleneck in conventional SMFS is collecting the large amount of data required
for statistically meaningful analysis. Currently, atomic force microscopy (AFM)-based
SMFS requires the user to tediously 'fish' for single molecules. In addition,
most experimental and environmental conditions must be manually adjusted. Here,
we developed a fully automated single-molecule force spectroscope. The instrument
is able to perform SMFS while monitoring and regulating experimental conditions
such as buffer composition and temperature. Cantilever alignment and calibration
can also be automatically performed during experiments. This, combined with in-line
data analysis, enables the instrument, once set up, to perform complete SMFS experiments
autonomously.
author:
- first_name: Jens
full_name: Struckmeier, Jens
last_name: Struckmeier
- first_name: Reiner
full_name: Wahl, Reiner
last_name: Wahl
- first_name: Mirko
full_name: Leuschner, Mirko
last_name: Leuschner
- first_name: Joao
full_name: Nunes, Joao
last_name: Nunes
- first_name: Harald L
full_name: Harald Janovjak
id: 33BA6C30-F248-11E8-B48F-1D18A9856A87
last_name: Janovjak
orcid: 0000-0002-8023-9315
- first_name: Ulrich
full_name: Geisler, Ulrich
last_name: Geisler
- first_name: Gerd
full_name: Hofmann, Gerd
last_name: Hofmann
- first_name: Torsten
full_name: Jähnke, Torsten
last_name: Jähnke
- first_name: Daniel
full_name: Mueller, Daniel J
last_name: Mueller
citation:
ama: Struckmeier J, Wahl R, Leuschner M, et al. Fully automated single-molecule
force spectroscopy for screening applications. Nanotechnology. 2008;19(38).
doi:10.1088/0957-4484/19/38/384020
apa: Struckmeier, J., Wahl, R., Leuschner, M., Nunes, J., Janovjak, H. L., Geisler,
U., … Mueller, D. (2008). Fully automated single-molecule force spectroscopy for
screening applications. Nanotechnology. IOP Publishing Ltd. https://doi.org/10.1088/0957-4484/19/38/384020
chicago: Struckmeier, Jens, Reiner Wahl, Mirko Leuschner, Joao Nunes, Harald L Janovjak,
Ulrich Geisler, Gerd Hofmann, Torsten Jähnke, and Daniel Mueller. “Fully Automated
Single-Molecule Force Spectroscopy for Screening Applications.” Nanotechnology.
IOP Publishing Ltd., 2008. https://doi.org/10.1088/0957-4484/19/38/384020.
ieee: J. Struckmeier et al., “Fully automated single-molecule force spectroscopy
for screening applications,” Nanotechnology, vol. 19, no. 38. IOP Publishing
Ltd., 2008.
ista: Struckmeier J, Wahl R, Leuschner M, Nunes J, Janovjak HL, Geisler U, Hofmann
G, Jähnke T, Mueller D. 2008. Fully automated single-molecule force spectroscopy
for screening applications. Nanotechnology. 19(38).
mla: Struckmeier, Jens, et al. “Fully Automated Single-Molecule Force Spectroscopy
for Screening Applications.” Nanotechnology, vol. 19, no. 38, IOP Publishing
Ltd., 2008, doi:10.1088/0957-4484/19/38/384020.
short: J. Struckmeier, R. Wahl, M. Leuschner, J. Nunes, H.L. Janovjak, U. Geisler,
G. Hofmann, T. Jähnke, D. Mueller, Nanotechnology 19 (2008).
date_created: 2018-12-11T12:03:11Z
date_published: 2008-08-12T00:00:00Z
date_updated: 2021-01-12T07:43:17Z
day: '12'
doi: 10.1088/0957-4484/19/38/384020
extern: 1
intvolume: ' 19'
issue: '38'
month: '08'
publication: Nanotechnology
publication_status: published
publisher: IOP Publishing Ltd.
publist_id: '2993'
quality_controlled: 0
status: public
title: Fully automated single-molecule force spectroscopy for screening applications
type: journal_article
volume: 19
year: '2008'
...
---
_id: '3410'
abstract:
- lang: eng
text: Membrane proteins are involved in essential biological processes such as energy
conversion, signal transduction, solute transport and secretion. All biological
processes, also those involving membrane proteins, are steered by molecular interactions.
Molecular interactions guide the folding and stability of membrane proteins, determine
their assembly, switch their functional states or mediate signal transduction.
The sequential steps of molecular interactions driving these processes can be
described by dynamic energy landscapes. The conceptual energy landscape allows
to follow the complex reaction pathways of membrane proteins while its modifications
describe why and how pathways are changed. Single-molecule force spectroscopy
(SMFS) detects, quantifies and locates interactions within and between membrane
proteins. SMFS helps to determine how these interactions change with temperature,
point mutations, oligomerization and the functional states of membrane proteins.
Applied in different modes, SMFS explores the co-existence and population of reaction
pathways in the energy landscape of the protein and thus reveals detailed insights
into local mechanisms, determining its structural and functional relationships.
Here we review how SMFS extracts the defining parameters of an energy landscape
such as the barrier position, reaction kinetics and roughness with high precision.
author:
- first_name: Harald L
full_name: Harald Janovjak
id: 33BA6C30-F248-11E8-B48F-1D18A9856A87
last_name: Janovjak
orcid: 0000-0002-8023-9315
- first_name: Tanuj
full_name: Sapra, Tanuj K
last_name: Sapra
- first_name: Alexej
full_name: Kedrov, Alexej
last_name: Kedrov
- first_name: Daniel
full_name: Mueller, Daniel J
last_name: Mueller
citation:
ama: 'Janovjak HL, Sapra T, Kedrov A, Mueller D. From valleys to ridges: Exploring
the energy landscape of single membrane proteins. ChemPhysChem. 2008;9(7):954-966.
doi:10.1002/cphc.200700662'
apa: 'Janovjak, H. L., Sapra, T., Kedrov, A., & Mueller, D. (2008). From valleys
to ridges: Exploring the energy landscape of single membrane proteins. ChemPhysChem.
Wiley-Blackwell. https://doi.org/10.1002/cphc.200700662'
chicago: 'Janovjak, Harald L, Tanuj Sapra, Alexej Kedrov, and Daniel Mueller. “From
Valleys to Ridges: Exploring the Energy Landscape of Single Membrane Proteins.”
ChemPhysChem. Wiley-Blackwell, 2008. https://doi.org/10.1002/cphc.200700662.'
ieee: 'H. L. Janovjak, T. Sapra, A. Kedrov, and D. Mueller, “From valleys to ridges:
Exploring the energy landscape of single membrane proteins,” ChemPhysChem,
vol. 9, no. 7. Wiley-Blackwell, pp. 954–966, 2008.'
ista: 'Janovjak HL, Sapra T, Kedrov A, Mueller D. 2008. From valleys to ridges:
Exploring the energy landscape of single membrane proteins. ChemPhysChem. 9(7),
954–966.'
mla: 'Janovjak, Harald L., et al. “From Valleys to Ridges: Exploring the Energy
Landscape of Single Membrane Proteins.” ChemPhysChem, vol. 9, no. 7, Wiley-Blackwell,
2008, pp. 954–66, doi:10.1002/cphc.200700662.'
short: H.L. Janovjak, T. Sapra, A. Kedrov, D. Mueller, ChemPhysChem 9 (2008) 954–966.
date_created: 2018-12-11T12:03:11Z
date_published: 2008-05-02T00:00:00Z
date_updated: 2019-04-26T07:22:27Z
day: '02'
doi: 10.1002/cphc.200700662
extern: 1
intvolume: ' 9'
issue: '7'
month: '05'
page: 954 - 966
publication: ChemPhysChem
publication_status: published
publisher: Wiley-Blackwell
publist_id: '2992'
quality_controlled: 0
status: public
title: 'From valleys to ridges: Exploring the energy landscape of single membrane
proteins'
type: review
volume: 9
year: '2008'
...
---
_id: '13422'
abstract:
- lang: eng
text: 'Make like a leaf: The synthesis and characterization of a family of “flowerlike”
Au/Fe3O4 nanoparticles is described, whereby Fe3O4 “leaves” adhere to a gold core
(see image). The size and numbers of iron oxide domains can be adjusted flexibly
by changing the proportion of the starting materials and the reaction time.'
article_processing_charge: No
article_type: original
author:
- first_name: Yanhu
full_name: Wei, Yanhu
last_name: Wei
- first_name: Rafal
full_name: Klajn, Rafal
id: 8e84690e-1e48-11ed-a02b-a1e6fb8bb53b
last_name: Klajn
- first_name: Anatoliy O.
full_name: Pinchuk, Anatoliy O.
last_name: Pinchuk
- first_name: Bartosz A.
full_name: Grzybowski, Bartosz A.
last_name: Grzybowski
citation:
ama: Wei Y, Klajn R, Pinchuk AO, Grzybowski BA. Synthesis, shape control, and optical
properties of hybrid Au/Fe3O4 “nanoflowers.” Small. 2008;4(10):1635-1639.
doi:10.1002/smll.200800511
apa: Wei, Y., Klajn, R., Pinchuk, A. O., & Grzybowski, B. A. (2008). Synthesis,
shape control, and optical properties of hybrid Au/Fe3O4 “nanoflowers.” Small.
Wiley. https://doi.org/10.1002/smll.200800511
chicago: Wei, Yanhu, Rafal Klajn, Anatoliy O. Pinchuk, and Bartosz A. Grzybowski.
“Synthesis, Shape Control, and Optical Properties of Hybrid Au/Fe3O4 ‘Nanoflowers.’”
Small. Wiley, 2008. https://doi.org/10.1002/smll.200800511.
ieee: Y. Wei, R. Klajn, A. O. Pinchuk, and B. A. Grzybowski, “Synthesis, shape control,
and optical properties of hybrid Au/Fe3O4 ‘nanoflowers,’” Small, vol. 4,
no. 10. Wiley, pp. 1635–1639, 2008.
ista: Wei Y, Klajn R, Pinchuk AO, Grzybowski BA. 2008. Synthesis, shape control,
and optical properties of hybrid Au/Fe3O4 “nanoflowers”. Small. 4(10), 1635–1639.
mla: Wei, Yanhu, et al. “Synthesis, Shape Control, and Optical Properties of Hybrid
Au/Fe3O4 ‘Nanoflowers.’” Small, vol. 4, no. 10, Wiley, 2008, pp. 1635–39,
doi:10.1002/smll.200800511.
short: Y. Wei, R. Klajn, A.O. Pinchuk, B.A. Grzybowski, Small 4 (2008) 1635–1639.
date_created: 2023-08-01T10:30:42Z
date_published: 2008-10-09T00:00:00Z
date_updated: 2023-08-08T11:14:50Z
day: '09'
doi: 10.1002/smll.200800511
extern: '1'
external_id:
pmid:
- '18636405'
intvolume: ' 4'
issue: '10'
keyword:
- Biomaterials
- Biotechnology
- General Materials Science
- General Chemistry
language:
- iso: eng
month: '10'
oa_version: None
page: 1635-1639
pmid: 1
publication: Small
publication_identifier:
eissn:
- 1613-6829
issn:
- 1613-6810
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Synthesis, shape control, and optical properties of hybrid Au/Fe3O4 “nanoflowers”
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 4
year: '2008'
...
---
_id: '13423'
abstract:
- lang: eng
text: Supraspheres (SS) composed of hundreds to thousands of metal nanoparticles
(NPs) and crosslinked by dithiol linkers are assembled into larger structures,
which are subsequently converted into nanoporous metals (NMs). Conversion is achieved
by heating which removes organic molecules stabilizing the NPs and allows for
NP fusion. Heating of SS solutions leads to NMs of overall macroscopic dimensions;
localized radiation using collimated electron beam is used to prepare metallized
surface micropatterns. Depending on the composition of supraspherical precursors,
nanoporous materials composed of up to three metals can be obtained. Strategies
for controlling pore size and nanoscale surface roughness of these materials are
discussed.
article_processing_charge: No
article_type: original
author:
- first_name: Rafal
full_name: Klajn, Rafal
id: 8e84690e-1e48-11ed-a02b-a1e6fb8bb53b
last_name: Klajn
- first_name: Timothy P.
full_name: Gray, Timothy P.
last_name: Gray
- first_name: Paul J.
full_name: Wesson, Paul J.
last_name: Wesson
- first_name: Benjamin D.
full_name: Myers, Benjamin D.
last_name: Myers
- first_name: Vinayak P.
full_name: Dravid, Vinayak P.
last_name: Dravid
- first_name: Stoyan K.
full_name: Smoukov, Stoyan K.
last_name: Smoukov
- first_name: Bartosz A.
full_name: Grzybowski, Bartosz A.
last_name: Grzybowski
citation:
ama: Klajn R, Gray TP, Wesson PJ, et al. Bulk synthesis and surface patterning of
nanoporous metals and alloys from supraspherical nanoparticle aggregates. Advanced
Functional Materials. 2008;18(18):2763-2769. doi:10.1002/adfm.200800293
apa: Klajn, R., Gray, T. P., Wesson, P. J., Myers, B. D., Dravid, V. P., Smoukov,
S. K., & Grzybowski, B. A. (2008). Bulk synthesis and surface patterning of
nanoporous metals and alloys from supraspherical nanoparticle aggregates. Advanced
Functional Materials. Wiley. https://doi.org/10.1002/adfm.200800293
chicago: Klajn, Rafal, Timothy P. Gray, Paul J. Wesson, Benjamin D. Myers, Vinayak
P. Dravid, Stoyan K. Smoukov, and Bartosz A. Grzybowski. “Bulk Synthesis and Surface
Patterning of Nanoporous Metals and Alloys from Supraspherical Nanoparticle Aggregates.”
Advanced Functional Materials. Wiley, 2008. https://doi.org/10.1002/adfm.200800293.
ieee: R. Klajn et al., “Bulk synthesis and surface patterning of nanoporous
metals and alloys from supraspherical nanoparticle aggregates,” Advanced Functional
Materials, vol. 18, no. 18. Wiley, pp. 2763–2769, 2008.
ista: Klajn R, Gray TP, Wesson PJ, Myers BD, Dravid VP, Smoukov SK, Grzybowski BA.
2008. Bulk synthesis and surface patterning of nanoporous metals and alloys from
supraspherical nanoparticle aggregates. Advanced Functional Materials. 18(18),
2763–2769.
mla: Klajn, Rafal, et al. “Bulk Synthesis and Surface Patterning of Nanoporous Metals
and Alloys from Supraspherical Nanoparticle Aggregates.” Advanced Functional
Materials, vol. 18, no. 18, Wiley, 2008, pp. 2763–69, doi:10.1002/adfm.200800293.
short: R. Klajn, T.P. Gray, P.J. Wesson, B.D. Myers, V.P. Dravid, S.K. Smoukov,
B.A. Grzybowski, Advanced Functional Materials 18 (2008) 2763–2769.
date_created: 2023-08-01T10:30:57Z
date_published: 2008-09-23T00:00:00Z
date_updated: 2023-08-08T11:16:28Z
day: '23'
doi: 10.1002/adfm.200800293
extern: '1'
intvolume: ' 18'
issue: '18'
keyword:
- Electrochemistry
- Condensed Matter Physics
- Biomaterials
- Electronic
- Optical and Magnetic Materials
language:
- iso: eng
month: '09'
oa_version: None
page: 2763-2769
publication: Advanced Functional Materials
publication_identifier:
eissn:
- 1616-3028
issn:
- 1616-301X
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Bulk synthesis and surface patterning of nanoporous metals and alloys from
supraspherical nanoparticle aggregates
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 18
year: '2008'
...
---
_id: '1460'
abstract:
- lang: eng
text: 'We calculate the E-polynomials of certain twisted GL(n,ℂ)-character varieties
Mn of Riemann surfaces by counting points over finite fields using the character
table of the finite group of Lie-type GL(n, q) and a theorem proved in the appendix
by N. Katz. We deduce from this calculation several geometric results, for example,
the value of the topological Euler characteristic of the associated PGL(n,ℂ)-character
variety. The calculation also leads to several conjectures about the cohomology
of Mn: an explicit conjecture for its mixed Hodge polynomial; a conjectured curious
hard Lefschetz theorem and a conjecture relating the pure part to absolutely indecomposable
representations of a certain quiver. We prove these conjectures for n=2.'
acknowledgement: The first author was supported by NSF grants DMS-0305505 and DMS-
0604775 an Alfred Sloan Fellowship and a Royal Society University Research Fellowship.
The second author was supported by an NSF grant DMS-0200605.
author:
- first_name: Tamas
full_name: Tamas Hausel
id: 4A0666D8-F248-11E8-B48F-1D18A9856A87
last_name: Hausel
- first_name: Fernando
full_name: Rodríguez Villegas, Fernando
last_name: Rodríguez Villegas
citation:
ama: 'Hausel T, Rodríguez Villegas F. Mixed Hodge polynomials of character varieties:
With an appendix by Nicholas M. Katz. Inventiones Mathematicae. 2008;174(3):555-624.
doi:10.1007/s00222-008-0142-x'
apa: 'Hausel, T., & Rodríguez Villegas, F. (2008). Mixed Hodge polynomials of
character varieties: With an appendix by Nicholas M. Katz. Inventiones Mathematicae.
Springer. https://doi.org/10.1007/s00222-008-0142-x'
chicago: 'Hausel, Tamás, and Fernando Rodríguez Villegas. “Mixed Hodge Polynomials
of Character Varieties: With an Appendix by Nicholas M. Katz.” Inventiones
Mathematicae. Springer, 2008. https://doi.org/10.1007/s00222-008-0142-x.'
ieee: 'T. Hausel and F. Rodríguez Villegas, “Mixed Hodge polynomials of character
varieties: With an appendix by Nicholas M. Katz,” Inventiones Mathematicae,
vol. 174, no. 3. Springer, pp. 555–624, 2008.'
ista: 'Hausel T, Rodríguez Villegas F. 2008. Mixed Hodge polynomials of character
varieties: With an appendix by Nicholas M. Katz. Inventiones Mathematicae. 174(3),
555–624.'
mla: 'Hausel, Tamás, and Fernando Rodríguez Villegas. “Mixed Hodge Polynomials of
Character Varieties: With an Appendix by Nicholas M. Katz.” Inventiones Mathematicae,
vol. 174, no. 3, Springer, 2008, pp. 555–624, doi:10.1007/s00222-008-0142-x.'
short: T. Hausel, F. Rodríguez Villegas, Inventiones Mathematicae 174 (2008) 555–624.
date_created: 2018-12-11T11:52:09Z
date_published: 2008-12-01T00:00:00Z
date_updated: 2021-01-12T06:50:54Z
day: '01'
doi: 10.1007/s00222-008-0142-x
extern: 1
intvolume: ' 174'
issue: '3'
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/math/0612668
month: '12'
oa: 1
page: 555 - 624
publication: Inventiones Mathematicae
publication_status: published
publisher: Springer
publist_id: '5732'
quality_controlled: 0
status: public
title: 'Mixed Hodge polynomials of character varieties: With an appendix by Nicholas
M. Katz'
type: journal_article
volume: 174
year: '2008'
...
---
OA_place: repository
OA_type: green
_id: '18032'
abstract:
- lang: eng
text: A comprehensive review is presented of single-molecule junction conductance
measurements across families of molecules measured while breaking a gold point
contact in a solution of molecules with amine end groups. A theoretical framework
unifies the picture for the amine–gold link bonding and the tunnel coupling through
the junction using density functional theory based calculations. The reproducible
electrical characteristics and utility for many molecules is shown to result from
the selective binding between the gold electrodes and amine link groups through
a donor–acceptor bond to undercoordinated gold atoms. While the bond energy is
modest, the maximum force sustained by the junction is comparable to, but less
than, that required to break gold point contacts. The calculated tunnel coupling
provides conductance trends for all 41 molecule measurements presented here, as
well as insight into the variability of conductance due to the conformational
changes within molecules with torsional degrees of freedom. The calculated trends
agree to within a factor of 2 with the measured values for conductance ranging
from 10−7G0 to 10−2G0, where G0 is the quantum of conductance (2e2/h).
article_number: '374115'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Mark S
full_name: Hybertsen, Mark S
last_name: Hybertsen
- first_name: Latha
full_name: Venkataraman, Latha
id: 9ebb78a5-cc0d-11ee-8322-fae086a32caf
last_name: Venkataraman
orcid: 0000-0002-6957-6089
- first_name: Jennifer E
full_name: Klare, Jennifer E
last_name: Klare
- first_name: Adam C
full_name: Whalley, Adam C
last_name: Whalley
- first_name: Michael L
full_name: Steigerwald, Michael L
last_name: Steigerwald
- first_name: Colin
full_name: Nuckolls, Colin
last_name: Nuckolls
citation:
ama: 'Hybertsen MS, Venkataraman L, Klare JE, Whalley AC, Steigerwald ML, Nuckolls
C. Amine-linked single-molecule circuits: Systematic trends across molecular families.
Journal of Physics: Condensed Matter. 2008;20(37). doi:10.1088/0953-8984/20/37/374115'
apa: 'Hybertsen, M. S., Venkataraman, L., Klare, J. E., Whalley, A. C., Steigerwald,
M. L., & Nuckolls, C. (2008). Amine-linked single-molecule circuits: Systematic
trends across molecular families. Journal of Physics: Condensed Matter.
IOP Publishing. https://doi.org/10.1088/0953-8984/20/37/374115'
chicago: 'Hybertsen, Mark S, Latha Venkataraman, Jennifer E Klare, Adam C Whalley,
Michael L Steigerwald, and Colin Nuckolls. “Amine-Linked Single-Molecule Circuits:
Systematic Trends across Molecular Families.” Journal of Physics: Condensed
Matter. IOP Publishing, 2008. https://doi.org/10.1088/0953-8984/20/37/374115.'
ieee: 'M. S. Hybertsen, L. Venkataraman, J. E. Klare, A. C. Whalley, M. L. Steigerwald,
and C. Nuckolls, “Amine-linked single-molecule circuits: Systematic trends across
molecular families,” Journal of Physics: Condensed Matter, vol. 20, no.
37. IOP Publishing, 2008.'
ista: 'Hybertsen MS, Venkataraman L, Klare JE, Whalley AC, Steigerwald ML, Nuckolls
C. 2008. Amine-linked single-molecule circuits: Systematic trends across molecular
families. Journal of Physics: Condensed Matter. 20(37), 374115.'
mla: 'Hybertsen, Mark S., et al. “Amine-Linked Single-Molecule Circuits: Systematic
Trends across Molecular Families.” Journal of Physics: Condensed Matter,
vol. 20, no. 37, 374115, IOP Publishing, 2008, doi:10.1088/0953-8984/20/37/374115.'
short: 'M.S. Hybertsen, L. Venkataraman, J.E. Klare, A.C. Whalley, M.L. Steigerwald,
C. Nuckolls, Journal of Physics: Condensed Matter 20 (2008).'
date_created: 2024-09-09T14:23:37Z
date_published: 2008-08-26T00:00:00Z
date_updated: 2025-01-03T10:50:09Z
day: '26'
doi: 10.1088/0953-8984/20/37/374115
extern: '1'
external_id:
arxiv:
- '0803.0582'
pmid:
- '21694422'
intvolume: ' 20'
issue: '37'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/0803.0582
month: '08'
oa: 1
oa_version: Preprint
pmid: 1
publication: 'Journal of Physics: Condensed Matter'
publication_identifier:
eissn:
- 1361-648X
issn:
- 0953-8984
publication_status: published
publisher: IOP Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Amine-linked single-molecule circuits: Systematic trends across molecular
families'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 20
year: '2008'
...
---
OA_type: closed access
_id: '18033'
abstract:
- lang: eng
text: We measure the conductance of over 30 amine terminated molecules by breaking
Au point-contacts in a molecular solution at room temperature. We find that the
variability of the observed conductance for the diamine molecule-Au junctions
is much less than the variability for diisonitrile and dithiol-Au junctions. This
narrow distribution enables unambiguous conductance measurements of single molecules.
For an alkane diamine series with 2-8 carbon atoms in the hydrocarbon chain and
for polyphenyl diamine with 1-3 benzene rings, our results show that conductance
decreases exponentially with length. For biphenyl diamines with different substituents
that alter the phenyl-phenyl dihedral angle, we find that the conductance decreases
with increasing twist angle, following a cosine squared dependence. Finally, for
a series of substituted benzene diamines, we find that electron donating substituents
on the ring, which drive the occupied molecular orbitals up, increase the junction
conductance while electron withdrawing substituents have the opposite effect.
Thus for this measured series, conductance varies inversely with the calculated
ionization potential of the molecules. These results reveal that the occupied
states are closest to the gold Fermi energy, indicating that the tunneling transport
through these molecules is analogous to hole tunneling through an insulating film.
article_processing_charge: No
author:
- first_name: Latha
full_name: Venkataraman, Latha
id: 9ebb78a5-cc0d-11ee-8322-fae086a32caf
last_name: Venkataraman
orcid: 0000-0002-6957-6089
citation:
ama: 'Venkataraman L. Molecule Nanoelectronics. In: 2008 International Symposium
on VLSI Technology, Systems and Applications. IEEE; 2008:64-65. doi:10.1109/vtsa.2008.4530800'
apa: 'Venkataraman, L. (2008). Molecule Nanoelectronics. In 2008 International
Symposium on VLSI Technology, Systems and Applications (pp. 64–65). Hsinchu,
Taiwan: IEEE. https://doi.org/10.1109/vtsa.2008.4530800'
chicago: Venkataraman, Latha. “Molecule Nanoelectronics.” In 2008 International
Symposium on VLSI Technology, Systems and Applications, 64–65. IEEE, 2008.
https://doi.org/10.1109/vtsa.2008.4530800.
ieee: L. Venkataraman, “Molecule Nanoelectronics,” in 2008 International Symposium
on VLSI Technology, Systems and Applications, Hsinchu, Taiwan, 2008, pp. 64–65.
ista: Venkataraman L. 2008. Molecule Nanoelectronics. 2008 International Symposium
on VLSI Technology, Systems and Applications. VLSI-TSA; Symposium on VLSI Technology,
Systems and Applications, 64–65.
mla: Venkataraman, Latha. “Molecule Nanoelectronics.” 2008 International Symposium
on VLSI Technology, Systems and Applications, IEEE, 2008, pp. 64–65, doi:10.1109/vtsa.2008.4530800.
short: L. Venkataraman, in:, 2008 International Symposium on VLSI Technology, Systems
and Applications, IEEE, 2008, pp. 64–65.
conference:
end_date: 2008-04-23
location: Hsinchu, Taiwan
name: VLSI-TSA; Symposium on VLSI Technology, Systems and Applications
start_date: 2008-04-21
date_created: 2024-09-09T14:24:32Z
date_published: 2008-04-25T00:00:00Z
date_updated: 2025-01-03T10:55:23Z
day: '25'
doi: 10.1109/vtsa.2008.4530800
extern: '1'
language:
- iso: eng
month: '04'
oa_version: None
page: 64-65
publication: 2008 International Symposium on VLSI Technology, Systems and Applications
publication_identifier:
issn:
- 1930-885X
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Molecule Nanoelectronics
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2008'
...
---
OA_type: closed access
_id: '18034'
abstract:
- lang: eng
text: The ability to perform optical measurements on a single molecule placed between
two electrodes while also measuring the current flowing through it could herald
a new generation of experiments on molecular junctions.
article_processing_charge: No
article_type: letter_note
author:
- first_name: Latha
full_name: Venkataraman, Latha
id: 9ebb78a5-cc0d-11ee-8322-fae086a32caf
last_name: Venkataraman
orcid: 0000-0002-6957-6089
citation:
ama: Venkataraman L. Seeing is believing. Nature Nanotechnology. 2008;3(4):187-188.
doi:10.1038/nnano.2008.81
apa: Venkataraman, L. (2008). Seeing is believing. Nature Nanotechnology.
Springer Nature. https://doi.org/10.1038/nnano.2008.81
chicago: Venkataraman, Latha. “Seeing Is Believing.” Nature Nanotechnology.
Springer Nature, 2008. https://doi.org/10.1038/nnano.2008.81.
ieee: L. Venkataraman, “Seeing is believing,” Nature Nanotechnology, vol.
3, no. 4. Springer Nature, pp. 187–188, 2008.
ista: Venkataraman L. 2008. Seeing is believing. Nature Nanotechnology. 3(4), 187–188.
mla: Venkataraman, Latha. “Seeing Is Believing.” Nature Nanotechnology, vol.
3, no. 4, Springer Nature, 2008, pp. 187–88, doi:10.1038/nnano.2008.81.
short: L. Venkataraman, Nature Nanotechnology 3 (2008) 187–188.
date_created: 2024-09-09T14:26:30Z
date_published: 2008-04-01T00:00:00Z
date_updated: 2025-01-03T10:57:41Z
day: '01'
doi: 10.1038/nnano.2008.81
extern: '1'
external_id:
pmid:
- '18654498'
intvolume: ' 3'
issue: '4'
language:
- iso: eng
month: '04'
oa_version: None
page: 187-188
pmid: 1
publication: Nature Nanotechnology
publication_identifier:
eissn:
- 1748-3395
issn:
- 1748-3387
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Seeing is believing
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 3
year: '2008'
...
---
_id: '1826'
abstract:
- lang: eng
text: Proliferating cell populations at steady-state growth often exhibit broad
protein distributions with exponential tails. The sources of this variation and
its universality are of much theoretical interest. Here we address the problem
by asymptotic analysis of the population balance equation. We show that the steady-state
distribution tail is determined by a combination of protein production and cell
division and is insensitive to other model details. Under general conditions this
tail is exponential with a dependence on parameters consistent with experiment.
We discuss the conditions for this effect to be dominant over other sources of
variation and the relation to experiments.
author:
- first_name: Tamar
full_name: Tamar Friedlander
id: 36A5845C-F248-11E8-B48F-1D18A9856A87
last_name: Friedlander
- first_name: Naama
full_name: Brenner, Naama
last_name: Brenner
citation:
ama: Friedlander T, Brenner N. Cellular properties and population asymptotics in
the population balance equation. Physical Review Letters. 2008;101(1).
doi:10.1103/PhysRevLett.101.018104
apa: Friedlander, T., & Brenner, N. (2008). Cellular properties and population
asymptotics in the population balance equation. Physical Review Letters.
American Physical Society. https://doi.org/10.1103/PhysRevLett.101.018104
chicago: Friedlander, Tamar, and Naama Brenner. “Cellular Properties and Population
Asymptotics in the Population Balance Equation.” Physical Review Letters.
American Physical Society, 2008. https://doi.org/10.1103/PhysRevLett.101.018104.
ieee: T. Friedlander and N. Brenner, “Cellular properties and population asymptotics
in the population balance equation,” Physical Review Letters, vol. 101,
no. 1. American Physical Society, 2008.
ista: Friedlander T, Brenner N. 2008. Cellular properties and population asymptotics
in the population balance equation. Physical Review Letters. 101(1).
mla: Friedlander, Tamar, and Naama Brenner. “Cellular Properties and Population
Asymptotics in the Population Balance Equation.” Physical Review Letters,
vol. 101, no. 1, American Physical Society, 2008, doi:10.1103/PhysRevLett.101.018104.
short: T. Friedlander, N. Brenner, Physical Review Letters 101 (2008).
date_created: 2018-12-11T11:54:13Z
date_published: 2008-07-01T00:00:00Z
date_updated: 2021-01-12T06:53:27Z
day: '01'
doi: 10.1103/PhysRevLett.101.018104
extern: 1
intvolume: ' 101'
issue: '1'
main_file_link:
- open_access: '0'
url: http://arxiv.org/abs/0804.4804
month: '07'
publication: Physical Review Letters
publication_status: published
publisher: American Physical Society
publist_id: '5280'
quality_controlled: 0
status: public
title: Cellular properties and population asymptotics in the population balance equation
type: journal_article
volume: 101
year: '2008'
...
---
_id: '18337'
abstract:
- lang: eng
text: Matching of rigid shapes is an important problem in numerous applications
across the boundary of computer vision, pattern recognition and computer graphics
communities. A particularly challenging setting of this problem is partial matching,
where the two shapes are dissimilar in general, but have significant similar parts.
In this paper, we show a rigorous approach allowing to find matching parts of
rigid shapes with controllable size and regularity. The regularity term we use
is similar to the spirit of the Mumford-Shah functional, extended to non-Euclidean
spaces. Numerical experiments show that the regularized partial matching produces
better results compared to the non-regularized one.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: Michael M.
full_name: Bronstein, Michael M.
last_name: Bronstein
citation:
ama: 'Bronstein AM, Bronstein MM. Regularized partial matching of rigid shapes.
In: 10th European Conference on Computer Vision. Vol 5303. Springer Berlin
Heidelberg; 2008:143-154. doi:10.1007/978-3-540-88688-4_11'
apa: 'Bronstein, A. M., & Bronstein, M. M. (2008). Regularized partial matching
of rigid shapes. In 10th European Conference on Computer Vision (Vol. 5303,
pp. 143–154). Marseille, France: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-88688-4_11'
chicago: Bronstein, Alex M., and Michael M. Bronstein. “Regularized Partial Matching
of Rigid Shapes.” In 10th European Conference on Computer Vision, 5303:143–54.
Springer Berlin Heidelberg, 2008. https://doi.org/10.1007/978-3-540-88688-4_11.
ieee: A. M. Bronstein and M. M. Bronstein, “Regularized partial matching of rigid
shapes,” in 10th European Conference on Computer Vision, Marseille, France,
2008, vol. 5303, pp. 143–154.
ista: 'Bronstein AM, Bronstein MM. 2008. Regularized partial matching of rigid shapes.
10th European Conference on Computer Vision. ECCV: European Conference on Computer
Vision, LNCS, vol. 5303, 143–154.'
mla: Bronstein, Alex M., and Michael M. Bronstein. “Regularized Partial Matching
of Rigid Shapes.” 10th European Conference on Computer Vision, vol. 5303,
Springer Berlin Heidelberg, 2008, pp. 143–54, doi:10.1007/978-3-540-88688-4_11.
short: A.M. Bronstein, M.M. Bronstein, in:, 10th European Conference on Computer
Vision, Springer Berlin Heidelberg, 2008, pp. 143–154.
conference:
end_date: 2008-10-18
location: Marseille, France
name: 'ECCV: European Conference on Computer Vision'
start_date: 2008-10-12
date_created: 2024-10-15T11:20:54Z
date_published: 2008-11-01T00:00:00Z
date_updated: 2024-11-18T10:22:43Z
day: '01'
doi: 10.1007/978-3-540-88688-4_11
extern: '1'
intvolume: ' 5303'
language:
- iso: eng
month: '11'
oa_version: None
page: 143-154
publication: 10th European Conference on Computer Vision
publication_identifier:
eisbn:
- '9783540886884'
eissn:
- 0302-9743
isbn:
- '9783540886853'
issn:
- 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
quality_controlled: '1'
scopus_import: '1'
status: public
title: Regularized partial matching of rigid shapes
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 5303
year: '2008'
...
---
OA_type: closed access
_id: '18355'
abstract:
- lang: eng
text: 'Analysis of deformable two-dimensional shapes is an important problem, encountered
in numerous pattern recognition, computer vision and computer graphics applications.
In this paper, we address three major problems in the analysis of non-rigid shapes:
similarity, partial similarity, and correspondence. We present an axiomatic construction
of similarity criteria for deformation-invariant shape comparison, based on intrinsic
geometric properties of the shapes, and show that such criteria are related to
the Gromov-Hausdorff distance. Next, we extend the problem of similarity computation
to shapes which have similar parts but are dissimilar when considered as a whole,
and present a construction of set-valued distances, based on the notion of Pareto
optimality. Finally, we show that the correspondence between non-rigid shapes
can be obtained as a byproduct of the non-rigid similarity problem. As a numerical
framework, we use the generalized multidimensional scaling (GMDS) method, which
is the numerical core of the three problems addressed in this paper.'
article_processing_charge: No
article_type: original
author:
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: Michael M.
full_name: Bronstein, Michael M.
last_name: Bronstein
- first_name: Alfred M.
full_name: Bruckstein, Alfred M.
last_name: Bruckstein
- first_name: Ron
full_name: Kimmel, Ron
last_name: Kimmel
citation:
ama: Bronstein AM, Bronstein MM, Bruckstein AM, Kimmel R. Analysis of two-dimensional
non-rigid shapes. International Journal of Computer Vision. 2008;78:67-88.
doi:10.1007/s11263-007-0078-4
apa: Bronstein, A. M., Bronstein, M. M., Bruckstein, A. M., & Kimmel, R. (2008).
Analysis of two-dimensional non-rigid shapes. International Journal of Computer
Vision. Springer Nature. https://doi.org/10.1007/s11263-007-0078-4
chicago: Bronstein, Alex M., Michael M. Bronstein, Alfred M. Bruckstein, and Ron
Kimmel. “Analysis of Two-Dimensional Non-Rigid Shapes.” International Journal
of Computer Vision. Springer Nature, 2008. https://doi.org/10.1007/s11263-007-0078-4.
ieee: A. M. Bronstein, M. M. Bronstein, A. M. Bruckstein, and R. Kimmel, “Analysis
of two-dimensional non-rigid shapes,” International Journal of Computer Vision,
vol. 78. Springer Nature, pp. 67–88, 2008.
ista: Bronstein AM, Bronstein MM, Bruckstein AM, Kimmel R. 2008. Analysis of two-dimensional
non-rigid shapes. International Journal of Computer Vision. 78, 67–88.
mla: Bronstein, Alex M., et al. “Analysis of Two-Dimensional Non-Rigid Shapes.”
International Journal of Computer Vision, vol. 78, Springer Nature, 2008,
pp. 67–88, doi:10.1007/s11263-007-0078-4.
short: A.M. Bronstein, M.M. Bronstein, A.M. Bruckstein, R. Kimmel, International
Journal of Computer Vision 78 (2008) 67–88.
date_created: 2024-10-15T11:20:54Z
date_published: 2008-06-01T00:00:00Z
date_updated: 2024-10-22T07:22:49Z
day: '01'
doi: 10.1007/s11263-007-0078-4
extern: '1'
intvolume: ' 78'
language:
- iso: eng
month: '06'
oa_version: None
page: 67-88
publication: International Journal of Computer Vision
publication_identifier:
issn:
- 0920-5691
- 1573-1405
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Analysis of two-dimensional non-rigid shapes
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 78
year: '2008'
...