Session level flow classification by packet size distribution and session grouping Classifying traffic into specific network applications is essential for application-aware network management and it becomes more challenging because modern applications complicate their network behaviors. While port number-based classifiers work only for some well-known applications and signature-based classifiers are not applicable to encrypted packet payloads, researchers tend to classify network traffic based on behaviors observed in network applications. In this paper, a session level flow classification (SLFC) approach is proposed to classify network flows as a session, which comprises of flows in the same conversation. SLFC first classifies flows into the corresponding applications by packet size distribution (PSD) and then groups flows as sessions by port locality. With PSD, each flow is transformed into a set of points in a two-dimension space and the distances between each flow and the representatives of pre-selected applications are computed. The flow is recognized as the application having a minimum distance. Meanwhile, port locality is used to group flows as sessions because an application often uses consecutive port numbers within a session. If flows of a session are classified into different applications, an arbitration algorithm is invoked to make the correction. The evaluation shows that SLFC achieves high accuracy rates on both flow and session classifications, say 99.9% and 99.98%, respectively. When SLFC is applied to online classification, it is able to make decisions quickly by checking at most 300 packets for long-lasting flows. Based on our test data, an average of 72% of packets in long-lasting flows can be skipped without reducing the classification accuracy rates.

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

flow classification
session grouping
packet size distribution


Modeling Design Patterns for Semi-Automatic Reuse in System Design Design patterns provide reusable solutions for recurring design problems. They constitute an important tool for improving software quality. However, correct usage of design patterns depends to a large extent on the designer. Design patterns often include models that describe the suggested solutions, while other aspects of the patterns are neglected or described informally only in text. Furthermore, design pattern solutions are usually described in an object-oriented fashion that is too close to the implementation, masking the essence of and motivation behind a particular design pattern. We suggest an approach to modeling the different aspects of design patterns and semi-automatically utilizing these models to improve software design. Evaluating our approach on commonly used design patterns and a case study of an automatic application for composing, taking, checking, and grading analysis and design exams, we found that the suggested approach successfully locates the main design problems modeled by the selected design patterns.

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

conceptual modeling
design improvement
domain engineering
model retrieval
object-process methodology (opm)
pattern recognition
unified modeling language (uml)


Costbenefit analysis of an SLA mapping approach for defining standardized Cloud computing goods Due to the large variety in computing resources and, consequently, the large number of different types of service level agreements (SLAs), computing resource markets face the problem of a low market liquidity. Restricting the number of different resource types to a small set of standardized computing resources seems to be the appropriate solution to counteract this problem. Standardized computing resources are defined through an SLA template. An SLA template defines the structure of an SLA, the service attributes, the names of the service attributes, and the service attribute values. However, since existing research results have only introduced static SLA templates so far, the SLA templates cannot reflect changes in user needs and market structures. To address this shortcoming, we present a novel approach of adaptive SLA matching. This approach adapts SLA templates based on SLA mappings of users. It allows Cloud users to define mappings between a public SLA template, which is available in the Cloud market, and their private SLA templates, which are used for various in-house business processes of the Cloud user. Besides showing how public SLA templates are adapted to the demand of Cloud users, we also analyze the costs and benefits of this approach. Costs are incurred every time a user has to define a new SLA mapping to a public SLA template due to its adaptation. In particular, we investigate how the costs differ with respect to the public SLA template adaptation method. The simulation results show that the use of heuristics within adaptation methods allows balancing the costs and benefits of the SLA mapping approach.

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

service level agreements
market liquidity
sla matching

cloud architecture
cloud markets
cost modeling
utility modeling
goods standardization


Merging and splitting autocorrelated arrival processes and impact on queueing performance We have proposed a three-parameter renewal approximation to analyze splitting and superposition of autocorrelated processes. We define the index of dispersion for counts of an ordinary process used in a new and more accurate technique to estimate the third parameter. Then, we express this newly defined index of dispersion for the superposition in terms of the ordinary as well as the stationary indices of dispersion of the originally autocorrelated component processes. Hence, even if the superposition data is not observable, as long as sufficient information exists on component processes, the parameters of the proposed renewal approximation can be estimated accurately. The accurate renewal approximation of a general process helps in sustaining accuracy if it is split, by-passing the need to sample from branched processes. We have tested the impact of our approximation on the accuracy of the mean waiting time, which compared favorably with simulation results of the original systems.

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

indices of dispersion
superposition
splitting
mean waiting time

autocorrelation
peakedness
queueing networks
mmpp


Automatic grading system for human tear films Dry eye syndrome is a prevalent disease which affects a wide range of the population and has a negative impact on their daily activities, such as driving or working with computers. Its diagnosis and monitoring require a battery of tests which measure different physiological characteristics. One of these clinical tests consists in capturing the appearance of the tear film using the Doane interferometer. Once acquired, the interferometry images are classified into one of the five categories considered in this research. The variability in appearance makes the use of a computer-based analysis system highly desirable. For this reason, a general methodology for the automatic analysis and categorization of interferometry images is proposed. The development of this methodology included a deep study based on several techniques for image texture analysis, three color spaces and different machine learning algorithms. The adequacy of this methodology was demonstrated, achieving classification rates over 93%. Also, it provides unbiased results and allows important time savings for experts.

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

texture analysis
machine learning
dry eye syndrome
tear film
doane interferometer


Teaching the novice programmer: A study of instructional sequences and perception Studies show that for many years courses teaching computer programming skills to novices have engendered a dislike for programming in many students. The first phase of this study presented identical content in one of three instructional sequences to 34 college students who were programming novices to determine which produced the greatest development of programming expertise. Learning was measured by performance on a Programming Assessment given immediately after the intervention, and effort and difficulty were self-rated during the instruction. There was no significant difference among the groups in Programming Assessment scores, and overall self-rated effort and difficulty of the instruction did not vary simply by rearranging the order in which the major elements were presented. However, instructional units that covered programming syntax skills and structures were rated by all groups as requiring significantly less effort and difficulty than units covering plans, and participants in all groups scored significantly higher on syntax skills and structures than on plans. The second phase sought evidence that there were differences in perception and the complexity of knowledge in long term memory between novices and experts programmers by comparing the fifteen top performing participants on the Programming Assessment with three programming experts in chunking a short program and in constructing the central solution statement to four programming problems. Experts chunked programs to twice the levels and twice as fast as novices, indicating differences in the mental organization of novices and experts. The implications of these results are discussed.

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

instructional design
learning theory
novice learner


Visual conceptualizations and models of science This is the Guest Editor's introduction to the Special Issue on Science of Science: Conceptualizations and Models of Science, Journal of Informetrics. The introduction discusses challenges towards a theoretically grounded and practically useful science of science. It provides a brief chronological review of relevant work and argues for (1) the development of common frameworks for the comparison and combination of existing approaches, theories, laws, and measurements, (2) the combination of quantitative and qualitative studies of science, and (3) the operationalization of theoretical concepts in terms of measurement and empirical evidence. Next, three visual conceptualizations of science are discussed and compared. Each of them provides a framework for the comparison and combination of existing works, means to combine quantitative and qualitative data, and helps to operationalize and communicate theoretical concepts using empirical data. Last but not least, the contributions of and interlinkages among the papers included in this issue are discussed.

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

conceptualization
scientometrics
sociology of science
webometrics
history of science
cultural studies of science
statistical analysis
mathematical modeling
science policy
evolution


