Usability Principles for Augmented Reality Applications in a Smartphone Environment

Through the rapid spread of smartphones, users have access to many types of applications similar to those on desktop computer systems. Smartphone applications using augmented reality (AR) technology make use of users' location information. As AR applications will require new evaluation methods, improved usability and user convenience should be developed. The purpose of the current study is to develop usability principles for the development and evaluation of smartphone applications using AR technology. We develop usability principles for smartphone AR applications by analyzing existing research about heuristic evaluation methods, design principles for AR systems, guidelines for handheld mobile device interfaces, and usability principles for the tangible user interface. We conducted a heuristic evaluation for three popularly used smartphone AR applications to identify usability problems. We suggested new design guidelines to solve the identified problems. Then, we developed an improved AR application prototype of an Android-based smartphone, which later was conducted a usability testing to validate the effects of usability principles.     

Window annealing for pixel-labeling problems

The pixel labeling problems in computer vision are often formulated as energy minimization tasks. Algorithms such as graph cuts and belief propagation are prominent; however, they are only applicable for specific energy forms. For general optimization, Markov Chain Monte Carlo (MCMC) based simulated annealing can estimate the minima states very slowly.This paper presents a sampling paradigm for faster optimization. First, in contrast to previous MCMCs, the role of detailed balance constraint is eliminated. The reversible Markov chain jumps are essential for sampling an arbitrary posterior distribution, but they are not essential for optimization tasks. This allows a computationally simple window cluster sample. Second, the proposal states are generated from combined sets of local minima which achieve a substantial increase in speed compared to uniformly labeled cluster proposals. Third, under the coarse-to-fine strategy, the maximum window size variable is incorporated along with the temperature variable during simulated annealing. The proposed window annealing is experimentally shown to be many times faster and capable of finding lower energy compared to the previous Gibbs and Swendsen-Wang cut (SW-cut) sampler. In addition, the proposed method is compared with other deterministic algorithms like graph cut, belief propagation, and spectral method in their own specific energy forms. Window annealing displays competitive performance in all domains.     

An object-based middleware supporting efficient interoperability on a smart home network

This paper proposes a novel object-based home network middleware for supporting the interoperability among home devices and smart grid devices. This middleware provides various types of abstract objects for flexible representation of heterogeneous home devices, which are classified based on their characteristics. It is also flexible enough to allow addition of new protocols and message conversion between different protocols through an abstraction layer, which are not supported by existing home network middlewares so that various protocols can be supported. As a result, it can be utilized to provide the interoperability among a variety of devices from sensors to typical home appliances as well as smart grid devices such as a home electric generator and a battery, which adopt different protocols. In order to demonstrate that home devices and smart grid devices are interoperable through the proposed middleware, we implement applications based on the middleware on a target platform consisting of embedded boards, sensors and laptops for emulation purposes of a home network. According to our emulation, this middleware can provide efficient interoperability among home devices and smart grid devices for future energy efficient home.     

Bidirectional controlled quantum teleportation and secure direct communication using five-qubit entangled state

A scheme is presented to implement bidirectional controlled quantum teleportation (QT) by using a five-qubit entangled state as a quantum channel, where Alice may transmit an arbitrary single qubit state called qubit A to Bob and at the same time, Bob may also transmit an arbitrary single qubit state called qubit B to Alice via the control of the supervisor Charlie. Based on our channel, we explicitly show how the bidirectional controlled QT protocol works. By using this bidirectional controlled teleportation, espcially, a bidirectional controlled quantum secure direct communication (QSDC) protocol, i.e., the so-called controlled quantum dialogue, is further investigated. Under the situation of insuring the security of the quantum channel, Alice (Bob) encodes a secret message directly on a sequence of qubit states and transmits them to Bob (Alice) supervised by Charlie. Especially, the qubits carrying the secret message do not need to be transmitted in quantum channel. At last, we show this QSDC scheme may be determinate and secure.     

Long-wave interfacial instabilities in a thin electrolyte film undergoing coupled electrokinetic flows: a nonlinear analysis

