Cette thèse a pour sujet les protocoles de communication peer-to-peer asynchrones. Nous introduisons deux mesures basées sur la théorie de l'information,la Public Information Complexity (PIC) et la Multi-party Information Complexity (MIC), étudions leurs propriétés et leur relation avec d'autres mesures fondamentales en calcul distribué, telles que la communication complexity et la randomness complexity. Nous utilisons ensuite ces deux mesures pour étudier la fonction parité et la fonction disjointness. / This thesis is concerned with the study of multi-party communicationprotocols in the asynchronous message-passing peer-to-peer model. We introducetwo new information measures, the Public Information Complexity(PIC) and the Multi-party Information Complexity (MIC), study their propertiesand how they are related to other fundamental quantities in distributedcomputing such as communication complexity and randomness complexity.We then use these two measures to study the parity function and the disjointness function.

In statistical data mining research, datasets often have nonlinearity and high-dimensionality. It has become difficult to analyze such datasets in a comprehensive manner using traditional statistical methodologies. Kernel-based data mining is one of the most effective statistical methodologies to investigate a variety of problems in areas including pattern recognition, machine learning, bioinformatics, chemometrics, and statistics. In particular, statistically-sophisticated procedures that emphasize the reliability of results and computational efficiency are required for the analysis of high-dimensional data. In this dissertation, first, a novel wrapper method called SVM-ICOMP-RFE based on hybridized support vector machine (SVM) and recursive feature elimination (RFE) with information-theoretic measure of complexity (ICOMP) is introduced and developed to classify high-dimensional data sets and to carry out subset selection of the variables in the original data space for finding the best for discriminating between groups. Recursive feature elimination (RFE) ranks variables based on the information-theoretic measure of complexity (ICOMP) criterion. Second, a dual variables functional support vector machine approach is proposed. The proposed approach uses both the first and second derivatives of the degradation profiles. The modified floating search algorithm for the repeated variable selection, with newly-added degradation path points, is presented to find a few good variables while reducing the computation time for on-line implementation. Third, a two-stage scheme for the classification of near infrared (NIR) spectral data is proposed. In the first stage, the proposed multi-scale vertical energy thresholding (MSVET) procedure is used to reduce the dimension of the high-dimensional spectral data. In the second stage, a few important wavelet coefficients are selected using the proposed SVM gradient-recursive feature elimination (RFE). Fourth, a novel methodology based on a human decision making process for discriminant analysis called PDCM is proposed. The proposed methodology consists of three basic steps emulating the thinking process: perception, decision, and cognition. In these steps two concepts known as support vector machines for classification and information complexity are integrated to evaluate learning models.

In this thesis, a mixture-model cluster analysis technique under different covariance structures of the component densities is developed and presented, to capture the compactness, orientation, shape, and the volume of component clusters in one expert system to handle Gaussian high dimensional heterogeneous data sets to achieve flexibility in currently practiced cluster analysis techniques. Two approaches to parameter estimation are considered and compared; one using the Expectation-Maximization (EM) algorithm and another following a Bayesian framework using the Gibbs sampler. We develop and score several forms of the ICOMP criterion of Bozdogan (1994, 2004) as our fitness function; to choose the number of component clusters, to choose the correct component covariance matrix structure among nine candidate covariance structures, and to select the optimal parameters and the best fitting mixture-model. We demonstrate our approach on simulated datasets and a real large data set, focusing on early detection of breast cancer. We show that our approach improves the probability of classification error over the existing methods.

