DVB-T2 technology improvements challenge current strategic planning of ubiquitous media networks This article presents an analysis of the key technology improvements of the second generation of Digital Video Broadcasting - Terrestrial (DVB-T2) over its first generation (DVB-T) and an estimation method of the new technology influence on the broadcasting business case used in digital terrestrial networks. This article addresses the current challenges in broadcasting wireless network design and strategic planning of ubiquitous media by taking the multidisciplinary approach. The model presented supports decision-making process driven by an optimal investment cost and the techno-economic analysis of digital terrestrial wireless technologies using innovation service diffusion Bass model. The method of estimating the benefits of advanced digital dividend exploits the capacity gained due to DVB-T2 technology novelties. The simulation results for Serbia show that the profitability of broadcast network is achieved in some cases already after 2 years if DVB-T2 standard is used.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

dvb-t/t2
technology improvement
techno-economic efficiency
paytv
bass diffusion model


AUTO-ADAPTIVE INTERVAL SELECTION ALGORITHM FOR QUANTUM KEY DISTRIBUTION Key reconciliation plays an important role in quantum key distribution, as well as shared bit string distillation. To distill efficiently the final key a so-called Winnow protocol has been proposed. However, how to choose the interval length of the shared string to maximize the Winnow efficiency is difficult in practical program processing. Because the interval choice remains an open problem the key rate of the Winnow protocol is not as high as the one calculated in theory. Consequently, the Winnow protocol is difficult to efficiently employ in application. In this paper we first analytically investigate the dependence of the interval length on the error distribution and the code. Then ail auto-adaptive interval selection algorithm is proposed. In addition, new characteristics of the protocol are investigated.

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 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 B I 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


A Secure and Efficient Authentication Protocol in Wireless Sensor Network With increasing popularity of wireless sensor networks (WSN), the security issues related to such networks have become crucial. Most of the networks use shared key among all the nodes to make communicational overhead minimal. But it is vulnerable to many attacks like replay attack, node-compromise attack, impersonation attack etc. Further many traditional security mechanisms cannot be suitably implemented in WSN as resources are constrained in terms of power, energy and speed. In this paper, we propose a mutual authentication protocol based on timestamp in WSN which generates a new session key for each session. The proposed authentication approach requires light computational and communicational load and resist the major vulnerable attacks in WSN.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 O O O O O O O O O O O O O O O O O O O

wireless sensor networks (wsn)
elliptic curve diffiehellman (ecdh)


Coding Complexity Prediction for H.264/AVC Rate Control Coding complexity is a crucial parameter in rate control scheme. Traditional measures for coding complexity are based on statistic and estimation. This way may cause the imprecise coding complexity and finally bring inaccurate output bit rate more or less. To resolve this problem, we propose a hypothetical virtual coding complexity to imitate the real coding complexity. Based on the proposed coding complexity measure, a novel rate control algorithm is proposed either. Experimental results and analysis show that the proposed mearsure for coding complexity is effective, and our scheme outperforms the JVT-W042 solution by providing more accurate QP prediction, reducing frame skipping, and improving visual quality.

B I O O O B I B I O O O O O B I O O O O B I 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 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 B I O O O O O O O O O O O O O O O O O O O O O O


Cell decomposition and definable functions for weak p-adic structures We develop a notion of cell decomposition suitable for studying weak p-adic structures (reducts of p-adic fields where addition and multiplication are not (everywhere) definable). As an example, we consider a structure with restricted addition.

B I 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


Hepatitis B Virus Nucleic Acids Circulating in the Blood Circulating nucleic acids in serum and plasma are common in a variety of disease conditions. Here, we focus (i) on our approach for the detection of various hepatitis B virus (HBV)-related nucleic acids in liver tissue and in serum, (ii) on the progression of the chronic HBV infection, (iii) on the relation of HBV-specific nucleic acids circulating in the blood of patients with hepatocellular carcinoma, and in general (iv) on the diagnostic potential of circulating HBV nucleic acids.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

hepatitis b virus transcripts
chronic infection stages
serum rna


Improving XML schema matching performance using Prufer sequences Schema matching is a critical step for discovering semantic correspondences among elements in many data-shared applications. Most of existing schema matching algorithms produce scores between schema elements resulting in discovering only simple matches. Such results partially solve the problem. Identifying and discovering complex matches is considered one of the biggest obstacle towards completely solving the schema matching problem. Another obstacle is the scalability of matching algorithms on large number and large-scale schemas. To tackle these challenges, in this paper, we propose a new XML schema matching framework based on the use of Prufer encoding. in particular, we develop and implement the XPruM system, which consists mainly of two parts-schema preparation and schema matching. First, we parse XML schemas and represent them internally as schema trees. Prufer sequences are constructed for each schema tree and employed to construct a sequence representation of schemas. We capture schema tree semantic information in Label Prufer Sequences (LPS) and schema tree structural information in Number Prufer Sequences (NPS). Then, we develop a new structural matching algorithm exploiting both LPS and NPS. To cope with complex matching discovery, we introduce the concept of compatible nodes to identify semantic correspondences across complex elements first, then the matching process is refined to identify correspondences among simple elements inside each pair of compatible nodes. Our experimental results demonstrate the performance benefits of the XPruM system. (C) 2009 Elsevier B.V. All rights reserved.

O B I 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 O O O O O O O O O O O O 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 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 B I 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

xml schema matching
prufer sequences
structural matching


video summarization at brno university of technology This paper describes the video summarization system built for the TRECVID 2007 evaluation by the Brno team. Motivations for the system design and its overall structure are described followed by more detailed description of the critical parts of the system, which are feature extraction and clustering of frames (shots, sub-shots) in time domain. Many ideas were not included in the system because of the time constraints. Those considered promising are stated and are briefly described as possible future work. The result of video summarization presented in this paper is promising and will benefit further investigation. This is specifically true as not all the features that can be considered and processing methods were implemented in the evaluated system.

B B 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 O O O O O O O O O O O O O O O O O O O O O O O O O O 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 O O O O O O O

image features
trecvid evaluation
time compression


An expert system for predicting the deep drawing behavior of tailor welded blanks The forming behavior of tailor welded blanks (TWB) is influenced by thickness ratio, strength ratio, and weld conditions in a synergistic fashion. In most of the cases, these parameters deteriorate the forming behavior of TWB. It is necessary to predict suitable TWB conditions for achieving better-stamped product made of welded blanks. This is practically difficult and resource intensive, requiring lot of simulations or experiments to be performed under varied base material and weld conditions. Automotive sheet part designers will be greatly benefited if an expert system is available that can deliver forming behavior of TWB for varied weld and blank conditions. This work primarily aims at developing an expert system using artificial neural network (ANN) model to predict the deep drawing behavior of welded blanks made of steel grade and aluminium alloy base materials. The important deep drawing characteristics of TWB are predicted within chosen range of varied blank and weld conditions. Through out the work, PAM STAMP 2G finite element (FE) code is used to simulate the forming behavior and to generate output data required for training the ANN. Predicted results from ANN model are compared and validated with FE simulation for two different intermediate TWB conditions. It is observed that the results obtained from ANN based expert system are encouraging with acceptable prediction errors.

O B I O O O B I O O B I I 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 B I 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 B I I O O 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 O O O O O O O O O O O O O O O O O O O O O O O O O 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

tailor welded blanks
deep drawing
expert system
artificial neural network


Optimal reactive power dispatch by particle swarm optimization with an aging leader and challengers ORPD is a non-linear constrained optimization problem. ALC-PSO algorithm is applied for the solution ORPD problem of power systems. ORPD problem is formulated for real power loss and voltage deviation minimization. The study is implemented on IEEE 30-, 57- and 118-bus test power systems. The results presented demonstrate the potential of the proposed approach.

O B I I O B I I O O B 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 O

aging
leader
particle swarm optimization
reactive power dispatch
optimization


