Simplified computation and generalization of the refined process structure tree

A business process is often modeled using some kind of a directed flow graph, which we call a workflow graph. The Refined Process Structure Tree (RPST) is a technique for workflow graph parsing, i.e., for discovering the structure of a workflow graph, which has various applications. In this paper, we provide two improvements to the RPST. First, we propose an alternative way to compute the RPST that is simpler than the one developed originally. In particular, the computation reduces to constructing the tree of the triconnected components of a workflow graph in the special case when every node has at most one incoming or at most one outgoing edge. Such graphs occur frequently in applications. Secondly, we extend the applicability of the RPST. Originally, the RPST was applicable only to graphs with a single source and single sink such that the completed version of the graph is biconnected. We lift both restrictions. Therefore, the RPST is then applicable to arbitrary directed graphs such that every node is on a path from some source to some sink. This includes graphs with multiple sources and/or sinks and disconnected graphs.

Flexible service systems

Service science combines scientific, management, and engineering disciplines to improve the understanding of how service systems cooperate to create business value. Service systems are complex configurations of people, technologies, and resources that coexist in a common environment of service provisioning. While the general concepts of service science are understood and agreed upon, the representation of service systems using models is still in its infancy. In this chapter, we look at business processes and their role in properly representing service systems. We propose flexible process graphs, a high-level process modeling language, and extend it in order to specify service systems and their compositions within shared environments in a flexible way. The discussion in this chapter is the first step towards a formal description of service science environment, including service systems, networks, and whole ecology.

Hypergraph-based modeling of ad-hoc business processes

Process models are usually depicted as directed graphs, with nodes representing activities and directed edges control flow. While structured processes with pre-defined control flow have been studied in detail, flexible processes including ad-hoc activities need further investigation. This paper presents flexible process graph, a novel approach to model processes in the context of dynamic environment and adaptive process participants’ behavior. The approach allows defining execution constraints, which are more restrictive than traditional ad-hoc processes and less restrictive than traditional control flow, thereby balancing structured control flow with unstructured ad-hoc activities. Flexible process graph focuses on what can be done to perform a process. Process participants’ routing decisions are based on the current process state. As a formal grounding, the approach uses hypergraphs, where each edge can associate any number of nodes. Hypergraphs are used to define execution semantics of processes formally. We provide a process scenario to motivate and illustrate the approach.

Semantic search as inference : applications in health informatics

This thesis developed new search engine models that elicit the meaning behind the words found in documents and queries, rather than simply matching keywords. These new models were applied to searching medical records: an area where search is particularly challenging yet can have significant benefits to our society.

Hydrogen-bonded two- and three-dimensional polymeric structures in the ammonium salts of 3,5-dinitrobenzoic acid, 4-nitrobenzoic acid and 2,4-dichlorobenzoic acid