Cette thèse rassemble trois travaux sur la complexité d'information et sur la complexité en requête quantique. Ces domaines d'études ont pour points communs les outils mathématiques pour étudier ces complexités, c'est-à-dire les problèmes d'optimisation.Les deux premiers travaux concernent le domaine de la complexité en requête quantique, en généralisant l'important résultat suivant: dans l'article cite{LMRSS11}, leurs auteurs parviennent à caractériser la complexité en requête quantique, à l'aide de la méthode par adversaire, un programme semi-définie positif introduit par A. Ambainis dans cite{Ambainis2000}. Cependant, cette caractérisation est restreinte aux modèles à temps discret, avec une erreur bornée. Ainsi, le premier travail consiste à généraliser leur résultat aux modèles à temps continu, tandis que le second travail est une démarche, non aboutie, pour caractériser la complexité en requête quantique dans le cas exact et pour erreur non bornée.Dans ce premier travail, pour caractériser la complexité en requête quantique aux modèles à temps discret, nous adaptons la démonstration des modèles à temps discret, en construisant un algorithme en requête adiabatique universel. Le principe de cet algorithme repose sur le théorème adiabatique cite{Born1928}, ainsi qu'une solution optimale du dual de la méthode par adversaire. À noter que l'analyse du temps d'exécution de notre algorithme adiabatique est basée sur preuve qui ne nécessite pas d'écart dans le spectre de l'Hamiltonien.Dans le second travail, on souhaite caractériser la complexité en requête quantique pour une erreur non bornée ou nulle. Pour cela on reprend et améliore la méthode par adversaire, avec une approche de la mécanique lagrangienne, dans laquelle on construit un Lagrangien indiquant le nombre de requêtes nécessaires pour se déplacer dans l'espace des phases, ainsi on peut définir l'``action en requête''. Or ce lagrangien s'exprime sous la forme d'un programme semi-defini, son étude classique via les équations d'Euler-Lagrange nécessite l'utilisation du théorème de l'enveloppe, un puissant outils d'économathématiques. Le dernier travail, plus éloigné, concerne la complexité en information (et par extension la complexité en communication) pour simuler des corrélations non-locales. Ou plus précisement la quantitié d'information (selon Shannon) que doive s'échanger deux parties pour obtenir ses corrélations. Dans ce but, nous définissons une nouvelle complexité, denommée la zero information complexity IC_0, via le modèle sans communication. Cette complexité a l'avantage de s'exprimer sous la forme d'une optimization convexe. Pour les corrélations CHSH, on résout le problème d'optimisation pour le cas à une seule direction où nous retrouvons un résultat connu. Pour le scénario à deux directions, on met numériquement en évidence la validité de cette borne, et on résout une forme relaxée de IC_0 qui est un nouveau résultat. / Doctorat en Sciences de l'ingénieur et technologie / info:eu-repo/semantics/nonPublished

My study is motivated by standard setters interest in better understanding (and the gap in research as to) the effects of item complexity and disaggregation across a financial statement on users' decision processes (Bonner 2008; Glaum 2009; FASB 2010b). I examine whether complexity of an item and the method used to present the item on a financial statement influences nonprofessional investors' judgments. Specifically, I examine two issues raised concerning IAS 19 Employee Benefits. The first is to examine whether there are differences in nonprofessional investors' judgments when individual components of a complex item (defined pension cost) are disaggregated across a financial statement (the statement of comprehensive income) versus when individual components of a complex item are aggregated on the face of the same statement. Differences may arise since disaggregation across a statement provides information about how an item relates to different economic events and this information could help nonprofessional investors to better interpret and use the information in judgments. A second objective is to examine whether increasing the complexity of an already complex item affects the usefulness of information. I find that nonprofessional investors weigh higher levels of item complexity in certain judgments. Additionally, I find that when a complex item (defined pension cost) is disaggregated across a financial statement (the statement of comprehensive income) nonprofessional investors are able to acquire more information about the item and are able to more accurately understand the function of the item. This, in turn, helps the nonprofessional investors decide whether the information is useful in certain judgments.

1. Phonemes, words, clauses and sentences are not a logical necessity of language, unlike distinctive features and morphemes. 2. Despite this, such nested segmentation is very firmly present in languages and in our concepts of language description, 3. because nested segmentation and inserting redundancy on multiple levels is an efficient way to get the language signal through the burst-noise channel. 4. There are various strategies how redundancy can be added and what kind of redundancy can be added. 5. The segment delimiter is expressed by some additional information and the amount of delimiting information is independent from the length of the seg- ment it delimits. This principle can serve as a basis for a successful model for the Menzerath's relation.