HU-FCF: A hybrid user-based fuzzy collaborative filtering method in Recommender Systems We proposed a systematic mathematical definition of Fuzzy Recommender Systems. Some algebraic operations accompanied with their properties were described. We proposed a novel hybrid user-based fuzzy collaborative filtering method. This algorithm obtained better accuracy than the relevant fuzzy filtering methods. An application for the football results prediction was illustrated.

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 B I I O O

football results prediction
fuzzy recommender systems

fuzzy similarity degrees
hard user-based degrees
hybrid fuzzy collaborative filtering


Representing images of a rotating object with cyclic permutation for view-based pose estimation ? In this paper, we propose a novel approach using a cyclic group to model the appearance change in an image sequence of an object rotated about an arbitrary axis (1DOF out-of-plane rotation). In the sequence, an image xj x j is followed by an image xj+1 x j + 1 . We represent the relationship between images by a cyclic group as xj+1=Gxj x j + 1 = G x j , and obtain the matrix G by real block diagonalization. Then, G to the power of a real number is used to represent the image sequence and also for pose estimation. Two estimation methods are proposed and evaluated with real image sequences from the COIL-20, COIL-100, and ALOI datasets, and also compared to the Parametric Eigenspace method. Additionally, we discuss the relationship of the proposed approach to the pixel-wise Discrete Fourier Transform (DFT) and to linear regression, and also outline several extensions.

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 B I 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

view-based pose estimation
global appearance
column permutation matrix
subspace methods


Multi-user data multiplexing for digital multimedia broadcasting Recently, a Korean standard service, as the designated digital multimedia broadcasting (DMB) system, has been in commercial service following a period of time of careful reflection. Now, the next generation of digital broadcast services will not be limited to digital audio but also extended to a variety of multimedia data services as well as mobile application services. However, the current approaches for transporting multimedia content over wireless networks for the DMB require significant overhead. In this paper, we propose a new approach for multi-user data multiplexing with several access points serving a number of wireless terminals for the DMB. By modifying the multiplexer header, multiplexing time, and handling of time-critical data, the duplication overhead can be considerably decreased when compared to existing schemes. (c) 2006 Elsevier B.V. All rights reserved.

O B I O B I 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 O O O O O O O O O O O O O O O O O O O O O O O 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

digital multimedia broadcasting
data multiplexing

multimedia layer
multi-user
wireless application system


Nonparametric Discriminant Analysis for Face Recognition In this paper, we develop a new framework for face recognition based on nonparametric discriminant analysis (NDA) and multiclassifier integration. Traditional LDA-based methods suffer a fundamental limitation originating from the parametric nature of scatter matrices, which are based on the Gaussian distribution assumption. The performance of these methods notably degrades when the actual distribution is non-Gaussian. To address this problem, we propose a new formulation of scatter matrices to extend the two-class NDA to multiclass cases. Then, in order to exploit the discriminant information in both the principal space and the null space of the intraclass scatter matrix, we develop two improved multiclass NDA-based algorithms (NSA and NFA) with each one having two complementary methods that are based on the principal space and the null space of the intraclass scatter matrix, respectively. Comparing to the NSA, the NFA is more effective in the utilization of the classification boundary information. In order to exploit the complementary nature of the two kinds of NFA (PNFA and NNFA), we finally develop a dual NFA-based multiclassifier fusion framework by employing the overcomplete Gabor representation for face images to boost the recognition performance. We show the improvements of the developed new algorithms over the traditional subspace methods through comparative experiments on two challenging face databases, the Purdue AR database and the XM2VTS database.

O O O O 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

nonparametric discriminant analysis (nda)


Semantics of plan revision in intelligent agents In this paper, we give an operational and denotational semantics for a meta-language of the 3APL agent programming language. With this meta-language, various 3APL interpreters can be programmed. We prove equivalence of the operational and denotational semantics. Furthermore, we give an operational semantics for object-level 3APL. Using this semantics, we relate the 3APL meta-language to object-level 3APL by providing a specific interpreter, the semantics of which will prove to be equivalent to object-level 3APL. (c) 2005 Elsevier B.V. All rights reserved.

O O O O O O O O O O O O O O O B I 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

agent programming language
denotational semantics


A constraint satisfaction neural network and heuristic combined approach for concurrent activities scheduling Scheduling activities in concurrent product development process is of great significance to shorten development lead time and minimize the cost. Moreover, it can eliminate the unnecessary redesign periods and guarantee that serial activities can be executed as concurrently as possible. This paper presents a constraint satisfaction neural network and heuristic combined approach for concurrent activities scheduling. In the combined approach, the neural network is used to obtain a feasible starting time of all the activities based on sequence constraints, the heuristic algorithm is used to obtain a feasible solution of the scheduling problem based on resource constraints. The feasible scheduling solution is obtained by a gradient optimization function. Simulations have shown that the proposed combined approach is efficient and feasible with respect to concurrent activities scheduling.

O O O O O O B 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 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 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

product development process
scheduling problem
heuristic

concurrent engineering
constraints satisfaction neural network


Extracting performance rules of suppliers in the manufacturing industry: an empirical study Performance evaluation of suppliers is increasingly recognized as a critical indicator in supply chain cooperation. Traditional performance evaluation methods have the problems of a simple buy/sell relation and in one's subjective views between manufacturers and suppliers, and they lack objective automatic evaluation processes in the supply chain considered. Statistical techniques used for evaluation rely on the restrictive assumptions of linear separability, multivariate normality, and independence of the predictive variables. Unfortunately, many of the common models of performance evaluation of suppliers violate these assumptions. The study proposes an integrated model by combining K-means clustering, feature selection, and the decision tree method into a single evaluation model to assess the performance of suppliers and simultaneously tackles the above-mentioned shortcomings. The integrated model is illustrated with an empirical case study of a manufacturer for an original design manufacturer (ODM) to demonstrate the model performance. The experimental results indicate that the proposed method outperforms listed methods in terms of accuracy, and three redundant attributes can be eliminated from the empirical case. Furthermore, the extracted rules by the decision tree C4.5 algorithm form an automatic knowledge system for supplier performance evaluation.

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 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 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 B I

performance evaluation
manufacturing industry

scm (supply chain management)
kpi (key performance indicators)
data mining techniques


towards a vmm-based usage control framework for os kernel integrity protection Protecting kernel integrity is one of the fundamental security objectives in building a trustworthy operating system (OS). For this end, a variety of approaches and systems have been proposed and developed. However, access control models used in most of these systems are not expressive enough to capture important security requirements such as continuous policy enforcement and mutable process and object attributes. Even worse, most existing protection mechanisms in these systems reside in the same space as the running OS, which unfortunately can be disabled or subverted after an attacker successfully exploits kernel-level vulnerabilities (or features) to compromise the OS kernel. The increasing number of kernel-level root kit attacks clearly demonstrates this threat. In this paper we present a simple but effective usage control model UCON KI with unique properties of decision continuity and attribute mutability for OS kernel integrity protection. Further, to enforce UCON KI security policies, we propose a virtual machine monitor (VMM) based architecture that is isolated and protected from other untrusted processes inside a virtual machine (VM). We have implemented a proof-of-concept prototype in Linux to demonstrate the feasibility of our approach. Our experiments with 18 real-world kernel rootkits show that our approach is able to successfully detect and prevent all kernel integrity violations from them. Beyond kernel integrity protection, we also explore additional opportunities for general OS security, such as the confinement of process activities as well as the protection of system utility programs at the VMM level.

O O O B I 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 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 B I O B O O O O O O O O O O O O B I 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 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 B O

kernel integrity
ucon
usage control
access control
vmm

operating system protection
authorization
security architecture


