designing tomorrow's smart products' experience with the smart-itsxs platform Designers will increasingly be facing the challenge of creating context-aware or smart productseveryda y objects that have embedded computation, sensing, and communication capabilities. Smart-Its is a prototyping platform for creating such objects, that is being developed in a European Union research project. A Smart-It is a very small computer equipped with wireless communication and a set of sensors. We describe how we approached the design of future user experiences and interactions based on the Smart-Its platform. Using scenario-based methods to support collaboration within a multi-disciplinary working group, we developed innovative demonstrators of how smart objects support dynamic usage situations and new interactions in a restaurant setting. A group of designers were invited to provide feedback on design aspects of prototyping with Smart-Its. We found that our prototypes and design materials stimulated creative speculation about future interactive products.

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

interaction design
product design
concept design
pervasive computing
ubiquitous computing


Assessment of the QoE in Voice Services Based on the Self-Organizing Neural Network Structure The quality of the transmitted voice in the Voice over IP (VoIP) service should be investigated from the end-user perspective, by estimating perceptional metrics like Mean Opinion Score (MOS). The research methodology of that kind is a particular transfer of the specific technical parameters, related to the IP data transmission, to level of service acceptance by an end-user. The article presents the research results obtained by the simulation of the developed MOS estimation algorithm based on the modified neural Self-Organizing Maps (SOM) structure.

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

speech quality
self-organizing neural networks


Stiction identification in nonlinear process control loops Nearly 20-30% of all process control loops oscillate due to stiction resulting in productivity losses. Thus, detection and quantification of stiction in control valves using routine operating data is an important component of any automated controller performance monitoring application. Many techniques have been proposed for the detection and quantification of stiction. However, most of the approaches assume that the underlying process is linear; very little work is available for nonlinear processes. In this paper, Volterra model-based technique is investigated for the detection of stiction in closed-loop nonlinear systems. The advantages of the proposed method are: (i) it can be used to detect stiction in nonlinear systems and (ii) requires no prior information on whether the loop is linear or nonlinear. Results obtained from simulation and industrial case studies demonstrate the utility of the proposed methodology. (C) 2010 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

nonlinearities
valve stiction
volterra series
root cause analysis


Time Course of Retrieval and Movement Preparation in Music Performance Abstract: Music performance requires that musicians represent many different kinds of sequence structure: musicians must remember which pitch to produce, when to produce it, and how to produce it (with what movements). The time course of item retrieval and movement preparation processes during music performance are considered. Serially ordered stage models of retrieval, in which item retrieval ends before movement preparation begins, are compared with interactive cascade models, in which the time course of both processes overlap, permitting interaction. Evidence from transfer of learning paradigms, production errors, and anticipatory movements, as measured in motion capture, are described. This early evidence suggests different time courses for item retrieval (slower, earlier) than for movement preparation (faster, later) with significant temporal overlap during music performance.

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


Flow simulation in industrial cyclone separator The problem of ash settling on super-heater tube bank, due to improper velocity distribution, in the cyclone separator used at Circulating Fluidized Bed Combustion (CFBC) has been investigated by means of computational fluid dynamic techniques. With the help of Computational Aided Design (CAD) software packages, the geometries of recycling cyclone, has been constructed. With the suitable domain decomposition for the cyclone geometry, multi-block structured mesh has been generated and exported to commercial Computational Fluid Dynamic (CFD) solver TASCflow. After assembling these grids in the flow solver, duplicate elements at mating surfaces are eliminated through generalized grid interfaces. Incompressible viscous flow for the specified flow conditions are simulated and numerical results are interpreted through contour plots and streak lines. The velocity distribution pattern obtained from the analysis exhibits strong flow recirculation with large turbulent eddies in the cyclone outlet. The analysis also observed high pressure drop across the cyclone separator. To improve the velocity distribution and to reduce the pressure drop, geometry has been modified with the deflector plates in the outlet duct and repeated the simulation. The results obtained for modified geometry are encouraging and shown the improved velocity distribution pattern in the outlet duct. The calculation of particle trajectories depends upon Stokes number, relative velocity of fluid/particles and concentration of particles. If the Stokes number, defined as the ratio of particle response time to system response time is less than one, particles motion is inline with the fluid motion. If the Stokes number is greater than one, particle motion deviates the fluid streams. Effects of these particle impacts are significant on component surface, especially, when they reacts/rebounds the wall surfaces.

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

circulating fluidized bed combustion
pressure drop
particle trajectories

flow recirculation geometry modification


Compact LED projector with tapered light pipes for moderate light output applications LED-based projectors have numerous advantages compared to traditional projectors. They are more compact, exhibit a larger color gamut and a longer lifetime, the supply voltage is lower and they can even operate on batteries. Despite their optical power per tendue is significantly lower than that of an UHP-lamp, they can be used in low power applications. In this paper, we will present a very compact architecture that produces almost 60lm D65 light with one red, one green and one blue LED and three small LCOS panels (0.64in.). In this architecture we have replaced the collection lenses, light pipes (or lens arrays) and relay lenses by Gradually Tapered Light Pipes.

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


Adaptive medial-axis approximation for sphere-tree construction Hierarchical object representations play an important role in performing efficient collision handling. Many different geometric primitives have been used to construct these representations, which allow areas of interaction to be localized quickly. For time-critical algorithms, there are distinct advantages to using hierarchies of spheres, known as sphere-trees, for object representation. This article presents a novel algorithm for the construction of sphere-trees. The algorithm presented approximates objects, both convex and non-convex, with a higher degree of fit than existing algorithms. In the lower levels of the representations, there is almost an order of magnitude decrease in the number of spheres required to represent the objects to a given accuracy.

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

animation
object approximation
medial axis approximation
simulation level-of-detail


Reversible modified reconstructability analysis of Boolean circuits and its quantum computation Modified reconstructability analysis (MRA) can be realized reversibly by utilizing Boolean reversible (3,3) logic gates that are universal in two arguments. The quantum computation of the reversible MRA circuits is also introduced. The reversible MRA transformations are given a quantum form by using the normal matrix representation of such gates. The MRA-based quantum decomposition may play an important role in the synthesis of logic structures using future technologies that consume less power and occupy less space.

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


Application of a Fuzzy Programming Through Stochastic Particle Swarm Optimization to Assessment of Filter Management Strategies in Fluid Power System Under Uncertainty A fuzzy programming through stochastic particle swarm optimization is developed for the assessment of filter allocation and replacement strategies in fluid power system (FPS) under uncertainty. It can not only handle uncertainties expressed as L-R fuzzy numbers but also enhance the system robustness by transforming the fuzzy inequalities into inclusive constraints. As the simulation results indicate, the developed model can successfully decrease the total cost and enhanced the safety of system. Generally, it is believed that the model can help identify excellent filter allocation and replacement strategy with minimized operation cost and system failure risk while protecting the system.

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

fluid power system
stochastic particle swarm optimization


