Lognormal random variables appear naturally in many engineering disciplines, including wireless communications, reliability theory, and finance. So, too, does the sum of (correlated) lognormal random variables. Unfortunately, no closed form probability distribution exists for such a sum, and it requires approximation. Some approximation methods date back over 80 years and most take one of two approaches, either: 1) an approximate probability distribution is derived mathematically, or 2) the sum is approximated by a single lognormal random variable. In this research, we take the latter approach and review a fairly recent approximation procedure proposed by Mehta, Wu, Molisch, and Zhang (2007), then implement it using C++. The result is applied to a discrete time model commonly encountered within the field of financial economics.
{"title":"Approximating the Sum of Correlated Lognormals: An Implementation","authors":"Christopher J. Rook, M. Kerman","doi":"10.2139/ssrn.2653337","DOIUrl":"https://doi.org/10.2139/ssrn.2653337","url":null,"abstract":"Lognormal random variables appear naturally in many engineering disciplines, including wireless communications, reliability theory, and finance. So, too, does the sum of (correlated) lognormal random variables. Unfortunately, no closed form probability distribution exists for such a sum, and it requires approximation. Some approximation methods date back over 80 years and most take one of two approaches, either: 1) an approximate probability distribution is derived mathematically, or 2) the sum is approximated by a single lognormal random variable. In this research, we take the latter approach and review a fairly recent approximation procedure proposed by Mehta, Wu, Molisch, and Zhang (2007), then implement it using C++. The result is applied to a discrete time model commonly encountered within the field of financial economics.","PeriodicalId":10688,"journal":{"name":"Computing Technologies eJournal","volume":"35 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2015-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78337621","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Recent years have seen extraordinary growth in the amount of legal scholarship and legal practice at the intersection of law and 3D printing. To help navigate this emerging field of 3D printing law, I created the accompanying Law and 3D Printing Bibliography. The published bibliography presented herein contains over 100 entries. The brief introductory comments to the published piece discuss the creation and contents of the bibliography, and provide suggestions for where one should begin their research in the area. The comments focus on (1) 3D printing’s background, (2) historical growth pattern of law and 3D printing scholarship, (3) identification of law and 3D printing scholarship, (4) closing thoughts on the future of law and 3D printing scholarship. Appendix A provides a list of recommended starting places with publications and selected court cases through 2015.
{"title":"The Law and 3D Printing","authors":"J. Tran","doi":"10.2139/SSRN.2581775","DOIUrl":"https://doi.org/10.2139/SSRN.2581775","url":null,"abstract":"Recent years have seen extraordinary growth in the amount of legal scholarship and legal practice at the intersection of law and 3D printing. To help navigate this emerging field of 3D printing law, I created the accompanying Law and 3D Printing Bibliography. The published bibliography presented herein contains over 100 entries. The brief introductory comments to the published piece discuss the creation and contents of the bibliography, and provide suggestions for where one should begin their research in the area. The comments focus on (1) 3D printing’s background, (2) historical growth pattern of law and 3D printing scholarship, (3) identification of law and 3D printing scholarship, (4) closing thoughts on the future of law and 3D printing scholarship. Appendix A provides a list of recommended starting places with publications and selected court cases through 2015.","PeriodicalId":10688,"journal":{"name":"Computing Technologies eJournal","volume":"180 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2015-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77511412","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-05-03DOI: 10.1016/j.im.2015.05.001
Jie Wei, P. Lowry, Stefan Seedorf
{"title":"The Assimilation of RFID Technology by Chinese Companies: A Technology Diffusion Perspective","authors":"Jie Wei, P. Lowry, Stefan Seedorf","doi":"10.1016/j.im.2015.05.001","DOIUrl":"https://doi.org/10.1016/j.im.2015.05.001","url":null,"abstract":"","PeriodicalId":10688,"journal":{"name":"Computing Technologies eJournal","volume":"14 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2015-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82740086","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
For business organizations, deriving sustainable competitive advantage from technology is impossible. Business analytics poses the same predicament that information technology (IT) did two decades back. The question is how to unlock the value from data on a sustainable manner. The learnings gained while building IT infrastructure, in transforming it from administrator’s toolbox to a strategic weapon, can provide the key. This article uses the strategic alignment model (Henderson and Venkatraman 1993) to argue that issues identified as important during IT adoption remains highly relevant while building capabilities for analytics.
对于商业组织来说，从技术中获得可持续的竞争优势是不可能的。业务分析所面临的困境与20年前的信息技术(IT)所面临的困境相同。问题是如何以可持续的方式从数据中释放价值。在构建IT基础设施，将其从管理员的工具箱转变为战略武器的过程中所获得的经验可以提供关键。本文使用战略一致性模型(Henderson and Venkatraman 1993)来论证在IT采用过程中确定为重要的问题在构建分析能力时仍然高度相关。
{"title":"Getting Analytics? Use What You Learnt from It","authors":"A. Bardhan","doi":"10.2139/SSRN.2574516","DOIUrl":"https://doi.org/10.2139/SSRN.2574516","url":null,"abstract":"For business organizations, deriving sustainable competitive advantage from technology is impossible. Business analytics poses the same predicament that information technology (IT) did two decades back. The question is how to unlock the value from data on a sustainable manner. The learnings gained while building IT infrastructure, in transforming it from administrator’s toolbox to a strategic weapon, can provide the key. This article uses the strategic alignment model (Henderson and Venkatraman 1993) to argue that issues identified as important during IT adoption remains highly relevant while building capabilities for analytics.","PeriodicalId":10688,"journal":{"name":"Computing Technologies eJournal","volume":"127 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2015-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75660811","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The success of ERPs installations (Enterprise Resource Planning) is a strongly debated subject. The average outcome of ERP projects seems to be “moderately successful�?. This leaves room for improvement. The question is: how do the companies organise the improvement and evolution of their ERP in the most efficient manner? For most organisations, another big installation project is out of question and the ticket-based approach is designed to deliver repairs, not improvements. Combining a review of articles published on the subject and practical lessons learned on numerous projects, the author proposes a third, novel, way: The pro-Active progressive value realisation (P2VR). P2VR solution design relies on a mix of training, IT system, business process and organizational changes. It leverages the system understanding of business people to identify optimal trade-offs as well as opportunities. It takes advantage from the fact that ERP can be modified with literally a few clicks. P2VR explicitly trades time for money, using a small team of experts and decision makers. P2VR projects follow a “climbing route�? to deliver, from the onset, a permanent, structured, stream of improvements. The steady flow of good news enhances the standing of the IT function within the company. The specific advantages of the P2VR can be seen on both the input and output side. It lowers external costs as well as optimizes use of internal resources. It creates a constant stream of benefits that improves the ROI and enhances the reputation of the IT department.
{"title":"ERPs: Beyond and Above 'Moderately Successful' Pro-Active Progressive Value Realisation","authors":"François Bonnafy","doi":"10.2139/ssrn.2624235","DOIUrl":"https://doi.org/10.2139/ssrn.2624235","url":null,"abstract":"The success of ERPs installations (Enterprise Resource Planning) is a strongly debated subject. The average outcome of ERP projects seems to be “moderately successful�?. This leaves room for improvement. The question is: how do the companies organise the improvement and evolution of their ERP in the most efficient manner? For most organisations, another big installation project is out of question and the ticket-based approach is designed to deliver repairs, not improvements. Combining a review of articles published on the subject and practical lessons learned on numerous projects, the author proposes a third, novel, way: The pro-Active progressive value realisation (P2VR). P2VR solution design relies on a mix of training, IT system, business process and organizational changes. It leverages the system understanding of business people to identify optimal trade-offs as well as opportunities. It takes advantage from the fact that ERP can be modified with literally a few clicks. P2VR explicitly trades time for money, using a small team of experts and decision makers. P2VR projects follow a “climbing route�? to deliver, from the onset, a permanent, structured, stream of improvements. The steady flow of good news enhances the standing of the IT function within the company. The specific advantages of the P2VR can be seen on both the input and output side. It lowers external costs as well as optimizes use of internal resources. It creates a constant stream of benefits that improves the ROI and enhances the reputation of the IT department.","PeriodicalId":10688,"journal":{"name":"Computing Technologies eJournal","volume":"57 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2015-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90710810","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper investigates the possibility that television advertising influences online search using the AOL search dataset. It uses a novel keyword mining technique to classify keywords as brand related, category related (generic), or unrelated, distinguishing between category search and consumers' tendency to search a branded keyword. A three-level conditional choice model is estimated to determine whether hourly changes in brands' television advertising expenditures are related to deviations from baseline trends in search behaviors. The results indicate a statistically significant relationship between TV advertising and consumers' tendency to search branded keywords (e.g. “Fidelity”) rather than generic category-related keywords (e.g. “stocks”) in the dataset. The effect is largest for relatively young brands during standard business hours with an elasticity, .07, comparable to extant measurements of advertising's impact on sales. However, television advertising is not found to influence category search incidence and has limited effects on click-through rates.
{"title":"Effects of TV Advertising on Keyword Search","authors":"Mingyu Joo, Kenneth C. Wilbur, Yi Zhu","doi":"10.2139/ssrn.1720713","DOIUrl":"https://doi.org/10.2139/ssrn.1720713","url":null,"abstract":"This paper investigates the possibility that television advertising influences online search using the AOL search dataset. It uses a novel keyword mining technique to classify keywords as brand related, category related (generic), or unrelated, distinguishing between category search and consumers' tendency to search a branded keyword. A three-level conditional choice model is estimated to determine whether hourly changes in brands' television advertising expenditures are related to deviations from baseline trends in search behaviors. The results indicate a statistically significant relationship between TV advertising and consumers' tendency to search branded keywords (e.g. “Fidelity”) rather than generic category-related keywords (e.g. “stocks”) in the dataset. The effect is largest for relatively young brands during standard business hours with an elasticity, .07, comparable to extant measurements of advertising's impact on sales. However, television advertising is not found to influence category search incidence and has limited effects on click-through rates.","PeriodicalId":10688,"journal":{"name":"Computing Technologies eJournal","volume":"67 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88919333","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The Brownian correlation has been recently introduced by Szekely et al. (2007; 2009), which has an attractive property that when it is zero, it guarantees independence. This paper investigates into the effects and advantages, if any, of replacement of the Pearsonian coefficient of correlation (r) by the Brownian coefficient of correlation (say, ρ), other things remaining the same. Such a replacement and analysis of its effects have been made by the Host-Parasite Co-evolutionary algorithm of global optimization applied on six datasets.
{"title":"What Happens If in the Principal Component Analysis the Pearsonian is Replaced by the Brownian Coefficient of Correlation?","authors":"Sudhanshu K. Mishra","doi":"10.2139/SSRN.2443362","DOIUrl":"https://doi.org/10.2139/SSRN.2443362","url":null,"abstract":"The Brownian correlation has been recently introduced by Szekely et al. (2007; 2009), which has an attractive property that when it is zero, it guarantees independence. This paper investigates into the effects and advantages, if any, of replacement of the Pearsonian coefficient of correlation (r) by the Brownian coefficient of correlation (say, ρ), other things remaining the same. Such a replacement and analysis of its effects have been made by the Host-Parasite Co-evolutionary algorithm of global optimization applied on six datasets.","PeriodicalId":10688,"journal":{"name":"Computing Technologies eJournal","volume":"53 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77885579","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Crowdsourcing is beginning to be used for policymaking. The “wisdom of crowds” [Surowiecki 2005], and crowdsourcing [Brabham 2008], are seen as new avenues that can shape all kinds of policy, from ...
{"title":"Crowdsourcing the Policy Cycle","authors":"John Prpic, Araz Taeihagh, J. Melton","doi":"10.31235/osf.io/m24k9","DOIUrl":"https://doi.org/10.31235/osf.io/m24k9","url":null,"abstract":"Crowdsourcing is beginning to be used for policymaking. The “wisdom of crowds” [Surowiecki 2005], and crowdsourcing [Brabham 2008], are seen as new avenues that can shape all kinds of policy, from ...","PeriodicalId":10688,"journal":{"name":"Computing Technologies eJournal","volume":"26 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78914269","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper we propose a cyclical coordinate descent (CCD) algorithm for solving high dimensional risk parity problems. We show that this algorithm converges and is very fast even with large covariance matrices (n > 500). Comparison with existing algorithms also shows that it is one of the most efficient algorithms.
{"title":"A Fast Algorithm for Computing High-Dimensional Risk Parity Portfolios","authors":"T. Griveau-Billion, J. Richard, T. Roncalli","doi":"10.2139/ssrn.2325255","DOIUrl":"https://doi.org/10.2139/ssrn.2325255","url":null,"abstract":"In this paper we propose a cyclical coordinate descent (CCD) algorithm for solving high dimensional risk parity problems. We show that this algorithm converges and is very fast even with large covariance matrices (n > 500). Comparison with existing algorithms also shows that it is one of the most efficient algorithms.","PeriodicalId":10688,"journal":{"name":"Computing Technologies eJournal","volume":"30 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89905325","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
By leveraging information technologies, organizations now have the ability to design their communication networks and crowdsourcing platforms to pursue various performance goals, but existing research on network design does not account for the specific features of social networks, such as the notion of teams. We fill this gap by demonstrating how desirable aspects of organizational structure can be mapped parsimoniously onto the spectrum of the graph Laplacian allowing the specification of structural objectives and build on recent advances in non-convex programming to optimize them. This design framework is general, but we focus here on the problem of creating graphs that balance high modularity and low mixing time, and show how "liaisons" rather than brokers maximize this objective.
{"title":"Communication Network Design: Balancing Modularity and Mixing via Optimal Graph Spectra","authors":"Benjamin Lubin, Jesse Shore, Vatche Isahagian","doi":"10.2139/ssrn.2311755","DOIUrl":"https://doi.org/10.2139/ssrn.2311755","url":null,"abstract":"By leveraging information technologies, organizations now have the ability to design their communication networks and crowdsourcing platforms to pursue various performance goals, but existing research on network design does not account for the specific features of social networks, such as the notion of teams. We fill this gap by demonstrating how desirable aspects of organizational structure can be mapped parsimoniously onto the spectrum of the graph Laplacian allowing the specification of structural objectives and build on recent advances in non-convex programming to optimize them. This design framework is general, but we focus here on the problem of creating graphs that balance high modularity and low mixing time, and show how \"liaisons\" rather than brokers maximize this objective.","PeriodicalId":10688,"journal":{"name":"Computing Technologies eJournal","volume":"29 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2013-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81362808","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：