Software engineering technology innovation - Turning research results into industrial success This paper deals with the innovation of software engineering technologies. These technologies are methods and tools for conducting software development and maintenance. We consider innovation as a process consisting of two phases, being technology creation and technology transfer. In this paper, we focus mainly on the transfer phase. Technology transfer is of mutual interest to both academia and industry. Transfer is important for academia, because it shows the industrial relevance of their research results to, for example, their sponsoring authorities. Showing the industrial applicability of research results is sometimes referred to as valorization of research. Nowadays, valorization is often required by research funding bodies. The transfer is important for industries, because innovating their development processes and their products is supportive in gaining a competitive edge or remaining competitive in their business. We describe the technology transfer phase by means of three activities: technology evaluation, technology engineering, and technology embedding. The technology evaluation activity is perceived as the main gate between the technology creation phase and the technology transfer phase. With two case studies. originating from the Dutch high-tech systems industry, we will illustrate the activities in the transfer phase. In addition to the process we will also define the main roles in a software engineering technology innovation, namely: the technology provider (academic research, industrial research and technology vendor) and the technology receiver (industrial development). With those roles we also address the issues concerning the ownership of technologies. (c) 2009 Elsevier Inc. All rights reserved.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O B I O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O B I O B I O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

technology transfer
process
technology engineering
technology embedding


Recovering the missing components in a large noisy low-rank matrix: Application to SFM In computer vision, it is common to require operations on matrices with "missing data," for example, because of occlusion or tracking failures in the Structure from Motion (SFM) problem. Such a problem can be tackled, allowing the recovery of the missing values, if the matrix should be of low rank ( when noise free). The filling in of missing values is known as imputation. Imputation can also be applied in the various subspace techniques for face and shape classification, online "recommender" systems, and a wide variety of other applications. However, iterative imputation can lead to the "recovery" of data that is seriously in error. In this paper, we provide a method to recover the most reliable imputation, in terms of deciding when the inclusion of extra rows or columns, containing significant numbers of missing entries, is likely to lead to poor recovery of the missing parts. Although the proposed approach can be equally applied to a wide range of imputation methods, this paper addresses only the SFM problem. The performance of the proposed method is compared with Jacobs' and Shum's methods for SFM.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B B O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O

missing-data problem
rank constraint
singular value decomposition
denoising capacity
affine sfm
linear subspace


DTPA: A reliable datagram transport protocol over ad hoc networks As a prevalent reliable transport protocol in the Internet, TCP uses two key functions: the additive- increase multiplicative-decrease (AIMD) congestion control and a cumulative ACK technique for guaranteeing delivery. However, these two functions lead to the inefficiency of TCP in ad hoc networks where the TCP connections have very small bandwidth-delay products (BDPs) and there are frequent packet losses in the network due to various reasons such as route breakages and radio interference. In this paper, we show that if the BDP of a path is as low as several packets and is known before the connection establishment, any AIMD-style congestion control is costly and is hence not necessary for ad hoc networks. On the contrary, a technique for guaranteeing reliable transmission and recovering packet losses plays a more critical role in the design of a transport protocol over ad hoc networks. With this basis, we propose a novel effective datagram-oriented end-to-end reliable transport protocol for ad hoc networks, which we call Datagram Transport Protocol for Ad hoc networks (DTPA). The proposed scheme incorporates two techniques: a fixed-sizewindow-based flow-control algorithm and a cumulative bit-vector-based selective ACK strategy. We then develop a mathematical model for evaluating the performance of DTPA based on these two techniques. An optimum transmission window is determined for an n-hop chain and is computed to be the BDP of the path plus 3. The protocol is verified using GloMoSim, and simulation results show that our proposal substantially improves the network performance in terms of throughput, round-trip time, number of retransmissions, and IP queue size.

O O O O O O O B I I O O O B I I O O O B O O O O O O O O O B I O O O O O O O O O O O O O O O O O B O B I I O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O B I I O B I I O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

tcp
reliable transport protocol
congestion control
ad hoc networks


Weakly Supervised Photo Cropping Photo cropping is widely used in the printing industry, photography, and cinematography. Conventional photo cropping methods suffer from three drawbacks: 1) the semantics used to describe photo aesthetics are determined by the experience of model designers and specific data sets, 2) image global configurations, an essential cue to capture photos aesthetics, are not well preserved in the cropped photo, and 3) multi-channel visual features from an image region contribute differently to human aesthetics, but state-of-the-art photo cropping methods cannot automatically weight them. Owing to the recent progress in image retrieval community, image-level semantics, i.e., photo labels obtained without much human supervision, can be efficiently and effectively acquired. Thus, we propose weakly supervised photo cropping, where a manifold embedding algorithm is developed to incorporate image-level semantics and image global configurations with graphlets, or, small-sized connected subgraph. After manifold embedding, a Bayesian Network (BN) is proposed. It incorporates the testing photo into the framework derived from the multi-channel post-embedding graphlets of the training data, the importance of which is determined automatically. Based on the BN, photo cropping can be casted as searching the candidate cropped photo that maximally preserves graphlets from the training photos, and the optimal cropping parameter is inferred by Gibbs sampling. Subjective evaluations demonstrate that: 1) our approach outperforms several representative photo cropping methods, including our previous cropping model that is guided by semantics-free graphlets, and 2) the visualized graphlets explicitly capture photo semantics and global spatial configurations.

B I B I B I O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I B I O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O

bayesian network
photo cropping
weakly supervised


Fast and loose reasoning is morally correct Functional programmers often reason about programs as if they were written in a total language, expecting the results to carry over to non-total (partial) languages. We justify such reasoning. Two languages are defined, one total and one partial, with identical syntax. The semantics of the partial language includes partial and infinite values, and all types are lifted, including the function spaces. A partial equivalence relation (PER) is then defined, the domain of which is the total subset of the partial language. For types not containing function spaces the PER relates equal values, and functions are related if they map related values to related values. It is proved that if two closed terms have the same semantics in the total language, then they have related semantics in the partial language. It is also shown that the PER gives rise to a bicartesian closed category which can be used to reason about values in the domain of the relation.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O B O O O O O O O O O O O O O O O O O B I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

theory
verification
equational reasoning
partial and total languages
non-strict and strict languages
lifted types
inductive and coinductive types


a heuristic routing mechanism using a new addressing scheme Current methods of routing are based on network information in the form of routing tables, in which routing protocols determine how to update the tables according to the network changes. Despite the variability of data in routing tables, node addresses are constant. In this paper, we first introduce the new concept of variable addresses, which results in a novel framework to cope with routing problems using heuristic solutions. Then we propose a heuristic routing mechanism based on the application of genes for determination of network addresses in a variable address network and describe how this method flexibly solves different problems and induces new ideas in providing integral solutions for variety of problems. The case of ad-hoc networks is where simulation results are more supportive and original solutions have been proposed for issues like mobility.

