In thesis, we design a new orthogonal complementary codes- columnwise complementary codes. Its advantage is: (1)As traditional orthogonal complementary codes, it has perfect orthogonal complementary property of auto-correlation and cross-correlation. (2)We can choose different type of columnwise complementary codes to restrain frequency selective fading and time selective fading. (3)Compared with complete complementary codes, it can support more users. (4)The generating method of columnwise complementary codes is easy to understand. (5)It can be used in multi-rate transmission system. (6)The generality: complete complementary codes and 2D OVSF codes are subsets of columnwise complementary codes. We also discuss its bit error rate in a frequency selective Rayleigh fading channel and a time selective fading channel by computer simulation.

Differential space time block coding is a technology that combining traditional space time block coding and differential coding. Differential space time block coding could exploit full spatial diversity gain where the channel state information is not known. Each user in CC-CDMA system is assigned a fold of codes which sent via different carriers to reconstruct perfect auto-correlation and cross-correlation function. Complete Complementary codes could offer MAI-free and MI-free operation for DS-spreading. In this thesis we combine differential space time block coding and CC-CDMA, and discuss the character of the system.

No description available.

This report explains what Quick Response Codes are, their history and how they work. It introduces and compares several alternative ways, in addition to QR codes, for consumers to initiate the mobile communication process. Actual use of QR codes in print advertising, outdoor advertising, product packaging and other mediums exemplify how advertisers can use QR codes to integrate traditional media with interactive media, how users respond and interact with QR codes, and how they can be used effectively and creatively in today’s emerging media landscape. / text

Purpose: The purpose of this study is to present an overview of the Swedish listed companies and their compliance with the Code and its normative rules for independent decision-making.  Methodology: The authors have read and delved into the Swedish Code of Corporate Governance. The authors have chosen to study the enforcement of the code based on independent bracing guidelines. The study was conducted through a combined quantitative and qualitative approach. The study is based on primary data collected in the form of companies' corporate governance reports, which have been supplemented by structured interviews. Frame of reference: Swedish ownership structure and concentrated ownership, self regulation and normative guidelines, institutional theory and earlier research on this topic. Empirical foundations: A comparison of the selected companies has been based on the independence rules of the Swedish Code of Corporate Governance. A specific company has been presented with the company's application of the code, interviews have also been done with this company to increase the understanding of the empirical basis further. Conclusions: There are several flaws with the code and how it is applied today. The Code is complied with in an inadequate manner, and in some cases not complied with at all. The authors of this paper believe that the code, through normative guidelines, will not have a self-regulating effect on an independent decision-making in companies in Sweden.

No description available.

Bibliography: leaves 181-201. / ix, 201 leaves : ill. ; 30 cm. / Title page, contents and abstract only. The complete thesis in print form is available from the University Library. / This thesis investigates non-binary spread-spectrum multiple-access communications. The research considers wide generation techniques, system performance, how performance is influenced by the different properties of the codes, and how those properties relate to the code generation technqiue. The research refines the code design philosophy and investigates this by developing a novel code generation technique. / Thesis (Ph.D.)--University of Adelaide, Dept. of Electrical and Electronic Engineering, 1995?

Thesis (M.E.E.)--University of Delaware, 2008. / Principal faculty advisor: Javier Garcia-Frias, Dept. of Electrical and Computer Engineering. Includes bibliographical references.

abstract: The increasing volume and complexity of software systems and the growing demand of programming skills calls for efficient information retrieval techniques from source code documents. Programming related information seeking is often challenging for users facing constraints in knowledge and experience. Source code documents contain multi-faceted semi-structured text, having different levels of semantic information like syntax, blueprints, interfaces, flow graphs, dependencies and design patterns. Matching user queries optimally across these levels is a major challenge for information retrieval systems. Code recommendations can help information seeking and retrieval by pro-actively sampling similar examples based on the users context. These recommendations can be beneficial in improving learning via examples or improving code quality by sampling best practices or alternative implementations. In this thesis, an attempt is made to help programming related information seeking processes via pro-active code recommendations, and information retrieval processes by extracting structural-semantic information from source code. I present CodeReco, a system that recommends semantically similar Java method samples. Conventional code recommendations found in integrated development environments are primarily driven by syntactical compliance and auto-completion, whereas CodeReco is driven by similarities in use of language and structure-semantics. Methods are transformed to a vector space model and a novel metric of similarity is designed. Features in this vector space are categorized as belonging to types signature, structure, concept and language for user personalization. Offline tests show that CodeReco recommendations cover broader programming concepts and have higher conceptual similarity with their samples. A user study was conducted where users rated Java method recommendations that helped them icomplete two programming problems. 61.5% users were positive that real time method recommendations are helpful, and 50% reported this would reduce time spent in web searches. The empirical utility of CodeReco’s similarity metric on those problems was compared with a purely language based similarity metric (baseline). Baseline received higher ratings from novices, arguably due to lack of structure-semantics in their samples while seeking recommendations. / Dissertation/Thesis / Masters Thesis Computer Science 2017

Nous avons proposé des mécanismes pour mettre en œuvre la mémoïsation de fonction au niveau logiciel dans le cadre de nos efforts pour améliorer les performances du code séquentiel. Nous avons analysé le potentiel de la mémoïsation de fonction sur des applications et le gain de performance qu'elle apporte sur des architectures actuelles. Nous avons proposé trois approches - une approche simple qui s'applique au chargement et qui fonctionne pour toute fonction de bibliothèque liée dynamiquement, une approche à la compilation utilisant LLVM qui peut permettre la mémoïsation pour toute fonction du programme, ainsi qu'une proposition d'implémentation de la mémoïsation en matériel et ses avantages potentiels. Nous avons démontré avec les fonctions transcendantales que l'approche au chargement est applicable et donne un bon avantage, même avec des architectures et des compilateurs (avec la restriction qu'elle ne peut être appliquée que pour les fonctions liées dynamiquement) modernes. Notre approche à la compilation étend la portée de la mémoïsation et en augmente également les bénéfices. Cela fonctionne pour les fonctions définies par l’utilisateur ainsi que pour les fonctions de bibliothèque. Nous pouvons gérer certains types de fonctions non pures comme les fonctions avec des arguments de type pointeur et l'utilisation de variables globales. La mémoïsation en matériel abaisse encore le seuil de profitabilité de la mémoïsation et donne plus de gain de performance en moyenne. / We have proposed mechanisms to implement function memoization at a software level as part of our effort to improve sequential code performance. We have analyzed the potential of function memoization on applications and its performance gain on current architectures. We have proposed three schemes - a simple load time approach which works for any dynamically linked function, a compile time approach using LLVM framework which can enable memoization for any program function and also a hardware proposal for doing memoization in hardware and its potential benefits. Demonstration of the link time approach with transcendental functions showed that memoization is applicable and gives good benefit even under modern architectures and compilers (with the restriction that it can be applied only for dynamically linked functions). Our compile time approach extends the scope of memoization and also increases the benefit due to memoization. This works for both user defined functions as well as library functions. It can handle certain kind of non pure functions like those functions with pointer arguments and global variable usage. Hardware memoization lowers the threshold for a function to be memoized and gives more performance gain on average.