ieee 802.15.3 intra-piconet route optimization with application awareness and multi-rate carriers In IEEE 802.15.3 wireless personal area networks, all devices (DEVs) within a piconet communicate in a peer-to-peer manner. In this paper, we enhance the performance of intra-piconet communications by taking advantage of the multi-rate physical layer (PHY) and diverse application traffic characteristics. As higher PHY data rates are typically achievable over shorter transmission distances, a low rate link between two DEVs can potentially be replaced by a higher rate multihop connection through intermediate DEVs in the same piconet. A novel application-aware shortest path (AASP) algorithm is proposed for centralized intra-piconet route optimization, which finds the route that requires the minimum overall channel time allocation (CTA) based on the traffic parameters. Performance evaluations show that the effective CTA rates vary dramatically for different applications, and can be greatly increased by simply delaying the acknowledgments. Especially for low rate links and between unreachable DEV pairs, the AASP algorithm yields very high optimization ratios, which increase with frame payload size and the density of DEVs in the piconet.

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

wireless personal area network
routing
rate adaptive


Learning algorithm and retrieval process for the multiple classes random neural network model Gelenbe has modeled neural networks using an analogy with queuing theory. This model (called Random Neural Network) calculates the probability of activation of the neurons in the network. Recently, Fourneau and Gelenbe have proposed an extension of this model, called multiple classes random neural network model. The purpose of this paper is to describe the use of the multiple classes random neural network model to learn patterns having different colors. We propose a learning algorithm for the recognition of color patterns based upon non-linear equations of the multiple classes random neural network model using gradient descent of a quadratic error function. Ttl addition, we propose a progressive retrieval process with adaptive threshold values. The experimental evaluation shows that the learning algorithm provides good results.

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

learning algorithm
multiple classes random neural network
retrieval process


Using auditory event-related EEG potentials to assess presence in virtual reality The feeling of presence in a virtual reality (VR) is a concept without a standardized objective measurement. In the present study, we used event-related brain potentials (ERP) of the electroencephalogram (EEG) elicited by tones, which are not related to VR, as an objective indicator for the presence experience within a virtual environment. Forty participants navigated through a virtual city and rated their sensation of being in the VR (experience of presence), while hearing frequent standard tones and infrequent deviant tones, which were irrelevant for the VR task. Different ERP components elicited by the tones were compared between participants experiencing a high level of presence and participants with a low feeling of presence in the virtual city. Early ERP components, which are more linked to automatic stimulus processing, showed no correlation with presence experience. In contrast, an increased presence experience was associated with decreased late negative slow wave amplitudes, which are associated with central stimulus processing and allocation of attentional resources. This result supports the assumption that increased presence is associated with a strong allocation of attentional resources to the VR, which leads to a decrease of attentional resources available for processing VR-irrelevant stimuli. Hence, ERP components elicited by the tones are reduced. Particularly, frontal negative slow waves turned out to be accurate predictors for presence experience. Summarizing, late ERPs elicited by VR-irrelevant tones differ as a function of presence experience in VR and provide a valuable method for measuring presence in VR.

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

event-related potentials
spatial presence
attention allocation
vr-irrelevant stimuli


Indexing high-dimensional data for efficient in-memory similarity search In main memory systems, the L2 cache typically employs cache line sizes of 32-128 bytes. These values are relatively small compared to high-dimensional data, e. g., > 32D. The consequence is that existing techniques ( on low-dimensional data) that minimize cache misses are no longer effective. In this paper, we present a novel index structure, called Delta-tree, to speed up the high-dimensional query in main memory environment. The Delta-tree is a multilevel structure where each level represents the data space at different dimensionalities: the number of dimensions increases toward the leaf level. The remaining dimensions are obtained using Principal Component Analysis. Each level of the tree serves to prune the search space more efficiently as the lower dimensions can reduce the distance computation and better exploit the small cache line size. Additionally, the top-down clustering scheme can capture the feature of the data set and, hence, reduces the search space. We also propose an extension, called Delta(+)-tree, that globally clusters the data space and then partitions clusters into small regions. The Delta(+)-tree can further reduce the computational cost and cache misses. We conducted extensive experiments to evaluate the proposed structures against existing techniques on different kinds of data sets. Our results show that the Delta(+)-tree is superior in most cases.

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


multi-edge decimation in multi-modal 3d collaborative applications Multi-resolution modelling has become essential as modern 3D applications demand 3D objects with higher LODs (LOD). Multimodal devices such as PDAs and UMPCs do not have sufficient resources to handle the original 3D objects. The increased usage of collaborative applications has created many challenges for remote manipulation working with 3D objects of different quality. This paper studies how we can improve multi-resolution techniques by performing multi-edge decimation and using annotative commands. It also investigates how devices with poorer quality 3D object can participate in collaborative actions.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 devices
collaboration
multi-modal
multi-resolution techniques


Asymptotic behavior of nonoscillatory solutions of neutral difference equations The authors consider the m(th)-order neutral difference equation Dm (y (n) + p (n) y (n - k)) + q (-) f (y (a (-))) = e (n), where m greater than or equal to 1, {p(n)}, {q(n)}, {e(n)}, and {a(1)(n)}, {a(2)(n)},..., {a(m-1)(n)} are real sequences, a(i)(n) > 0 for i = 1, 2...., m-1, a(m)(n) equivalent to 1, D(0)z(n) = y(n)+p(n)y(n-k), D(i)z(n) = a(i)(n)DeltaD(i-1)z(n) for i = 1, 2,... m, k is a positive integer, {sigma(n)} --> infinity is a sequence of positive integers, and f : R --> R is continuous with uf(u) > 0 for u not equal 0. In the case where {q(n)} is allowed to oscillate, they obtain sufficient conditions for all bounded nonoscillatory solutions to converge to zero, and if {q(n)} is a nonnegative sequence, they establish sufficient conditions for all nonoscillatory solutions to converge to zero. Examples illustrating the results are included throughout the paper. (C) 2003 Elsevier Science Ltd. All rights reserved.

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

asymptotic behavior
difference equations

higher order
neutral equations
non-oscillatory solutions


Budget-aware Role Based Access Control The suitability of Role Based Access Control (RBAC) is being challenged in dynamic environments like healthcare. In an RBAC system, a user's legitimate access may be denied if their need has not been anticipated by the security administrator at the time of policy specification. Alternatively, even when the policy is correctly specified an authorised user may accidentally or intentionally misuse the granted permission. The heart of the challenge is the intrinsic unpredictability of users' operational needs as well as their incentives to misuse permissions. In this paper we propose a novel Budget-aware Role Based Access Control (B-RBAC) model that extends RBAC with the explicit notion of budget and cost, where users are assigned a limited budget through which they pay for the cost of permissions they need. We propose a model where the value of resources are explicitly defined and an RBAC policy is used as a reference point to discriminate the price of access permissions, as opposed to representing hard and fast rules for making access decisions. This approach has several desirable properties. It enables users to acquire unassigned permissions if they deem them necessary. However, users misuse capability is always bounded by their allocated budget and is further adjustable through the discrimination of permission prices. Finally, it provides a uniform mechanism for the detection and prevention of misuses. (C) 2012 Elsevier Ltd. All rights reserved.

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

insider problem
misaligned incentives
price discrimination
economics of information security


Heuristic methods to maximize network lifetime in directional sensor networks with adjustable sensing ranges Introducing the problem of maximum network lifetime with adjustable ranges in a DSN. Designing two efficient heuristics using greedy technique to solve the problem. Evaluating the performance of the algorithms through simulations.

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