O B I O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Deal of the Day-Plattformen: Was treibt die Kundenloyalitt? Die Beliebtheit von Deal of the Day (DoD)-Plattformen ist rasant angestiegen, da sie Einsparungen fr lokale Dienstleistungen, Produkte und Urlaube anbieten. Fr Hndler stellen diese Plattformen einen neuen Marketingkanal dar, um ihre Produkte und Services zu bewerben und neue Kunden zu gewinnen. Die Betreiber von DoD-Plattformen kmpfen jedoch um einen stabilen Marktanteil und Profitabilitt, da Eintritts- und Wechselkosten gering sind. Um eine wettbewerbsfhige Marktposition zu halten, suchen DoD-Betreiber daher nach Wegen, um einen loyalen Kundenstamm aufzubauen. Jedoch gibt es bisher kaum Forschung, welche die Determinanten von Kundenloyalitt in diesem neuen Kontext untersucht. Um diese Lcke zu fllen, nutzt diese Studie die Grounded-Theory-Methodologie, um ein konzeptionelles Modell der Kundenloyalitt fr DoD-Betreiber zu entwickeln. Im nchsten Schritt werden diese qualitativen Erkenntnisse erweitert und validiert unter Verwendung quantitativer Daten, die im Rahmen einer Umfrage unter 202 DoD-Nutzern erhoben wurden. Die Autoren haben herausgefunden, dass Kundenloyalitt zu einem groen Teil von monetren Anreizen beeinflusst wird, welche jedoch untergraben werden, wenn die Begegnung mit dem Hndler unter den Erwartungen bleibt. Zustzlich stellen die Erweiterung des Anteils relevanter Deals fr Kunden (d.h. das Signal-Rausch-Verhltnis) und die Verringerung des wahrgenommenen Risikos einer Transaktion eine Herausforderung dar. Neben ihrem theoretischen Wert bieten die Erkenntnisse praktische Einblicke darber, wie die Kundenloyalitt zu DoD-Betreibern verbessert werden kann.

O O O O O O O O O O O B I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

loyalitt
grounded theory
strukturgleichungsmodell
loyalty
structural equation modeling


Combination of multiple classifiers for the customer's purchase behavior prediction In these days, EC companies are eager to learn about their customers using data mining technologies. But the diverse situations of such companies make it difficult to know which is the most effective algorithm for the given problems. Recently, a movement towards combining multiple classifiers has emerged to improve classification results. In this paper, we propose a method for the prediction of the EC customer's purchase behavior by combining multiple classifiers based on genetic algorithm. The method was tested and evaluated using Web data from a leading EC company. We also tested the validity of our approach in general classification problems using handwritten numerals. In both cases, our method shows better performance than individual classifiers and other known combining methods we tried.

B O B I O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O B I O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

purchase behavior prediction
multiple classifiers
combination
genetic algorithm


LZ trie and dictionary compression An efficient algorithm for trie compression has already been described. Here we present its practical value and demonstrate its superiority in terms of space savings to other methods of lexicon compression. Apart from simple lexicons, a compressed trie can, with some additional processing, be used as a component in the compact representation of simple static databases. We present the potential of the algorithm in compressing natural language dictionaries. Copyright (c) 2005 John Wiley A Sons, Ltd.

B I O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

lz trie
lexicon compression
dictionary compression

index compression
static database compression


A DSL for modeling application-specific functionalities of business applications A DSL for specifying application-specific functionalities of business applications. Application-specific functionalities are specified at the PIM level. Complete program code is generated. We present the language editor.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

domain-specific languages
iis?cfunclang
application-specific functionalities
model transformations
iis?case


Sourcing decisions with capacity reservation contracts By committing to long-term supply contracts, buyers seek to lower their purchasing costs, and have products delivered without interruption. When a long-term contract is available, suppliers are less pressured to find new customers, and can afford to charge a price lower than the prevailing spot market price. We examine sourcing decisions of a firm in the presence of a capacity reservation contract that this firm makes with its long-term supplier in addition to the spot market alternative. This contract entails delivery of any desired portion of a reserved fixed capacity in exchange for a guaranteed payment by the buyer. We investigate rational actions of the two parties under two different types of periodic review inventory control policies used by the buyer: the two-number policy, and the base stock policy. When typical demand probability distributions are considered, inclusion of the spot market source in the buyers procurement plan significantly reduces the capacity commitments from the long-term supplier.

O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

supply chain management
long-term contracts


Studies of structures elaborated by focused ion beam induced deposition In this contribution, we present characterizations of tungsten wires and silicon oxide layers elaborated by focused ion beam induced deposition (FIBID). The deposits are performed in a cross-beam station equipped with a three channel gas injection system. Tungsten wires have been deposited from tungsten hexacarbonyl precursor. We have studied their electrical properties in situ by following the evolution of the wire resistance during the deposition process. These submicronic wires display an ohmic behaviour, a low resistivity (only 20 times higher than the bulk) and a good stability. As for insulator deposition, silicon oxide films from dissociation of penta methyl cyclo penta siloxane (PMCPS) precursor have been patterned. We present our results concerning electrical and chemical analyses carried out on test structure entirely elaborated by FIBID.

O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O


the effect of crossover on evolution ability of population Currently most of the analysis about the running mechanism of GA focuses on the convergence problem while few focus on population characteristics after the single generation descendiblity. This paper presents the concept of evolution ability of population and discusses the ability of finding the optimal solution for the population after one-generation selection, crossover and mutation. Based on the analysis of effect of crossover on evolution ability of population, this paper presents some important conclusions. The important method to improve evolution ability of population is to include larger crossover optimal solution area in a smaller crossover family area. If the crossover optimal solution area isn't included in any crossover family area of population, the population either converges to the optimal solution, or evolution will be trapped in the premature of convergence. These conclusions above do not only help improve the GA, but also provide the basis for later research work.

O O O O O B I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I I O O O O O O O O O O O B I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Saliency detection based on singular value decomposition ? Saliency detection based on the human-perception mechanism is proposed. The relationship of singular values and salient regions is investigated. Singular values are divided into large, intermediate, and small. Salient regions appear after regularizing the singular values.

B I O O B I I O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

saliency detection
singular value decomposition

gaussian filter
human-perception mechanism
learning-based
human-eye fixations
salient-object detection
visual attention


Solution of unit commitment problem using quasi-oppositional teaching learning based algorithm This paper presents QOTLBO based algorithm to solve UC problems. Presents quasi oppositional based learning strategy to improve TLBO algorithm. Valve-point effects, ramp rate, spinning reserve and up/down time constraints are considered. The robustness of the QOTLBO is demonstrated in five standard UC problems. Performance of QOTLBO is found to be better than other techniques.

O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

unit commitment
spinning reserve
ramp rate

teaching learning based algorithm (tlbo)

quasi-oppositional based learning (qobl)


Fine grained load balancing in multi-hop wireless networks In this paper we address the problem of local balancing in multi-hop wireless networks. We introduce the notion of proactive routing: after a short pre-processing phase in which nodes build their routing tables by exchanging messages with neighbors, we require that nodes decide the relay of each message without any further interaction with other nodes. Besides delivering very low communication overhead, proactive routing protocols are robust against some well known active attacks to network routing. In this framework, we develop a proactive routing protocol that is able to balance the local load. Experiments show that our protocol improves network lifetime up to 98% and that it delivers a network that is more robust against attacks that have the goal of getting control over a large part of the network traffic.

O O B I O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O B O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

multi-hop wireless networks
sensor networks
security
energy efficient


Mixed finite elements for electromagnetic analysis The occurrence of spurious solutions is a well-known limitation of the standard nodal finite element method when applied to electromagnetic problems. The two commonly used remedies that are used to address this problem are (i) The addition of a penalty term with the penalty factor based on the local dielectric constant, and which reduces to a Helmholtz form on homogeneous domains (regularized formulation); (ii) A formulation based on a vector and a scalar potential. Both these strategies have some shortcomings. The penalty method does not completely get rid of the spurious modes, and both methods are incapable of predicting singular eigenvalues in non-convex domains. Some non-zero spurious eigenvalues are also predicted by these methods on non-convex domains. In this work, we develop mixed finite element formulations which predict the eigenfrequencies (including their multiplicities) accurately, even for nonconvex domains. The main feature of the proposed mixed finite element formulation is that no ad-hoc terms are added to the formulation as in the penalty formulation, and the improvement is achieved purely by an appropriate choice of finite element spaces for the different variables. We show that the formulation works even for inhomogeneous domains where double noding is used to enforce the appropriate continuity requirements at an interface. For two-dimensional problems, the shape of the domain can be arbitrary, while for the three-dimensional ones, with our current formulation, only regular domains (which can be nonconvex) can be modeled. Since eigenfrequencies are modeled accurately, these elements also yield accurate results for driven problems.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

