The role of image size in the recognition of conversational facial expressions Facial expressions can be used to direct the flow of a conversation as well as to improve the clarity of communication. The critical physical differences between expressions can, however, be small and subtle. Clear presentation of facial expressions in applied settings, then, would seem to require a large conversational agent. Given that visual displays are generally limited in size, the usage of a large conversational agent would reduce the amount of space available for the display of other information. Here, we examine the role of image size in the recognition of facial expressions. The results show that conversational facial expressions can be easily recognized at surprisingly small image sizes. Copyright (C) 2004 John Wiley Sons, Ltd.

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


Network anomaly detection with the restricted Boltzmann machine With the rapid growth and the increasing complexity of network infrastructures and the evolution of attacks, identifying and preventing network abuses is getting more and more strategic to ensure an adequate degree of protection from both external and internal menaces. In this scenario many techniques are emerging for inspecting network traffic and discriminating between anomalous and normal behaviors to detect undesired or suspicious activities. Unfortunately, the concept of normal or abnormal network behavior depends on several factors and its recognition requires the availability of a model aiming at characterizing current behavior, based on a statistical idealization of past events. There are two main challenges when generating the training data needed for effective modeling. First, network traffic is very complex and unpredictable, and second, the model is subject to changes over time, since anomalies are continuously evolving. As attack techniques and patterns change, previously gained information about how to tell them apart from normal traffic may be no longer valid. Thus, a desirable characteristic of an effective model for network anomaly detection is its ability to adapt to change and to generalize its behavior to multiple different network environments. In other words, a self-learning system is needed. This suggests the adoption of machine learning techniques to implement semi-supervised anomaly detection systems where the classifier is trained with normal traffic data only, so that knowledge about anomalous behaviors can be constructed and evolve in a dynamic way. For this purpose we explored the effectiveness of a detection approach based on machine learning, using the Discriminative Restricted Boltzmann Machine to combine the expressive power of generative models with good classification accuracy capabilities to infer part of its knowledge from incomplete training data.

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

anomaly detection
restricted boltzmann machine

semi-supervised learning
intrusion detection
energy-based models


Performance scalability of decoupled software pipelining Any successful solution to using multicore processors to scale general-purpose program performance will have to contend with rising intercore communication costs while exposing coarse-grained parallelism. Recently proposed pipelined multithreading (PMT) techniques have been demonstrated to have general-purpose applicability and are also able to effectively tolerate intercore latencies through pipelined interthread communication. These desirable properties make PMT techniques strong candidates for program parallelization on current and future multicore processors and understanding their performance characteristics is critical to their deployment. To that end, this paper evaluates the performance scalability of a general-purpose PMT technique called decoupled software pipelining (DSWP) and presents a thorough analysis of the communication bottlenecks that must be overcome for optimal DSWP scalability.

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

performance
decoupled software pipelining


Markerless real-time 3-D target region tracking by motion backprojection from projection images Accurate and fast localization of a predefined target region inside the patient is an important component of many image-guided therapy procedures. This problem is commonly solved by registration of intraoperative 2-D projection images to 3-D preoperative images. If the patient is not fixed during the intervention, the 2-D image acquisition is repeated several times during the procedure, and the registration problem can be cast instead as a 3-D tracking problem. To solve the 3-D problem, we propose in this paper to apply 2-D region tracking to first recover the components of the transformation that are in-plane to the projections. The 2-D motion estimates of all projections are backprojected into 3-D space, where they are then combined into a consistent estimate of the 3-D motion. We compare this method to intensity-based 2-D to 3-D registration and a combination of 2-D motion backprojection followed by a 2-D to 3-D registration stage. Using clinical data with a fiducial marker-based gold-standard transformation, we show that our method is capable of accurately tracking vertebral targets in 3-D from 2-D motion measured in X-ray projection images. Using a standard tracking algorithm (hyperplane tracking), tracking is achieved at video frame rates but fails relatively often (32% of all frames tracked with target registration error (TRE) better than 1.2 mm, 82% of all frames tracked with TRE better than 2.4 mm). With intensity-based 2-D to 2-D image registration using normalized mutual information (NMI) and pattern intensity (PI), accuracy and robustness are substantially improved. NMI tracked 82% of all frames in our data with TRE better than 1.2 mm and 96% of all frames with TRE better than 2.4 mm. This comes at the cost of a reduced frame rate, 1.7 s average processing time per frame and projection device. Results using PI were slightly more accurate, but required on average 5.4 s time per frame. These results are still substantially faster than 2-D to 3-D registration. We conclude that motion backprojection from 2-D motion tracking is an accurate and efficient method for tracking 3-D target motion, but tracking 2-D motion accurately and robustly remains a challenge.

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

frameless stereotactic radiosurgery
real-time target tracking
2-d to 2-d registration
2-d to 3-d registration


Efficient convex hull computation for planar freeform curves We present an efficient real-time algorithm for computing the precise convex hulls of planar freeform curves. For this purpose, the planar curves are initially approximated with G1-biarcs within a given error bound ? ? in a preprocessing step. The algorithm is based on an efficient construction of approximate convex hulls using circular arcs. The majority of redundant curve segments can be eliminated using simple geometric tests on circular arcs. In several experimental results, we demonstrate the effectiveness of the proposed approach, which shows the performance improvement in the range of 200300 times speed up compared with the previous results (Elber et al., 2001) [8].

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

biarcs
efficient algorithm
culling
upper envelope


A comparison of models for predicting early hospital readmissions We compare a variety of models for predicting early hospital readmissions. Performance of existing models is insufficient for practical applications. Random forests and deep neural networks perform best in terms of AUC. Models fit to homogeneous patient subgroups typically outperform global models.

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

electronic health records
early readmission
penalized methods
random forest
deep learning
predictive models


A novel algorithm for defect inspection of touch panels ? We develop a novel algorithm to inspect the defects on touch panel. Based on periodic patterns of touch panel, an adaptive model is learned online to extract defects. The experimental results indicate that our proposed method achieves accurate detection with efficient computation. The users pay very little effort for the testing of different panel products.

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


Influence of the Emissions Trading Scheme on generation scheduling The paper investigates the effects of emissions constraints and Emissions Trading Scheme (ETS) on the generation scheduling outcome. ETS is a cap-and-trade market mechanism that has been introduced in European Union in order to facilitate CO2 emissions management. This scheme gives generators certain amount of CO2 allowances which they can use to cover emissions produced during energy generation. In a current setting, most of the allowances are given for free. However, under ETS generators also have an opportunity to buy and sell CO2 allowances on the market. Since generation power outputs are bounded by the amount of CO2 emissions that they are allowed to produce over time, it is becoming increasingly important for generating units to manage their allocations in the most profitable way and decide when and how much of permissions to spent to produce electricity. The method proposed here allows for modeling of this new limitation by including costs of buying and selling of CO2 allowance in the generation scheduling procedure. It also introduces additional emissions constraints in the problem formulation. Although CO2 permissions and energy are traded in separate markets, the proposed formulation permits analysis on how emission caps and emission market prices can influence market outcome. The method is illustrated on a 5-unit system. Given examples compare (i) a base-case when all generators have made a decision to use portions of their total free allocations that do not cause any shortfall during the investigated time period; (ii) two cases when the least expensive generators decisions on the amount of free allowances they are willing to use during the considered period are insufficient. In all cases generators also submit prices at which they expect to be able to top-up or sell allowances on the market, however, only in the second and third case the buying option becomes active and affects generation scheduling and total costs. In addition, the paper investigates how aggregation of emissions allowances of generators belonging to the same company can affect market clearing.

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