本研究的主要目的是探討提供不同複雜度之產品資訊給組織採購中，不同產品知識程度的消費者，對其產品品牌選擇及品牌態度的影響。由於過去有關消費者產品知識對其購買決策影響的研究，多集中於一般消費品，對真正需要產品知識的組織採購型產品則付之闕如，因此本研究以企業採購工作群組級雷射印表機為例，探討產品資訊與產品知識的影響效果。 在組織的採購過程中，採購流程相關人員所扮演角色不同—使用者、把關者、影響者、決定者、同意者、購買者，其所具備的產品知識與考慮因素亦有差異。本研究共調查了71家公司中，394位有關採購流程的各種角色人員。研究採用在現實生活中進行之擬實驗法，以增加本研究之外部效度。實驗流程是由訪員先對每一企業中的六種角色人員進行問卷調查，以得知其產品知識、品牌態度及選購品牌意願，填寫問卷後並給予複雜的產品資訊文章或僅有簡單資訊的產品廣告，數日之後，再進行第二次問卷調查，以得知在閱讀產品資訊後，其產品知識、品牌態度及選購品牌意願的改變。 研究結果顯示，把關者、影響者及決定者的產品知識較高；非專家型的消費者雖然在閱讀資訊後產品知識顯著增加，但仍然無法與專家型的消費者相比。無論專家型或非專家型受訪者在選購雷射印表機的因素均以列印品質、售後服務和故障率低為優先，並不因其產品知識的多寡而有重視本質線索或周邊線索的不同。整體而言，複雜的產品資訊比簡單的產品資訊更能造成消費者的產品知識增加。 本研究亦發現給予非專家型消費者簡單的產品資訊，比給予複雜的產品資訊更能造成其態度改變及品牌選擇意圖的改變，此結果應是基於非專家型消費者並不具備消化吸收複雜資訊的能力，而較難受複雜資訊影響；但是給予專家型消費者不同複雜度的產品資訊則並無不同的效果。 本論文並根據前述研究結果，實際於一家代理國外品牌雷射印表機之中小企業進行實徵研究，以一款在國外評鑑優異，過去之銷售卻未盡理想的工作群組級雷射印表機為實徵產品，改變其廣告訴求，並主動提供其潛在客戶大量且態度中立的產品資訊，經過為期二個月的操作結果，該公司之此款雷射印表機銷售量得到顯著成長。 研究結果可以提供給市場上行銷資源有限之優質弱勢品牌做為參考，建議以產品資訊報導的公關方式或是透過長期提供客戶正確的產品資訊，提昇客戶的產品知識，進而產生對優質弱勢品牌的偏好。 第一章 緒論 1 第一節 研究動機 1 第二節 研究目的 3 第三節 研究對象範圍 4 第四節 產業背景 5 第二章 文獻探討 10 第一節 組織採購行為 10 一、 採購的定義 10 二、 消費者及組織購買行為之比較 18 三、 組織採購的資訊搜尋行為 20 四、 購買模式及溝通效果層級 26 第二節 產品知識 28 一、 產品知識的定義 28 二、 有關雷射印表機之產品知識定義 30 三、 本質線索及外部線索的運用 31 第三節 產品知識與資訊搜尋行為 34 一、 資訊搜尋 34 二、 產品知識與資訊搜尋行為的關係 36 三、 資訊來源認知對資訊來源的影響 38 四、 資訊搜尋的主題與供應商選擇因素的關係 39 五、 資訊來源與資訊主題的關係 41 第四節 產品知識與資訊瞭解力 43 第三章 研究方法 46 第一節 研究架構 46 第二節 研究對象與產品選擇 47 第三節 預試 48 第四節 研究設計 50 第五節 問卷設計 52 一、 第一階段問卷(參附件五)： 52 二、 第二階段問卷(參附件六)： 52 第六節 變數 53 一、 自變數： 53 二、 依變數： 53 三、 共變數： 53 第七節 分析方法 54 第四章 研究結果與分析 55 第一節 受訪者雷射印表機使用狀況 56 第二節 產品知識 59 第三節 選擇雷射印表機之考慮因素 63 第四節 受訪者目前選擇的雷射印表機品牌及品牌態度 67 第五節 受訪者閱讀提供資訊前後之態度改變 69 第六節 受訪者閱讀提供資訊前後之品牌改變 71 第七節 資訊來源 73 第八節 研究結論 75 第五章 實務應用結果 77 第一節 實徵對象與公司背景: 77 第二節 實證產品 78 第三節 進行方式 79 第四節 實證結果 81 第六章 研究結論與建議 83 第一節 結論 84 第二節 研究限制 86 第三節 建議與貢獻 87 附件 95 一.受訪公司名稱一覽表 95 二.預試問卷 97 三.廣告DM 99 四.雷射印表機規格導讀文章 100 五.第一階段問卷 104 六.第二階段問卷 110 七.國內工業採購相關行為模式研究彙整表 114 八.實際驗証中媒體刊登計劃 117 九.以往刊登了一年的廣告稿 118 十.實際驗証中廣告稿 119 / The purpose of this research is to investigate the influences of providing simple or complex information to buying center members with different levels of product effecting brand attitude or purchase decision. In previous research, most product knowledge related studies focused on consumer products. However, product knowledge is even more important for business purchase decisions. This research uses working group laser printers to explore the influences of providing product information on six decision roles of a buying center —users, gatekeepers, influencers, designers, approvers, and buyers. The research employed a field experiment to keep its external validity. The interview process involved two-waves of surveys. The first wave of questionnaires was to evaluate respondents’ original product knowledge, brand attitude, and purchase intention. After the survey, the interviewer randomly gave the respondents a document to read, either a simple DM about a laser printer or a complicated article with all important laser printer information. After several days, the second questionnaire was administrated at the appointed time to measure the changes in respondents’ product knowledge, brand attitude and purchase intention after reading the information. There were 394 respondents from 71 companies in total. The findings of this study illustrated that gatekeepers, deciders, and influencers perceived more product knowledge than the other roles did. Although novice consumers were able to gain more product knowledge than experts did after information provided, their product knowledge level still could not compare with experts. Both novices and experts selected printing quality, after-service, and reliability as the most important factors when making a purchase decision of a laser printer. Novices and experts did not utilize intrinsic or extrinsic cues differently. Overall, respondents obtain more product information from the complicated product information than the DM. It was also found that novices changed their brand preferences and purchase intention more when simple information was provided than complex information. This was explained by the idea that novice consumer might not be able absorb the complicated information as easy as the simple one. On the other hand, simple and complex information had similar effects on experts. The results of this study were applied upon a small enterprise, which is a local agency of IBM laser printers. Info20 is a workgroup laser printer model which has won the “Editors’ Choice” by PC Magazine but its sales in Taiwan could not match its quality. After changing its advertising appeals and providing prospective customers with neutral product information for 2 months, its sales had significantly increased. This research demonstrates a good example for some companies with a superior product but with a weak brand image. It is suggested that these companies may publish product evaluation reports in professional magazines or provide clients with correct product information periodically to educate prospective customers. In the long run, consumers with more product knowledge are more likely to select a product by its quality rather than by its brand name.

