Computational modeling is of fundamental significance in mapping possible disease spread, and designing strategies for its mitigation. Conventional contact networks implement the simulation of interactions as random occurrences, presenting public health bodies with a difficult trade off between a realistic model granularity and robust design of intervention strategies. Recently, researchers have been investigating the use of agent-based models (ABMs) to embrace the complexity of real world interactions. At the same time, theoretical approaches provide epidemiologists with general optimization models in which demographics are intrinsically simplified. The emerging study of affiliation networks and co-affiliation networks provide an alternative to such trade off. Co-affiliation networks maintain the realism innate to ABMs while reducing the complexity of contact networks into distinctively smaller k-partite graphs, were each partition represent a dimension of the social model. This dissertation studies the optimization of intervention strategies for infectious diseases, mainly distributed in school systems. First, concepts of synthetic populations and affiliation networks are extended to propose a modified algorithm for the synthetic reconstruction of populations. Second, the definition of multi-coaffiliation networks is presented as the main social model in which risk is quantified and evaluated, thereby obtaining vulnerability indications for each school in the system. Finally, maximization of the mitigation coverage and minimization of the overall cost of intervention strategies are proposed and compared, based on centrality measures.

Charles University in Prague Faculty of Social Sciences Institute of Economic Studies Bibliographic Record of a an Academic Thesis Title in the language of the thesis (as recorded in SIS) Terrorism and market risk assessment Subtitle Translation of the title into English/Czech (as recorded in SIS) Terrorism and market risk assessment Type of the Thesis Master's thesis Author: Bc. Jean Lacroix Year 2015 Advisor of the thesis Mgr Magdalena Patakova Number of pages 77 Awards Specialization Economics (CFS) Abstract in Czech Abstract in English Terrorist attacks are one of the best examples of fast evolving institutional framework. In that context investors are impacted by a lot of pieces of information in a limited period of time. This disturbs the trading behavior and consequently the distribution of returns on the period following the attack (the information was not predicted and directly affects the investment choices). The present thesis focuses on the risk aspect of such disturbances. If terrorist attacks reshape the distribution of returns, it may modify the risk measures (multivariate and univariate). The particularity of the change in distribution implies that the observed translation into financial measures of risk will not be equal among all indicators. First a distinction exists between univariate...

Approved for public release; distribution is unlimited / This thesis done in cooperation with the MOVES Institute / The Information Age empowers individuals, and affords small groups an opportunity to attack states' interests with an increasing variety of tactics and great anonymity. Current strategies to prevail against these emerging threats are inherently defensive, relying on potential adversaries to commit mistakes and engage in detectable behavior. While defensive strategies are a critical component of a complete solution set, they cede initiative to the adversary. Moreover, reactive measures are not suited to quickly suppress adversary networks through force. To address this shortfall in strategic planning, the science of networks is rapidly making clear that natural systems built over time with preferential attachment form scale-free networks. These networks are naturally resilient to failure and random attack, but carry inherent vulnerabilities in their highly connected hubs. Taking the offensive against networks is therefore an exercise in discovering and attacking such hubs. To find these hub vulnerabilities in network adversaries, this thesis proposes a strategy called Stimulus Based Discovery, which leads to rapid network mapping and then systematically improves the accuracy and validity of this map while simultaneously degrading an adversary's network cohesion. Additionally, this thesis provides a model for experimenting with Stimulus Based Discovery in a Multi-Agent System. / Lieutenant, United States Navy

Typescript (photocopy). / Digitized by Kansas Correctional Industries

The IP Multimedia Subsystem (IMS) has gone from just a step in the evolution of the GSM cellular architecture control core, to being the de-facto framework for Next Generation Network (NGN) implementations and deployments by operators world-wide, not only cellular mobile communications operators, but also fixed line, cable television, and alternative operators. With this transition from standards documents to the real world, engineers in these new multimedia communications companies need to face the task of making these new networks secure against threats and real attacks that were not a part of the previous generation of networks. We present the IMS and other competing frameworks, we analyze the security issues, we present the topic of Security Patterns, we introduce several new patterns, including the basis for a Generic Network pattern, and we apply these concepts to designing a security architecture for a fictitious 3G operator using IMS for the control core. / by Jose M. Ortiz-Villajos. / Thesis (M.S.C.S.)--Florida Atlantic University, 2009. / Includes bibliography. / Electronic reproduction. Boca Raton, Fla., 2009. Mode of access: World Wide Web.

