ppxscal/embedding_network huggingface dataset:
What did you learn from practice today? Exploring experiences from a Danish R&D effort in digital construction
Authors: Anita Moum, Christian Koch, Tore I. Haugen
Venue: Advanced Engineering Informatics (2009)

The Architecture-Engineering-Construction (AEC) industry has been slow in turning the potential of Information and Communication Technologies into greater efficiency and productivity. This is a phenomenon which can be observed in many countries, and in Denmark this issue has been recognized as a major problem for the further development of the AEC industry. The public-private and nationally funded R&D program 'Digital Construction' was initiated in 2003 to establish a common platform for exchanging digital information and stimulating digital integration in the Danish AEC industry. This paper reports on the lessons learned from developing strategies, demands and guidelines in the 'Digital Construction' program and from adapting one of its 'digital foundations', the '3D Working Method', to the design process of the large-scale building project 'The Icelandic National Concert and Conference Centre'. The explorations are based on a process evaluation of the R&D program and a qualitative case study of the building project. The paper reports on identified factors enabling or hindering the adaptation, as well as on the benefits and challenges experienced from using and exchanging 3D object models according to the '3D Working Method'. The paper concludes that the adaptation has been successful due to the initial ambitions of the project actors. Nevertheless, there are still many challenges to be overcome. The findings indicate that the introduction of the '3D Working Method' to the real-life project depended on the success of balancing an array of the factors identified across the R&D program and the different levels within the building project. Three especially crucial balancing acts are explored; first, the power of the 'implementer' versus the expected risk and benefits of implementation, second, the strategies and guidelines within the program versus the resources for learning and the organizational traditions for using digital tools, and third, the level of ambition versus the skills of the users and the potential of the technology to address real-life practice. Mastering these balancing acts requires a broad understanding of both the project and its context. The findings from qualitative and holistic studies as presented in this paper are valuable for building such understanding, and for further learning and improvement regarding strategies for integrating ICT in architectural and engineering practice.
A Hybridizable and Superconvergent Discontinuous Galerkin Method for Biharmonic Problems
Authors: Bernardo Cockburn, Bo Dong, Johnny Guzmán
Venue: Journal of Scientific Computing (2009)

In this paper, we introduce and analyze a new discontinuous Galerkin method for solving the biharmonic problem Δ2 u=f. The method has two main, distinctive features, namely, it is amenable to an efficient implementation, and it displays new superconvergence properties. Indeed, although the method uses as separate unknowns u,¿ u,Δu and ¿Δu, the only globally coupled degrees of freedom are those of the approximations to u and Δu on the faces of the elements. This is why we say it can be efficiently implemented. We also prove that, when polynomials of degree at most k¿1 are used on all the variables, approximations of optimal convergence rates are obtained for both u and ¿ u; the approximations to Δu and ¿Δu converge with order k+1/2 and k¿1/2, respectively. Moreover, both the approximation of u as well as its numerical trace superconverge in L 2-like norms, to suitably chosen projections of u with order k+2 for k¿2. This allows the element-by-element construction of another approximation to u converging with order k+2 for k¿2. For k=0, we show that the approximation to u converges with order one, up to a logarithmic factor. Numerical experiments are provided which confirm the sharpness of our theoretical estimates.
CAD Interactions for Increasing Designers Awareness of Manufacturability
Authors: Yvon Gardan, Mael Hilléreau, Estelle Perrin
Venue: Proceeding of the 2006 conference on Leading the Web in Concurrent Engineering: Next Generation Concurrent Engineering (2006)

