By Topic

Computer Supported Cooperative Work in Design (CSCWD), 2011 15th International Conference on

Date 8-10 June 2011

Filter Results

Displaying Results 1 - 25 of 139
  • [Front cover]

    Publication Year: 2011 , Page(s): c1
    Save to Project icon | Request Permissions | PDF file iconPDF (87 KB)  
    Freely Available from IEEE
  • Sponsors

    Publication Year: 2011 , Page(s): 1
    Save to Project icon | Request Permissions | PDF file iconPDF (85 KB)  
    Freely Available from IEEE
  • Committees

    Publication Year: 2011 , Page(s): 1
    Save to Project icon | Request Permissions | PDF file iconPDF (43 KB)  
    Freely Available from IEEE
  • Program committee members:

    Publication Year: 2011 , Page(s): 1
    Save to Project icon | Request Permissions | PDF file iconPDF (34 KB)  
    Freely Available from IEEE
  • Preface

    Publication Year: 2011 , Page(s): 1
    Save to Project icon | Request Permissions | PDF file iconPDF (31 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2011 , Page(s): i - ix
    Save to Project icon | Request Permissions | PDF file iconPDF (142 KB)  
    Freely Available from IEEE
  • From computer-aided drafting to knowledge supported cooperative design

    Publication Year: 2011 , Page(s): 1
    Save to Project icon | Request Permissions | PDF file iconPDF (102 KB)  
    Freely Available from IEEE
  • Cooperation and cooperative design for a new automotive engine in the Renault group

    Publication Year: 2011 , Page(s): 2
    Save to Project icon | Request Permissions | PDF file iconPDF (98 KB)  
    Freely Available from IEEE
  • Human and judgemental factors in collaborative demand forecasting

    Publication Year: 2011 , Page(s): 3
    Save to Project icon | Request Permissions | PDF file iconPDF (99 KB)  
    Freely Available from IEEE
  • Development of a face-to-face meeting capture and indexing process

    Publication Year: 2011 , Page(s): 4 - 8
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (545 KB) |  | HTML iconHTML  

    A face-to-face (F2F) meeting capture and indexing process could provide an internal feedback mechanism so that results can be monitored against change interventions decided at product lifecycle management (PLM) or performance development review (PDR) meetings. It could also assist people who do not currently have the knowledge or authority to act on what was discussed to share and reflect on the F2F meeting content after the event. In this paper a prototype is described in use with the continuous improvement Plan-Do-Check-Act (PDCA) cycle as a proof-of-concept in BAE Systems. More work should be completed to make the captioning of the F2F meeting content automatic or semi automatic. The presentation of the content in the groupware webpage may also be developed so that there is easier navigation. It would also be useful to have the variables that influence the profitability of the products to be displayed on the webpage so that changes can be tracked against business performance. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An automatic method of data warehouses multi-dimension modeling for distributed information systems

    Publication Year: 2011 , Page(s): 9 - 16
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (363 KB) |  | HTML iconHTML  

    Nowadays many companies built enterprise level data warehouses (DW) for decision making support. However explosive data accumulated in distributed databases in company or across companies with the widely use of Computer Supported Cooperative Work in Design (CSCWD) technologies. Therefore it becomes a time costing task for engineers to construct the multidimensional model of data warehouse. This research presents an ontology approach to eliminate data source heterogeneity aiming to design the conceptual structure of data warehouse automatically. The proposed approach includes a domain ontology mete-data model, which consists of data, concept, ontology and resource repositories, to describe the semantic meaning of the data sources. The supply-driven and demand-driven methodologies are combined together to construct the concept model of DW. By supply-driven method, domain ontology system is extracted bottom-up from data sources; on the other hand, by demand-driven method, relationships of the concepts in the ontology system are extended top-down according to the business process. Furthermore, candidate of the data warehouse concept model is derived according to the relationships of the concepts in the ontology system. After discussing the process of data warehouse designing, a case study is given to show how our method is used in clinic domain. The result shows that ontology method could help users designing data warehouse more easily. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Contextualizing scientific workflows in cooperative design

    Publication Year: 2011 , Page(s): 17 - 22
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (696 KB) |  | HTML iconHTML  

    Scientific workflows (SWFs) aim to automate cooperative design through compilation of known sequences of actions for routine procedures. However, current SWF systems lack the ability, in the one hand, to capture the context in which a SWF is designed and developed, and, in the other hand, to deliver a real-time assistance to help designers to make effective decisions in the selection of relevant SWFs for their problem. We propose a context-oriented framework for improving cooperative SWF design. This framework allows making context explicit and realizing the contextualization of SWFs in a SWF repository (and thus sharable with other scientists). Context is made explicit thanks to Contextual Graphs (CxGs), a formalism for representing uniformly all the ingredients of a cooperative SWF design process. Thus, scientists can customize information and formalize their research and strategies in a shared context. We use the context-oriented framework in an application in virtual screening. Finally, context-based formalisms, such as CxGs, appear as the key element to enhance users' cooperation during the SWF design phase. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A method for one-dimensional topological entity matching in integration of heterogeneous CAD systems

    Publication Year: 2011 , Page(s): 23 - 28
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (539 KB) |  | HTML iconHTML  

    In the feature modeling procedure, one-dimensional topological entities (edges) are always used as references or operational objects. Hence, to realize the integration of heterogeneous CAD systems, the corresponding one-dimensional topological entities must be found in the target CAD system to match the source ones. This paper presents a method to gain one-dimensional topological entity matching. The method is based on two algorithms, i.e. combining algorithm and matching algorithm. The combining algorithm is adopted to combine the edges retrieved in a source CAD system. Then, for each combined edge, the matching edges are found by using the matching algorithm in a target CAD system. The experiments prove that our method is valid for both offline and online integrations. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The integration method research of MSL and collaborative simulation platform

    Publication Year: 2011 , Page(s): 29 - 33
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (362 KB) |  | HTML iconHTML  

    This article describes two multi-disciplinary modeling and simulation approaches of complex products, points out the language advantage of physical simulation modeling language modelica. By describing the class structure of the language, in particular, the structural characteristics of the equation, It summarizes the modelica language modeling process, and makes analysis for the interpreter and the solver. It graphically details the architecture, hierarchical modeling, high level modeling tools of collaborative simulation platform COSIM. Against the language specific equation expression principle and the characteristics of simulation platform, the integration method of language and platform was creatively proposed, and the key technologies are needed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Procedure contextualization based on collaborative database administration

    Publication Year: 2011 , Page(s): 34 - 41
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (347 KB) |  | HTML iconHTML  

    Database administration tasks often involve several actors within the organization. The main actor is the database administrator (DBA) who interacts with other DBAs and with other actors. Thus, sharing knowledge among them is crucial. This knowledge relies on each member's skills, experiences and background, and also on the common activities, conditions, facts, and situations faced during the administration of the database and the setting of the environment. Exchanging knowledge between the DBA and the other actors can only be effective if there is a common interpretive focus and a shared context where they can understand each other and exchange their experiences. The concept of context plays an important role in collaboration, especially in communication, interaction and knowledge sharing. In addition, and under temporal and financial pressures, this can help a DBA in avoiding misunderstandings and accidents such as destroying each other's work or imposed system downtime. The paper presents how collaboration improves the contextualization of DBA procedures and the development of the DBA practices. Our work focuses on collaboration between actors with different roles according to an internal observation that is to say from the point of view of the main actor (i.e. DBA) to help him achieve his objective. This is a key element in the building of a support system for DBA acting as a real context-based intelligent assistant system based on a collaborative work. Contextual Graphs are used to illustrate the collaborative approach to database administration tasks. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Greedy feature selection for ranking

    Publication Year: 2011 , Page(s): 42 - 46
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (168 KB) |  | HTML iconHTML  

    This paper is concerned with a study on the feature selection for ranking. Learning to rank is a useful tool for collaborative filtering and many other collaborative systems, which many algorithms have been proposed for dealing this issue. But feature selection methods receive little attention, despite of their importance in collaborative filtering problems: First, recommender systems always have massive data. Using all these data in learning to rank is unrealistic and impossible. Second, we discuss that not all the features are useful for a user's query. So choosing the most relevant data is necessary and useful. To amend this problem, we describe an algorithm called FBPCRank to choose the most relevant features for ranking. Our method combines two measures of good subsets of features, which not only can decrease the loss objective, but also reduce total similarity scores between any two features. We adopt forward and backward methods to choose the most relative features and use Pearson correlation coefficient to measure the similarity of two features. The experiments indicate that our method can outperform other state-of-the-art algorithms by selecting just small amounts of features. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tele-Board: Enabling efficient collaboration in digital design spaces

    Publication Year: 2011 , Page(s): 47 - 54
    Cited by:  Papers (6)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1109 KB) |  | HTML iconHTML  

    Remote collaboration among geographically dispersed team members has become standard practice for many companies and research teams. A number of computer supported collaborative work systems exist, but there still lacks acceptable support for teams working in creative settings, where traditionally numerous physical and analog tools are used. We have created an environment for teams applying creative methods that allows them to work together efficiently across distances, without having to change their working modes. We present the Tele-Board system, which combines video conferencing with a synchronous transparent whiteboard overlay. This setup enables regionally separated team members to simultaneously manipulate artifacts while seeing each other's gestures and facial expressions. Our system's flexible architecture maximizes hardware independence by supporting a diverse selection of input devices. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Instruction-level hardware/software partition through DFG exploration

    Publication Year: 2011 , Page(s): 55 - 60
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (410 KB) |  | HTML iconHTML  

    To reduce the huge search space when customizing instruction-level accelerators for the application specific instruction-set processor (ASIP), this paper proposes an automated instruction-level hardware/software partition method based on the data flow graph exploration. This method integrates the instruction identification and selection using an iterative improvement strategy. The search space is reduced via considering the performance factors during the identification. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The complexity of a data privacy protection algorithm

    Publication Year: 2011 , Page(s): 61 - 68
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (157 KB) |  | HTML iconHTML  

    To share data with other parties in computer collaboration is an important issue of data security. k-anonymity and ℓ-diversity are used to protect privacy and secure data sharing. It was proved that optimal k-anonymity are NP hard for k ≥ 3 and that there is a polynomial algorithm for optimal 2-anonymity. This paper proves that an optimal 2-diversity is NP hard. Since ℓ-diversity must be ℓ-anonymity, it follows that the ℓ-diversity is NP hard for ℓ ≥ 2. The result shows that finding polynomial algorithm for efficient (but not optimal) ℓ-diversity is important. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Resilient workflows for cooperative design

    Publication Year: 2011 , Page(s): 69 - 75
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (943 KB) |  | HTML iconHTML  

    This paper describes an approach to extend process modeling for engineering design applications with fault-tolerance and resilience capabilities. It is based on the requirements for application-level error handling, which is a requirement for petascale and exascale scientific computing. This complements the traditional fault-tolerance management features provided by the existing hardware and distributed systems. These are often based on data and operations duplication and migration, and on checkpoint-restart procedures. We show how they can be optimized for high-performance infrastructures. This approach is applied on a prototype tested against industrial testcases for optimization of engineering design artifacts.his electronic document is a “live” template. The various components of your paper [title, text, heads, etc.] are already defined on the style sheet, as illustrated by the portions given in this document. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • GPU accelerate parallel Odd-Even merge sort: An OpenCL method

    Publication Year: 2011 , Page(s): 76 - 83
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (253 KB) |  | HTML iconHTML  

    Odd-Even merge sort is a basic problem in computer supported cooperative work in design area. However, it is not effective because of the high complexity O(nlg2n) in CPU platform. In this paper, we present a novel implementation based on the OpenCL programming model on recent GPU (Graphic Processing Unit). Our implementation was based on Knuth's algorithm and do some change. Due to limitations of OpenCL, we utilize a flag variable to make it avoid the direct backward control flow. As results, our implementation achieves 18× speedups compared with the CPU C++ STL quick sort. And it gets almost linear speedup for next generations of GPU because of the complete parallelism in each iteration process. Meanwhile, our approach makes the odd-even merge sort effectively in practice because of the high performance. Furthermore, the approach used in this paper for cooperating thousands of processing units to parallel process can also be used in other cooperation areas. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A framework to report and to analyse a debate

    Publication Year: 2011 , Page(s): 84 - 90
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (824 KB) |  | HTML iconHTML  

    The paper introduces a framework whereby arguments put forward in a discussion concerning a specific decision can be graphically represented as a directed graph and analysed according to different decision procedures. The intended benefits of the proposed framework are to support a decision manager in the light of the experts' arguments and to record the motivations for the decisions in a corporate memory. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fast recursive detailed routing algorithm for hierarchical FPGAs

    Publication Year: 2011 , Page(s): 91 - 96
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (296 KB) |  | HTML iconHTML  

    Traditional sequence based routing algorithms for FPGAs usually route only one net at a time, so as to simplify the routing problems. However, with the number of logic blocks in the FPGAs becomes larger and larger, the time need to route each net can increase significantly. A new recursive detailed routing algorithm is proposed to address this problem. As decided by its recursive nature, this algorithm can only be applied for hierarchical FPGAs, which of the architectural features with its connection patterns is also presented in detail in this paper. The overall algorithm begins its routing from the topmost cluster and continues to route for each cluster from top down recursively, where the routing clusters map to the architectural cluster exactly. At each cluster level, a new heuristic is proposed to solve the specific routing problem. The scale of the problem is so small that the heuristic can be considered deterministic and quickly to solve. The proposed algorithm also takes advantages of the architectural features such as the connection patterns of switch box. As a result, the proposed algorithm is very fast in runtime due to all these facts. The experimental results show that detailed routing for a very large circuit can be done very quickly in just a few seconds. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic process adaptation: A context-aware approach

    Publication Year: 2011 , Page(s): 97 - 104
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (616 KB) |  | HTML iconHTML  

    Dynamism of day-to-day activities in organizations is inextricably linked and there is a variety of information, insight and reasoning being processed between people and systems, in carrying out a business process. We argue that flexibility in processes could be managed in real time, using context information collected in the work environment. This paper proposes a context management architecture approach that aims to improve and automate dynamic process adaptation. We explain how process adaptation may occur in real time and discuss a scenario for this proposal. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A roadmap to the Collaboration Maturity Model (CollabMM) evolution

    Publication Year: 2011 , Page(s): 105 - 112
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (407 KB) |  | HTML iconHTML  

    Organizations have been relying on collaboration for productivity improvement and knowledge sharing. The first step to foster collaboration in organizations is to make it explicit. With this aim, the Collaboration Maturity Model (CollabMM) was proposed and evaluated. The lessons learned during model applications in previous work pointed out the need to review both the model and its evaluation instruments. A literature review also showed some improvement opportunities. Therefore, the objective of this work is to develop a roadmap to highlight the main opportunities of evolution in CollabMM. These opportunities will compose our research agenda in this topic and guide future work. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.