emissions trading scheme
generation scheduling
market clearing

unit commitment
mixed integer programming
emission allowances


A Performance Modeling Scheme for Multistage Switch Networks With Phase-Type and Bursty Traffic Existing analytical methods to model multistage switch networks cannot be applied to the performance modeling of switch networks with phase-type and bursty traffic because of the problem of state-space explosion and unrealistic assumptions, e.g., uniform traffic and independent destination (UTID). This paper presents an approximate scheme to model and analyze such networks. First, a traffic aggregation technique is proposed to deal with phase-type and bursty traffic, including splitting and merging. For the aggregation of two bursty traffic, a closed-form solution is obtained for buffer state probabilities. For the aggregation of more,bursty traffic, a recursive algorithm is derived in terms of the buffer size and number of inputs of a switch. Second, a switch decomposition technique is developed, by which the crossbar of a switch is decomposed from its preceding and succeeding buffers. In this way, a switch network of N inputs and outputs is converted to N tandem queues, for which the performance can be easily evaluated. Our extensive numerical and simulation examples have shown that the proposed scheme achieves satisfied accuracy and computational efficiency.

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


Inapproximability Results for Wavelength Assignment in WDM Optical Networks We address the issue of inapproximability of the wavelength assignment problem in wavelength division multiplexing (WDM) optical networks. We prove that in an n-node WDM optical network with m lightpaths and maximum load L, if NP not equal ZPP, for any constant delta > 0, no polynomial time algorithm can achieve approximation ratio n(1/2-delta) m(1-delta), where NP is the class of problems which can be solved by nondeterministic polynomial time algorithms, and ZPP is the class of problems that can be solved by polynomial randomized algorithms with zero probability of error. Furthermore, the above result still holds even when L = 2. We also prove that no algorithm can guarantee the number of wavelengths to be less than (root n/2)L or (m/2)L. This is the first time inapproximability results are established for the wavelength assignment problem in WDM optical networks. We also notice the following fact, namely, there is a polynomial time algorithm for wavelength assignment which achieves approximation ratio of O(m(log log m)(2)/(log m)(3)). Therefore, the above lower bound of m(1-delta) nearly tight.

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

approximation ratio
inapproximability
optical network
wavelength assignment
wavelength division multiplexing


A new stochastic cellular automata model for traffic flow simulation with drivers behavior prediction A novel, flexible and robust traffic flow cellular automata model is presented. Drivers behavior are easily treated by one specific Probability Density Function. The model reproduces results compatible with theoretical and measured data.

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

traffic flow modeling
drivers behaviors
stochastic model
numerical simulation


Communication mechanisms in ecological network-based grid middleware for service emergence Next generation grid systems are heading for globally collaborative, service-oriented and live information systems that exhibit a strong sense of automation. A collection of autonomous agents is searched, assembled, and coordinated in a grid middleware system to produce desirable grid services. An effective communication mechanism is vital to the effectiveness of the step to build a novel grid middleware system. In this study, we provide our grid middleware with a flexible communication solution to implement the complicated behaviors among different agents. We propose a transport mechanism of grid middleware, named as ecological network communication language (ENCL) and ecological network interaction protocol (ENIP) respectively from a low-level to a high-level implementation strategy of a communication mechanism. A series of experiments demonstrate that a service with some of the desired properties can emerge from interacting agents via the proposed solution.

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


High Reliability and Performance PWM Inverter for Standalone Microgrids In this paper a high reliability and performance single-phase PWM inverter for standalone microgrids is presented. To obtain the before mentioned characteristics this work propose, two different controller structures and a straightforward design methodology for these controllers, based on the internal model principle. In order to validate the proposed design methodology, digital controllers and to demonstrate the steady state and transient performance, experimental results are presented from a 5kVA PWM modulated single-phase inverter, fully controlled by a DSP TMS320F2407.

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

dc-ac converter
dc-dc converter
photovoltaic inverter
digital control
standalone photovoltaic systems


Methodology used for "Software for automated linkage in Italy" (SALI)(1) Linkage of epidemiological registries can provide cost-effective information on the associations between different diseases or exposures in the population under study and on completeness of surveillance system databases. We describe the program SALI (software for automated linkage in Italy) aimed at matching individual records from medium-sized registries (in the order of 100,000 records), where the desired outcome is to miss as few links as possible and, because of low link-likelihood (<1%), a manual revision of matched pairs is feasible. SALI developed in CA-Clipper language, uses registry files in dBase format. It requires only name, surname, and date of birth as key fields, and it allows for spelling errors in Italian or other Latin languages through a specific algorithm. Furthermore, a double-blind procedure ensures data confidentiality. The main linkage procedure is based on four stages, two automatic ones, and two where the operator can decide through specific windows whether to accept stage-selected matches. SALI takes into account possible errors in key fields thus reducing false negatives. It was used to solve the problem of linkage between AIDS and cancer registries in Italy. It can be used with every IBM-compatible computer system, assuring uniquely high portability. (C) 2001 Elsevier Science (USA).

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

linkage
software
aids
cancer registries
italy
dbase


unified associative information storage and retrieval We present a novel system for performing information management in a unified manner. Users currently must manage large amounts of data which may be fragmented across file formats and applications. Our system, called Iolite, attempts to consolidate this information by automatically discovering associations within the data. Iolite uses these associations to provide a unified interface to navigate and operate on this information space.

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


Scalar multiplier rules in set-valued optimization In this work we establish necessary and sufficient conditions for weak minimizers of a constrained set-valued optimization problem. These conditions are given by means of Multiplier rules formulated in terms of contingent epiderivatives of scalar set-valued maps. We consider that the image spaces are finite dimensional and the set-valued maps are convex and stable. For these conditions, our results provide a scalar version of analogous existing results ill the literature under weaker existence conditions. Moreover we prove that the multiplier rules can be computed in terms of the directional derivative of associated maps of infima. (c) 2009 Published by Elsevier Ltd

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

contingent epiderivatives
weak minimizers

set-valued optimization
ordered spaces
lagrange multipliers


Getting the blend right in new learning environments: A complementary approach to online discussions This paper reports some of the findings of a case study investigation of undergraduate student learning in online discussions within a campus-based business course in New Zealand. The project explored predominantly Net Gener students perceptions of the differences between face-to-face and online discussions and the role of these differences in their learning. The study found that the students regarded the two environments as different but complementary for their learning and identified the features of each discussion environment that supported their learning. A complementary framework, based on these student perspectives is presented. These findings and the framework provide teachers and course designers with a new evidence-based approach for including effective face-to-face and online discussions for Net Gener and other students within their courses.

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

blended learning
net geners
computer-mediated discussions
undergraduates
business education


