Volumetric Procedural Models for Shape Representation

This article describes a volumetric approach for procedural shape modeling and a new Procedural Shape Modeling Language (PSML) that facilitates the specification of these models. PSML provides programmers the ability to describe shapes in terms of their 3D elements where each element may be a semantic group of 3D objects, e.g., a brick wall, or an indivisible object, e.g., an individual brick. Modeling shapes in this manner facilitates the creation of models that more closely approximate the organization and structure of their real-world counterparts. As such, users may query these models for volumetric information such as the number, position, orientation and volume of 3D elements which cannot be provided using surface based model-building techniques. PSML also provides a number of new language-specific capabilities that allow for a rich variety of context-sensitive behaviors and post-processing functions. These capabilities include an object-oriented approach for model design, methods for querying the model for component-based information and the ability to access model elements and components to perform Boolean operations on the model parts. PSML is open-source and includes freely available tutorial videos, demonstration code and an integrated development environment to support writing PSML programs

Context-aware LDA: Balancing Relevance and Diversity in TV Content Recommenders

In the vast and expanding ocean of digital content, users are hardly satisfied with recommended programs solely based on static user patterns and common statistics. Therefore, there is growing interest in recommendation approaches that aim to provide a certain level of diversity, besides precision and ranking. Context-awareness, which is an effective way to express dynamics and adaptivity, is widely used in recom-mender systems to set a proper balance between ranking and diversity. In light of these observations, we introduce a recommender with a context-aware probabilistic graphi-cal model and apply it to a campus-wide TV content de-livery system named “Vision”. Within this recommender, selection criteria of candidate fields and contextual factors are designed and users’ dependencies on their personal pref-erence or the aforementioned contextual influences can be distinguished. Most importantly, as to the role of balanc-ing relevance and diversity, final experiment results prove that context-aware LDA can evidently outperform other al-gorithms on both metrics. Thus this scalable model can be flexibly used for different recommendation purposes

A Type-Safe Model of Adaptive Object Groups

Services are autonomous, self-describing, technology-neutral software units that can be described, published, discovered, and composed into software applications at runtime. Designing software services and composing services in order to form applications or composite services requires abstractions beyond those found in typical object-oriented programming languages. This paper explores service-oriented abstractions such as service adaptation, discovery, and querying in an object-oriented setting. We develop a formal model of adaptive object-oriented groups which offer services to their environment. These groups fit directly into the object-oriented paradigm in the sense that they can be dynamically created, they have an identity, and they can receive method calls. In contrast to objects, groups are not used for structuring code. A group exports its services through interfaces and relies on objects to implement these services. Objects may join or leave different groups. Groups may dynamically export new interfaces, they support service discovery, and they can be queried at runtime for the interfaces they support. We define an operational semantics and a static type system for this model of adaptive object groups, and show that well-typed programs do not cause method-not-understood errors at runtime.Comment: In Proceedings FOCLASA 2012, arXiv:1208.432

Dynamic Organizations: Achieving Marketplace and Organizational Agility with People

Driven by dynamic competitive conditions, an increasing number of firms are experimenting with new, and what they hope will be, more dynamic organizational forms. This development has opened up exciting theoretical and empirical venues for students of leadership, business strategy, organizational theory, and the like. One domain that has yet to catch the wave, however, is strategic human resource management (SHRM). In an effort to catch up, we here draw on the dynamic organization (DO) and human resource strategy (HRS) literatures to delineate both a process for uncovering and the key features of a carefully crafted HRS for DOs. The logic is as follows. DOs compete through marketplace agility. Marketplace agility requires that employees at all levels engage in proactive, adaptive, and generative behaviors, bolstered by a supportive mindset. Under the right conditions, the essential mindset and behaviors, although highly dynamic, are fostered by a HRS centered on a relatively small number of dialectical, yet paradoxically stable, guiding principles and anchored in a supportive organizational infrastructure. This line of reasoning, however, rests on a rather modest empirical base and, thus, is offered less as a definitive statement than as a spur for much needed additional research

Developing a Generic Debugger for Advanced-Dispatching Languages

Programming-language research has introduced a considerable number of advanced-dispatching mechanisms in order to improve modularity. Advanced-dispatching mechanisms allow changing the behavior of a function without modifying their call sites and thus make the local behavior of code less comprehensible. Debuggers are tools, thus needed, which can help a developer to comprehend program behavior but current debuggers do not provide inspection of advanced-\ud dispatching-related language constructs. In this paper, we present a debugger which extends a traditional Java debugger with the ability of debugging an advanced-dispatching language constructs and a user interface for inspecting this

The dark side of employee referral bonus programs : potential applicants’ awareness of a referral bonus and perceptions of organizational attractiveness

The purpose of this study is to examine the effects of potential applicants’ awareness of employees being rewarded for referrals on organizational attractiveness, based on credibility theory and the multiple inference model. In a first study (N=450), final-year students were less attracted to the organization when they knew employee referrals were rewarded, which was partially explained by lower credibility perceptions. Moreover, varying the specific characteristics of the referral bonus program (i.e., timing, size, type, recipient) did not improve potential applicants’ perceptions of credibility and attractiveness. A second study (N=127) replicated the negative effect of referral bonuses on organizational attractiveness and found that it could be explained by both potential applicants’ inferences about the referrer’s other-oriented motive and lower referrer credibility. Whether employees explicitly stated their referral reason was bonus-driven or not did not affect these results

Towards Practical Graph-Based Verification for an Object-Oriented Concurrency Model

To harness the power of multi-core and distributed platforms, and to make the development of concurrent software more accessible to software engineers, different object-oriented concurrency models such as SCOOP have been proposed. Despite the practical importance of analysing SCOOP programs, there are currently no general verification approaches that operate directly on program code without additional annotations. One reason for this is the multitude of partially conflicting semantic formalisations for SCOOP (either in theory or by-implementation). Here, we propose a simple graph transformation system (GTS) based run-time semantics for SCOOP that grasps the most common features of all known semantics of the language. This run-time model is implemented in the state-of-the-art GTS tool GROOVE, which allows us to simulate, analyse, and verify a subset of SCOOP programs with respect to deadlocks and other behavioural properties. Besides proposing the first approach to verify SCOOP programs by automatic translation to GTS, we also highlight our experiences of applying GTS (and especially GROOVE) for specifying semantics in the form of a run-time model, which should be transferable to GTS models for other concurrent languages and libraries.Comment: In Proceedings GaM 2015, arXiv:1504.0244