Correction to: “SPOCU”: scaled polynomial constant unit activation function

Neural Computing and Applications - Addendum on SPOCU fitting and Erratum.     

Monitoring children’s developmental progress using augmented toys and activity recognition

Previous research has established the connection between the way in which children interact with objects and the potential early identification of children with autism. Those findings motivate our own work to develop "smart toys," objects embedded with wireless sensors that are safe and enjoyable for very small children, that allow detailed interaction data to be easily recorded. These sensor-enabled toys provide opportunities for autism research by reducing the effort required to collect and analyze a child’s interactions with objects. In the future, such toys may be a useful part of clinical and in-home assessment tools. In this paper, we discuss the design of a collection of smart toys that can be used to automatically characterize the way in which a child is playing. We use statistical models to provide objective, quantitative measures of object play interactions. We also developed a tool to view rich forms of annotated play data for later analysis. We report the results of recognition experiments on more than fifty play sessions conducted with adults and children as well as discuss the opportunities for using this approach to support video annotation and other applications.     

A hyperheuristic approach to examination timetabling problems: benchmarks and a new problem from practice

Many researchers studying examination timetabling problems focus on either benchmark problems or problems from practice encountered in their institutions. Hyperheuristics are proposed as generic optimisation methods which explore the search space of heuristics rather than direct solutions. In the present study, the performance of tournament-based hyperheuristics for the exam timetabling problem are investigated. The target instances include both the Toronto and ITC 2007 benchmarks and the examination timetabling problem at KAHO Sint-Lieven (Ghent, Belgium). The Toronto and ITC 2007 benchmarks are post-enrolment-based examination timetabling problems, whereas the KAHO Sint-Lieven case is a curriculum-based examination timetabling problem. We drastically improve the previous (manually created) solution for the KAHO Sint-Lieven problem by generating a timetable that satisfies all the hard and soft constraints. We also make improvements on the best known results in the examination timetabling literature for seven out of thirteen instances for the To ronto benchmarks. The results are competitive with those of the finalists of the examination timetabling track of the International Timetabling Competition.     

Using argumentation to model agent decision making in economic experiments

In this paper we demonstrate how a qualitative framework for decision making can be used to model scenarios from experimental economic studies and we show how our approach explains the results that have been reported from such studies. Our framework is an argumentation-based one in which the social values promoted or demoted by alternative action options are explicitly represented. Our particular representation is used to model the Dictator Game and the Ultimatum Game, which are simple interactions in which it must be decided how a sum of money will be divided between the players in the games. Studies have been conducted into how humans act in such games and the results are not explained by a decision-model that assumes that the participants are purely self-interested utility-maximisers. Some studies further suggest that differences in choices made in different cultures may reflect their day to day behaviour, which can in turn be related to the values of the subjects, and how they order their values. In this paper we show how these interactions can be modelled in agent systems in a framework that makes explicit the reasons for the agents’ choices based upon their social values. Our framework is intended for use in situations where agents are required to be adaptable, for example, where agents may prefer different outcome states in transactions involving different types of counter-parties.     

On enabling integrated process compliance with semantic constraints in process management systems

Key to broad use of process management systems (PrMS) in practice is their ability to foster and ease the implementation, execution, monitoring, and adaptation of business processes while still being able to ensure robust and error-free process enactment. To meet these demands a variety of mechanisms has been developed to prevent errors at the structural level (e.g., deadlocks). In many application domains, however, processes often have to comply with business level rules and policies (i.e., semantic constraints) as well. Hence, to ensure error-free executions at the semantic level, PrMS need certain control mechanisms for validating and ensuring the compliance with semantic constraints. In this paper, we discuss fundamental requirements for a comprehensive support of semantic constraints in PrMS. Moreover, we provide a survey on existing approaches and discuss to what extent they are able to meet the requirements and which challenges still have to be tackled. In order to tackle the particular challenge of providing integrated compliance support over the process lifecycle, we introduce the SeaFlows framework. The framework introduces a behavioural level view on processes which serves a conceptual process representation for constraint specification approaches. Further, it provides general compliance criteria for static compliance validation but also for dealing with process changes. Altogether, the SeaFlows framework can serve as formal basis for realizing integrated support of semantic constraints in PrMS.     