An integrated multi-stage supply chain inventory model under an infinite planning horizon and continuous price decrease This paper studies an integrated inventory model in a supply chain that involves procurement, production and delivery activities. The model is studied in an environment where products experience continuous price decrease and planning is performed in an infinite time horizon. In this model, a manufacturing facility purchases a fixed-quantity of raw materials from an outside supplier, processes the materials, and delivers a fixed-quantity of finished products to a customer periodically. In order to take advantage of the decreasing price trend, customers demand frequent deliveries of small lots of finished products, and this inventory management strategy has been used by many successful companies in technology-related industries. Therefore, the ultimate intention of this research is to study and model the inventory system for high-tech companies whose products are experiencing continuous price decrease. This model is used to determine an optimal economic lot size model for raw material procurement, production setup and finished goods delivering under an infinite planning horizon. Two efficient algorithms are developed in this paper to solve this nonlinear model and the test results consistently indicate that ordering of raw materials and delivery of finished goods should be frequent in small lots for low ordering and shipment costs. Finally an operational schedule is provided to show the implementation procedure of the model. (C) 2011 Elsevier Ltd. All rights reserved.

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

continuous price decrease
infinite planning horizon

integrated inventory control
small lot size


information dissemination in highly dynamic graphs We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary so that a node may correctly flood or route a message in a network whose links may change arbitrarily at any given point, subject to the condition that the underlying graph is connected. We look at algorithmic constraints such as limited storage, no knowledge of an upper bound on the number of nodes, and no usage of identifiers. We look at flooding as well as routing to some existing specified destination and give algorithms.

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


How information changes consumer behavior and how consumer behavior determines corporate strategy Information availability has increased consumers' informedness, the degree to which they know what is available in the marketplace, with precisely which attributes and at precisely what price. This informedness has altered the demand side of market behavior: customers now discount more heavily when comparable products are available from competitors and when products do not meet their wants, needs, cravings, and longings, but they no longer discount as heavily when purchasing unfamiliar products. Changes in the demand side are producing comparable changes in the supply side: firms earn less than their expectations when competing in traditional mass-market fat spots, while earning far more than previously when entering newly created resonance marketing sweet spots. We trace the impact of hyperdifferentiation and resonance marketing on strategy, with a clear progression from a limited number of fat spots, through reliance on line extensions, and ultimately to fully differentiated market sweet spots.

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

consumer informedness
long tail
marketing strategy
online reviews
word-of-mouth marketing


Optimal design of cantilevered elastica for minimum tip deflection under self-weight The optimal distribution of material to minimize the vertical deflection of the free end of a horizontal cantilever is determined. The beam is only subjected to its own weight. Large deflections are considered, and the structure is modeled as an inextensible elastica. A minimum-area constraint is included, and is active in a region near the tip. After the problem is formulated, numerical results are obtained with the use of a shooting method. The moment of inertia is assumed to be proportional to the area or its square or cube. The results depend on this relationship, the minimum-area constraint, and a nondimensional parameter depending on the beam's density, length, and modulus of elasticity. In the numerical results presented, if the minimum area is 1/20 of the area of the uniform beam, the tip deflection for the optimal design is 78-89% smaller than that for the uniform beam. An experiment is conducted and the data are in close agreement with the numerical results.

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

optimal beam
self-weight
minimum deflection


Sequence-based clustering for Web usage mining: A new experimental framework and ANN-enhanced K-means algorithm We develop a general sequence-based clustering method by proposing new sequence representation schemes in association with Markov models. The resulting sequence representations allow for calculation of vector-based distances (dissimilarities) between Web user sessions and thus can be used as inputs of various clustering algorithms. We develop an evaluation framework in which the performances of the algorithms are compared in terms of whether the clusters (groups of Web users who follow the same Markov process) are correctly identified using a replicated clustering approach. A series of experiments is conducted to investigate whether clustering performance is affected by different sequence representations and different distance measures as well as by other factors such as number of actual Web user clusters, number of Web pages, similarity between clusters, minimum session length, number of user sessions, and number of clusters to form. A new, fuzzy ART-enhanced K-means algorithm is also developed and its superior performance is demonstrated.

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

clustering methods
simulation
artificial intelligence
markov chain


Decision tree based disambiguation of semantic roles for Korean adverbial postpositions The case postpositions usually have more than one semantic role in Korean. The adverbial postpositions among various postpositions especially make the development of Korean-based machine translation system difficult, because they have more semantic roles than others. In this paper, we describe a new method for resolving semantic ambiguities of adverbial postpositions using decision tree induction. The lack of training examples in decision tree induction is overcome by clustering words into classes using a kind of greedy algorithm. The cross validation results show that the presented method achieves 76.5% of accuracy on the average, which is 20.3% improvement over the baseline method.

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

semantic role disambiguation
word class
korean adverbial postposition


An adaptive algorithm for conversion from quadtree to chain codes An adaptive algorithm is presented for converting the quadtree representation of a binary image to its chain code representation. Our algorithm has the advantage of constructing the chain codes of the resulting quadtree of the Boolean operation of two quadtrees by re-using the original chain codes. This algorithm is adaptive because it can adjust the total number of internal nodes to be stored and retrieve it later in the reconstruction stage. The algorithm possesses parallelism and is suited for pyramid architecture. Our algorithm requires time O(H+L) in sequential and time O(N) in parallel, where H is the height of the quadtree, L is the length of the chain code sequence generated, and NN is the size of the input image.

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

image representation
parallel algorithm
adaptive conversion


cache coherency communication cost in a noc-based mpsoc platform Cache coherency and cache consistency in NoC-based heterogeneous platforms are still open problems. Current works addressing platform design avoid this issue either by proposing cacheless implementations or using snoopy protocols over buses. This paper addresses the cache coherence problem in a NoC-based MPSoC platform, focusing the communication considering both the load overhead produced by the coherency mechanism and read/write response times. Simulations of applications written in C and compiled with GCC are presented. Simulations results indicate that the load is constant with the cache size for a given line size.

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


Optimal-Location-Selection Query Processing in Spatial Databases This paper introduces and solves a novel type of spatial queries, namely, Optimal-Location-Selection (OLS) search, which has many applications in real life. Given a data object set D(A), a target object set D(B), a spatial region R, and a critical distance d(c) in a multidimensional space, an OLS query retrieves those target objects in D(B) that are outside R but have maximal optimality. Here, the optimality of a target object b is an element of D(B) located outside R is defined as the number of the data objects from D(A) that are inside R and meanwhile have their distances to b not exceeding d(c). When there is a tie, the accumulated distance from the data objects to b serves as the tie breaker, and the one with smaller distance has the better optimality. In this paper, we present the optimality metric, formalize the OLS query, and propose several algorithms for processing OLS queries efficiently. A comprehensive experimental evaluation has been conducted using both real and synthetic data sets to demonstrate the efficiency and effectiveness of the proposed algorithms.

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

optimal-location-selection
spatial database
algorithm