spurious modes
mixed finite element formulation


A Monte Carlo Enhanced PSO Algorithm for Optimal QoM in Multi-Channel Wireless Networks In wireless monitoring networks, wireless sniffers are distributed in a region to monitor the activities of users. It can be used for fault diagnosis, resource management and critical path analysis. Due to hardware limitations, wireless sniffers typically can only collect information on one channel at a time. Therefore, it is a key topic to optimize the channel selection for sniffers to maximize the information collected, so as to maximize the quality of monitoring (QoM) of the network. In this paper, a particle swarm optimization (PSO)-based solution is proposed to achieve the optimal channel selection. A 2D mapping particle coding and its moving scheme are devised. Monte Carlo method is incorporated to revise the solution and significantly improve the convergence of the algorithm. The extensive simulations demonstrate that the Monte Carlo enhanced PSO (MC-PSO) algorithm outperforms the related algorithms evidently with higher monitoring quality, lower computation complexity, and faster convergence. The practical experiment also shows the feasibility of this algorithm.

O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O B I I O O O O O O O O B I I O O O O O O O O B I O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

channel selection
quality of monitoring
monte carlo
particle swarm optimization


EIBAS EIBAS : An efficient identity-based broadcast authentication scheme in wireless sensor networks In this paper, we propose an efficient identity-based broadcast authentication scheme, EIBAS EIBAS , to achieve security requirements in wireless sensor networks. To minimize communication and computational costs, we use a pairing-optimal identity-based signature scheme with message recovery, where the original message of the signature is not required to be transmitted together with the signature, as it can be recovered according to the verification/message recovery process. The EIBAS EIBAS scheme achieves a minimization of communication overhead, allowing the total energy consumption to be reduced by up to 48.5% compared to previous identity-based broadcast authentication schemes.

O O O O O O B I O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O

identity-based system
digital signature with message recovery
message integrity
bilinear pairing


cad-based security, cryptography, and digital rights management Manufacturing variability is inherent to many silicon and nano-scale technologies and can be manifested in many different ways and modalities (e.g. power and delay). We propose a flow that starts with gate-level integrated circuit (IC) characterization which results in unique identification (ID). The ID's are an integrated part of the design functionality and software and provide a basis for conceptually new CAD-based security protocols. As an examples, we present a new IC metering schemes that ensure very low overhead and digital right management in horizontally integrated IC market. Therefore, after many years of CAD importing and benefiting from many other areas such as numerical analysis, theoretical CS, VLSI design, computer architectures, and compilers, CAD has its historical chance to impact many fields of computer science and engineering through manufacturing variability-based security and right management.

O B O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O

computer-aided design
intellectual property protection
hardware metering


timing closure for low-fo4 microprocessor design In this paper, we discuss timing closure for high performance microprocessor designs. Aggressive cycle time and deep sub-micron technology scaling introduce a myriad of problems that are not present in the ASIC domain. The impact of these problems on floorplanning, placement, clocking and logic synthesis is described. We present ideas and potential solutions for tackling these problems.

O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O B O O O O O O O O O O O O


delay-optimal technology mapping for fpgas with heterogeneous luts Recent generation of FPGAs take advantage of speed and density benefits resulted from heterogeneous FPGAs, which provide either an array of homogeneous programmable logic blocks (PLBs), each configured to implement circuits with lookup tables (LUTs) of different sizes, or an array of physically heterogeneous LUTs. LUTs with different sizes usually have different delays. This paper presents the first polynomial-time optimal technology mapping algorithm, named HeteroMap, for delay minimization in heterogeneous FPGA designs. For a heterogeneous FPGA consisting of K 1 -LUTs, K 2 -LUTs, , and K c -LUTs, HeteroMap computes the minimum delay mapping solution in O (? c i =1 K i n m log n ) time for a circuit netlist with n gates and m edges. The HeteroMap algorithm generates favorable results for Xilinx XC4000 series FPGAs and Lucent ORCA2C series FPGAs. Furthermore, the optimality of the HeteroMap algorithm enables us to quantitatively evaluate various heterogeneous architectures without the bias of mapping heuristics.

O B I O B O O O O B O B O O O O O O O O O O B O O O O O O O B I O O O O O O B O O B O O O O O O O O O O O O O O O O O O O O B O O O O O B I B O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O B O O O O B O O B O O O B O O O O O O O O O O B O O B

fpgas
generation
optimality
technology mapping
delay
programmable logic
tables
heuristics
bias
algorithm
paper
circuits

polynomial
pla-style logic blocks
architecture
design
programmable logic devices
arrays
map
timing
heterogeneity
evaluation
minimal


adaptive shifting of auxiliary strategies over three formulations of multicast routing problem Multicast routing algorithms have recently been intensively investigated due to the increment over the last years in the use of new point-to-multipoint applications. In this work, three formulations for the routing problem are investigated, considering 3, 4 and 5 objectives related to Quality of Service and Traffic Engineering requirements. A multiobjective evolutionary model is proposed to tackle this problem, using the well-known SPEA2 scheme as the underlying search. The key investigation performed here is about the incorporation of two strategies to help SPEA2 convergence to Pareto solutions, namely, filtering to reduce repeated individuals, and a mating selection based on neighborhood crossover. Results indicate that the adequacy of the strategies depends on the dynamics of currently non-dominated set over the generations. A new adaptive environment is proposed in which this information is considered periodically to decide what kind of strategy will be used in each situation.

O O O O O O O O O B I O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Optimal instruction set design through adaptive database generation This paper proposes a new method to design an optimal pipelined instruction set processor for ASIP development using a formal HW/SW codesign methodology. First, a HW/SW partitioning algorithm for selecting an optimal pipelined architecture is outlined. Then, an adaptive database approach is presented that enables to enhance the optimality of the design through very accurate estimation of the performance of a pipelined ASIP in the HW/SW partitioning process. The experimental results show that the proposed method is effective and efficient.

O O O O O B I I O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O

hw/sw partitioning
performance estimation


Evaluation of mechanical stresses in silicon substrates due to leadtin solder bumps via synchrotron X-ray topography and finite element modeling Solder-based flip-chip packaging has prompted interest in integrated circuit (IC) packaging applications due to its many advantages in terms of cost, package size, electrical performance, input/output density, etc. The ball grid array (BGA) is one of the most common flip-chip packaging techniques used for microprocessor applications. However, mechanical stresses induced by the flip-chip process can impact adversely on the reliability of products. Synchrotron X-ray topography (SXRT), a non-destructive technique, has been employed to investigate the spatial extent of strain fields imposed on the underlying silicon substrate for IntelPentiumIII microprocessors due to the leadtin solder bump process for BGA packaging. Large area and section back-reflection SXRT images were taken before and after a simulation of the reflow process at 350 C in atmosphere. The presence of induced strain fields in the Si substrate due to the overlying bump structures has been observed via the extinction contrast effect in these X-ray topographs. In addition, orientational contrast effects have also been found after the reflow process due to the severe stresses in the underlying silicon beneath the lead bumps. The estimated magnitudes of stress, ???, imposed on the underlying silicon were calculated to be of the order of 100 MPa. The spatial strains in the underlying silicon were relieved dramatically after the lead bumps were removed from the wafer, which confirms that the bumps are indeed a major source of strain in the underlying Si. Finite element modeling (FEM) has also been performed in two-dimensional (2-D) plane strain mode. The magnitudes and spatial distribution of the stresses after the reflow process are in good agreement with the SXRT results.

O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

finite element modeling
ball grid array
stress


