Leaching and drying marks on photoresist-coated substrates ? In immersion lithography, the probability to leave water on a photoresist (PR) increases with the scan speed. After wet processes, in general, liquid droplets may remain on the substrates. The evaporation of these droplets coupled with the leaching of the PR produces defects. These drying defects may affect the resolution of the subsequent lithographic exposure. Beyond lithography, this interaction dropletPR is of great interest in ink-jet printing technology. Indeed, contrast and resolution depend on the pattern left after the evaporation of sessile droplets. Here, we analyze the drying speed of a sessile water droplet on a PR substrate with the aim to characterize the resulting drying marks by the dynamics of their formation and by their typical crater topography. First, we focus our study on the drying dynamics of an evaporating sessile droplet and its drying patterns left on the PR; second, we show that the contact line motion is the key feature in the generation of surface defects with a strong interaction fluid/surface despite the hydrophobicity.

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

drying
photoresist
droplet
immersion lithography


Improving the performance of data center with real-time service image placement in mobile cloud environment Mobile Cloud Computing (MCC) is broadening the ubiquitous market for mobile devices. Because of the hardware limitation of mobile devices, the heavy computing tasks should be processed by service images (SIs) on the cloud. Due to the scalability and mobility of users and services, dynamic resource demands and time-varying network condition, SIs must be re-located to adapt the new circumstances. In this paper, we formulate the SI placement as an optimization problem which minimizes the communication cost subject to resource demand constraints. We then propose a real-time SI placement scheme which includes two sequent stages of clustering/filtering and condensed placement to solve the formulated problem. The former omits the infeasible slots prior to placement in order to improve computational complexity. The latter focuses on the SI placement through a novel condensed solution. The numerical results show that our solution converges to the global optimum with a negligible gap while performing much faster execution time compared with the exhaustive search method. This improvement leverages the real-time services especially in MCC environment.

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


protecting location privacy against inference attacks GPS-enabled mobile devices are a quickly growing market and users are starting to share their location information with each other through services such as Google Latitude. Location information, however, is very privacy-sensitive, since it can be used to infer activities, preferences, relationships, and other personal information, and thus access to it must be carefully protected. The situation is complicated by the possibility of inferring a users' location information from previous (or even future) movements. We argue that such inference means that traditional access control models that make a binary decision on whether a piece of information is released or not are not sufficient, and new policies must be designed that ensure that private information is not revealed either directly or through inference. We provide a formal definition of location privacy that incorporates an adversary's ability to predict location and discuss possible implementation of access control mechanisms that satisfy this definition. To support our reasoning, we analyze a preliminary data set to evaluate the accuracy of location prediction.

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


Avionic fibre-optic harnessing It is not the intention of this paper to discuss the potential advantages of fibre-optic technology, as applied to aircraft control and communication systems, as these have been widely discussed in the literature, with a wide range of novel sensing techniques and systems architectures being reported. Rather, it is the authors intention to provide an insight into some of the specific issues relating to the application and through life support, on aircraft, of the optical interconnection hardware required to enable such systems. The content of this paper is drawn largely from the work carried out within the framework of the DTI CARAD and MoD funded Fibre-Optic Harness Study, Phase II.

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

avionic fibre-optic harnessing
harness study consortium
test and measurement
termination methods and tools
looming practices and installation
inspection and fault analysis
repair and maintenance


Zero-Cross-Correlation Properties of Asymmetric ZCZ Sequence Sets Recently, asymmetric zero-correlation zone (A-ZCZ) sequence sets that are composed of several sequence subsets have been proposed. In A-ZCZ sequence sets, the zero-cross-con-elation zone (ZCCZ) length between different sequence subsets is larger than the zero-correlation zone (ZCZ) length in each sequence subset. However, the ZCCZ length between different sequence subsets was not precisely shown in previous studies. The present letter shows precisely the ZCCZ length between different sequence subsets. This information is useful for estimating the magnitude of inter-cell interference when designing approximately synchronized code-division multiple-access (AS-CDMA) systems.

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

zero-cross-correlation zone
as-cdma
zcz sequence sets
spreading sequences


Optimizing the selection of partners in production networks Non-hierarchical regional production networks are the vision of a virtual enterprise model which is investigated in a collaborative research center at Chemnitz University of Technology. In the center of interest is the development of a virtual enterprise model which is based on small performance unitsthe so-called competence cells. The general intention of this model is to improve the competitiveness of small and medium-sized enterprises, which results from the enterprise-spanning cooperation of the participants. Thus, the concentration on the own core competences is supported and the market power is contemporaneously increased by the help of the network. The possibly automated selection of the partners is one of the major problems in virtual enterprises. Therefore, we introduce a method for choosing the most capable competence cells from a pool of potential competence cells. The selected competence cells fulfil the tasks of a value chain particularly well. Within our approach, this problem will be solved using Ant Colony Optimization. Additionally, social facts will also be considered in order to select the suitable competence cells for the network.

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

virtual enterprise
ant colony optimization


A systematic literature review of stakeholder identification methods in requirements elicitation This paper presents a systematic review of relevant published studies related to topics in Requirements Engineering, specifically, concerning stakeholder identification methods in requirements elicitation, dated from 1984 to 2011. Addressing four specific research questions, this systematic literature review shows the following evidence gathered from these studies: current status of stakeholder identification in software requirement elicitation, the best practices recommended for its performance, consequences of incorrect identification in requirements quality, and, aspects which need to be improved. Our findings suggest that the analyzed approaches still have serious limitations in terms of covering all aspects of stakeholder identification as an important part of requirements elicitation. However, through correctly identifying and understanding the stakeholders, it is possible to develop high quality software.

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

systematic review
requirements engineering
stakeholder identification
requirements elicitation


AdamsBashforth and AdamsMoulton methods for solving differential Riccati equations Differential Riccati equations play a fundamental role in control theory, for example, optimal control, filtering and estimation, decoupling and order reduction, etc. In this paper several algorithms for solving differential Riccati equations based on AdamsBashforth and AdamsMoulton methods are described. The AdamsBashforth methods allow us explicitly to compute the approximate solution at an instant time from the solutions in previous instants. In each step of AdamsMoulton methods an algebraic matrix Riccati equation (AMRE) is obtained, which is solved by means of Newtons method. Nine algorithms are considered for solving the AMRE: a Sylvester algorithm, an iterative generalized minimum residual (GMRES) algorithm, a fixed-point algorithm and six combined algorithms. Since the above algorithms have a similar structure, it is possible to design a general and efficient algorithm that uses one algorithm or another depending on the considered differential matrix Riccati equation. MATLAB versions of the above algorithms are developed, comparing precision and computational costs, after numerous tests on five case studies.

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

adamsbashforth methods
adamsmoulton methods

differential matrix riccati equation (dmre)

algebraic matrix riccati equation (amre)

algebraic matrix sylvester equation (amse)


