Security Enhanced Internet of Vehicles with Cloud-Fog-Dew Computing

The Internet of Vehicles(IoV)is becoming an essential factor in the development of smart transportation and smart city projects.The IoV technology consists of the concepts of fog computing and dew computing,which involve on-board units and road side units in the edge network,as well as the concept of cloud computing,which involves the data center that provides service.The security issues are always an important concern in the design of IoV architecture.To achieve a secure IoV architecture,some security measures are necessary for the cloud computing and fog computing associated with the vehicular network.In this paper,we summarize some research works on the security schemes in the vehicular network and cloud-fog-dew computing platforms which the IoV depends on.

Intelligent Development Environment and Software Knowledge Graph

Software intelligent development has become one of the most important research trends in software engineering. In this paper, we put forward two key concepts -- intelligent development environment （IntelliDE） and software knowledge graph -- for the first time. IntelliDE is an ecosystem in which software big data are aggregated, mined and analyzed to provide intelligent assistance in the life cycle of software development. We present its architecture and discuss its key research issues and challenges. Software knowledge graph is a software knowledge representation and management framework, which plays an important role in IntelliDE. We study its concept and introduce some concrete details and examples to show how it could be constructed and leveraged.

Software techniques for Internet Computing:Current situation and future trend

The fast development of the Internet has extended wider space for Information and Communications Technology(ICT),and it has brought a series of challenges for traditional software theories,models,approaches and technologies.This paper looks back some popular Internet-based new computing paradigms and application schemas,discusses the current status and the future trend of software technologies for Internet Computing,including topics of software model,software runtime supporting platform,software development methodologies and software quality measurement and assurance.

Internetware:An Emerging Software Paradigm for Internet Computing

The Internet is undergoing a tremendous change towards the globalized computing environment. Due to the open, dynamic and uncontrollable natures of the Internet, software running in the Internet computing environment has some new features, which bring challenges to current software technologies in terms of software model, software operating platform, software engineering approaches and software quality. Researchers in China have proposed the term ＂Internetware＂ to present the emerging software paradigm. Sponsored by the National Basic Research 973 Program, several research practices have been done on the Internetware in the past decade. This paper summarizes the progress and status of the Internetware researches. A technical solution framework for the Internetware paradigm is proposed from four aspects： the Internetware software model defines what the Internetware is to be; the Internetware middleware determines how to run the Internetware applications; the engineering methodology determines how to develop the Internetware applications; the Internetware quality assurance determines how well the Internetware applications can perform. The paper also discusses the ongoing research issues and future trends of Internetware.

Cooperative Software Testing and Analysis: Advances and Challenges

In recent years, to maximize the value of software testing and analysis, we have proposed the methodology of cooperative software testing and analysis （in short as cooperative testing and analysis） to enable testing and analysis tools to cooperate with their users （in the form of tool-human cooperation）, and enable one tool to cooperate with another tool （in the form of tool-tool cooperation）. Such cooperations are motivated by the observation that a tool is typically not powerful enough to address complications in testing or analysis of complex real-world software, and the tool user or another tool may be able to help out some problems faced by the tool. To enable tool-human or tool-tool cooperation, effective mechanisms need to be developed 1） for a tool to communicate problems faced by the tool to the tool user or another tool, and 2） for the tool user or another tool to assist the tool to address the problems. Such methodology of cooperative testing and analysis forms a new research frontier on synergistic cooperations between humans and tools along with cooperations between tools and tools. This article presents recent example advances and challenges on cooperative testing and analysis.

Managing Software Requirements Changes Based on Negotiation-Style Revision

For any proposed software project,when the software requirements specification has been established,requirements changes may result in not only a modification of the requirements specification but also a series of modifications of all existing artifacts during the development.Then it is necessary to provide effective and flexible requirements changes management.In this paper,we present an approach to managing requirements changes based on Booth＇s negotiation-style framework for belief revision.Informally,we consider the current requirements specification as a belief set about the systemto-be.The request of requirements change is viewed as new information about the same system-to-be.Then the process of executing the requirements change is a process of revising beliefs about the system-to-be.We design a family of belief negotiation models appropriate for different processes of requirements revision,including the setting of the request of requirements change being fully accepted,the setting of the current requirements specification being fully preserved,and that of the current specification and the request of requirements change reaching a compromise.In particular,the prioritization of requirements plays an important role in reaching an agreement in each belief negotiation model designed in this paper.