A note on Taylor series approach to fuzzy multiple objective linear fractional programming Toksari, in his paper Taylor series approach to fuzzy multiobjective linear fractional programming, published in Information Sciences 178 (2008), proposed a new method to solve multiple objective linear fractional programming problems and declared that it is more effective when compare to previous methods. He constructed fuzzy goals and then used first order Taylor-polynomials to approximate the corresponding linear fractional membership functions by linear functions. Aggregating the linear functions Toksari obtained a crisp linear programming problem and claimed that it is equal to the fuzzy fractional one. In this paper, we indicate the fallacy that arises by using Taylor approximation and propose an improved method that guarantees the efficiency of the solution it provides. Both practical applications from Toksaris paper are recalled to show that the improvements we suggest are effective.

O O O O O O O O O O B I I O O O O O O O O O O B I I O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

fuzzy mathematical programming
multi-objective optimization


Fractal descriptors based on the probability dimension: A texture analysis and classification approach ? A texture descriptor is proposed based on the fractal descriptors concept. Fractal dimension estimation is performed by the probability (Voss) method. The descriptor are obtained applying a multi-scale transform into the fractal curve. The method is compared and outperforms fractal and non-fractal texture stat-of-art methods.

B I O O O B I O B I O O O O O O O O O O O O B I O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

fractal dimension
fractal descriptors
probability dimension
texture analysis


Pansystems-based fuzzy systems relations and clustering Purpose - Melting universality, quantification and relative computability into a meta-synthesis, pansystems theory develops ail investigation on W-fuzziness and 0*-fuzziness connected with generalized conceptions such as derivative, equation, variational principle and OR. The purpose of this paper is to unify various mathematical structures, fuzziness categories, definitions of systems are unified within a general framework. Design/methodology/approach - The paper includes topics: pansystems approach to fuzzy systems and relations, pansystems variational principle and Zadeh's extension principle, pansystems clustering and its fuzzy embodiment, pansystems topology and approximation to fuzziness, relative unification of fuzziness and roughness. Findings - Zadeh extension principle about fuzziness transmission can be considered as a specific model of pansystems extremum principle, and so the more modes can be developed. Based on them a further investigation is present on pansystems clustering, which is a W-fuzzy clustering, an extension or sublation of traditional one and fuzzy one. Originality/value - Pansystems clustering embodies mutuality of many logoi of different subbraches with classification-styled OR, including related interpromotions of the principles among knowledge rediscovery, data mining, mathematical reasoning and the investigations of fuzzy systems. W-fuzziness and 0*-fuzziness realize a relative unification for many logoi and principles.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

fuzzy logic
approximation theory
cybernetics
cluster analysis
systems theory


hand motion gestural oscillations and multimodal discourse To develop multimodal interfaces, one needs to understand the constraints underlying human communicative gesticulation and the kinds of features one may compute based on these underlying human characteristics.In this paper we address hand motion oscillatory gesture detection in natural speech and conversation. First, the hand motion trajectory signals are extracted from video. Second, a wavelet analysis based approach is presented to process the signals. In this approach, wavelet ridges are extracted from the responses of wavelet analysis for the hand motion trajectory signals, which can be used to characterize frequency properties of the hand motion signals. The hand motion oscillatory gestures can be extracted from these frequency properties. Finally, we relate the hand motion oscillatory gestures to the phases of speech and multimodal discourse analysis.We demonstrate the efficacy of the system on a real discourse dataset in which a subject described her action plan to an interlocutor. We extracted the oscillatory gestures from the x , y and z motion traces of both hands. We further demonstrate the power of gestural oscillation detection as a key to unlock the structure of the underlying discourse.

O O O O O B O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

speech analysis
hand gesture
multimodal discourse structure
interaction
gesture symmetry


The relationship between quality management practices and their effects on quality outcomes Recent research into quality management has examined the relationship between quality management and performance. The purpose of this study is to identify the relationships between quality management practices, and to examine the direct and indirect effects of these practices on quality outcomes by means of replication research. The paper uses a path analysis and a research model is tested using cross-section data collected from 106 certified firms in Spain. The findings support the relationships between quality management practices and the positive impact of these practices on quality outcomes. Evidence is also found confirming previous research showing that a firm could transfer the organizational forms and behaviours underlying quality management to other countries with similar cultures. However, as minor differences emerge, managers should consider the cultural issues. The contribution of the paper is that it provides empirical support for direct and indirect effects of quality management on performance in Spain compared to previous studies carried out in USA and Korea.

O O O B I O O O O O O O O O O B I O O O O O B I O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O B O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O B O O O O O O O O O O


An experience report: porting the MG-RAST rapid metagenomics analysis pipeline to the cloud Existing applications in computational biology typically favor a local cluster based integrated computational platform. We present a lessons learned type report for scaling up an existing metagenomics application that outgrew the available local cluster hardware. In our example, removing a number of assumptions linked to tight integration allowed to expand beyond one administrative domain, increase the number and type of machines available for the application, and also improved scaling properties of the application. The assumptions made in designing the computational client make it well suitable for deployment as a virtual machine inside a cloud. This paper discusses the decision process and describes the suitability of deploying various bioinformatics computations to distributed heterogeneous machines. Copyright (C) 2011 John Wiley & Sons, Ltd.

O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O


A high-precision unstructured adaptive mesh technique for gas-liquid two-phase flows Adaptive mesh techniques are used widely in the numerical simulations of fluid flows, and the simulation results with high accuracies are obtained by appropriate mesh adaptations. However, gasliquid two-phase flows are still difficult to be simulated on adaptive meshes, especially on unstructured adaptive meshes, because the physical phenomena near gasliquid interfaces are highly complicated and in general, not modeled appropriately on adaptive meshes. In this paper, a high-precision unstructured adaptive mesh technique for gasliquid two-phase flows is developed and verified/validated. In the unstructured adaptive mesh technique, the PLIC algorithm is employed to simulate interfacial dynamic behaviors and, therefore, the reconstruction method for the interfaces in refined cells is developed, which satisfies the gas and liquid volume conservations and geometrical conservations of interfaces. In addition, the physics-based consideration is performed on the momentum calculations near interfaces, and the calculation method with gas and liquid momentum conservations is developed. For verification, the slotted-disk revolution problem is solved. As a result, the unstructured adaptive mesh technique succeeds in reproducing the slotted-disk shape accurately and well maintaining the shape after one full-revolution. The dam-break problem is also simulated and the momentum conservative calculation method succeeds in providing physically appropriate results, which show good agreements with experimental data. Therefore, it is confirmed that the developed unstructured adaptive mesh technique is very efficient to simulate gasliquid two-phase flows accurately. Copyright (C) 2010 John Wiley & Sons, Ltd.

O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O B I I O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O

numerical simulation
gas-liquid two-phase flow
volume-of-fluid


A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems Multilevel lot-sizing (MLLS) problems, which involve complicated product structures with interdependence among the items, play an important role in the material requirement planning (MRP) system of modern manufacturing/assembling lines. In this paper, we present a reduced variable neighborhood search (RVNS) algorithm and several implemental techniques for solving uncapacitated MLLS problems. Computational experiments are carried out on three classes of benchmark instances under different scales (small, medium, and large). Compared with the existing literature, RVNS shows good performance and robustness on a total of 176 tested instances. For the 96 small-sized instances, the RVNS algorithm can find 100% of the optimal solutions in less computational time; for the 40 medium-sized and the 40 large-sized instances, the RVNS algorithm is competitive against other methods, enjoying good effectiveness as well as high computational efficiency. In the calculations, RVNS updated 7 (17.5%) best known solutions for the medium-sized instances and 16 (40%) best known solutions for the large-sized instances.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

uncapacitated multilevel lot-sizing (mlls) problem

reduced variable neighborhood search (rvns) algorithm


An outer bound to the capacity region of the broadcast channel An outer bound to the capacity region of the two-receiver discrete memoryless broadcast channel is given. The outer bound is tight for all cases where the capacity region is known. When specialized to the case of no common information, this outer bound is contained in the Korner-Marton outer bound. This containment is shown to be strict for the binary skew-symmetric broadcast channel. Thus, this outer bound is in general tighter than all other known outer bounds.