Combining decomposition and reduction for state space analysis of a self-stabilizing system Fault tolerance measures of distributed systems can be calculated precisely by state space analysis of the Markov chain corresponding to the product of the system components. The power of such an approach is inherently confined by the state space explosion, i.e. the exponential growth of the Markov chain in the size of the underlying system. We propose a decompositional method to alleviate this limitation. Lumping is a well-known reduction technique facilitating computation of the relevant measures on the quotient of the Markov chain under lumping equivalence. In order to avoid computation of lumping equivalences on intractably large Markov chains, we propose a system decomposition supporting local lumping on the considerably smaller Markov chains of the subsystems. Recomposing the lumped Markov chains of the subsystems constructs a lumped transition model of the whole system, thus avoiding the construction of the full product chain. An example demonstrates how the limiting window availability (i.e. a particular fault tolerance measure) can be computed for a self-stabilizing system exploiting lumping and decomposition. (C) 2013 Elsevier Inc. All rights reserved.

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

fault tolerance
markov chains
limiting window availability

self stabilization
probabilistic model checking
probabilistic bisimilarity


To be fair or efficient or a bit of both ? Introducing a new concept of (?,?) ( ? , ? ) -fairness, which allows for a bounded fairness compromise, so that a source is allocated a rate neither less than 0???1 0 ? ? ? 1 , nor more than ??1 ? ? 1 , times its fair share, this paper provides a framework to optimize efficiency (utilization, throughput or revenue) subject to fairness constraints in a general telecommunications network for an arbitrary fairness criterion and cost functions. We formulate a non-linear program (NLP) that finds the optimal bandwidth allocation by maximizing efficiency subject to (?,?) ( ? , ? ) -fairness constraints. This leads to what we call an efficiencyfairness function, which shows the benefit in efficiency as a function of the extent to which fairness is compromised. To solve the NLP we use two algorithms. The first is a well-known branch-and-bound-based algorithm called Lipschitz Global Optimization and the second is a recently developed algorithm called Algorithm for Global Optimization Problems (AGOP). We demonstrate the applicability of the framework to a range of examples from sharing a single link to efficiency fairness issues associated with serving customers in remote communities.

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

non-linear programming
utility optimization
efficiencyfairness tradeoff


Socio-technical considerations in epilepsy electronic patient record implementation Examination of electronic patient record (EPR) implementation at the socio-technical interface. This study was based on the introduction of an anti-epileptic drug (AED) management module of an EPR in an epilepsy out-patient clinic. The objective was to introduce the module to a live clinical setting within strictly controlled conditions to evaluate its usability and usefulness. Qualitative and quantitative methods were employed in an observational field study. A purposeful sample of specialists in epilepsy care (2 doctors and 2 nurses) was recruited. Perception of usefulness and ease of use of the AED module, impact on work processes, and accuracy of use were evaluated using feedback meetings, evaluation forms, ethnographic analysis and data validation techniques. Emerging issues were grouped into three key themes: human, organisational and technological. The electronic patient record use was studied for 49 patients over the course of 18 out-patient clinics. While participants varied in their approach to interacting with the AED module, they expressed satisfaction with its usability and performance. The necessary co-existence of the paper and electronic record, and changes to customary work practice were considered the biggest challenges. 82% accuracy in the use of the electronic record was determined. Achieving successful electronic patient record implementation is complex. While technical challenges exist, it is possibly more important to acknowledge the social considerations. Initially, an increase in medical record fragmentation and disruption to workflow can arise with the introduction of the technology. Realising the benefits of electronic patient records will require the management of a lengthy transition phase.

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 O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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
computerised medical records
informatics
evaluation studies
chronic diseases


A loop transformation algorithm for communication overlapping Overlapping communication with computation is a well-known approach to improving performance. Previous research has focused on optimizations performed by the programmer. This paper presents a compiler algorithm that automatically determines the appropriate loop indices of a given nested loop and applies loop interchange and tiling in order to overlap communication with computation. The algorithm avoids generating redundant communication by providing a framework for combining information on data dependence, communication. and reuse. It also describes a method of generating messages to exchange data between processors for riled loops on distributed memory machines. The algorithm has been implemented in our High Performance Fortran (HPF) compiler, and experimental results have shown its effectiveness on distributed memory machines, such;ts the RISC System/6000 Scalable POWERparallel System. This paper also discusses the architectural problems of efficient optimization.

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

overlapping communication with computation


Visualizing evolving scalar phenomena ? Visualizing 3D continuum or time-varying simulation (scalar) datasets is difficult because of the immense amount of data to be processed and understood. Furthermore, these datasets may contain many evolving amorphous regions, making it difficult to visually follow features of interest. In this paper, we present a process for analyzing continuum datasets and review some of our previous work on feature tracking. We show how the tracking information can be used to enhance standard rendering and enable new visualizations. The tracking is demonstrated on different application domains including turbulence, weather and inlet design.

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

scientific visualization
multi-dimensional visualization
computer vision
cfd
isosurfaces
volume rendering


Message Authentication in Computationally Constrained Environments RFID and Wireless Sensor Networks exemplify computationally constrained environments, where the compact nature of the components cannot support complex computations or high communication overhead. On the other hand, such components should support security applications such as message integrity, authentication, and time stamping. The latter are efficiently implemented by Hash Message Authentication Codes (HMAC). As clearly stated in the literature, current approved implementations of HMAC require resources that cannot be supported in constrained components. An approach to implement a compact HMAC by the use of stream ciphering is presented in this paper.

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

secured communications
challenge response
stream ciphers


Expert systems: A survey of their use in UK business A number of surveys have been carried out in the past ten years on the use of expert systems in business. This paper compares previous survey findings with a new one undertaken in the Spring of 1994; it finds significant differences in the level of use of expert systems. One thousand companies across the UK were surveyed regarding their use of information systems in general and expert systems in particular, and the results are discussed in this paper. A response rate of 22.5% showed that 50 out of 214 organisations, use expert systems for a variety of applications, ranging from strategic to operational. The analysis identifies users of expert systems by organisation size and industry sector. It also highlights their reasons for use. The paper concludes by identifying the perceived business benefits and the relative costs involved with the purchase or development of an expert system, as identified by the organisations.

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

survey of expert system use in uk business


Open shop scheduling with makespan and total completion time criteria In this paper we study the two machine open shop scheduling problem with a hierarchical objective: minimize the total completion time subject to minimum makespan, We show that this problem is distinct from the closely related problem of minimizing the total completion time. We develop polynomial-time algorithms for three special cases and an asymptotically optimal polynomial-time heuristic when a machine is dominant. We also extend some of our results to the three machine open shop case.

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


Analysis and implementation of multiple-input, multiple-output VBLAST receiver from area and power efficiency perspective This paper presents an analysis of the vertical Bell Laboratories layered space time (VBLAST) receiver used in a multiple-input multiple-output (MIMO) wireless system from the hardware implementation perspective and identifies those processing elements that consume more area and power due to complex signal processing. This paper models a scalable VBLAST receiver based on minimum mean square error (MMSE) nulling criteria assuming a block flat fading channel. After identifying the major area and power consuming blocks, this paper proposes two area and power efficient VLSI architectures for the block that computes pseudoinverse of the channel matrix. This paper discusses different tradeoff issues in both architectures and compares them with the architectures in the literature.

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

multiple-input multiple-output (mimo) wireless system

vertical bell laboratories layered space time (vblast)