A monitoring and diagnostic expert system for carbon dioxide capture The research objective is to design and construct a knowledge-based decision support system for monitoring, control and diagnosis of the carbon dioxide capture process, which is a complicated task involving manipulation of sixteen components and their operating parameters. Since manipulation of critical parameter values directly impacts performance of the plant and carbon dioxide capture efficiency, it is important to effectively monitor, control and diagnose the process. This paper describes development of a knowledge-based decision support system for the carbon dioxide capture process. The knowledge acquisition process was conducted based on the Inferential Modeling Technique, and the knowledge-based system was implemented with G2. Since the reboiler heat duty is the most significant parameter influencing the carbon dioxide production rate, in the current version, the Carbon Dioxide Capture Monitoring and Diagnostic (CDCMD) system controls the heat duty to maintain the desired carbon dioxide production rate, thereby improving performance of the plant and enhancing efficiency of the carbon dioxide capture process. The CDCMD system provides decision support to the operator in monitoring the process; it can also function as a tutorial system for novice operators.

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

monitoring
diagnosis
carbon dioxide capture


Warping the time on data streams Continuously monitoring through time the correlation/distance of multiple data streams is of interest in a variety of applications, including financial analysis, video surveillance, and mining of biological data. However, distance measures commonly adopted for comparing time series, such as Euclidean and Dynamic Time Warping (DTW), either are known to be inaccurate or are too time-consuming to be applied in a streaming environment. In this paper we propose a novel DTW-like distance measure, called Stream-DTW (SDTW), which unlike DTW can be efficiently updated at each time step. We formally and experimentally demonstrate that SDTW speeds up the monitoring process by a factor that grows linearly with the size of the window sliding over the streams. For instance, with a sliding window of 512 samples, SDTW is about 600 times faster than DTW. We also show that SDTW is a tight approximation of DTW, errors never exceeding 10%, and that it consistently outperforms approximations developed for the case of static time series.

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 B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O 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 streams
dynamic time warping
sliding window


the dualism of the information technology project The information technology (IT) artefacts are deployed in the organization with the intention to enable and support the business objectives, processes and activities, for competitive advantage. This is done through projects towards a shared goal. The deployment of IT projects can be a cumbersome exercise. Different methods and approaches have been tried in the last decades. Many studies have been conducted, yet the challenges seem to remain. Academics and industry practitioners have identified some factors as cause for the failure of IT projects. What has not actually been examined is what manifests those factors, the root of the cause.

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


Cracking energy estimation of ultra low-k package using novel prediction approach combined with globallocal modeling technique Interfacial crack/delamination, due to the presence of dissimilar material systems, is one of the major concerns of thermo-mechanical reliability for the development of next node technology in integrated circuits (IC) devices. The cracking energy results from many back end of line (BEOL) and packaging processes at various temperature differences is prone to drive the crack advance. To investigate the sensitivity of crack propagation in low-k dielectric materials, a robust estimation of J-integral approach combined with a rectangular path of integral contour is performed using finite element analysis (FEA). By means of the verification of 4-point bending test (4-PBT), excellent agreements are obtained as compared with the experimental data. Moreover, a multiscale modeling technique is proposed to resolve the difficulty of model construction as from bridge device level to packaging level. The sub-modeling procedures developed specifically for the impact prediction of interfacial crack in complicated Cu/low-k interconnects. The analytic results indicate the foregoing methodology is valuable to forecast the physical behavior and reliability of advanced IC devices in the nano scaled size. On the basis of the presented results in this research, an approximated criterion for determining the dimensions of sub-model is suggested and demonstrated as well.

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


CBA-neural network control of a non-linear full vehicle model In this paper, the dynamic behavior of a non-linear eight degrees of freedom vehicle model having active suspensions and passenger seat controlled by a neural network (NN) controller is examined. A robust NN structure is established by using principle design data from the Matlab diagrams of system functions. In the NN structure, Classic Back-Propagation Algorithm (CBA) is employed. The user inputs a set of x1?x16 while the output from the NN consists of f1?f16 non-linear functions. Further, the Permanent Magnet Synchronous Motor (PMSM) controller is also determined using the same NN structure. According to various tests of the NN structure it is demonstrated that the model is able to give highly sensitive outputs for vibration condition, even using a more restricted input data set. The non-linearity occurs due to dry friction on the dampers. The vehicle body and the passenger seat using PMSM are fully controlled at the same time. The time responses of the non-linear vehicle model due to road disturbance and the frequency responses are obtained. Finally, uncontrolled and controlled cases are compared. It is seen that seat vibrations of a non-linear full vehicle model are controlled by NN based system exactly.

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

neural network (nn) control
vehicle vibrations
non-linear systems


A UML profile for the conceptual modelling of data-mining with time-series in data warehouses Time-series analysis is a powerful technique to discover patterns and trends in temporal data. However, the lack of a conceptual model for this data-mining technique forces analysts to deal with unstructured data. These data are represented at a low-level of abstraction and their management is expensive. Most analysts face up to two main problems: (i) the cleansing of the huge amount of potentially-analysable data and (ii) the correct definition of the data-mining algorithms to be employed. Owing to the fact that analysts interests are also hidden in this scenario, it is not only difficult to prepare data, but also to discover which data is the most promising. Since their appearance, data warehouses have, therefore, proved to be a powerful repository of historical data for data-mining purposes. Moreover, their foundational modelling paradigm, such as, multidimensional modelling, is very similar to the problem domain. In this article, we propose a unified modelling language (UML) extension through UML profiles for data-mining. Specifically, the UML profile presented allows us to specify time-series analysis on top of the multidimensional models of data warehouses. Our extension provides analysts with an intuitive notation for time-series analysis which is independent of any specific data-mining tool or algorithm. In order to show its feasibility and ease of use, we apply it to the analysis of fish-captures in Alicante. We believe that a coherent conceptual modelling framework for data-mining assures a better and easier knowledge-discovery process on top of data warehouses.

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

conceptual modelling
multidimensional modelling
data warehouses
uml profiles


advanced topics in recommendation This full-day tutorial is designed to convey an up-to-date, active understanding of a representative set of current developments in recommender systems that will help the participants to conduct cutting-edge research and/or to work more effectively with the currently widespread recommendation technology.

O 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


Solving the brain synchrony eigenvalue problem: conservation of temporal dynamics (fMRI) over subjects doing the same task Brain measures often show highly structured temporal dynamics that synchronize when observers are doing the same task. The standard method for analysis of brain imaging signals (e.g. fMRI) uses the GLM for each voxel indexed against a specified experimental design but does not explicitly involve temporal dynamics. Consequently, the design variables that determine the functional brain areas are those correlated with the design variation rather than the common or conserved brain areas across subjects with the same temporal dynamics given the same stimulus conditions. This raises an important theoretical question: Are temporal dynamics conserved across individuals experiencing the same stimulus task? This general question can be framed in a dynamical systems context and further be posed as an eigenvalue problem about the conservation of synchrony across all brains simultaneously. We show that solving the problem results in a non-arbitrary measure of temporal dynamics across brains that scales over any number of subjects, stabilizes with increasing sample size, and varies systematically across tasks and stimulus conditions.

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

neuroimaging
time series
event perception
inter-subject-correlation


