For each positive integer r ≥ 1, a nondeterministic machine M is r path-bounded if for any input word x, there are r computation paths of M on x. This paper investigates the accepting powers of path-bounded one-way (...
详细信息
The fracture property of amorphous metal was studied by a large scale molecular dynamics (MD) simulation. The Finnis-Sinclair potential for α-iron was used as an inter-atomic potential. At first, we made a model amor...
详细信息
ISBN:
(纸本)9781617820632
The fracture property of amorphous metal was studied by a large scale molecular dynamics (MD) simulation. The Finnis-Sinclair potential for α-iron was used as an inter-atomic potential. At first, we made a model amorphous metal by melting-rapid quenching simulation. And then a crystal growth simulation in the amorphous was performed. We used circular model, and the cracktip is assumed to be at the center. In order to analyze the crack growth characteristics in an infinite domain, the linear elastic solution of Mode I crack was used as a boundary condition. The periodic boundary condition was used to the thickness direction. The crack opens in similar fashion and it has smooth surfaces during the amorphous state. As it deformed, some clusters of bcc-crystal nucleate around the cracktip and they grow rapidly. The distribution of deformation zones and deformation mechanism are significantly altered. The grains are not deformed while they are relatively small. The emission of dislocations from the cracktip is observed, after the crystal phase covered the crack-tip surfaces. The grain size appeared small in the vicinity of the crack-tip, and becomes gradually large as it separates form the crack-tip.
作者:
I. AndreadisA. AmanatiadisLaboratory of Electronics
Section of Electronics and Information Systems Technology Department of Electrical and Computer Engineering Democritus University of Thrace Xanthi Greece
The proposed scaling algorithm outperforms other standard and widely used scaling techniques. The algorithm uses a mask of maximum four pixels and calculates the final luminosity of each pixel combining two factors; t...
详细信息
The proposed scaling algorithm outperforms other standard and widely used scaling techniques. The algorithm uses a mask of maximum four pixels and calculates the final luminosity of each pixel combining two factors; the percentage of area that mask covers from each source pixel and the difference in luminosity between the source pixels. The interpolation is capable of scaling both grey-scale and color images of any resolution in any scaling factor. Its key characteristics and low complexity make the interpolation very fast and capable of real time implementation. The performance results in a variety of standard tests are presented and compared to other scaling algorithms
In this paper, we propose and investigate space-time-frequency turbo coded OFDM transmissions through time-varying and frequency-selective fading channel. The proposed turbo code is a serial concatenated convolutional...
详细信息
Risk is associated with almost every activity that is undertaken on a daily life. Risk associated with Trust, Security and Privacy. Risk is associated with transactions, businesses, informationsystems, environments, ...
详细信息
Risk is associated with almost every activity that is undertaken on a daily life. Risk associated with Trust, Security and Privacy. Risk is associated with transactions, businesses, informationsystems, environments, networks, partnerships, etc. Generally speaking, risk signifies the likelihood of financial losses, human casualties, business destruction and environmental damages. Risk indicator gives early warning to the party involved and helps avoid deserters. Until now, risk has been discussed extensively in the areas of investment, finance, health, environment, daily life activities and engineering. However, there is no systematic study of risk in Decentralised communication, which involves e-business, computer networks and service oriented environment. In this paper, we define risk associated with trusted communication in e-business and e-transactions; provide risk indicator calculations and basic application areas.
Every activity has some risk involved in it. Analyzing the risk involved in a transaction is important to decide whether to proceed with the transaction or not. Similarly in peer-to-peer communication analyzing the ri...
详细信息
Every activity has some risk involved in it. Analyzing the risk involved in a transaction is important to decide whether to proceed with the transaction or not. Similarly in peer-to-peer communication analyzing the risk involved in undertaking a transaction with another peer too is important. It would be much easier for the trusting peer to make a decision of proceeding a transaction with the trusted peer if he knows the risk that the trusted peer is worthy of. In this paper we develop and propose such a methodology which allows the trusting peer to rate the trusted peer in terms of risk that he deserves after the transaction is over.
Caustics are patterns of light focused by reflective or refractive objects. Because of their visually fascinating patterns, several methods have been developed to render caustics. We propose a method for the quick ren...
详细信息
This study is to explore a method of learning support in e-Learning environment including some learning supporters. Especially we develop a learning support method of distance teaching assistants on the Web for proble...
详细信息
ISBN:
(纸本)9781627483308
This study is to explore a method of learning support in e-Learning environment including some learning supporters. Especially we develop a learning support method of distance teaching assistants on the Web for problem solving based group learning. We need to explore the learning models of next generation in knowledge society. Simultaneously, challenge to new pedagogy in learning and education with e-Learning environment is desired. From a viewpoint of learning support, learners can be concerned with learning supporters such as other teachers, domain experts and learners who have already studied the subject matter as well as a teacher at the face-to-face lesson in the learning environment. So, the learning support model needs to include some tools which have some functions of the learning supports. In this paper, we extract learning support patterns from an analysis of dialogue patterns between learners and distance teaching assistants. Moreover, we describe the outline of a bulletin board tool based on the learning support patterns.
Coalescing is a data restructuring operation applicable to temporal databases. It merges timestamps of adjacent or overlapping tuples that have identical attribute values. The likelihood that a temporal query employs ...
详细信息
Coalescing is a data restructuring operation applicable to temporal databases. It merges timestamps of adjacent or overlapping tuples that have identical attribute values. The likelihood that a temporal query employs coalescing is very high. However, coalescing is an expensive and time consuming operation. In this paper, we present a novel temporal relational model through which coalescing becomes quite simple. The basic idea is to augment each time-varying attribute in a temporal relation with two additional attributes that trace changes in values of the corresponding time-varying attribute. One attribute traces changes in values with respect to each individual instance (i.e. tuples having the same key value), while the other attribute traces changes in values globally for all instances (i.e. all tuples in the temporal relation). Using these tracing attributes, coalescing could be easily implemented through a quite simple join-free group-by query. The coalescing query is fully processed and optimized by the underlying database management system.
The paper considers the design of energy-efficient online protocols for the basic problem of message transmission to hosts positioned at unknown distances in ad-hoc wireless networks. The paper formulates a number of ...
详细信息
The paper considers the design of energy-efficient online protocols for the basic problem of message transmission to hosts positioned at unknown distances in ad-hoc wireless networks. The paper formulates a number of variants of this problem and presents optimally competitive algorithms for those variants.
暂无评论