Computer-based rating method for evaluating multiple visual stimuli on multiple scales In this research, two joint evaluation rating methods (focus-on-attribute and drag-and-drop) and a separate evaluation rating method (focus-on-stimulus) are proposed for rating multiple visual stimuli with respect to multiple scales. All three interactive methods incorporate a real-time adjusting mechanism, allowing respondents to interactively adjust their ratings. Using the traditional paper-and-pencil method as the basis for comparison, the performance of these computer-based rating methods and the proposed real-time adjusting mechanism were investigated. First, it was found that the computer-based methods not only produced results equivalent to those produced by the paper-and-pencil method, but also improved the data quality by preventing the occurrence of missing values and allowing respondents to adjust their scores. Second, the two joint evaluation methods performed better than the separate evaluation method in terms of usage experience, testretest reliability, and the likelihood of simulating the daily shopping experience, in which multiple consumer products are often compared simultaneously. Of the two joint evaluation methods, the drag-and-drop method received better subjective evaluations than the focus-on-attribute method. Third, the proposed real-time adjusting mechanism was found to obtain better subjective satisfaction in rating. In summary, for measuring multiple visual stimuli with multiple scales, the computer-based joint evaluation rating methods using a real-time adjusting mechanism were found to be better choices among the measurement tools investigated.

O O O O O O O O O O O O O O O B I 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 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 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


A linear spine calculus We present the spine calculus S-->-oinverted perpendicular as an efficient representation for the linear lambda-calculus lambda(-->-oinverted perpendicular) which includes unrestricted functions (-->) linear functions (-o) additive pairing (&) and additive unit (inverted perpendicular). S-->&& enhances the representation of Church's simply typed lambda-calculus by enforcing extensionality and by incorporating linear constructs. This approach permits procedures such as unification to retain the efficient head access that characterizes first-order term languages without the overhead of performing eta-conversions at run time. Applications lie in proof search, logic programming, and logical frameworks based on linear type theories. It is also related to foundational work on term assignment calculi for presentations of the sequent calculus. We define the spine calculus, give translations of lambda(-->-oinverted perpendicular) into S-->-oinverted perpendicular and vice versa, prove their soundness and completeness with respect to typing and reductions, and show that the typable fragment of the spine calculus is strongly normalizing and admits unique canonical, i.e. betaeta-normal, forms.

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

linear lambda calculus
term assignment systems
uniform provability


knowledge nebula crystallizer for time-based information In this paper, we are going to describe a system for managing and authoring time-based information artefact, as an implementation of Knowledge Nebula Crystallizer [9]. The design rationale of the system and its implementation are described.

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 B I I O O O O O O O O O O O O

creativity support
knowledge creation
time-based information


Calculation of optimal induction heater capacitance based on the smart bacterial foraging algorithm Investigation of the capacitance effects over induction heater performance. A new model for optimal design of the IH capacitance using SBFA. Presentation of a formulation based the restrictions for designing the capacitance. A Pareto-Efficient situation was defined for efficiency and output power. The proposed model outperforms the previous ones in the IH optimization problem.

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

inductance heater
equivalent series resistance
optimum capacitance
pareto efficient


Virtual multi-fracture craniofacial reconstruction using computer vision and graph matching The problem of computer vision-guided reconstruction of a fractured human mandible from a computed tomography (CT) image sequence exhibiting multiple broken fragments is addressed. The problem resembles 3D jigsaw puzzle assembly and hence is of general interest for a variety of applications dealing with automated reconstruction or assembly. The specific problem of automated multi-fracture craniofacial reconstruction is particularly challenging since the identification of opposable fracture surfaces followed by their pairwise registration needs to be performed expeditiously in order to minimize the operative trauma to the patient and also limit the operating costs. A polynomial time solution using graph matching is proposed. In the first phase of the proposed solution, the opposable fracture surfaces are identified using the Maximum Weight Graph Matching algorithm. The pairs of opposable fracture surfaces, identified in the first stage, are registered in the second phase using the Iterative Closest Point (ICP) algorithm. Correspondence for a given pair of fracture surfaces, needed for the Closest Set computation in the ICP algorithm, is established using the Maximum Cardinality Minimum Weight bipartite graph matching algorithm. The correctness of the reconstruction is constantly monitored by using constraints derived from a volumetric matching procedure guided by the computation of the Tanimoto Coefficient.

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

machine vision
biomedical image processing
image registration
pattern matching


Design and development of a low-cost digital display for water flow rate measurements A basic requirement in the measurement of flow rate using a target fluidic flowmeter is the use of Fourier Transform to determine the flow oscillation frequencies and from thence the flow rate. In such a flowmeter, the inlet fluid jet impinges upon a rectangular target, thereby setting up flow oscillations about the target. The oscillation frequency is directly proportional to the flow rate. A digital flow-rate display has been designed and developed to convert the signal from a fibrefilm probe of a constant temperature anemometer into direct reading of flow rate. This low-cost device is able to perform as good as a commercial dynamic signal analyzer, with the additional feature of a direct read-out of flow rate.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 B I I O O O O O O O O O O O


impact and compensation of correlated process variation on ring oscillator based puf A Physical Unclonable Function in silicon is a die-unique challenge-response function that exploits circuit variations. A PUF has the potential to become an important security solution due to its ability to generate volatile secret keys. Before a PUF can be integrated into a system, its critical quality factors, including uniqueness, reliability and resiliency to different types of attacks, must be ensured. The uniqueness of a PUF is determined by the random inter-die process variations. However, manufacturing process variations have another component, called correlated intra-die variations. This component becomes significant in deep-submicron device technology below 90nm. In this paper, we show that the quality of a ring oscillator (RO) based PUF is affected by correlated intra-die process variation. We present experiments on 90nm FPGA devices and analyze the experimental data to quantify the effect and also propose a method to improve the quality of an RO-PUF by minimizing the effect of correlated intra-die variations.

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 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

ring oscillator (ro)
physical unclonable function (puf)


learning problem solving with spreadsheet and database tools Teaching skills for problem solving is usually accomplished on the basis of good examples of problems and corresponding sound solutions. By studying well-constructed examples the student learns how to analyze and decompose non-elementary problems and learns how to provide well-organized solutions.The tools we demonstrate support the teacher in presenting problems in an effective way and help the student in solving them. The teacher chooses a problem and provides a solution within Access or Excel, usually reducing the original problem to a collection of simpler, logically related sub-problems. The system thoroughly analyzes the teacher's solution and provides feedback about its structure as well as many automatically generated solution hints for the student. The teacher may add his own suggestions and establishes the form and content of the problem's presentation. Essentially, the teacher can specify which aspects of his own solution should be visible to the student. In this way, the difficulties for the student to solve the task can be largely controlled.The problem is proposed as a (possibly incomplete) set of sub-problems whose mutual relations may be left partially unspecified. In the same vein, some of the suggestions may be hidden in the initial problem presentation. The student can ask for hints during his solution attempts, and receives them at the price of penalties in the final evaluation. The results that the teacher's solution produces for the different sub-problems are supplied to the student (just the results, not the solutions). This provides three main benefits. The first one is motivational: the teacher's result is a clearly visible goal to reproduce and, by simple comparison, provides immediate feedback about the correctness of the student's solution attempts. The second benefit stems from the fact that the student is allowed to face the collection of sub-problems in a more flexible way. In fact, he can exploit the teacher's results to solve a particular sub-problem, independently from the sub-problems that he has (or has not) already solved. Finally, since the teacher's hidden solutions provide results that are assumed to be reliable, if the student uses them instead of his own results, error propagation is totally prevented.The system uses the teacher's results to automatically check the correctness of the student's results by comparison, and by considering different data samples the system infers the correctness of the student's solution. Moreover, since correctness is established by comparing results, the system will accept any solution that produces the same results as those arising from the teacher's solution, regardless of how the former are obtained. Experimentation with the system at the Italian Naval Academy has given good evidence that non-elementary problems can be proposed in a working context where students are stimulated to elaborate personal comprehension and to develop original solution techniques.The engineering of the system has been funded by the AICA-CRUI project "IT4PS - Information Technology for Problem Solving".

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