by Chan Yuen Yan. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2000. / Includes bibliographical references (leaves 91-[97]). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Transition to a New Monetary System --- p.3 / Chapter 1.2 --- Security and Cryptography --- p.3 / Chapter 1.3 --- Electronic Cash: More than an Electronic Medium of Transaction --- p.4 / Chapter 1.4 --- Organisation of the Thesis --- p.5 / Chapter 2 --- Cryptographic Primitives --- p.7 / Chapter 2.1 --- One-way Hash Functions --- p.7 / Chapter 2.2 --- The Bit Commitment Protocol --- p.8 / Chapter 2.3 --- Secret Splitting --- p.8 / Chapter 2.4 --- Encryption / Decryption --- p.9 / Chapter 2.4.1 --- Symmetric Encryption --- p.10 / Chapter 2.4.2 --- Asymmetric Encryption --- p.10 / Chapter 2.5 --- The RSA Public Key Cryptosystem --- p.11 / Chapter 2.6 --- Blind Signature --- p.12 / Chapter 2.7 --- Cut-and-choose procotol --- p.13 / Chapter 2.8 --- The Elliptic Curve Cryptosystem (ECC) --- p.14 / Chapter 2.8.1 --- The Elliptic Curve Discrete Logarithm Problem --- p.15 / Chapter 2.8.2 --- Cryptographic Applications Implemented by ECC --- p.15 / Chapter 2.8.3 --- Analog of Diffie-Hellman Key Exchange --- p.15 / Chapter 2.8.4 --- Data Encryption [11] --- p.16 / Chapter 2.8.5 --- The ECC Digital Signature --- p.17 / Chapter 3 --- What is Money? --- p.18 / Chapter 3.1 --- Money --- p.18 / Chapter 3.1.1 --- The History of Money [17] --- p.19 / Chapter 3.1.2 --- Functions of Money --- p.20 / Chapter 3.2 --- Existing Payment Systems --- p.22 / Chapter 3.2.1 --- Cash Payments --- p.22 / Chapter 3.2.2 --- Payment through Banks --- p.22 / Chapter 3.2.3 --- Using Payment Cards --- p.23 / Chapter 4 --- Electronic Cash --- p.24 / Chapter 4.1 --- The Basic Requirements --- p.24 / Chapter 4.2 --- Basic Model of Electronic Cash --- p.25 / Chapter 4.2.1 --- Basic Protocol --- p.26 / Chapter 4.2.2 --- Modified Protocol --- p.27 / Chapter 4.2.3 --- Double Spending Prevention --- p.30 / Chapter 4.3 --- Examples of Electronic Cash --- p.31 / Chapter 4.3.1 --- eCash --- p.31 / Chapter 4.3.2 --- CAFE --- p.31 / Chapter 4.3.3 --- NetCash --- p.32 / Chapter 4.3.4 --- CyberCash --- p.32 / Chapter 4.3.5 --- Mondex --- p.33 / Chapter 4.4 --- Limitations of Electronic Cash --- p.33 / Chapter 5 --- Micropayments --- p.35 / Chapter 5.1 --- Basic Model of Micropayments --- p.36 / Chapter 5.1.1 --- Micropayments generation --- p.37 / Chapter 5.1.2 --- Spending --- p.37 / Chapter 5.1.3 --- Redemption --- p.38 / Chapter 5.2 --- Examples of Micropayments --- p.39 / Chapter 5.2.1 --- Pay Word --- p.39 / Chapter 5.2.2 --- MicroMint --- p.40 / Chapter 5.2.3 --- Millicent --- p.41 / Chapter 5.3 --- Limitations of Micropayments --- p.41 / Chapter 5.4 --- Digital Money - More then a Medium of Transaction --- p.42 / Chapter 6 --- Anonymous Micropayment Tickets --- p.45 / Chapter 6.1 --- Introduction --- p.45 / Chapter 6.2 --- Overview of the Systems --- p.46 / Chapter 6.3 --- Elliptic Curve Digital Signature --- p.48 / Chapter 6.4 --- The Micropayment Ticket Protocol --- p.49 / Chapter 6.4.1 --- The Micropayment Ticket --- p.50 / Chapter 6.4.2 --- Payment --- p.51 / Chapter 6.4.3 --- Redemption --- p.52 / Chapter 6.4.4 --- Double Spending --- p.52 / Chapter 6.5 --- Security Analysis --- p.52 / Chapter 6.5.1 --- Conditional Anonymity --- p.53 / Chapter 6.5.2 --- Lost Tickets --- p.53 / Chapter 6.5.3 --- Double Spending --- p.53 / Chapter 6.5.4 --- Collusion with Vendors --- p.53 / Chapter 6.6 --- Efficiency Analysis --- p.55 / Chapter 6.7 --- Conclusion --- p.56 / Chapter 7 --- Anonymous Electronic Voting Systems --- p.57 / Chapter 7.1 --- Introduction --- p.57 / Chapter 7.2 --- The Proposed Electronic Voting System --- p.58 / Chapter 7.2.1 --- The Proposed Election Model --- p.58 / Chapter 7.3 --- Two Cryptographic Protocols --- p.60 / Chapter 7.3.1 --- Protocol One - The Anonymous Authentication Protocol --- p.61 / Chapter 7.3.2 --- Protocol Two - Anonymous Commitment --- p.64 / Chapter 7.4 --- The Electronic Voting Protocol --- p.65 / Chapter 7.4.1 --- The Registration Phase --- p.66 / Chapter 7.4.2 --- The Polling Phase --- p.66 / Chapter 7.4.3 --- Vote-Opening Phase --- p.67 / Chapter 7.5 --- Security Analysis --- p.68 / Chapter 7.5.1 --- Basic Security Requirements --- p.68 / Chapter 7.5.2 --- Receipt-freeness --- p.71 / Chapter 7.5.3 --- Non-transferability of Voting Right --- p.72 / Chapter 7.6 --- Conclusion --- p.72 / Chapter 8 --- Anonymous Internet Access --- p.74 / Chapter 8.1 --- Introduction --- p.74 / Chapter 8.2 --- Privacy Issues of Internet Access Services --- p.75 / Chapter 8.2.1 --- Present Privacy Laws and Policies --- p.75 / Chapter 8.2.2 --- Present Anonymous Internet Services Solutions --- p.76 / Chapter 8.2.3 --- Conditional Anonymous Internet Access Services --- p.76 / Chapter 8.3 --- The Protocol --- p.77 / Chapter 8.3.1 --- ISP issues a new pass to Alice using blind signature [1] scheme --- p.77 / Chapter 8.3.2 --- Account Operations --- p.78 / Chapter 8.4 --- Modified Version with Key Escrow on User Identity --- p.79 / Chapter 8.4.1 --- Getting a new pass --- p.79 / Chapter 8.4.2 --- Account operations --- p.82 / Chapter 8.4.3 --- Identity revocation --- p.83 / Chapter 8.5 --- Security Analysis --- p.83 / Chapter 8.5.1 --- Anonymity --- p.83 / Chapter 8.5.2 --- Masquerade --- p.84 / Chapter 8.5.3 --- Alice cheats --- p.84 / Chapter 8.5.4 --- Stolen pass --- p.84 / Chapter 8.6 --- Efficiency --- p.85 / Chapter 8.6.1 --- Random number generation --- p.85 / Chapter 8.6.2 --- Signing on the pass --- p.86 / Chapter 8.6.3 --- Pass validation --- p.86 / Chapter 8.6.4 --- Identity recovery --- p.87 / Chapter 8.7 --- Conclusion --- p.87 / Chapter 9 --- Conclusion --- p.88 / Bibliography --- p.91