cover set formation
scheduling algorithms


Efficient Detection Algorithms for MIMO Communication Systems In this paper, two new efficient detection algorithms, Type 1 (T1) with better complexity-performance tradeoff and Type 2 (T2) with lower complexity, are derived from one generalized framework for multiple-input multiple-output (MIMO) communication systems. The proposed generalized detection framework constructed by parallel interference cancellation (PIC), group, and iteration techniques provides three parameters and three sub-algorithms to generate two efficient detection algorithms and conventional BLAST-ordered decision feedback (BODF), grouped, iterative, and B-Chase detection algorithms. Since the group interference suppression (GIS) technique is applied to the proposed detection algorithms, the complexities of the preprocessing (PP) and tree search (TS) can be reduced. In (8,8) system with uncoded 16-QAM inputs, one example of the T1 algorithm can save complexity by 21.2% at the penalty of 0.6 dB loss compared with the B-Chase detector. The T2 algorithm not only reduces complexity by 21.9% but also outperforms the BODF algorithm by 3.1 dB.

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

vertical bell laboratories layered space-time (v-blast)


Parameterized Complexity of Eulerian Deletion Problems We study a family of problems where the goal is to make a graph Eulerian, i.e., connected and with all the vertices having even degrees, by a minimum number of deletions. We completely classify the parameterized complexity of various versions: undirected or directed graphs, vertex or edge deletions, with or without the requirement of connectivity, etc. The collection of results shows an interesting contrast: while the node-deletion variants remain intractable, i.e., W[1]-hard for all the studied cases, edge-deletion problems are either fixed-parameter tractable or polynomial-time solvable. Of particular interest is a randomized FPT algorithm for making an undirected graph Eulerian by deleting the minimum number of edges, based on a novel application of the color coding technique. For versions that remain NP-complete but fixed-parameter tractable we consider also possibilities of polynomial kernelization; unfortunately, we prove that this is not possible unless NP?coNP/poly.

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

fixed-parameter tractability
eulerian graph
deletion distance


Hardware-Based Load Balancing for Massive Multicore Architectures Implementing Power Gating Many-core architectures provide a computation platform with high execution throughput, enabling them to efficiently execute workloads with a significant degree of thread-level parallelism. The burstlike nature of these workloads allows large power savings by power gating the idle cores. In addition, the load balancing of threads to cores also impacts the power and thermal behavior of the processor. Processor implementations of many-core architectures may choose to group several cores into clusters sharing the area overhead, so that the whole cluster is power gated as opposed to the individual cores. However, the potential for power savings is reduced due to the coarser level of power gating. In this paper, several hardware-based stateless load-balancing schemes are evaluated for these clustered homogeneous multicore architectures in terms of their power and thermal behavior. All these methods can be unified into a parameterized technique that dynamically adjusts to obtain the desired goal (lower power, higher performance, and lower hotspot temperature).

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

many-core processors
tile-based architectures


Cored-based tree with forwarding regions (CBT-FR); a protocol for reliable multicasting in mobile ad hoc networks In this paper we propose a new protocol for reliable multicast in a Multihop mobile radio network. The protocol is reliable, i.e.. it guarantees message delivery to all multicast nodes even when the topology of the network changes during multicasting. The proposed protocol uses a core-based shared tree. The multicast tree may get fragmented due to node movements. The notion of a forwarding region is introduced which is used to glue together fragments of multicast trees. The gluing process involves flooding the forwarding region of only those nodes that witness topology change due to node mobility. Delivery of multicast messages to mobile nodes is expedited through (i) pushing the message by witness nodes in their forwarding regions and (ii) pulling messages by a mobile node during (re)joining process. Hence, the protocol conserves network bandwidth by using a combination of the push-pull approach and by restricting flooding only to the essential parts of the network that are affected by topology change. We develop a theoretical model to compute the probability of packet loss (as a function of the mobility rate) for our proposed scheme compared to the the core-based tree protocol (CBT); we also evaluate the effectiveness of forwarding regions as compared to traditional flooding. Our analysis shows that the proposed scheme significantly outperforms CBT. (C) 2001 Academic Press.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 ad hoc network
mobile multi-hop radio network
multicast routing
group communication
reliable communication
fault-tolerant communication


Applying Ant Colony Optimization to configuring stacking ensembles for data mining The approach applies Ant Colony Optimization in configuring stacking ensemble. It is compared with existing methods on 18 benchmark datasets. It is used in a real-world cost-sensitive data mining problem. It outperforms existing methods on many datasets and the data mining problem. The approach generates good cost-sensitive ensembles from ordinary learning algorithms.

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


A closer look at the economic-environmental disparities for regional development in China Although China has harvested the fruits of its rapid economic growth over a period of several decades, it has encountered serious environmental problems, an important one being air pollution in the form of soot, dust, and sulfur dioxide. In considering the concept of green-GDP, this paper analyzes Chinas regional development by examining its economic performance while taking into account various environmental factors. In addition to computing technical efficiency for 31 regions in China, a cross-efficiency measure is applied to differentiate the genuine DMUs. Overall efficient regions and false positive ones are recognized by a false positive index (FPI). It is found that the coastal regions perform on average better than the inland regions both economically and environmentally. For inefficient regions, the benchmark should be those regions with high cross-efficiency mean scores (e.g., Guangdong) rather than those with high self-appraisal scores (e.g., Shanghai). A cross-tabulation illustrating the difference between GDP-oriented performance and Pollution-oriented performance shows that the coastal regions make up the dominant proportion in terms of the benchmarks for economic-environmental optimization.

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

data envelopment analysis
cross-efficiency measure
environment
or in developing countries


experiences in software engineering courses using psychometrics with ramset Lately Programming Psychology has opened up a vast area of study, where human, social and psychological factors of the programmer are studied in different computational areas. His behavior and how to relate with others are important aspects that influence performance of a developing team. In our daily work in education we have an obligation of shaping human resources to build a society with professionals participating in companies and corporations dedicated to industrial, social and economic development. Thus in searching for strategies to shape human resources and improve these group corporations we propose RAMSET a Role Assignment Methodology for Software Engineering Teams where we acknowledge the importance of relating personality with team roles, using sociometric techniques and psychometrics to aid in forming high performing teams for software development projects.

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

software engineering
psychometrics
personality


databases on the web What role will database management play in the next generation of the web? I believe that a number of trends signal a growing and central role for the ideas and techniques that have emerged over the past three decades of database research. However, we will have to re-examine some basic issues and build a new generation of data management infrastructures in order to address many of the new demands made by web data management.

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


a systematic approach for transformation of er schema to dimensional schema Development of Star model for data warehouse (DW) requires ample amount of time, experience, expertise and adequate knowledge of data warehouse designing steps. As an alternative to data warehouse designing steps, transformation techniques are used. These techniques transform ER model (of relational OLTP) to Star model/s. In this study, we present and evaluate a systematic approach for transformation of ER model to Star model. Based on an experiment, we prove that, by using our approach, inexperienced designers can produce Star models identical to the star models produced by experienced data warehouse designers.

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

decision support systems
computer-based decision aids


