LPNet: A DNN based latency prediction technique for application mapping in Network-on-Chip design

Analytical models used for latency estimation of Network-on-Chip (NoC) are not producing reliable accuracy. This makes these analytical models difficult to use in optimization of design space exploration. In this paper, we propose a learning based model using deep neural network (DNN) for latency predictions. Input features for DNN model are collected from analytical model as well as from Booksim simulator. Then this DNN model has been adopted in mapping optimization loop for predicting the best mapping of given application and NoC parameters combination. Our simulations show that using the proposed DNN model, prediction error is less than 12% for both synthetic and application specific traffic. More than 108 times speedup could be achieved using DPSO with DNN model compared to DPSO using Booksim simulator.     

Analysis of oceanaut operating performance using an integrated Bayesian network aided by the fuzzy logic theory

Because the oceanaut plays a significant role in safety and capability during manned deep-diving scientific tasks, preventing oceanaut performance decline is of paramount importance. However, the factors responsible for oceanaut performance are almost entirely unexplored. To address the preceding issues, a quantitative method of fuzzy integrated Bayesian network (FIBN) was modeled within the limits of oceanaut operating procedures. To quantify the probabilities of the influencing factors, the probability of each node in the FIBN was calculated using integrated expert judgement, fuzzy logic theory, and Bayesian network. By considering a total of 28 factors related to oceanaut performance in the “Jiaolong” manned submersible, this study found that difficult sampling, long sampling times, cabin equipment failure, oceanaut physical decline, and declining decision-making ability are important factors that affect oceanaut performance. The FIBN proposed in our study fused the qualitative and quantitative methods and can be developed into a versatile tool for analysis of comprehensive systems that contain both static and dynamic factors.Relevance to industryThe results provide a powerful basis for the design of manned submersible and assignment of tasks to oceanauts, while the fuzzy integrated Bayesian network (FIBN) method proposed can be effectively applied to various quantitative assessment fields which direct researchers to deal with analysis problems of complex systems.     

Artificial intelligence capability: Conceptualization,measurement calibration,and empirical study on its impact on organizational creativity and firm performance

Artificial intelligence (AI) has been heralded by many as the next source of business value. Grounded on the resource-based theory of the firm and on recent work on AI at the organizational context, this study (1) identifies the AI-specific resources that jointly create an AI capability and provides a definition, (2) develops an instrument to capture the AI capability of the firms, and (3) examines the relationship between an AI capability and organizational creativity and performance. Findings empirically support the suggested theoretical framework and corresponding instrument and provide evidence that an AI capability results in increased organizational creativity and performance.     

Creativity in non‐routine jobs: The role of transformational leadership and organizational identification

An increasing number of individuals work in jobs with little standardization and repetition, that is, with high levels of job non‐routinization. At the same time, demands for creativity are high, which raises the question of how employees can use job non‐routinization to develop creativity. Acknowledging the importance of social processes for creativity, we propose that transformational leaders raise feelings of organizational identification in followers and that this form of identification then helps individuals to develop creativity in jobs with little routinization. This is because organizational members evaluate and promote those ideas as more creative, which are in line with a shared understanding of creativity within the organization. To investigate these relationships, we calculated a mediated moderation model with 173 leader–follower dyads from China. Results confirm our hypotheses that transformational leadership moderates the relationship between job non‐routinization on employee creativity through organizational identification. We conclude that raising feelings of social identity is a key task for leaders today, especially when working in uncertain and fast developing environments with little repetition and the constant need to develop creative ideas.     

煤矿监控图像增强算法的分析与实现

针对煤矿井下粉尘多、光照差的恶劣环境使得矿井监控图像偏暗、对比度低、视觉效果差的特点,提出了一种基于小波变换和模糊理论的图像增强算法。该算法选择小波变换为工具分解图像,应用新的模糊隶属度和增强算子对高频信息进行模糊处理,利用直方图均衡化对低频信息进行处理,最后对图像进行重构。处理结果较好地增强了图像细节信息,从整体上改善了图像效果。     

非部分嵌套信息结构的LQG动态队决策问题的可解性（II）*

本文讨论非嵌套信息结构的递阶队决策问题和控制均享信息结构的LQG分散控制问题,文中首先证明这两类问题的信息结构都是“部分控制嵌入”的,进而给出最优策略(或控制)存在的充要条件和当此条件成立时最优策略(或控制)的表达式。     

An information-theoretic approach to the written transmission of old English

Information theory offers a means for analyzing some constraints on the reading and copying process in Old English. Entropy for strings of various lengths offers a baseline measure of the uncertainty involved in transmission of Old English texts, while avoiding the pitfalls of applying models of modern reading to early medieval practice. Analysis of lengthy prose and verse texts in Old English revealed uniformly high values for entropy at all string lengths. High entropies may be the result of the language's irregular orthography, poetic koiné, and several dialects and imply that the language may have been easy to write but difficult to read. The low redundancy of the language which its high entropy values indicate suggests that the reader of Old English played an enhanced role in decoding a text and may provide an explanation for the high variability in the transmission of Old English verse.Katherine O'Brien O 'Keeffe is Professor of English at Texas A&M University and a co-director of its Interdisciplinary Group for Historical Literary Study.William Rundell is Professor of Mathematics at Texas A&M University.     

A λ-unifiability test for set theory

We present a semi-decision algorithm for the unifiability of two set-theoretic formulas modulo -reduction. The algorithm is based on the approach developed by G. Huet for type theory, but requires additional measures because formulas in set theory are not all normalizable. We present the algorithm in an Ada-like pseudocode, and then prove two theorems that show the completeness and correctness of the procedure. We conclude by showing that -unification is not a complete quantifier substitution method for set theory-unlile first-order unification and first-order logic. In this respect set theory is similar to type theory (higher-order logic).This material is based upon work supported by the National Science Foundation under award number ISI-8560438. Any opinions, findings, and conclusions or recommendations expressed in this publication are those of the author and do not necessarily reflect the views of the National Science Foundation.     

A Universal Method of Scientific Inquiry

A paradigm of scientific discovery is defined within a first-order logical framework. Within this paradigm, the concept of successful scientific inquiry is formalized and investigated. Among other results, it is shown that a simple method of scientific inquiry is universal in the sense that it leads to success on every problem for which success is in principle possible.     

Discrete logarithms inGF(p)

Several related algorithms are presented for computing logarithms in fieldsGF(p),p a prime. Heuristic arguments predict a running time of exp((1+o(1)) ) for the initial precomputation phase that is needed for eachp, and much shorter running times for computing individual logarithms once the precomputation is done. The running time of the precomputation is roughly the same as that of the fastest known algorithms for factoring integers of size aboutp. The algorithms use the well known basic scheme of obtaining linear equations for logarithms of small primes and then solving them to obtain a database to be used for the computation of individual logarithms. The novel ingredients are new ways of obtaining linear equations and new methods of solving these linear equations by adaptations of sparse matrix methods from numerical analysis to the case of finite rings. While some of the new logarithm algorithms are adaptations of known integer factorization algorithms, others are new and can be adapted to yield integer factorization algorithms.