Coupling BEM with FEM by a direct computation of the boundary stiffness matrix The boundary stiffness matrix characterizing in a discretized form the response of the boundary to given Dirichlet boundary conditions allows the coupling between BEM and FEM. The paper presents an approach based on the direct computation of the stiffness matrix from the potential function related to a given Dirichlet boundary condition. The method produces a symmetric stiffness matrix as for the Singular Galerkin boundary element method, but does not need to compute hypersingular integrals. In addition, the method uses only the nodal values of the boundary potential, but does not need discretized values of the normal gradient at the boundary, as for usual boundary element methods, which reduces the number of matrices to be constructed. The regularization of the integrals is achieved by means used for (simply) singular integrals introduced for the collocation boundary element method. An example of application is produced in the case of the solution of Laplace equation within a plane domain.

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

boundary element
symmetric
stiffness matrix
regularization


A Projector Augmented Wave (PAW) code for electronic structure calculations, Part II: pwpaw for periodic solids in a plane wave basis The pwpaw code is a plane wave implementation of the Projector Augmented Wave (PAW) method developed by Blochl for electronic structure calculations within the framework of density functional theory In addition to the self-consistent calculation of the electronic structure of a periodic solid, the program has a number of other capabilities, including structural geometry optimization and molecular dynamics simulations within the Born-Oppenheimer approximation. (C) 2001 Elsevier Science B.V. All rights reserved.

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

density functional calculation
local density approximation
projector augmented wave method
calculational methods


Practical and incremental maintenance of software resources in consumer electronics products We introduce a method, so called FC method, for maintaining software resources. such as source codes and design documents, in consumer electronics products. Because a consumer electronics product is frequently and rapidly revised. software components in such product are also revised in the same way. However, it is not so easy for software engineers to follow the revision of the product because requirements changes for the product, including the changes of its functionalities and its hardware components, are largely independent of the structure of current software resources. FC method lets software engineers to restructure software resources, especially design documents, stepwise so as to follow the requirements changes for the product easily. We report an application of this method in our company to validate it. From the application, we can confirm that the quality of software was improved about in twice, and that efficiency of development process was also improved over four times.

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

product revision
software maintenance
software process improvement


The Internet of Multimedia Nano-Things Nanotechnology is enabling the development of novel devices which are able to generate, process and transmit multimedia content at the nanoscale. The interconnection of pervasively deployed multimedia nano-devices with existing communication networks and ultimately the Internet defines a novel communication paradigm that is further referred to as the Internet of Multimedia Nano-Things (IoMNT). The IoMNT is a truly cyberphysical system with a plethora of applications in the biomedical, security and defense, environmental and industrial fields, amongst others. This paper discusses the state of the art and major research challenges in the realization of the IoMNT. Fundamental research challenges and future research trends are outlined in terms of multimedia data and signal processing, propagation modeling for communication amongst nano-things in the terahertz band, physical layer solutions for terahertz band communication and protocols for the IoMNT. These include novel medium access control techniques, addressing schemes, neighbor discovery and routing mechanisms, a novel QoS-aware cross-layer communication module, and novel security solutions for the IoMNT.

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


Computationally efficient composite transmission expansion planning: A Pareto optimal approach for techno-economic solution For fast reliability evaluation, DC approximation based non-iterative DNS/GNS calculation procedure is demonstrated. Integration of the different sensitivity factors has been proposed to reduce the computational effort. Islanding detection scheme is incorporated with severe probabilistic N-2 along with N-1 deterministic contingency analysis. A techno-economic composite TEP methodology for updating the capacity of new/existing transmission lines is presented. Optimal generation capacity to minimize the investment is proposed to mitigate market power (flatness of buses price).

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

generation planning
genetic algorithm
congestion management
social welfare
linear matrices


An academic odyssey: writing over time In this paper we present and discuss the results of six enquiries into the first authors academic writing over the last 50years. Our aim is to assess whether or not his academic writing style has changed with age, experience, and cognitive decline. The results of these studies suggest that the readability of textbook chapters written by Hartley has remained fairly stable for over 50years, with the later chapters becoming easier to read. The format of the titles used for chapters and papers has also remained much the same, with an increase in the use of titles written in the form of questions. It also appears that the format of the chosen titles had no effect on citation rates, but that papers that obtained the highest citation rates were written with colleagues rather by Hartley alone. Finally it is observed that Hartleys publication rate has remained much the same for over 50years but that this has been achieved at the expense of other academic activities.

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

productivity
ageing
longitudinal study
writing style


MULTIPLE DISORDER DIAGNOSIS WITH ADAPTIVE COMPETITIVE NEURAL NETWORKS Backpropagation neural networks have repeatedly been used for diagnostic problem-solving, but have not been demonstrated to work well when multiple disorders are present. We hypothesized that letting nodes in a backpropagation neural network compete to be part of a diagnostic solution would produce better performance than the use of existing backpropagation methods. To test this hypothesis, we derived an error backpropagation learning rule that can be used with competitive units (competitive backpropagation). Artificial neural networks were then trained using both this new learning rule and standard error backpropagation on a specific medical diagnosis problem: identification of the location of damage in the brain given a set of examination findings. Training samples included solely 'prototypical' cases where a single location of damage is present. The trained networks were then tested with atypical cases where the manifestations of more than one disorder were present or only a single manifestation was present. Networks employing competition among units were found to perform qualitatively better with these multiple-disorder cases than standard networks and also to perform better on single-manifestation cases. The reasons for this are explained. The competitive backpropagation learning rule described here provides a promising new tool for adaptive diagnostic problem-solving.

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

diagnosis
multiple disorders
competition
neural networks
learning


Sensitivity and stability analysis of the additive model in uncertain data envelopment analysis DEA is a non-parametric productive efficiency measurement method for operations with multiple inputs and multiple outputs. An issue which has received widespread attention in rapidly growing field of DEA is the sensitivity and stability of the evaluating results to perturbations in the data. Due to the uncertainty of the data in real life, this paper will perform a sensitivity and stability analysis of the additive model with uncertain inputs and output. Some theories of the uncertain DEA model based on uncertainty theory will be given. It is followed by some computation methods of the stable regions to the efficient and inefficient DMUs. Finally, a numerical example will be presented to give an illustration of the sensitivity and stability analysis.

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

data envelopment analysis
efficiency
sensitivity
stability

uncertain measure
uncertainty distribution


Spatial error concealment for stereoscopic video coding based on pixel matching In stereoscopic video coding, the interview correlation between the stereo image pair can be used for error concealment. A new spatial error concealment method for stereoscopic video coding based on pixel matching in the decoder is proposed in this paper. The lost macroblocks are recovered by utilizing disparity matching between two-view images on a pixel-by-pixel basis. Firstly, we get the candidate disparity vectors of the four neighboring pixels of the lost pixel by disparity matching in the decoder. Secondly, by calculating the boundary pixel difference, we determine an optimal replacing pixel in the reference image, and then we recover the lost pixel by the optimal pixel in the reference image. Experimental results show that the proposed algorithm performs better comparing to the previous technique.

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

spatial error concealment
stereoscopic video
pixel matching


On random variational inclusions with random fuzzy mappings and random relaxed cocoercive mappings In this paper, we introduce and study the random variational inclusions with random fuzzy and random relaxed cocoercive mappings. We define an iterative algorithm for finding the approximate solutions of this class of variational inclusions and establish the convergence of iterative sequences generated by proposed algorithm. Our results improve and generalize many known corresponding results. (c) 2009 Elsevier B.V. All rights reserved.

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