The next-generation business meeting: from i-lands to flexible meeting landscapes

Meetings are an important form of interaction in business settings. However, meetings are often not held in a way that makes all participants feel engaged. Meeting support systems try to overcome this obstacle by helping meeting participants in the meeting workflow. This paper takes a complementary approach by distinguishing between different perspectives of good meetings: the peopleware perspective, the generic groupware perspective, and the roomware perspective. It is argued that all these perspectives have to be considered simultaneously when heading toward an ideal meeting system design. The paper presents excerpts of a pattern language that empowers users to improve their meeting. Besides this, the pattern language can be considered as a tool for the designer. After showing, how both groups made use of the patterns, the paper finally presents LivingAgendas, a meeting support system that can accompany the meeting participant through the meeting life cycle.     

Floral volatiles ofTanacetum vulgare L. attractive toLobesia botrana den. et schiff. females

The European grapevine moth (EGVM),Lobesia botrana, is a major pest of grapes in Europe. Females are attracted to a nonhost plant: tansy (Tanacetum vulgare L.), which is a common weed in Slovakian vineyards. A steam distillate extract of tansy flowers was analyzed by means of a GC-EAG technique to screen constituents detected by the olfactory receptors of EGVM females. From more than 200 GC peaks, nine peaks corresponding to monoterpenoids released an EAG response in more than 70% of the females (N=15):p-cymene,d-limonene,-thujene,-thujone,-thujone, thujyl alcohol, terpinene-4-ol, (Z)-verbenol, and piperitone. The steam distillate of tansy as well as a synthetic blend of identified compounds released consistent attraction in a field cage. The use of nonhost plants and host plant odors in integrated pest management is discussed.     

CLP(ℜ) and some electrical engineering problems

The Constraint Logic Programming Scheme defines a class of languages designed for programming with constraints using a logic programming approach. These languages are soundly based on a unified framework of formal semantics. In particular, as an instance of this scheme with real arithmetic constraints, the CLP() language facilitates and encourages a concise and declarative style of programming for problems involving a mix of numeric and non-numeric computation.In this paper we illustrate the practical applicability of CLP() with examples of programs to solve electrical engineering problems. This field is particularly rich in problems that are complex and largely numeric, enabling us to demonstrate a number of the unique features of CLP(). A detailed look at some of the more important programming techniques highlights the ability of CLP() to support well-known, powerful techniques from constraint programming. Our thesis is that CLP() is an embodiment of these techniques in a language that is more general, elegant and versatile than the earlier languages, and yet is practical.An earlier version of this paper appeared in the proceedings of the 4th International Conference on Logic Programming, Melbourne, May 1987. Much of this work was carried out while the authors were at Monash University, Melbourne, Australia.     

On the fit of models to covariances and methodology to the Bulletin..

Notes that 7 of the 10 top-cited articles in the Psychological Bulletin deal with methodological topics. One of these is the P. M. Bentler and D. G. Bonett (1980) article on the assessment of fit in covariance structure models. Some context is provided on the popularity of this article. In addition, a citation study of methodology articles appearing in the Bulletin since 1978 was carried out. It verified that publications in design, evaluation, measurement, and statistics continue to be important to psychological research. Some thoughts are offered on the role of the journal in making developments in these areas more accessible to psychologists. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

On digital smoothing filters: A brief review of closed form solutions and two new filter approaches

The concept of smoothing noisy data using appropriate polynomials turns out to be equivalent to the application of suitable nonrecursive digital filters having the following properties: They process the data in such a way that the moments are conserved up to a desired order while the energy of their impulse response is minimum. Flatness constraints of their frequency response at =0 are equivalent to the moment condition. By using orthogonal polynomials, an explicit solution is known from the literature. A second approach which uses a special decomposition also yields closed form solutions. The realization is simplified, especially in the case where a large number of moments is supposed to be conserved.