8785272
A Framework for Building Collaboration Tools by Leveraging Industrial Components
Groupware applications allow a distributed group of human users to work apart together over a computer network They are difficult to develop due to the needs to suit a range of collaboration tasks that are often with diverse and evolutionary requirements To address this problem, we propose a new framework in which shared data components conforming to a well-defined interface can be dynamically plugged in for flexible sharing, and a simple transformation tool is provided such that the myriad of industrial collaboration-transparent components can be transformed into shared components The validity of our framework is evaluated by building a suite of typical collaboration tools such as group editors Under our framework, most components in the Java Development Kit (JDK) can be transformed automatically for prototyping collaboration tools With minimal manual work, those tools can be adapted to achieve advanced flexibility, e.g., data and control components can be bound dynamically to switch control protocols.
17885452
Commutativity-based concurrency control in groupware
Commutativity of operations is often exploited in concurrent systems to attain high levels of concurrency. A commutativity-based concurrency control method, called operational transformation (OT), has been actively researched in groupware over the past 15 years. However, much progress can still be made on more practicable approaches to developing and proving OT algorithms. Several constraints have been proposed previously but they are generally difficult to follow and verify in practice. This paper proposes an alternative approach to address this problem. A new consistency model is defined which greatly simplifies the design and proof of OT algorithms
17075751
A collaboration specification language
COCA (Collaborative Objects Coordination Architecture) was proposed as a novel means to model and support collaborations over the Internet. Our approach separates coordination policies from user interfaces and the policies are specified in a logic-based language. Over the past year, both the collaboration model and the specification language have been substantially refined and evaluated through our experience in building real-life collaboration systems. This paper presents the design of the specification language and illustrates the main ideas with a few simple design examples. Semantics, implementation, runtime support, and applications are also covered but not as the focus of this paper.
6337639
Transparent sharing and interoperation of heterogeneous single-user applications
Multi-user applications generally lag behind in features or compatibility with single-user applications. As a result, users are often not motivated to abandon their favorite single-user applications for groupware features that are less frequently used. A well-accepted approach, collaboration transparency, is able to convert off-the-shelf single-user applications into groupware without modifying the source code. However, existing systems have been largely striving to develop generic application-sharing mechanisms and undesirably force users to share the same application in cooperative work. In this paper we analyze this problem and present a novel approach (called intelligent collaboration transparency) to addressing this problem. Our approach allows for heterogeneous application sharing by considering the particular semantics of the applications and the collaboration task in question.
37096144
Operation Propagation in Real-Time Group Editors
Operation propagation refers to the mechanisms and policies used in group editors for the participants to notify each other of their individual editing activities. The timing and granularity of propagation depend on different requirements, such as network bandwidth, session scale, the computational power of the involved sites and the preferences of each user. In this article, we draw on some common design principles in two group editors we have implemented.
46474884
Explicit Efficient Frontier of a Continuous-Time Mean Variance Portfolio Selection Problem
In this work we consider a continuous-time mean-variance portfolio selection problem that is formulated as a bi-criteria optimization problem. The objective is to maximize the expected return and minimize the variance of the terminal wealth. By putting weights on the two criteria one obtains a single objective stochastic control problem which is however not in the standard form. We show that this non-standard problem can be “embedded” into a class of auxiliary stochastic linear-quadratic (LQ) problems. By solving the latter based on the recent development on stochastic LQ problems with indefinite control weighting matrices, we derive the efficient frontier in a closed form for the original mean-variance problem.
6720899
Mode selection and mode-dependency modeling for power-aware embedded systems
Among the techniques for system-level power management, it is not currently possible to guarantee timing constraints and have a comprehensive system model supporting multiple components at the same time. We propose a new method for modeling and selecting the power modes for the optimal system-power management of embedded systems under timing and power constraints. First, we not only model the modes and the transitions overhead at the component level, but we also capture the application-imposed relationships among the components by introducing a mode dependency graph at the system level. Second, we propose a mode selection technique, which determines when and how to change mode in these components such that the whole system can meet all power and timing constraints. Our constraint-driven approach is a critical feature for exploring power/performance tradeoffs in power-aware embedded systems. We demonstrate the application of our techniques to a low-power sensor and an autonomous rover.
38979960
Interpolation Techniques for Geo-spatial Association Rule Mining
Association rule mining has become an important component of information processing systems due to significant increase in its applications. In this paper, our main objective is to find which interpolation approaches are best suited for discovering geo-spatial association rules from unsampled points. We investigate and integrate two interpolation approaches into our geo-spatial association rule mining algorithm. We call them pre-interpolation and post-interpolation approaches.
17329223
Supereulerian planar graphs
We investigate the supereulerian graph problems within planar graphs, and we prove that if a 2-edge-connected planar graph G is at most three edges short of having two edge-disjoint spanning trees, then G is supereulerian except a few classes of graphs. This is applied to show the existence of spanning Eulerian subgraphs in planar graphs with small edge cut conditions. We also determine several extremal bounds for planar graphs to be supereulerian.
36670641
A nonlinear Lagrangian dual for integer programming
Nonlinear Lagrangian theory offers a success guarantee for the dual search via construction of a nonlinear support of the perturbation function at the optimal point. In this paper, a new nonlinear dual formulation of an exponential form is proposed for bounded integer programming. This new formulation possesses an asymptotic strong duality property and guarantees a success in identifying a primal optimum solution. No actual dual search is needed in the solution process when the parameter of the nonlinear Lagrangian formulation is set to be large enough.