Existence and algorithm of solutions for mixed quasi-variational-like inclusions in Banach spaces In this paper, we study a class of mixed quasi-variational-like inclusion with a bifunction in reflexive Banach spaces. By applying a minimax inequality due to the first author, some existence and uniqueness theorems of solutions for the mixed quasi-variational-like inclusions are proved. Next, by applying the auxiliary variational inequality technique, we suggest an iterative algorithm to compute the approximate solutions of the mixed quasi-variational-like inclusions. The convergence criteria of the algorithm is studied under quite mild conditions. Our results represent improvement and generalization of the previously known results in literature. (c) 2005 Elsevier Ltd. 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 B I O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O 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

minimax inequality
auxiliary variational inequality
iterative algorithm

mixed quasi-variational-like inclusion
banach space


A replicated assessment and comparison of adaptation techniques for analogy-based effort estimation Variants of adaptation techniques have been proposed in previous studies to improve the performance of analogy-based effort estimation. The results of these studies are often contradictory and cannot simply be generalized because there are many uncontrollable source of variations between adaptation studies. The study presented in this paper has been carried out in order to replicate the assessment and comparison of different adaptation techniques utilised in analogy-based software effort prediction. Empirical evaluation of variants of adaptation techniques with Jack-knifing procedure have been carried out. Seven datasets come from PROMISE data repository were used for benchmarking. The results are also investigated within the presence/absence of feature subset selection algorithm. The current study permitted us to discover that linear adjustment approaches are more accurate than nonlinear adjustment because of the nature of the employed datasets that have, in most cases, normality characteristics.

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

adaptation techniques
feature subset selection

analogy-based software effort estimation


The effect of pre-warming on performance during simulated firefighting exercise Physical activity in and around the firehouse may increase body temperature. An increased body temperature reduces speed during firefighting activities. An increased body temperature blurs the own perception of quality of performance. Careful planning of activities that increase body temperature is needed.

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


choreography of web services based on natural language storybooks Universally available services, which communicate in a standardized way, can provide a new generation of middleware. Harnessing the advantages of this promising middleware technology, however, means to be capable to understand and to handle its design language which emerges from standards like SOAP, WSDL, BPEL, etc. These languages are necessary for finding, composing and orchestrating web services. If at all, only IT experts are familiar with these languages.The key actors, the domain experts of business processes, however, are not IT experts, and thus do not become the main designers. WS-Talk is a research project that encourages the co-existence of Natural Language and Web service technology. It reinforces the role of domain experts in designing business processes without having to resort to their IT colleagues. In our approach business process experts write storybooks in their own language. Their instructions are matched with semantics that represent application logic that, in turn, supports the automatic composition of software components. The WS-Talk products currently support organizations in managing their own and individual information, i.e. to set up their own enterprise search engine.

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

web service orchestration
semantic web standards
enterprise search systems
end-user programming
web service choreography


Sharing experiments using open-source software When researchers want to repeat, improve or refute prior conclusions, it is useful to have a complete and operational description of prior experiments. If those descriptions are overly long or complex, then sharing their details may not be informative. OURMINE is a scripting environment for the development and deployment of data mining experiments. Using OURMINE, data mining novices can specify and execute intricate experiments, while researchers can publish their complete experimental rig alongside their conclusions. This is achievable because of OURMINE's succinctness. For example, this paper presents two experiments documented in the OURMINE syntax. Thus, the brevity and simplicity of OURMINE recommends it as a better tool for documenting, executing, and sharing data mining experiments. Copyright 2010 John Wiley & Sons, Ltd.

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


The Allobrain: An interactive, stereographic, 3D audio, immersive virtual world This paper describes the creation of the Allobrain project, an interactive, stereographic, 3D audio, immersive virtual world constructed from fMRI brain data and installed in the Allosphere, one of the largest virtual reality spaces in existence. This paper portrays the role the Allobrain project played as an artwork driving the technological infrastructure of the Allosphere. The construction of the Cosm toolkit software for prototyping the Allobrain and other interactive, stereographic, 3D audio, immersive virtual worlds in the Allosphere is described in detail. Aesthetic considerations of the Allobrain project are discussed in relation to world-making as a means to understand and explore large data sets.

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

immersive environments
sonification
humancomputer interaction
wireless controller
ambisonic spatialization


Testicular Gonadotropin-releasing Hormone Activity, Progression of Spermatogenesis, and Sperm Transport in Vertebrates Since the end of the 1970s, studies have shown that, besides the endocrine route, a chemical mediator may also act through autocrine and/or paracrine mechanisms. This has opened new frontiers for research as a result of a redefinition of what endocrinology represents. Apart from androgens within the male gonad, testicular gonadotropin-releasing hormone, estrogens, molecular chaperones, proto-oncogenes, and, very recently, the endocannabinoid system have been shown to play important roles. Their activities to regulate spermatogenesis, including spermiogenesis and sperm maturation, will be discussed from the comparative viewpoint to describe adaptive phenomena and to speculate on evolution.

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

testis gnrh proto-oncogenes endocannabinoids


Defining sociability and social presence in Social TV Social TV, a new interactive television service, has been rapidly developing. With the conceptual model of sociability, this study empirically investigates the effects of perceived sociability on the motivations and attitudes toward Social TV. A model is created to validate the relationship of perceived sociality to social presence, usability, and intention. Empirical findings show the key influence of sociability on users acceptance and intent to continue using Social TV. Implications of the findings are discussed in terms of building a theory of sociability and providing practical insights into developing a meaningful sociable TV interface.

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


A method of reactive zoom control from uncertainty in tracking The tuning of a constant velocity Kalman filter, used for tracking by a camera fitted with a variable focal-length lens, is shown to be preserved under a scale change in process noise if accompanied by an inverse scaling in the focal length, provided the image measurement error is of fixed size in image coordinates. Based on this observation, a practical method of zoom control has been built by setting an upper limit on the probability that the innovation (and hence fixation error) exceeds the image half-width. The innovation covariance matrix used to determine the innovation limit is derived over two timescales, which enables a rapid zooming out response and slower zooming in. Experimental simulations are presented, before results are given from a video-rate implementation using a camera with two motorized orientation axes and fitted with a computer-controlled zoom lens. The delays in the feedback loops, comprising image capture delay, platform response lag and zoom lens response lag, are carefully calibrated by fitting to their frequency responses. It is found that the cumulative uncertainty in delay gives rise to an image error which is part constant and part proportional to focal length, resulting in a beneficial adaptation of the filter.

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


Investigations of optimum tier architectures for ASICs The optimum tier architectures for ASICs are investigated by using a methodology for predicting packing efficiency of a logic block (the ratio of total cell area to the block area including space regions between cells). In the methodology based on Rent's rule, (1) the empirical parameters required for the prediction are derived from the results of our ASIC products. (2) The concept of logic distance, which is expressed in units of the number of cells rather than the absolute net-length, is introduced. (3) Not only performance constraints but also reliability constraints are incorporated. These allow us to make a quantitative comparison of the packing efficiency between various cell and tier structures. It is found that, for mega-cell blocks, all minimum-pitch layer architecture with buffer insertion is expected to give more than 20% reduction in block areas compared to the minimum-pitch + bi-pitch architecture, while satisfying the performance and reliability constraints.

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


