ppxscal/embedding_network huggingface dataset:
Size and treewidth bounds for conjunctive queries
Authors: Georg Gottlob, Stephanie Tien Lee, Gregory J. Valiant
Venue: Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2009)

This paper provides new worst-case bounds for the size and treewith of the result Q(D) of a conjunctive query Q to a database D. We derive bounds for the result size |Q(D)| in terms of structural properties of Q, both in the absence and in the presence of keys and functional dependencies. These bounds are based on a novel "coloring" of the query variables that associates a coloring number C(Q) to each query Q. Using this coloring number, we derive tight bounds for the size of Q(D) in case (i) no functional dependencies or keys are specified, and (ii) simple (one-attribute) keys are given. These results generalize recent size-bounds for join queries obtained by Atserias, Grohe, and Marx (FOCS 2008). An extension of our coloring technique also gives a lower bound for |Q(D)| in the general setting of a query with arbitrary functional dependencies. Our new coloring scheme also allows us to precisely characterize (both in the absence of keys and with simple keys) the treewidth-preserving queries--the queries for which the output treewidth is bounded by a function of the input treewidth. Finally we characterize the queries that preserve the sparsity of the input in the general setting with arbitrary functional dependencies.
Data, information and knowledge transformation
Authors: Dana Klimešová
Venue: Proceedings of the 10th WSEAS international conference on Automation & information (2009)

The paper deals with the relations between data, information, knowledge and knowledge management on the background of the process understanding and the context applying. The contribution of Computer science, Artificial intelligence and the new information technologies is discussed how they can help us to carry out the new knowledge management strategies. The Internet technology and Web services architecture makes data acquiring more open and interoperable in using, offers wide range of context information, has a unique ability to integrate diverse data through shared location and offers real potential for meeting the demands of users. The development and the use of permanently changing information structures open new ways of information processing and understanding. On the example of GIS the context utilisation is presented as a unique approach to the problem of conflict resolution among multiple heterogeneous data sources. The paper discuss the problem of wide context as a tool to compensate and to decrease the uncertainty of data, classification and analytical process at all process to increase the information value of decision support.
Image restoration viawiener filtering in the frequency domain
Authors: Hiroko Furuya, Shintaro Eda, Testuya Shimamura
Venue: WSEAS Transactions on Signal Processing (2009)

In this paper, first, the performance of the Wiener filter in the frequency domain for image restoration is compared with that in the space domain on images degraded by white noise. After finding that the Wiener filter in the frequency domain is more effective than that in the space domain in an ideal case, power spectrum estimation methods for the Wiener filter in the frequency domain are discussed. Three approaches are considered; frequency band division processing (FBDP), modified FBDP and averaging high frequency components (AHFC). The performances of the Wiener filter with the three approaches for power spectrum estimation are investigated through computer simulation experiments. It is shown that the frequency domain Wiener with the modified FBDP provides a superior performance relative to that with the FBDP and AHFC.
Bridging the application and DBMS divide using static analysis and dynamic profiling
Authors: Surajit Chaudhuri, Vivek Narasayya, Manoj Syamala
Venue: Proceedings of the 35th SIGMOD international conference on Management of data (2009)

Relational database management systems (RDBMSs) today serve as the backend for many real-world data intensive applications. Database developers use data access APIs such as ADO.NET to execute SQL queries and access data. While modern program analysis and code profilers are extensively used during the software development life cycle, there is a significant gap in these technologies for database applications because these tools have little or no understanding of data access APIs or the DBMS. We have developed tools that: (a) Enhance traditional static analysis of programs by leveraging understanding of database APIs to help developers identify security, correctness and performance problems in the application. This enables such problems to be detected early in the application lifecycle. (b) Extend the existing DBMS and application profiling infrastructure to enable correlation of application events with DBMS events. This allows profiling across application, data access and DBMS layers. We demonstrate how our tools enable a rich class of analysis, tuning and profiling tasks that are otherwise not possible today.
A semantic-driven communication framework for safe adaptability
Authors: Nalini Venkatasubramanian
Venue:  (2007)