Stochastic maximum principle for optimal control under uncertainty Optimal control problems involve the difficult task of determining time-varying profiles through dynamic optimization. Such problems become even more complex in practical situations where handling time dependent uncertainties becomes an important issue. Approaches to stochastic optimal control problems have been reported in the finance literature and are based on real option theory, combining Ito's Lemma and the dynamic programming formulation. This paper describes a new approach to stochastic optimal control problems in which the stochastic dynamic programming formulation is converted into a stochastic maximum principle formulation. An application of such method has been reported by Rico-Ramirez et al. (Computers and Chemical Engineering, 2003, 27, 1867) but no details of the derivation were provided. The main significance of this approach is that the solution to the partial differential equations involved in the dynamic programming formulation is avoided. The classical isoperimetric problem illustrates this approach. (C) 2004 Elsevier Ltd. All rights reserved.

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

stochastic optimal control
stochastic maximum principle


Knowledge management within collaboration processes: A perspective modeling and analyzing methodology Collaborative projects are relatively complex and. hence, are difficult to handle. Managing distributed knowledge among stakeholders in a systematic way is crucial to improving the collaboration productivity. This article provides a generic modeling approach that explicitly represents the perspectives of stakeholders and their evolution traversing a collaborative process. This approach provides a mechanism to analytically identify, the interdependencies among stakeholders and to detect conflicts and reveal their intricate causes and effects. Collaboration is thus improved through efficient knowledge management. This article also introduces a Web-based information system that uses the perspective model and the social network analysis methodology to support knowledge management within collaboration.

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

collaboration processes
knowledge management
perspective modeling


Implementation and evaluation of directory hints in CC-NUMA multiprocessors ? Directory hints (DHs) help a node in a cache coherent non-uniform memory (CC-NUMA) shared memory multiprocessor to keep track of where valid copies of a memory block may reside. With this information the node can fetch the block directly from those nodes on a read miss (RM). In this way the number of network transactions to serve the miss may be reduced and the expensive directory lookup operation may be removed from the critical path. In this paper, we discuss the issues involved in implementing the DH scheme on a CC-NUMA shared memory multiprocessor and examine one such implementation, which employs a small and fast cache to store the hints. Our simulation results show that the DH scheme can effectively reduce the read stall time. Also its performance is very competitive compared with a more expensive implementation which uses a large level-three cache. A drawback of the scheme is that it will introduce extra network traffic. We believe that the state-of-the-art interconnection networks, such as those built upon the SGI Spider [M. Galles, Scalable pipelined interconnect for distributed endpoint routing: the SGI SPIDER chip, in: Proc. Internat. Symp. on High Performance Interconnects (Hot Interconnects 4), 1996] and the Intel Cavallino [J. Carbonaro, F. Verhoorn, Cavallino: the TeraFlops router and Nic, in: Proc. Internat. Symp. on High Performance Interconnects (Hot Interconnects 4), 1996] chips, provide the opportunity to make the DH scheme feasible even with the slower network such as the one built by Myrinet switches (N.J. Boden et al., Myrinet: a gigabit-per-second local area network, in: IEEE Micro, 1995, p. 29).

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

cc-numa multiprocessor
remote read latency
interconnection network
performance evaluation


the computer background of incoming freshman: looking for emerging trends As part of a longitudinal study begun in 1985, incoming Bentley College freshmen were asked to complete questionnaires about their pre-college computer experience. Although nearly all students came from high schools with computers and more than 80\% of them had studied BASIC, just under half had used a word processor. Even fewer (less than 20\%) had used either a spreadsheet or a database management system, though the actual percentage has risen over the three years for which data exist. The increase in the number of schools teaching Pascal noticed between 1984 and 1985 persisted in 1986. However, though nearly 46\% of the schools from which 1986 graduates came taught Pascal, only half that percentage actually studied the language. Almost half the students used computers outside school during their high school years, but most of that use involved playing games.

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

processor
high school
use
language
games
data
teaching
experience
spreadsheet

play
database management systems
longitudinal studies
computation
questionnaire
completeness
student


A high-capacity steganographic approach for 3D polygonal meshes We present a high-capacity steganographic approach for three-dimensional (3D) polygonal meshes. We first use the representation information of a 3D model to embed messages. Our approach successfully combines both the spatial domain and the representation domain for steganography. In the spatial domain, every vertex of a 3D polygonal mesh can be represented by at least three bits using a modified multi-level embed procedure (MMLEP). In the representation domain, the representation order of vertices and polygons and even the topology information of polygons can be represented with an average of six bits per vertex using the proposed representation rearrangement procedure (RRP). Experimental results show that the proposed technique is efficient and secure, has high capacity and low distortion, and is robust against affine transformations. Our technique is a feasible alternative to other steganographic approaches.

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

steganography
spatial domain
representation domain


Regarding the accuracy of optimal eighth-order methods It is widely known that when the order of root solvers increases, their accuracy comes up as well. In light of this, most of the researchers in this field of study have tried to increase the order of known schemes for obtaining optimal three-step eighth-order methods in which there are four evaluations per iteration. The aim of this article is to challenge this standpoint when the starting points are in the vicinity of the root, but not so close. Toward this end, a novel method of order six with the same number of evaluations per iteration is suggested and demonstrated while its accuracy is better than the accuracy of optimal eighth-order schemes for such initial guesses. The superiority of the developed technique is confirmed by numerical examples. (C) 2010 Elsevier Ltd. All rights reserved.

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

optimal eighth-order methods
order of convergence
convergence radius
efficiency index.


binary search trees and file organization Binary search trees are an important technique for organizing large files, because they are efficient for both random and sequential access of records, and for modification of a file. Because of this, they have received a great deal of attention in recent years, and their properties are now better understood than those of most other file organization methods. This paper surveys the main results which have been obtained.

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


Intermedia Synchronization Protocol for Continuous Media Using MPEG-4 in Mobile Distributed Systems The preservation of temporal dependencies among a group of processes that exchange continuous media at runtime is a key issue for emerging mobile distributed systems (MDS), such as monitoring of biosignals and interactive multiuser games. Although several works are oriented to satisfy temporal dependencies, most of them are not suitable for MDSs. In general, an MDS is characterized by the absence of global references (e. g. shared memory and wall clock), host mobility, limited processing and storage capabilities in mobile hosts, and limited bandwidth on wireless communication channels. This paper proposes an asymmetric synchronization protocol to be used at runtime in an MDS without using a common reference. One main aspect of our synchronization protocol is that it translates temporal constraints to causal dependencies of the continuous media data as seen by the mobile hosts. We simulate the protocol by considering a cellular network environment and by using MPEG-4 encoders. The simulation results show that our protocol is effective in reducing the synchronization error. In addition, the protocol is efficient in terms of processing and storage costs at the mobile devices, as well as in the overhead attached per message across the wired and wireless channels.

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

mobile distributed system
synchronization mechanism


an integrated hardware-software approach to flexible transactional memory There has been considerable recent interest in both hardware andsoftware transactional memory (TM). We present an intermediateapproach, in which hardware serves to accelerate a TM implementation controlled fundamentally by software. Specifically, we describe an alert on update mechanism (AOU) that allows a thread to receive fast, asynchronous notification when previously-identified lines are written by other threads, and a programmable data isolation mechanism (PDI) that allows a thread to hide its speculative writes from other threads, ignoring conflicts, until software decides to make them visible. These mechanisms reduce bookkeeping, validation, and copying overheads without constraining software policy on a host of design decisions. We have used AOU and PDI to implement a hardwareacceleratedsoftware transactional memory system we call RTM. We have also used AOU alone to create a simpler "RTM-Lite". Across a range of microbenchmarks, RTM outperforms RSTM, a publicly available software transactional memory system, by as much as 8.7x (geometric mean of 3.5x) in single-thread mode. At 16 threads, it outperforms RSTM by as much as 5x, with an average speedup of 2x. Performance degrades gracefully when transactions overflow hardware structures. RTM-Lite is slightly faster than RTM for transactions that modify only small objects; full RTM is significantly faster when objects are large. In a strongargument for policy flexibility, we find that the choice between eager (first-access) and lazy (commit-time) conflict detection can lead to significant performance differences in both directions, depending on application characteristics.

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