This paper outlines the way we think future CAD systems should take into account manufacturing, and more broadly speaking, how they could give support for CE and PLM. We show that DIJA project --which is based on a top-down design methodology called “synthetic design” --is able to connect design tools with manufacturing knowledge. The latter is formalised into rules which are linked to DIJA shape model and design tools, so that designers are advised by the system regarding manufacturing-related considerations. Trade rules are modelled and checked by means of two kinds of graphs which evolve --as the design does --thanks to a tools-integrated propagation mechanism. A prototype is demonstrated through a typical design scenario.
Finite Sets as Complements of Finite Unions of Convex Sets
Authors: Jim Lawrence, Walter Morris
Venue: Discrete Computational Geometry (2009)

Suppose S&#x2286;&#x211d;d is a set of (finite) cardinality n, whose complement can be written as the union of k convex sets. It is perhaps intuitively appealing that when n is large k must also be large. This is true, as is shown here. First the case in which the convex sets must also be open is considered, and in this case a family of examples yields an upper bound, while a simple application of a theorem of Bj&#x00f6;rner and Kalai yields a lower bound. Much cruder estimates are then obtained when the openness restriction is dropped. For a given set S the problem of determining the smallest number of convex sets whose union is &#x211d;d &#x2216;S is shown to be equivalent to the problem of finding the chromatic number of a certain (infinite) hypergraph &#x210b;S . We consider the graph $\mathcal {G}_{S}$whose edges are the 2-element edges of &#x210b;S , and we show that, when d=2, for any sufficiently large set S, the chromatic number of $\mathcal{G}_{S}$will be large, even though there exist arbitrarily large finite sets S for which $\mathcal{G}_{S}$does not contain large cliques.
Children and embodied interaction: seeking common ground
Authors: Alissa N. Antle, Ylva Fernaeus, Paul Marshall
Venue: Proceedings of the 8th International Conference on Interaction Design and Children (2009)

As computation plays an ever larger role as an embedded part of the environment, research that seeks to understand the embodied nature of children's interactions with computation becomes increasingly important. Embodied interaction is an approach to understanding human-computer interaction that seeks to investigate and support the complex interplay of mind, body and environment in interaction. Recently, such a perspective has been used to discuss human actions and interactions with a range of computational applications including tangibles, mobiles, robotics and gesture-based interfaces. Physically-based forms of child computer interaction including body movements, the ability to touch, feel, manipulate and build sensory awareness of the relationships in the world are crucial to children's cognitive and social development. This workshop aims to critically explore the different approaches to incorporating an embodied perspective in children's interaction design and HCI research, and to develop a shared set of understandings and identification of differences, similarities and synergies between our research approaches.
Quantitative Approaches in Object-Oriented Software Engineering
Authors: Giovanni Falcone, Yann-Gaël Guéhéneuc, Christian F. Lange, Zoltán Porkoláb, Houari Sahraoui
Venue: Object-Oriented Technology. ECOOP 2008 Workshop Reader: ECOOP 2008 Workshops Paphos, Cyprus, July 7-11, 2008 Final Reports (2008)

The QAOOSE 2008 workshop has been held at ECOOP 2008 conference in Paphos, Cyprus on July 8th, 2008. This was the twelfth of the series of QAOOSE workshops intended to bring researchers and practitioners both from academia and industry together. The workshop provided a forum to discuss the current state of the art and the practice in the area of quantitative approaches in the fields related to object-orientation. This report includes a summary of the technical presentations and the subsequent discussions. Six papers has been accepted by the workshop organizers. The presentations were followed by vivid discussions.
Towards a virtual organization for data cyberinfrastructure
Authors: Christine L. Borgman, Geoffrey C. Bowker, Thomas A. Finholt, Jillian C. Wallis
Venue: Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries (2009)

We report on the exploratory stages of multi-university, multi-research-site, multi-year effort to investigate and compare data practices in multiple cyberinfrastructure projects and their emerging virtual organizations. Our long-term goal is to understand the data practices and data management requirements of virtual organizations and their implications for the design and development of data digital libraries. We have constructed our own virtual organization as a participant-observer approach to the research. Results to date suggest that collaborative technologies are emergent and that defining and scoping the data products of collaborations continues to be problematic.
Making Lean Six Sigma Data Sets Minitab Friendly or The Best Way to Format Data for Statistical Analysis
Authors: David Rasmusson, Cynthia Butler
Venue:  (2009)