Parameterized object sensitivity for points-to analysis for Java The goal of points-to analysis for Java is to determine the set of objects pointed to by a reference variable or a reference object field. We present object sensitivity, a new form of context sensitivity for flow-insensitive points-to analysis for Java. The key idea of our approach is to analyze a method separately for each of the object names that represent run-time objects on which this method may be invoked. To ensure flexibility and practicality, we propose a parameterization framework that allows analysis designers to control the tradeoffs between cost and precision in the object-sensitive analysis. Side-effect analysis determines the memory locations that may be modified by the execution of a program statement. Def-use analysis identifies pairs of statements that set the value of a memory location and subsequently use that value. The information computed by such analyses has a wide variety of uses in compilers and software tools. This work proposes new versions of these analyses that are based on object-sensitive points-to analysis. We have implemented two instantiations of our parameterized object-sensitive points-to analysis. On a set of 23 Java programs, our experiments show that these analyses have comparable cost to a context-insensitive points-to analysis for Java which is based on Andersen's analysis for C. Our results also show that object sensitivity significantly improves the precision of side-effect analysis and call graph construction, compared to (1) context-insensitive analysis, and (2) context-sensitive points-to analysis that models context using the invoking call site. These experiments demonstrate that object-sensitive analyses can achieve substantial precision improvement, while at the same time remaining efficient and practical.

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

static analysis
points-to analysis
class analysis
def-use analysis
side-effect analysis


Fuzzy

modeling

of

fluidized

catalytic

cracking

unit

The

paper

deals

with

the

fuzzy

system

identification

of

reactorregeneratorstripperfractionator's

(RRSF)

section

of

a

fluidized

catalytic

cracking

unit

(FCCU).

The

fuzzy

system

identification

based

on

the

data

collected

from

an

operating

refinery

of

FCCU

of

capacity,

with

a

sample

time

of

A

generalized

fuzzy

model

(GFM)

and

identification

of

structure

and

model

parameter

for

multi-input/single

output

is

presented.

The

GFM

has

the

capability

of

representing

both

the

CRI

model

and

TS

model

under

certain

conditions.

The

structure

identification

and

the

parameter

estimation

are

carried

out

using

hybrid

learning

approach

comprising

modified

mountain

clustering

and

gradient

descent

learning

with

least

square

estimation

(LSE)

for

the

identification

of

a

fuzzy

model.

The

modified

mountain

clustering

considers

every

data

point

as

a

potential

cluster

center

in

xy

hyperspace.

The

optimum

number

of

clusters,

which

leads

to

an

optimum

number

of

rules,

is

determined

with

the

help

of

validity

function

that

guides

the

search.

The

obtained

result

from

the

modified

mountain

clustering

initializes

the

GFM.

Further

hybrid

of

the

gradient

descent

technique

and

LSE

is

aimed

at

learning

of

the

GFM

parameters

in

two

phases.

In

the

first

phase

of

an

epoch

of

learning

gradient

descent

tunes

the

premise

parameter

and

index

of

fuzziness

of

each

rule.

In

second

phase,

LSE

utilizes

the

results

of

first

phase

for

evaluating

the

coefficient

of

local

linear

model

of

corresponding

rules.

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

fuzzy models
fuzzy inference systems
unsupervised learning
supervised learning
dynamic fuzzy model
fuzzy clustering
fccu models


Approximation spaces in off-policy Monte Carlo learning This paper introduces an approach to off-policy Monte Carlo (MC) learning guided by behaviour patterns gleaned from approximation spaces and rough set theory introduced by Zdzis?aw Pawlak in 1981. During reinforcement learning, an agent makes action selections in an effort to maximize a reward signal obtained from the environment. The problem considered in this paper is how to estimate the expected value of cumulative future discounted rewards in evaluating agent actions during reinforcement learning. The solution to this problem results from a form of weighted sampling using a combination of MC methods and approximation spaces to estimate the expected value of returns on actions. This is made possible by considering behaviour patterns of an agent in the context of approximation spaces. The framework provided by an approximation space makes it possible to measure the degree that agent behaviours are a part of (covered by) a set of accepted agent behaviours that serve as a behaviour evaluation norm. Furthermore, this article introduces an adaptive action control strategy called run-and-twiddle (RT) (a form of adaptive learning introduced by Oliver Selfridge in 1984), where approximate spaces are constructed on a need by need basis. Finally, a monocular vision system has been selected to facilitate the evaluation of the reinforcement learning methods. The goal of the vision system is to track a moving object, and rewards are based on the proximity of the object to the centre of the camera field of view. The contribution of this article is the introduction of a RT form of off-policy MC learning.

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

behaviour pattern
expectation
off-policy learning
monte carlo method
rough sets
run-and-twiddle


An automated analysis methodology to detect inconsistencies in web services with WSDL interfaces Web Service Definition Language (WSDL) is being increasingly used to specify web service interfaces. Specifications of this type, however, are often incomplete or imprecise, which can create difficulties for client developers who rely on the WSDL files. To address this problem a semi-automated methodology that probes a web service with semi-automatically generated inputs and analyzes the resulting outputs is presented. The results of the analysis are compared to the original WSDL file and differences between the observed behavior of the service and the WSDL specifications are reported to the user. The methodology is applied in two case studies involving two popular commercial (Amazon and eBay) web services. The results show that the methodology can scale, and that it can uncover problems in the WSDL files that may impact a large number of clients. Copyright (c) 2011 John Wiley & Sons, Ltd.

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


An exploratory canonical analysis approach for multinomial populations based on the phi-divergence measure In this paper we consider an exploratory canonical analysis approach for multinomial population based on the phi-divergence measure. We define the restricted minimum phi-divergence estimator, which is seen to be a generalization of the restricted maximum likelihood estimator. This estimator is then used in phi-divergence goodness-of-fit statistics which is the basis of two new families of statistics for solving the problem of selecting the number of significant correlations as well as the appropriateness of the model.

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


A filter design method for minimizing ringing in a region of interest in MR spectroscopic images Magnetic resonance spectroscopic imaging (MRSI) requires a relatively long time to sample k-space (the spatial frequency domain), effectively lowpass filtering the resulting reconstructed image. Ringing is especially problematic when a region of interest (ROI) is close to a bright region outside the ROI, since the bright region tends to create a ringing artifact into the ROI due to the lowpass nature of the data, In this paper, we propose a method that reduces the effect of a stronger signal region on a weaker signal in a nearby ROI by designing a postprocessing filter that steers the strong interference away from the ROI, The proposed method is computationally simple both in the design stage and in applying it to images. We present experiments that illustrate the value of the technique.

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


Health GIS and HIV/AIDS studies: Perspective and retrospective GIS (Geographic Information System) is a useful tool that aids and assists in health research, health education, planning, monitoring and evaluation of health programmes that are meant to control and eradicate certain life threatening diseases and epidemics. HIV/AIDS is one such epidemic that poses a serious challenge and threatens the overall human welfare. This communication is an attempt to link and understand the health scenario in a GIS context with emphasis on HIV/AIDS. Various GIS based functionalities for health studies and their scope in analyzing and controlling epidemiological diseases are explored. Overall scenario of the spread of HIV/AIDS around the world is presented along with the Indian perspective. Finally, we conclude with the general management problems, issues and challenges related to HIV/AIDS prevailing in India.

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

applications
softwares
hiv/aids
epidemiology
mapping
surveillance
modeling
indian scenario


Fluid-solid interaction problems with thermal convection using the immersed element-free Galerkin method In this work, the immersed element-free Galerkin method (IEFGM) is proposed for the solution of fluid-structure interaction (FSI) problems. In this technique, the FSI is represented as a volumetric force in the momentum equations. In IEFGM, a Lagrangian solid domain moves on top of ail Eulerian fluid domain that spans over the entire computational region. The fluid domain is modeled using the finite element method and the solid domain is modeled using file element-free Galerkin method. The continuity between the solid and fluid domains is satisfied by means of a local approximation, in the vicinity of the solid domain, of the velocity field and the FSI force. Such ail approximation is achieved using the moving least-squares technique. The method was applied to simulate the motion of a deformable disk moving in a viscous fluid due to the action of the gravitational force and the thermal convection of the fluid. Ail analysis of the main factors affecting the shape and trajectory of the solid body is presented. The method shows a distinct advantage for simulating FSI problems with highly deformable solids. Copyright (c) 2009 John Wiley & Sons, Ltd.

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