Advances in networking and portable device technologies have enabled communication in locations and settings where it was previously unfeasible. These advances have brought a new class of applications capable of dynamically adjusting their requirements based on changes in the communication environment. Consequently, these applications require an adaptive communication framework that can match evolving application requirements and can react to communication environment changes. However, the high data-driven concurrency and non-deterministic nature of communication frameworks make communication adaptability expensive and error-prone. The need to establish under what circumstances adaptation can be achieved without compromising correctness and performance is the driving force behind this thesis. We emphasize both performance and correctness because the correct operation of some communication protocols consist precisely in achieving certain performance goals. In this thesis, we present an adaptive communication framework capable of ensuring safe composability of protocols. We start by developing a semantic model based on rewriting logic. This allows us to formalize protocol composition, and prove properties that ensure safe composition and interaction. We then use the semantic model to develop a formal specification of an adaptive communication framework. A distinctive feature of our formal specification is its executability, which allows us to (i) explore and validate design decisions, and (ii) verify framework behavior in extreme scenarios that may be hard to generate in an experimental setting. The novelty in our framework design is the mechanism on which protocols interact with each other and how message processing is done. In particular, we propose a message-tag interaction model as a substitute to the event-driven model.
Professional iPhone and iPod touch Programming: Building Applications for Mobile Safari
Authors: Richard Wagner
Venue: Wrox Programmer To Programmer (2008)

The Safari-exclusive applications for iPhone and iPod touch assemble various elements, and this book shows you how to integrate these elements with key design concepts and principles in order to develop a highly usable interface for the touch screen. Youll learn to use existing open-source libraries in your code, imitate the overall look and feel of built-in Apple applications, and migrate existing Web 2.0 apps and sites to this new mobile platform. By the end of the book, youll feel untouchable as you create a custom mobile application from scratch. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Patient-level analysis of outcomes using structured labor and delivery data
Authors: Eric S. Hall, Mollie R. Poynton, Scott P. Narus, Spencer S. Jones, R. Scott Evans, Michael W. Varner, Sidney N. Thornton
Venue: Journal of Biomedical Informatics (2009)

This paper presents methods for identifying and analyzing associations among nursing care processes, patient attributes, and patient outcomes using unit-level and patient-level representations of care derived from computerized nurse documentation. The retrospective, descriptive analysis included documented nursing events for 900 Labor and Delivery patients at three hospitals over the 2-month period of January and February 2006. Two models were used to produce quantified measurements of nursing care received by each patient. The first model considered only the hourly census of nurses and patients. The second model considered the size of nurses' patient loads as represented by computerized nurse-entered documentation. Significant relationships were identified between durations of labor and nursing care scores generated by the second model. In addition to the clinical associations identified, the study demonstrated an approach with global application for representing the amount of nursing care received at the individual patient level in analyses of patient outcomes.
Geometric modeling using high-order derivatives
Authors: Denis Zorin
Venue:  (2008)

Modeling of high quality surfaces is the core of geometric modeling. Such models are used in many computer-aided design and computer graphics applications. Irregular behavior of higher-order differential parameters of the surface (e.g. curvature variation) may lead to aesthetic or physical imperfections. In this work, we consider methods for constructing surfaces with high degree of smoothness.One direction is based on a manifold-based surface definition which ensures well-defined high-order derivatives that can be explicitly computed at any point. We extend previously proposed manifold-based construction to surfaces with piecewise-smooth boundary. We show that growth of derivative magnitudes with order is a general property of constructions with locally supported basis functions, derive a lower-bound for derivative growth and numerically study flexibility of resulting surfaces at arbitrary points.An alternative direction to using high-order surfaces is to define an approximation to high-order quantities for meshes, with high-order surface implicit. These approximations do not necessarily converge point-wise, but can nevertheless be successfully used to solve surface optimization problems. Even though fourth-order problems are commonly solved to obtain high-quality surfaces, in many cases, these formulations may lead to reflection line and curvature discontinuities. We consider two approaches to further increasing control over surface properties.The first approach is to consider data-dependent functionals leading to fourth-order problems but with explicit control over desired surface properties. Our fourth-order functional is based on reflection line behavior. Reflection lines are commonly used for surface interrogation and high-quality reflection line patterns are well-correlated with high-quality surface appearance. We demonstrate how these can be discretized and optimized accurately and efficiently on general meshes.A more direct approach is to consider a polyharmonic function on a mesh, such as the fourth-order biharmonic or the sixth-order triharmonic. These equations can be thought of as linearizations of curvature and curvature variation Euler-Lagrange equations respectively. We present a novel discretization for both problems based on the mixed finite element framework and a regularization technique for solving the resulting, highly ill-conditioned systems. We show that this method, compared to more ad-hoc discretizations, has higher degree of mesh independence and yields surfaces of better quality.
Rule Extraction and Reduction for Hyper Surface Classification
Authors: Qing He, Jincheng Li, Zhongzhi Shi
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part II (2009)