O B I O O B O O O B I O B I O O B O O O O O O B I O O O B I O O O O O O O B O O O O O O O O O O O O O B I O O O O O B I O O O O O O O O O O O B I O O B I O O O O O O O O O O


task-first or context-first? tool integration revisited If software engineering tools are not "properly integrated", they can reduce engineers' productivity. Associating and retrieving information scattered across the tools become unsystematic and inefficient. Our work provides empirical evidence on what is a "poor" and a "proper" tool integration, focusing on practitioners' perspectives. We interviewed 62 engineers and analyzed the content of their project artifacts. We identified problem situations and practices related to tool integration. Engineers agreed that tool integration approaches must support change, heterogeneity and automatic linking of change to context. To quantify our results, we conducted a field experiment with 27 and a survey with 782 subjects. We found a strong correlation between change frequency and preferred integration approaches. Particularly in projects with short release cycles, tasks should be used to link information handled by different tools. We also found that half of engineers' work is not defined as tasks. Therefore, a context-based tool integration approach is more effective than a task-based one.

O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O B I O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O

task management
emperical research
information need
context awareness


An improved greedy search algorithm for the development of a phonetically rich speech corpus An efficient way to develop large scale speech corpora is to collect phonetically rich ones that have high coverage of phonetic contextual units. The sentence set, usually called as the minimum set, should have small text size in order to reduce the collection cost. It can be selected by a greedy search algorithm from a large mother text corpus. With the inclusion of more and more phonetic contextual effects, the number of different phonetic contextual units increased dramatically, making the search not a trivial issue. In order to improve the search efficiency, we previously proposed a so-called least-to-most-ordered greedy search based on the conventional algorithms. This paper evaluated these algorithms in order to show their different characteristics. The experimental results showed that the least-to-most-ordered methods successfully achieved smaller objective sets at significantly less computation time, when compared with the conventional ones. This algorithm has already been applied to the development a number of speech corpora, including a large scale phonetically rich Chinese speech corpus ATRPTH which played an important role in developing our multi-language translation system.

O O B I O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O


Cycle Double Covers in Cubic Graphs having Special Structures In the first part of this article, we employ Thomason's Lollipop Lemma [25] to prove that bridgeless cubic graphs containing a spanning lollipop admit a cycle double cover (CDC) containing the circuit in the lollipop; this implies, in particular, that bridgeless cubic graphs with a 2-factor F having two components admit CDCs containing any of the components in the 2-factor, although it need not have a CDC containing all of F. As another example consider a cubic bridgeless graph containing a 2-factor with three components, all induced circuits. In this case, two of the components may separately be used to start a CDC although it is uncertain whether the third component may be part of some CDC. Numerous other corollaries shall be given as well. In the second part of the article, we consider special types of bridgeless cubic graphs for which a prominent circuit can be shown to be included in a CDC. The interest here is the proof technique and therefore we only give the simplest case of the theorem. Notably, we show that a cubic graph that consists of an induced 2k-circuit C together with an induced 4k-circuit T and an independent set of 2k vertices, each joined by one edge to C and two edges to T, has a CDC starting with T.

O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O B O O O O O B O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O


Wave propagation in functionally graded and layered materials In this study, wave propagation in functionally graded materials (FGMs) and layered materials is analyzed using spacetime discontinuous Galerkin method introduced earlier by the authors [H.G. Aksoy, E. Senocak, Spacetime discontinuous Galerkin method for dynamics of solids, Communications in Numerical Methods in Engineering 24 (2008) 18871907]. The numerical performance of the method is presented via two dimensional example problems of wave propagations. The effect of loading (quasi-static and dynamic) on the analysis of displacements and stresses is demonstrated. The results show that spacetime discontinuous Galerkin method is successful in modelling wave propagation in FGMs and layered materials.

B I O O O O O O O O O B I O O O O O O O O O O O O B I I O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O B I O O O O O

wave propagation
discontinuous galerkin method


Directed self-assembly of block copolymers for nanocircuitry fabrication A perspective on the possible insertion of block copolymer lithography into integrated circuit manufacture is provided. Review of the fundamentals of block copolymer self-assembly and substrate interactions. Overview of progress in defining well-defined structural arrangements provided. Key challenges for integration of block copolymer technology are assessed.

O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

chemical epitaxy
physical epitaxy
pattern transfer
process flows
defectivity


how do robotic agents' appearances affect people's interpretations of the agents' attitudes? An experimental investigation of how the appearance of robotic agents affects interpretations people make of the agents.' attitudes is described. We conducted a psychological experiment where participants were presented artificial sounds that can make people estimate specific agents' primitive attitudes from three kinds of agents, e.g., a Mindstorms robot, AIBO robot, and normal laptop PC. They were also asked to select the correct attitudes based on the sounds expressed by these three agents. The results showed that the participants had higher interpretation rates when a PC presented the sounds, while they had lower rates when Mindstorms and AIBO robots presented the sounds, even though the artificial sounds expressed by these agents were completely the same.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

subtle expressions
appearance of agents
agents' attitudes
human-agent interaction


A high order ADI method for separable generalized Helmholtz equations We present a multilevel high order ADI method for separable generalized Helmholtz equations. The discretization method we use is a one-dimensional fourth order compact finite difference applied to each directional component of the Laplace operator, resulting in a discrete system efficiently solvable by ADI methods. We apply this high order difference scheme to all levels of grids, and then starting from the coarsest grid, solve the discretized equation with an ADI method at each grid level, with the solution from the previous grid level as the initial guess. The multilevel procedure stops as the ADI finishes its iterations on the finest grid. Analytical and experimental results show that the proposed method is highly accurate and efficient while remaining as algorithmically and data-structurally simple as the single grid ADI method.

O O O B I O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I

generalized helmholtz equation
multilevel method
high order discretization


associating assertions with business processes and monitoring their execution Business processes that span organizational borders describe the interaction between multiple parties working towards a common objective. They also express business rules that govern the behavior of the process and account for expressing changes reflecting new business objectives and new market situations. In our previous work we developed a service request language and support framework that allow users to formulate their requests against standard business processes. In this paper we extend this approach by presenting a framework capable of automatically associating business rules with relevant processes involved in a user request. This framework plans and monitors the execution of the request against services underlying these processes. Definitions and classifications of business rules (named assertions in the paper) are given together with an assertion language for expressing th. The framework is able to handle the non-determinism typical for service-oriented computing environments and it is based on the interleaving of planning and execution.

O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

service delivery
service and ai computing
quality
management


Efficient reconfiguration algorithms for communication-aware three-dimensional processor arrays Homogeneous processor arrays are emerging in tera-scale computation and effective fault tolerance techniques are essential to improving the reliability of such complex integrated circuits. We study the degradable processor arrays to achieve fault tolerance by employing reconfiguration. Three bypass schemes and three rerouting schemes are proposed to reconfigure three-dimensional processor arrays with defective processors to achieve target arrays without faults. A heuristic algorithm is proposed to construct a target array on the selected rows and columns. It is also proved that the proposed greedy plane rerouting algorithm (GPR) produces maximum target array. In addition, the problem of constructing the communication efficient array is considered in this paper. An algorithm is proposed to refine the communication among processors within the target array constructed by GPR. Experimental study shows that the proposed algorithm GPR produces target arrays with higher harvest and lower degradation on the host arrays with fault density no more than 5%. In addition, the communication performance is significantly optimized by reducing the number of long interconnects, and the average improvement is about 34% for all cases considered in this paper. (C) 2013 Elsevier B.V. All rights reserved.

O B O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O B I O O B O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

reconfiguration
fault tolerance
algorithm