transactional memory
speedup
policy
conflict
performance
design
rstm
flexibility
notification
thread
software
detection
implementation
mean
data
hardware
update

applications
software transactional memories
object
direct
timing
access
cache coherence
multiprocessors
systems
asynchronicity
speculating
commit
transaction
isolates
integrability
programmer


Water uptake of a low-? dielectric film: Combining capacitance and gravimetric measurements Moisture uptake of a benzocyclobutene (BCB) film has been investigated by using the capacitance-time (C-t) measurement method. The change in the permittivity at 80% relative humidity (RH) at room temperature in saturation is about 1.54%. To derive the absolute amount of water molecules from the change in capacitance an appropriate electrical model is required. For the direct measurement of the amount of water molecules in the BCB film gravimetric measurements have been performed at the same environmental conditions by using a quartz crystal microbalance (QCM). In saturation the change in mass induced by the moisture uptake is only about 0.14%. However, the application of the Debye equation using the dipole moment of water vapor yielded an excellent agreement between electrical and physical measurements.

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

moisture uptake
gravimetric measurements

low-? film
capacitance-time measurements


Mapping rectangular mesh algorithms onto asymptotically space-optimal arrays This paper deals with the systematic synthesis of space optimal arrays. As a target example, an asymptotically space-optimal array for N-x x N-y x N-z rectangular mesh algorithms with affine schedule ai + bj + ck + d is designed. The obtained bound improves the best previously known ones. The key idea underlying our approach is to compress the initial index domain along a number of directions in order to obtain a new domain that is more suitable for the application of projection methods. (C) 2003 Elsevier Inc. All rights reserved.

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

system of uniform recurrence equations dependence vector


authenticating public access networking The University of Pittsburgh began offering network connections to residence hall students in 1998. Initially, students were assigned static IP addresses and manual processes were implemented to record the each computer's network card MAC address. This quickly became unwieldy as service was expanded to all of the nearly 6,000 residence hall rooms. In 2000, DHCP was used to provide student IP addresses in conjunction with registration software to record the necessary machine information. Tracing activity in response to security issues was still time-consuming because of the time needed to research activity logs.The adaptation of the Point-to-Point Protocol (PPP) for broadband use by commercial Internet Services Providers (ISP's) provided a much simpler solution for registering users, and providing IP addresses. Direct user authentication to the network is accomplished by requiring the entry of a username and password each time the user establishes a connection. Tracing specific activity is simplified because it is not necessary to research different sets of logs to determine the IP address and username. Management of the system is entirely dynamic. The system can be used just as easily for ports located in public areas, classrooms, and in conjunction with wireless network services. The need for authenticated access to the network from these locations is even more important than from the residence halls.Although PPPoE has been used for authenticated access in the residence halls during the past academic year, this service will be converted to the IEEE 802.1x standard, which eliminates the requirement for client authentication software in the coming year. Our experience with PPPoE is that support requirements are very low and are primarily limited to client software installation assistance. Further reduction of support requirements is expected with the introduction of 802.1x authentication for residence hall, public access, classroom, and wireless network connections.

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

wireless networking authentication dhcp pppoe

ldap
directory
active directory
kerberos
nds


The costs and benefits of commonality in assemble-to-order systems with a (Q,r)-policy for component replenishment In assemble-to-order systems, it has been shown that replacing a number of specific components by a smaller number of general-purpose, common components can reduce required safety stock levels due to the benefits of risk pooling. Previous research using single-period models has shown that even if the common components are somewhat more expensive than the unique components they replace, the benefits of risk pooling often outweigh the added purchasing costs. However, this has been shown often not to be the case with multiple-period models in the long run, the added purchasing costs dominate the benefits of risk pooling. However, both single- and multiple-period models ignore one of the benefits of commonality order pooling. With commonality, demand is pooled into a smaller number of components, reducing the required number of orders (or setups). After re-optimizing the order quantities and order intervals, both the ordering costs and cyclic carrying costs are reduced. This paper develops a model to consider the assemble-to-order environment where components are replenished according to a (Q,r)-policy. Results show that order pooling is a significant benefit; in many cases it is much more important than the risk-pooling benefit. In contrast to multiple-period models, there is often a total cost benefit with commonality, even when the common component is several percent more expensive than the unique components it replaces.

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


Representation of urban buildings using modified relief mapping This paper describes the real-time mapping displacement of buildings onto the polygon model of base terrain of geo-spatial information. The buildings are represented as height maps, leading to low memory requirements and not involving changes of the original geometry (i.e., no vertices are created or displaced). The displacement of buildings is mapped toward the protruding direction. The base of texture which represents the ground in topography is correctly mapped onto base polygon without any distortion. This approach can exhibit the correct occlusions between buildings and ground due to parallax and correct self-occlusion.

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

aerial photograph
digital map
displacement mapping
geo-visualization
image-based rendering


Angular acceleration estimation and feedback control: An experimental investigation Angular acceleration estimation and its application in acceleration feedback control are investigated experimentally in the paper. In combination of Newton Predictor (NP) with Kalman Filter (KF), a new predictive estimator for angular acceleration, called Newton Predictor Enhanced Kalman Filter (NPEKF) is proposed. This estimator provides a wide bandwidth and a small phase lag of the estimated acceleration while attenuating noises. Based on the estimated acceleration an acceleration feedback control (AFC) is presented for multiple degree-of-freedom (DOF) mechatronic system. The design of AFC is specified in terms of its stability and ability in suppressing dynamic disturbances. Experiments are conducted on a 2-DOF direct-drive manipulator. The frequency responses of the acceleration estimated by NP, KF and NPEKF are compared with those of the measured acceleration via linear accelerometer. The performance of AFC using the estimated acceleration is assessed against that using the measured acceleration. This study has shown that the proposed NPEKF estimator is able to supply the AFC with reliable required acceleration. (C) 2007 Elsevier Ltd. All rights reserved.

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

acceleration estimation
newton predictor
kalman filter
acceleration feedback control


lightweight computational steering of very large scale molecular dynamics simulations We present a computational steering approach for controlling, analyzing, and visualizing very large scale molecular dynamics simulations involving tens to hundreds of millions of atoms. Our approach relies on extensible scripting languages and an easy to use tool for building extensions and modules. The system is extremely easy to modify, works with existing C code, is memory efficient, and can be used from inexpensive workstations and networks. We demonstrate how we have used this system to manipulate data from production MD simulations involving as many as 104 million atoms running on the CM-5 and Cray T3D. We also show how this approach can be used to build systems that integrate common scripting languages (including Tcl/Tk, Perl, and Python), simulation code, user extensions, and commercial data analysis packages.

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