fluid-structure interaction
meshfree methods
immersed element-free galerkin method
moving least squares
adaptive re-meshing


Throughput and Delay Analysis of a Reliable Cooperative MAC Protocol in Ad Hoc Networks In this paper, we present the performance evaluation of the reliable cooperative media access control (RCO-MAC) protocol, which has been proposed in [1] by us in order to enhance system throughput in bad wireless channel environments. The performance of this protocol is evaluated with computer simulation as well as mathematical analysis in this paper. The system throughput, two types of average delays, average channel access delay, and average system delay, which includes the queuing delay in the buffer, are used as performance metrics. In addition, two different traffic models are used for performance evaluation: The saturated traffic model for computing system throughput and average channel access delay, and the exponential data generation model for calculating average system delay. The numerical results show that the RCO-MAC protocol proposed by us provides over 20% more system throughput than the relay distributed coordination function (rDCF) scheme. The numerical results show that the RCO-MAC protocol provides a slightly higher average channel access delay over a greater number of source nodes than the rDCF. This is because a greater number of source nodes provide more opportunities for cooperative request to send (CRTS) frame collisions and because the value of the related retransmission timer is greater in the RCO-MAC protocol than in the rDCF protocol. The numerical results also confirm that the RCO-MAC protocol provides better average system delay over the whole gamut of the number of source nodes than the rDCF protocol.

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

ad hoc networks
cooperative
system throughput

reliable cooperative media access constrol (rco-mac) protocol


User modeling for personalized city tours Several current support systems for travel and tourism are aimed at providing information in a personalized manner, taking users' interests and preferences into account. In this vein, personalized systems observe users' behavior and, based thereon, make generalizations and predictions about them. This article describes a user modeling server that offers services to personalized systems with regard to the analysis of user actions, the representation of assumptions about the user, and the inference of additional assumptions based on domain knowledge and characteristics of similar users. The system is open and compliant with major standards, allowing it to be easily accessed by clients that need personalization services.

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

interest profile
ldap
learning about the user
mobile tourist guide


Triangular Bezier surface patches in modeling shape of boundary geometry for potential problems in 3D This paper presents a new boundary shape representation for 3D boundary value problems based on parametric triangular B,zier surface patches. Formed by the surface patches, the graphical representation of the boundary is directly incorporated into the formula of parametric integral equation system (PIES). This allows us to eliminate the need for both boundary and domain discretizations. The possibility of eliminating the discretization of the boundary and the domain in PIES significantly reduces the number of input data necessary to define the boundary. In this case, the boundary is described by a small set of control points of surface patches. Three numerical examples were used to validate the solutions of PIES with analytical and numerical results available in the literature.

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

potential problems
triangular bezier surface patches

parametric integral equation system (pies)


learning to rank categories for web queries In web search, understanding the user intent plays an important role in improving search experience of the end users. Such an intent can be represented by the categories which the user query belongs to. In this work, we propose an information retrieval based approach to query categorization with an emphasis on learning category rankings. To carry out categorization we first represent a category by web documents (from Open Directory Project) that describe the semantics of the category. Then, we learn the category rankings for the queries using 'learning to rank' techniques. To show that the results obtained are consistent and do not vary across datasets, we evaluate our approach on two datasets including the publicly available KDD Cup dataset. We report an overall improvement of 20\% on all evaluation metrics (precision, recall and F-measure) over two baselines: a text categorization baseline and an unsupervised IR baseline.

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


creating a professional development program to support a handheld computing initiative Indiana State University is providing handheld computers to every faculty member in its School of Education. What started as a small pilot program a year ago has grown into a project that is challenging the way faculty are thinking about technology and its application in the teaching and learning process. In addition, a substantial pool of handheld computers has been created for faculty to use with students in the classroom. Recognizing that a strong professional development program was needed to support the handheld computing initiative was instrumental to the initiative's success.This paper centers on the professional development program that was created to support the initiative's efforts. Initial distribution of the handheld computers took place at departmental meetings. A basic overview of the handheld computer was given at that time. Seven different workshops are continually offered as well as one-on-one training opportunities. Once a month, a brown bag lunch and handheld computer brainstorming and idea exchanging session is held with interested faculty and students. In addition, guest speakers have been brought to campus to speak on issues related to handheld computing.

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

faculty development
documentation development
technology training


Surface passivation optimization using DIRECT We describe a systematic and efficient method of determining pseudo-atom positions and potentials for use in nanostructure calculations based on bulk empirical pseudopotentials (EPMs). Given a bulk EPM for binary semiconductor X, we produce parameters for pseudo-atoms necessary to passivate a nanostructure of X in preparation for quantum mechanical electronic structure calculations. These passivants are based on the quality of the wave functions of a set of small test structures that include the passivants. Our method is based on the global optimization method DIRECT. It enables and/or streamlines surface passivation for empirical pseudopotential calculations.

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

global optimization
electronic structure
nanostructure
surface passivation
pseudopotentials


software development for governmental use utilizing free and open source software The Icelandic government is about to release its policy on free and open source software. Many governments around the world have either already released a similar policy or have one planned. The policy of the Icelandic government deals with both the use and the development of free and open source software. This paper takes a close look at the free and open source software policies, particularly the Icelandic one, from a software development perspective. The goal is to show how governments can utilize free and open source software when customized software is required. The paper also touches upon licensing issues for free and open source software by discussing the European Union Public License. Governmental project management and services of small software companies and the free and open source community are the focal points of the research. The basis of the research is the i2010 policy framework of the European Commission. The paper concludes by proposing a suitable methodology to use for governmental software development and recommending tools that foster both development and management, with emphasis on the latter.

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

software development
free and open source software


High-quality conforming hexahedral meshes of patient-specific abdominal aortic aneurysms including their intraluminal thrombi In order to perform finite element (FE) analyses of patient-specific abdominal aortic aneurysms, geometries derived from medical images must be meshed with suitable elements. We propose a semi-automatic method for generating conforming hexahedral meshes directly from contours segmented from medical images. Magnetic resonance images are generated using a protocol developed to give the abdominal aorta high contrast against the surrounding soft tissue. These data allow us to distinguish between the different structures of interest. We build novel quadrilateral meshes for each surface of the sectioned geometry and generate conforming hexahedral meshes by combining the quadrilateral meshes. The three-layered morphology of both the arterial wall and thrombus is incorporated using parameters determined from experiments. We demonstrate the quality of our patient-specific meshes using the element Scaled Jacobian. The method efficiently generates high-quality elements suitable for FE analysis, even in the bifurcation region of the aorta into the iliac arteries. For example, hexahedral meshes of up to 125,000 elements are generated in less than 130s, with 94.8% of elements well suited for FE analysis. We provide novel input for simulations by independently meshing both the arterial wall and intraluminal thrombus of the aneurysm, and their respective layered morphologies.

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