variational inclusions
algorithm
random fuzzy mappings
random relaxed cocoercive mappings


Measuring the quality of Patients goals and action plans: development and validation of a novel tool The purpose of this study is to develop and test reliability, validity, and utility of the Goal-Setting Evaluation Tool for Diabetes (GET-D). The effectiveness of diabetes self-management is predicated on goal-setting and action planning strategies. Evaluation of self-management interventions is hampered by the absence of tools to assess quality of goals and action plans. To address this gap, we developed the GET-D, a criteria-based, observer rating scale that measures the quality of patients diabetes goals and action plans.

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


a note on modeling, simulation and analysis of wireless lans in classified environments In this paper, we present the view that classified Wireless LANs (WLANs) need special handling when it comes to simulation and analyses. Even though classified environment uses open standards, almost exclusively IEEE 802.11, the fact that an array of requirements have to be met according to the DoD policy documents makes them a non-standard network type, thus making the 'regular' simulation and analysis models and libraries essentially useless. We outline this problem in detail and propose that (analysis and) simulation models for classified WLANs should be designed on a per policy based.

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


Nonequilibrium relaxation method and its applications Nonequilibrium relaxation (NER) process turns out to be an useful method to study phase transition and critical phenomena. The NER method and its applications are reviewed. Characteristic behavior of the local exponent is analyzed with a simple model.

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

phase transition
critical phenomena
nonequilibrium relaxation

dynamical finite-size scaling
monte carlo simulation


a symmetric transformation for 3-body potential molecular dynamics using force-decomposition in a heterogeneous distributed environment Evaluating the Force Matrix constitutes the most computationally intensive part of a Classical Molecular Dynamics (MD) simulation. In three-body MD simulations, the total energy of the system is determined by the energy of every unique triple in the system and the force matrix is three-dimensional. The execution time of a three-body MD algorithm is thus proportional to the cube of the number of atoms in the system. Fortunately, there exist symmetries in the Force Matrix that can be exploited to improve the running time of the algorithm. While this optimization is straight forward to implement in the case of sequential code, it has proven to be nontrivial for parallel code even in a homogeneous environment. In this paper, we present two force matrix transformations that are capable of exploiting the symmetries in a 3-body force matrix in both a homogeneous and a heterogeneous environment while balancing the load among all the participating processors. The first transformation distributes the number of interactions to be computed uniformly among all the slices of the force matrix along any of the axes. The transformed matrix can be scheduled using any well known heterogeneous slice-level scheduling technique. The second transformation distributes interactions to be computed uniformly over the entire volume of the force matrix allowing us to perform a block decomposition of the force matrix. The transformed force matrix can be scheduled by any block level scheduling algorithm. We also derive theoretical bounds for efficiency and load balance for our transformations and prove some interesting and useful properties of our transformations and evaluate their advantages and disadvantages. The performance of an MPI implementation of the transformations is studied in terms of the Step Time Variation Ratio (STVR) in a homogeneous and heterogeneous environment.

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


CONTEXT-AWARE WORKFLOW MANAGEMENT FOR INTELLIGENT NAVIGATION APPLICATIONS IN PERVASIVE ENVIRONMENTS Pervasive computing is a user-centric distributed computing paradigm, allowing users to access their preferred services even while moving around. To make this vision a reality, context-aware workflow management is one of key issues because the context of pervasive applications is changing dynamically. In this paper, we propose a context model for intelligent navigation applications and then present a context-aware workflow management algorithm (CAWM) which can adaptively adjust workflow execution behaviours based on current context information. The correctness of the CAWM algorithm has been also verified theoretically by formulating it as a Petri-net model. Furthermore, the proposed context model and workflow management algorithm can apply to other applications by simply revising the corresponding context structures only.

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

intelligent computing
context awareness
petri nets


Designing secure databases Security is an important issue that must be considered as a fundamental requirement in information systems development, and particularly in database design. Therefore security, as a further quality property of software, must be tackled at all stages of the development. The most extended secure database model is the multilevel model, which permits the classification of information according to its confidentiality, and considers mandatory access control. Nevertheless, the problem is that no database design methodologies that consider security (and therefore secure database models) across the entire life cycle, particularly at the earliest stages currently exist. Therefore it is not possible to design secure databases appropriately. Our aim is to solve this problem by proposing a methodology for the design of secure databases. In addition to this methodology, we have defined some models that allow us to include security information in the database model, and a constraint language to define security constraints. As a result, we can specify a fine-grained classification of the information, defining with a high degree of accuracy which properties each user has to own in order to be able to access each piece of information. The methodology consists of four stages: requirements gathering; database analysis; multilevel relational logical design; and specific logical design. The first three stages define activities to analyze and design a secure database, thus producing a general secure database model. The last stage is made up of activities that adapt the general secure data model to one of the most popular secure database management systems: Oracle9i Label Security. This methodology has been used in a genuine case by the Data Processing Center of Provincial Government. In order to support the methodology, we have implemented an extension of Rational Rose, including and managing security information and constraints in the first stages of the methodology.

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

unified modeling language
object constraint language


An analytical model for calculating the pull-in voltage of micro cantilever beams subjected to tilted and curled effects Cantilever beam may contain tilted and curled deformations. A pull-in voltage model considering both curled and tilted effects is proposed. Error is reduced from 10.5% to 3.2% with the proposed model.

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

curled deformation
tilted deformation
pull-in voltage
deformation function


Three-dimensional numerical analysis of the stress transfer mechanism of XCC piled raft foundation An X-section cast-in-place concrete (XCC) piled raft is a new type of foundation that uses piles with X-shaped cross-sections. Compared to a traditional circular cast-in-place concrete (CCC) pile, an XCC pile of the same cross-sectional area has a larger side resistance due to its larger cross-sectional perimeter. Although the pile capacity and load transfer mechanism of the XCC piled raft have been studied, the influence of this X-shaped geometry on the stress transfer between pile and surrounding soil is still not fully understood. To investigate the effects of the cross-sectional geometry, three-dimensional numerical analyses are conducted on an XCC and a traditional CCC piled rafts using the finite element method. The numerical results are verified by a field test of an XCC piled raft. Computed results reveal that lateral soil arching develops to a distance of approximately twice pile diameter surrounding the XCC pile, which can be demonstrated by the rotation of the principal stresses, leading to a non-uniform effective normal stress across a given cross-section and along the pile depth. The magnitude of the unit side resistance that acts on the concave surfaces of the XCC pile is up to twice the magnitude of the unit side resistance that acts on the flat surfaces. For a given applied load, the total side resistance mobilised on the XCC pile is usually larger than the total side resistance of the CCC pile, by a factor that ranges from 0.5 to 10, depending on the pile depth. Therefore, approximately 66% and 46% of the applied load is carried by the XCC and CCC piles respectively, and simultaneously, approximately 45% and 24% of the applied load is taken by the side resistance of the XCC and CCC piles, respectively. The larger effect of the XCC piled raft contributes to the cross-sectional geometry, which results in a larger perimeter and arching effects.

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

xcc piled raft foundation
side resistance
soil arching
effective normal stress