Protocols for rapid restoration in WDM optical networks Wavelength division multiplexing (WDM) networks have become a viable solution to meet the increasing bandwidth demand. These networks carry messages in the optical domain at data rates of several gigabits per second. Such high data rates make it necessary for using efficient restoration protocols in an event of a failure. This paper addresses the issue of dynamic path-based restoration in WDM optical networks. Dynamic restoration protocols can be used for restoring unprotected paths, that is, paths that do not reserve backup paths in advance. Our objective is to develop protocols that ensure rapid recovery while keeping the restoration ratio high. We develop two distributed dynamic restoration protocols called disjoint path-wavelength grouping (PWG) protocol and disjoint weighted PWG protocol. Those protocols group all the candidate backup paths of the failed paths into path-disjoint groups before assigning wavelengths to them. This allows the failed paths to search different sets of wavelengths on various candidate backup paths in parallel without any reservation conflicts. Also, it does not require any reservation retries, thus resulting in rapid restoration. The grouping method attempts to restore increased number of failed paths by allowing increased number of wavelengths to be searched on a path. We also consider the problem of prioritizing the paths where high-priority paths have better chances of recovery than the low-priority paths. The effectiveness of the proposed protocols is verified through extensive simulation results. (C) 2004 Elsevier B.V. All rights reserved.

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

survivability
protection
distributed protocol


diverse retrieval via greedy optimization of expected 1-call@k in a latent subtopic relevance model It has been previously observed that optimization of the 1-call@k relevance objective (i.e., a set-based objective that is 1 if at least one document is relevant, otherwise 0) empirically correlates with diverse retrieval. In this paper, we proceed one step further and show theoretically that greedily optimizing expected 1-call@k w.r.t. a latent subtopic model of binary relevance leads to a diverse retrieval algorithm sharing many features of existing diversification approaches. This new result is complementary to a variety of diverse retrieval algorithms derived from alternate rank-based relevance criteria such as average precision and reciprocal rank. As such, the derivation presented here for expected 1-call@k provides a novel theoretical perspective on the emergence of diversity via a latent subtopic model of relevance --- an idea underlying both ambiguous and faceted subtopic retrieval that have been used to motivate diverse retrieval.

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

maximal marginal relevance
set-level relevance


Polynomial regression interval-valued fuzzy systems In recent years, the type-2 fuzzy sets theory has been used to model and minimize the effects of uncertainties in rule-base fuzzy logic system (FLS). In order to make the type-2 FLS reasonable and reliable, a new simple and novel statistical method to decide interval-valued fuzzy membership functions and probability type reduce reasoning method for the interval-valued FLS are developed. We have implemented the proposed non-linear (polynomial regression) statistical interval-valued type-2 FLS to perform smart washing machine control. The results show that our quadratic statistical method is more robust to design a reliable type-2 FLS and also can be extend to polynomial model.

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

statistical interval-valued fuzzy reasoning


An Integrated Electrooculography and Desktop Input Bimodal Interface to Support Robotic Arm Control This letter describes a man-machine bimodal interface that is based on the combination of visual control, through electrooculography, and manual control, using a desktop input device that is operated with the hand. This letter introduces design concepts for this bimodal interface with the goal to support those that cannot use desktop device controls, those that require support with desktop device controls, as well as those with normative capabilities but who wish to enhance speed performance. To that end, several control strategies have been designed. Each control strategy has been tested in applications with a real robot arm. The results indicate that such bimodal interfaces show promise to support a range of motor limitations.

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

bimodality
electrooculography (eog)
human-robot interface


The branching-time transformation technique for chain datalog programs The branching-time transformation technique has proven to be an efficient approach for implementing functional programming languages. In this paper we demonstrate that such a technique can also be defined for logic programming languages. More specifically, we first introduce Branching Datalog, a language that can be considered as the basis for branching-temporal deductive databases. We then present a transformation algorithm from Chain Datalog programs to the class of unary Branching Datalog programs with at most one IDB atom in the body of each clause. In this way, we obtain a novel implementation approach for Chain Datalog, shedding at the same time new light on the power of branching-time logic programming.

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

chain programs
program transformation
temporal logic programming
branching time


Large scale multikernel relevance vector machine for object detection The Relevance Vector Machine(RVM) is a widely accepted Bayesian model commonly used for regression and classification tasks. In this paper we propose a multikernel version of the RVM and present an alternative inference algorithm based on Fourier domain computation to solve this model for large scale problems, e.g. images. We then apply the proposed method to the object detection problem with promising results.

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

relevance vector machine
object detection


On families of categorial grammars of bounded value, their learnability and related complexity questions In Kanazawa (1998) [1], the learnability of several parameterized families of categorial grammar classes was studied. These classes were shown to be learnable in the technical sense of identifiability in the limit from positive data. They are defined in terms of bounds on parameters of the grammars which intuitively correspond to restrictions on linguistic aspects, such as the amount of lexical ambiguity. The time complexity of learning these classes has been studied in Costa Florncio (2003) [2]. It was shown that, for most of these classes, selecting a grammar from the class that is consistent with given data is NP-hard. In this paper existing complexity results are sharpened by demonstrating W[2]-hardness. Additionally, parameters are defined that allow FPT-results; roughly, this implies that if these parameters are fixed, these problems become tractable. We also define the new family G(k-sum-val), which is natural from the viewpoints of Parameterized Complexity, a flourishing area of Complexity Theory (see Downey and Fellows (1999) [3]) and from Descriptional Complexity, a sub-area of Formal Language Theory (see Holzer and Kutrib (2010) [4]). We prove its learnability, analyze its relation to other classes from the literature and prove a hierarchy theorem. This approach is then generalized to a parameterized family defined in terms of a bound on the descriptional complexity expressed as a Holder norm. We show that both the hierarchy result and the property of finite elasticity (and thus learnability) are preserved under this generalization. (c) 2012 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 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 B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O

finite elasticity
parameterized complexity
categorial grammar

grammar induction
identification in the limit
regular tree languages
holder norms


Structural Basis for Ca2+ Regulation in the Na+/Ca2+ Exchanger Binding of Na+ and Ca2+ ions to the large cytosolic loop of the Na+/Ca2+ exchanger (NCX) regulates its ion transport across the plasma membrane. We determined the solution structures of two Ca2+-binding domains (CBD1 and CBD2) that, together with an ?-catenin-like domain (CLD) form the regulatory exchanger loop. CBD1 and CBD2 constitute a novel Ca2+-binding motif and are very similar in the Ca2+-bound state. Strikingly, in the absence of Ca2+ the upper half of CBD1 unfolds while CBD2 maintains its structural integrity. Together with a sevenfold higher affinity for Ca2+ this suggests that CBD1 is the primary Ca2+ sensor. Specific point mutations in either domain largely allow the interchange of their functionality and uncover the mechanism underlying Ca2+ sensing in NCX

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

na+/ca2+ exchanger
structure
calcium-binding protein
calcium sensor


Eye contact and video-mediated communication: A review A relatively new form of human communication, video-conferencing has become more popular as video technology improves and with increasing demands for real-time communication across greater distances. The full effects of video-conferencing on human communication are still being explored. Video-conferencing is presumed to be a somewhat richer form of communication than email and telephone, but not quite as informative as face-to-face communication. This review explores research into the influence of eye contact on communication and how video-conferencing mediates both verbal and non-verbal interactions. Facilitation of eye contact is a challenge that must be addressed so that video-conferencing can approach the rich interactions of face-to-face communication.

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

video-conferencing eye-tracking display laptop


