Without an integrated model of how the human brain works and processes information, artificial intelligence (AI) will remain a mysterious black box that can misfire as circumstances change. An integrated study of the three cognitive computing components (AI, cognitive psychology, and neurobiology) is necessary to create explainable AI findings. This paper introduces cognitive computing systems (CCS) as a domain for information systems (IS) research. It reviews the interdisciplinary implications of CCS concepts by developing a new computational method, knowledge similarity transformation (KST), to improve digital-augmented literature analysis in fragmented knowledge areas. Based on the dual CCS and KST contribution, this article outlines strategic implications for organizational value creation opportunities and future research directions from a technological, psychological, and physiological perspective.

In order to detect tea diseases quickly and meet the needs of practical production, a method was proposed for the classification and identification of tea diseases under natural conditions. According to the characteristic factors, the foreground main blade region was segmented, and then an improved image segmentation algorithm is used to segment each color component. The$\pmb{H}, \pmb{a}^{*},$and$\pmb{b}^{\star}$components were superimposed to obtain an ideal lesion area. A total of 34 features were extracted from three aspects of color, shape, and texture of lesion area. The first 9 principal components were selected as the modeling variables by principal component analysis. Diseases were classified by back propagation (BP) neural network, random forest, and support vector machine (SVM), respectively. The results show that the recognition rate of SVM classification algorithm is 87.3%, which is superior to BP neural network and random forest, and its operating speed is faster. In order to improve the recognition rate, particle swarm optimization (PSO) algorithm to optimize SVM was proposed, which improved the recognition rate of SVM to 91.7%. The experimental results show that PSO optimized SVM algorithm can quickly realize the classification and identification of tea diseases under natural background, and provide a valuable reference for the intelligent agricultural informatization of tea garden agriculture.

Adenosine-to-inosine (A-to-I) editing by adenosine deaminase acting on the RNA (ADAR) proteins is one of the most frequent modifications during post- and co-transcription. To facilitate the assignment of biological functions to specific editing sites, we designed an automatic online platform to annotate A-to-I RNA editing sites in pre-mRNA splicing signals, microRNAs (miRNAs) and miRNA target untranslated regions (3' UTRs) from human (Homo sapiens) high-throughput sequencing data and predict their effects based on large-scale bioinformatic analysis. After analysing plenty of previously reported RNA editing events and human normal tissues RNA high-seq data, >60 000 potentially effective RNA editing events on functional genes were found. The RNA Editing Plus platform is available for free at https://www.rnaeditplus.org/, and we believe our platform governing multiple optimized methods will improve further studies of A-to-I-induced editing post-transcriptional regulation.

MOTIVATION: With the rapid development of Next-Generation Sequencing, a large amount of data is now available for bioinformatics research. Meanwhile, the presence of many pipeline frameworks makes it possible to analyse these data. However, these tools concentrate mainly on their syntax and design paradigms, and dispatch jobs based on users' experience about the resources needed by the execution of a certain step in a protocol. As a result, it is difficult for these tools to maximize the potential of computing resources, and avoid errors caused by overload, such as memory overflow. RESULTS: Here, we have developed BioQueue, a web-based framework that contains a checkpoint before each step to automatically estimate the system resources (CPU, memory and disk) needed by the step and then dispatch jobs accordingly. BioQueue possesses a shell command-like syntax instead of implementing a new script language, which means most biologists without computer programming background can access the efficient queue system with ease. AVAILABILITY AND IMPLEMENTATION: BioQueue is freely available at https://github.com/liyao001/BioQueue. The extensive documentation can be found at http://bioqueue.readthedocs.io. CONTACT: [email protected] or [email protected]. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

A key idea in modern software engineering is that we can and should make architectural style choices separately from choices about many other system properties. There is a fundamental separation of concerns implicit in this idea: given an application model that expresses system properties independently of architectural style, we can choose a compatible architectural style and then map the application model to one or more architectural models (architectures) in this style. The problem is that we do not have a formal account of this separation of concerns, or the associated architectural maps, sufficient to enable automated synthesis of architectures from application models and architecture style specifications. The contribution of this work is such an account and a demonstration that it enables automated formal derivation of style-specific architectures.

The emergence of aspect-oriented programming (AOP) languages has provided software designers with new mechanisms and strategies for decomposing programs into modules and composing modules into systems. What we do not yet fully understand is how best to use such mechanisms consistent with common modularization objectives such as the comprehensibility of programming code, its parallel development, dependability, and ease of change. The main contribution of this work is a new form of information-hiding interface for AOP that we call the crosscut programming interface, or XPI. XPIs abstract crosscutting behaviors and make these abstractions explicit. XPIs can be used, albeit with limited enforcement of interface rules, with existing AOP languages, such as AspectJ. To evaluate our notion of XPIs, we have applied our XPI-based design methodology to a medium-sized network overlay application called Hypercast. A qualitative and quantitative analysis of existing AO design methods and XPI-based design method shows that our approach produces improvements in program comprehensibility, in opportunities for parallel development, and in the ease when code can be developed and changed.

According to Parnas’s information hiding principle and Baldwin and Clark’s design rule theory, the key step to decomposing a system into modules is to determine the design rules (or in Parnas’s terms, interfaces) that decouple otherwise coupled design decisions and to hide decisions that are likely to change in independent modules. Given a modular design, it is often difficult to determine whether and how its implementation realizes the designed modularity. Manually comparing code with abstract design is tedious and error-prone. We present an automated approach to check the conformance of implemented modularity to designed modularity, using design structure matrices as a uniform representation for both. Our experiments suggest that our approach has the potential to manifest the decoupling effects of design rules in code, and to detect modularity deviation caused by implementation faults. We also show that design and implementation models together provide a comprehensive view of modular structure that makes certain implicit dependencies within code explicit.

Although self-adaptivity is emerging as an important system property, designers still lack principled and systematic methods for developing, reasoning about, and synthesizing specifications, architectures, and implementations for such systems. I exploit recent work on design structure and design-time adaptive capacity to devise a method for specifying, modularizing and synthesizing mechanisms for runtime self-adaptation. Results of an early evaluation of my method on a widely studied model problem suggest that it contributes to our knowledge of self-adaptive systems and has the potential to improve their design

The growing popularity of aspect-oriented languages, such as AspectJ, and of corresponding design approaches, makes it important to learn how best to modularize programs in which aspect-oriented composition mechanisms are used. We contribute an approach to information hiding modularity in programs that use quantified advising as a module composition mechanism. Our approach rests on a new kind of interface: one that abstracts a crosscutting behavior, decouples the design of code that advises such a behavior from the design of the code to be advised, and that can stipulate behavioral contracts. Our interfaces establish design rules that govern how specific points in program execution are exposed through a given join point model and how conforming code on either side should behave. In a case study of the HyperCast overlay network middleware system, including a real options analysis, we compare the widely cited oblivious design approach with our own, showing significant weaknesses in the former and benefits in the latter.