incorporating hydrologic semantic information for interoperable gis with hydrologic model Component-based approach has been identified as an efficient way to integrate GIS and hydrologic models. Current existing specifications such as OpenGIS or IOS/TC 211 provide a vessel to achieve this goal. However, there is a gap between what is provided in these specifications and what is needed for GIS-hydrologic model integration. Existing specifications provide general semantics for spatial domain, while integration of GIS and hydrologic models requires encoding more specialized spatial domain used in hydrologic models. In this paper, we propose developing an information community-specific abstract data model that would be based on the OpenGIS abstract specification with the intent of achieving interoperability between GIS applications and hydrologic simulation models. Mapping results are presented.

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

hydrologic modeling
geographic information system


a genetic algorithm for learning significant phrase patterns in radiology reports Radiologists disagree with each other over the characteristics and features of what constitutes a normal mammogram and the terminology to use in the associated radiology report. Recently, the focus has been on classifying abnormal or suspicious reports, but even this process needs further layers of clustering and gradation, so that individual lesions can be more effectively classified. Using a genetic algorithm, the approach described here successfully learns phrase patterns for two distinct classes of radiology reports (normal and abnormal). These patterns can then be used as a basis for automatically analyzing, categorizing, clustering, or retrieving relevant radiology reports for the user.

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

maximum variation sampling
mammography reports
information retrieval
multi-agent system
learning agents


Semantically indexed hypermedia: Linking information disciplines Semantic linking has always been a strand of hypermedia research and is becoming central to current attempts to facilitate access to information in large hypertexts and the emerging 'semantic web' [Berners-Lee 1998a]. Due to the scaling problems with explicitly authored links between information items, it is likely that future large scale hypertexts will employ a mixture of authored links and indirect, computed links via some form of indexing system. Problems of information access are heightened by the lack of precision of current WWW retrieval technology and users unfamiliar with indexing conventions. There is a critical need for tools that will assist users to formulate and refine queries, and navigate through information spaces. Recent years have seen the growth of metadata, Digital Libraries, and interest in the application of traditional information science and library cataloguing techniques to the new environment of hypertext and the WWW. Semantic indexing provides a bridge between the various information disciplines. With the growing influence of the Resource Description Framework [Lassila 1999], semantic tagging and cataloguing of information is likely to become a key component of the information architecture of intranet hypertexts and the WWW.

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

semantic index
semantic distance measures
dublin core


Generic expression hardness results for primitive positive formula comparison We study the expression complexity of two basic problems involving the comparison of primitive positive formulas: equivalence and containment. In particular, we study the complexity of these problems relative to finite relational structures. We present two generic hardness results for the studied problems, and discuss evidence that they are optimal and yield, for each of the problems, a complexity trichotomy.

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

conjunctive queries
computational complexity
clones


The Effect of Prey Refuges on a Three Species Food Chain Model A refuge model is developed for a resource-based ecosystem. The predator functional responses are taken to be of Holling type I and II, respectively. Stability analyses are carried out for both the cases. Bifurcation phenomenon occurred only for system with Holling type II predator functional response. We identify the parameter which ensures long-term survival of all the populations. The effects of refuges have been established on equilibrium densities of prey and predator population, respectively. The results show that the effects of refuges used by prey increase the equilibrium density of prey population. As far as the predator population is concerned, when prey density at equilibrium level remains below a certain threshold value, increasing the amount of prey refuge can decrease the predator densities. Numerical examples are provided to support our results.

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


Reliable Web service composition based on QoS dynamic prediction Web service dynamic composition is a key technology for creating value-added services by composing available services and applications. With the rapid development of web service, cloud computing, big data and internet of things, more and more services with identical functionality and different Quality of Service (QoS) are available; moreover, QoS of Web services are highly dynamic, so, how to create composite Web services reliably and efficiently is still an open issue. For this problem, this paper proposes a reliable Web service composition method based on global QoS constraints decomposition and QoS dynamic prediction. The approach includes two critical phases: firstly, before service composition, global QoS constraints are decomposed into local constraints, and the problem of Web service dynamic composition is transformed to a local optimization problem; secondly, during the running time, optimal Web service is selected for the current abstract service based on predicted QoS values. Experiment results show that our approach can greatly enhance the reliability of composite Web service.

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

web service dynamic composition
global qos constraints decomposition

genetic algorithm
culture algorithm
qos prediction
case-based reasoning


A multiplicative version of Promethee II applied to multiobjective optimization problems The method Promethee II has produced attractive results in the choice of the most satisfactory optimal solution of convex multiobjective problems. However, according to the current literature, it may not work properly with nonconvex problems. A modified version of this method, called multiplicative Promethee, is proposed in this paper. Both versions are applied to some analytical problems, previously optimized by an evolutionary algorithm. The multiplicative Promethee got much better results than the original Promethee II, being capable of solving convex and nonconvex problems, with continuous and discontinuous Pareto fronts.

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

multiple criteria analysis
multiple objective programming
decision analysis


An architecture for exploiting multi-core processors to parallelize network intrusion prevention It is becoming increasingly difficult to implement effective systems for preventing network attacks, due to the combination of the rising sophistication of attacks requiring more complex analyses to detect; the relentless growth in the volume of network traffic that we must analyze; and, critically, the failure in recent years for uniprocessor performance to sustain the exponential gains that for so many years CPUs have enjoyed. For commodity hardware, tomorrow's performance gains will instead come from multi-core architectures in which a whole set of CPUs executes concurrently. Taking advantage of the full power of multi-core processors for network intrusion prevention requires an in-depth approach. In this work we frame an architecture customized for parallel execution of network attack analysis. At the lowest layer of the architecture is an 'Active Network Interface', a custom device based on an inexpensive FPGA platform. The analysis itself is structured as an event-based system, which allows us to find many opportunities for concurrent execution, since events introduce a natural asynchrony into the analysis while still maintaining good cache locality. A preliminary evaluation demonstrates the potential of this architecture. Copyright (c) 2009 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

network intrusion detection
event-based system
concurrent processing


Generating SNP barcode to evaluate SNP-SNP interaction of disease by particle swarm optimization Genome-wide association analysis involved many single-nucleotide polymorphisms (SNPs) data is challenging mathematically and computationally. Hence, we propose the odds ratio-based discrete binary particle swarm optimization (OR-DBPSO) method that uses the OR as a new quantitative measure of disease risk among many SNP combinations with genotypes called "SNP barcode". DBPSO are applied to generate SNP barcode, which computes the maximal difference of occurrence between the case and control groups, to predict disease susceptibility such as osteoporosis. Different SNP barcode patterns may occur several times in either low or high bone mineral density (BMD) groups. Our results showed that a DBPSO can effectively identify a specific SNP barcode with an optimized fitness value. SNP barcodes with a low fitness value will naturally be discarded from the population. A representative SNP barcode with a variable number of SNPs is processed to OR analysis to determine the maximum difference between the low and high BMD groups in statistics manner. Therefore, this paper introduces a powerful procedure to analyze disease-associated SNP-SNP interaction in genome-wide genes. (c) 2008 Elsevier Ltd. All rights reserved.

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

snp barcode
interaction
particle swarm optimization