Nonmonotone, nonlinear evolution inclusions In this paper, we consider nonlinear evolution problems, defined on an evolution triple of spaces, driven by a nonmonotone operator, and with a perturbation term which is multivalued. We prove existence theorems for the cases of a convex and of a nonconvex valued perturbation term which is defined on all of T x H or only on T x X with values in H or even in X* there X subset of or equal to H subset of or equal to X* is the evolution triple). Also, we prove the existence of extremal solutions, and for the "monotone" problem we have a strong relaxation theorem. Some examples of nonlinear parabolic problems are presented. (C) 2000 Elsevier Science Ltd. All rights reserved.

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 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

pseudomonotone operator
l-pseudomonotoncity
l-generalized pseudomonotonicity
operator of type (s)(+)
surjective operator
coercive operator
compact embedding
extremal solution
continuous selection
parabolic problem


exploiting non-volatile ram to enhance flash file system performance Non-volatile RAM (NVRAM) such as PRAM (Phase-change RAM), FeRAM (Ferroelectric RAM), and MRAM (Magnetoresistive RAM) has characteristics of both non-volatile storage and random access memory (RAM). These forms of NVRAM are currently being developed by major semiconductor companies and are expected to be an everyday component in the near future. The advent of NVRAM may possibly bring about drastic changes to the system software landscape. In this work, we develop a new Flash memory based file system that exploits NVRAM in order to improve system performance. Specifically, we discuss the initial design and implementation of a file system that stores all metadata in NVRAM, while storing all file data in Flash memory. In so doing, we make two contributions in this work. First, we present a model that analyzes the amount of NVRAM that is needed for specific Flash memory storage capacity. Experimentally, we verify that this model represents the exact NVRAM usage in the realistic environment. Second, we present quantitative experimental results that show how much performance gains are possible by exploiting NVRAM. Compared to YAFFS, a popular Flash memory based file system, we show that this file system requires only minimal time for mounting and that the execution time improves by a maximum of 600\% and an average of 437\% for the realistic workloads that we considered.

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 B I 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 B 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 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 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

non-volatile ram
experimental evaluation


Solving multiobjective optimal reactive power dispatch using modified NSGA-II This paper addresses an application of modified NSGA-II (MNSGA-II) by incorporating controlled elitism and dynamic crowding distance (DCD) strategies in NSGA-II to multiobjective optimal reactive power dispatch (ORPD) problem by minimizing real power loss and maximizing the system voltage stability. To validate the Pareto-front obtained using MNSGA-II, reference Pareto-front is generated using multiple runs of single objective optimization with weighted sum of objectives. For simulation purposes, IEEE 30 and IEEE 118 bus test systems are considered. The performance of MNSGA-II, NSGA-II and multiobjective particle swarm optimization (MOPSO) approaches are compared with respect to multiobjective performance measures. TOPSIS technique is applied on obtained non-dominated solutions to determine best compromise solution (BCS). KarushKuhnTucker (KKT) conditions are also applied on the obtained non-dominated solutions to substantiate a claim on optimality. Simulation results are quite promising and the MNSGA-II performs better than NSGA-II in maintaining diversity and authenticates its potential to solve multiobjective ORPD effectively.

O O O O O O O O O O O O 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 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 B O

covariance matrix adopted evolutionary strategy (cmaes)


Large scale multi-class classification with truncated nuclear norm regularization In this paper, we consider the problem of multi-class image classification when the classes behaviour has a low rank structure. That is, classes can be embedded into a low dimensional space. Traditional multi-class classification algorithms usually use nuclear norm to approximate the rank of the weight matrix. Considering the limited ability of the nuclear norm for the accurate approximation, we propose a new scalable large scale multi-class classification algorithm by using the recently proposed truncated nuclear norm as a better surrogate of the rank operator of matrices along with multinomial logisitic loss. To solve the non-convex and non-smooth optimization problem, we further develop an efficient iterative procedure. In each iteration, by lifting the non-smooth convex subproblem into an infinite dimensional ?1 norm regularized problem, a simple and efficient accelerated coordinate descent algorithm is applied to find the optimal solution. We conduct a series of evaluations on several public large scale image datasets, where the experimental results show the encouraging improvement of classification accuracy of the proposed algorithm in comparison with the state-of-the-art multi-class classification algorithms.

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 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 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

truncated nuclear norm
coordinate descent algorithm


Towards a new era for Cultural Heritage Education: Discussing the role of ICT Living and being part of todays Knowledge Society implies recognizing the importance of the past and imposes considering Cultural Heritage as a fundamental background of our identity. This paper investigates how ICT tools can contribute to enhancing Cultural Heritage Education. It is an attempt to answer the question concerning whether ICT can really provide any added value to Cultural Heritage pedagogy, education and learning. By focusing on those Cultural Heritage artifacts that pertain to the field of arts and archeology, the paper assumes a methodological perspective and provides examples of some of the most innovative experiences in the field, thus driving the reader to reflect on the pedagogical impact that may derive from exploiting ICT potentialities. ICT, in fact, on the one hand, offers an easier access and a multi-perspective view of Cultural Heritage artifacts, and, on the other, may also enrich and improve Cultural Heritage Education thanks to the adoption of innovative learning/teaching methods.

O O O O O B I I 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 B I I 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 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 B I I O O O O O O O O


DASA: Dissatisfaction-oriented Advertising based on Sentiment Analysis Online advertising has become one of the major revenue sources of today's Internet ecosystem. The main advertising channels used to distribute textual ads are sponsored search and contextual advertising. Here we consider the problem of contextual advertising, i.e. associating ads with a Web page. Most of previous work only focuses on topical relevance of ads whereas the consumer attitudes are ignored. In this paper, we propose a novel advertising strategy, called Dissatisfaction-oriented Advertising based on Sentiment Analysis (DASA), to simultaneously improve ad relevance and user experience. Specifically, by using syntactic parsing and sentiment dictionary, we propose a rule based approach to extract topic words of opinion sentences associated with negative sentiment, which are regarded as the advertising keywords. We also design a prototype system for product information submission for the sake of ad selection. We take into account the consumer attitudes and promote the competitors of those products with which the consumers are not satisfied. The experimental results on advertising keyword extraction and ad selection have demonstrated the effectiveness of the proposed approach. (C) 2010 Elsevier Ltd. All rights reserved.

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 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 B I 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 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 I O B I O O O O O O O O O O O O O O O

contextual advertising
advertising keyword extraction
ad selection
sentiment analysis
syntactic parsing


On the discrete version of Picone's identity For a real number p with 1<p 1 < p we consider the first eigenvalues of the p-Laplacian on graphs, and estimates for the solutions of p-Laplace equations on graphs. We provide a discrete version of Picone's identity and its application. More precisely, we prove a Barta-type inequality for graphs with boundary. Finally, we provide a discrete version of the anti-maximum principle.

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


Impact of frequency increment errors on frequency diverse array MIMO in adaptive beamforming and target localization The Data model for FDA MIMO radar is derived with frequency increment error. We analysis the FDA MIMO radar mainlobe offset. We investigate SINR degradation caused by frequency increment errors. The subspace-based localization performance of the FDA MIMO radar is analyzed. We derive expressions of FDA RMSEs based on the subspace processing algorithms.

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 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

frequency diverse array (fda) mimo radar


Exploring the effect of strategic positioning on firm performance in the e-business context This study investigates what strategic positions exist in the e-business context and how strategic positioning affects firm performance. The current study draws on the concept of fit between environmental factors and organizational factors. We collected survey data from both pure online and click-and-mortar companies and tested the model using 133 firm reports. Cluster analysis was performed to analyze survey data and to find groups of companies that pursue similar strategic positioning. The findings of the current study lend support to the hypothesis of distinctive grouping based on environmental factors and resources. The findings also support the hypothesis that strategic positioning influences firm performance. The major implication of this study is that innovative differentiation strategies together with technological resources strongly affect firm performance in the e-business context, a context where there is considerable turbulence in technological development.

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 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 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