Reticella: An Execution Trace Slicing and Visualization Tool Based on a Behavior Model Program comprehension using dynamic information is one of key tasks of software maintenance. Software visualization with sequence diagrams is a promising technique to help developer comprehend the behavior of object-oriented systems effectively. There are many tools that can support automatic generation of a sequence diagram from execution traces. However it is still difficult to understand the behavior because the size of automatically generated sequence diagrams from the massive amounts of execution traces tends lobe beyond developer's capacity. In this paper, we propose an execution trace slicing and visualization method. Our proposed method is capable of slice calculation based on a behavior model which can treat dependencies based on static and dynamic analysis and supports for various programs including exceptions and multi-threading. We also introduce our tool that perform our proposed slice calculation on the Eclipse platform. We show the applicability of our proposed method by applying the tool to two Java programs as case studies. As a result, we confirm effectiveness of our proposed method for understanding the behavior of object-oriented systems.

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

program slicing
program maintenance
reverse engineering
debugging


towards compensation for radial lens distortion using radial basis functions Many of the algorithms in computer vision are based on the assumption of linear imaging process, i.e. the world point, image point and the camera center are collinear. However, this assumption is sometimes violated in the case of real lenses. This phenomenon, known as radial lens distortion, can easily be characterized by straight scene lines imaged as curved lines. The most frequently used remedy for this distortion is to model it using some simple equations. The parameters of these equations are then computed by various methods and reported as a part of calibration parameters of the camera under consideration. This paper, however, proposes a novel approach which does not impose any specific model on radial lens distortion. Instead, it tries to learn the distortion pattern from a sample image and then compensate for it. To this end, the proposed method exploits a special class of functions known as Radial Basis Functions to learn the distortion pattern of straight scene lines. Also, some examples have been provided to illustrate the efficiency of the proposed method.

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

radial basis functions
radial lens distortion


I-G-H-KKM mappings and minimax inequalities First, based on the notions of I-G-H-KKM mappings and I-G-H-KKM selections, some nonempty intersection theorems are proved, and then the obtained I-G-H-KKM theorems are applied to the theory of a new class of generalized minimax inequalities in a G-H-space setting. (C) 1999 Elsevier Science Ltd. 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

i-g-h-kkm mapping
i-g-h-kkm selection
generalized minimax inequality
g-h-space


visualization methods for outdoor see-through vision Visualizing occluded objects is a useful applications of Mixed Reality (MR), which we call "see-through vision." For this application, it is important to display occluded objects in such a manner that they can be recognized intuitively by the user.Here, we evaluated five visualization methods for see-through vision that help the user to intuitively recognize occluded objects in outdoor scenes: "elimination of occluding object," "ground grid," "overlaying model of occluding object," "top-down view," and "on-off switching of MR display." As we applied a new handheld MR device for outdoor see-through vision, we conducted subjective experiments to determine the best combination of methods. The experimental results indicated the combination of showing the ground grid, overlaying the wire-frame models of occluding objects, and top-down view to be optimal, while it is not necessary to display occluding objects for outdoor see-through vision with a handheld device, because users can see them with the naked eye.

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

augmented reality
see-through
subjective evaluation


On the convergence of Ritz pairs and refined Ritz vectors for quadratic eigenvalue problems For a given subspace, the Rayleigh-Ritz method projects the large quadratic eigenvalue problem (QEP) onto it and produces a small sized dense QEP. Similar to the Rayleigh-Ritz method for the linear eigenvalue problem, the Rayleigh-Ritz method defines the Ritz values and the Ritz vectors of the QEP with respect to the projection subspace. We analyze the convergence of the method when the angle between the subspace and the desired eigenvector converges to zero. We prove that there is a Ritz value that converges to the desired eigenvalue unconditionally but the Ritz vector converges conditionally and may fail to converge. To remedy the drawback of possible non-convergence of the Ritz vector, we propose a refined Ritz vector that is mathematically different from the Ritz vector and is proved to converge unconditionally. We construct examples to illustrate our theory.

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


A Brief Critique of Pure Hypercomputation Hypercomputationthe hypothesis that Turing-incomputable objects can be computed through infinitary meansis ineffective, as the unsolvability of the halting problem for Turing machines depends just on the absence of a definite value for some paradoxical construction; nature and quantity of computing resources are immaterial. The assumption that the halting problem is solved by oracles of higher Turing degree amounts just to postulation; infinite-time oracles are not actually solving paradoxes, but simply assigning them conventional values. Special values for non-terminating processes are likewise irrelevant, since diagonalization can cover any amount of value assignments. This should not be construed as a restriction of computing power: Turings uncomputability is not a barrier to be broken, but simply an effect of the expressive power of consistent programming systems.

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

diagonalization
halting problem
hypercomputation


Perfect codes in direct graph bundles We study existence of perfect codes in direct graph bundles of cycles over cycles. We start with shifts and proceed with reflections. A complete characterization of perfect codes in direct graph bundles of cycles over cycles is given.

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

combinatorial problems
direct graph bundle


GENDER AND DSS DESIGN - THE RESEARCH IMPLICATIONS Although decisions and decision-making lie at the heart of decision support system (DSS) research, certain aspects of human decision-making have been neglected by DSS builders. One of these is the role of gender in decision-making, Decision support systems are constructed largely upon the assumption of an androgynous user, but, clearly, if males and females take decisions in different ways or prefer different styles of information, then their use of DSS may differ. This may have important organisational implications, especially as women ascend the corporate ladder. The purpose of this paper is to evaluate the literature on gender differences and to highlight explicitly the role of this literature in DSS design. It is hoped that, by raising dormant questions, the debate may be stimulated. Finally, a research agenda is suggested.

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


exploitation and exploration in a performance based contextual advertising system The dynamic marketplace in online advertising calls for ranking systems that are optimized to consistently promote and capitalize better performing ads. The streaming nature of online data inevitably makes an advertising system choose between maximizing its expected revenue according to its current knowledge in short term (exploitation) and trying to learn more about the unknown to improve its knowledge (exploration), since the latter might increase its revenue in the future. The exploitation and exploration (EE) tradeoff has been extensively studied in the reinforcement learning community, however, not been paid much attention in online advertising until recently. In this paper, we develop two novel EE strategies for online advertising. Specifically, our methods can adaptively balance the two aspects of EE by automatically learning the optimal tradeoff and incorporating confidence metrics of historical performance. Within a deliberately designed offline simulation framework we apply our algorithms to an industry leading performance based contextual advertising system and conduct extensive evaluations with real online event log data. The experimental results and detailed analysis reveal several important findings of EE behaviors in online advertising and demonstrate that our algorithms perform superiorly in terms of ad reach and click-through-rate (CTR).

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

exploitation and exploration
online advertising


Impact of the non-uniform intensity distribution caused by a meshed pellicle of extreme ultraviolet lithography The meshed pellicle can make the intensity distribution on the wafer non-uniform. Coherence radius and mesh pitch are key factor to reduce the non-uniformity. We develop physical optics simulation to simulate non-uniformity on the wafer. The non-uniformity is directly proportional to the CDU. We can optimize the mesh parameters which can meet the CDU allowance.

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

euvl
euv pellicle
meshed pellicle
mask defect control


On CCZ-equivalence of addition mod 2 (n) We show that addition mod 2 (n) is CCZ-equivalent to a quadratic vectorial Boolean function. We use this to reduce the solution of systems of differential equations of addition to the solution of an equivalent system of linear equations and to derive a fully explicit formula for the correlation coefficients, which leads to enhanced results about the Walsh transform of addition mod 2 (n) . The results have direct applications in the cryptanalysis of cryptographic primitives which use addition mod 2 (n) .

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

walsh transform
differential equations of addition