intraluminal thrombus
conforming hexahedral meshes

magnetic resonance imaging
abdominal aortic aneurysm
finite element analysis


Acoustic feature selection and classification of emotions in speech using a 3D continuous emotion model In this paper we report the results obtained from experiments with a database of emotional speech in English in order to find the most important acoustic features to estimate Emotion Primitives which determine the emotional content on speech. We are interested in exploiting the potential benefits of continuous emotion models, so in this paper we demonstrate the feasibility of applying this approach to annotation of emotional speech and we explore ways to take advantage of this kind of annotation to improve the automatic classification of basic emotions.

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

continuous emotion model
feature selection


Emergency situations supported by context-aware and application streaming technologies Emergency Telecommunications (EMTEL) deal with provisioning of telecommunications services in emergency situations; these can range from an individual in a state of personal emergency (with need to make an emergency call due to sudden illness, traffic accident, fire) to a very broad perspective of serious disruptions (earthquakes, floods, terrorist attacks). EMTEL covers the telecommunications needs of public safety resources, like: police, fire-fighters, ambulances and other medical services: such services usually rely on dedicated networks and equipment. We realised PICO (control platforms and delivery of services in converged networks) a platform for service delivery and emergency management on public telecommunications networks. PICO platform leverages on application streaming on Android OS and a context-aware system for fixed-mobile convergence based on IP Multimedia Subsystem (IMS).

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

emergency communications
fixed-mobile convergence
context-awareness


Interior Medial Axis Transform computation of 3D objects bound by free-form surfaces This paper presents an algorithm for generating the Interior Medial Axis Transform (iMAT) of 3D objects with free-form boundaries. The algorithm proposed uses the exact representation of the part and generates an approximate rational spline description of the iMAT. The algorithm generates the iMAT by a tracing technique that marches along the objects boundary. The level of approximation is controlled by the choice of the step size in the tracing procedure. Criteria based on distance and local curvature of boundary entities are used to identify the junction points and the search for these junction points is done in an efficient way. The algorithm works for multiply-connected objects as well. Results of the implementation are provided.

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

voronoi diagram
skeleton
free-form boundaries


Computer generation of random variables with Lindley or Poisson-Lindley distribution via the Lambert W function We provide procedures to generate random variables with Lindley distribution, and also with Poisson Lindley or zero-truncated Poisson Lindley distribution, as simple alternatives to the existing algorithms. Our procedures are based on the fact that the quantile functions of these probability distributions can be expressed in closed form in terms of the Lambert W function. As a consequence, the extreme order statistics from the above distributions can also be computer generated in a straightforward manner. (C) 2010 IMACS. Published by Elsevier B.V. All rights reserved.

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


Due-date assignment and machine scheduling in a low machine-rate situation with stochastic processing times Due date assignment combined with shop floor scheduling has attracted enormous amount of research, in recent years. In many make-to-order situations, the processing times are not known exactly in advance. Further, machine rates are not constant at different times. We assume the case where the machine rate is low at the beginning of the scheduling horizon. However, it can be brought back to normal rate by performing a maintenance activity. The problem includes assigning due-dates and scheduling the jobs and maintenance activity on a single machine where the processing times are stochastic. The objective is minimizing the total cost of lengths of quoted due-dates and expected deviations of completion times from declared due-dates. The optimal solutions of medium-sized problems are found by solving some nonlinear programming models. For larger problems, robust metaheuristics are developed and their performances are statistically analyzed.

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

stochastic processing times
maintenance activity
nonlinear programming
robust metaheuristics


a cooperative cache architecture in support of caching multimedia objects in manets This paper presents a cooperative caching architecture suitable for continuous media (CM) proxy caching in MANET environments. The proposed scheme introduces an application manager component, which is interposed between traditional Internet CM applications and the network layer. The application manager transparently performs data location and service migration of active CM streaming sessions so as to exploit nearby data sources based on the dynamic topology of a MANET. We propose two data location schemes - Cache-State - a link-state based scheme and Reactive - an on-demand scheme. Since service migration can occur frequently, the application manager uses soft-state signaling techniques to communicate between remote application managers by translating hard-state application signaling, such as Real Time Streaming Protocol (RTSP) into soft-state messages. The proposed schemes are evaluated through simulation studies using the NS simulator. Simulation studies show that both Cache-State and Reactive schemes demonstrate significant QoS improvements and reduced bandwidth consumption.

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

network
manet
media
applications
simulation
signaling
service migration
paper
component
cache
proxy
environments
exploit
dynamic
architecture
qos
multimedia
bandwidth
data
layer
demonstrate
support
internet
caching
scheme

communication
activation
streams
object
topologies
continuous media streaming
mobile ad-hoc networks
real-time
linking
management
locatability
message
cooperation
continuation


Introducing semantic variables in mixed distance measures: Impact on hierarchical clustering Today, it is well known that taking into account the semantic information available for categorical variables sensibly improves the meaningfulness of the final results of any analysis. The paper presents a generalization of mixed Giberts metrics, which originally handled numerical and categorical variables, to include also semantic variables. Semantic variables are defined as categorical variables related to a reference ontology (ontologies are formal structures to model semantic relationships between the concepts of a certain domain). The superconcept-based distance (SCD) is introduced to compare semantic variables taking into account the information provided by the reference ontology. A benchmark shows the good performance of SCD with respect to other proposals, taken from the literature, to compare semantic features. Mixed Giberts metrics is generalized incorporating SCD. Finally, two real applications based on touristic data show the impact of the generalized Giberts metrics in clustering procedures and, in consequence, the impact of taking into account the reference ontology in clustering. The main conclusion is that the reference ontology, when available, can sensibly improve the meaningfulness of the final clusters.

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

clustering
metrics
numerical and categorical variables
ontology


a new synthesis technique for multilevel combinational circuits A conceptually simple method for multilevel synthesis of combinational functions is proposed. The method can take advantage of the availability of different gate types, including XOR, with the synthesis decisions being easily correlated to the topology of the circuit obtained. A function is synthesized using a cascade of mapping stages, which transform the function into one that is trivial to implement, called the goal function. The goal function---usually simple---is selected at the outset, then used to guide the definition of the transformations to be implemented by the mapping stages. The resulting circuits are well suited for CMOS implementations and are shown to be easily and/or robustly testable for stuck-open faults. Finally, from a sample of small functions, preliminary results indicate that the resulting circuits are of comparable size to those obtained by conventional minimization techniques. Further work is needed to compare these results to those of existing multilevel synthesis algorithms.

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

availability method size definition types combinational synthesis circuits

combinational circuit
testing
functional
implementation
topologies
fault
mappings
algorithm
sampling
transformation
minimal


Low-power pipelined LMS adaptive filter architectures with minimal adaptation delay1 The use of delayed coefficient adaptation in the least mean square (LMS) algorithm has enabled the design of pipelined architectures for real-time transversal adaptive filtering. However, the convergence speed of this delayed LMS (DLMS) algorithm, when compared with that of the standard LMS algorithm, is degraded and worsens with increase in the adaptation delay. Existing pipelined DLMS architectures have large adaptation delay and hence degraded convergence speed. We in this paper, first present a pipelined DLMS architecture with minimal adaptation delay for any given sampling rate. The architecture is synthesized by using a number of function preserving transformations on the signal flow graph representation of the DLMS algorithm. With the use of carry-save arithmetic, the pipelined architecture can support high sampling rates, limited only by the delay of a full adder and a 2-to-1 multiplexer. In the second part of this paper, we extend the synthesis methodology described in the first part, to synthesize pipelined DLMS architectures whose power dissipation meets a specified budget. This low-power architecture exploits the parallelism in the DLMS algorithm to meet the required computational throughput. The architecture exhibits a novel tradeoff between algorithmic performance (convergence speed) and power dissipation.

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

