The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The purpose of this study was to design undergraduate course by using OER in learning ecosystem. A promising learning system needs to be sustainable through using resources efficiently so that they could serve future generations continually. The study explored the reconstruction of traditional undergraduate course through OER in public universities, and is found that (1) most of the participants had...
A typical way to improve the quality of requirements is to assign them to suitable stakeholders for reviewing. Due to different characteristics of requirements and diverse background of stakeholders, it is needed to find an optimal solution for requirements assignment. Existing search-based requirements assignment solutions focus on maximizing stakeholders' familiarities to assigned requirements and...
The study of intonation in a tonal language presents a challenge. The challenge is to see how a language succeeds in encoding the functions which is shown by means of intonation in non-tonal languages. This paper demonstrates most of the intonational marking in tonal language in Yichang.
Software trustworthiness is an important area of software reliability. How to measure it is a challenging. This paper aims at developing a new measurement model of software trustworthiness. For this propose, we first define the trusted evidence as a program unit or element which causes the untrustworthy. Then, we classify them and propose a measurement model to measure the degree of software trustworthiness...
As the size of CMOS devices continues to scale down, the reliability of circuits becomes one of main challenges in low supply voltage designs. Markov Random Field (MRF) circuits, a probabilistic-based approach, can achieve higher noise immunity compared to traditional designs under conditions of ultra-low supply voltage and low threshold voltage. However, the basic MRF elements have complex structures...
To solve the problem that global encoding kernels for the edges have great changes for variable-rate linear broadcast network coding, the concept of universal global encoding kernel is put forward in this paper. And the construction algorithm of such universal global encoding kernel is proposed based on the algorithm of variable-rate linear broadcast network coding. In this algorithm, the same local...
As CMOS devices scaling down according to the Moore' law, the reliability and stability of circuit become the main challenge for the chip designs in low supply voltage. Markov Random field (MRF) based design methodology presents a new approach to establish high noise-immune structure for low-power circuit design from the viewpoint of energy. We use global mapping to synthesize all two-input functions...
In this paper, we argue that the temporal dynamic patterns of entrepreneurial activities affect the likelihood of new venture creation. We put forward theoretical model based on complexity science, and test these hypotheses using longitudinal data from Chinese Panel Study of Entrepreneurial Dynamics. This paper reaches the following findings: ① Rate and new ventures' initial performance shows an inverse...
SVG WebGIS solution has been long recognized but not properly worked for mapping and performing spatial analysis. This paper examines different API approaches to SVG's spatial functionality as well as the architecture of spatial information and functionality services within SVG Applied Standard Document (SASD). Through experimentation, spatial APIs for SASD were not only to implement spatial information...
We propose a symbol-by-symbol (SBS) detector for Gaussian minimum shift keying (GMSK) signals in body area networks (BAN). Our detector exploits the orthogonality between adjacent GMSK-modulated symbols. By dividing the received signals into inphase-/quadrature-channels and odd-/even-streams, the strongest inter-symbol interference (ISI) from the adjacent symbols is removed. A whitened matched filter...
A feedforward carrier phase estimation algorithm using a modified QPSK partition approach followed by maximum-likelihood (ML) detection is proposed. Results demonstrate complexity reduction by more than a factor of 2 compared with other techniques.
In this paper, a new nonlinear structure called Nettree is proposed. A Nettree is different from a tree in that a node may have more than one parent. An algorithm, named Nettree for pattern Matching with flexible wildcard Constraints (NAMEIC), based on Nettree is designed to solve pattern matching with flexible wildcard constraints. The problem is exponential with regard to the pattern length m. We...
Core Vector Machine (CVM) is a promising technique for scaling up a binary Support Vector Machine (SVM) to handle large data sets with the utilization of approximate Minimum Enclosing Ball (MEB) algorithm. However, the experimental results in implementation show that there always exists some redundancy in the final core set to determine the final decision function. We propose an approximate MEB algorithm...
At present the service science and engineering research are mainly focus on service discovery, service composition, service reputation and other key technical of the service computing. However the basic theory of service science, in particular, the basic principle of service and the evolution mechanism of service network only have some preliminary of research and exploration. The atomic services as...
Multiple layers in graphs or vector maps are a general case but complicated network in various applications. The classical shortest path algorithm, such as the Dijkstra's algorithm, can not be applied to the multiple layers directly. A new shortest path approach for multiple layers of graphs or vector maps was proposed in this paper. Firstly, the multiple layers should be overlaid with an improved...
It is one of important algorithms to calculate intersection, union and difference between two polygons in computer graphics and also the kernel approach of spatial overlay analysis in geographic information system (GIS). The operating efficiency and ubiquity are directly influenced by the optimizing algorithm. Firstly, an efficient algorithm for intersection, union and difference between two convex...
Routing protocols are designed under the assumption that each node in a network should be able to reach (i. e. send or forward packets to) every other node in the network. Unfortunately, adopting this assumption in a routing protocol does allow adversary nodes to launch spam or DoS attacks against the other nodes in the network. In this paper, we introduce the "blocking option" in routing...
Virtual battle environment is an important visible platform for military simulation. Based on the implementation of a specific military project, the system components were described. The key techniques of virtual battlefield environment creation applying VR were analyzed and discussed, including a fast algorithm for 3D-modeling based on complexity, the techniques of 3D-terrain generation and predigestion,...
We develop multi-path reservation algorithms for in advance scheduling of large file transfers in connection-oriented optical networks. Specifically, to schedule a single file transfer to complete at the earliest possible time, a new max-flow based greedy algorithm (GOS) and four variants that adapt the k shortest paths and k-disjoint paths algorithms are proposed. Meanwhile, to find an earliest-finishing...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.