molecular dynamics
steering
scripting languages
data analysis

parallel computing
visualization
swig
spasm
large-scale simulation


towards the automatic design of decision tree induction algorithms Decision tree induction is one of the most employed methods to extract knowledge from data, since the representation of knowledge is very intuitive and easily understandable by humans. The most successful strategy for inducing decision trees, the greedy top-down approach, has been continuously improved by researchers over the years. This work, following recent breakthroughs in the automatic design of machine learning algorithms, proposes two different approaches for automatically generating generic decision tree induction algorithms. Both approaches are based on the evolutionary algorithms paradigm, which improves solutions based on metaphors of biological processes. We also propose guidelines to design interesting fitness functions for these evolutionary algorithms, which take into account the requirements and needs of the end-user.

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

automatic design
evolutionary algorithms
decision tree induction


Three-dimensional numerical parametric study of the influence of basement excavation on existing tunnel For the convenience of shoppers and users, there is an increasing demand for construction of basements in close proximity to existing tunnels. To ensure the safety and serviceability of existing tunnels, many numerical analyses have been conducted to investigate the basementtunnel interaction. However, most of previous studies have simplified the complex interaction as a plane strain problem and often they have overlooked effects of stress path and strain dependency on soil stiffness. In this study, three-dimensional numerical parametric study is conducted to explore the complex interaction in dry sand by using an advanced hypoplastic soil model. The validity of the soil model and soil parameters is calibrated and verified by centrifuge test results. Parameters considered on tunnel responses by overlying basement excavation include excavation geometry, sand density, tunnel stiffness and joint stiffness. It is found that the basementtunnel interaction at basement centre reaches a plane strain condition when excavation length along the longitudinal tunnel direction is longer than 9 He (final excavation depth). Both heave and transverse tensile strain of tunnel exceed the allowable movement limit and cracking strain when excavation length is longer than 5 He and excavation width is wider than 2 He. At a given excavation area on plan, the longer side of basement should be perpendicular to the longitudinal tunnel direction to reduce excavation induced adverse effects on existing tunnel. Because a looser soil has smaller stiffness around the tunnel, tunnel heave and tensile strain at basement centre are increased by up to 90% and 80%, respectively, when relative sand density decreases from 90% to 30%. By increasing tunnel stiffness 100 times, induced maximum tunnel heave and tensile strain are reduced by up to 75% and 85%, respectively. This means that stiffening a tunnel can be an effective way to alleviate excavation induced adverse effects on existing tunnel. Induced tunnel heave and tensile strain at basement centre are insensitive to the presence of tunnel joint unless the joint stiffness is less than 30% of the lining stiffness.

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

numerical parametric study
excavation geometry
sand density
tunnel stiffness
joint stiffness


issues related to wireless application testing Accompanied by the explosion usage of wireless network, the quality of wireless application is becoming a major concern today. Software testing is one of the most effective and efficient ways to guarantee the quality of software. This paper describes testing issues related to characteristics of wireless applications and proposes new steps in testing procedure.

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


An effective evolutionary algorithm for the practical capacitated vehicle routing problems The evolutionary algorithms are extensively adopted to resolve complex optimization problem. Genetic algorithm (GA), an evolutionary algorithm, has been proved capable of solving vehicle routing problems (VRPs). However, the resolution effectiveness of GA decreases with the increase of nodes within VRPs. Normally, a hybrid GA outperforms pure GA. This study attempts to solve a capacitated vehicle routing problem (CVRP) by applying a novel hybrid genetic algorithm (HGA) that is practical for use by manufacturers. The proposed HGA involves three stages. First, a diverse and well-structured initial chromosome population was constructed. Second, response surface methodology (RSM) experiments were conducted to optimize the crossover and mutation probabilities in performing GA. Finally, a combined heuristics containing improved insertion algorithm and random insertion mutation operator was established to stir over gene permutations and enhance the exploration capability of GA diversely. Furthermore, an elitism conservation strategy was implemented that replace inferior chromosomes with superior ones. As the proposed HGA is primarily used to solve practical problems, benchmark problems involving fewer than 100 nodes from an Internet website were utilized to confirm the feasibility of the proposed HGA. Two real cases one for locally active distribution and another for arms part transportation at a combined maintenance facility, both involving the Taiwanese armed forces are used to detail the analytical process and demonstrate the practicability of the proposed HGA for optimizing the CVRP.

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


hybrid test of web applications with webtest In this paper, we present hybrid testing , a method that combines replay-testing ( static testing ) with automata learning techniques that generate models of black box systems ( dynamic testing ). This combination helps bridging the gap towards model based testing also for legacy systems. Webtest is an implementation of hybrid testing that builds on top of preexisting technology such as the LearnLib , a framework for automata learning, and the jABC , a framework for model-driven and service-oriented design, that we use here for modelling, executing, and managing test suites for and models of the web applications under analysis. In particular we intend to move towards Rich Internet Applications (RIAs), that include e.g. advanced client side capabilities and access to heavy resources (e.g. database access) over the Web.

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

automata learning
web applications
testing


exploring a digital library through key ideas Key Ideas is a technique for exploring digital libraries by navigating passages that repeat across multiple books. From these popular passages emerge quotations that authors have copied from book to book because they capture an idea particularly well: Jefferson on liberty; Stanton on women's rights; and Gibson on cyberpunk. We augment Popular Passages by extracting key terms from the surrounding context and computing sets of related key terms. We then create an interaction model where readers fluidly explore the library by viewing popular quotations on a particular key term, and follow links to quotations on related key terms. In this paper we describe our vision and motivation for Key Ideas, present an implementation running over a massive, real-world digital library consisting of over a million scanned books, and describe some of the technical and design challenges. The principal contribution of this paper is the interaction model and prototype system for browsing digital libraries of books using key terms extracted from the aggregate context of popularly quoted passages.

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

humanities research
great ideas
hypertext
key phrases
data mining


Approximation of fuzzy numbers by trapezoidal fuzzy numbers preserving the expected interval The problem to find the nearest trapezoidal approximation of a fuzzy number with respect to a well-known metric, which preserves the expected interval of the fuzzy number, is completely solved. The previously proposed approximation operators are improved so as to always obtain a trapezoidal fuzzy number. Properties of this new trapezoidal approximation operator are studied. (c) 2007 Elsevier B.V. All rights reserved.

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


Non-additive multi-attribute fuzzy target-oriented decision analysis As an emerging area considering behavioral aspects of decision making, target-oriented decision model lies in the philosophical root of bounded rationality as well as represents the S-shaped value function. This paper deals with multi-attribute decision analysis from target-oriented viewpoint. First, the basic (random) target-oriented decision model is extended to involve three types of target preferences: benefit target, cost target, and equal target. Next, since applying fuzzy set theory in decision analysis allows the decision maker to specify imprecise aspiration levels, fuzzy target-oriented decision analysis is formulated to model three typical types of fuzzy targets: fuzzy min, fuzzy max, and fuzzy equal. Also, different attitudes are used to derive target achievement functions, which can be viewed as a support for probability as psychological distance. Furthermore, we have proved that multi-attribute target-oriented decision analysis has a similar structure with discrete fuzzy measure and Choquet integral. Hence, we propose using discrete fuzzy measure and Choquet integral to model non-additive multi-attribute target-oriented decision analysis. In particular, the ?-measure is applied to reduce the difficulty of collecting information via a designed bisection search algorithm. Finally, a new product development example is used to illustrate the effectiveness and advantages of our model. The main advantages of our target-oriented decision model are its abilities to model the fuzzy uncertainty of targets as well as capture the non-additive behaviors among targets by means of discrete fuzzy measure and Choquet integral.

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

