On recommendation problems beyond points of interest

Recommendation systems aim to recommend items or packages of items that are likely to be of interest to users. Previous work on recommendation systems has mostly focused on recommending points of interest (POI), to identify and suggest top-k items or packages that meet selection criteria and satisfy compatibility constraints on items in a package, where the (packages of) items are ranked by their usefulness to the users. As opposed to prior work, this paper investigates two issues beyond POI recommendation that are also important to recommendation systems. When there exist no sufficiently many POI that can be recommended, we propose (1) query relaxation recommendation to help users revise their selection criteria, or (2) adjustment recommendation to guide recommendation systems to modify their item collections, such that the users׳ requirements can be satisfied.We study two related problems, to decide (1) whether the query expressing the selection criteria can be relaxed to a limited extent, and (2) whether we can update a bounded number of items, such that the users can get desired recommendations. We establish the upper and lower bounds of these problems, all matching, for both combined and data complexity, when selection criteria and compatibility constraints are expressed in a variety of query languages, for both item recommendation and package recommendation. To understand where the complexity comes from, we also study the impact of variable sizes of packages, compatibility constraints and selection criteria on the analyses of these problems. Our results indicate that in most cases the complexity bounds of query relaxation and adjustment recommendation are comparable to their counterparts of the basic recommendation problem for testing whether a given set of (resp. packages of) items makes top-k items (resp. packages). In other words, extending recommendation systems with the query relaxation and adjustment recommendation functionalities typically does not incur extra overhead.     

Lagrangian relaxation hybrid with evolutionary algorithm for short-term generation scheduling

Short-term generation scheduling is an important function in daily operational planning of power systems. It is defined as optimal scheduling of power generators over a scheduling period while respecting various generator constraints and system constraints. Objective of the problem includes costs associated with energy production, start-up cost and shut-down cost along with profits. The resulting problem is a large scale nonlinear mixed-integer optimization problem for which there is no exact solution technique available. The solution to the problem can be obtained only by complete enumeration, often at the cost of a prohibitively computation time requirement for realistic power systems. This paper presents a hybrid algorithm which combines Lagrangian Relaxation (LR) together with Evolutionary Algorithm (EA) to solve the problem in cooperative and competitive energy environments. Simulation studies were carried out on different systems containing various numbers of units. The outcomes from different algorithms are compared with that from the proposed hybrid algorithm and the advantages of the proposed algorithm are briefly discussed.     

Enhanced relative permittivity in niobium and europium co-doped TiO2 ceramics

The appearance of colossal permittivity materials broadened the choice of materials for energy-storage applications. In this work, colossal permittivity in ceramics of TiO₂ co-doped with niobium and europium ions ((Eu_0.5Nb_0.5)_xTi_1-xO₂ ceramics) was reported. A large permittivity (ε_r ～ 2.01?×?10⁵) and a low dielectric loss (tanδ ～ 0.095) were observed for (Eu_0.5Nb_0.5)_xTi_1-xO₂ (x?=?1%) ceramics at 1?kHz. Moreover, two significant relaxations were observed in the temperature dependence of dielectric properties for (Eu, Nb) co-doped TiO₂ ceramics, which originated from defect dipoles and electron hopping, respectively. The low dielectric loss and high relative permittivity were ascribed to the electron-pinned defect-dipoles and electrons hopping. The (Eu_0.5Nb_0.5)_xTi_1-xO₂ ceramic with great colossal permittivity is one of the most promising candidates for high-energy density storage applications.     

Experimental and modeling approaches of MR behaviors under large step strains

Rheological properties of MR fluids under large step strain shear are presented in this paper. The experiments were carried out using a rheometer with parallel-plate geometry. Under the large step strain shear, MR fluids behave as nonlinear viscoelastic properties, where the stress relaxation modulus, G(t, γ), shows a decreasing trend with step strain. The experimental results indicate that G(t, γ) obeys time-strain separability. Thus, a mathematical form based on finite exponential serials is proposed to predict MR behavior. In this model, G(t, γ) is represented as the product of a linear stress relaxation, G(t), and the damping function, h(γ), i.e. G(t, γ)=G(t) h(γ). G(t) is simply represented as a three-parameter exponential serial and h(γ) has a sigmoidal form with two parameters. The parameters are identified by adopting an efficient optimization method proposed by Stango et al. The comparison between the experimental results and the model-predicted values indicates that this mathematical model can accurately predict MR behavior.     

基于服务器端会话追踪的Web查询服务的研究

在探讨了Web查询服务的典型模型后,论文阐述了服务器端会话追踪机制的实现方式,设计了基于服务器端会话追踪的Web查询服务的典型解决方案。该设计方案可以较为安全地保存和维护客户的上下文信息,可靠地跟踪用户查询所处的状态,有效地实现有状态的Web查询服务。     

