371 resultados para MALL
Resumo:
General note: Title and date provided by Bettye Lane.
Resumo:
General note: Title and date provided by Bettye Lane.
Resumo:
General note: Title and date provided by Bettye Lane.
Resumo:
General note: Title and date provided by Bettye Lane.
Resumo:
General note: Title and date provided by Bettye Lane.
Resumo:
During our earlier research, it was recognised that in order to be successful with an indirect genetic algorithm approach using a decoder, the decoder has to strike a balance between being an optimiser in its own right and finding feasible solutions. Previously this balance was achieved manually. Here we extend this by presenting an automated approach where the genetic algorithm itself, simultaneously to solving the problem, sets weights to balance the components out. Subsequently we were able to solve a complex and non-linear scheduling problem better than with a standard direct genetic algorithm implementation.
Resumo:
During our earlier research, it was recognised that in order to be successful with an indirect genetic algorithm approach using a decoder, the decoder has to strike a balance between being an optimiser in its own right and finding feasible solutions. Previously this balance was achieved manually. Here we extend this by presenting an automated approach where the genetic algorithm itself, simultaneously to solving the problem, sets weights to balance the components out. Subsequently we were able to solve a complex and non-linear scheduling problem better than with a standard direct genetic algorithm implementation.
Resumo:
During our earlier research, it was recognised that in order to be successful with an indirect genetic algorithm approach using a decoder, the decoder has to strike a balance between being an optimiser in its own right and finding feasible solutions. Previously this balance was achieved manually. Here we extend this by presenting an automated approach where the genetic algorithm itself, simultaneously to solving the problem, sets weights to balance the components out. Subsequently we were able to solve a complex and non-linear scheduling problem better than with a standard direct genetic algorithm implementation.
Resumo:
Covers area bounded by 7th St. west, C St. north, 1st St. east, and C St. south.
Resumo:
Ink and watercolor.
Resumo:
Shows "Present direction of the Canal" and "New canal."
Resumo:
Music is a hidden stimulus for retailers. Not much has been researched on Indian luxury stores. This paper attempts to study the composition of music on perception of buyers at luxury stores. A research on customer’s buying intention was done to study their perception of music in the luxury store formats. This study uses exploratory factor analysis to find the significant different factors which constitute music to be played so as to induce buying in a luxury store. The composition of music depends upon music attractiveness, age of the customer and a desire to listen to the music.
Resumo:
Previous research into the use of explicit and implicit conclusions in advertising has yet to demonstrate consistent effects for both brand attitudes and purchase intentions. While research has examined the role of involvement, this study contributes by examining the trait called need for cognition (NFC), which addresses a person’s propensity to engage in effortful thinking. In addition, this study introduces argument quality (AQ) as another potential moderator of conclusion explicitness effects. In a 2 × 2 experiment of 261 subjects, conclusion explicitness (explicit conclusion, implicit conclusion) and AQ (strong, weak) are manipulated, with NFC (high NFC, low NFC) as a third measured variable. Results indicate more favorable evaluations for implicit conclusions over explicit conclusions for high-NFC individuals. Further, implicit conclusions result in more favorable brand attitudes and purchase intentions when linked with strong AQ for high-NFC individuals. The findings confirm that conclusion explicitness does not differentially affect the evaluations of low-NFC subjects. Results suggest that NFC may represent an important moderating variable for future conclusion explicitness research.
Resumo:
Classical negotiation models are weak in supporting real-world business negotiations because these models often assume that the preference information of each negotiator is made public. Although parametric learning methods have been proposed for acquiring the preference information of negotiation opponents, these methods suffer from the strong assumptions about the specific utility function and negotiation mechanism employed by the opponents. Consequently, it is difficult to apply these learning methods to the heterogeneous negotiation agents participating in e‑marketplaces. This paper illustrates the design, development, and evaluation of a nonparametric negotiation knowledge discovery method which is underpinned by the well-known Bayesian learning paradigm. According to our empirical testing, the novel knowledge discovery method can speed up the negotiation processes while maintaining negotiation effectiveness. To the best of our knowledge, this is the first nonparametric negotiation knowledge discovery method developed and evaluated in the context of multi-issue bargaining over e‑marketplaces.
Resumo:
Background The purpose of this study was to identify candidate metastasis suppressor genes from a mouse allograft model of prostate cancer (NE-10). This allograft model originally developed metastases by twelve weeks after implantation in male athymic nude mice, but lost the ability to metastasize after a number of in vivo passages. We performed high resolution array comparative genomic hybridization on the metastasizing and non-metastasizing allografts to identify chromosome imbalances that differed between the two groups of tumors. Results This analysis uncovered a deletion on chromosome 2 that differed between the metastasizing and non-metastasizing tumors. Bioinformatics filters were employed to mine this region of the genome for candidate metastasis suppressor genes. Of the 146 known genes that reside within the region of interest on mouse chromosome 2, four candidate metastasis suppressor genes (Slc27a2, Mall, Snrpb, and Rassf2) were identified. Quantitative expression analysis confirmed decreased expression of these genes in the metastasizing compared to non-metastasizing tumors. Conclusion This study presents combined genomics and bioinformatics approaches for identifying potential metastasis suppressor genes. The genes identified here are candidates for further studies to determine their functional role in inhibiting metastases in the NE-10 allograft model and human prostate cancer.