multi-attribute decision analysis
target-oriented decision
target preference type
fuzzy target
?-measure


A quadratic construction for Zielonka automata with acyclic communication structure ? Asynchronous automata are parallel compositions of finite-state processes synchronizing over shared variables. A deep theorem due to Zielonka says that every regular trace language can be recognized by a deterministic asynchronous automaton. The construction is rather involved and the most efficient variant produces automata which are exponential in the number of processes and polynomial in the size of the DFA. In this paper we show a simple, quadratic construction in the case where the synchronization actions are binary and define an acyclic communication graph.

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


Location, Localization, and Localizability Location-aware technology spawns numerous unforeseen pervasive applications in a wide range of living, production, commence, and public services. This article provides an overview of the location, localization, and localizability issues of wireless ad-hoc and sensor networks. Making data geographically meaningful, location information is essential for many applications, and it deeply aids a number of network functions, such as network routing, topology control, coverage, boundary detection, clustering, etc. We investigate a large body of existing localization approaches with focuses on error control and network localizability, the two rising aspects that attract significant research interests in recent years. Error control aims to alleviate the negative impact of noisy ranging measurement and the error accumulation effect during-cooperative localization process. Network localizability provides theoretical analysis on the performance of localization approaches, providing guidance on network configuration and adjustment. We emphasize the basic principles of localization to Understand the state-of-the-art and to address directions of future research in the new and largely open areas of location-aware technologies.

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

localization
error control
localizability

location-based services (lbs)
wireless ad-hoc and sensor networks


Power control and scheduling with minimum rate constraints in clustered multihop TD/CDMA wireless ad hoc networks In order to achieve high end-to-end throughput in a multihop wireless ad hoc network, TD/CDMA has been chosen as the Medium Access Control (MAC) scheme due to its support for high network throughput in a multihop environment. The associated power control and scheduling problem needs to be addressed to optimize the operations of TD/CDMA. In this paper, cluster-based architecture is introduced to provide centralized control within clusters, and the corresponding power control and scheduling schemes are derived to maximize a network utility function and guarantee the minimum rate required by each traffic session, given routes for multiple end-to-end multihop traffic sessions. Because the resulted optimal power control reveals bang-bang characteristics, that is, scheduled nodes transmit with full power while other nodes remain silent, the joint power control and scheduling problem is reduced to a scheduling problem. The multi-link version of the throughput-optimal and the proportional fair scheduling algorithms for multihop wireless ad hoc networks are proposed. In addition, a generic token counter mechanism is employed to satisfy the minimum rate requirements. By ensuring different minimum rate for different traffic sessions, service differentiation is also achieved. Approximation algorithms are suggested to reduce the computational complexity. In networks that are lack of centralized control, distributed scheduling algorithms are also derived and fully distributed implementation is provided. Simulation results demonstrate the effectiveness of the proposed schemes. Copyright (C) 2006 John Wiley & Sons, Ltd.

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

power control
scheduling
multihop wireless ad hoc network


Global dynamics for non-autonomous reaction-diffusion neural networks with time-varying delays In this paper, a class of non-autonomous reaction-diffusion neural networks with time-varying delays is considered. Novel methods to study the global dynamical behavior of these systems are proposed. Employing the properties of diffusion operator and the method of delayed inequalities analysis, we investigate global exponential stability, positive invariant sets and global attracting sets of the neural networks under consideration. Furthermore, conditions sufficient for the existence and uniqueness of periodic attractors for periodic neural networks are derived and the existence range of the attractors is estimated. Finally two examples are given to demonstrate the effectiveness of these results. (C) 2008 Elsevier B.V. All rights reserved.

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

non-autonomous neural networks
invariant set
attracting set
periodic attractor
delay
reaction-diffusion


Foreground auditory scene analysis for hearing aids Although a wide variety of signal enhancement algorithms are available for hearing aids, selection and parameterization of the best algorithm at any given time is highly dependent upon the environment of the hearing aid user. The use of auditory scene analysis has been proposed by several groups to categorize the background noise. In this work, an algorithm is proposed to categorize a foreground speaker as opposed to the background noise and parameterize a frequency-based compression algorithm which has been previously shown to improve speech understanding for some individuals with severe sensorineural hearing loss in the 23kHz range.

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

frequency compression
speaker recognition


Atom-Atom-Path similarity and Sphere Exclusion clustering: tools for prioritizing fragment hits After performing a fragment based screen the resulting hits need to be prioritized for follow-up structure elucidation and chemistry. This paper describes a new similarity metric, Atom-Atom-Path (AAP) similarity that is used in conjunction with the Directed Sphere Exclusion (DISE) clustering method to effectively organize and prioritize the fragment hits. The AAP similarity rewards common substructures and recognizes minimal structure differences. The DISE method is order-dependent and can be used to enrich fragments with properties of interest in the first clusters.

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

command line program
fragment screening
hit prioritization


DYNAMICS OF INFORMATION IN THE PRESENCE OF DEFORMATION The entanglement of atomic system consisting of two atoms interacting with a deformed cavity mode is quantified by the means of Bloch vectors and the cross dyadic of the traveling state inside the cavity. For large value of the deformation, the amplitude of Bloch vectors decrease very fast and consequently, the traveling state turns into mixed state quickly. The generated entangled state is used as quantum channel to implement quantum teleportation protocol. It is shown that both the deformed parameter and the number of photons inside the cavity play a central role in controlling the fidelity of the transmitted information.

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


dependability in an evolving world Evolvable hardware offers much for the future of complex system design. Evolutionary techniques not only give the potential of larger solution space, but when implemented on hardware allow system designs to adapt to changes in the environment, including failures in system components.This paper reviews a number of techniques, all based in the bio-inspired camp, that provide varying degrees of dependability over and above standard designs. In particular, three different techniques are considered: using FPGAs and continuous evolution to circumvent faults as and when they occur, using FPGAs and ideas from developmental biology to create designs that possess emergent fault tolerant properties, and finally we consider a novel ASIC, designed and built with bio-inspired systems in-mind, and show how this too can cope with unexpected events during operation.

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

poetic
fault-tolerance
evolutionary algorithms


Improving enterprise resource planning (ERP) fit to organizational process through knowledge transfer Critical to enterprise resource planning (ERP) implementation is the fit between the system and the processes in an organization. Knowledge about the ERP system must flow from those implementing the system and those responsible once in production. Effective knowledge transfer is assisted by the absorptive capacity of the learner and the competence of the knowledge holder, as reflected in the client and consultant relationship of this study. A model of transfer is composed from existing theories of learning to explain the roles played by the client through absorptive capacity and the consultant through competence. Survey data of CIOs in Taiwan confirm that transfer is improved with higher levels of capacity and competence, while the transfer process leads to a better fit between ERP systems and organizational processes. Management needs to foster the build-up of their internal knowledge stocks in order to stimulate the flow of knowledge transfer.

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

erp implementation
knowledge transfer
absorptive capacity


