132181
A note on proactive password checking
Nowadays, proactive password checking algorithms are based on the philosophy of the dictionary attack, and they often fail to prevent some weak passwords with low entropy. In this paper, a new approach is proposed to deal with this new class of weak passwords by (roughly) measuring entropy. A simple example is given to exploit effective patterns to prevent low-entropy passwords as the first step of entropy-based proactive password checking.
206485325
Password memorability and security: empirical results
Users rarely choose passwords that are both hard to guess and easy to remember. To determine how to help users choose good passwords, the authors performed a controlled trial of the effects of giving users different kinds of advice. Some of their results challenge the established wisdom.
34419420
A Semantic Analyzer for Aiding Emotion Recognition in Chinese
13986906
Decentralised Coordination for Software Process Enactment
Software process enactment mainly involves coordination of relevant team members to enact various tasks, which is supported by a centralised client/server architecture traditionally. This paper adopts concepts from peer-to-peer computing and presents an innovative approach to support decentralised process enactment. With this approach, team members are supported with coordination by direct communication among peers, which reflects applications’ increasingly distributed nature better. In addition, as a software process may be modelled incompletely at modelling time, a mechanism supporting run-time refinement of incomplete processes is also described in this paper.
36905463
Quasi-threshold Graphs
Abstract Quasi-threshold graphs are defined recursively by the following rules: 1. (1) K1 is a quasi-threshold graph, 2. (2) adding a new vertex adjacent to all vertices of a quasi-threshold graph results in a quasi-threshold graph, 3. (3) the disjoint union of two quasi-threshold graphs is a quasi-threshold graph. This paper gives some new equivalent definitions of a quasi-threshold graph. From them, linear time recognition algorithms follow. We also give linear time algorithms for the edge domination problem and the bandwidth problem in this class of graphs.
1380525
Towards a force-reflecting motion-scale system for microsurgery
This paper presents design aspects of a force-reflecting, motion-scaling teleoperation system for use in microsurgery experiments. A coarse-macro-micro approach is proposed. Two magnetically levitated wrists-a macro-master and a micro-slave-would share a common base positioned at the surgical site by a coarse-motion transport robot. The discussion includes features of the proposed system, a detailed slave wrist description, and aspects of coordination and control for the multistage teleoperation.<<ETX>>
7363256
Towards flapping wing control for a micromechanical flying insect
Considers a 2 DOF resonant thorax structure signed and fabricated for the MFI project. Miniature piezoelectric PZN-PT unimorph actuators were fabricated and used to drive a four-bar transmission mechanism. The current thorax design utilizes two actuated four-bars and a spherical joint to drive a rigid wing. Rotationally compliant flexure joints have been tested with lifetimes over 10/sup 6/ cycles. Wing spars were instrumented with strain gauges for force measurement and closed-loop wing control.