Most people who have been exposed to Lean, Six Sigma, or other process improvement training have learned good data collection, plotting, and analysis methods, along with how to use Minitab statistical software to help with those tasks. However, the sample data files used in training are usually clean and simple and don't reflect what students actually encounter in the real world. The reader will learn an ideal format for Minitab data sets, and two ways for getting a data file formatted optimally for analysis using Minitab or other statistical software.
What Makes Scientific Workflows Scientific?
Authors: Bertram Ludäscher
Venue: Proceedings of the 21st International Conference on Scientific and Statistical Database Management (2009)

A scientific workflow is the description of a process for accomplishing a scientific objective, usually expressed in terms of tasks and their dependencies [5]. While workflows have a long history in the database community as well as in business process modeling (where they are also known as business workflows), and despite some early works on scientific workflows [3,10], the area has only recently begun to fully flourish (e.g., see [1,2,9,7,4,11]). Similar to scientific data management which has different characteristics from traditional business data management [8], scientific workflows exhibit new challenges and opportunities that distinguish them from business workflows. We present an overview of these challenges and opportunities, covering a number of issues such as different models of computation, scalable data and process management, and data provenance and lineage handling in scientific workflows.
Introduction to Data Technologies, 1st edition
Authors: Paul Murrell
Venue:  (2009)

Written by a member of the R Development Core Team, this resource provides important information on how to work with research data. It contains a collection of diverse, computer-related topics, connecting them through numerous, real-world case studies. The author describes open source technologies and open standards and devotes separate chapters to each computer language, including HTML, XML, SQL, and R. Explanatory diagrams aid in understanding important concepts, helping readers perform research tasks with ease. In addition, the authors website includes a suite of exercises as well as the code and data sets used in the case studies.
A hybrid heuristic approach to optimize rule-based software quality estimation models
Authors: D. Azar, H. Harmanani, R. Korkmaz
Venue: Information and Software Technology (2009)

Software quality is defined as the degree to which a software component or system meets specified requirements and specifications. Assessing software quality in the early stages of design and development is crucial as it helps reduce effort, time and money. However, the task is difficult since most software quality characteristics (such as maintainability, reliability and reusability) cannot be directly and objectively measured before the software product is deployed and used for a certain period of time. Nonetheless, these software quality characteristics can be predicted from other measurable software quality attributes such as complexity and inheritance. Many metrics have been proposed for this purpose. In this context, we speak of estimating software quality characteristics from measurable attributes. For this purpose, software quality estimation models have been widely used. These take different forms: statistical models, rule-based models and decision trees. However, data used to build such models is scarce in the domain of software quality. As a result, the accuracy of the built estimation models deteriorates when they are used to predict the quality of new software components. In this paper, we propose a search-based software engineering approach to improve the prediction accuracy of software quality estimation models by adapting them to new unseen software products. The method has been implemented and favorable result comparisons are reported in this work.
Mobile Heart Health: Project Highlight
Authors: Margaret Morris, Farzin Guilak
Venue: IEEE Pervasive Computing (2009)

To address psychosocial risks of cardiovascular disease, we integrated on-the-body sensors with mobile therapies for "just-in-time" stress management. Breathing visualizations and cognitive reappraisal cues appeared on the cell phone when a wireless ECG detected deviations from an individuals' baseline heart rate variability. Reactions from participants validated this concept and highlighted the need for a broader array of therapies and applications that could be shared within relationships and communities.
European Judicial Collaboration Platform (JCP) for Secure International Judicial Collaboration
Authors: Elisa Negroni, Katherine Davies, Mauro Cislaghi, George Eleftherakis, Sara Ferri
Venue: Proceeding of the 2008 conference on Legal Knowledge and Information Systems: JURIX 2008: The Twenty-First Annual Conference (2008)