The structures of the ammonium salts of 3,5-dinitrobenzoic acid, NH4+ C7H3N2O6- (I), 4-nitrobenzoic acid, NH4+ C7H4N2O4- . 2H2O (II) and 2,4-dichlorobenzoic acid, NH4+ C7H3Cl2O2- . 0.5H2O (III), have been determined and their hydrogen-bonded structures are described. All salts form hydrogen-bonded polymeric structures, three-dimensional in (I) and two-dimensional in (II) and (III). With (I), a primary cation-anion cyclic association is formed [graph set R3/4(10)] through N-H...O hydrogen bonds, involving a carboxyl O,O' group on one side and a single carboxyl O-atom on the other. Structure extension involves both N-H...O hydrogen bonds to both carboxyl and nitro O-atom acceptors. With structure (II), the primary inter-species interactions and structure extension into layers lying parallel to (0 0 1) are through conjoined cyclic hydrogen-bonding motifs: R3/4(10) [one cation, a carboxyl (O,O') group and two water molecules] and centrosymmetric R2/4(8) [two cations and two water molecules]. The structure of (III) also has conjoined R3/4(10) and centrosymmetric R2/4(8) motifs in the layered structure but these differ in that he first involves one cation, a carboxyl (O,O') as well as a carboxyl (O) group and one water molecule, the second, two cations and two carboxyl O-groups. The layers lie parallel to (1 0 0). The structures of the salt hydrates (II) and (III) reported in this work, giving two-dimensional layered arrays through conjoined hydrogen-bonded nets provide further illustrations of a previously indicated trend among ammonium salts of carboxylic acids, but the anhydrous three-dimensional structure of (I) is inconsistent.

Dictionary learning and sparse coding on Grassmann manifolds : an extrinsic solution

Recent advances in computer vision and machine learning suggest that a wide range of problems can be addressed more appropriately by considering non-Euclidean geometry. In this paper we explore sparse dictionary learning over the space of linear subspaces, which form Riemannian structures known as Grassmann manifolds. To this end, we propose to embed Grassmann manifolds into the space of symmetric matrices by an isometric mapping, which enables us to devise a closed-form solution for updating a Grassmann dictionary, atom by atom. Furthermore, to handle non-linearity in data, we propose a kernelised version of the dictionary learning algorithm. Experiments on several classification tasks (face recognition, action recognition, dynamic texture classification) show that the proposed approach achieves considerable improvements in discrimination accuracy, in comparison to state-of-the-art methods such as kernelised Affine Hull Method and graph-embedding Grassmann discriminant analysis.

Joint 2D and 3D cues for image segmentation towards robotic applications

This thesis investigates the fusion of 3D visual information with 2D image cues to provide 3D semantic maps of large-scale environments in which a robot traverses for robotic applications. A major theme of this thesis was to exploit the availability of 3D information acquired from robot sensors to improve upon 2D object classification alone. The proposed methods have been evaluated on several indoor and outdoor datasets collected from mobile robotic platforms including a quadcopter and ground vehicle covering several kilometres of urban roads.

India's vocational education capacity to support the anticipated economic growth

The buoyancy that the Indian economy experienced between 2000 and 2010, in spite of the global downturn of 2008, is no longer a reality. Growth projections for 2012-13 have been reassessed to 6.5 per cent. This is still higher than most other developed economies of the world (see Figure 1.1), however the growth rate is slowing. The World Bank in its recent forecasts1 expects India’s growth rates not to extend beyond 7.2 % and 7.4 % in the years 2013-14 and 2014-15, respectively. Similarly, the Planning Commission has scaled down the growth target for the 12th Five Year Plan (2012-17) from 9% to 8%. Different reports note different rates, but the consistent message is that the projection of India’s economy is on a downward trend...

Tensor-based item recommendation using probabilistic ranking in social tagging systems

A common problem with the use of tensor modeling in generating quality recommendations for large datasets is scalability. In this paper, we propose the Tensor-based Recommendation using Probabilistic Ranking method that generates the reconstructed tensor using block-striped parallel matrix multiplication and then probabilistically calculates the preferences of user to rank the recommended items. Empirical analysis on two real-world datasets shows that the proposed method is scalable for large tensor datasets and is able to outperform the benchmarking methods in terms of accuracy.

A sparse hybrid map for vision-guided mobile robots

This paper introduces a minimalistic approach to produce a visual hybrid map of a mobile robot’s working environment. The proposed system uses omnidirectional images along with odometry information to build an initial dense posegraph map. Then a two level hybrid map is extracted from the dense graph. The hybrid map consists of global and local levels. The global level contains a sparse topological map extracted from the initial graph using a dual clustering approach. The local level contains a spherical view stored at each node of the global level. The spherical views provide both an appearance signature for the nodes, which the robot uses to localize itself in the environment, and heading information when the robot uses the map for visual navigation. In order to show the usefulness of the map, an experiment was conducted where the map was used for multiple visual navigation tasks inside an office workplace.

The slumbarumba jumbuck problem

The potential for simple linear relationships arising from a computer game to build student modelling and "world problem" skills is explored. The fundamental capability of the spreadsheet to tabulate and graph possible solutions is used to lay bare the problem structure for the students.

Crossword puzzle attack on NLS

NLS is one of the stream ciphers submitted to the eSTREAM project. We present a distinguishing attack on NLS by Crossword Puzzle (CP) attack method which is introduced in this paper. We build the distinguisher by using linear approximations of both the non-linear feedback shift register (NFSR) and the nonlinear filter function (NLF). Since the bias of the distinguisher depends on the Konst value, which is a key-dependent word, we present the graph showing how the bias of distinguisher vary with Konst. In result, we estimate the bias of the distinguisher to be around O(2^−30). Therefore, we claim that NLS is distinguishable from truly random cipher after observing O(2^60) keystream words. The experiments also show that our distinguishing attack is successful on 90.3% of Konst among 2^32 possible values. We extend the CP attack to NLSv2 which is a tweaked version of NLS. In result, we build a distinguisher which has the bias of around 2− 48. Even though this attack is below the eSTREAM criteria (2^−40), the security margin of NLSv2 seems to be too low.

Evaluations of BIM : frameworks and perspectives

This paper examines the evaluation of BIM-enabled projects. It provides a critical review of the three main areas of measurement, namely technology, organization/people and process. Using two documented case studies of BIM implementation, the paper illustrates the benefits realized by project owners and contractors, and illustrates a lack of attention relative to contextual factors affecting the adoption and deployment of BIM. The paper has three main contributions. First, it identifies and discusses the lack of and difficulty surrounding standardized assessment methods for evaluating BIM-enabled projects. Second, it proposes a conceptual model that includes contextual attributes and demonstrates how the proposed framework reaches beyond simple evaluation to encompass the documentation of BIM’s benefits, lessons learned, challenges and adopted solutions. Third, it shows how the framework can account for existing business processes, organizational process assets, and enterprise level factors. The paper aims to provide a conceptual basis for evaluation and a starting point for benchmarking.

On secure multi-party computation in black-box groups

We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function f G (x 1,...,x n ) = x 1 ·x 2 ⋯ x n in an arbitrary finite group (G,·), where the input of party P i is x i  ∈ G for i = 1,...,n. For flexibility, we are interested in protocols for f G which require only black-box access to the group G (i.e. the only computations performed by players in the protocol are a group operation, a group inverse, or sampling a uniformly random group element). Our results are as follows. First, on the negative side, we show that if (G,·) is non-abelian and n ≥ 4, then no ⌈n/2⌉-private protocol for computing f G exists. Second, on the positive side, we initiate an approach for construction of black-box protocols for f G based on k-of-k threshold secret sharing schemes, which are efficiently implementable over any black-box group G. We reduce the problem of constructing such protocols to a combinatorial colouring problem in planar graphs. We then give two constructions for such graph colourings. Our first colouring construction gives a protocol with optimal collusion resistance t < n/2, but has exponential communication complexity O(n*2t+1^2/t) group elements (this construction easily extends to general adversary structures). Our second probabilistic colouring construction gives a protocol with (close to optimal) collusion resistance t < n/μ for a graph-related constant μ ≤ 2.948, and has efficient communication complexity O(n*t^2) group elements. Furthermore, we believe that our results can be improved by further study of the associated combinatorial problems.

Social media and physicians : exploring the benefits and challenges

Healthcare professionals’ use of social media platforms, such as blogs, wikis, and social networking web sites has grown considerably in recent years. However, few studies have explored the perspectives and experiences of physicians in adopting social media in healthcare. This article aims to identify the potential benefits and challenges of adopting social media by physicians and demonstrates this by presenting findings from a survey conducted with physicians. A qualitative survey design was employed to achieve the research goal. Semi-structured interviews were conducted with 24 physicians from around the world who were active users of social media. The data were analyzed using the thematic analysis approach. The study revealed six main reasons and six major challenges for physicians adopting social media. The main reasons to join social media were as follows: staying connected with colleagues, reaching out and networking with the wider community, sharing knowledge, engaging in continued medical education, benchmarking, and branding. The main challenges of adopting social media by physicians were also as follows: maintaining confidentiality, lack of active participation, finding time, lack of trust, workplace acceptance and support, and information anarchy. By revealing the main benefits as well as the challenges of adopting social media by physicians, the study provides an opportunity for healthcare professionals to better understand the scope and impact of social media in healthcare, and assists them to adopt and harness social media effectively, and maximize the benefits for the specific needs of the clinical community.