3d processor array
communication aware
interconnection networks


combining group compromised price with bundle search strategies This paper proposes combining the buyer coalition strategy, called Group Compromised Price, with bundle search strategy to obtain the greater discounts from forming a coalition that gives the number of buyers as large as possible.

O O O O O B I O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O

group buying
e-commerce
coalition formation


A systematic review of code generation proposals from state machine specifications Model Driven Development (MDD) encourages the use of models for developing complex software systems. Following a MDD approach, modelling languages are used to diagrammatically model the structure and behaviour of object-oriented software, among which state-based languages (including UML state machines, finite state machines and Harel statecharts) constitute the most widely used to specify the dynamic behaviour of a system. However, generating code from state machine models as part of the final system constitutes one of the most challenging tasks due to its dynamic nature and because many state machine concepts are not supported by the object-oriented programming languages. Therefore, it is not surprising that such code generation has received great attention over the years. The overall objective of this paper is to plot the landscape of published proposals in the field of object oriented code generation from state machine specifications, restricting the search neither to a specific context nor to a particular programming language. We perform a systematic, accurate literature review of published studies focusing on the object oriented implementation of state machine specifications. The systematic review is based on a comprehensive set of 53 resources in all, which we have classified into two groups: pattern-based and not pattern-based. For each proposal, we have analysed both the state machine specification elements they support and the means the authors propose for their implementation. Additionally, the review investigates which proposals take into account desirable features to be considered in software development such as maintenance or reusability. One of the conclusions drawn from the review is that most of the analysed works are based on a software design pattern. Another key finding is that many papers neither support several of the main components of the expressive richness of state machine specifications nor provide an implementation strategy that considers relevant qualitative aspects in software development.

O B I O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I B I I O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

uml state machines
finite state machines
statecharts
code generation
systematic review


a thin client for networked access to a central register and electronic voting terminal Networked terminals for marking the electoral register at poll places has been trialed at a number of sites (most recently [5]) allowing immediate detection of attempted multiple voting even in truly anonymous voting systems. We describe new technology piloted in 2007 in a binding local government election. Our commercial remote voting product eLect [1] was extended to provide new services. Firstly, networked register terminals replaced paper registers. Secondly, the networked register formed the basis of enabling single-vote access for poll-place electronic voting. Finally, poll place electronic voting machines were provided as stateless thin clients who were networked for real-time central aggregation of votes. A central server was charged with the coordination of 400 such voting and register machines at 64 sites. Register terminals also formed the basis of recording the issue of paper votes if the voter so chose, as these were provided to allow voting in the traditional manner. In concert with these systems, votes were also collected via telephone and web-based remote electronic voting services. The pilot has been judged a success by the central government.

O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O

systems pilots
multi-modal voting
multi-channel voting
elections
internet voting
voter rolls
voter registers


optimization of high-performance superscalar architectures for energy efficiency In recent years reducing power has become a critical design goal for high-performance microprocessors. This work attempts to bring the power issue to the earliest phase of high-performance microprocessor development. We propose a methodology for power-optimization at the micro-architectural level. First, major targets for power reduction are identified within superscalar microarchitecture, then an optimization of a superscalar micro-architecture is performed that generates a set of energy-efficient configurations forming a convex hull in the power-performance space. The energy-efficient families are then compared to find configurations that dissipate the lowest power given a performance target, or, conversely, deliver the highest performance given a power budget. Application of the developed methodology to a superscalar micro-architecture shows that at the architectural level there is a potential for reducing power up to 50\%, given a performance requirement, and for up to 15\% performance improvement, given a power budget.

O O O O O O O B O O O O B O O O O B O O O O O O O O O O B O O O O O O O B O O O O B O O O O O O O O O O B B O O O O B O O O O O O B O O O O O O O O O O O B I O O O B O O O O O O O O O O O O O B O O B O O O O O O B O O B B O O O O B O O O B O O O O O O O O O O O O B O O O O O B O O O O O O B O O O B B

efficiency
methodology
microprocessor
space
convex hull
performance
design
reduction
budget
power
microarchitecture

requirements
applications
optimality
developer
architecture
high-performance
configurability
critic
energy efficiency
power optimization


context modeling for ranking and tagging bursty features in text streams Bursty features in text streams are very useful in many text mining applications. Most existing studies detect bursty features based purely on term frequency changes without taking into account the semantic contexts of terms, and as a result the detected bursty features may not always be interesting or easy to interpret. In this paper we propose to model the contexts of bursty features using a language modeling approach. We then propose a novel topic diversity-based metric using the context models to find newsworthy bursty features. We also propose to use the context models to automatically assign meaningful tags to bursty features. Using a large corpus of a stream of news articles, we quantitatively show that the proposed context language models for bursty features can effectively help rank bursty features based on their newsworthiness and to assign meaningful tags to annotate bursty features.

B I O O O O B I O O O B I O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O B I O O O O B I O O O O O O O O O O O B I

bursty feature tagging
bursty features ranking


comparative evaluation of visualization and experimental results using image comparison metrics Comparative evaluation of visualization and experiment results is a critical step in computational steering. In this paper, we present a study of image comparison metrics for quantifying the magnitude of difference between a visualization of a computer simulation and a photographic image captured from an experiment. We examined eleven metrics, including three spatial domain, four spatial-frequency domain and four HVS (human-vision system) metrics. Among these metrics, a spatial-frequency domain metric called 2nd-order Fourier comparison was proposed specifically for this work. Our study consisted of two stages: base cases and field trials. The former is a general study on a controlled comparison space using purposely selected data, and the latter involves imagery results from computational fluid dynamics and a rheological experiment. This study has introduced a methodological framework for analyzing image-level methods used in comparative visualization. For the eleven metrics considered, it has offered a set of informative indicators as to the strengths and weaknesses of each metric. In particular, we have identified three image comparison metrics that are effective in separating "similar" and "different" image groups. Our 2nd-order Fourier comparison metric has compared favorably with others in two of the three tests, and has shown its potential to be used for steering computer simulation quantitatively.

O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

image comparison
comparative visualization

rheology
error metrics
human vision systems
scientific visualization


An empirical study of object-oriented system evolution Software metrics have been used to measure software artifacts staticallymeasurements are taken after the artifacts are created. In this study, three metricsSystem Design Instability (SDI), Class Implementation Instability (CII), and System Implementation Instability (SII)are used for the purpose of measuring object-oriented (OO) software evolution. The metrics are used to track the evolution of an OO system in an empirical study. We found that once an OO project starts, the metrics can give good indications of project progress, e.g. how mature the design and implementation is. This information can be used to adjust the project plan in real time. We also performed a study of design instability that examines how the implementation of a class can affect its design. This study determines that some aspects of OO design are independent of implementation, while other aspects are dependent on implementation.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Analysis of a delayed predator-prey model with ratio-dependent functional response and quadratic harvesting In this paper, we investigate the dynamics of a ratio dependent predator-prey model with quadratic harvesting. We examine the existence of the positive equilibria, the related dynamical behaviors of the model, as well as the boundedness and permanence property of the system. We also study the global stability of the interior equilibrium without time delay. Finally some bifurcation analysis is carried out for the system with delay and the results are illustrated numerically.

O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O


Consumer value of camera-based mobile interaction with the real world Camera-based mobile interaction with the real world allows consumers to connect digital information with the real-world environment, and furthermore, to interact with real-world objects and places. To explore and understand the types of consumer value in the context of such consumer-level applications, we applied the critical incident technique to reflect actual use experiences from 107 application users with a recognized consumer value framework by Holbrook. The findings of the study suggest that at the current state value is heavily based on utilitarian efficiency and excellence. Although the applications enable a diverse value, they have yet to fulfill their potential in providing hedonic and other-oriented value.

B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O B O O O