The data security in the information exchange process is one of the major critical factors that justice sector professionals must cope with, particularly in international cooperation. The J-WeB project, running in the frame of the Information Society and Technology Programme of the European Union, intends to offer a new solution for secure and reliable multimedia document exchange and storage among judicial operators of different Member States working at joint cross-border pre-trial investigations on criminal matters. The J-WeB Judicial Collaboration Platform aims at the provision of Governmental bodies with more safe, easy-to-use and cost-effective working instruments, but also, through the involvement of the Italian and the Montenegrin Ministries of Justice as pilots, at the factual contribution to the policy and technology transfer from Europe to Western Balkans. This paper is meant to present the project and its technical features.
Performance model driven QoS guarantees and optimization in clouds
Authors: Jim Li, John Chinneck, Murray Woodside, Marin Litoiu, Gabriel Iszlai
Venue: Proceedings of the 2009 ICSE Workshop on Software Engineering Challenges of Cloud Computing (2009)

This paper presents a method for achieving optimization in clouds by using performance models in the development, deployment and operations of the applications running in the cloud. We show the architecture of the cloud, the services offered by the cloud to support optimization and the methodology used by developers to enable runtime optimization of the clouds. An optimization algorithm is presented which accommodates different goals, different scopes and timescales of optimization actions, and different control algorithms. The optimization here maximizes profits in the cloud constrained by QoS and SLAs across a large variety of workloads.
Toward supporting hypothesis formation and testing in an interpretive domain
Authors: Vincent Aleven, Kevin Ashley
Venue: Proceeding of the 2005 conference on Artificial Intelligence in Education: Supporting Learning through Intelligent and Socially Informed Technology (2005)

The research field of AI & Education has long been interested in cognitive processes in which students formulate and test hypotheses by considering them in light of specific cases. However, few if any of the systems that have been built target domains which are ill-structured and in which determining whether a hypothesized rule and proposed outcome are consistent with past decisions is a matter of interpretation, rather than deductive inference. The goals of our project are to (1) develop an AI model of hypothesis formation and testing in an interpretive domain, US Supreme Court oral arguments and (2) to use it in an intelligent tutoring system to guide law students in learning that process. As a first step toward these goals we will conduct an experiment to evaluate whether self-explanation prompts facilitate learning by studying argument transcripts.
PIPP: promotion/insertion pseudo-partitioning of multi-core shared caches
Authors: Yuejian Xie, Gabriel H. Loh
Venue: ACM SIGARCH Computer Architecture News (2009)

Many multi-core processors employ a large last-level cache (LLC) shared among the multiple cores. Past research has demonstrated that sharing-oblivious cache management policies (e.g., LRU) can lead to poor performance and fairness when the multiple cores compete for the limited LLC capacity. Different memory access patterns can cause cache contention in different ways, and various techniques have been proposed to target some of these behaviors. In this work, we propose a new cache management approach that combines dynamic insertion and promotion policies to provide the benefits of cache partitioning, adaptive insertion, and capacity stealing all with a single mechanism. By handling multiple types of memory behaviors, our proposed technique outperforms techniques that target only either capacity partitioning or adaptive insertion.
Fuzzy declustering-based vector quantization
Authors: Tuan D. Pham, Miriam Brandl, Dominik Beck
Venue: Pattern Recognition (2009)

Vector quantization is a useful approach for multi-dimensional data compression and pattern classification. One of the most popular techniques for vector quantization design is the LBG (Linde, Buzo, Gray) algorithm. To address the problem of producing poor estimate of vector centroids which are subjected to biased data in vector quantization; we propose a fuzzy declustering strategy for the LBG algorithm. The proposed technique calculates appropriate declustering weights to adjust the global data distribution. Using the result of fuzzy declustering-based vector quantization design, we incorporate the notion of fuzzy partition entropy into the distortion measures that can be useful for classification of spectral features. Experimental results obtained from simulated and real data sets demonstrate the effective performance of the proposed approach.
Performance of MIMO System Through Nakagami Fading Channel with Arbitrary Fading Parameters
Authors: Khodr A. Saaifan, Emad K. Al-Hussaini
Venue: Wireless Personal Communications: An International Journal (2009)