Image-Guided Weathering: A New Approach Applied to Flow Phenomena The simulation of weathered appearance is essential in the realistic modeling of urban environments. A representative and particularly difficult effect to produce on a large scale is the effect of fluid flow. Changes in appearance due to flow are the result of both the global effect of large-scale shape, and local effects, such as the detailed roughness of a surface. With digital photography and Internet image collections, visual examples of flow effects are readily available. These images, however, mix the appearance of flows with the specific local context. We present a methodology to extract parameters and detail maps from existing imagery in a form that allows new target-specific flow effects to be produced, with natural variations in the effects as they are applied in different locations in a new scene. In this article, we focus on producing a library of parameters and detail maps for generating flow patterns; and this methodology can be used to extend the library with additional image exemplars. To illustrate our methodology, we show a rich collection of patterns applied to urban models.

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

algorithms
design
appearance modeling
rendering


an effort and time based measure of usability The hypothesis of this research is that usability relates to the physical effort that is required in order to use software in the accomplishment of interactive tasks. Implications of this hypothesis are significant since effort is an objective quantity that can be measured efficiently in a relatively non-expensive and non-invasive fashion. Based on this hypothesis, this work proposes metrics for measuring operability, learnability, and understandability. Usability testing is an essential element of a robust validation process. Nevertheless, evaluating software usability is an expensive and time consuming activity, frustrating both developers and managers. Developers are frustrated because it is a critical part of their work; yet, they do not have solid information on how to address it. Managerial frustration lies in the fact that correcting usability defects is an iterative process, and the amount of preparation required can significantly delay a project. Hence, wider utilization of usability testing requires reducing the cost and simplifying the approach. This paper proposes a framework for measuring effort and using the effort measurements to assess usability. The framework has two main components: One bases effort on keystrokes and mouse usage; the second uses a model of the eye muscles along with eye-movement tracking to estimate eye effort. The two components are independent, but they could be used in tandem. Tracking time and effort may not be as precise an evaluation of usability. Nevertheless, it can provide a good screening tool to reduce development cost.

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 O O O B O O B O O B B 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 O O O O 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 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 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

understandability operability usability validation metrics


HYBRID MODEL FOR DISPLACEMENT PREDICTION OF TUNNEL SURROUNDING ROCK This paper presents a hybrid method to predict tunnel surrounding rock displacement, which is one of the most important factors for quality control and safety during tunnel construction. The hybrid method comprises two phases, one is support vector machine (SVM)-based model for predicting the tunnel surrounding rock displacement, and the other is GA-based model for optimizing the parameters in the SVM. The proposed model is evaluated with the data of tunnel surrounding rock displacement on the tunnel of Wuhan-Guangzhou railway in China. The results show that genetic algorithm (GA) has a good convergence and relative stable performance. The comparison results also show that the hybrid method can generally provide a better performance than artificial neural network (ANN) and finite element method (FEM) for tunnel surrounding rock displacement prediction.

O O O O B O B O O O O O O O O O O B B I I 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 B I I O O O O O O O O O O O O B O O O O O O O O O B B I I O O B 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 B B I I B

prediction
tunnel
surrounding rock displacement
svm
ga


Traffic shaper: required system for an ATM microprocessor adapter Crucial task in merging of computer and communication technology is the microprocessornetwork interface. Microprocessor Adapter (MA) is used to adapt the traffic to/from the ATM Network in terminals or in Interworking units and switches. Upstream direction should be controlled by a traffic shaper. This paper introduces a traffic shaping method and its circuit design and implementation. The circuit regulates the traffic injected into the ATM network, by enforcing specific traffic parameter values that have been agreed upon between the user and the network. It supports better bandwidth utilisation through an Effective Rate control algorithm, adaptive to traffic characteristics.

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 B I O O O O O O

effective rate
atm microprocessor adapter

atm traffic shaping mechanism
preventive flow control


A Monte Carlo comparison of some variance estimators of the Horvitz-Thompson estimator At the design and estimation stage of a survey, large survey organization often uses auxiliary information. This article discusses various procedures for improving variance estimation of the Horvitz-Thompson estimator of a finite population total with the aid of auxiliary information. To study the design-based properties of the proposed variance estimators relative to the standard one, a small scale Monte Carlo study is performed.

O O 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 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

auxiliary information
variance estimation

calibration
design-based
horvitz-thompson estimator
model-based


A maximum likelihood expectation maximization algorithm with thresholding The maximum likelihood expectation maximization (MLEM) algorithm has several advantages over the conventional filtered back-projection (FBP) for image reconstruction. However, the slow convergence and the high computational cost for its practical implementation have limited its clinical applications. This study proposes the incorporation of a thresholding technique in both the MLEM and ordered subsets EM (OSEM) algorithm to accelerate convergence. The threshold is set to c*m, where m is the mean pixel value of the whole image. The reconstruction time is proportional to the total number of pixels, so a thresholding technique that nullifies the value of a pixel if it falls below a threshold, can effectively remove the non-active pixels and substantially accelerate reconstruction. Preliminary tests on simulated PET data reveal that the thresholding technique accelerates the convergence rate and reduce error in the reconstructed image. The reconstruction performance improves with the increase of the threshold level and the MSE reaches minimum for c value equals to about 1.

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 B 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

thresholding method
iterative reconstruction


An experimental investigation of personality types impact on pair effectiveness in pair programming In this paper, pair programming is empirically investigated from the perspective of developer personalities and temperaments and how they affect pair effectiveness. A controlled experiment was conducted to investigate the impact of developer personalities and temperaments on communication, pair performance and pair viability-collaboration. The experiment involved 70 undergraduate students and the objective was to compare pairs of heterogeneous developer personalities and temperaments with pairs of homogeneous personalities and temperaments, in terms of pair effectiveness. Pair effectiveness is expressed in terms of pair performance, measured by communication, velocity, design correctness and passed acceptance tests, and pair collaboration-viability measured by developers satisfaction, knowledge acquisition and participation. The results have shown that there is important difference between the two groups, indicating better communication, pair performance and pair collaboration-viability for the pairs with heterogeneous personalities and temperaments. In order to provide an objective assessment of the differences between the two groups of pairs, a number of statistical tests and stepwise Discriminant Analysis were used.

O O O O O O O O B I 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 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 B I 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 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

pair programming
pair performance
pair effectiveness
controlled experiment

personality/temperament type
pair communication
pair collaboration-viability
kts-test


Synchronization of posttranslational modifications during aging There is an urgent need for surrogate biomarkers in clinical diagnostics but also preclinical in toxicology of chemicals and efficacy testing of pharmaceuticals. On the background of the emerging fields of systems biology and theranostics, the importance of time scales and the synchronization of complex biological readouts become increasingly obvious. Systemic effects such as responses to stimuli, medical intervention, cellular stress, or toxicity elicit immediate molecular changes on the protein level. Early events include phosphorylation and oxidation of proteins. These posttranslational modifications have a direct impact on enzyme activities and proteinprotein interactions. Only at downstream stages is gene transcription activated. Here we outline the analytical and statistical requirements dealing with complex patterns of protein expression and the extraction of protein surrogate biomarkers defining specific early stages of biological responses. We also present successful examples from research on aging and discuss prerequisites and necessary considerations while moving candidates to validation.

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 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

differential protein quantification
statistical validation
posttranslational modification
differential quantification
resolution