Knowledge representation and reasoning based on entity and relation propagation diagram/tree The entity and relation recognition, i.e. (1) assigning semantic classes (e.g., person, organization and location) to entities in a sentence, and (2) determining the relations (e.g., born-in and employee-of) held between the corresponding entities, is an important task in areas such as information extraction and question answering. Subtasks (1) and (2) are typically carried out sequentially, and this procedure is problematic: errors made during subtask (1) are propagated to subtask (2) with an accumulative effect; and in many cases information that becomes available only during subtask (2) (e.g., the class of an entity corresponds to the first argument of relation born-in (X, China)) would be helpful for subtask (1) (e.g., the class of the entity cannot be a location but a person). To address problems of this kind, this paper develops a novel method, which allows subtasks (1) and (2) to be linked more closely together. The procedure is separated to three stages. Firstly, employ two classifiers to perform subtasks (1) and (2) independently. Secondly, the semantic class of each entity is determined by taking into account the classes of all the entities in the sentence, as computed during the previous step. This is achieved using a special model dubbed "entity relation propagation diagram" and "entity relation propagation tree". Thirdly, each relation is then assigned a class by considering the semantic classes of the entities produced at the previous step. Our experimental results show that the method improves not only relation recognition but also entity recognition in some degree.

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

entity and relation recognition
knowledge representation
information extraction


Bcl-2 Gene Family Expression in the Brain of Rat Offspring after Gestational and Lactational Dioxin Exposure Abstract: Recent epidemiological studies have shown that dioxin, a persistent organic pollutant, is related to cognitive and behavioral abnormalities in the offspring of exposed cohort. In order to investigate the possible impact of dioxin in survival gene expression during brain development, we established an animal model of gestational and lactational dioxin-exposed rat offspring. The expressions of dioxin-responsive gene cytochrome P450 1A1 (CYP1A1), apoptotic gene Bax, and anti-apoptotic genes Bcl-2 and Bcl-xL were examined in rat liver and brains using Western blot analysis and RT-PCR. The results showed that treatment of pregnant rats with 2,3,7,8-tetrachlorodibenzo-p-dioxin (TCDD) (2 ?g/kg body weight through oral delivery) at gestation day 15 resulted in an increase of Bcl-xL in offspring male liver and cerebral cortex, but a decrease in female offspring. In contrast, the expression of Bcl-xL in the cerebellum was decreased in male, but increased in female. Bcl-2, another anti-apoptotic gene, was also downregulated in P0 female liver, cerebral cortex, but was not observed in male. In the 4-month-old offspring, however, the Bcl-2 protein levels in the liver and cerebellum of both male and female pups were higher in the TCDD group as compared with the control group. However, the Bcl-2 level in the cerebral cortex of TCDD-treated groups was higher than the control group only in female but not male offspring at 4 months old. The expression of Bax showed no significant changes upon TCDD exposure at P0 stage, but was significantly reduced in the 4-month-old male cortex. These results indicate that early exposure of dioxin could affect the development of certain brain regions with gender difference, in terms of its differential effect on expressions of Bcl-xL, Bcl-2, and Bax.

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

dioxin
brain
bax
cerebral cortex
cerebellum
liver


The effect of head movement on CT perfusion summary maps: simulations with CT hybrid phantom data Head movement is common during CT brain perfusion (CTP) acquisition of patients with acute ischemic stroke. The effects of this movement on the accuracy of CTP analysis has not been studied previously. The purpose of this study was to quantify the effects of head movement on CTP analysis summary maps using simulated phantom data. A dynamic digital CTP phantom dataset of 25 time frames with a simulated infarct volume was generated. Head movement was simulated by specific translations and rotations of the phantom data. Summary maps from this transformed phantom data were compared to the original data using the volumetric dice similarity coefficient (DSC). DSC for both penumbra and core strongly decreased for rotation angles larger than approximately 1, 2, and 7 for, respectively, pitch, roll, and yaw. The accuracy is also sensitive for small translations in the z-direction only. Sudden movements introduced larger errors than gradual movement. These results indicate that CTP summary maps are sensitive to head movement, even for small rotations and translations. CTP scans with head movement larger than the presented values should be interpreted with extra care.

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


revisiting partial packet recovery in 802.11 wireless lans In wireless LANs, partial packets are often received which usually contain only a few errors. According to the current 802.11 standard, such packets have to be retransmitted. Much effort has been invested recently in repairing such packets without retransmitting the entire packet, e.g., by using error correction (EC) code or retransmitting only the corrupted blocks. In this paper, we revisit this problem, and propose Unite, a framework for more efficient partial packet recovery. Unite is motivated by two key observations. First, the two repair methods, i.e., the EC-based and block-based, are not mutually exclusive and can be combined to achieve higher performance. Second, the recently introduced error estimators can be utilized to determine the optimal repair method depending on the condition of each partial packet. The combined method should achieve better performance than each individual method; in addition, it should remain low in complexity because the EC-based and block-based method are both simple in nature. Unite uses AMPS, a recently proposed estimator, for error estimation. We implement Unite on the Madwifi open source driver, and our experiments show that Unite outperforms other recovery schemes.

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


Third-order nonlinear optical properties of molecules containing aromatic diimides: Effects of the aromatic core size and a redox-switchable modification The third-order nonlinear optical (NLO) properties of aromatic diimide molecules have been studied for the first time using density functional theory (DFT) with a finite field (FF). This study shows that the size of the aromatic core can affect the static second hyperpolarizability (?). Increasing the number of benzenes along the longitudinal axis can effectively improve the ? values because the degree of charge transfer along the longitudinal direction increases, whereas an increase in the number of benzenes along the perpendicular axis does not enhance the ? values. Furthermore, the NLO responses of the reduced form radical anions 1 ?, 5 ? and 6 ?, which were obtained by a reversible redox process, are discussed. The results show that the ? values of the radical anions are changed by the redox process. For the reduced form radical anion 6 ?, the ? value is ?1906.7110?36esu, and its absolute value is ?7.3 times larger than that of its neutral parent. An analysis of the BLA values demonstrates that the ? value is closely related to the conjugation of the aromatic core used in the redox process.

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

aromatic diimides
aromatic core size
redox
radical anion


Subdifferential characterization of approximate convexity: the lower semicontinuous case It is known that a locally Lipschitz function is approximately convex if, and only if, its Clarke subdifferential is a submonotone operator. The main object of this work is to extend the above characterization to the class of lower semicontinuous functions. To this end, we establish a new approximate mean value inequality involving three points. We also show that an analogue of the Rockafellar maximal monotonicity theorem holds for this class of functions and we discuss the case of arbitrary subdifferentials.

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

approximate convexity
submonotone operator
subdifferential
mean value inequality


A Normalized Statistical Metric Space for Hidden Markov Models In this paper, we present a normalized statistical metric space for hidden Markov models (HMMs). HMMs are widely used to model real-world systems. Like graph matching, some previous approaches compare HMMs by evaluating the correspondence, or goodness of match, between every pair of states, concentrating on the structure of the models instead of the statistics of the process being observed. To remedy this, we present a new metric space that compares the statistics of HMMs within a given level of statistical significance. Compared with the Kullback-Leibler divergence, which is another widely used approach for measuring model similarity, our approach is a true metric, can always return an appropriate distance value, and provides a confidence measure on the metric value. Experimental results are given for a sample application, which quantify the similarity of HMMs of network traffic in the Tor anonymization system. This application is interesting since it considers models extracted from a system that is intentionally trying to obfuscate its internal workings. In the conclusion, we discuss applications in less-challenging domains, such as data mining.

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