In this paper, the analytical and simulation results of the bit error rate (BER) performance for a multiple-input multiple-output (MIMO) system with an arbitrary number of transmit and receive antennas are developed for the uplink transmission. The fading channel is assumed to follow Nakagami-m distribution with correlation among branches. The BER is expressed in terms of Lauricella's multivariate hypergeometric function for both independent and correlated antenna branches for BPSK system.
GreenCloud: a new architecture for green data center
Authors: Liang Liu, Hao Wang, Xue Liu, Xing Jin, Wen Bo He, Qing Bo Wang, Ying Chen
Venue: Proceedings of the 6th international conference industry session on Autonomic computing and communications industry session (2009)

Nowadays, power consumption of data centers has huge impacts on environments. Researchers are seeking to find effective solutions to make data centers reduce power consumption while keep the desired quality of service or service level objectives. Virtual Machine (VM) technology has been widely applied in data center environments due to its seminal features, including reliability, flexibility, and the ease of management. We present the GreenCloud architecture, which aims to reduce data center power consumption, while guarantee the performance from users' perspective. GreenCloud architecture enables comprehensive online-monitoring, live virtual machine migration, and VM placement optimization. To verify the efficiency and effectiveness of the proposed architecture, we take an online real-time game, Tremulous, as a VM application. Evaluation results show that we can save up to 27% of the energy when applying GreenCloud architecture.
The complexity of phrase alignment problems
Authors: John DeNero, Dan Klein
Venue: Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics on Human Language Technologies: Short Papers (2008)

Many phrase alignment models operate over the combinatorial space of bijective phrase alignments. We prove that finding an optimal alignment in this space is NP-hard, while computing alignment expectations is #P-hard. On the other hand, we show that the problem of finding an optimal alignment can be cast as an integer linear program, which provides a simple, declarative approach to Viterbi inference for phrase alignment models that is empirically quite efficient.
Speed Dating Despite Jammers
Authors: Dominic Meier, Yvonne Anne Pignolet, Stefan Schmid, Roger Wattenhofer
Venue: Proceedings of the 5th IEEE International Conference on Distributed Computing in Sensor Systems (2009)

Many wireless standards and protocols today, such as WLAN and Bluetooth, operate on similar frequency bands. While this permits an efficient usage of the limited medium capacity, transmissions of nodes running different protocols can interfere. This paper studies how to design node discovery algorithms for wireless multichannel networks which are robust against contending protocols on the shared medium. We pursue a conservative approach and consider a Byzantine adversary who prevents the communication of our protocol on t channels in a worst-case fashion. Our model also captures disruptions controlled by an adversarial jammer. This paper presents algorithms for scenarios where t is not known. The analytical findings are complemented by simulations providing evidence that the proposed protocols perform well in practice.
Complementing a Web-Based Pedagogical Agent with an Enhanced-Search Framework
Authors: Longkai Wu
Venue: Proceeding of the 2005 conference on Towards Sustainable and Scalable Educational Innovations Informed by the Learning Sciences: Sharing Good Practices of Research, Experimentation and Innovation (2005)

While many capabilities of pedagogical agent have been discussed before, a useful function for such an agent is to have an enhanced searching and analyzing ability for unstructured information from the glossary or Internet. We extend the pedagogical agent framework from a generic one to enhance its searching ability. In the context of a cognitive tutor for teaching scientific topics, we present a prototype of a pedagogical agent which combines the Web Metadata Extractor to search the relevant web pages and acquire the organized metadata information.