Integrating exploration, localization, navigation and planning with a common representation Two major themes of our research include the creation of mobile robot systems that are robust and adaptive in rapidly changing environments, and the view of integration as a basic research issue. Where reasonable, we try to use the same representations to allow different components to work more readily together and to allow better and more natural integration of and communication between these components. In this paper, we describe our most recent work in integrating mobile robot exploration, localization, navigation, and planning through the use of a common representation, evidence grids.

O B B B O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O B B B O B O O O O O O O B I

localization
planning
navigation
exploration
evidence grids
integration


Exact value of ex(n;{C3,,Cs}) e x ( n ; { C 3 , , C s } ) for n ? ? 25 ( s ? 1 ) 8 ? For integers s?8 s ? 8 and s + 1 ? n ? ? 25 ( s ? 1 ) 8 ? , we determine the exact value of the function ex(n;{C3,,Cs}) e x ( n ; { C 3 , , C s } ) , that represents the maximum number of edges in a {C3,,Cs} { C 3 , , C s } -free graph of order n n . This result was already known when 3?s?7 3 ? s ? 7 . To do that, for 1?k?5 1 ? k ? 5 , we provide a family of graphs H s k such that e ( H s k ) ? n ( H s k ) = k and with the property that H s k reaches girth s+1 s + 1 with the minimum number of vertices. Also, we determine an infinity family of solutions of the problem ex(n;{C3,,Cs})=n+6 e x ( n ; { C 3 , , C s } ) = n + 6 .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

extremal function
extremal graphs
forbidden cycles


Automated detection of unusual events on stairs This paper presents a method for automatically detecting unusual human events on stairs from video data. The motivation is to provide a tool for biomedical researchers to rapidly find the events of interest within large quantities of video data. Our system identifies potential sequences containing anomalies, and reduces the amount of data that needs to be searched by a human. We compute two sets of features from a video of a person descending a stairwell. The first set of features are the foot positions and velocities. We track both feet using a mixed state particle filter with an appearance model based on histograms of oriented gradients. We compute expected (most likely) foot positions given the state of the filter at each frame. The second set of features are the parameters of the mean optical flow over a foreground region. Our final classification system inputs these two sets of features into a hidden Markov model (HMM) to analyse the spatio-temporal progression of the stair descent. A single HMM is trained on sequences of normal stair use, and a threshold on sequence likelihoods is used to detect unusual events in new data. We demonstrate our system on a data set with five people descending a set of stairs in a laboratory environment. We show how our system can successfully detect nearly all anomalous events, with a low false positive rate. We discuss limitations and suggest improvements to the system.

O O O O O O B O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

hidden markov model
particle filter
stairs

human motion analysis
gait analysis
anomaly detection
event recognition
bayesian tracking
automated video analysis
machine learning
biomedical analysis


Novel framework for registration of pedobarographic image data This article presents a framework to register (or align) plantar pressure images based on a hybrid registration approach, which first establishes an initial registration that is subsequently improved by the optimization of a selected image (dis)similarity measure. The initial registration has two different solutions: one based on image contour matching and the other on image cross-correlation. In the final registration, a multidimensional optimization algorithm is applied to one of the following (dis)similarity measures: the mean squared error (MSE), the mutual information, and the exclusive or (XOR). The framework has been applied to intra- and inter-subject registration. In the former, the framework has proven to be extremely accurate and fast (<70ms on a normal PC notebook), and obtained superior XOR and identical MSE values compared to the best values reported in previous studies. Regarding the inter-subject registration, by using rigid, similarity, affine, projective, and polynomial (up to the fourth degree) transformations, the framework significantly optimized the image (dis)similarity measures. Thus, it is considered to be very accurate, fast, and robust in terms of noise, as well as being extremely versatile, all of which are regarded as essential features for near-real-time applications.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

biomechanics
plantar pressure data
image registration


concepts for usable patterns of groupware applications Patterns, which are based on in-depth practical experience, can be instructing for the design of groupware applications as socio-technical systems. On the basis of a summary of the concept of patterns - as elaborated by the architect Christopher Alexander - its adoptions within computer science are retraced and relationships to the area of groupware are described. General principles for patterns within this domain are formulated and supported by examples from a wide range of experience with knowledge management systems. The analysis reveals that every pattern of a groupware application has to combine the description of social as well as technical structures, and that a single pattern can only be understood in the context of a pattern language. It also shows that such a language has to integrate patterns of socio-technical solutions with measures and procedures for introducing them, and that the language not only has to express one type of directed relationship between the patterns but a variety of different types which have to be deliberately assigned to the patterns.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O B O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

pattern language
socio-technical systems
cscw


A direct-forcing immersed boundary method for the thermal lattice Boltzmann method In this study, a direct-forcing immersed boundary method (IBM) for thermal lattice Boltzmann method (TLBM) is proposed to simulate the non-isothermal flows. The direct-forcing IBM formulas for thermal equations are derived based on two TLBM models: a double-population model with a simplified thermal lattice Boltzmann equation (Model 1) and a hybrid model with an advection-diffusion equation of temperature (Model 2). As an interface scheme, which is required due to a mismatch between boundary and computational grids in the IBM, the sharp interface scheme based on second-order bilinear and linear interpolations (instead of the diffuse interface scheme, which uses discrete delta functions) is adopted to obtain the more accurate results. The proposed methods are validated through convective heat transfer problems with not only stationary but also moving boundaries - the natural convection in a square cavity with an eccentrically located cylinder and a cold particle sedimentation in an infinite channel. In terms of accuracy, the results from the IBM based on both models are comparable and show a good agreement with those from other numerical methods. In contrast. the IBM based on Model 2 is more numerically efficient than the IBM based on Model 1. (C) 2011 Elsevier Ltd. All rights reserved.

O O O O O O O B I I I O O O O O O O O O O B I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

thermal lattice boltzmann method
natural convection

direct-forcing immersed boundary method
double-population model
hybrid thermal model
moving particle


Na/Ca Exchange in Function, Growth, and Demise of ?-Cells Recent knowledge concerning the Na/Ca exchanger (NCX) in the pancreatic ?-cell is reviewed. The ?-cell expresses various NCX1 splice variants in a species-specific pattern (NCX1.3 and 1.7 in the rat; NCX1.2, 1.3, and 1.7 in the mouse) and in variable and different proportions. In the rat ?-cell, the exchanger displays a high capacity, accounts for about 70% of Ca2+ extrusion, and participates in Ca2+ inflow during membrane depolarization. In the mouse, however, the contribution of the exchanger to Ca2+ extrusion is more modest, and to Ca2+ inflow, less evident. The exchanger has a stoichiometry of 3 Na+ for 1 Ca2+, is electrogenic, and displays a reversal potential at ?20 mV. Although being of low magnitude, the current generated by the exchanger shapes glucose-induced ?-cell electrical activity and intracellular Ca2+ oscillations. Intracellular Ca2+ may also trigger apoptosis. For instance, overexpression of the exchanger increases Ca2+-dependent and Ca2+-independent ?-cell death by apoptosis, a phenomenon resulting from the depletion of ER Ca2+ stores with subsequent activation of caspase-12. Na/Ca exchange overexpression also reduces ?-cell growth. Hence, the Na/Ca exchanger is a versatile system that appears to play an important role in the function, growth, and demise of the ?-cell.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

na/ca exchange
pancreatic ?-cell
ca2+ oscillations
caspase-12
endoplasmic reticulum stress


CVBEM for solving De Saint-Venant solid under shear forces Evaluation of shear stresses distribution due to external shear forces applied to De Saint-Venant beams has been solved through Complex Variable Boundary Element Method properly extended, to benefit from advantages of this method, so far widely used for twisted solids. Extending the above method, further simplifications have been introduced such as those of performing line integrals only, instead of domain integrals. Numerical applications confirm accuracy and efficiency of the proposed extended version of the method, since the good agreement with results proposed in literature.