Ka-Lung Chong. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2000. / Includes bibliographical references (leaves 80-83). / Abstracts in English and Chinese. / Abstract --- p.i / Acknowledgments --- p.iii / Chapter 1 --- Introduction & Motivation --- p.1 / Chapter 1.1 --- Introduction --- p.1 / Chapter 1.2 --- Internet Commerce --- p.3 / Chapter 1.3 --- Motivation --- p.6 / Chapter 1.4 --- Related Work --- p.7 / Chapter 1.4.1 --- Cryptographic Techniques --- p.7 / Chapter 1.4.2 --- Internet Payment Systems --- p.9 / Chapter 1.5 --- Contribution --- p.16 / Chapter 1.6 --- Outline of the Thesis --- p.17 / Chapter 2 --- A New Payment Model --- p.19 / Chapter 2.1 --- Model Description --- p.19 / Chapter 2.2 --- Characteristics of Our Model --- p.22 / Chapter 2.3 --- Model Architecture --- p.24 / Chapter 2.4 --- Comparison --- p.30 / Chapter 2.5 --- System Implementation --- p.30 / Chapter 2.5.1 --- Acquirer Interface --- p.31 / Chapter 2.5.2 --- Issuer Interface --- p.32 / Chapter 2.5.3 --- Merchant Interface --- p.32 / Chapter 2.5.4 --- Payment Gateway Interface --- p.33 / Chapter 2.5.5 --- Payment Cancellation Interface --- p.33 / Chapter 3 --- A E-Commerce Application - TravelNet --- p.35 / Chapter 3.1 --- System Architecture --- p.35 / Chapter 3.2 --- System Features --- p.38 / Chapter 3.3 --- System Snapshots --- p.39 / Chapter 4 --- Simulation --- p.44 / Chapter 4.1 --- Objective --- p.44 / Chapter 4.2 --- Simulation Flow --- p.45 / Chapter 4.3 --- Assumptions --- p.49 / Chapter 4.4 --- Simulation of Payment Systems --- p.50 / Chapter 5 --- Discussion of Security Concerns --- p.54 / Chapter 5.1 --- Threats to Internet Payment --- p.54 / Chapter 5.1.1 --- Eavesdropping --- p.55 / Chapter 5.1.2 --- Masquerading --- p.55 / Chapter 5.1.3 --- Message Tampering --- p.56 / Chapter 5.1.4 --- Replaying --- p.56 / Chapter 5.2 --- Aspects of A Secure Internet Payment System --- p.57 / Chapter 5.2.1 --- Authentication --- p.57 / Chapter 5.2.2 --- Confidentiality --- p.57 / Chapter 5.2.3 --- Integrity --- p.58 / Chapter 5.2.4 --- Non-Repudiation --- p.58 / Chapter 5.3 --- Our System Security --- p.58 / Chapter 5.4 --- TravelNet Application Security --- p.61 / Chapter 6 --- Discussion of Performance Evaluation --- p.64 / Chapter 6.1 --- Performance Concerns --- p.64 / Chapter 6.2 --- Experiments Conducted --- p.65 / Chapter 6.2.1 --- Description --- p.65 / Chapter 6.2.2 --- Analysis on the Results --- p.65 / Chapter 6.3 --- Simulation Analysis --- p.69 / Chapter 7 --- Conclusion & Future Work --- p.72 / Chapter A --- Experiment Specification --- p.74 / Chapter A.1 --- Configuration --- p.74 / Chapter A.2 --- Experiment Results --- p.74 / Chapter B --- Simulation Specification --- p.77 / Chapter B.1 --- Parameter Listing --- p.77 / Chapter B.2 --- Simulation Results --- p.77 / Bibliography --- p.80

