TY - CHAP
AU - May, Alexander
ID - 3014
SN - 0302-9743
T2 - Public Key Cryptography – PKC 2004
TI - Secret Exponent Attacks on RSA-type Schemes with Moduli N=p^{r}q
ER -
TY - CONF
AB - Voting via the Internet has become a feasible option for political as well as non-political ballots. However, there are many obstacles which have to be overcome, especially legal restrictions have to be transformed into technical and security solutions. The article starts with a brief presentation of advantages and disadvantages of Internet ballots and presents application fields and pilot schemes. Then, technological security aspects are derived due to democratic basic principles. Especially the applied voting procedures are critical in security terms. Hence, the most relevant cryptographic protocols are presented and their drawbacks and shortcomings are identified. However, this article does not propose a new voting protocol. Beyond fixing cryptographic procedures for ballots, more elements are to be specified, e.g. responsibilities and rights of involved authorities or security precautions regarding hardware and software. For this reason, a structural security framework for electronic voting systems is presented which can be used for their composition and analysis.
AU - Schryen, Guido
ID - 5765
T2 - 37th Annual Hawaii International Conference on System Sciences
TI - Security Aspects of Internet Voting
ER -
TY - JOUR
AU - Harteis, Christian
AU - Bauer, Johannes
AU - Festner, Dagmar
AU - Gruber, Hans
ID - 3648
IS - 2
JF - UNTERRICHTSWISSENSCHAFT.
TI - Selbstbestimmung im Arbeitsalltag
ER -
TY - BOOK
AU - Frank, Ursula
AU - Giese, Holger
AU - Klein, Florian
AU - Oberschelp, Oliver
AU - Schmidt, Andreas
AU - Schulz, Bernd
AU - Voecking, Henner
AU - Witting, Katrin
ID - 25205
TI - Selbstoptimierende Systeme des Maschinenbaus - Definitionen und Konzepte.
VL - 155
ER -
TY - CONF
AB - Design recovery, which means extracting design documents from source code, is usually done by static analysis techniques. Analysing behaviour by static analysis is very imprecise. We combine static and dynamic analysis to increase the preciseness of our design recovery process. In this paper we present an approach to collect data for the dynamic analysis by recording method calls during a program's execution. To reduce the amount of information we monitor only relevant classes and methods identified by static analysis.
AU - Wendehals, Lothar
AU - Meyer, Matthias
AU - Elsner, Andreas
ID - 20932
T2 - Proc. of the 2nd International Fujaba Days 2004, Darmstadt, Germany
TI - Selective Tracing of Java Programs
VL - tr-ri-04-253
ER -
TY - CONF
AU - Mracek, Maik
AU - Wallaschek, Jörg
AU - Hemsel, Tobias
ID - 9522
T2 - Proceedings of the 18th International Congress on Acoustics
TI - Self configuration of miniature ultrasonic linear motors
ER -
TY - JOUR
AU - Russ, M
AU - Lorke, A
AU - Reuter, Dirk
AU - Schafmeister, P
ID - 8702
JF - Physica E: Low-dimensional Systems and Nanostructures
SN - 1386-9477
TI - Self-assembled quantum dots as probes for Landau-level spectroscopy
ER -
TY - CHAP
AB - Due to their many-particle character and their application in quantum cascade lasers, optical intersubband excitations in semiconductor quantum wells have become the focus of many recent publications [1,2]. In samples of high quality,
intrinsic processes like electron-electron and electron-phonon many particle correlations determine the basic optical and transport properties such as lineshape and ultrafast dynamics. At the same time, intersubband excitations allow
the direct investigation of dynamical properties of an important model system of many particle physics - the two-dimensional electron gas. We here present a microscopic theory for the intersubband dynamics and absorption.
The calculation of absorption spectra of MQW systems is in principle composed of two parts: the determination of the polarization in a single quantum well within a density matrix approach as the source of electromagnetic radiation
(Fig. 1a) and the calculation of the generated fields in the geometry of interest (Fig. 1b) within a Green's function approach [3,4]. We will here focus on the so-called single-pass geometry (cf. Fig. 1b, [5]).
AU - Waldmüller, Ines
AU - Förstner, Jens
AU - Knorr, Andreas
ED - Morawetz, Klaus
ID - 4286
KW - tet_topic_qw
SN - 9783642057458
T2 - Nonequilibrium Physics at Short Time Scales
TI - Self-consistent Projection Operator Theory of Intersubband Absorbance in Semiconductor Quantum Wells
ER -
TY - CONF
AU - Harteis, Christian
AU - Bauer, Johannes
AU - Festner, Dagmar
AU - Gruber, Hans
ID - 3618
T2 - Current issues in adult learning and motivation. 7th Adult Education Colloquium
TI - Self-determination in daily working life
ER -
TY - CONF
AU - Liu Jing, Michelle
AU - Ruehrup, Stefan
AU - Schindelhauer, Christian
AU - Volbert, Klaus
AU - Dierkes, Martin
AU - Bellgardt, Andreas
AU - Ibers, Rüdiger
AU - Hilleringmann, Ulrich
ID - 13071
T2 - {GOR/NGB Conference Tilburg 2004}
TI - Sensor Networks with More Features Using Less Hardware
ER -
TY - JOUR
AU - Würtz, A.
AU - Deviatov, E.V.
AU - Lorke, A.
AU - Dolgopolov, V.T.
AU - Reuter, Dirk
AU - Wieck, A.D.
ID - 8703
JF - Physica E: Low-dimensional Systems and Nanostructures
SN - 1386-9477
TI - Separately contacted edge states in the fractional quantum Hall regime
ER -
TY - GEN
AU - Peckhaus, Volker
ID - 18802
T2 - Mathematical Reviews [MR 2004h.03007; online: MathSciNet 2014619]
TI - Seuren, P.A.M., The Logic of Thinking, Koninklijke Nederlandse Akademie van Wetenschappen: Amsterdam 2002 (Mededelingen van de Afdeling Letterkunde, Niewe Reeks, Deel 65, no. 9)
ER -
TY - JOUR
AU - Kolman, Petr
AU - Scheideler, Christian
ID - 2119
IS - 3
JF - Algorithmica
TI - Simple On-Line Algorithms for the Maximum Disjoint Paths Problem
ER -
TY - CONF
AU - Guo, Ping
AU - Heckel, Reiko
ID - 7928
T2 - Proceedings of the 2nd International Fujaba Days (2004), Darmstadt (Germany)
TI - Simulation and Testing of Mobile Computing Systems using Fujaba
ER -
TY - JOUR
AU - Feng, Yuanhua
ID - 4615
IS - 03
JF - Econometric Theory
SN - 0266-4666
TI - SIMULTANEOUSLY MODELING CONDITIONAL HETEROSKEDASTICITY AND SCALE CHANGE
VL - 20
ER -
TY - CONF
AU - Kao, Odej
AU - Hovestadt, Matthias
AU - Keller, Axel
ID - 1993
T2 - Proc. Advanced Research Workshop on High Perfomance Computing: Technology and Applications
TI - SLA-aware Job Migration in Grid Environments
ER -
TY - CONF
AU - Sohler, Christian
AU - Damerow, Valentina
ID - 18777
T2 - Proceedings of the 20th European Workshop on Computational Geometry (EWCG'04)
TI - Smoothed Number of Extreme Points under Uniform Noise
ER -
TY - CONF
AB - A major drawback of distributed versus terminal-based speech recognition is the fact that transmission errors can lead to degraded recognition performance. In this paper we employ soft features to mitigate the effect of bit errors on wireless transmission links: At the receiver a posteriori probabilities of the transmitted feature vectors are computed by combining bit reliability information provided by the channel decoder and a priori knowledge about residual redundancy in the feature vectors. While the first-order moment of the a posteriori probability function is the MMSE estimate, the second-order moment is a measure of the uncertainty in the reconstructed features. We conducted realistic simulations of GSM transmission and achieved significant improvements in word accuracy compared to the error mitigation strategy described in the ETSI standard.
AU - Haeb-Umbach, Reinhold
AU - Ion, Valentin
ID - 11790
T2 - International Conference on Spoken Language Processing (ICSLP 2004)
TI - Soft Features for Improved Distributed Speech Recognition over Wireless Networks
ER -
TY - CONF
AU - Belli, Fevzi
AU - Güldali, Baris
ID - 7919
T2 - Proceedings of the conference on Computer and Information Sciences (ISCIS 2004), Kemer-Antalya (Turkey)
TI - Software Testing via Model Checking
VL - 3280
ER -
TY - CONF
AB - For $c in REAL$, a $c$-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most $c$ times their geometric distance. Based on this property to approximate a complete weighted graph, sparse spanners have found many applications, e.g., in FPTAS, geometric searching, and radio networks. For geometric searching, it turned out to suffice whether the radius rather than the length of some path between any two vertices is bounded relatively to their geometric distance; this is the defining property of weak spanners. Finally regarding radio network applications, a power spanner accounts for the total energy afforded for a wireless transmission with the requirement that the sum of the squares of the lengths of some path between any two planar vertices must be bounded relatively to the square of their geometric distance (or higher powers up to 6 or even 8).

While it is known that any $c$-spanner is also both a weak $C_1$-spanner and a $C_2$-power spanner (for appropriate $C_1,C_2$ depending only on $c$ but not on the graph under consideration), we show that the converse fails: There exists a family of $c_1$-power spanners that are no weak $C$-spanners and also a family of weak $c_2$-spanners that are no $C$-spanners for any fixed $C$ (and thus no uniform spanners, either). However the deepest result of the present work reveals that, surprisingly, any weak spanner is also a uniform power spanner. We further generalize the latter notion by considering $(c,delta)$-power spanners where the sum of the $delta$-th powers of the lengths has to be bounded; so $(cdot,2)$-power spanners coincide with the usual power spanners and $(cdot,1)$-power spanners are classical spanners. Interestingly, these $(cdot,delta)$-power spanners form a strict hierarchy where the above results still hold for any $deltageq2$; some even hold for $delta>1$ while counterexamples reveal others to fail for $delta<2$. In fact we show that in general every self-similar curve of fractal dimension $d>delta$ is no $(C,delta)$-power spanner for any fixed $C$.
AU - Schindelhauer, Christian
AU - Volbert, Klaus
AU - Ziegler, Martin
ID - 18279
SN - 0302-9743
T2 - Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC'04)
TI - Spanners, Weak Spanners, and Power Spanners for Wireless Networks
VL - 3341
ER -