Towards a Source-Code Oriented Attestation

The Binary-based attestation （BA） mechanism presented by the Trusted Computing Group can equip the application with the capability of genuinely identifying configurations of remote system. However, BA only supports the attestation for specific patterns of binary codes defined by a trusted party, mostly the software vendor, for a particular version of a software. In this paper, we present a Source-Code Oriented Attestation （SCOA） framework to enable custom built application to be attested to in the TCG attestation architecture. In SCOA, security attributes are bond with the source codes of an application instead of its binaries codes. With a proof chain generated by a Trusted Building System to record the building procedure, the challengers can determine whether the binary interacted with is genuinely built from a particular set of source codes. Moreover, with the security attribute certificates assigned to the source codes, they can determine the trustworthiness of the binary. In this paper, we present a TBS implementation with virtualization.

A DNA Computing Model for the Graph Vertex Coloring Problem Based on a Probe Graph

The biggest bottleneck in DNA computing is exponential explosion, in which the DNA molecules used as data in information processing grow exponentially with an increase of problem size. To overcome this bottleneck and improve the processing speed, we propose a DNA computing model to solve the graph vertex coloring problem. The main points of the model are as follows： The exponential explosion prob- lem is solved by dividing subgraphs, reducing the vertex colors without losing the solutions, and ordering the vertices in subgraphs; and the bio-operation times are reduced considerably by a designed parallel polymerase chain reaction （PCR） technology that dramatically improves the processing speed. In this arti- cle, a 3-colorable graph with 61 vertices is used to illustrate the capability of the DNA computing model. The experiment showed that not only are all the solutions of the graph found, but also more than 99% of false solutions are deleted when the initial solution space is constructed. The powerful computational capability of the model was based on specific reactions among the large number of nanoscale oligonu- cleotide strands. All these tiny strands are operated by DNA self-assembly and parallel PCR. After thou- sands of accurate PCR operations, the solutions were found by recognizing, splicing, and assembling. We also prove that the searching capability of this model is up to 0（3^59）. By means of an exhaustive search, it would take more than 896 000 years for an electronic computer （5 x 10^14 s-1） to achieve this enormous task. This searching capability is the largest among both the electronic and non-electronic computers that have been developed since the DNA computing model was proposed by Adleman＇s research group in 2002 （with a searching capability of 0（2^20））.

Versatile Routing and Self-Certifying Features Support for Secure Mobility in eXpressive Internet Architecture

Integrating mobility and security in the network layer has become a key factor for Future Internet Architecture(FIA). This paper proposes a secure mobility support mechanism in e Xpressive Internet Architecture(XIA),a new FIA currently under development as part of the US National Science Foundation's(NSF) program. Utilizing the natural features of ID/locator decoupling and versatile routing in XIA, a general mechanism to support host mobility is proposed. Exploiting the self-certifying identifier, a secure binding update protocol to overcome the potential threats introduced by the proposed mobility support mechanism is also given. We demonstrate that our design in XIA outperforms IP based solutions in terms of efficiency and flexibility. We also outline our initial design to illustrate one derivative benefit of an evolvable architecture:mobility support customizability with no sacrifice of architectural generality.

Molecular logic computing model based on self-assembly of DNA nanoparticles

In this paper, a logic computing model was constructed using a DNA nanoparticle, combined with color change technology of DNA/Au nanoparticle conjugates, and DNA computing. Several important technologies are utilized in this molecular computing model: DNA self-assembly, DNA/Au nanoparticle conjugation, and the color change resulting from Au nanoparticle aggregation. The simple logic computing model was realized by a color change, resulting from changing of DNA self-assembly. Based on this computing model, a set of operations computing model was also established, by which a simple logic problem was solved. To enlarge the applications of this logic nanocomputing system, a molecular detection method was developed for H1N1 virus gene detection.

A molecular cryptography model based on structures of DNA self-assembly