B O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

de saint-venant beam
complex potential function


A Model for Capturing and Managing Software Engineering Knowledge and Experience During software development projects there is always a particular working "product" that is generated but rarely managed: the knowledge and experience that team members acquire. This knowledge and experience, if conveniently managed, can be reused in future software projects and be the basis for process improvement initiatives. In this paper we present a model for managing the knowledge and experience team members acquire during software development projects in a non-disruptive way, by integrating its management into daily project activities. The purpose of the model is to identify and capture this knowledge and experience in order to derive lessons learned and proposals for best practices that enable an organization to preserve them for future use, and support software process improvement activities. The main contribution of the model is that it enables an organization to consider knowledge and experience management activities as an integral part of its software projects, instead of being considered, as it was until now, as a follow-up activity that is (infrequently) carried out after the end of the projects.

O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Determinants of maximal oxygen uptake (VO2 max) in fire fighter testing We evaluate the current daily practice of aerobic capacity testing in Belgian fire fighters. The impact of personal and test-related parameters on the outcome has been evaluated. Test-related parameters have to be taken into account when interpreting VO2 max results. Standardization of aerobic capacity testing is needed in the medical evaluation of fire fighters.

O O B I I O O O O O O O O O O O O O B I O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O B I O B I

aerobic capacity
maximal oxygen uptake
fire fighters
medical evaluation


social presence with video and application sharing We present two experimental studies examining the effects of videoconferencing and application sharing on task performance. We studied performance on a cognitive reasoning task while subjects were observed via two-way video, one-way video and application sharing. Results demonstrate that performance is impaired when subjects are observed via media compared to when they are not observed. Surprisingly, we found no significant difference in awareness of the observer's presence between the application sharing and the two-way video conditions. This is surprising because application sharing lacks visual feedback of the observer. This finding contradicts social presence theory which claims that media which provides visual feedback of others produce the greatest sense of social presence. Our data also show that media use heightens the perception of task difficulty. We extend social presence theory and argue that these social effects need to be considered in the design and deployment of video and application sharing technologies for use in the workplace.

B B O B O B I O O O O O O O O O B O B I O B B O O B O O O B B O O O O O O B O B O B I O B O B O O O O O O O B O O O O O O O O O O O O O O B O O O B O O B I O O O B O O O O O B I O O B O O O O O O B B B O O O B O O O B O O O O O O O B B O B O O O B B O O B O B O O O B B B O O O O B O O O O O O O B O B O B O B I B O B O O O

media
task
video
use
design
performance
presence
theory
social
application sharing
reasoning
technologies
perception
deployment
data
demonstrate
awareness
feedback
videoconferencing

applications
social affordance
sharing
observability
visualization
experimentation
cognition
distance collaboration
social presence
video conferencing
effect


on the logic of argumentation theory The paper applies modal logic to formalize fragments of argumentation theory. Such formalization allows to import, for free, a wealth of new notions (e.g., argument equivalence), new techniques (e.g., calculi, model-checking games, bisimulation games), and results (e.g., completeness of calculi, adequacy of games, complexity of model-checking) from logic to argumentation.

O O O O B I O O O B I O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Combinatorial Resampling Particle Filter: An Effective and Efficient Method for Articulated Object Tracking Particle filter (PF) is a method dedicated to posterior density estimations using weighted samples whose elements are called particles. In particular, this approach can be applied to object tracking in video sequences in complex situations and, in this paper, we focus on articulated object tracking, i.e., objects that can be decomposed as a set of subparts. One of PFs crucial step is a resampling step in which particles are resampled to avoid degeneracy problems. In this paper, we propose to exploit mathematical properties of articulated objects to swap conditionally independent subparts of the particles in order to generate new particle sets. We then introduce a new resampling method called Combinatorial Resampling that resamples over the particle set resulting from all the admissible swappings, the so-called combinatorial set. In essence, combinatorial resampling (CR) is quite similar to the combination of a crossover operator and a usual resampling, but there exists a fundamental difference between CR and the use of crossover operators: we prove that CR is sound, i.e., in a Bayesian framework, it is guaranteed to represent without any bias the posterior densities of the states over time. By construction, the particle sets produced by CR better represent the density to estimate over the whole state space than the original set and, therefore, CR produces higher quality samples. Unfortunately, the combinatorial set is generally of an exponential size and, therefore, to be scalable, we show how it can be implicitly constructed and resampled from, thus resulting in both an efficient and effective resampling scheme. Finally, through experimentations both on challenging synthetic and real video sequences, we also show that our resampling method outperforms all classical resampling methods both in terms of the quality of its results and in terms of computation times.

O B B I O O O O O O B I I B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O B O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O B O O O O B O O O O O O O O O O O O O O O O

particle filter
resampling
articulated object tracking


NationTelescope: Monitoring and visualizing large-scale collective behavior in LBSNs The research of collective behavior has attracted a lot of attention in recent years, which can empower various applications, such as recommendation systems and intelligent transportation systems. However, in traditional social science, it is practically difficult to collect large-scale user behavior data. Fortunately, with the ubiquity of smartphones and Location Based Social Networks (LBSNs), users continuously report their activities online, which massively reflect their collective behavior. In this paper, we propose NationTelescope, a platform that monitors, compares and visualizes large-scale nation-wide user behavior in LBSNs. First, it continuously collects user behavior data from LBSNs. Second, it automatically generates behavior data summary and integrates an interactive map interface for data visualization. Third, in order to compare and visualize the behavioral differences across countries, it detects the discriminative activities according to the related traffic patterns in different countries. By implementing a prototype of NationTelescope platform, we evaluate its effectiveness and usability via two case studies and a system usability scale survey. The results show that the platform can not only efficiently capture, compare and visualize nation-wide collective behavior, but also achieve good usability and user experience.

O O O O O B I O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I I O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O B I O O O O O O O O

collective behavior
location based social networks
system usability scale


The quality of group tacit knowledge ? Organizational knowledge creation theory explains the process of making available and amplifying knowledge created by individuals as well as crystallizing and connecting it to an organizations knowledge system. What individuals get to know in their (working) lives benefits their colleagues and, eventually, the wider organization. In this article, we briefly review central elements in organizational knowledge creation theory and show a research gap related to the quality of tacit knowledge in a group. We advance organizational knowledge creation theory by developing the concept of quality of group tacit knowledge. Based on this concept, we further develop a comprehensive model explaining different levels of tacit knowledge quality that a group can achieve. Finally, we discuss managerial implications resulting from our model and outline imperatives for future theory building and empirical research.

O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O

group tacit knowledge
quality of group tacit knowledge
improvisation
phronesis
collective action


Monolithic z-axis CMOS MEMS accelerometer We propose a monolithic z-axis CMOS MEMS accelerometer with low power consumption. The sensor is integrated with circuits in a wafer-level 0.18-?m CMOS MEMS process. The bending displacements in the microstructures can be controlled well. The use of CMOS-compatible MEMS process can reduce the cost of chip fabrication.

B O B I B O O O B O B I B O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O


Realization of a four parameter family of generalized one-dimensional contact interactions by three nearby delta potentials with renormalized strengths We propose a new method to construct a four parameter family of quantum-mechanical point interactions in one dimension, which is known as all possible self-adjoint extensions of the symmetric operator T = Delta inverted right perpendicularC(0)(infinity)(R\{0}). It is achieved in the small distance limit of equally spaced three neighboring Dirac's delta potentials. The strength for each delta is appropriately renormalized according to the distance and it diverges, in general, in the small distance limit. The validity of our method is ensured by numerical calculations. In general cases except for usual delta, the wave function discontinuity appears around the interaction and one can observe such a tendency even at a finite distance level.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O

one dimension
wave function discontinuity

quantum mechanics
generalized point interaction
functional analysis