摘要 :
We develop a process algebraic framework PAFSV for the formal specification and analysis of IEEE 1800TM SystemVerilog designs. The formal semantics of PAFSV is defined by means of deduction rules that associate a time transition s...
展开
We develop a process algebraic framework PAFSV for the formal specification and analysis of IEEE 1800TM SystemVerilog designs. The formal semantics of PAFSV is defined by means of deduction rules that associate a time transition system with a PAFSV process. A set of properties of PAFSV is presented for a notion of bisimilarity. PAFSV may be regarded as the formal language of a significant subset of IEEE 1800TM SystemVerilog. To show that PAFSV is useful for the formal specification and analysis of IEEE 1800TM SystemVerilog designs, we illustrate the use of PAFSV with a multiplexer, a synchronous reset D flip-flop and an arbiter.
收起
摘要 :
In the application layer multicast (ALM), clustering nearby nodes can effectively improve the multicast performance. However, it is difficult for the ALM solution to quickly and accurately position the newcomer, because group memb...
展开
In the application layer multicast (ALM), clustering nearby nodes can effectively improve the multicast performance. However, it is difficult for the ALM solution to quickly and accurately position the newcomer, because group members have no direct knowledge of underlying network topology. Additionally, ALM delivery trees with different performances are built when group members join the group in different join sequences. To alleviate the above problems, this paper proposes a distance-heuristic tree building protocol (called DHTB). DHTB uses our proposed distance-constrained cluster model and close-member-first-receive (CF) rule. In the model, most nearby nodes are grouped into some distance-constrained clusters, with little cluster organization and maintenance overhead. The CF rule arranges or rearranges the locations of group members according to related distances, and effectively positions the newcomer with the help of on-demand landmarks. Both the distance-constrained cluster model and CF rule are distance-heuristic. Therefore DHTB can alleviate the join sequence problem, and build the ALM tree with desirable performance.
收起
摘要 :
Thematrix completion problem is to recover a low-rank matrix from a subset of its entries. The main solution strategy for this problem has been based on nuclearnorm minimization which requires computing singular value decompositio...
展开
Thematrix completion problem is to recover a low-rank matrix from a subset of its entries. The main solution strategy for this problem has been based on nuclearnorm minimization which requires computing singular value decompositions—a task that is increasingly costly as matrix sizes and ranks increase. To improve the capacity of solving large-scale problems, we propose a low-rank factorization model and construct a nonlinear successive over-relaxation (SOR) algorithm that only requires solving a linear least squares problem per iteration. Extensive numerical experiments show that the algorithm can reliably solve a wide range of problems at a speed at least several times faster than many nuclear-norm minimization algorithms. In addition, convergence of this nonlinear SOR algorithm to a stationary point is analyzed.
收起
摘要 :
Data streaming applications bring new challenges to resource management and scheduling for grid computing. Since real-time data streaming is required as data processing is going on, integrated grid resource management becomes esse...
展开
Data streaming applications bring new challenges to resource management and scheduling for grid computing. Since real-time data streaming is required as data processing is going on, integrated grid resource management becomes essential among processing, storage and networking resources. Traditional scheduling approaches may not be sufficient for such applications, since usually only one aspect of grid resource scheduling is focused. In this work, an integrated resource scheduling approach is proposed and coordinated resource allocation of CPU cycles, storage capability and network bandwidth is implemented. Resource allocation is performed periodically with updated information on resources and applications and heuristic search for optimal solutions is used to assign various resources for running applications simultaneously. Performance metrics considered in this work include data throughput and utilization of processors, storage, and bandwidth, which are actually tightly coupled with each other when applied for grid data streaming applications. Experimental results show dramatic improvement of performance and scalability using our implementation.
收起
摘要 :
The current Internet is facing serious scalability problems and the overloading of Internet Protocol (IP) addresses is regarded as an important reason. The Locator/ID Separation Protocol (LISP) is proposed as a network-based solut...
展开
The current Internet is facing serious scalability problems and the overloading of Internet Protocol (IP) addresses is regarded as an important reason. The Locator/ID Separation Protocol (LISP) is proposed as a network-based solution that separates IP addresses into Routing Locators (RLOCs) and Endpoint Identifiers (EIDs) to address the routing scalability problems. It is a critical challenge for LISP to design a scalable and efficient mapping system. In this paper, we propose a hierarchical mapping system (HMS). HMS consists of two levels with the bottom level maintaining the EID-to-RLOC mappings in an Autonomous System (AS) and the upper level storing the mappings between EID-prefixes and ASs in the global network. We adopt one-hop Distributed Hash Table (DHT) to organize EID-to-RLOC mappings in the bottom level and use a protocol like Border Gateway Protocol (BGP) to propagate EID-prefix-to-AS mappings in the upper level. HMS aggregates the prefixes in an AS and decreases the global mapping entries in the upper level. The evaluation results show that the number of mapping entries in HMS grows slower than the routing table size, which makes HMS scalable. In addition, the mobility in HMS does not cause mapping changes in the upper level. It makes HMS efficient in supporting host mobility. We estimate the map-requests sent to the mapping system, which show the load on HMS is small. Last, we compare HMS with LISP-TREE and LISP+ALT by quantitative analysis, in terms of resolution cost, and qualitative analysis. The results show that HMS has a good performance.
收起
摘要 :
Allergic diseases such as asthma, allergic rhinitis, allergic conjunctivitis, and atopic dermatitis are clinically challenging. Although current treatments such as antihistamines, leukotriene receptor antagonists, and corticostero...
展开
Allergic diseases such as asthma, allergic rhinitis, allergic conjunctivitis, and atopic dermatitis are clinically challenging. Although current treatments such as antihistamines, leukotriene receptor antagonists, and corticosteroids are effective at reducing symptoms, they do not address the underlying cause of the allergic response. Therefore, novel therapies that target upstream causative events in allergic diseases are desirable. The induction of RNA interference (RNAi) by small interfering RNA (siRNA) is a potent method for specifically knocking down molecular targets. Gene modulation by siRNA is therapeutically promising, with clinical safety and feasibility already demonstrated. However, to our knowledge, the use of siRNA in the area of allergic disease has been limited. Recently, we demonstrated the inhibition of CD40 by siRNA as a means of inhibiting allergic reactions. RNAi-based therapies represent a novel and promising strategy for the control of both the symptoms of allergy and the cause of the allergic response. Here we discuss the potential of siRNA in the treatment of allergic diseases by focusing on molecular and cellular interactions involved in the allergic cascade.
收起
摘要 :
Nano-drug delivery systems (Nano-DDS) offer powerful advantages in drug delivery and targeted therapy for diseases. Compared to the traditional drug formulations, Nano-DDS can increase solubility, biocompatibility, and reduce off-...
展开
Nano-drug delivery systems (Nano-DDS) offer powerful advantages in drug delivery and targeted therapy for diseases. Compared to the traditional drug formulations, Nano-DDS can increase solubility, biocompatibility, and reduce off-targeted side effects of free drugs. However, they still have some disadvantages that pose a limitation in reaching their full potential in clinical use. Protein adsorption in blood, activation of the complement system, and subsequent sequestration by the mononuclear phagocyte system (MPS) consequently result in nanoparticles (NPs) to be rapidly cleared from circulation. Therefore, NPs have low drug delivery efficiency. So, it is important to develop stealth NPs for reducing bio–nano interaction. In this review, we first conclude the interaction between NPs and biological environments, such as blood proteins and MPS, and factors influencing each other. Next, we will summarize the new strategies to reduce NPs protein adsorption and uptake by the MPS based on current knowledge of the bio–nano interaction. Further directions will also be highlighted for the development of biomimetic stealth nano-delivery systems by combining targeted strategies for a better therapeutic effect.
收起
摘要 :
A metal-free catalytic method for the synthesis of 2-deoxy glycosides and disaccharides has been developed using stable 2-deoxy glucosyl and galactosyl acetate donors. They could react with a variety of acceptors in the presence o...
展开
A metal-free catalytic method for the synthesis of 2-deoxy glycosides and disaccharides has been developed using stable 2-deoxy glucosyl and galactosyl acetate donors. They could react with a variety of acceptors in the presence of catalytic amount of TMSOTf at 0癈 to form glycosides, glycoconjugates, and disaccharides with excellent ?selectivity (> 19:1) and yields (up to 99%) in a short time (0.5 h). With this expedient method, several new compounds against human K562 and SMMC7721 cell lines were obtained and tested with in vitro antitumor bioactivities.
收起
摘要 :
Argumentation frameworks for ontology reasoning and management have received extensive interests in the field of artificial intelligence in recent years. As one of the most popular argumentation frameworks, Besnard and Hunter's fr...
展开
Argumentation frameworks for ontology reasoning and management have received extensive interests in the field of artificial intelligence in recent years. As one of the most popular argumentation frameworks, Besnard and Hunter's framework is built on arguments in form of where Phi is consistent and minimal for entailing phi. However, the problem about generating arguments over ontologies is still open. This paper presents an approach to generating arguments over DL-Lite ontologies by searching support paths in focal graphs. Moreover, theoretical results and examples are provided to ensure the correctness of this approach. Finally, we show this approach has the same complexity as propositional revision.
收起
摘要 :
Recent investigations into proactive network defense have not produced a systematic methodology and structure; in addition, issues including multi-source information fusion and attacking behavior analysis have not been resolved. B...
展开
Recent investigations into proactive network defense have not produced a systematic methodology and structure; in addition, issues including multi-source information fusion and attacking behavior analysis have not been resolved. Borrowing ideas of danger sensing and immune response from danger theory, a proactive network defense model based on danger theory is proposed. This paper defines the signals and antigens in the network environment as well as attacking behavior analysis algorithm, providing evidence for future proactive defense strategy selection. The results of preliminary simulations demonstrate that this model can sense the onset of varied network attacks and corresponding endangered intensities, which help to understand the attack methods of hackers and assess the security situation of the current network, thus a better proactive defense strategy can be deployed. Moreover, this model possesses good robustness and accuracy.
收起
原文获取