Spatiotemporal deformations of the free charged surface of a thin electrolyte film undergoing a coupled electrokinetic flow composed of an electroosmotic flow (EOF) on a charged solid substrate and an electrophoretic flow (EPF) at its free surface are explored through linear stability analysis and the long-wave nonlinear simulations. The nonlinear evolution equation for the deforming surface is derived by considering both the Maxwell’s stresses and the hydrodynamic stresses. The electric potential across the film is obtained from the Poisson–Boltzmann equation under the Debye–Hückel approximation. The simulations show that at the charged electrolyte–air interface, the applied electric field generates an EPF similar to that of a large charged particle. The EOF near the solid–electrolyte interface and the EPF at the electrolyte–air interface are in the same (or opposite) directions when the zeta potentials at the two interfaces are of the opposite (or same) signs. The linear and nonlinear analyses of the evolution equation predict the presence of travelling waves, which is strongly modulated by the applied electric field and the magnitude/sign of the interface zeta potentials. The time and length scales of the unstable modes reduce as the sign of zeta potential at the two interfaces is varied from being opposite to same and also with the increasing applied electric field. The increased destabilization is caused by a reverse EPF near the free surface when the interfaces bear the same sign of zeta potentials. Flow reversal by EPF at the free surface occurs at smaller zeta potential of the free surface when the film is thicker because of less influence of the EOF arising at the solid–electrolyte boundary. The amplitude of the surface waves is found to be smaller when the unstable waves travel at a faster speed. The films can undergo pseudo-dewetting when the free surface is almost stationary under the combined influences of EPF and EOF. The free surface instability of the coupled EOF and EPF has some interesting implications in the development of micro/nano fluidic devices involving a free surface.     

经营成本变化对大庄电站经济效益的影响

我国水电蕴藏量居世界首位。近年来水电事业发展迅速,中小型水电项目的经济效益是投资者最为关注的内容,是影响投资者决策的首要因素。本文根据大庄水电站实际年运行费与设计阶段的经营成本对比,分析了经营成本变化的原因以及对项目经济效益的影响。分析结果显示,项目FIRR低于原设计标准,但高于新的财务基准收益率,项目连续亏损尚有其他原因,应做进一步分析。同时提出对经营成本与营业成本两个概念进行理论研究的建议。     

基于LAMP的高性能Web服务器的架构

文章提出了基于LAMP的高性能Web服务器的架构方案,采用了Apache日志、Webalizer日志分析、Cacti流量监控、入侵检测的方法,架构了一个完善的、稳定的、安全的、低廉的高性能Web服务器,满足了中小型企业的要求。     

Shape from shading using graph cuts

In this paper, we investigate the applicability of graph cuts to the SFS (shape-from-shading) problem. We propose a new semi-global method for SFS using graph cuts. The new algorithm combines the local method proposed by Lee and Rosenfeld [C.H. Lee, A. Rosenfeld, Improved methods of estimating shape from shading using the light source coordinate system, Artif. Intell. 26 (1985) 125-143] and a global method using an energy minimization technique. By employing a new global energy minimization formulation, the convex/concave ambiguity problem of Lee and Rosenfeld's method can be resolved efficiently. A new combinatorial optimization technique, the graph cuts method, is used for the minimization of the proposed energy functional. Experimental results on a variety of synthetic and real-world images show that the proposed algorithm reconstructs the 3-D shape of objects very efficiently.     

Maximum-likelihood registration of range images with missing data

Missing data are common in range images, due to geometric occlusions, limitations in the sensor field of view, poor reflectivity, depth discontinuities, and cast shadows. Using registration to align these data often fails, because points without valid correspondences can be incorrectly matched. This paper presents a maximum likelihood method for registration of scenes with unmatched or missing data. Using ray casting, correspondences are formed between valid and missing points in each view. These correspondences are used to classify points by their visibility properties, including occlusions, field of view, and shadow regions. The likelihood of each point match is then determined using statistical properties of the sensor, such as noise and outlier distributions. Experiments demonstrate a high rates of convergence on complex scenes with varying degrees of overlap.     

Runtime support for scalable programming in Java

The paper research is concerned with enabling parallel, high-performance computation—in particular development of scientific software in the network-aware programming language, Java. Traditionally, this kind of computing was done in Fortran. Arguably, Fortran is becoming a marginalized language, with limited economic incentive for vendors to produce modern development environments, optimizing compilers for new hardware, or other kinds of associated software expected of by today’s programmers. Hence, Java looks like a very promising alternative for the future. The paper will discuss in detail a particular environment called HPJava. HPJava is the environment for parallel programming—especially data-parallel scientific programming—in Java. Our HPJava is based around a small set of language extensions designed to support parallel computation with distributed arrays, plus a set of communication libraries. A high-level communication API, Adlib, is developed as an application level communication library suitable for our HPJava. This communication library supports collective operations on distributed arrays. We include Java Object as one of the Adlib communication data types. So we fully support communication of intrinsic Java types, including primitive types, and Java object types.