Proposed Design of a CFRP Flange-to-Flange Connection for Precast Prestressed Double Tee Systems

The current methods of connecting the flanges of precast double tee members, and their respective short comings in specific situations, are described. A new carbon fiber-reinforced polymer (CFRP) flange-to-flange connection is proposed to eliminate the problems associated with repair requirements for the current connections. Design expressions for the currently used mechanical anchorage and the proposed CFRP connection are presented. A comparative calculation for the two systems is given.     

Case Study-Based Challenges of Quality Concrete Finishing for Architecturally Complex Structures

This paper focuses on the procedure utilized in the construction of tilt-up irregular concrete panels that are constructed on-site using concrete slabs and wooden formwork. The case study required high-quality concrete finishing. The erection and installation procedure called for a maximum panel-to-panel joint tolerance of 1.27?cm (0.5?in.), often 90° joints between panels. To meet precision requirements, the casting slabs were leveled and flattened with laser screed technology and smoothed with chemical solutions. To ensure that the final result met expectations, a mock-up model was built using different types of materials and to simulate site constraints. The architectural design is a composition of precast concrete panels like “Lego” pieces assembled similarly to a jigsaw puzzle. The unique construction process required a state-of-the-art analysis to produce the set quality. Quality conditions as set by the owner included creating a smooth concrete surface on all panels while avoiding damages and reducing equipment and material costs. The proposed methodology is described through its implementation on the case study, which is also described in this paper.     

Algorithms in the W-Hierarchy

We show new upper bounds for problems in the W-hierarchy of fixed-parameter complexity. A crucial ingredient of our proofs is an extension to the W-RAM model, which permits more-powerful operations but remains equivalent to the original. We use the extended model to give new upper bounds for Subsetsum, Maximum Irredundant Set, and various problems concerning intersection of finite-state machines.     

The Computational Complexity of One-Dimensional Sandpiles

We prove that the one-dimensional sandpile prediction problem is in LOGDCFL, a subset of AC¹. The previously best known upper bound on the ACⁱ-scale was AC². Furthermore, we prove that the one-dimensional sandpile prediction problem is hard for TC⁰ and thus not in AC^1-ε for any constant ε > 0.     

Polynomial-Space Decidable Membership Problems for Recurrent Systems over Sets of Natural Numbers

A finite recurrent system over sets of natural numbers of dimension n is a pair composed of n n-ary functions over sets of natural numbers and an n-tuple of singleton sets of natural numbers. Every function is applied to the entries of the tuple and computes a set of natural numbers, that may also be empty. The results are composed into another tuple, and the process is started anew. Thus, a finite recurrent system defines an infinite sequence of n-tuples containing sets of natural numbers. The last entry of a generated n-tuple is called the output of a step, and the union of the output sets of all steps is the set defined by the finite recurrent system. Membership problems ask whether a given number is in a specified output set or in some output set. We study membership problems for special finite recurrent systems, whose functions are built from the set operations union, intersection and complementation and the arithmetical operations addition and multiplication. Sum and product of two sets of natural numbers are defined elementwise. We restrict the set of operations from which functions are built and determine the impact on the complexity of the membership problems. We focus on PSPACE-decidable membership problems and show completeness results for the complexity classes NL, NP and PSPACE.     

Dynamic Complexity Theory Revisited

Dynamic complexity investigates the required effort to maintain knowledge about a property of a structure under changing operations. This article introduces a refined notion of dynamic problems which takes the initial structure into account. It develops the basic structural complexity notions accordingly. It also shows that the dynamic version of the LOGCFL-complete problem D₂LREACH(acyclic) can be maintained with first-order updates.     

Truthful Approximation Mechanisms for Scheduling Selfish Related Machines

We consider the problem of scheduling jobs on related machines owned by selfish agents. We provide a 5-approximation deterministic truthful mechanism, the first deterministic truthful result for the problem. Previously, Archer and Tardos showed a 2-approximation randomized mechanism which is truthful in expectation only (a weaker notion of truthfulness). In case the number of machines is constant, we provide a deterministic Fully Polynomial-Time Approximation Scheme (FPTAS) and a suitable payment scheme that yields a truthful mechanism for the problem. This result, which is based on converting FPTAS to monotone FPTAS, improves a previous result of Auletta et al., who showed a (4 + ε)-approximation truthful mechanism.     

CODIRO: A New System for Obtaining Data Concerning Consumer Behavior Based on Data Factors of High Interest Determined by the Analyst

The aim of this paper is to propose a new system for the strategic use of customer data that includes and integrates such differing data sources as company databases, mobile telephone networks and Internet data and is a consumer research support system for the discovery of new marketing opportunities. This system, called CODIRO, will be discussed in this paper using a case study of the effects on sales of processed food product television commercials. A system for verifying the validity of consumer behavior models will also be described and discussed. Use of the CODIRO analysis system makes it easy to introduce, into the analytic model, consumer attitude changes and in-store data of many types that have not been used to measure advertising and promotional activity effectiveness in the past.     

A fuzzy clustering algorithm enhancing local model interpretability

In this work, simple modifications on the cost index of particular local-model fuzzy clustering algorithms are proposed in order to improve the readability of the resulting models. The final goal is simultaneously providing local linear models (reasonably close to the plant’s Jacobian) and clustering in the input space so that desirable characteristics (regarding final model accuracy, and convexity and smoothness of the cluster membership functions) are improved with respect to other proposals in literature. Some examples illustrate the proposed approach.