With the progress of DNA computing, DNAbased cryptography becomes an emerging interdisciplinary research field. In this paper, we present a novel DNA cryptography that takes advantage of DNA self-assembled structure. Making use of the toehold strands recognition and strand displacement, the bit-wise exclusive-or(XOR)operation is carried out to fulfill the information encryption and decryption in the form of a one-time-pad. The security of this system mainly comes from the physical isolation and specificity of DNA molecules. The system is constructed by using complex DNA self-assembly, in which technique of fluorescent detection is utilized to implement the signal processing. In the proposed DNA cryptography,the XOR operation at each bit is carried out individually,thus the encryption and decryption process could be conducted in a massive, parallel way. This work may demonstrate that DNA cryptography has the great potential applications in the field of information security.

Distributed implementation of the genetic double-branch structure in Escherichia coli

Because of the simplicity of cells, the key to building biological computing systems may lie in constructing distributed systems based on cell–cell communication. Guided by a mathematical model, in this study we designed,simulated, and constructed a genetic double-branch structure in the bacterium Escherichia coli. This genetic double-branch structure is composed of a control cell and two reporter cells.The control cell can activate different reporter cells according to the input. Two quorum-sensing signal molecules, 3OC12-HSL and C4-HSL, form the wires between the control cell and the reporter cells. This study is a step toward scalable biological computation, and it may have many potential applications in biocomputing, biosensing, and biotherapy.

Towards architecture-based management of platforms in the cloud

System management is becoming increasingly complex and brings high costs, especially with the advent of cloud computing. Cloud computing involves numerous platforms often of virtual machines （VMs） and middleware has to be managed to make the whole system work cost- effectively after an application is deployed. In order to re- duce management costs, in particular for the manual activi- ties, many computer programs have been developed remove or reduce the complexity and difficulty of system mamnage- ment. These programs are usually hard-coded in languages like Java and C＋＋, which bring enough capability and flexi- bility but also cause high programming effort and cost. This paper proposes an architecture for developing management programs in a simple but powerful way. First of all, the man- ageability of a given platform （via APIs, configuration files, and scripts） is abstracted as a runtime model of the plat- form＇s software architecture, which can automatically and immediately propagate any observable runtime changes of the target platforms to the corresponding architecture mod- els, and vice versa. The management programs are devel- oped using modeling languages, instead of those relatively low-level programming languages. Architecture-level man- agement programs bring many advantages related to perfor- mance, interoperability, reusability, and simplicity. An experiment on a real-world cloud deployment and comparison with traditional programming language approaches demonstrate the feasibility, effectiveness, and benefits of the new model based approach for management program development.

An approach to improve the quality of object-oriented models from novice modelers through project practice

The defects in object-oriented models will result in poor quality of applications based on the models, and thus it is necessary to know which defects often occur in practice, to what extent they occur, why they occur, and how they can be prevented. To gain deeper insights into these problems, this paper discusses how to improve the quality of object- oriented models from novice modelers through project prac- tice. This paper summarizes a set of typical quality defect types from a large number of the defects, and confirms them through our project practice. Moreover, the paper analyzes the improvement of the quality of object-oriented models by quantifying the level of occurrence for the defect types in dif- ferent phases of the project practice, and presents preventive measures by analyzing the causes for the defects to occur in object-oriented models in the aspects of syntax, semantics, and pragmatics.

Towards Risk Evaluation of Denial-of-Service Vulnerabilities in Security Protocols

Denial-of-Service （DOS） attacks are virulent to both computer and networked systems. Modeling and evaluating DoS attacks are very important issues to networked systems; they provide both mathematical foundations and theoretic guidelines to security system design. As defense against DoS has been built more and more into security protocols, this paper studies how to evaluate the risk of DoS in security protocols. First, we build a formal framework to model protocol operations and attacker capabilities. Then we propose an economic model for the risk evaluation. By characterizing the intruder capability with a probability model, our risk evaluation model specifies the ＂Value-at-Risk＂ （VaR） for the security protocols. Tile ＂Value-at-Risk＂ represents how much computing resources are expected to lose with a given level of confidence. The proposed model can help users to have a better understanding of the protocols they are using, and in the meantime help designers to examine their designs and get clues of improvement. Finally we apply the proposed model to analyze a key agreement protocol used in sensor networks and identify a DoS flaw there, and we also validate the applicability and effectiveness of our risk evaluation model by applying it to analyze and compare two public key authentication protocols.

Development of DNA computing and information processing based on DNA-strand displacement