Lee, Pak-Ching. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2003. / Includes bibliographical references (leaves 80-83). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.1 / Chapter 2 --- Related Work --- p.5 / Chapter 3 --- Tree-Based Group Diffie-Hellman --- p.9 / Chapter 4 --- Interval-Based Distributed Rekeying Algorithms --- p.14 / Chapter 4.1 --- Rebuild Algorithm --- p.15 / Chapter 4.2 --- Batch Algorithm --- p.16 / Chapter 4.3 --- Queue-batch Algorithm --- p.19 / Chapter 5 --- Performance Evaluation --- p.22 / Chapter 5.1 --- Mathematical Analysis --- p.22 / Chapter 5.1.1 --- Analysis of the Rebuild Algorithm --- p.24 / Chapter 5.1.2 --- Analysis of the Batch Algorithm --- p.25 / Chapter 5.1.3 --- Analysis of the Queue-batch Algorithm --- p.30 / Chapter 5.2 --- Experiments --- p.31 / Chapter 5.3 --- Discussion of the experimental results --- p.35 / Chapter 6 --- Authenticated Tree-Based Group Diffie-Hellman --- p.43 / Chapter 6.1 --- Description of A-TGDH --- p.44 / Chapter 6.2 --- Security Analysis --- p.47 / Chapter 7 --- Implementation and Applications --- p.50 / Chapter 7.1 --- Leader and Sponsors --- p.51 / Chapter 7.1.1 --- Leader --- p.51 / Chapter 7.1.2 --- Sponsors --- p.53 / Chapter 7.1.3 --- Rekeying Operation --- p.56 / Chapter 7.2 --- System Architecture --- p.57 / Chapter 7.2.1 --- System Preliminaries --- p.57 / Chapter 7.2.2 --- System Components --- p.58 / Chapter 7.2.3 --- Implementation Considerations --- p.64 / Chapter 7.3 --- SGCL API --- p.65 / Chapter 7.4 --- Experiments --- p.67 / Chapter 7.5 --- Applications --- p.72 / Chapter 7.6 --- Future Extensions --- p.75 / Chapter 8 --- Conclusions and Future Directions --- p.76 / Chapter 8.1 --- Conclusions --- p.76 / Chapter 8.2 --- Future Directions --- p.77 / Chapter 8.2.1 --- Construction of a Hybrid Key Tree with the Physical and Logical Properties --- p.77 / Chapter 8.2.2 --- Extended Implementation --- p.79 / Bibliography --- p.80