La théorie de l'information quantique s'est développée à une vitesse fulgurante au cours des vingt dernières années, avec des analogues et extensions des théorèmes de codage de source et de codage sur canal bruité pour la communication unidirectionnelle. Pour la communication interactive, un analogue quantique de la complexité de la communication a été développé, pour lequel les protocoles quantiques peuvent performer exponentiellement mieux que les meilleurs protocoles classiques pour certaines tâches classiques. Cependant, l'information quantique est beaucoup plus sensible au bruit que l'information classique. Il est donc impératif d'utiliser les ressources quantiques à leur plein potentiel. Dans cette thèse, nous étudions les protocoles quantiques interactifs du point de vue de la théorie de l'information et étudions les analogues du codage de source et du codage sur canal bruité. Le cadre considéré est celui de la complexité de la communication: Alice et Bob veulent faire un calcul quantique biparti tout en minimisant la quantité de communication échangée, sans égard au coût des calculs locaux. Nos résultats sont séparés en trois chapitres distincts, qui sont organisés de sorte à ce que chacun puisse être lu indépendamment. Étant donné le rôle central qu'elle occupe dans le contexte de la compression interactive, un chapitre est dédié à l'étude de la tâche de la redistribution d'état quantique. Nous prouvons des bornes inférieures sur les coûts de communication nécessaires dans un contexte interactif. Nous prouvons également des bornes atteignables avec un seul message, dans un contexte d'usage unique. Dans un chapitre subséquent, nous définissons une nouvelle notion de complexité de l'information quantique. Celle-ci caractérise la quantité d'information, plutôt que de communication, qu'Alice et Bob doivent échanger pour calculer une tâche bipartie. Nous prouvons beaucoup de propriétés structurelles pour cette quantité, et nous lui donnons une interprétation opérationnelle en tant que complexité de la communication quantique amortie. Dans le cas particulier d'entrées classiques, nous donnons une autre caractérisation permettant de quantifier le coût encouru par un protocole quantique qui oublie de l'information classique. Deux applications sont présentées: le premier résultat général de somme directe pour la complexité de la communication quantique à plus d'une ronde, ainsi qu'une borne optimale, à un terme polylogarithmique près, pour la complexité de la communication quantique avec un nombre de rondes limité pour la fonction « ensembles disjoints ». Dans un chapitre final, nous initions l'étude de la capacité interactive quantique pour les canaux bruités. Étant donné que les techniques pour distribuer de l'intrication sont bien étudiées, nous nous concentrons sur un modèle avec intrication préalable parfaite et communication classique bruitée. Nous démontrons que dans le cadre plus ardu des erreurs adversarielles, nous pouvons tolérer un taux d'erreur maximal de une demie moins epsilon, avec epsilon plus grand que zéro arbitrairement petit, et ce avec un taux de communication positif. Il s'ensuit que les canaux avec bruit aléatoire ayant une capacité positive pour la transmission unidirectionnelle ont une capacité positive pour la communication interactive quantique. Nous concluons avec une discussion de nos résultats et des directions futures pour ce programme de recherche sur une théorie de l'information quantique interactive. / Quantum information theory has developed tremendously over the past two decades, with analogues and extensions of the source coding and channel coding theorems for unidirectional communication. Meanwhile, for interactive communication, a quantum analogue of communication complexity has been developed, for which quantum protocols can provide exponential savings over the best possible classical protocols for some classical tasks. However, quantum information is much more sensitive to noise than classical information. It is therefore essential to make the best use possible of quantum resources. In this thesis, we take an information-theoretic point of view on interactive quantum protocols and study the interactive analogues of source compression and noisy channel coding. The setting we consider is that of quantum communication complexity: Alice and Bob want to perform some joint quantum computation while minimizing the required amount of communication. Local computation is deemed free. Our results are split into three distinct chapters, and these are organized in such a way that each can be read independently. Given its central role in the context of interactive compression, we devote a chapter to the task of quantum state redistribution. In particular, we prove lower bounds on its communication cost that are robust in the context of interactive communication. We also prove one-shot, one-message achievability bounds. In a subsequent chapter, we define a new, fully quantum notion of information cost for interactive protocols and a corresponding notion of information complexity for bipartite tasks. It characterizes how much quantum information, rather than quantum communication, Alice and Bob must exchange in order to implement a given bipartite task. We prove many structural properties for these quantities, and provide an operational interpretation for quantum information complexity as the amortized quantum communication complexity. In the special case of classical inputs, we provide an alternate characterization of information cost that provides an answer to the following question about quantum protocols: what is the cost of forgetting classical information? Two applications are presented: the first general multi-round direct-sum theorem for quantum protocols, and a tight lower bound, up to polylogarithmic terms, for the bounded-round quantum communication complexity of the disjointness function. In a final chapter, we initiate the study of the interactive quantum capacity of noisy channels. Since techniques to distribute entanglement are well-studied, we focus on a model with perfect pre-shared entanglement and noisy classical communication. We show that even in the harder setting of adversarial errors, we can tolerate a provably maximal error rate of one half minus epsilon, for an arbitrarily small epsilon greater than zero, at positive communication rates. It then follows that random noise channels with positive capacity for unidirectional transmission also have positive interactive quantum capacity. We conclude with a discussion of our results and further research directions in interactive quantum information theory.

The dissertation presents an analysis of film and photographic media as two specific information systems. It is based mainly on the system theory of Niklas Luhmann, the basis upon which film is understood as a social system. The phenomenon of film is further developed as an imaging technique in the contemporary information society and electronic culture. The work shows new forms of imaging in film, but also a comparison of imaging techniques in the photographic medium. The goal of the dissertation is to contribute to a more detailed understanding of moving images and to develop the possibilities of film, which has the potential to become a future information system. Powered by TCPDF (www.tcpdf.org)