hiddenmarkov models (hmms)
model comparison


Application of system reconstructability analysis on research of relations between price and financial-economic factors This paper gives a system factor reconstructability analysis model with a residential living cost index and a retail price index of consumer goods as criteria. The impact and cumulative dynamical effects are considered using the following factors: total investment of capital construction, quantity of money M-0 in circulation, money supply M-1 and M-2, total cash payment of the bank, payment of the bank for wages and other personal cash payments, enterprise deposit, total amount of export and import, and gross domestic products. It also constructs a model to study the impacts of some ratios and differences between the increased rates of these factors on the increased rate of the price index, and constructs similar models to study the impacts of the studied year factor increase rates on the price index rates. A model for relations of monthly fluctuations of these factors and the price index is given. Lastly, by studying the results of these models, this paper proposes comprehensive conclusions about the relations of price and financial-economic factors.

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

dynamical factor analysis
price study
financial-economic factors


Whole mirror duplication-random loss model and pattern avoiding permutations In this paper we study the problem of the whole mirror duplication-random loss model in terms of pattern avoiding permutations. We prove that the class of permutations obtained with this model after a given number p of duplications of the identity is the class of permutations avoiding the alternating permutations of length 2(p) + 1. We also compute the number of duplications necessary and sufficient to obtain any permutation of length n. We provide two efficient algorithms to reconstitute a possible scenario of whole mirror duplications from identity to any permutation of length n. One of them uses the well-known binary reflected Gray code (Gray, 1953) [10]. Other relative models are also considered. (C) 2010 Elsevier B.V. All rights reserved.

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

combinatorial problems
pattern avoiding permutation
whole duplication-random loss model
genome
generating algorithm


query term ranking based on dependency parsing of verbose queries Query term ranking approaches are used to select effective terms from a verbose query by ranking terms. Features used for query term ranking and selection in previous work do not consider grammatical relationships between terms. To address this issue, we use syntactic features extracted from dependency parsing results of verbose queries. We also modify the method for measuring the effectiveness of query terms for query term ranking.

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


COUPLING OF ZONES WITH DIFFERENT RESOLUTION CAPABILITIES IN FINITE ELEMENT MODELS OF UNIFORM STRUCTURES In this paper, we describe an approach that enables to present a finite element model of a large uniform structure by an assembly of zones of different resolution capability. While actions imposed upon a structure are located in finer resolution patches, the rougher resolution zones serve as a surrounding for finer ones in order to describe the overall behavior of the structure, As all example, a fine rectangular girder construction made of beam elements is considered as a finely refined representation of the structure. The overall behavior of the structure may be considered oil the base of the continuous membrane model. The Structure has been created, where analyzed girder subdomain is coupled to equivalent membrane via contact elements. Criterion Of Mutual matching of responses of both structures is considered to be the coincidence of displacements of respective nodes in the researched subdomains of the models. The least squares method and artificial neural network approach have been employed for the identification of the physical parameters of the equivalent membrane. The efficiency of both approaches is compared. Calculations are performed in ANSYS and MATLAB environments.

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

finite elements
model reduction
parameter identification


Local oppugnant color space extrema patterns for content based natural and texture image retrieval This paper proposes a novel feature descriptor called local oppugnant color space extrema patterns (LOCSEP) for image indexing retrieval. The existing directional local extrema pattern (DLEP) extracts the directional edge information based on local extrema in 0, 45, 90, and 135 directions in an image. The proposed method integrates the concepts of color and texture features. First, the color image is converted into RGB (red, green and blue) and HSV (hue, saturation and value) color spaces. Then oppugnant color spaces, RV, GV, BV are used for the extract of oppugnant DLEP features (LOCSEP). The performance of the proposed method is tested by conducting two experiments on benchmark databases viz. Corel-1K and MIT VisTex databases. The performance of the proposed method is compared with the state-of-the-art methods for image retrieval and face recognition applications in terms of average retrieval precision (ARP) and average retrieval rate (ARR). The results after being investigated show a significant improvement in terms of their evaluation measures as compared to state-of-the-art methods on respective databases.

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

local oppugnant patterns
local binary patterns (lbp)
color-texture


implementation of ieee802.11a software defined receiver on chip multi-processor architecture using openmp Software radio (SR) is a promising technology for the next generation communication since it enables to implement various communication protocols in one platform. In general, software radio systems implemented in DSPs or FPGAs deliver satisfactory performance, but they do not provide enough flexibility which is a key merit of using soft radios. In this paper we implement a software radio system on a general purpose multiprocessor. Running communication applications on an OS-based general purpose processor has several merits. However, there are two big shortcomings. First, the system may not satisfy the required performance. Second, it may be hard to meet the real time constraints. To achieve the required performance of signal processing, a chip multiprocessor is employed. Typically, ample potential for parallelization is found in communication software. Therefore by effectively utilizing task-level parallelism, chip multiprocessors can achieve the required performance. In this paper, we implement an IEEE 802.11a baseband receiver in software, and parallelize the software by OpenMP. We also propose a new synchronization technique among threads. We evaluate the performance after running the software on an Intel Quad Core workstation with the CentOS.

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


Multi-atlas segmentation of biomedical images: A survey We review the biomedical multi atlas segmentation (MAS) literature. We present how MAS evolved, and now relates to alternative methods. We present our perspective on the future of MAS.

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


Introducing remote physical rehabilitation for patients with chronic disorders by means of telemedicine This study involved an evaluation of a telemedicine service implemented as a partial replacement of a physical outpatient rehabilitation program. The telemedicine service was an exercise-based tele-rehabilitation service facilitating remote physical rehabilitation for patients suffering from chronic lower back pain or pulmonary disease. Effectiveness was evaluated with multiple outcomes on quality (complaints, disability and physical condition) and access (usability, satisfaction and motivational character of the service). Patients referred by their rehabilitation physician to a physical outpatient rehabilitation program between October 2009 and May 2010 were asked to participate in the control group. Patients referred to the program between June 2010 and December 2011 were asked to participate in the intervention group. The control group received the conventional rehabilitation program. The intervention group received the rehabilitation program in which telemedicine was used as partial replacement of face to face care. Instead of 3 visits per week to the clinic as was being carried out in conventional care, patients visited the outpatient rehabilitation clinic for 2days and they were instructed to exercise at least 1day in their own environment using the exercise-based tele-rehabilitation service. One hundred and eighteen patients were included in this study: 38 patients in the control group and 80 patients in the intervention group. Both groups equally benefit from the outpatient rehabilitation program. There were no significant differences between the groups. The usability (system usability scale sore of 71.2 (SD 15.0; n?=?47), satisfaction (average rate 6.0 (SD 2.0; n?=?55), and level of motivation of the exercise-based tele-rehabilitation service were sufficient, but slightly disappointing. The telemedicine supported the outpatient rehabilitation program as partial replacement of face to face care was as effective as the conventional outpatient rehabilitation program.

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

telemedicine
rehabilitation
chronic lower back pain
pulmonary disease