在這篇論文中，我們將會首先討論什麼概率測度μ 上的L²空間會存在指數型正交基(exponential orthonormal basis) ，而μ 則稱為一個譜測度若指數型正交基存在。這個問題源於1974年的Fuglede猜想和Jorgensen與Pedersen對分形譜測度存在性的研究。我們有興趣理解怎麼樣的測度會是譜測度，而對於沒有指數型正交基的測度，我們則探討它們會否存在更廣義且在Fourier分析中常用的指數型基，如Riesz基或Fourier框架(Fourier frame) 。 / 我們知道一個測度可以唯一分解成離散、奇異和絶對連續三部份。我們首先証明譜測度肯定是純型(pure type) 。若測度是絶對連續，我們對有Fourier框架的測度的密度給出一個完全的刻直到。這個結果對研究Gabor框架的問題都有幫助。對於離散且只有有限個非零質量原子的測度，我們証明它們全都都有Riesz基。在最困難作出一般討論的奇異測度中，我們透過譜測度與離散測度的卷積找出了有Riesz基但沒有指數型正交基的奇異測度。我們進而探討自彷函數送代系統(affine IFSs) ，我們証明到如果一個自彷函數送代系統是測度分離且有Fourier框架，那麼它在每一個函數的概率權都是一樣的。我們亦証明了Laba-Wang猜想在絶對連續的自相似測度上是正確的。這些結果都表示了一個有Fourier框架的測度都應該在其支撐上有一定的均勻性。 / 在論文的第二部分我們會探討自彷tile其Fourier變換的零點集。在自彷tile的研究中，其中一個基本問題就是刻劃其數字集(digit set)使得那自彷函數送代系統的不變集能以平移密鋪空間。透過Kenyon條件，我們可將這個問題轉化成理解Fourier變換的零點集。男一方面，指數型正交基的存在性亦需要我們探討Fourier變換的零點集，而自彷tile 的Fourier變換是可以明確寫出來的。這使自彷tile成為一個很好去研究tilings和譜測度相互關係的好例子。 / 我們利用了分圓多項式(cyclotomic polynomials)對一維自彷tile的零點集進行了一個詳細的研究。從這裡我們把tile的數字集寫成某些分圓多項式的乘積。這個乘積亦可以一個樹上的切集(blocking)表示出來。這個表示亦把tile數字集的乘積形式(product-forms) 一般化成高階乘積形式。我們証明了在任何維數的tile數字集都是整數tile(即它們能平移密鋪整數集Z) 。這個結果讓我們能使用Coven和Meyerowitz所提出的整數tile分解方法，來使tile數字集完整刻劃成高階模乘積形式(high order modulo product-forms) 當數字集的數目為p[superscript α]q而p，q則是質數。由於我們對零點集亦完全清楚，這對在自彷tile上尋找完備的指數型正交基提供了一個新的方向。 / In this thesis, we will first consider when a probability measure μ admits an exponential orthonormal basis on its L² space (μ is called spectral measures).This problem originates from the conjecture of Fuglede in 1974, and the discovery of Jorgensen and Pedersen that some fractal measures also admit exponential orthonormal bases, but some do not. It generates a lot of interest in understand- ing what kind of measures are spectral measures. For those measures failing to have exponential orthonormal bases, it is interesting to know whether such mea- sures still have Riesz bases and Fourier frames, which are generalized concepts of orthonormal bases with wide range of uses in Fourier analysis. / It is well-known that a measure has a unique decomposition as the discrete, singular and absolutely continuous parts. We first show that spectral measures must be of pure type. If the measure is absolutely continuous, we completely classify the class of densities of the measures with Fourier frames. This result has new applications to topics in applied harmonic analysis, like the Gabor analysis. For the discrete measures with finite number of atoms, we show that they all have Riesz bases. For the case of singular measure, which is the most difficult one, we show that there exist measures with Riesz bases but not orthonormal bases by considering convolution between spectral measures and discrete measures. We then investigate affine iterated function systems (IFSs), we show that if an IFS has measure disjoint condition and admits a Fourier frame, then the probability weights are all equal. Moreover, we also show that the Łaba-Wang conjecture is true if the self-similar measure is absolutely continuous. These results indicate that measures with Fourier frames must have certain kind of uniformity on the support. / In the second part of the thesis we study the zero sets of Fourier transform of self-affine tiles. One of the fundamental problems in self-affine tiles is to classify the digit sets so that the attractors form tiles. This problem can be turned to study the zeros of the Fourier transform via the Kenyon criterion. On the other hand, existence of exponential orthonormal bases requires us to know the zero sets of the Fourier transform. Self-affine tiles are translational tiles arising from IFSs with its Fourier transform written explicitly. It therefore serves as an ideal place to investigate the relation of tilings and spectral measures. / We carry out a detail study in the zero sets of the one-dimensional tiles using cyclotomic polynomials. From this we characterize the tile digit sets through some product of cyclotomic polynomials represented in terms of a blocking in a tree, which is a generalization of the product-form to higher order. We show that tile digit sets in any dimension are integer tiles. This result allows us to use the decomposition method of integer tiles by Coven and Meyerowitz to provide the explicit classification of the tile digit sets in terms of the higher order modulo product-forms when number of the digits is p[superscript α]q, p, q are primes. Since the zero sets are completely known, this provides us a new approach to study the existence of complete orthogonal exponentials in the self-affine tiles on R¹. / Detailed summary in vernacular field only. / Detailed summary in vernacular field only. / Detailed summary in vernacular field only. / Detailed summary in vernacular field only. / Lai, Chun Kit. / Thesis (Ph.D.)--Chinese University of Hong Kong, 2012. / Includes bibliographical references (leaves 128-135). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Abstract also in Chinese. / Chapter 1 --- Introduction --- p.9 / Chapter 1.1 --- Background and Motivations --- p.9 / Chapter 1.2 --- Results on spectral measures --- p.13 / Chapter 1.3 --- Results on self-affine tiles --- p.16 / Chapter 2 --- Fourier Frames: Absolutely Continuous Measures --- p.21 / Chapter 2.1 --- Beurling densities --- p.22 / Chapter 2.2 --- Law of pure type --- p.28 / Chapter 2.3 --- Absolutely continuous F-spectral measures --- p.31 / Chapter 2.3.1 --- Proof by Beurling densities --- p.32 / Chapter 2.3.2 --- Proof by translational absolute continuity --- p.35 / Chapter 2.4 --- Applications to applied harmonic analysis --- p.40 / Chapter 2.5 --- Remarks and open questions --- p.42 / Chapter 3 --- Fourier Frames: Discrete and Singular Measures --- p.45 / Chapter 3.1 --- Discrete measures --- p.46 / Chapter 3.2 --- Convolutions with discrete measures --- p.50 / Chapter 3.3 --- Self-affine measures --- p.56 / Chapter 3.4 --- Iterated function systems on R¹ --- p.65 / Chapter 3.5 --- Concluding remarks --- p.70 / Chapter 4 --- Spectral structure of tile digit sets --- p.74 / Chapter 4.1 --- Preliminaries --- p.76 / Chapter 4.2 --- Modulo product-forms --- p.81 / Chapter 4.3 --- Higher order product-forms --- p.86 / Chapter 4.4 --- Φ-tree, blocking and kernel polynomials --- p.90 / Chapter 5 --- Classifications of tile digit sets --- p.101 / Chapter 5.1 --- Tile digit sets --- p.101 / Chapter 5.2 --- The p[superscript α]q[superscript β] integer tiles --- p.105 / Chapter 5.3 --- Tile digit sets for b = p[superscript α]q --- p.112 / Chapter 5.4 --- Self-similar measures: Absolute continuity --- p.122 / Chapter 5.5 --- Remarks --- p.126

Digitized by Kansas Correctional Industries