adaptive filtering
pipelined architectures

least mean squares algorithm
low power
systolic architectures
configurable processor array


error-resilient low-power viterbi decoders Two low-power Viterbi decoder (VD) architectures are presented in this paper. In the first, limited decision errors are introduced in the add-compare-select units (ACSUs) of a VD to reduce their critical path delays so that they can be operated at lower supply voltages in absence of timing errors. In the second one, we allow data-dependent timing errors which occur whenever a critical path in the ACSU is excited. Algorithmic noise-tolerance (ANT) is then applied at the level of the ACSU to correct for these errors. Power reduction in this design is achieved by either overscaling the supply voltage ( voltage overscaling (VOS)) or designing at the nominal process corner and supply voltage ( average-case design ). Power savings in the first and second design are 58\% and 40\% at a coding loss of 0:15 dB and 1:1 dB respectively in a IBM 130nm CMOS process.

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

error resilient
process variations
algorithmic noise tolerance
low power


On second order homogeneous linear differential equations with Liouvillian solutions We determine all minimal polynomials for second order homogeneous linear differential equations with algebraic solutions decomposed into invariants and we show how easily one can recover the known conditions on differential Galois groups [10, 17, 24] using invariant theory. Applying these conditions and the differential invariants of a differential equation we deduce an alternative method to the algorithms given in [10, 18, 24] for computing Liouvillian solutions. For irreducible second order equations our method determines solutions by formulas in all but three cases.

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

differential equations
liouvillian solutions
invariants

differential galois theory
differential invariants


Open questions on Product Lifecycle Management (PLM) with CAD /CAE integration Nowadays, manufacturing industries have to shorten the time to market in order to satisfy needs of customers and to survive in global competitive markets. For these reasons a new type of product data development and management is necessary. The Product Lifecycle Management (PLM) is an emerging philosophy to improve strategic engineering for managing information, processes and resources to support the life cycle of a product, from its conception, development, launch and the withdrawal. The well-established technologies CAD / CAE / CAM are fundamental part of it, although their interactions may be only partially involved. The paper takes into account open questions regarding the relationship between models and simulations and new possible scenarios related to their integration starting from a complete and multi-disciplinary case-test involving the virtual-experimental deliverable process of the fatigue life prediction and related structural modification design applied to a suspension cab for truck vehicle.

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

cad / cae integration
experimental measurements
parametric design


On special strong differential subordinations using Saldgean and Ruscheweyh operators In the present paper we establish several strong differential subordinations regardind the new operator L-a(n), given by L-a(n) : A(zeta)* -> A(zeta)*, L-a(n) f(z, zeta) = (1 - alpha) R-n f (z, zeta) + alpha S-n f(z, zeta), where R-n f (z, zeta) denote the Ruscheweyh derivative, S-n f (z, zeta) is the Salagean operator and A(n zeta)* = {f is an element of H(U x (U) over bar), f(z, zeta) = z + a(n+1) (zeta) z(n+1) + ..., z is an element of U, zeta is an element of (U) over bar} is the class of normalized analytic functions with A(1 zeta)* = A(zeta)*.

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

strong differential subordination
univalent function
convex function
best dominant
differential operator


Investments in enterprise integration technology: An event study This study examines stock market reactions to investments in enterprise resource planning and enterprise application integration technologies, using signaling theory concepts as explaining theory. The empirical results presented in this paper indicate that financial markets differentiate among technologies that companies invest in to integrate their information systems. In addition, this study confirms that technology maturity, financial health of the investing company, and stock market conditions are important factors influencing the stock market reaction.

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

enterprise application integration
enterprise resource planning
event study
integration technology
signaling theory


GSM: gateway selection mechanism for strengthening inter-cluster coordination in cognitive radio ad hoc networks In the open access spectrum paradigm, the dynamics of the available spectrum heterogeneity due to the geographical location of various cognitive radio/secondary users (SUs) and primary users (PUs) prevent the assignment of a single common control channel to every SU. Thus, depending on channel availability, SUs are forced to form clusters to solve the problem of control channel assignment. However, the sudden appearance of a PU may lead to loss of intra-cluster or inter-cluster connectivity among SUs. This problem can be resolved by improving the cluster formation process and selecting suitable gateway nodes for inter-cluster coordination. In this paper, our goal is to improve inter-cluster connectivity by selecting more appropriate gateway nodes for inter-cluster coordination. We therefore propose an inter-cluster gateway node selection mechanism that strengthens inter-cluster coordination. Our scheme shows significant improvement in terms of inter-cluster connectivity compared with related work.

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

cognitive radio
control channel
gateway selection


tamper proofing mechanisms for motion capture data Repositories of motion captured (Mocap) data can be reused for human motion analysis in physical medicine, biomechanics, and animation related entertainment industry. Mocap data expressed as a matrix can be subject to tampering from shuffling of its elements or change in element values due to motion editing operations. Tampering of the archival system intentionally or due to machine/human errors, may result in loss of research, money and effort. In order to detect and correct errors induced due to tampering; this paper proposes a tamper proofing methodology that combines hash function and watermarking based methods. These patterns (fingerprints) resulting from hash functions help in error detection by identifying the type of attack such as row shuffling, column shuffling, row element shuffling, column element shuffling and their combinations. Random attacks that change data element values are detected by change in watermarks embedded in data elements. Finger prints help in solving the attacks reversal such as column shuffling and element shuffling, whereas watermarking helps in reversing attacks such as column element or row element shuffling. As compared to other attacks, random attacks cannot be reversed, and can be improved using interpolation. Analysis shows that the proposed method uses O(n) space to detect and correct errors, and the time complexity for correction varying from o(n log n) to O(n!).

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


CITA 2009, JISBD 2009, TELECOM I+D 2009 This special number of the IEEE Latin America Transactions includes a selection of the best papers presented at the three events CITA 2009, JISBD 2009 and TELECOM I+D 2009, which take place at Spain in 2009.

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

ieee latin america transactions
cita
jisbd


A quantile approach to the power transformed locationscale model The burgeoning growth of health care spending has become a major concern to policy makers, making the modeling of health care expenditure valuable in their decision-making processes. The challenges of health care expenditure analysis are two-fold: the exceptional skewness of its distribution as the top 5% of the population accounted for almost half of all spending and its heteroscedasticity. To address these concerns, the quantile regression model with power transformation has been employed, but at a price of the model complexity and analysis cost. In this article, we introduce a simpler quantile approach to the analysis of expenditure data by employing the locationscale model with an unknown link function to accommodate the heteroscedastic data with non-ignorable outliers. Specifically, in our approach a link function does not depend on quantiles; yet, it effectively fits the data as the slope coefficient depends on the quantiles. This parsimonious feature of our model helps us conduct a more intuitive and easily understood analysis for the whole distribution with fewer computational steps. Thus, it can be more widely applicable in practice. Additionally, simulation studies are conducted to investigate the model performance compared to other competing models. Analysis of the 2007 Medical Expenditure Panel Survey data using our model shows that aging and self-rated health tend to drive up costs. However, uninsured persons do not contribute to the high health cost. These findings suggest that careful monitoring of elderlys health status and a more aggressive preventive medicare system may contribute to slow down the explosion of medical costs.

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