Scaling up: linking field data and remote sensing with a hierarchical model Ecologists often seek to understand patterns and processes across multiple spatial and temporal scales ranging from centimeters to hundreds of meters and from seconds to years. Hierarchical statistical models offer a framework for sampling design and analysis that can be used to incorporate the information collected at finer scales while allowing comparison at coarser scales. In this study we use a Hierarchical Bayesian model to assess the relationship between measurements collected on the ground at centimeter scales nested within 2 x 3 m quadrats, which are in turn nested within much larger (0.1-12 ha) plots. We compare these measurements with the Normalized Difference Vegetation Index (NDVI) derived from radiometrically and geometrically corrected 30-m resolution LANDSAT ETM+ data to assess the NDVI-Biomass relationship in the Cape Floristic Region of South Africa. Our novel modeling approach allows the data observed at submeter scales to be incorporated directly into the model and thus all the data (and variability) collected at finer scales are represented in the estimates of biomass at the LANDSAT scale. The model reveals that there is a strong correlation between NDVI and biomass, which supports the use of NDVI in spatiotemporal analysis of vegetation dynamics in Mediterranean shrubland ecosystems. The methods developed here can be easily generalized to other ecosystems and ecophysiological parameters.

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 B 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


A default logic based framework for context-dependent reasoning with lexical knowledge Lexical knowledge is increasingly important in information systems-for example in indexing documents using keywords, or disambiguating words in a query to an information retrieval system, or a natural language interface. However, it is a difficult kind of knowledge to represent and reason with. Existing approaches to formalizing lexical knowledge have used languages with limited expressibility, such as those based on inheritance hierarchies, and in particular, they have not adequately addressed the context-dependent nature of lexical knowledge. Here we present a framework, based on default logic, called the dex framework, for capturing context-dependent reasoning with lexical knowledge. Default logic is a first-order logic offering a more expressive formalisation than inheritance hierarchies: (1) First-order formulae capturing lexical knowledge about words can be inferred; (2) Preferences over formulae can be based on specificity, reasoning about exceptions, or explicit priorities; (3) Information about contexts can be reasoned with as first-order formulae formulae; and (4) Information about contexts can be derived as default inferences. In the dex framework, a word for which lexical knowledge is sought is called a query word. The context for a query word is derived from further words, such as words in the same sentence as the query word. These further words are used with a form of decision tree called a context classification tree to identify which contexts hold for the query word. We show how we can use these contexts in default logic to identify lexical knowledge about the query word such as synonyms, antonyms, specializations, meronyms, and more sophisticated first-order semantic knowledge. We also show how we can use a standard machine learning algorithm to generate context classification trees.

O B I 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 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 B I 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 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 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 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

knowledge representation
non-monotonic logic
reasoning under uncertainty


Hierarchical component-based representations for evolving microelectromechanical systems designs In this paper we present a genotype representation method for improving the performance of genetic-algorithm-based optimal design and synthesis of microelectromechanical systems. The genetic algorithm uses a hierarchical component-based genotype representation, which incorporates specific engineering knowledge into the design optimization process. Each microelectromechanical system component is represented by a gene with its own parameters defining its geometry and the way it can be modified from one generation to the next. The object-oriented genotype structures efficiently describe the hierarchical nature typical of engineering designs. They also encode knowledge-based constraints that prevent the genetic algorithm from wasting time exploring inappropriate regions of the search space. The efficiency of the hierarchical component-based genotype representation is demonstrated with surface-micromachined resonator designs.

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

component-based genotype representation
microelectromechanical system design
multiobjective genetic algorithm


Facial expression recognition system based on rigid and non-rigid motion separation and 3D pose estimation This study presents a facial expression recognition system which separates the non-rigid facial expression from the rigid head rotation and estimates the 3D rigid head rotation angle in real time. The extracted trajectories of the feature points contain both rigid head motion components and non-rigid facial expression motion components. A 3D virtual face model is used to obtain accurate estimation of the head rotation angle such that the non-rigid motion components can be precisely separated to enhance the facial expression recognition performance. The separation performance of the proposed system is further improved through the use of a restoration mechanism designed to recover feature points lost during large pan rotations. Having separated the rigid and non-rigid motions, hidden Markov models (HMMs) are employed to recognize a prescribed set of facial expressions defined in terms of facial action coding system (FACS) action units (AUs).

B I I O O O O O O O O O B I I 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 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 B I I O

facial expression recognition
facs action units
3d pose estimation

rigid and non-rigid motion separation
perspective projection


Exudate-based diabetic macular edema detection in fundus images using publicly available datasets Diabetic macular edema (DME) is a common vision threatening complication of diabetic retinopathy. In a large scale screening environment DME can be assessed by detecting exudates (a type of bright lesions) in fundus images. In this work, we introduce a new methodology for diagnosis of DME using a novel set of features based on colour, wavelet decomposition and automatic lesion segmentation. These features are employed to train a classifier able to automatically diagnose DME through the presence of exudation. We present a new publicly available dataset with ground-truth data containing 169 patients from various ethnic groups and levels of DME. This and other two publicly available datasets are employed to evaluate our algorithm. We are able to achieve diagnosis performance comparable to retina experts on the MESSIDOR (an independently labelled dataset with 1200 images) with cross-dataset testing (e.g., the classifier was trained on an independent dataset and tested on MESSIDOR). Our algorithm obtained an AUC between 0.88 and 0.94 depending on the dataset/features used. Additionally, it does not need ground truth at lesion level to reject false positives and is computationally efficient, as it generates a diagnosis on an average of 4.4s (9.3s, considering the optic nerve localisation) per image on an 2.6GHz platform with an unoptimised Matlab 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

exudates segmentation
feature extraction
lesion probability
automatic diagnosis
wavelets


Reconfigurable Blocks Based on Balanced Ternary Silicon-on-Insulator CMOS fabrication technologies are now available that offer a number of unique advantages including the availability of multiple simultaneous transistor thresholds. This paper proposes and analyzes a number of circuits for a reconfigurable array organization based on a balanced ternary logic system in which the logic set {??1, 0,?+?1} maps directly to equivalent voltage levels {?1V, 0V, +1V}. A number of low-power, high-speed components, such as a ternary buffer, flip-flop and look-up table, are described and simulated based on the characteristics of a commercially available silicon-on-sapphire process. A brief analysis indicates that the circuits will be capable of operating at the 22nm technology node and beyond. A simple example of a Sigma-Delta Modulated FIR filter is mapped to the array and some preliminary estimates are made of its performance and area based on both 3-input and 4-input look-up tables. The simulated ternary array is shown to be capable of operating at clock speeds of more than 200MHz such that it will readily support standard video bandwidths at useful over-sampling ratios.

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 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 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 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

digital logic
fpga
silicon-on-sapphire
circuit design
short word length dsp


Mean field variational Bayesian inference for support vector machine classification A mean field variational Bayes approach to support vector machines (SVMs) using the latent variable representation on Polson and Scott (2012) is presented. This representation allows circumvention of many of the shortcomings associated with classical SVMs including automatic penalty parameter selection, the ability to handle dependent samples, missing data and variable selection. We demonstrate on simulated and real datasets that our approach is easily extendable to non-standard situations and outperforms the classical SVM approach whilst remaining computationally efficient.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 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

approximate bayesian inference
mixed model
markov chain monte carlo


Characterization of PDZ domain-peptide interactions using an integrated protocol of QM/MM, PB/SA, and CFEA analyses Protein-protein interactions, particularly weak and transient ones, are often mediated by peptide recognition domains. Characterizing the interaction interface of domain-peptide complexes and analyzing binding specificity for modular domains are critical for deciphering protein-protein interaction networks. In this article, we report the successful use of an integrated computational protocol to dissect the energetic profile and structural basis of peptide binding to third PDZ domain (PDZ3) from the PSD-95 protein. This protocol employs rigorous quantum mechanics/molecular mechanics (QM/MM), semi-empirical Poisson-Boltzmann/surface area (PB/SA), and empirical conformational free energy analysis (CFEA) to quantitatively describe and decompose systematic energy changes arising from, respectively, noncovalent interaction, desolvation effect, and conformational entropy loss associated with the formation of 30 affinity-known PDZ3-peptide complexes. We show that the QM/MM-, PB/SA-, and CFEA-derived energy components can work together fairly well in reproducing experimentally measured affinity after a linearly weighting treatment, albeit they are not compatible with each other directly. We also demonstrate that: (1) noncovalent interaction and desolvation effect donate, respectively, stability and specificity to complex architecture, while entropy loss contributes modestly to binding; (2) P(0) and P(-2) of peptide ligand are the most important positions for determining both the stability and specificity of the PDZ3-peptide complex, P(-1) and P(-3) can confer substantial stability (but not specificity) for the complex, and N-terminal P(-4) and P(-5) have only a very limited effect on binding.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 B I B I 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 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