DNA computing, currently a hot research field in information processing, has the advantages of parallelism, low energy consumption, and high storability, therefore, it has been applied to a variety of complicated computational problems. The emerging field of DNA nanotechnology has also developed quickly; within it, the method of DNA strand displacement has drawn great attention because it is self-induced, sensitive, accurate, and operationally simple. This article summarizes five aspects of the recent developments of DNA-strand displacement in DNA computing:(1) cascading circuits;(2) catalyzed reaction;(3) logic computation;(4) DNA computing on surfaces; and(5) logic computing based on nanoparticles guided by strand displacement. The applications and mechanisms of strand displacement in DNA computing are discussed and possible future developments are presented.

Assessing the quality of metamodels

The complexity and diversity of modern software demands a variety of metamodel-based modeling languages for software development. Existing languages change continuously, and new ones are constantly emerging. In this situation, and especially for metamodel-based modeling languages, a quality assurance mechanism for metamodels is needed. This paper presents an approach to assessing the quality of metamodels. A quality model, which systematically characterizes and classifies quality attributes, and an operable measuring mechanism for effectively assessing the quality of metamodels based on the quality model, are pre- sented, using UML as the main example.

Towards module-based automatic partitioning of Java applications

When reengineering a monolithic application to be a distributed one, programmers always have to decide how many distributed parts the application should be partitioned, and write many codes related to where a part will be placed on network nodes and how these parts communicate with each other through the network. These codes usually have nothing to do with the business functions of the application, and they are laborious to write. In addition, as the distribution architecture of the application is finalized beforehand, it may not adapt well to the everchanging execution environment. In this paper, we propose DPartner, an automatic partitioning system, to help programmers create a distributed Java application without explicitly writing the distribution-related codes. Unlike the other partitioning systems, DPartner does not partition an application directly into the coarse-grained client and server. Instead, it first partitions the application into several modules where each module performs a relatively independent business function of the application. Then it makes these modules be distributable through automatic bytecode rewriting. These modules can distribute in different nodes and cooperate to work just as the original monolithic application. Such a module-based partitioning approach enables a relatively easy reshaping of the distribution architecture of an application, which facilitates the application adapt to the environmental changes without manual recoding or repartitioning with regard to distribution. This paper gives the detailed design of DPartner, and evaluates it using real-world applications. The evaluation results demonstrate the effectiveness and efficiency of DPartner.

User story clustering in agile development:a framework and an empirical study

Agile development aims at rapidly developing software while embracing the continuous evolution of user requirements along the whole development process.User stories are the primary means of requirements collection and elicitation in the agile development.A project can involve a large amount of user stories,which should be clustered into different groups based on their functionality’s similarity for systematic requirements analysis,effective mapping to developed features,and efficient maintenance.Nevertheless,the current user story clustering is mainly conducted in a manual manner,which is time-consuming and subjective to human bias.In this paper,we propose a novel approach for clustering the user stories automatically on the basis of natural language processing.Specifically,the sentence patterns of each component in a user story are first analysed and determined such that the critical structure in the representative tasks can be automatically extracted based on the user story meta-model.The similarity of user stories is calculated,which can be used to generate the connected graph as the basis of automatic user story clustering.We evaluate the approach based on thirteen datasets,compared against ten baseline techniques.Experimental results show that our clustering approach has higher accuracy,recall rate and F1-score than these baselines.It is demonstrated that the proposed approach can significantly improve the efficacy of user story clustering and thus enhance the overall performance of agile development.The study also highlights promising research directions for more accurate requirements elicitation.

Graph Embedding Based API Graph Search and Recommendation

Searching application programming interfaces (APIs) is very important for developers to reuse software projects. Existing natural language based API search mainly faces the following challenges. 1) More accurate results are required as software projects evolve to be more heterogeneous and complex. 2) The semantic relationships between APIs (e.g., inheritances between classes, and invocations between methods) need to be illustrated so that developers can better understand their usage scenarios. To deal with these issues, we propose GeAPI, a novel graph embedding based approach for API graph search and recommendation in this paper. First, we build a software project’s API graph automatically from its source code and represent each API using graph embedding methods. Second, we search the API graph with a question in natural language, and return the corresponding subgraph that is composed of relevant code elements and their associated relationships, as the best answer of the question. In experiments, we select three well-known open source projects, JodaTime, Apache Lucene and POI, as examples to perform API search tasks. The experimental results show that our approach GeAPI improves F1-score by 10% compared with the existing shortest path based API search approach, while reduces the average response time about 60 times.