Usability evaluation of multi-modal biometric verification systems As a result of the evolution in the field of biometrics, a new breed of techniques and methods for user identity recognition and verification has appeared based on the recognition and verification of several biometric features considered unique to each individual. Signature and voice characteristics, facial features, and iris and fingerprint patterns have all been used to identify a person or just to verify that the person is who he/she claims to be. Although still relatively new, these new technologies have already reached a level of development that allows its commercialization. However, there is a lack of studies devoted to the evaluation of these technologies from a user-centered perspective. This paper is intended to promote user-centered design and evaluation of biometric technologies. Towards this end, we have developed a platform to perform empirical evaluations of commercial biometric identity verification systems, including fingerprint, voice and signature verification. In this article, we present an initial empirical study in which we evaluate, compare and try to get insights into the factors that are crucial for the usability of these systems. (c) 2006 Elsevier B.V. All rights reserved.

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

evaluation
usability
identity verification

biornetrics
fingerprint recognition
signature recognition
voice recognition


towards a scalable and robust dht The problem of scalable and robust distributed data storage has recently attracted a lot of attention. A common approach in the area of peer-to-peer systems has been to use a distributed hash table (or DHT). DHTs are based on the concept of virtual space. Peers and data items are mapped to points in that space, and local-control rules are used to decide, based on these virtual locations, how to interconnect the peers and how to map the data to the peers.DHTs are known to be highly scalable and easy to update as peers enter and leave the system. It is relatively easy to extend the DHT concept so that a constant fraction of faulty peers can be handled without any problems, but handling adversarial peers is very challenging. The biggest threats appear to be join-leave attacks (i.e., adaptive join-leave behavior by the adversarial peers) and attacks on the data management level (i.e., adaptive insert and lookup attacks by the adversarial peers) against which no provably robust mechanisms are known so far. Join-leave attacks, for example, may be used to isolate honest peers in the system, and attacks on the data management level may be used to create a high load-imbalance, seriously degrading the correctness and scalability of the system.We show, on a high level, that both of these threats can be handled in a scalable manner, even if a constant fraction of the peers in the system is adversarial, demonstrating that open systems for scalable distributed data storage that are robust against even massive adversarial behavior are feasible.

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

use
scalability
concept
data management
attention
distributed hash table
systems
space
behavior
correctness
storage
data
interconnect
distributed
rules
update

open system
point
examples
overlay networks
control
locality
adapt
locatability
peer-to-peer systems
robustness
virtualization
attack


The parallel clientserver paradigm ? We consider the problem of modeling the algorithmic complexity of dynamic parallel clientserver systems (PCS). The proposed PCS model is characterized by two features that distinguish it from common clientserver systems. In the PCS model, both the client and the server are written and executed as parallel programs that use shared memory for communication. This is in contrast to the message passing style used by the common TCP/IP socket, for example, or by Java's remote method invocation. Secondly, the client and the server are also dynamic programs capable of adapting to any change in the number of machines that are available as processing units. We mainly focus on the problem of implementing fast queues where many elements can be inserted and deleted with a constant overhead per element. We use the PCS model to analyze the fast queue algorithm as an asynchronous algorithm and show its optimality. A novel criterion for measuring the asynchronous complexity of PRAM algorithms is introduced.

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

client
server
shared memory
asynchronous
pram


Towards Fault-tolerant HLA-based Distributed Simulations Large scale High Level Architecture (HLA)-based simulations are built to study complex problems, and they often involve a large number of federates and vast computing resources. Simulation federates running at different locations are subject to failure. The failure of one federate can lead to the crash of the overall simulation execution. Such risk increases with the scale of a distributed simulation. Hence, fault tolerance is required to support runtime robustness. This paper introduces a framework for robust HLA-based distributed simulations using a 'Decoupled Federate Architecture'. The framework provides a generic fault-tolerant model, which deals with failure with a dynamic substitution approach. A sender-based method is designed to ensure reliable in-transit message delivery, which is coupled with a novel algorithm to perform effective fossil collection. The fault-tolerant model also avoids any unnecessary repeated computation when handling failure. Using a middleware approach, the framework supports reusability of legacy federate code and it is platform-neutral and independent of federate modeling approaches. Experiments have been carried out to validate and benchmark the fault-tolerant federates using an example of a supply-chain simulation. The experimental results show that the framework provides correct failure recovery. The results also indicate that the framework only incurs minimal overhead for facilitating fault tolerance and has a promising scalability.

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

high level architecture
fault tolerance
decoupled federate architecture


EIT image reconstruction with four dimensional regularization Electrical impedance tomography (EIT) reconstructs internal impedance images of the body from electrical measurements on body surface. The temporal resolution of EIT data can be very high, although the spatial resolution of the images is relatively low. Most EIT reconstruction algorithms calculate images from data frames independently, although data are actually highly correlated especially in high speed EIT systems. This paper proposes a 4-D EIT image reconstruction for functional EIT. The new approach is developed to directly use prior models of the temporal correlations among images and 3-D spatial correlations among image elements. A fast algorithm is also developed to reconstruct the regularized images. Image reconstruction is posed in terms of an augmented image and measurement vector which are concatenated from a specific number of previous and future frames. The reconstruction is then based on an augmented regularization matrix which reflects the a priori constraints on temporal and 3-D spatial correlations of image elements. A temporal factor reflecting the relative strength of the image correlation is objectively calculated from measurement data. Results show that image reconstruction models which account for inter-element correlations, in both space and time, show improved resolution and noise performance, in comparison to simpler image models.

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

electrical impedance tomography
regularization
image reconstruction


Accounting for saturation in conformal mapping modeling of a permanent magnet synchronous machine Purpose - In the electromagnetic field simulation of modern servo drives, the computation of higher time and space harmonics is essential to consider appearing torque pulsations, radial forces and ripple torques. The purpose of this paper is to propose a method to cover the effect of saturation on the armature flux density within conformal mapping (CM) by an finite element (FE) re-parameterization. Design/methodology/approach - Field computation by CM techniques is a time-effective method to compute the radial and tangential field components, but it generally neglects the effect of saturation. Findings - This paper presents a method to re-parameterize the CM approach by single FE computations so as to consider saturation in the model over a wide operation range of the electrical drive. Practical implications - The proposed method is applied to a surface permanent magnet synchronous machine, and compared to numerical results obtained by finite element analysis (FEA). Originality/value - The paper shows that an accuracy similar to that of FE simulations can be obtained with still the low-computation time that is the characteristic of analytical models.

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

magnetic fields
modelling
electrical machines
air-gap permeance
permanent-magnet motors
design methodology
air-gap field


MIRF: A Multimodal Image Registration and Fusion Module Based on DT-CWT Image Fusion is a powerful and necessary tool to incorporate the relevant visual information provided by multiple sensors simultaneously. The quality of the results however, is bounded not only by the quality of the algorithm, but also by the outcome of the required image registration algorithm. Despite this dependency, images are always assumed to be pre-aligned. With 3rd Generation surveillance systems, centralized computations are shifted to distributed visual nodes low on computational and power resources. This article presents a combined approach that is able to register and fuse multimodal images, dubbed MIRF. Combining both algorithms into one image domain not only offers a reduction in complexity making it a better fit for a resource constrained embedded platform, but also improves the response time of the system. Two algorithms for area-based image registration and object-based image fusion are proposed. They are based on Dual-Tree Complex Wavelet Transform. Qualitative and quantitative experimental results show that the proposed registration approach achieves comparable accuracies to its counterparts, with lower-complexity. On the other hand, the developed fusion scheme exhibits higher accuracy and proves its immunity to minor errors in registration

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