locationscale model
medical expenditure panel survey data
power transformation
quantile regression


An image retrieval method based on color-complexity and spatial-histogram features This paper proposes two kinds of image features. One feature is the spatial-histogram feature. It combines the color histogram feature and the information about the dimensional position of pixels in an image to record the distribution of the pixels' colors that are present in different spatial positions within an image. The other image feature proposed in this paper is the color-complexity feature, which can be used to describe the change of pixel colors in the image. From the experimental results, ANMRR value is provided and we observe that the image retrieval system based on these two kinds of image features can provide a fairly good accuracy rate in image retrieval. Moreover, it has the capacity to tolerate errors; that is, for images that are damaged by rotation, shift, or color variant attacks, their similar image pairs can still be retrieved from the image database. Thus, the accuracy and flexibility of the image retrieval system are drastically improved.

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

color-based image retrieval
color complexity
k-mean


Wikipedia-based query phrase expansion in patent class search Relevance feedback methods generally suffer from topic drift caused by word ambiguities and synonymous uses of words. Topic drift is an important issue in patent information retrieval as people tend to use different expressions describing similar concepts causing low precision and recall at the same time. Furthermore, failing to retrieve relevant patents to an application during the examination process may cause legal problems caused by granting an existing invention. A possible cause of topic drift is utilizing a relevance feedback-based search method. As a way to alleviate the inherent problem, we propose a novel query phrase expansion approach utilizing semantic annotations in Wikipedia pages, trying to enrich queries with phrases disambiguating the original query words. The idea was implemented for patent search where patents are classified into a hierarchy of categories, and the analyses of the experimental results showed not only the positive roles of phrases and words in retrieving additional relevant documents through query expansion but also their contributions to alleviating the query drift problem. More specifically, our query expansion method was compared against relevance-based language model, a state-of-the-art query expansion method, to show its superiority in terms of MAP on all levels of the classification hierarchy.

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

phrase-based query expansion
wikipedia categories
clarity
retrievability


Design of U-Shaped In-Phase Power Divider Employing Ground-Slotted Technique for Wideband Applications This article describes the design of U-shaped wideband power divider implemented with ground-slotted technique. The slotlines at ground plane underneath second and third arm promises wider bandwidth performance. In this proposed designed, the second and third arms are formed by microstrip line with J-shaped slot underneath. In order to obtain the impedance and dimension of microstrip line and slot forming the quarter-wave transformer, the new equation is proposed and discussed in this paper. The relation between characteristic impedance of microstrip-slot transmission line \((Z_{\mathrm{m-s}})\) with slot width \((\hbox {W}_{\mathrm{s}})\) and microstrip impedance \((Z_{\mathrm{m}})\) is obtained by using completing square curve fitting method. To realize the circuit, substrate Rogers TMM4 is used. The thickness of the substrates is 0.508mm with dielectric constant of 4.5 and 35\(\upmu \hbox {m}\) cooper coating. The performance of power divider is formulated by using commercially available CST Microwave Studio. The performance of the fabricated device is then compared with simulation. The optimum result has been achieved over wideband frequency with the measured and simulated result show reasonably comparable performance between 4 and 11GHz.

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


LevelScheme: A level scheme drawing and scientific figure preparation system for Mathematica LevelScheme is a scientific figure preparation system for Mathematica. The main emphasis is upon the construction of level schemes, or level energy diagrams, as used in nuclear, atomic, molecular, and hadronic physics. LevelScheme also provides a general infrastructure for the preparation of publication-quality figures, including support for multipanel and inset plotting, customizable tick mark generation, and various drawing and labeling tasks. Coupled with Mathematica's plotting functions and powerful programming language, LevelScheme provides a flexible system for the creation of figures combining diagrams, mathematical plots, and data plots. Program summary Title of program: LevelScheme Catalogue identifier: ADVZ Program obtainable from: CPC Program Library, Queen's University of Belfast, N. Ireland Program summary URL: http://cpc.cs.qub.ac.uk/summaries/ADVZ Operating systems: Any which supports Mathematica; tested under Microsoft Windows XP, Macintosh OS X, and Linux Programming language used: Mathematica 4 Number of bytes in distributed program, including test and documentation: 3 05 1807 Distribution format: tar.gz Nature of problem: Creation of level scheme diagrams. Creation of publication-quality multipart figures incorporating diagrams and plots. Method of solution: A set of Mathematica packages has been developed, providing a library of level scheme drawing objects, tools for figure construction and labeling, and control code for producing the graphics. (C) 2005 Elsevier B.V. All rights reserved.

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

level scheme
drawing
plotting
figure preparation
mathematica


Lie group variational integrators for the full body problem We develop the equations of motion for full body models that describe the dynamics of rigid bodies, acting under their mutual gravity. The equations are derived using a variational approach where variations are defined on the Lie group of rigid body configurations. Both continuous equations of motion and variational integrators are developed in Lagrangian and Hamiltonian forms, and the reduction from the inertial frame to a relative frame is also carried out. The Lie group variational integrators are shown to be symplectic, to preserve conserved quantities, and to guarantee exact evolution on the configuration space. One of these variational integrators is used to simulate the dynamics of two rigid dumbbell bodies.

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

variational integrators
full body problem


The impact of corporate social responsibility in supply chain management: Multicriteria decision-making approach This paper develops a decision support framework for modeling and analysis of supply chain networks with corporate social responsibility (CSR). We consider the multicriteria decision-making behavior of the various decision makers (manufacturers, retailers, and consumers), which includes the maximization of net return, the minimization of emission, and the minimization of risk. The emission and the risk are penalized by variable weights. The model allows one to investigate the interplay of the heterogeneous decision makers in the supply chain and to compute the resultant equilibrium pattern of product outputs, transactions, product prices, and levels of social responsibility activities. The results show that social responsibility activities can potentially reduce transaction costs, risk and environmental impact.

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

supply chain networks
corporate social responsibility

environment
risk management
multicriteria optimization


Robot assistants: Applications and evolution Service robots are machines designed to work not only for human beings (like the industrial robot) but also with human beings. In addition to challenging technical problems, the application of service robots in real-life situations requires to address intriguing issues concerning their interactions with humans. We are investigating both types of problems with reference to three different case studies and real research projects: a mobile robot system primarily aimed at the assistance of patients in hospitals and institutions (the ''URMAD'' project); a mobile robot system for the assistance to the disabled and the elderly at home (the ''MOVAID'' project); and a wheelchair incorporating a robot arm (the ''IMMEDIATE'' project). The paper discusses the design of the three robotic systems as well as their practical implementation and preliminary experimental results. Finally, the paper addresses recent results which could lead to the implementation of cybernetic prostheses, that is devices which would ultimately allow to achieve real intimate physical symbiosis between human beings and artificial robotic devices.

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

robotics
mechatronics
human/machine interaction