Optimal linear estimation fusion - Part I: Unified fusion rules This paper deals with data (or information) fusion for the purpose of estimation. Three estimation fusion architectures are considered: centralized, distributed, and hybrid. A unified linear model and a general framework for these three architectures are established. Optimal fusion rules based on the best linear unbiased estimation (BLUE), the weighted least squares (WLS), and their generalized versions are presented for cases with complete, incomplete, or no prior information. These rules are more general and flexible, and have wider applicability than previous results. For example, they are in a unified form that is optimal for all of the three fusion architectures With arbitrary correlation of local estimates or observation errors across sensors or across time. They are also in explicit forms convenient for implementation. The optimal fusion rule's presented are. not limited to linear data models. Illustrative numerical results are provided to verify the fusion rules and demonstrate how these fusion rules can be used in cases with complete, incomplete, or no prior information.

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

estimation fusion
fusion rules
least squares

least minimum mean-squared errors (lmmse)


Sequential importance sampling of binary sequences Two sequential methods are described for sampling constrained binary sequences from partial solutions. The backward method computes elimination ideals over finite fields and constructs partial solutions that extend. The forward method uses numerical global optimization to determine which partial solutions extend. The methods are applied to restricted orderings, binary dynamics, and random graphs.

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

sequential sampling
groebner basis
binary sequence


Topological simplification of isosurfaces in volumetric data using octrees ? Volumetric data, such as output from CT scans or laser range scan processing methods, often have isosurfaces that contain topological noisesmall handles and holes that are not present in the original model. Because this noise can significantly degrade the performance of other geometric processing algorithms, we present a volumetric method that removes the topological noise and patches holes in undefined regions for a given isovalue. We start with a surface completely inside the isosurface of interest and a surface completely outside the isosurface. These surfaces are expanded and contracted, respectively, on a voxel-by-voxel basis. Changes in topology of the surfaces are prevented at every step using a local topology test. The result is a pair of surfaces that accurately reflect the geometry of the model but have simple topology. We represent the volume in an octree format for improved performance in space and time.

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

isosurface topology simplification octree


Common weights data envelopment analysis with uncertain data: A robust optimization approach One of the primary issues on data envelopment analysis (DEA) models is the reduction of weights flexibility. There are literally several studies to determine common weights in DEA but none of them considers uncertainty in data. This paper introduces a robust optimization approach to find common weights in DEA with uncertain data. The uncertainty is considered in both inputs and outputs and a suitable robust counterpart of DEA model is developed. The proposed robust DEA model is solved and the ideal solution is found for each decision making units (DMUs). Then, the common weights are found for all DMUs by utilizing the goal programming technique. To illustrate the performance of the proposed model, a numerical example is solved. Also, the proposed model of this paper is implemented by using some actual data from provincial gas companies in Iran. (C) 2013 Elsevier Ltd. All rights reserved.

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

data envelopment analysis
common weights
robust optimization
uncertainty


exploring network topology evolution through evolutionary computations We present an evolutionary methodology that explores the evolution of network topology when a uniform growth of the network traffic is considered. The network redesign problem is formulated as an optimization problem, subject to a set of design and performance constraints, while minimizing the redesign cost by maintaining as many as possible of the network devices that constitute the original topology. The experimental results for a 3-level network redesign problem (consisting of 65 client nodes) demonstrate the value of the search technique within the genetic algorithms in finding good solutions with respect to redesign cost and time.

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

evolutionary computation
network technology


A conformance test suite for TTCN-3 tools With more than 10 years of maturing through industrial use and standardization, the Testing and Test Control Notation (TTCN-3) has become a widely used technology that many businesses depend upon for ensuring their product quality. With the rising number of supporters and tools, the demand for a means to assess the standards compliance of TTCN-3 tools has increased. In this article, we describe the motivation, approach, methodology, and results of the still ongoing project to develop a standardized conformance test suite for TTCN-3 tools. We discuss the challenges involved in creating such a test suite, the way to deal with imposed resource limitations of the project, and where we think the effort is heading.

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

ttcn-3
syntax tests
semantics tests
conformance testing
compiler testing


Age-Invariant Face Recognition One of the challenges in automatic face recognition is to achieve temporal invariance. In other words, the goal is to come up with a representation and matching scheme that is robust to changes due to facial aging. Facial aging is a complex process that affects both the 3D shape of the face and its texture (e. g., wrinkles). These shape and texture changes degrade the performance of automatic face recognition systems. However, facial aging has not received substantial attention compared to other facial variations due to pose, lighting, and expression. We propose a 3D aging modeling technique and show how it can be used to compensate for the age variations to improve the face recognition performance. The aging modeling technique adapts view-invariant 3D face models to the given 2D face aging database. The proposed approach is evaluated on three different databases (i.g., FG-NET, MORPH, and BROWNS) using FaceVACS, a state-of-the-art commercial face recognition engine.

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

face recognition
facial aging
aging modeling


multi-field learning for email spam filtering Through the investigation of email document structure, this paper proposes a multi-field learning (MFL) framework, which breaks the multi-field document Text Classification (TC) problem into several sub-document TC problems, and makes the final category prediction by weighted linear combination of several sub-document TC results. Many previous statistical TC algorithms can be easily rebuilt within the MFL framework via turning binary result to spamminess score, which is a real number and reflects the likelihood that the classified email is spam. The experimental results in the TREC spam track show that the performances of many TC algorithms can be improved within the MFL framework.

O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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-field learning
text feature selection


Portlets as web components: An introduction Today's organisations are increasingly relying on the web to support their operations and the integration of their processes with their partners'. Portlets, which are distributed web components that encapsulate web applications, are considered a promising breakthrough towards this aim. The goal is to define a component model to enable portlets to be easily plugged into web portals. This article outlines the main challenges associated with the definition and use of portlets. As any component model, portlets should have clear interfaces so that they can be plugged into third-party applications. This includes the communication between the consumer of a portlet and the portlet container, as well as the communication between the portlet container and the portlet itself. Two standards, WSRP and JSR168, address these issues. After outlining them, we conclude with some insights into the implementation of portlets.

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

portal applications
web services
component-based development


An adaptive procedure for the finite element computation of non-linear structural problems The present paper proposes a procedure for the resolution of non-linear structural problems. It includes a study of the reliability of the results and the adaptive meshing The iterative phase of the solution of the equilibrium equations entails an adaptive strategy for updating the tangent stiffness matrix, with a control of the load step. This results in a higher rate of convergence for the iterative process. The mechanical deformation processes here considered may give rise to considerable geometric distortion in the finite elements of the mesh. If they do, the consequence will be not only that the FE analysis fails to yield precise results, but also, owing to problems deriving from the numerical ill-conditioning that continuation may be impractical. To facilitate the study of these results, we developed an error estimator of the flux projection type, which is based on the mechanical deformation power It is also used as a refinement criterion for the FE mesh. Distorted meshes can be fully or partially submitted to a process of regularization based on the aspect ratio of their elements. The mesh contour may be affected by the refinement and regularization processes, for which reason we developed a procedure for its updating. This procedure is of more importance in the case of contact problems, its Primary object being to avoid interpenetration. The work was done in the ZATILAN code, developed by the Department of Mechanical Engineering of the University of the Basque County.

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


