Context-gated knowledge partitioning in categorization.

According to the knowledge partitioning framework, people sometimes master complex tasks by creating multiple independent parcels of partial knowledge. Research has shown that knowledge parcels may contain mutually contradictory information, and that each parcel may be used without regard to knowledge that is demonstrably present in other parcels. This article reports 4 experiments that investigated knowledge partitioning in categorization. When component boundaries of a complex categorization were identified by a context cue, a significant proportion of participants learned partial and independent categorization strategies that were chosen on the basis of context. For those participants, a strategy used in one context was unaffected by knowledge demonstrably present in other contexts, suggesting that knowledge partitioning in categorization can be complete. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Healing the psyche through music, myth, and ritual.

According to Carl Jung, a person's symptoms occur as a result of the psyche's creative attempt to self-regulate. These symptoms are viewed as the symbol-making function of the psyche. Music therapy as a therapeutic tool is also viewed as having a symbol-making function in that the physical act of making music involves conceptualizing one's symptoms into sounds. The sound serves as a musical symbol of the symptom. The myth of Orpheus is offered as an example of how early man amplified the creative potential contained in music to heal from life's woes. The Orphic archetype illustrates that music serves as a medium for healing and as an expression of Self. That psyche can be healed by music is a reminder of the connection between music therapy and the myth of Orpheus. In using the therapeutic tool of music one can transcend, through the symbol making process inherent in music therapy, the tension of opposites that are created at the crossroads of disease and wellness. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Applications of the discrete element method in mechanical engineering

Compared to other fields of engineering, in mechanical engineering, the Discrete Element Method (DEM) is not yet a well known method. Nevertheless, there is a variety of simulation problems where the method has obvious advantages due to its meshless nature. For problems where several free bodies can collide and break after having been largely deformed, the DEM is the method of choice. Neighborhood search and collision detection between bodies as well as the separation of large solids into smaller particles are naturally incorporated in the method. The main DEM algorithm consists of a relatively simple loop that basically contains the three substeps contact detection, force computation and integration. However, there exists a large variety of different algorithms to choose the substeps to compose the optimal method for a given problem. In this contribution, we describe the dynamics of particle systems together with appropriate numerical integration schemes and give an overview over different types of particle interactions that can be composed to adapt the method to fit to a given simulation problem. Surface triangulations are used to model complicated, non-convex bodies in contact with particle systems. The capabilities of the method are finally demonstrated by means of application examples. Commemorative Contribution.     

Local Exact Particle Tracing on Unstructured Grids

For analyzing and interpreting results of flow simulations, particle tracing is a well established visualization method. In addition, it is a preliminary step for more advanced techniques such as line integral convolution. For interactive exploration of large data sets, a very efficient and reliable particle tracing method is needed. For wind channel experiments or flight simulations, large unstructured computational grids have become common practice. Traditional approachs, based on numerical integration methods of ordinary differential equations however fail to deliver sufficiently accurate path calculation at the speed required for interactive use. In this paper we extend the local exact approach of Nielson and Jung in such a way that it can be used for interactive particle tracing in large data sets of steady flow simulation experiments. This will be achieved by sophisticated preprocessing using additional memory. For further visual enhancement of the streamline we construct an implicitly defined smooth Bézier curve that is used for ray tracing. This allows us to visualize additional scalar values of the simulation as attributes to the trajectory and enables the display of high‐quality smooth curves without creating any visualization geometry and providing a good impression of the spatial situation at the same time. ACM CSS: I.3.3 Computer Graphics—Line and curve generation; I .3.7 Computer Graphics—Raytracing; G.1.2 Numerical Analysis—Spline and piecewise polynomial approximation     

A heuristic algorithm for distributed control in manufacturing systems

Distributed Problem Solving Networks (DPSN) provide a means for interconnecting intelligent problem solver nodes that can solve only a part of a problem depending on their ability in the problem domain. The decomposition of a problem into subproblems, and the selection of nodes to solve them can be regarded as the generation of an AND/OR tree, and the solution of the problem as a search for a solution tree. Introducing measurements for the cost of a solution tree, we present an algorithm to find one having minimal cost under certain conditions. A Flexible Manufacturing System consisting of a network of flexible workcells is used as an example.     

What do we learn from binding features? Evidence for multilevel feature integration.

Four experiments were conducted to investigate the relationship between the binding of visual features (as measured by their aftereffects on subsequent binding) and the learning of feature-conjunction probabilities. Both binding and learning effects were obtained, but they did not interact. Interestingly, (shape-color) binding effects disappeared with increasing practice, presumably because of the fact that only 1 of the features involved was relevant to the task. However, this instability was only observed for arbitrary, not highly overlearned combinations of simple geometric features and not for real objects (colored pictures of a banana and strawberry), where binding effects were strong and resistant to practice. These findings suggest that learning has no direct impact on the strength or resistance of bindings or on speed with which features are bound; however, learning does affect the amount of attention particular feature dimensions attract, which again can influence which features are considered in binding. (PsycINFO Database Record (c) 2011 APA, all rights reserved)     

Representing temporal knowledge in conceptual graphs

This study was motivated by some difficulties encountered by the authors when trying to express temporal knowledge using Sowa's conceptual graph (CG) approach. An overview of Sowa's approach is given and the difficulties encountered when trying to model temporal knowledge are outlined: the disparity of notations allowed by CG theory for expressing temporal information; the ambiguity and incompleteness of tense sspecification; the difficulty of harmonizing tenses and intergraph temporal relations. Various approaches suggested for representing time both in artificial intelligence and linguistics are presented, and an extension to Sowa's approach is proposed in which temporal and nontemporal knowledge are differentiated. In this model points in time are represented as well as time intervals. A semantic interpretation of verbs is provided based on an extension of Reichenbach's model of temporal markers. The authors show how their approach enables the representation of tenses as well as the aspectual properties of natural language sentences.     

Alleviating convergence problems in Group Support Systems

Not all Group Support Systems are identical, as is demonstrated by their software implementations. We discuss two existing implementations of group support tools and the process models underlying them. We demonstrate that fundamental to both processes is the merging or integration of individual data. Based on this and other empirical research, the Shared Context Model (SCM) of cooperative work is adopted and we show that it supports existing processes and others. We expect that groups will find merging their work easier with the SCM. This model is presented and embedded in the architecture and implementation of four group tools. Because these tools are destined to be used by dispersed groups, synchronously or asynchronously, an object-based communication and control mechanism is incorporated. Finally, as graphics and multi-tasking have been shown to be increasingly important, the tools are implemented in Microsoft Windows for personal computers attached to local area networks.