CMOS active transformers and their applications in voltage-controlled quadrature oscillators This paper introduces CMOS active transformers synthesized using MOS transistors only. The proposed active transformers are evolved from their active inductor counterparts and offer a number of attractive characteristics as compared with spiral transformers including a tunable coupling ratio, large and tunable self and mutual inductances, high and tunable quality factors, and a small silicon area consumption. The characteristics of the proposed active transformers including the tunability of the self and mutual inductances, power sensitivity, noise, and quality factor are investigated both analytically and numerically using simulation. The application of the proposed active transformers is exemplified using a 1.6 GHz quadrature VCO implemented in TSMC-0.18 mu m 1.8 V CMOS technology and analyzed using SpectreRF from Cadence Design Systems with BSIM3v3 device models. The total transistor area and power consumption of the VCO are 107 mu m(2) and 10.8 mW, respectively. The phase noise of the VCO is -114.6 dBc/Hz at 1 MHz frequency offset.

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

cmos active transformers
quadrature oscillators


Interactive object recognition system for a helper robot using photometric invariance We are developing a helper robot that carries out tasks ordered by the user through speech. The robot needs a vision system to recognize the objects appearing in the orders. It is, however, difficult to realize vision systems that can work in various conditions. Thus, we have proposed to use the human user's assistance through speech. When the vision system cannot achieve a task, the robot makes a speech to the user so that the natural response by the user can give helpful information for its vision system. Our previous system assumes that it can segment images without failure. However, if there are occluded objects and/or objects composed of multicolor parts, segmentation failures cannot be avoided. This paper presents an extended system that tries to recover from segmentation failures using photometric invariance. If the system is not sure about segmentation results, the system asks the user by appropriate expressions depending on the invariant values. Experimental results show the usefulness of the system.

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

human robot interaction
multimodal interface
interactive object recognition


Insights into the permeability of drugs and drug-like molecules from MI-QSAR and HQSAR studies Membrane-interaction QSAR (MI-QSAR) and Holographic QSAR (HQSAR) analyses have been performed on a diverse set of drugs and drug-like molecules. MI-QSAR combines a set of membrane-solute interaction properties calculated during molecular dynamics simulation with the set of classical solute descriptors to predict the biological behavior of drugs and drug-like molecules. HQSAR is a technique which employs fragment fingerprints or molecular holograms as predictive variables of biological activity. A data set of 60 structurally diverse molecules with permeability coefficients were used to construct significant MI-QSAR and HQSAR models of Caco-2 cell permeation. A statistically meaningful MI-QSAR model was obtained with r(2)=0.805 and q(2)=0.696. Subsequently, HQSAR models were developed on the same data set. The best HQSAR model (r(2)=0.915, q(2)=0.539) was obtained with fragment distinctions atom, bond, donor and acceptor with atom count 4 to 7. The predictions for training and test set molecules are in good agreement with experimental results and show the potential of models for untested compounds. This displays the importance of MI-QSAR and HQSAR analysis in estimating ADME properties characterized by the transport of solutes through biological membranes.

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

descriptors
fragment
hqsar
molecular dynamics simulation


Quantum Image Filtering in the Frequency Domain In this paper we address the emerging field of Quantum Image Processing. We investigate the use of quantum computing systems to represent and manipulate images. In particular, we consider the basic task of image filtering. We prove that a quantum version for this operation can be achieved, even though the quantum convolution of two sequences is physically impossible. In our approach we use the principle of the quantum oracle to implement the filter function. We provide the quantum circuit that implements the filtering task and present the results of several simulation experiments on grayscale images. There are important differences between the classical and the quantum implementations for image filtering. We analyze these differences and show that the major advantage of the quantum approach lies in the exploitation of the efficient implementation of the quantum Fourier transform.

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

quantum image processing
quantum fourier transform
quantum oracle
image filtering


Matrix compression for spherical harmonics expansions of the Boltzmann transport equation for semiconductors We investigate numerical solution schemes for the semiconductor Boltzmann transport equation using an expansion of the distribution function in spherical harmonics. A complexity analysis shows that traditional implementations using higher-order expansions suffer from huge memory requirements, especially for two- and three-dimensional devices. To overcome these complexity limitations, a compressed matrix storage scheme using Kronecker products is proposed, which reduces the asymptotic memory requirements for the storage of the system matrix significantly. The total memory requirements are then dominated by the memory required for the unknowns. Numerical results demonstrate the applicability of our method and confirm our theoretical results.

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


Untraceable blind signature schemes based on discrete logarithm problem With the help of a blind signature scheme, a requester can obtain a signature on a message from a signer such that the signer knows nothing about the content of the messages and is unable to link the resulting message-signature pair; namely, a blind signature scheme can achieve both blindness and untraceability. Due to the above properties, the blind signature scheme can be used in cryptographic applications such as electronic voting systems and cash payment systems. So far, most of the proposed blind signature schemes are based on the difficulty of solving the factoring problem and quadratic residues. In this paper, the authors intend to propose two new untraceable blind signature schemes based on the difficulty of solving the discrete logarithm problem. The two blind signature schemes are two variations of the DSA signature scheme and can fully satisfy all of the properties a blind signature scheme can have.

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


Fuzzy inventory problems for perishable commodities This paper considers an inventory control model for a single perishable product with a fuzzy shortage cost and a fuzzy outdating cost. This model is a single-period horizon model. Due to fuzziness of shortage and outdating costs, an expected profit function is represented with a fuzzy set. The purpose of this paper is to find the solution maximizing the expected profit function. After defining a nondominated ordering quantity based on fuzzy max order, we seek some of them and investigate an effect of the fuzziness on the obtained solutions.

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

fuzzy shortage cost
fuzzy outdating cost
nondominated ordering quantity

perishable commodity
two types of customer


A renormalization approach to model interaction in microstructured solids: Application to porous elastomer The overall physical behavior of microstructured (heterogeneous or periodic) materials depends strongly on the size, shape, and spatial distribution of the separate constituents. To predict the macroscopic constitutive response for these materials, we apply a coarse-graining transformation termed renormalization developed in statistical physics that bridges between the macroscopic quantities and those at finer scales. Based on this coarse-graining transformation, a two-scale generalized model for microstructured solids is built by utilizing the mathematical framework of generalized continuum mechanics. The model is labeled as generalized because it contains extra degrees of freedom representing microscopic deformation. The present study applies the renormalization technique to develop a two-scale continuum material model for porous elastomer and implements it into commercial finite element software. Direct numerical simulation of porous elastomer computational cells is used to calibrate the model parameters. The complex effect microstructure (voids) has on constitutive behavior is examined in detail with particular attention paid to void size and distribution effects in the context of multi-axial loading, macroscopic instability (buckling), bending, and fracture.

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


An \(O(n^4)\) Time Algorithm to Compute the Bisection Width of Solid Grid Graphs The bisection problem asks for a partition of the \(n\) vertices of a graph into two sets of size at most\(\lceil n/2\rceil \), so that the number of edges connecting the sets is minimised. A grid graph is a finite connected subgraph of the infinite two-dimensional grid. It is called solid if it has no holes. Papadimitriou and Sideri (Theory Comput Syst 29:97110, 1996) gave an \(O(n^5)\) time algorithm to solve the bisection problem on solid grid graphs. We propose a novel approach that exploits structural properties of optimal cuts within a dynamic program. We show that our new technique leads to an \(O(n^4)\) time algorithm.

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