Scheduling jobs in flowshops with the introduction of additional machines in the future The problem of scheduling jobs to minimize total weighted tardiness in flowshops, with the possibility of evolving into hybrid flowshops in the future, is investigated in this paper. As this research is guided by a real problem in industry, the flowshop considered has considerable flexibility, which stimulated the development of an innovative methodology for this research. Each stage of the flowshop currently has one or several identical machines. However, the manufacturing company is planning to introduce additional machines with different capabilities in different stages in the near future. Thus, the algorithm proposed and developed for the problem is not only capable of solving the current flow line configuration but also the potential new configurations that may result in the future. A meta-heuristic search algorithm based on tabu search is developed to solve this NP-hard, industry-guided problem. Six different initial solution finding mechanisms are proposed. A carefully planned nested split-plot design is performed to test the significance of different factors and their impact on the performance of the different algorithms. To the best of our knowledge, this research is the first of its kind that attempts to solve an industry-guided problem with the concern for future developments.

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

total weighted tardiness
tabu search
additional machines


On the analysis needs when verifying state-based software requirements: an experience report In a previous investigation we formally defined procedures for analyzing hierarchical state-based requirements specifications for two properties: (1) completeness with respect to a set of criteria related to robustness (a response is specified for every possible input and input sequence) and (2) consistency (the specification is free from conflicting requirements and undesired nondeterminism). Informally, the analysis involves determining if large Boolean expressions are tautologies. We implemented the analysis procedures in a prototype tool and evaluated their effectiveness and efficiency on a large real world requirements specification expressed in an hierarchical state-based language called Requirements State Machine Language. Although our initial approach was largely successful, there were some drawbacks with the original tools. In our initial implementation we abstracted all formulas to propositional logic. Unfortunately, since we are manipulating the formulas without interpreting any of the functions in the individual predicates, the abstraction can lead to large numbers of spurious (or false) error reports. To increase the accuracy of our analysis we have continually refined our tool with decision procedures and, finally, come to the conclusion that theorem proving is often needed to avoid large numbers of spurious error reports. This paper discusses the problems with spurious error reports and describes our experiences analyzing a large commercial avionics system for completeness and consistency. (C) 2000 Elsevier Science B.V. All rights reserved.

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

theorem proving
completeness
consistency

software specification verification
static analysis
pvs
state-based models
rsml


Image Registration Using Adaptive Polar Transform Image registration is an essential step in many image processing applications that need visual information from multiple images for comparison, integration, or analysis. Recently, researchers have introduced image registration techniques using the log-polar transform (LPT) for its rotation and scale invariant properties. However, it suffers from nonuniform sampling which makes it not suitable for applications in which the registered images are altered or occluded. Inspired by LPT, this paper presents a new registration algorithm that addresses the problems of the conventional LPT while maintaining the robustness to scale and rotation. We introduce a novel adaptive polar transform (APT) technique that evenly and effectively samples the image in the Cartesian coordinates. Combining APT with an innovative projection transform along with a matching mechanism, the proposed method yields less computational load and more accurate registration than that of the conventional LPT. Translation between the registered images is recovered with the new search scheme using Gabor feature extraction to accelerate the localization procedure. Moreover an image comparison scheme is proposed for locating the area where the image pairs differ. Experiments on real images demonstrate the effectiveness and robustness of the proposed approach for registering images that are subjected to occlusion and alteration in addition to scale, rotation, and translation.

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

alteration
image registration
occlusion
rotation
scale
translation


Rolling ball method for 5-axis surface machining Curvature matching for 5-axis surface machining has been plagued by the complexity of the task. As a result the current tool positioning strategies are likewise computationally complicated. Gouging the surface has been the main concern and has presented the greatest difficulty in the algorithms. Some of the methods perform exhaustive searches of the surface to avoid gouging while others incrementally adjust the tool orientation until gouges are no longer detected. In this paper a new positioning strategy is presented that is simple to implement and is not difficult to compute. The rolling ball method rolls a variable radius ball along the tool path and positions the cutting tool to cut the rolling ball. A small region of the ball's surface is used to approximate a small region of the surface being machined. The radius of each ball is computed by checking a grid of points in the area of the surface that the tool casts a shadow for each tool position. A pseudo-radius is computed for each grid point and the most appropriate radius is selected to be the rolling ball's radius. The selection process follows a hierarchy of surface profiles ranging from convex to concave. Convex, concave, and saddle (mixed) surface regions are all computed in a similar fashion and there are no special cases for which the positioning strategy must be changed to compute a tool position. Local gouge checking is automatically built-in to the positioning computations so that the typical iterative strategy of checking for gouging, then incrementally tilting the tool until no gouges are detected is eliminated. The method is robust and simple to implement and it only requires surface coordinates and surface normals. A simulation of the method and a cutting test were performed and are presented in this document.

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


Generalized Monotone Mapping with an Application for Solving a Variational Inclusion Problem The aim of this paper is to define a generalized monotone mapping, which is the sum of symmetric cocoercive mapping and symmetric monotone mapping. The resolvent operator associated with generalized monotone mapping is defined and some of its properties are shown. We solve a variational inclusion problem using these new concepts. For illustration, some examples are given.

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

generalized monotone mapping
resolvent operator
variational inclusion
cocoercive


Backtracking Events as Indicators of Usability Problems in Creation-Oriented Applications A diversity of user goals and strategies make creation-oriented applications such as word processors or photo-editors difficult to comprehensively test. Evaluating such applications requires testing a large pool of participants to capture the diversity of experience, but traditional usability testing can be prohibitively expensive. To address this problem, this article contributes a new usability evaluation method called backtracking analysis, designed to automate the process of detecting and characterizing usability problems in creation-oriented applications. The key insight is that interaction breakdowns in creation-oriented applications often manifest themselves in backtracking operations that can be automatically logged (e.g., undo and erase operations). Backtracking analysis synchronizes these events to contextual data such as screen capture video, helping the evaluator to characterize specific usability problems. The results from three experiments demonstrate that backtracking events can be effective indicators of usability problems in creation-oriented applications, and can yield a cost-effective alternative to traditional laboratory usability testing.

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

usability testing
backtracking analysis
undo

design
information systems
cost-effectiveness


decoupled software pipelining creates parallelization opportunities Decoupled Software Pipelining (DSWP) is one approach to automatically extract threads from loops. It partitions loops into long-running threads that communicate in a pipelined manner via inter-core queues. This work recognizes that DSWP can also be an enabling transformation for other loop parallelization techniques. This use of DSWP, called DSWP+, splits a loop into new loops with dependence patterns amenable to parallelization using techniques that were originally either inapplicable or poorly-performing. By parallelizing each stage of the DSWP+ pipeline using (potentially) different techniques, not only is the benefit of DSWP increased, but the applicability and performance of other parallelization techniques are enhanced. This paper evaluates DSWP+ as an enabling framework for other transformations by applying it in conjunction with DOALL, LOCALWRITE, and SpecDOALL to individual stages of the pipeline. This paper demonstrates significant performance gains on a commodity 8-core multicore machine running a variety of codes transformed with DSWP+.

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

multicore
parallelization
dswp
enabling transformation


