发布求助
文献互助 智能选刊 最新文献

Computing Technologies eJournal最新文献

筛选
英文 中文
Approximating the Sum of Correlated Lognormals: An Implementation 近似相关对数法的和:一个实现
Computing Technologies eJournal Pub Date : 2015-08-27 DOI: 10.2139/ssrn.2653337
Christopher J. Rook, M. Kerman
{"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}
引用次数: 5
The Law and 3D Printing 法律和3D打印
Computing Technologies eJournal Pub Date : 2015-07-01 DOI: 10.2139/SSRN.2581775
J. Tran
{"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}
引用次数: 19
The Assimilation of RFID Technology by Chinese Companies: A Technology Diffusion Perspective 中国企业对RFID技术的吸收:一个技术扩散的视角
Computing Technologies eJournal Pub Date : 2015-05-03 DOI: 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}
引用次数: 76
Getting Analytics? Use What You Learnt from It 得到分析?运用你从中学到的东西
Computing Technologies eJournal Pub Date : 2015-03-05 DOI: 10.2139/SSRN.2574516
A. Bardhan
{"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}
引用次数: 0
ERPs: Beyond and Above 'Moderately Successful' Pro-Active Progressive Value Realisation erp:超越“适度成功”的主动渐进价值实现
Computing Technologies eJournal Pub Date : 2015-01-28 DOI: 10.2139/ssrn.2624235
François Bonnafy
{"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}
引用次数: 0
Effects of TV Advertising on Keyword Search 电视广告对关键词搜索的影响
Computing Technologies eJournal Pub Date : 2014-12-15 DOI: 10.2139/ssrn.1720713
Mingyu Joo, Kenneth C. Wilbur, Yi Zhu
{"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}
引用次数: 61
What Happens If in the Principal Component Analysis the Pearsonian is Replaced by the Brownian Coefficient of Correlation? 如果在主成分分析中用布朗相关系数代替皮尔逊相关系数会发生什么?
Computing Technologies eJournal Pub Date : 2014-05-29 DOI: 10.2139/SSRN.2443362
Sudhanshu K. Mishra
{"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}
引用次数: 3
Crowdsourcing the Policy Cycle 众包政策周期
Computing Technologies eJournal Pub Date : 2014-02-18 DOI: 10.31235/osf.io/m24k9
John Prpic, Araz Taeihagh, J. Melton
{"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}
引用次数: 8
A Fast Algorithm for Computing High-Dimensional Risk Parity Portfolios 一种计算高维风险平价组合的快速算法
Computing Technologies eJournal Pub Date : 2013-09-01 DOI: 10.2139/ssrn.2325255
T. Griveau-Billion, J. Richard, T. Roncalli
{"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}
引用次数: 29
Communication Network Design: Balancing Modularity and Mixing via Optimal Graph Spectra 通信网络设计:通过最优图谱平衡模块化和混合
Computing Technologies eJournal Pub Date : 2013-08-14 DOI: 10.2139/ssrn.2311755
Benjamin Lubin, Jesse Shore, Vatche Isahagian
{"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}
引用次数: 1
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信