After the tide of the Internet and impact of the Internet bubbled, E-Commerce business models have moved toward the click-and-mortar business models which could improve the revenue for keeping survival. This study is to explore the relationship between the click-and-mortar model and its performance based on the innovation approach. From the innovation perspective, three dimensions of the click-...

Let $a, b, k,in K$ and $u, v in U(K)$. We show for any idempotent $ein K$, $(a 0|b 0)$ is e-clean iff $(a 0|u(vb + ka) 0)$ is e-clean and if $(a 0|b 0)$ is 0-clean, $(ua 0|u(vb + ka) 0)$ is too.

Different domains, such as the health care domain, can benefit from an increased use of e-services. However, factors such as vendor lock-in, the lack of standardized infrastructure and quality criteria can slow down the creation and use of e-services in a domain. To encourage the development of e-services there is both a need for simplicity – to enable new actors to use and provide e-services, ...

let a; b; k 2 k and u ; v 2 u(k). we show for any idempotent e 2 k, ( a 0 b 0 ) is e-clean i ( a 0 u(vb + ka) 0 ) is e-clean and if ( a 0 b 0 ) is 0-clean, ( ua 0 u(vb + ka) 0 ) is too.

We consider non-blocking synchronization for dynamic embedded real-time systems such as those that are subject to resource overloads and arbitrary activity arrivals. The multi-writer/multi-reader problem inherently occurs in such systems, when their activities must concurrently and mutually exclusive share data objects. We consider lock-free synchronization for this problem under the unimodal a...

Lock-free programming is a well-known technique for multithreaded programming. Lock-free programming is a way to share changing data among several threads without paying the cost of acquiring and releasing locks. On practice, parallel programming models must include scalable concurrent algorithms and patterns. Lock-free programming patterns play an important role in scalability. This paper is d...

assume that $a$‎, ‎$b$ are banach algebras and that $m:atimes brightarrow b$‎, ‎$m^prime:atimes arightarrow b$ are bounded bilinear mappings‎. ‎we study the relationships between arens regularity of $m$‎, ‎$m^prime$ and the banach algebras $a$‎, ‎$b$‎. ‎for a banach $a‎$‎-bimodule $b$‎, ‎we show that $b$ factors with respect to $a$ if and only if $b^{**}$ is unital as an $a^{**}‎$‎-module‎. ‎le...

A polygonal chain is a sequence of consecutively joined edges embedded in space. A k-chain is a chain of k edges. A polygonal tree is a set of edges joined into a tree structure embedded in space. A unit tree is a tree with only edges of unit length. A chain or a tree is simple if non-adjacent edges do not intersect. We consider the problem about the reconfiguration of a simple chain or tree th...

While single-molecule sensing offers the ultimate detection limit, its throughput is often restricted as sensing events are carried out one at a time in most cases. 2D and 3D DNA origami nanostructures are used as expanded singlemolecule platforms in a new mechanochemical sensing strategy. As a proof of concept, six sensing probes are incorporated in a 7-tile DNA origami nanoassembly, wherein b...