an efficient key point quantization algorithm for large scale image retrieval We focus on the problem of large-scale near duplicate image retrieval. Recent studies have shown that local image features, often referred to as key points, are effective for near duplicate image retrieval. The most popular approach for key point based image matching is the clustering-based bag-of-words model. It maps each key point to a visual word in a code-book that is constructed by a clustering algorithm, and represents each image by a histogram of visual words. Despite its success, there are two main shortcomings of the clustering-based bag-of-words model: (i) it is computationally expensive to cluster millions of key points into thousands of visual words; (ii) there is no theoretical analysis on the performance of the bag-of-words model. We propose a new scheme for key point quantization that addresses these shortcomings. Instead of clustering, the proposed scheme quantizes each key point into a binary vector using a collection of randomly generated hyper-spheres, and a bag-of-words model is constructed based on such randomized quantization. Our theoretical analysis shows that the resulting image similarity provides an upper bound for the similarity based on the optimal partial matching between two sets of key points. Empirical study on a database of 100,000 images shows that the proposed scheme is not only more efficient but also more effective than the clustering-based approach for near duplicate image retrieval.

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


Valence band states in diamond p-delta-doped quantum wells Heavy, light, and split-off hole states in p-?-doped diamond quantum wells are studied with the use of a 66 Hamiltonian. The calculation starts in the effective mass approximation with the solution of a three-independent (hh+lh+so) hole bands model at the Brillouin zone center, using a local density ThomasFermi approximation for the description of the band bending profile. The quantized eigenstates at the ? point are used as a basis to diagonalize the Hamiltonian, obtaining the different hole states at the non-? points. The results show that, in spite of the very small value of ?0 reported for diamond, in the specific case of p-type ? quantum wells, the contribution coming from the split-off band should not be omitted.

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

p-type-doping
? quantum wells
electronic states
hole band structure


comparing spatial hypertext collections This paper proposes an approach to comparison of spatial hypertext collections which avoids becoming entangled in complexities of version management and merging. We also propose and illustrate principles for presenting comparisons of spatial hypertext without losing important implicit information. We argue that multiple view options, distinct areas for different collections, and dependency lists are all necessary if comparison is to retain the kinds of meaning fundamentally important to spatial hypertext.

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

comparison
version management
spatial hypertext

sidiff
webspiration
vue
vkb
shywiki
collaboration
tinderbox
model merging


ccured in the real world CCured is a program transformation system that adds memory safety guarantees to C programs by verifying statically that memory errors cannot occur and by inserting run-time checks where static verification is insufficient.This paper addresses major usability issues in a previous version of CCured, in which many type casts required the use of pointers whose representation was expensive and incompatible with precompiled libraries. We have extended the CCured type inference algorithm to recognize and verify statically a large number of type casts; this goal is achieved by using physical subtyping and pointers with run-time type information to allow parametric and subtype polymorphism. In addition, we present a new instrumentation scheme that splits CCured's metadata into a separate data structure whose shape mirrors that of the original user data. This scheme allows instrumented programs to invoke external functions directly on the program's data without the use of a wrapper function.With these extensions we were able to use CCured on real-world security-critical network daemons and to produce instrumented versions without memory-safety vulnerabilities.

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

network
metadata
c
use
usability
shape
paper
representation
pointers
libraries
errors
program transformation
user
vulnerabilities
parametric
type inference
verification
wrapper
data
version
physical
memory safety
algorithm
subtype
scheme

data structures
extensibility
timing
instrument
informal
program
systems
functional
polymorphic
memorialized
type safety
run-time type information
secure
compatibility with library code
critic


Impossible differential cryptanalysis of reduced-round ARIA and Camellia This paper studies the security of the block ciphers ARIA and Camellia against impossible differential cryptanalysis. Our work improves the best impossible differential cryptanalysis of ARIA and Camellia known so far. The designers of ARIA expected no impossible differentials exist for 4-round ARIA. However, we found some nontrivial 4-round impossible differentials, which may lead to a possible attack on 6-round ARIA. Moreover, we found some nontrivial 8-round impossible differentials for Camellia, whereas only 7-round impossible differentials were previously known. By using the 8-round impossible differentials, we presented an attack on 12-round Camellia without FL/FL-1 layers.

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

aria
camellia
impossible differential cryptanalysis

block cipher
data complexity
time complexity


Learning three sets of alarms for the same medical functions: Aperspective on the difficulty of learning alarms specified in an international standard Three sets of eight alarms supporting eight functions specified in an international medical equipment standard (IEC 60601-1-8) were tested for learnability using non-anaesthetist participants. One set consisted of the tonal alarms specified in the standard. A second set consisted of a set of abstract alarms randomly selected from a database of abstract alarm sounds held by the authors. A third set of alarms was designed as indirect metaphors of the functions. Participants were presented with the alarms and then asked to identify them across ten blocks of eight trials. The results indicated a significant difference in learnability across the three sets of alarms. The indirect metaphors were learned significantly better than both other sets of alarms, and the randomly selected abstract alarms were learned significantly better than the alarms specified in the standard. The results suggest therefore that there are more readily learnable possible designs than those proposed in the standard. The use of auditory icons in particular should be given serious consideration as potential alarms for this application.

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


An efficient algorithm for the uncapacitated facility location problem with totally balanced matrix ? The uncapacitated facility location problem is considered in case when the transportation matrix has a totally balanced characteristic matrix. Since this problem is equivalent to the minimization problem of a polynomial in Boolean variables, an efficient algorithm is developed in terms of the latter. The idea of the algorithm is based on the fact that the minimization problem of a totally balanced polynomial can be reduced to the minimization problem of a similar polynomial having one fewer variables.

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

facility location
totally balanced matrix


Generation of spectral nulls with permutation sequences ? This paper describes the construction of classes of spectral null codes, which are obtained by shaping permutation sequences. The properties and the construction techniques of binary spectral null codes are used. The power spectral densities (PSD) of the proposed codes show nulls at the zero frequency and at submultiples of the frequencies of the transmitted symbols. The channel symbols or voltage levels mapped to each transmitted permutation symbol are chosen to satisfy the spectral null equation. Interesting results show the elimination of the DC component at the lower frequencies. The well-shaped power spectral densities of these codes may overcome some communications problem like zero frequency components. The proposed technique is generalized and the corresponding spectral null permutation sequences that generate spectral null codes are presented.

O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 drama in an instrumented museum: inducing group conversation via coordinated narratives Museum visits can be more enjoyable to small groups if they can be both social and educational experiences. One very rewarding aspect of a visit, especially those involving small groups such as families, is the unmediated group discussion that can ensue during a shared cultural experience. We present a situated, mobile museum system that delivers an hour-long drama to museum visitors. It perceives and analyzes group behavior, uses the result to dynamically deliver coordinated dramatic narrative presentations about the nearby museum exhibit, with the expected result of stimulating group discussion. To accomplish this, our drama-based presentations contain small, complementary differences in the content delivered to each participant, leveraging the narrative tension/release cycle of drama to naturally lead visitors to fill in missing pieces by interacting with friends, thus initiating a conversation. We present two evaluations for these story variations, one in a closed, non-mobile environment, and the other a formative evaluation to gauge how well the methodology used in the non-mobile evaluation performs in evaluating the fully implemented system in a real museum environment.

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

mobile devices
coordinated presentations