Hyper Surface Classification (HSC), which is based on Jordan Curve Theorem in Topology, is one of the accurate and efficient classification algorithms. The hyper surface obtained by the training process exhibits excellent generalization performance on datasets not only of large size but also of high dimensionality. The classification knowledge hidden in the classifier, however, is hard to interpret by human. How to obtain the classification rules is an important problem. In this paper, we firstly extract rule from the sample directly. In order to avoid rule redundance, two optimal policies, selecting Minimal Consistent Subset (MCS) for the training set and merging some neighboring cubes, are exerted to reduce the rules set. Experimental results show that the two policies are able to accurately acquire the knowledge implied by the hyper surface and express the good generalization performance of HSC. Moreover, the time for classifying the unlabeled sample by the rules set can be shorten correspondingly.
Bias-Variance Analysis for Ensembling Regularized Multiple Criteria Linear Programming Models
Authors: Peng Zhang, Xingquan Zhu, Yong Shi
Venue: Proceedings of the 9th International Conference on Computational Science (2009)

Regularized Multiple Criteria Linear Programming (RMCLP) models have recently shown to be effective for data classification. While the models are becoming increasingly important for data mining community, very little work has been done in systematically investigating RMCLP models from common machine learners' perspectives. The missing of such theoretical components leaves important questions like whether RMCLP is a strong and stable learner unable to be answered in practice. In this paper, we carry out a systematic investigation on RMCLP by using a well-known statistical analysis approach, bias-variance decomposition. We decompose RMCLP's error into three parts: bias error, variance error and noise error. Our experiments and observations conclude that RMCLP'error mainly comes from its bias error, whereas its variance error remains relatively low. Our observation asserts that RMCLP is stable but not strong. Consequently, employing boosting based ensembling mechanism RMCLP will mostly further improve the RMCLP models to a large extent.
De-escalating IT projects: the DMM model
Authors: Donal Flynn, Gary Pan, Mark Keil, Magnus Mähring
Venue: Communications of the ACM (2009)

Introduction Taming runaway Information Technology (IT) projects is a challenge that most organizations have faced and that managers continue to wrestle with. These are projects that grossly exceed their planned budgets and schedules, often by a factor of 2--3 fold or greater. Many end in failure; failure not only in the sense of budget or schedule, but in terms of delivered functionality as well. Runaway projects are frequently the result of escalating commitment to a failing course of action, a phenomenon that occurs when investments fail to work out as envisioned and decision-makers compound the problem by persisting irrationally. Keil, Mann, and Rai reported that 30--40% of IT projects exhibit some degree of escalation. To break the escalation cycle, de-escalation of commitment to the failing course of action must occur so that valuable resources can be channeled into more productive use. But, making de-escalation happen is neither easy nor intuitive. This article briefly examines three approaches that have been suggested for managing de-escalation. By combining elements from the three approaches, we introduce a de-escalation management maturity (DMM) model that provides a useful framework for improving practice.
A System Architecture for the 7C Knowledge Environment
Authors: Teppo Räisänen, Harri Oinas-Kukkonen
Venue: Proceeding of the 2008 conference on Information Modelling and Knowledge Bases XIX (2008)

This paper presents an information system architecture for the 7C model for organizational knowledge creation and management. The architecture is derived from the requirements that the 7C model posits. The architecture presented here comprises three layers: the conceptual layer, which discusses fundamental principles of the model, the technology layer, which tackles potential implementation technologies for the environment, and the application layer, which describes possible applications in the environment.
The Carneades Argumentation FrameworkUsing Presumptions and Exceptions to Model Critical Questions
Authors: Thomas F. Gordon, Douglas Walton
Venue: Proceeding of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006 (2006)

We present a formal, mathematical model of argument structure and evaluation, called the Carneades Argumentation Framework, which applies proof standards [1] to determine the defensibility of arguments and the acceptability of statements on an issue-by-issue basis. Carneades uses three kinds of premises (ordinary premises, presumptions and exceptions) and information about the dialectical status of statements (undisputed, at issue, accepted or rejected) to model critical questions in such a way as to allow the burden of proof to be allocated to the proponent or the respondent, as appropriate.
Teacher strategies for fostering collaborative historical reasoning in whole-class discussions
Authors: Jannet Van Drie, Carla Van Boxtel
Venue: Proceedings of the 8th international conference on International conference for the learning sciences - Volume 3 (2008)

Whole-class discussions in which students and teacher reason together and coconstruct knowledge are, next to small group work, important in communities of learners. In this study we address the question of what strategies history teachers use to provoke and support collaborative historical reasoning in whole-class discussions. Analyses included transcripts of four whole-class discussions and stimulated recall interviews with the teachers and revealed differences in the extent to which they succeeded in provoking collaborative historical reasoning.
Keys Don't Grow in Threes
Authors: Stephen Farrell
Venue: IEEE Internet Computing (2009)