A survey of parallel execution strategies for transitive closure and logic programs

An important feature of database technology of the nineties is the use of parallelism for speeding up the execution of complex queries. This technology is being tested in several experimental database architectures and a few commercial systems for conventional select-project-join queries. In particular, hash-based fragmentation is used to distribute data to disks under the control of different processors in order to perform selections and joins in parallel. With the development of new query languages, and in particular with the definition of transitive closure queries and of more general logic programming queries, the new dimension of recursion has been added to query processing. Recursive queries are complex; at the same time, their regular structure is particularly suited for parallel execution, and parallelism may give a high efficiency gain. We survey the approaches to parallel execution of recursive queries that have been presented in the recent literature. We observe that research on parallel execution of recursive queries is separated into two distinct subareas, one focused on the transitive closure of Relational Algebra expressions, the other one focused on optimization of more general Datalog queries. Though the subareas seem radically different because of the approach and formalism used, they have many common features. This is not surprising, because most typical Datalog queries can be solved by means of the transitive closure of simple algebraic expressions. We first analyze the relationship between the transitive closure of expressions in Relational Algebra and Datalog programs. We then review sequential methods for evaluating transitive closure, distinguishing iterative and direct methods. We address the parallelization of these methods, by discussing various forms of parallelization. Data fragmentation plays an important role in obtaining parallel execution; we describe hash-based and semantic fragmentation. Finally, we consider Datalog queries, and present general methods for parallel rule execution; we recognize the similarities between these methods and the methods reviewed previously, when the former are applied to linear Datalog queries. We also provide a quantitative analysis that shows the impact of the initial data distribution on the performance of methods. Recommended by: Patrick Valduriez     

Qualitative representation of spatial knowledge in two-dimensional space

Various relation-based systems, concerned with the qualitative representation and processing of spatial knowledge, have been developed in numerous application domains. In this article, we identify the common concepts underlying qualitative spatial knowledge representation, we compare the representational properties of the different systems, and we outline the computational tasks involved in relation-based spatial information processing. We also describesymbolic spatial indexes, relation-based structures that combine several ideas in spatial knowledge representation. A symbolic spatial index is an array that preserves only a set of spatial relations among distinct objects in an image, called the modeling space; the index array discards information, such as shape and size of objects, and irrelevant spatial relations. The construction of a symbolic spatial index from an input image can be thought of as a transformation that keeps only a set of representative points needed to define the relations of the modeling space. By keeping the relative arrangements of the representative points in symbolic spatial indexes and discarding all other points, we maintain enough information to answer queries regarding the spatial relations of the modeling space without the need to access the initial image or an object database. Symbolic spatial indexes can be used to solve problems involving route planning, composition of spatial relations, and update operations.     

A semantic modeling approach for image retrieval by content

We introduce a semantic data model to capture the hierarchical, spatial, temporal, and evolutionary semantics of images in pictorial databases. This model mimics the user's conceptual view of the image content, providing the framework and guidelines for preprocessing to extract image features. Based on the model constructs, a spatial evolutionary query language (SEQL), which provides direct image object manipulation capabilities, is presented. With semantic information captured in the model, spatial evolutionary queries are answered efficiently. Using an object-oriented platform, a prototype medical-image management system was implemented at UCLA to demonstrate the feasibility of the proposed approach.     

Texture Changes During the Ripening of Port Salut Argentino Cheese in 2 Sampling Zones

ABSTRACT: Texture changes during ripening of Port Salut Argentino cheese for different sampling zones were studied. Compression relaxation tests were performed and results were analyzed using both Maxwellian and Peleg's models. Elastic equilibrium modulus obtained from the Maxwellian model decreased from 1.22 to 0.11 10⁴Pa during ripening. The constants derived from Peleg's model, k₁ and k₂, diminished with ripening time from 1.18 to 0.71 min and from 1.27 to 1.12, respectively. Asymptotic equilibrium modulus from Peleg's model decreased from 0.95 to 0.07 10⁴Pa during ripening. Rate parameters derived from a 1st order kinetics applied to both equilibrium moduli showed that the decrease was faster in the external zone (0.0846 d⁻¹) than in the central zone (0.0368 d⁻¹). The correlation between equilibrium moduli, salt concentration, moisture content, and maturation indexes was obtained with a determination coefficient of 0.76.     

先张法预应力桥梁板施工工艺及应用实例

结合太原市向阳店桥梁板施工实例，介绍了采用先张法进行预应力桥梁板施工的过程。阐述了桥梁板的施工工艺，该工艺实现了整体张拉、整体放张，使钢绞线逐根受力均匀，施工速度快，能保证梁端的质量。指出拉杆系统的使用，降低了成本，增加了效益。