pdz domain
noncovalent interaction
desolvation effect
conformational entropy loss


Local RBF-based differential quadrature collocation method for the boundary layer problems In this article, the local RBF-based differential quadrature (LRBFDQ) collocation method is presented for the boundary layer problems, i.e., the singularly perturbed two-point boundary value problems. This novel method has an advantage over the globally supported RBF collocation method because it approximates the derivatives by RBF interpolation using a small set of nodes in the neighborhood of any collocation node. So it needs much less computational work than the globally supported RBF collocation method. It also could easily use the nodes in local support domain on the upwind side to obtain the non-oscillatory solution of boundary layer problems. Numerical examples are made by the multiquadric (MQ) RBF. Compared with the globally supported RBF collocation method and the finite difference method, numerical results demonstrate the accuracy and easy implementation of the LRBFDQ collocation method, even for the extremely thin layers in the boundary layer problems.

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 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 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 I

local rbf-based differential quadrature (lrbfdq)


Synchronization of Non-Identical Unknown Chaotic Delayed Neural Networks Based on Adaptive Sliding Mode Control The synchronization problem is studied in this paper for non-identical chaotic neural networks with time delays and fully unknown parameters, where the mismatched parameters, activation functions and neural network architectures are taken into account. To overcome the difficulty that complete synchronization of non-identical chaotic neural networks cannot be achieved only by utilizing output feedback control, we design an adaptive sliding mode controller to realize the synchronization. Our synchronization criteria are easily verified and do not need to solve any linear matrix inequality. These results generalize a few previous known results and remove some restrictions on the parameters, activation functions and neural network architectures. This paper also presents an illustrative example and uses simulated results of this example to show the feasibility and effectiveness of the proposed scheme.

B O O O O O B I O O O B I I 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 O O O O O O O O O O B 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 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

synchronization
neural networks
sliding mode control

parameter identification
adaptive control


A secure broadcasting cryptosystem and its application to grid computing Security is one of the major requirements of grid computing. In grid computing environments, it should be guaranteed that efficient and secure authenticated broadcasting technologies have been applied for users and servers. In addition, it should be ensured that resources and data are not provided by an attacker. The main purpose of a broadcasting cryptosystem is to establish a secure communication channel from a sender to a group of legal receivers. Recently, several broadcasting cryptosystems have been proposed based upon various cryptographic techniques. However, many researchers pointed out the several security weaknesses in the many previously proposed broadcasting cryptosystems. This paper proposes a new secure broadcasting cryptosystem that can withstand various security attacks and is applicable to grid computing environment. As a result, the proposed broadcasting cryptosystem not only has advantages of the broadcasting cryptosystem, but also is more secure and practical compared with previous related broadcasting cryptosystems.

O O B I 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 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 B I O O O O O O O O O O B I O O O O O O B I O O O O O O B I O O O O O O O O O O O O O

broadcasting cryptosystem
grid computing


Computing the characteristic numbers of the variety of nodal plane cubics in P-3 In this note we obtain, phrased in present day geometric and computational frameworks, the characteristic numbers of the family U-nod of non-degenerate nodal plane cubics in P-3, first obtained by Schubert in his Kalkul der abzahlenden Geometrie. The main geometric contribution is a detailed study of a variety X-nod, which is a compactification of the family U-nod, including the boundary components (degenerations) and a generalization to P-3 of a formula of Zeuthen for nodal cubics in P-2. The computations have been carried out with the WIRIS boost WIT. (c) 2006 Elsevier Ltd. All rights reserved.

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

plane nodal curves
effective computational methods


Applicability of camera works to free viewpoint videos with annotation and planning This paper shows the effectiveness of a cinematographic camera for controlling 3D video by measuring its effects on viewers with several typical camera works. 3D free-viewpoint video allows us to set its virtual camera on arbitrary positions and postures in 3D space. However, there have been neither investigations on adaptability nor on dependencies between the camera parameters of the virtual camera (i.e., positions, postures, and transitions) nor the impressions of viewers. Although camera works on 3D video based on expertise seems important for making intuitively understandable video, it has not yet been considered. When applying camera works to 3D video using the planning techniques proposed in previous research, generating ideal output video is difficult because it may include defects due to image resolution limitation, calculation errors, or occlusions as well as others caused by positioning errors of the virtual camera in the planning process. Therefore, we conducted an experiment with 29 subjects with camera-worked 3D videos created using simple annotation and planning techniques to determine the virtual camera parameters. The first point of the experiment examines the effects of defects on viewer impressions. To measure such impressions, we conducted a semantic differential (SD) test. Comparisons between ground truth and 3D videos with planned camera works show that the present defects of camera work do not significantly affect viewers. The experiment's second point examines whether the cameras controlled by planning and annotations affected the subjects with intentional direction. For this purpose, we conducted a factor analysis for the SD test answers whose results indicate that the proposed virtual camera control, which exploits annotation and planning techniques, allows us to realize camera working direction on 3D video.

O O O O O O O O O O O O O O O O O O O B 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 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 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 O O O O O O O O O O O O O O O O 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

3d video
camera work
cinematographic
semantic differential


Optimized task scheduling and resource allocation on cloud computing environment using improved differential evolution algorithm The objective of this study is to optimize task scheduling and resource allocation using an improved differential evolution algorithm (IDEA) based on the proposed cost and time models on cloud computing environment. The proposed IDEA combines the Taguchi method and a differential evolution algorithm (DEA). The DEA has a powerful global exploration capability on macro-space and uses fewer control parameters. The systematic reasoning ability of the Taguchi method is used to exploit the better individuals on micro-space to be potential offspring. Therefore, the proposed IDEA is well enhanced and balanced on exploration and exploitation. The proposed cost model includes the processing and receiving cost. In addition, the time model incorporates receiving, processing, and waiting time. The multi-objective optimization approach, which is the non-dominated sorting technique, not with normalized single-objective method, is applied to find the Pareto front of total cost and makespan. In the five-task five-resource problem, the mean coverage ratios C(IDEA, DEA) of 0.368 and C(IDEA, NSGA-II) of 0.3 are superior to the ratios C(DEA, IDEA) of 0.249 and C(NSGA-II, IDEA) of 0.288, respectively. In the ten-task ten-resource problem, the mean coverage ratios C(IDEA, DEA) of 0.506 and C(IDEA, NSGA-II) of 0.701 are superior to the ratios C(DEA, IDEA) of 0.286 and C(NSGA-II, IDEA) of 0.052, respectively. Wilcoxon matched-pairs signed-rank test confirms there is a significant difference between IDEA and the other methods. In summary, the above experimental results confirm that the IDEA outperforms both the DEA and NSGA-II in finding the better Pareto-optimal solutions. In the study, the IDEA shows its effectiveness to optimize task scheduling and resource allocation compared with both the DEA and the NSGA-II. Moreover, for decision makers, the Gantt charts of task scheduling in terms of having smaller makespan, cost, and both can be selected to make their decision when conflicting objectives are present.

O B I O O O O B I O O O B I I O O O O O O O O B I O O O O O O B I I O O O O O B I I I O B 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 I O O O O O O O O O O O O O O O O O O O O O

cloud computing
differential evolution algorithm
task scheduling
cost and time models