Many Internet security mechanisms depend on the use of cryptographic algorithms for various forms of authentication and confidentiality. Even when well-known and standardized cryptographic algorithms are used in well-known protocols, some parameters must be specified, the most important of which are usually algorithm identifiers and key or hash-output lengths. The author reviews some recent key length recommendations and compares those to current usage. He raises some issues that come up once we start to do the updates called for by various cryptographic experts and authorities who've made recommendations on this topic — some of which call for widespread changes to occur in 2010.
The eXtensible Tutor Architecture: A New Foundation for ITS
Authors: Goss Nuzzo-Jones, Jason A. Walonoski, Neil T. Heffernan, Tom Livak
Venue: Proceeding of the 2005 conference on Artificial Intelligence in Education: Supporting Learning through Intelligent and Socially Informed Technology (2005)

The eXtensible Tutor Architecture (XTA) was designed as a platform for creating and deploying many types of Intelligent Tutoring Systems across many different platforms. The XTA presently has support for state graph pseudo-tutors and JESS model-tracing cognitive tutors, in both a client and server context. The XTA was designed with future development in mind, allowing easy specification of new tutor types, tutoring strategies, and interface layers. It has been used as the foundation of the Assistments Project, a wide scale web based ITS deployment. The Assistments Project is on track to provide ITS content to 100,000 students in the state of Massachusetts.
KOTEK: Clustering Of The Enterprise Code
Authors: Andrzej Gąsienica-Samek, Tomasz Stachowicz, Jacek Chrząszcz, Aleksy Schubert
Venue: Proceeding of the 2005 conference on Software Engineering: Evolution and Emerging Technologies (2005)

Development of large code bases is extremely difficult. The main cause of this situation is that the internal dependencies in a large code body become unwieldy in management. This calls for methods and tools that support software development managers in maintaining properly ordered connections within the source code. We propose a method and a static module system KOTEK to facilitate high and medium level management of such source code dependencies. The system enforces all dependencies to be clearly declared. Since KOTEK is also a build system, it automatically enforces these declarations to be up-to-date. Moreover, KOTEK allows advanced software engineering constructions like parametrisation of large code fragments with respect to some functionality.
Kernel nonnegative matrix factorization for spectral EEG feature extraction
Authors: Hyekyoung Lee, Andrzej Cichocki, Seungjin Choi
Venue: Neurocomputing (2009)

Nonnegative matrix factorization (NMF) seeks a decomposition of a nonnegative matrix X>=0 into a product of two nonnegative factor matrices U>=0 and V>=0, such that a discrepancy between X and UV^@? is minimized. Assuming U=XW in the decomposition (for W>=0), kernel NMF (KNMF) is easily derived in the framework of least squares optimization. In this paper we make use of KNMF to extract discriminative spectral features from the time-frequency representation of electroencephalogram (EEG) data, which is an important task in EEG classification. Especially when KNMF with linear kernel is used, spectral features are easily computed by a matrix multiplication, while in the standard NMF multiplicative update should be performed repeatedly with the other factor matrix fixed, or the pseudo-inverse of a matrix is required. Moreover in KNMF with linear kernel, one can easily perform feature selection or data selection, because of its sparsity nature. Experiments on two EEG datasets in brain computer interface (BCI) competition indicate the useful behavior of our proposed methods.
What Can We Learn From 'S' Elementary School?: Wireless Laptop Computers in Regular Classroom Activities
Authors: Insook Lee
Venue: Proceeding of the 2007 conference on Supporting Learning Flow through Integrative Technologies (2007)

The joint efforts of the Korean Ministry of Education and Human Resource Development (MOE & HRD) and Apple Korea were employed to integrate mobile technology in elementary schools. This evaluation research intended to provide the implications of successfully building and implementing m-learning environment. It performed pre-and post-tests in order to measure learners' achievements; surveyed to measure students' satisfaction, efficacy, and motivation; and conducted qualitative field observation and interviews along with video/audio-recordings. As a result, the current research proved the potential power of the Mac-wireless computer integrated instruction/learning approach regardless subject, class, and gender. In addition, it reveals several success/hindering factors within the elementary school.
Complex-Event Processing Poised for Growth
Authors: Neal Leavitt
Venue: Computer (2009)

Organizations are increasingly turning to complex-event processing to help make sense of the flood of data they work with.