Optimized Hardware Implementation for Forward Quantization of H.264/AVC An efficient implementation for the computation of the forward quantization of H.264/AVC is presented. It uses a modified reformulation of quantization expressions, in full compliance with the standard, combined with an adaptive truncated Booth multiplier to reduce hardware complexity. The JM reference softwares C code has been rewritten to analyze the effect of the proposed approach. Simulations carried out on several typical video sequences with different texture characteristics demonstrate the validity of this approach with an improvement in the PSNR at low QP, between a maximum of +0.8dB and a minimum of 0.3dB, with a slight increment in the bit-rate of about 0.8%. However, this improvement is smoothed for typical values of QP and only an insignificant difference is found with respect to the JM results. The proposed architecture synthesized in the AMS 0.35?m technology, which is suitable for VLSI implementation, reduces the area by 26%, the power by 32% and the critical path delay by 21% in comparison with a classic implementation.

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 O O O B 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


optimization of html automatically generated by wysiwyg programs Automatically generated HTML, as produced by WYSIWYG programs, typically contains much repetitive and unnecessary markup. Thispaper identifies aspects of such HTML that may be altered whileleaving a semantically equivalent document, and proposes techniques to achieve optimizing modifications. These techniques include attribute re-arrangement via dynamic programming, the use of style classes, and dead-coderemoval. These techniques produce documents as small as 33\% of original size. The size decreases obtained are still significant when the techniques are used in combination with conventional text-based compression.

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 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


video-to-shot tag allocation by weighted sparse group lasso Traditional shot tagging techniques are focused on learning and propagating the tags at the same level, that is from labeled training shots to the unknown test shots. Due to the lack of sufficient labeled video shots, effective shot tagging remains challenging. By observing that video-level tags are more widely provided, we design a novel approach to propagate video-level tags to the test shots. A weighted sparse group lasso method (WSGL) is proposed for shot reconstruction, which well preserves the structural sparsity to reduce the noise in tag propagation. Meanwhile, it simultaneously considers the spatial-temporal information within the video corpus to enhance the tagging performance. Extensive experiments are conducted on two public video datasets to demonstrate the effectiveness of the proposed method.

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


engineering restful semantic services on the fly Real-world implementations of semantic services that could enable seamless integration of heterogeneous systems on the fly are deficient. This could be attributed to the complexity of heavy-weight semantic technologies, which mostly have a steep learning curve. As a consequence, the evolvement of modern approaches that purport to simplify the engineering of such services is a necessity. In this short paper, we present a work-in-progress model-driven approach that seeks to simplify and speed up the process of engineering RESTful semantic services. The suggested approach promotes automatic transformation of platform independent service models to partial service implementation and semantic descriptions to realize functional RESTful semantic services. The proposed solution is demonstrated and evaluated through a simple use-case scenario.

O O B I 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 B I 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

service engineering
restful services
model-driven


impulse-based simulation of rigid bodies We introduce a promising new approach to rigid body dynamic simulation called impulse-based simulation. The method is well suited to modeling physical systems with large numbers of collisions, or with contact modes that change frequently. All types of contact (colliding, rolling, sliding, and resting) are modeled through a series of collision impulses between the objects in contact, hence the method is simpler and faster than constraint-based simulation. We have implemented an impulse-based simulator that can currently achieve interactive simulation times, and real time simulation seems within reach. In addition, the simulator has produced physically accurate results in several qualitative and quantitative experiments. After giving an overview of impulse-based dynamic simulation, we discuss collision detection and collision response in this context, and present results from several experiments.

O B O O O O O O O O O O O O B B O O B O B O O O O O B B O O O O O O O O O O B 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 B O O O O O O B 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 O O O O O O O O B B O O B O O B B O O B O O O O O O

collision method simulation systems dynamic types context physical response change

interaction
collision detection
object
experience
model
constraint
real-time


Deadlock avoidance in flexible flow shops with loops This paper presents a deadlock-avoidance scheme that was developed during the MASCADA Project-Esprit LTR Project 22728. The deadlock problem occurs in a car body painting shop. From this application, an abstract problem was derived for which a deadlock-avoidance method was developed. The paper presents the deadlock-avoidance scheme and its correctness proof. In addition, implementation issues are introduced and solutions are discussed.

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 O

agents
manufacturing systems
intelligent manufacturing systems
flexible manufacturing systems


Probe threshold and probe trivially perfect graphs An undirected graph G = (V, E) is a probe C graph if its vertex set can be partitioned into two sets, N (nonprobes) and P (probes) where N is independent and there exists E' subset of N x N such that G' = (V, E boolean OR E') is a e graph. In this article we investigate probe threshold and probe trivially perfect graphs and characterise them in terms of certain 2-SAT formulas and in other ways. For the case when the partition into probes and nonprobes is given, we give characterisations by forbidden induced subgraphs, linear recognition algorithms (in the case of probe threshold graphs it is based on the degree sequence of the graph), and linear algorithms to find a set E' of minimum size. Furthermore, we give linear time recognition algorithms for both classes and a characterisation by forbidden subgraphs for probe threshold graphs when the partition (P, N) is not given. (C) 2009 Elsevier B.V. All rights reserved.

B I 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 B I 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 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

probe graphs
probe interval
graph class
2-sat


Extraction of second-order cyclostationary sourcesApplication to vibration analysis This paper addresses the issue of extracting the pure second-order cyclostationary (CS2) part of a signal. This proves very useful in many situations where the CS2 part actually contains most of the information in a signal, such as in acoustics or in vibration analysis. The proposed method exploits the spectral redundancy induced by the pure CS2 part and tries to reconstruct it by combining several filtered frequency-shifted versions of the signal. It only requires the a priori knowledge of the cyclic frequencies of the sources of interest. Contrary to other blind source separation algorithms, the method does not need any knowledge about the number of sources, it does not need to set up a forgetting factor, and, it works in highly noisy contexts. The derivation of the optimal filters is described in detail. The effectiveness of the method is finally demonstrated on both simulated and real industrial examples.

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 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

cyclic wiener filtering
rolling element bearing diagnostics


Dynamic Online-Calibrated Radio Maps for Indoor Positioning in Wireless Local Area Networks Context-awareness and Location-Based-Services are of great importance in mobile computing environments. Although fingerprinting provides accurate indoor positioning in Wireless Local Area Networks (WLAN), difficulty of offline site surveys and the dynamic environment changes prevent it from being practically implemented and commercially adopted. This paper introduces a novel client/server-based system that dynamically estimates and continuously calibrates a fine radio map for indoor positioning without extra network hardware or prior knowledge about the area and without time-consuming offline surveys. A modified Bayesian regression algorithm is introduced to estimate a posterior signal strength probability distribution over all locations based on online observations from WLAN access points (AP) assuming Gaussian prior centered over a logarithmic pass loss mean. To continuously adapt to dynamic changes, Bayesian kernels parameters are continuously updated and optimized genetically based on recent APs observations. The radio map is further optimized by a fast features reduction algorithm to select the most informative APs. Additionally, the system provides reliable integrity monitor (accuracy measure). Two different experiments on IEEE 802.11 networks show that the dynamic radio map provides 2-3m accuracy, which is comparable to results of an up-to-date offline radio map. Also results show the consistency of estimated accuracy measure with actual positioning accuracy.

O O O O O O O O O O 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 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

mobile environments systems and technologies


Comparison of adaptive-network-based fuzzy inference systems for bandwidth calculation of rectangular microstrip antennas This paper presents a method based on adaptive-network-based fuzzy inference system (ANFIS) to compute the bandwidth of a rectangular microstrip antenna (MSA). Seven optimization algorithms, least-squares, Nelder-Mead, genetic, differential evolution, hybrid learning, particle swarm, and simulated annealing are used to determine optimally the design parameters of the ANFIS. The results of the ANFIS models show better agreement with the experimental results as compared to the results of previous methods available in the literature. When the performances of ANFIS models are compared with each other, the best result is obtained from the ANFIS model trained by the least-squares algorithm. (C) 2008 Elsevier Ltd. All rights reserved.

O O O O O O O B O O O O O O O O O O O O O B I I B O O O B 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 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 B O O O O O O O O O O O O O

microstrip antenna
bandwidth
anfis
fuzzy inference system