Using ICT with people with special education needs: what the literature tells us Purpose - To provide a review of the past studies on use of information and communications technology (ICT) for people with special education needs (SEN) to inform a major research project on using ICT to facilitate self-advocacy and learning for SEN learners. Design/methodology/approach - Literature review, encompassing academic journals indexed in education, information science and social sciences databases, books, grey literature (including much internet-based material), and government reports. Information was gathered on the perceived benefits of ICT in SEN, and the use of some specific applications with people having various conditions. A number of usability studies, mainly Internet and web technologies, are also outlined. Findings - Although the literature shows a great number of ICT initiatives for people with all kinds of disabilities, there has been a surprising lack of research into the usability of the various applications developed, and even less concerning those with learning difficulties. The review of existing literature indicates a lack of attention to the application of ICT for people with SEN, compared to the other groups of disabled people such as visually impaired. Originality/value - Findings highlight the need for more research on usability aspects of current and potential applications of ICT for people with SEN.

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

communications technologies
learning disabilities
aids for the disabled


VisionBug: A hexapod robot controlled by stereo cameras A six-legged robot system demonstrating reactive behaviors of simple organisms-walking between two walls, steering around obstacles, making turns at corners, and making U-turns at pathway dead-ends-is described. The system, named VisionBug, uses no active range sensor but only a stereo pair of cameras for sensing the surroundings. The system assumes the surroundings to be consisting of mostly a ground surface, although the surface could have a varying geometric relationship with the robot due to the jiggling nature of legged motion. By the use of the image-to-image mapping induced to the stereo images by the ground surface, the system is able to avoid explicit 3D reconstruction and the use of optical flow altogether in locating through-ways. Specifically, it regards image features not respecting the ground-induced mapping as obstacles, and express the obstacles in terms of a 2D distribution on the ground. Based on the distribution information, which is further time-delay compensated, a simple fuzzy control mechanism is used to command the legged motion. Experiments show that the system is effective for demonstrating the above-mentioned behaviors in textured environment, at a speed fast enough for many applications.

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

legged robot
behavioral robotics
visually guided locomotion


Caged mice mating behavior detection in surveillance videos This study would be the first work on caged mice mating behavior detection. The mating behavior can be automatically detected in recorded videos. Various features of contacted mice are defined and used in behavior recognition. This work achieves better detection performance than our previous one.

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

animal behavior analysis
video surveillance
caged mice
laboratory animals
tracking techniques
feature extraction
object detection


Noise suppression with high speech quality based on weighted noise estimation and MMSE STSA A noise suppression algorithm with high speech quality based on weighted noise estimation and MMSE STSA is proposed. The proposed algorithm continuously updates the estimated noise by weighted noisy speech in accordance with ail estimated SNR. The spectral gain is modified with the estimated SNR so that it can better utilize the improvement in noise estimation. With a better noise estimate, a more correct SNR is obtained resulting in the enhanced speech with low distortion. Subjective evaluation results show that five-grade mean opinion scores of the new algorithm with and without a speech codec are improved by as much as 0.35 and 0.40 respectively, compared with either the original MMSE STSA or the EVRC noise suppression algorithm.

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

speech enhancement
short time spectral amplitude


Evaluating comprehension-based user models: Predicting individual user planning and action Described is a program of research that uses rigorous methods to evaluate models of user cognition and action based on the construction-integration architecture of comprehension (Doane and Sohn, 2000; Kintsch, 1988; 1998). The models interrelate user environmental information, background knowledge, and current goals, and then spread activation throughout the interrelated information to simulate UNIX user command productions, aviation pilot eye fixations and control movements during flight, and army personnel intelligence planning. Models of individuals in the complex interactive environments are tested for descriptive as well as predictive validity. Comparisons of model and human empirical data have resulted in a high degree of agreement, validating the ability of the comprehension-based architecture to support models that can predict user performance. Evaluation methods are detailed and the importance of evaluative rigor is discussed.

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

cognitive models
evaluations of models
goodness of fit


Fixed charge transportation problem with type-2 fuzzy variables Formulation of two fixed charge transportation problems with type-2 fuzzy parameters. Transportation Costs, supplies, demands, conveyance capacities are taken as type-2 fuzzy variables. CV-based reduction methods and centroid method are applied for defuzzification. Chance-constrained programming model is formulated using generalized credibility measure for the second problem. Sensitivity analysis is done for different generalized credibility levels.

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

fixed charge transportation problem
defuzzification

type-2 fuzzy set
reduction method
critical value


Shape sensitivity analysis and shape optimization in planar elasticity using the element-free Galerkin method ? This paper demonstrates that the element-free Galerkin (EFG) method can be successfully used in shape design sensitivity analysis and shape optimization for problems in 2D elasticity. The continuum-based variational equations for displacement sensitivities are derived and are subsequently discretized. This approach allows one to avoid differentiating the EFG shape functions. The present formulation, that employs a penalty method for imposing the essential boundary conditions, can be easily extended to 3D and/or non-linear problems. Numerical examples are presented to show the capabilities of the current approach for calculating sensitivities. The flexibility of the EFG method, that eliminates the element connectivity requirement of the finite element method (FEM), permits solving shape optimization problems without re-meshing. The problem of shape optimization of a fillet is used to demonstrate this fact. Smoother stresses and better accuracy for points close to the boundary allow for a better EFG solution compared to published results using the FEM, the boundary element method (BEM) or the boundary contour method (BCM). Furthermore, for the EFG approach, grid-optimization appears unnecessary.

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

shape sensitivity analysis
shape optimization

meshless methods
element-free galerkin (efg)
linear elasticity


Insight into analysis of interactions of saquinavir with HIV-1 protease in comparison between the wild-type and G48V and G48V/L90M mutants based on QM and QM/MM calculations Saquinavir (SQV) was the first HIV-1 PR inhibitor licensed for clinical use and widely used for acquired immunodeficiency syndrome (AIDS) therapy. Its effectiveness, however, has been hindered by the emergence of resistant mutations. The two most important HIV-1 PR mutants are G48V and G48V/L90M. Inhibition studies of SQV on these mutants demonstrated 13.5- and 419-fold reductions of susceptibility, respectively. In this study, an analysis of energetic binding affinity between saquinavir and the HIV-1 PR wild-type and these two mutants has been performed in detail based on density functional theory and the hybrid quantum mechanical/molecular mechanical (QM/MM) calculations. We have found that the interaction of SQV with flap residue 48 of the mutants is significantly perturbed, as shown by the reduced stability of binding between SQV and residue 48 for the G48V and G48V/L90M mutants over the wild-type. This was associated with conformational changes of the inhibitor and the enzyme, leading to the loss of hydrogen bonding between the binding subsite P2 and the backbone carbonyl of residue 48. Moreover, the G48V/L90M mutations cause the repositioning of the residues close to residues 48 and 90, at important locations as a part of the flap and catalytic regions, respectively. The repositioning of these residues consequently perturbed the binding affinity of SQV in the pocket as indicated by the decreasing interaction energies. In addition to the loss of inhibitor/enzyme binding, it is interesting to observe that the mutation leads significantly to an increase of the stability of the enzyme.

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

hiv-1 protease
molecular dynamics simulations
oniom method


A new force-directed graph drawing method based on edgeedge repulsion ? ?? The conventional force-directed methods for drawing undirected graphs are based on either vertexvertex repulsion or vertexedge repulsion. In this paper, we propose a new force-directed method based on edgeedge repulsion to draw graphs. In our framework, edges are modelled as charged springs, and a final drawing can be generated by adjusting positions of vertices according to spring forces and the repulsive forces, derived from potential fields, among edges. Different from the previous methods, our new framework has the advantage of overcoming the problem of zero angular resolution, guaranteeing the absence of any overlapping of edges incident to the common vertex. Given graph layouts probably generated by previous algorithms as the inputs to our algorithm, experimental results reveal that our approach produces promising drawings not only preserving the original properties of a high degree of symmetry and uniform edge length, but also preventing zero angular resolution and usually having larger average angular resolution. However, it should be noted that exhibiting a higher degree of symmetry and larger average angular resolution does not come without a price, as the new approach might result in the increase in undesirable overlapping of vertices as some of our experimental results indicate. To ease the problem of node overlapping, we also consider a hybrid approach which takes into account both edgeedge and vertexvertex repulsive forces in drawing a graph.

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


Social and ethical checkpoints for bottom-up synthetic biology, or protocells An alternative to creating novel organisms through the traditional top-down approach to synthetic biology involves creating them from the bottom up by assembling them from non-living components; the products of this approach are called protocells. In this paper we describe how bottom-up and top-down synthetic biology differ, review the current state of protocell research and development, and examine the unique ethical, social, and regulatory issues raised by bottom-up synthetic biology. Protocells have not yet been developed, but many expect this to happen within the next five to ten years. Accordingly, we identify six key checkpoints in protocell development at which particular attention should be given to specific ethical, social and regulatory issues concerning bottom-up synthetic biology, and make ten recommendations for responsible protocell science that are tied to the achievement of these checkpoints.

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


A survey on maritime fleet size and mix problems We examine the scientific literature on the maritime fleet size and mix problem. We summarize the past contributions of operational research to the problem. We uncover areas where further research is needed. Past research has particularly focused on the initial composition of the fleet. Important elements (e.g. uncertainty and fleet renewal) need more research.

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

logistics
maritime transportation
fleet planning


Spacetime Texture Representation and Recognition Based on a Spatiotemporal Orientation Analysis This paper is concerned with the representation and recognition of the observed dynamics (i.e., excluding purely spatial appearance cues) of spacetime texture based on a spatiotemporal orientation analysis. The term "spacetime texture" is taken to refer to patterns in visual spacetime, (x, y, t), that primarily are characterized by the aggregate dynamic properties of elements or local measurements accumulated over a region of spatiotemporal support, rather than in terms of the dynamics of individual constituents. Examples include image sequences of natural processes that exhibit stochastic dynamics (e.g., fire, water, and windblown vegetation) as well as images of simpler dynamics when analyzed in terms of aggregate region properties (e.g., uniform motion of elements in imagery, such as pedestrians and vehicular traffic). Spacetime texture representation and recognition is important as it provides an early means of capturing the structure of an ensuing image stream in a meaningful fashion. Toward such ends, a novel approach to spacetime texture representation and an associated recognition method are described based on distributions (histograms) of spacetime orientation structure. Empirical evaluation on both standard and original image data sets shows the promise of the approach, including significant improvement over alternative state-of-the-art approaches in recognizing the same pattern from different viewpoints.

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

spacetime texture
stochastic dynamics
spatiotemporal orientation

image motion
dynamic texture
temporal texture
time-varying texture
textured motion
turbulent flow
distributed representation


Analysis of cooperation gain for adaptive networks in different communication scenarios Adaptive networks are well suited to perform distributed estimation task where the observations collected by nodes of a network are used to estimate a common network-wide desired parameter. Although the benefits of cooperation are clear for the networks with ideal links, in the presence of noisy links their behavior changes considerably. Thus, it is important to analyze, in this case, when and to what extent the cooperation improves the estimation performance. In this paper, we study the influence of noisy links on the effectiveness of cooperation for two important types of adaptive networks, i.e. incremental LMS adaptive network (ILMS) and diffusion LMS (DLMS). We first define the concept of cooperation gain and compute it for the ILMS and the DLMS algorithms with ideal and noisy links. We show that when the links are ideal, both ILMS and DLMS algorithms provide increased performance in comparison with the non-cooperative solution. On the other hand, in the presence of noisy links, the cooperation gain is not always influential, and based on the channel and data statistics, for some values of step-size, a non-cooperative scheme outperforms the ILMS and DLMS algorithms. We present some simulation results to clarify the discussions.

O O B I O B I O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O B O O O O O B O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O 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 networks
cooperation gain
incremental
diffusion


An online game approach for improving students' learning performance in web-based problem-solving activities In this paper, an online game was developed in the form of a competitive board game for conducting web-based problem-solving activities. The participants of the game determined their move by throwing a dice. Each location of the game board corresponds to a gaming task, which could be a web-based information-searching question or a mini-game: the former was used to guide the participants to search for information to answer a series of questions related to the target learning issue, while the latter was used to provide supplementary materials during the gaming process. To evaluate the performance of the proposed approach, an experiment was conducted on an elementary school natural science course. The experimental results showed that the proposed approach not only significantly promoted the flow experience, learning attitudes, learning interest and technology acceptance degree of the students, but also improved their learning achievements in the web-based problem-solving activity. (C) 2012 Elsevier Ltd. All rights reserved.

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

digital game-based learning
web-based problem solving
interactive learning environments


efficient shift-adds design of digit-serial multiple constant multiplications Bit-parallel realization of the multiplication of a variable by a set of constants using only addition, subtraction, and shift operations has been explored extensively over the years as large number of constant multiplications dominate the complexity of many digital signal processing systems. On the other hand, digit-serial architectures offer alternative low-complexity designs since digit-serial operators occupy less area and are independent of the data wordlength. This paper introduces an approximate algorithm that targets the optimization of gate-level area in digit-serial constant multiplications under the shift-adds architecture. Experimental results indicate that our approximate algorithm gives better solutions than the previously proposed algorithms in terms of area at gate-level and yields alternative low-complexity designs relatively to the bit-parallel design. It is also observed on digit-serial filter designs that the use of shift-adds architecture yields area reduction up to 43.6\% with respect to designs that use generic digit-serial constant multipliers.

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

finite impulse response filters
gate-level area optimization
digit-serial arithmetic
multiple constant multiplications (mcm)


Caching on the World Wide Web With the recent explosion in usage of the World Wide Web, the problem of caching Web objects has gained considerable importance. Caching on the Web differs from traditional caching in several ways. The nonhomogeneity of the object sizes is probably the most important such difference. In this paper, we give an overview of caching policies designed specifically for Web objects and provide a new algorithm of our own. This new algorithm can be regarded as a generalization of the standard LRU algorithm. We examine the performance of this and other Web caching algorithms via event- and trace-driven simulation.

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

internet
proxy servers
admission control
performance evaluation
optimization


DESCRIBING THE FPGA-BASED HARDWARE ARCHITECTURE OF SYSTEMIC COMPUTATION (HAOS) This paper presents HAoS, the first hardware architecture of the bio-inspired computational paradigm known as Systemic Computation (SC). SC was designed to support the modelling of biological processes inherently by defining a massively parallel non-conventional computer architecture and a model of natural behaviour. In this work we describe a novel custom digital design, which addresses the SC architecture parallelism requirement by exploiting the inbuilt parallelism of a Field Programmable Gate Array (FPGA) and by using the highly efficient matching capability of a Ternary Content Addressable Memory (TCAM). Basic processing capabilities are embedded in HAoS in order to minimize time-demanding data transfers. Its custom instruction set can be expanded based on user requirements, since the optional use of a CPU provides high-level processing support if required. We demonstrate a functional simulation-verified prototype, which takes into consideration programmability and scalability, and review various communication interfaces between HAoS and the CPU. Analysis shows that the proposed architecture provides an effective solution in terms of efficiency versus flexibility trade-off and can potentially outperform prior implementations.

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

systemic computation
fpga
content addressable memory

parallel architecture
non-conventional computer architecture
natural computation
cpu-feta communication


On stabilizing volatile product returns We model a production-remanufacturing system as a discrete dynamical system. We derive explicit conditions for stable, instable or saddle point equilibria. For the waste paper industry, we can show that the equilibrium is a saddle point. Even small variations of production input proportions could stabilize the system. The substitutability of the production inputs is a main driver for chaotic behavior.

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

or in natural resources
discrete dynamical systems


Pattern recognition using neural-fuzzy networks based on improved particle swam optimization This paper introduces a recurrent neural-fuzzy network (RNFN) based on improved particle swarm optimization (IPSO) for pattern recognition applications. The proposed IPSO method consists of the modified evolutionary direction operator (MEDO) and the traditional PSO. A novel MEDO combining the evolutionary direction operator (EDO) and the migration operation is also proposed. Hence, the proposed IPSO method can improve the ability of searching global solution. Experimental results have shown that the proposed IPSO method has a better performance than the traditional PSO in the human body classification and the skin color detection. (C) 2008 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 B I I O O B I I O O O O O O O

human body classification
skin color detection

improvement evolutionary direction operator (iedo)


TCP trunking for bandwidth management of aggregate traffic TCP trunking is a novel way of applying TCP congestion control to bandwidth management of aggregate traffic. This is accomplished by setting up a separate TCP connection to probe network congestion, and then using the TCP connection's congestion control to regulate the bandwidth usage Of the aggregate traffic. TCP trunking offers several advantages in managing bandwidth of aggregate traffic. it can dynamically allocate bandwidth to competing traffic aggregates in a fair manner, while assuring no loss Of user packets due to network congestion. In addition, it can transmit user packets at guaranteed rates for traffic aggregates. Implementation details and experimental results are described in the paper.

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

tcp trunking
congestion control
bandwidth management


interfaces of active objects with internal concurrency Object-oriented techniques have been very successful so far. However, requirements on software development techniques are consistently changing together with software and hardware environments. Highly distributed and massively concurrent systems will soon be a normal case. To face the new requirements we propose to partially go back to the roots and use active objects (regarded as components) in addition to passive objects. We expect the specification of protocols in interfaces of active objects to be a crucial factor. In the envisioned systems, protocol specifications are a challenge because they can interfere with synchronization of internal concurrency. In this position paper we clarify some requirements and present raw ideas how to meet them in a programming language.

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


Panconnectivity and edge-pancyclicity of 3-ary N-cubes We study two topological properties of the 3-ary n-cube Q(n)(3). Given two arbitrary distinct nodes x and y in Q(n)(3), we prove that there exists an x-y path of every length ranging from d( x, y) to 3(n)-1, where d( x, y) is the length of a shortest path between x and y. Based on this result, we prove that Q(n)(3) is edge-pancyclic by showing that every edge in Q(n)(3) n lies on a cycle of every length ranging from 3 to 3(n).

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


text classification and named entities for new event detection New Event Detection is a challenging task that still offers scope for great improvement after years of effort. In this paper we show how performance on New Event Detection (NED) can be improved by the use of text classification techniques as well as by using named entities in a new way. We explore modifications to the document representation in a vector space-based NED system. We also show that addressing named entities preferentially is useful only in certain situations. A combination of all the above results in a multi-stage NED system that performs much better than baseline single-stage NED systems.

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

task
use
systems
new event detection
performance
paper
representation
text classification
named entities

situated
vectorization
space
event detection
topic detection and tracking
documentation
combinational
exploration


Electronic properties of neuroleptics: ionization energies of benzodiazepines Vertical ionization energies (VIEs) of medazepam, nordazepam and their molecular subunits have been calculated using the electron propagator method in the P3/CEP-31G* approximation. Vertical electron affinities (VEAs) have been obtained with a a dagger SCF procedure at the DFT-B3LYP/6-31+G* level of theory. Excellent correlations have been achieved between IE(calc) and IE(exp), allowing reliable assignment of the ionization processes. Our proposed assignment differs in many instances from that previously reported in the literature. The electronic structure of the frontier Dyson orbitals shows that the IE and EA values of the benzodiazepines can be modulated by substitution at the benzene rings. Hardness values, evaluated as (IE - EA)/2, follow the trend of the experimental singlet transition energies. Medazepam is a less hard (i.e., less stable) compound than nordazepam.

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

benzodiazepines
vertical ionization energies
vertical electron affinities

dft calculations
electron propagator theory calculations


Versatile digital architecture for mobile terminal Nowadays, modern communication systems require higher data throughput to transmit increasing flow of data. Since mobile terminal needs to support multiple radio technologies, the current challenge is to design and engineering of new digital and adaptive generic architectures. In addition these versatile architectures are able to take over of many functions, which leads to avoid the use of many circuits for these different functions. In this paper, we have identified similarities between the despreader unit in Rake receiver, the FFT-SDF (Fast Fourier Transform-Single path Delay Feedback) and the Cordic (Coordinate Rotation Digital Computer) algorithm to propose a generic architecture shared between these three widely used algorithms (architectural synthesis based on common operators technique). The proposed synthesizable architecture is coded using VHDL onto a Virtex-5 Field-Programmable Gate Array (FPGA) device and results are compared with FPGA implementations of similar works that share some common functionality. The implementation demonstrates that the proposed architecture can deliver a high reduction of the FPGA logic requirements with high maximum work frequency.

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

rake receiver
common operators technique

generic hardware architectures
fft-sdf
cordic algorithm
optimized architectural synthesis


Providing a clearer view: An examination of transparency on local government websites ? This study examines the role of content professionalism and public outreach, along with partisanship in the availability of online local public information. Comparing county and school board websites in Florida, the author suggests that online public records serve as a proxy for the entity's overall level of transparency. A content analysis of 134 local government websites reveals that school boards had a higher level of transparency than counties in Florida, while websites with a more professional look and those located in communities with a high Republican proportion had greater transparency than others. Finally, implications for scholars and government leaders are discussed.

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


Recursively defined metric spaces without contraction In this paper we use the theory of accessible categories to find fixed points of endofunctors on the category of 1-bounded complete metric spaces and nonexpansive functions. In contrast to previous approaches, we do not assume that the endofunctors are locally contractive, and our results do not depend on Banach's fixed-point theorem. Our approach is particularly suitable for constructing models of systems that feature quantitative data. For instance, using the Kantorovich metric on probability measures we construct a quantitative model for probabilistic transition systems. The metric in our model can reasonably be seen as measuring the behavioural distance between states of the system; it depends exclusively on the transition probabilities and not on an arbitrary discount factor.(C) 2007 Elsevier B.V. All rights reserved.

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

accessible category
accessible functor
behavioural pseudometric
metric space
probabilistic transition system


Context-aware knowledge-based middleware for selective information delivery in data-intensive monitoring systems Multiple embedded devices in modern control and monitoring systems are able to sense different aspects of the current context such as environmental conditions, current processes in the system and user state. The number of captured situations in the environment and quantity and variety of devices in the system produce considerable amounts of data, which should be processed, understood and followed by corresponding actions. However, fully delivered to the user regardless of their role in the system and needs, data flows cause cognitive overload and thus may compromise the safety of the system depending on the timely response of the operators. This paper addresses the problem of selective information delivery with respect to the user?s role in the system, his needs and responsibilities, by proposing context-aware information management middleware. The system utilizes Semantic Web technologies by capturing relevant information in the knowledge model of the system, which decouples data from the application logics. A clear division of data and application logics enables context-awareness and facilitates the reconfiguration process, when new information should be added into the system. The chosen approach is justified with an analysis of main trends in context-aware solutions. The engineering principles of the knowledge model are described and illustrated with simple scenarios from the building automation domain. The prototype developed proves the feasibility of the approach via performance evaluation and demonstrates the reconfiguration capabilities of information flows in the system. Further work assumes the extension of the knowledge model and integration of the system with adaptive humanmachine interfaces for multi-role and multi-user environments.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 B I O O O O O O O O O O O O O O O O O O O O O O O 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 web technologies
building automation

context-aware systems
information filtering
ontologies


Video dejittering by bake and shake Video jittering occurs when the horizontal lines of video image frames are randomly displaced due to the corruption of synchronization signals or electromagnetic interference during video transmission. Inspired by the recent Bayesian/variational dejittering model of Shen (SIAM J. Appl. Math., vol. 64, pp. 1691-1708, 2004), in the current paper we propose a novel dejittering approach nicknamed bake-and-shake. The bake step is to apply PeronaMalik type nonlinear diffusions to melt away or heat up the jittered video frames, based upon which the shake step is able to optimally estimate the individual line jitters and renormalize the jittered images. Numerical implementation of the bake-and-shake algorithm as well as several computational results are presented.

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

line jitters
dejittering
peronamalik
bake
shake

edge preservation
total variation
pde based method
newtonraphson
texture


a variation of reporting center scheme Location tracking keeps track of the location of mobile users in a mobile network. It involves two basic operations: updating and paging. Accordingly the cost of location tracking consists of two parts: updating cost and paging cost. Efforts have been made to minimize the total tracking cost. One of the strategies is the reporting center scheme which selects some cells as reporting centers. Mobile users will only update their location when they move into a new reporting center, and when a call arrives, the vicinity of the reporting center will be paged to find the specific user. This scheme decreases updating cost while increasing paging cost. Hac and zhou proposed an algorithm to minimize the total cost of the reporting center scheme. This paper presents a variation of the reporting center scheme which clusters the reporting centers based on some specific criteria. Thus updating cost will be further decreased but the paging cost will increase. The paper compares the performance of the variation with the original reporting center scheme and shows that the variation scheme outperforms the original one when the call-to-mobility ratio is lower than some threshold.

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

location management
cellular networks
performance comparison
clustering


Characterizing Organizational Use of Web-Based Services: Methodology, Challenges, Observations, and Insights Today's Web provides many different functionalities, including communication, entertainment, social networking, and information retrieval. In this article, we analyze traces of HTTP activity from a large enterprise and from a large university to identify and characterize Web-based service usage. Our work provides an initial methodology for the analysis of Web-based services. While it is nontrivial to identify the classes, instances, and providers for each transaction, our results show that most of the traffic comes from a small subset of providers, which can be classified manually. Furthermore, we assess both qualitatively and quantitatively how the Web has evolved over the past decade, and discuss the implications of these changes.

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

measurement
workload characterization
web-based services


A program for generating one-particle and two-particle coefficients of fractional parentage for the single j-orbit with isospin The program CFPjOrbit written in FORTRAN 90 is aimed at generating the list of one-particle and two-particle coefficients of fractional parentage (CFPs) for the single j-orbit with isospin. The approach is based on a simple enumeration scheme for antisymmetric A-particle states and an efficient method for constructing the eigenvectors of an idempotent matrix as proposed in [A. Deveikis, R.K. Kalinauskas, B.R. Barrett, Ann. Phys. 296 (2002) 287]. The program provides fast calculation of coefficients of fractional parentage for high j-orbits with isospin and produces results that have only small numerical uncertainties. The auxiliary program EnumCFP allows one to perform enumeration of the coefficients. Program summary Title of program:CFPjOrbit, EnumCFP Catalogue identifier:ADWI Program summary URL: http://cpc.cs.qub.ac.uk/summaries/ADWI Program obtainable from: CPC Program Library, Queen's University of Belfast, N. Ireland Licensing provisions:none Computers:Any computer with a FORTRAN 90 compiler Operating systems under which the program has been tested:Windows 2000 Programming language used:FORTRAN 90 Memory required to execute with typical data:100 MB No. of lines in programs, including test data, etc.:4855 No. of bytes in distributed programs, including test data, etc.:26 484 Distribution format:tar.gz Nature of the physical problem:Generating the list of one-particle and two-particle coefficients of fractional parentage for the single j-orbit with isospin. Method of solution:The method is based on the algorithm presented in [A. Deveikis, R.K. Kalinauskas, B.R. Barrett, Ann. Phys. 296 (2002) 287] for the spectral decomposition of an antisymmetrization operator matrix Y. The coefficients of fractional parentage are the eigenvectors of a certain antisymmetrization operator matrix Y that correspond to its unit eigenvalues. Restrictions on the complexity of the problem:The full sets of one-particle and two-particle coefficients of fractional parentage up to the j=9/2 orbit; the number of particles in the higher j-orbits should be restricted. The enumeration of coefficients of fractional parentage up to the j=15/2 orbit; the number of particles in the higher j-orbits should be restricted. Unusual features of the program:Possibility to select subsets of one-particle and two-particle coefficients of fractional parentage for calculation. Typical running time:Of the order of a few seconds for lower j-orbits to hours for the complete j=9/2 orbit calculations. (C) Elsevier B.V. All rights reserved.

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

nuclear shell model
antisymmetric a-particle states
jj-coupling


Characterization of EEGA comparative study The Electroencephalogram (EEG) is a representative signal containing information about the condition of the brain. The shape of the wave may contain useful information about the state of the brain. However, the human observer cannot directly monitor these subtle details. Besides, since bio-signals are highly subjective, the symptoms may appear at random in the time scale. Therefore, the EEG signal parameters, extracted and analyzed using computers, are highly useful in diagnostics. Chaotic measures like correlation dimension (CD), largest Lyapunov exponent (LLE), Hurst exponent (H) and entropy are used to characterize the signal. Results indicate that these nonlinear measures are good discriminators of normal and epileptic EEG signals. These measures distinguish epileptic EEG and alcoholic from normal EEG with an accuracy of more than 90%. The dynamical behavior is less random for alcoholic and epileptic compared to normal. This indicates less of information processing in the brain due to the hyper-synchronization of the EEG. Hence, the application of nonlinear time series analysis to EEG signals offers insight into the dynamical nature and variability of the brain signals. As a pre-analysis step, the EEG data is tested for nonlinearity using surrogate data analysis and the results exhibited a significant difference in the correlation dimension measure of the actual data and the surrogate data.

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

electroencephalogram
correlation dimension
lyapunov exponent
entropy
hurst exponent


a framework for scalable virtual worlds using spatially organized p2p networks The general craze for virtual environments, the potential of augmented reality applications and the announced revolution of the Internet world (Web 2.0, Web 3D.0) are key points for the emergence of an 'ambient' Web which will make it possible for users to communicate, collaborate, entertain, work and exchange content. In this context, content storage, delivery, and reproduction are among the essential points for the deployment of a highly scalable platform of wide reality. In this paper, we propose a self-scalable peer-to-peer architecture for the navigation in network-based virtual worlds. To reach this goal, we propose a fully distributed and adaptive streaming method that quickly adapts the reproduced content according to user interaction. Our content delivery strategy has been implemented and tested on a dedicated simulator with a large 3D city model.

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

self-adaptation self-repartition self-distribution self-scalabity peer-to-peer


Development of a highly specific ensemble of topological models for early identification of P-glycoprotein substrates P-glycoprotein (Pgp) is an ATP-dependent efflux transporter protein associated with multidrug resistance in several diseases such as cancer, epilepsy and AIDS. It is preferentially expressed in organs and tissues that function as a barrier (e. g. the gut walls or the blood-brain barrier) or promote the elimination of xenobiotics from the organism (e. g. liver and kidney). Pgp limits drug bioavailability; thus, the recognition of Pgp substrates at the early stages of the drug development cycle is essential for the development of new chemotherapeutic agents to deal with multidrug resistance issues. Here we present the development of several classifier models based on topological descriptors to identify potential Pgp substrates, aimed to be applied as secondary filter in virtual screening campaigns. Receiver Operating characteristic (ROC) curves show that combination of individual models, through data fusion, in a three-model ensemble, allows attaining higher areas under the curve and an overall better behavior in terms of sensitivity or specificity. The individual discriminant functions (dfs) presented have a performance similar to that of the previously reported models and, remarkably, our models only include low-dimensional (up to 2D) molecular descriptors, which makes them adequate for the virtual screening of increasingly large virtual chemical repositories. Copyright (C) 2011 John Wiley & Sons, Ltd.

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


A factorization of the symmetric Pascal matrix involving the Fibonacci matrix In this short note, we give a factorization of the Pascal matrix. This result was apparently missed by Lee et al. [Some combinatorial identities via Fibonacci numbers, Discrete Appl. Math. 130 (2003) 527534].

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


A local fuzzy thresholding methodology for multiregion image segmentation Thresholding is a direct and simple approach to extract different regions from an image. In its basic formulation, thresholding searches for a global value that maximizes the separation between output classes. The use of a single hard threshold value is precisely the source of important segmentation errors in many scenarios like noisy images or uneven illumination. If no connectivity or closed objects are considered, the method is prone to produce isolated pixels. In this paper a new multiregion thresholding methodology is presented to overcome the common drawbacks of thresholding methods when images are corrupted with artifacts and noise. It is based on relating each pixel in the image to different output centroids via a fuzzy membership function, avoiding any initial hard decision. The starting point of the technique is the definition of the output centroids using a clustering method compatible with most thresholding techniques in the literature. The method makes use of the spatial information through a local aggregation step where the membership degree of each pixel is modified by local information that takes into account the memberships of the surrounding pixels. This makes the method robust to noise and artifacts. The general formulation of the proposed methodology allows the design of spatial aggregations for multiple applications, including the possibility of including heuristic information via a fuzzy inference rule base.

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


file replication in video on demand services A large-scale video-on-demand (VOD) system demands storage of hundreds of movies and support of thousands of concurrent accesses. The number of concurrent accesses to each movie may vary, depending on the popularity of each movie. File replication problem is concerned with how to replicate, and place the movie files over a number of magnetic disk arrays such that a given access profile can be supported at a minimum cost. This is an NP-hard combinatorial problem. However with its similarity to a transportation model, we develop a transportation-type algorithm to generate a good solution in an effective and convenient form. The computational results show that the proposed algorithm outperforms the existing greedy placement algorithm.

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

transportation model
video on demand
concurrent accesses
disk arrays
file replication

northwest corner rule
storage capacity
i/o bandwidth


Simulations of signal flow in a functional model of the cortical column We describe the simulation of a layered cortex model based on the cortical column as a generic local processor. It simulates the signal flow in the layers IIV of a set of model columns across three hierarchical cortical areas. It demonstrates the fast formation of an initial stimulus hypothesis, and its subsequent refinement by inter-columnar communication. In this prototype simulation, we implement word recognition from a string of characters. The three cortical areas represent letters, syllables, and words, used as a metaphor for visual stimuli. Focusing on the intra- and inter-columnar dynamics, we show how the different processing subsystems interact in order to switch off expected signals and accomplish symbolic recognition of words, and how representations for new words can be constructed based on old representations (self-reference).

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

generic circuit
predictive coding
(re-)cognition
coretext model


Bifurcation in the numerical simulation of softening mechanisms Non-linear simulation of strain-softening materials is often impeded by the presence of singular points encountered along the equilibrium path. Available numerical techniques aimed at the treatment of singular points are presented. Emphasis is placed on bifurcation analysis. Two numerical examples of structural bifurcation are presented. In the first example, a direct tension test on a notched concrete bar is simulated, displaying a symmetric bifurcation. In the second example, a direct tension test on a tapered concrete bar is simulated, displaying a non-symmetric bifurcation. The bifurcation analysis techniques introduced are shown to be effective. The need for systematic bifurcation analysis in the non-linear simulation of strain-softening materials is concluded.

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

strain-softening material
bifurcation unfolding
branch switching


Dynamic characteristics of steeldeck composite floors under human-induced loads This paper treats the dynamic characteristics of a multi-panel floor system under human-induced loads, using finite element techniques. Load models with variable parameters of intensity, foot contact ratio, frequency and damping are developed and applied as pattern loads. Panel response in terms of deflections and accelerations are evaluated and used to assess the panel for suitable occupancies. Results indicate the occurrence of multimodal vibration in these structures and the importance of applying pattern loads to capture these modes. Vibration caused by the higher harmonics of the activity frequency can also cause discomfort and excessive deflections in the floor panels.

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

composite floors
vibration
pattern loads

multi-modal
human-induced loads
foot contact time


Struggling against simple and cooperative black hole attacks in multi-hop wireless ad hoc networks In multi-hop wireless ad hoc networks, nodes not in direct range rely on intermediate nodes to communicate. In order to preserve its limited resources or to launch a DoS attack, an intermediate node drops packets going through it instead to forward them to its successor. In this paper, we deal with this misbehavior called black hole attack, and we propose an authenticated end-to-end acknowledgment based approach in order to check the correct forwarding of packets by intermediate nodes. Our approach detects the black hole conducted in simple or cooperative manner, the modification and the replay of messages attacks. Through simulation using OPNET simulator, we show the detection efficiency and evaluate the performance of our approach in both proactive and reactive routing based networks in terms of end-to-end delay and network load. Also, we compare the approach we propose with 2-hop ACK and the watchdog approaches in terms of detection ratio, delivery ratio and additional overhead.

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

wireless ad hoc network
routing protocol security
simple black hole


wireless virtualization on commodity 802.11 hardware In this paper we describe specific challenges in virtualizing a wireless network and multiple strategies to address them. Among different possible wireless virtualization strategies, our current work in this domain is focussed on a Time-Division Multiplexing (TDM) approach. Hence, we we present our experiences in the design and implementation of such TDM-based wireless virtualization. Our wireless virtualization system is specifically targeted for multiplexing experiments on a large-scale 802.11 wireless testbed facility.

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

wireless networks
time division multiplexing


Simultaneous topology optimization of structure and supports The purpose of this paper is to demonstrate a method for and the benefits of simultaneously designing structure and support distribution using topology optimization. The support conditions are included in the topology optimization by introducing, a new set of design variables that represents supported areas. The method is applied to compliance minimization and mechanism design. In the case of mechanism design, the large displacements of the mechanism are modelled using geometrically nonlinear FE-analysis. Examples with minimization of the compliance demonstrate the effects of using variable cost of supports in a design domain. Other examples show that more efficient mechanisms are obtained by introducing the support conditions in the topology optimization problem.

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


'Orchestrating' sustainable crowdsourcing: A characterisation of solver brokerages Exemplars of open innovation have revealed that intellectual property (IP) need not only be sourced through existing hierarchical or market relationships. Rather IP can be acquired from individuals and firms with whom an organization has no prior relationship. In such cases, an intermediary, operating as an innovation exchange or brokerage, frequently facilitates the development and acquisition of IP. This paper examines one type of innovation intermediary, the 'Solver Brokerage,' which enables innovation exchanges between organizations and unknown external firms and individuals (i.e. a crowdsourcing process). While the commercial success of Solver Brokerages indicates the potency of arguments concerning the potential of crowdsourcing, little is known about the operation of such brokerages or the crowdsourcing processes that they enable. This paper examines extant research on innovation networks, crowdsourcing, and electronic marketplaces to identify three processes (knowledge mobility, appropriability and stability) that we argue are necessary to 'orchestrate' crowdsourcing. Using a field study of four Solver Brokerages, an innovation seeking organization, as well as 15 innovation providers (i.e. members of the 'crowd'), the paper illustrates the ways in which the three orchestration processes are enhanced in Solver Brokerages. It reveals that while knowledge mobility and appropriability processes can be enhanced by activities under the control of the Solver Brokerage, stability is largely determined by innovation seeking organizations and the innovation providers. The paper concludes that broker-provided value-added 'orchestration' services need to enable knowledge mobility and appropriability, and to ensure that 'unsuccessful' innovation seekers and providers appropriate sufficient value to participate again. (C) 2012 Elsevier B.V. All rights reserved.

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

open innovation
crowdsourcing
knowledge mobility
appropriability
stability


a platform for the generation of virtual environments inhabited by intelligent virtual humans We describe a platform to build virtual environments inhabited by autonomous virtual humans. We propose an architecture comprising several software components assembled to define a platform. The architecture includes a 3D-modelling software, a rendering engine, a library for simulating rigid body dynamics and an agent development framework.

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

virtual environments
autonomous virtual humans


INTERPOLATION IN LOCAL THEORY EXTENSIONS In this paper we study interpolation in local extensions of a base theory. We identify situations in which it is possible to obtain interpolants in a hierarchical manner, by using a prover and a procedure for generating interpolants in the base theory as black-boxes. We present several examples of theory extensions in which interpolants can be computed this way, and discuss applications in verification, knowledge representation, and modular reasoning in combinations of local theories.

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

interpolation
verification
knowledge representation


Development of the nursing problem list subset of SNOMED CT To create an interoperable set of nursing diagnoses for use in the patient problem list in the EHR to support interoperability. Queries for nursing diagnostic concepts were executed against the UMLS Metathesaurus to retrieve all nursing diagnoses across four nursing terminologies where the concept was also represented in SNOMED CT. A candidate data set was retrieved and included the nursing diagnoses and corresponding SNOMED CT concepts from the UMLS Metathesaurus. The team members identified the concepts that met the semantic selection criteria for inclusion in the nursing problem list. 1320 concepts were returned in the initial UMLS Metathesaurus query of nursing diagnostic concepts. Further analysis was conducted to identify those nursing diagnostic concepts mapped to SNOMED CT and duplicate concepts were removed resulting in 591 unique UMLS Metathesaurus concepts. The query extracted all concepts from two of the nursing terminologies that contained interventions and outcomes. After cleaning the dataset, the final count of SNOMED CT concepts in the nursing problem list subset is 369. The problem list is a key component of the patient care and has been acknowledged as critical by the EHR Meaningful Use criteria. Nursing diagnoses on the problem list are foundational for constructing a nursing care plan. A multidisciplinary patient problem list will facilitate communication and evaluation of the contribution of nursing care to the patients clinical care experiences and outcomes.

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

nursing informatics
healthcare terminology
health informatics
systemized nomenclature of medicine
unified medical language system


Assessing the health of an information systems applications portfolio: An example from process manufacturing This paper presents a model of the IS applications portfolio and illustrates how its "health" can be assessed through an example from process manufacturing. The health assessment is based on an evaluation by senior managers of a business unit's portfolio of information systems. This assessment is made on five separate, but related, attributes of each system in the portfolio: importance, investment, technical quality, use, and management value. The "Health Grid" is introduced as a way of representing the IS applications portfolio in order to facilitate the assessment and interpretation of its health. One of the advantages of using the grid is to make such an assessment explicit, transparent, and discussible. In an example, the Health Grid is used to assess and interpret the IS applications portfolio of the most profitable business unit in a large process manufacturing firm. The applications portfolio, consisting of 18 systems, was generally assessed as requiring attention. For example, there was no evidence of any relationship between the investment in a given system and its management value. The paper includes a suggested approach for using the Health Grid and an analysis of the strengths and weaknesses of the approach. A description of the changes made to the IS portfolio in the example firm after the initial data collection completes the paper.

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


an iptv service delivery model using novel virtual network topology Network Virtualization, as an irresistible trend for building future Internet, create a virtual topology on the top of the current network architecture and provide end-to-end quality of service guarantees. By utilizing the flexibility of the virtual network, this paper proposes a novel and reliable model for IPTV service delivery using network virtualization. The challenging issues in our model are the virtual network topology construction and virtual network embedding. Since the current network topologies are not sufficient enough to be applied, an advanced topology named Multi-Depots Ring-Star with 2-Depots per Ring is proposed for improving the efficiency and reliability of the IPTV service delivery network. We also develop a VN construction and allocation framework which reduces the difficulty of topology reconstruction problem caused by the unpredictability of virtual network embedding results.

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

network virtualization
service delivery network
topology
iptv


blend surfaces for set theoretic volume modelling systems Most volume modelling systems are very limited in the complexity of the surfaces which they support. This is satisfactory for basic models of most mechanical components, since the functional surfaces are not usually complex. However, there are often blends between simple base surfaces. This paper presents a technique appropriate for blend definition and profile control. A discussion of blend conics is used to develop analogous surfaces for use in typical volume modelling systems. These surfaces are then used to set theoretically define bounded volumes for fillets and chamfers. Empirical results show that the method described suits many engineering applications.

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

applications
method
use
systems
definition
volume modelling
functional
support
complexity
paper
control

engine
curved surfaces
ray tracing
model
profiles
computer aided design
surface
component


Dimensional reduction of 3D building models using graph theory and its application in building energy simulation Since the various people involved in the design process for a building project tend to hold conflicting views, this inevitably leads to a range of disparate models for planning and calculation purposes. In order to interpret the relevant geometrical, topological and semantical data for any given building model, we identify a structural component graph, a graph of room faces, a room graph and a relational object graph as aids and explain algorithms to derive these relations. We start with a building model by transferring its geometrical, topological and semantical data into a volume model, decomposing the latter into a so-called connection model and then extracting all air volume bodies and hulls of the model by means of further decomposition into elementary cyclic connection components. The technique is demonstrated within the scope of building energy simulation by deriving both a dimensionally reduced object model required for setting up a thermal multizone model and a geometrical model for defining single or multiple computational fluid dynamic domains in a building together with incidence matrices correlating these models. The algorithm is basically applicable to any building energy simulation tool.

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

air volume body extraction
building information model (bim)
building product modeling
dimension reduction
geometrical and topological analysis
industry foundation classes


Volumetric attribute filtering and interactive visualization using the max-tree representation The Max-Tree designed for morphological attribute filtering in image processing, is a data structure in which the nodes represent connected components for all threshold levels in a data set. Attribute filters compute some attribute describing the shape or size of each connected component and then decide which components to keep or to discard. In this paper, we augment the basic Max-Tree data structure such that interactive volumetric filtering and visualization becomes possible. We introduce extensions that allow 1) direct, splatting-based, volume rendering; 2) representation of the Max-Tree on graphics hardware; and 3) fast active cell selection for isosurface generation. In all three cases, we can use the Max-Tree representation for visualization directly, without needing to reconstruct the volumetric data explicitly. We show that both filtering and visualization can be performed at interactive frame rates, ranging between 2.4 and 32 frames per seconds. In contrast, a standard texture-based volume visualization method manages only between 0.5 and 1.8 frames per second. For isovalue browsing, the experimental results show that the performance is comparable to the performance of an interval tree, where our method has the advantage that both filter threshold browsing and isolevel browsing are fast. It is shown that the methods using graphics hardware can be extended to other connected filters.

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

nonlinear filtering volume visualization


The connected p-center problem on block graphs with forbidden vertices Let G(V, E, w, l) denote an n-vertex and m-edge graph in which in is a function mapping each vertex v to a positive weight w(v) and I is a function mapping each edge e to a positive length l(e). Given a positive integer p, the p-Center problem involves finding a set Q with p vertices of G to be the locations for building facilities. The objective is to minimize the maximum weighted distance from each vertex in V-Q to its nearest vertex in Q. This paper considers a practical restriction: the induced subgraph of the selected p vertices must be connected. The new variant is called the Connected p-Center problem (the CpC problem). For each fixed integer t >= 1, on block graphs with exactly t blocks, we first show that the CpC problem is NP-hard when (1) w(v) = 1, for all vertices v, and l(e) is an element of {1, 2}, for all edges e, and (2) w(v) is an element of {1, 2}, for all vertices v, and l(e) = 1, for all edges e, respectively. Second, an O(n + m)-time algorithm for solving the CpC problem on block graphs with unit vertex-weights and unit edge-lengths is proposed. Then, the algorithmic result is extended to handle the situation in which some vertices in G cannot be included to form feasible solutions. The complexity of the extended algorithm is also O(n + m). (C) 2011 Elsevier B.V. All rights reserved.

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

connected p-centers
block degrees
np-hard
graphs with forbidden vertices


Fragment-based approximate retrieval in highly heterogeneous XML collections Due to the heterogeneous nature of XML data for internet applications exact matching of queries is often inadequate. The need arises to quickly identify subtrees of XML documents in a collection that are similar to a given pattern. Similarity involves both tags, that are not required to coincide, and structure, in which not all the relationships among nodes in the tree structure are strictly preserved. In this paper we present an efficient approach to the identification of similar subtrees, relying on ad-hoc indexing structures. The approach allows to quickly detect, in a heterogeneous document collection, the minimal portions that exhibit some similarity with the pattern. These candidate portions are then ranked according to their actual similarity. The approach supports different notions of similarity, thus it can be customized to different application domains. In the paper, three different similarity measures are proposed and compared. The approach is experimentally validated and the experimental results are extensively discussed.

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

approximate structural retrieval
enhanced indexing techniques


Unobtrusive human height and posture recognition with a capacitive sensor In pervasive context recognition and user identification applications, unobtrusive recognition of user height and posture is difficult. With the current state of technology, this becomes even harder in environments where cameras are not desired or allowed. This paper answers this problem by presenting a simple, unobtrusive, and low-cost system for measuring height and posture of the user. The measurement method is based on capacitive coupling of low-frequency signals and conductivity of the human body. The designed system was simulated, implemented, and tested with 14 adults. The experimental results show that in 90% of the test cases the height of a person can be measured with 5.2 cm and 14.3 accuracy in standing and all other postures, respectively.

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

posture recognition
capacitive sensor
context recognition
user identification


Near-infrared spectroscopy and partial least squares-class modeling (PLS-CM) for metabolomics fingerprinting discrimination of intervention breakfasts ingested by obese individuals Near-infrared spectroscopy has been used in nutritional metabolomics fingerprinting for the assessment of the intake of intervention breakfasts prepared with four different vegetable oils that were previously subjected to a deep frying process of 20 cycles for 5min at 180 degrees C. The target oils were an extra virgin olive oil and three varieties of refined sunflower oil. Of the three latter, one of them was used as such, other was spiked with a synthetic oxidation inhibitor (dimethylsiloxane) and, finally, the last one was enriched with an extract of phenolic compounds from olive pomace, the antioxidant properties of which are well known. Urine sampled from individuals before intake and 2 and 4h after intake was directly analyzed by NIRS to obtain fingerprint characteristics of the metabolome composition. The resulting urinary patterns were combined for statistical analysis by unsupervised and supervised approaches. Partial least squares-class modeling enabled to develop class-models for each intervention breakfast, thus achieving discrimination of urinary fingerprints from individuals after breakfast intake. The models were statistically characterized by estimation of sensitivity and specificity parameters for the training and evaluation (validation) steps. The application of variable importance in projection algorithm enabled to detect the spectral regions with higher significance to explain the variability observed in the partial least squares class-models. Quantitative differences of variable importance in projection scores discriminated among the different classes under study. Copyright (c) 2013 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 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

partial least squares-class modeling (pls-cm)


Fuzzy soft rings and fuzzy soft ideals Our aim in this paper is to introduce and study the fuzzy soft ring and \(\left( \in,\in\vee q\right) \)-fuzzy soft subring that is generalization of fuzzy soft ring. We also study some of their basic properties and give several examples.

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

fuzzy soft set
fuzzy soft group
\(\left(\in
\in\vee q\right) \)-fuzzy soft rings
\in\vee q\right) \)-fuzzy soft ideal


Conceptual design of aeroelastic structures by topology optimization A topology optimization methodology is presented for the conceptual design of aeroelastic structures accounting for the fluid-structure interaction. The geometrical layout of the internal structure, such as the layout of stiffeners in a wing, is optimized by material topology optimization. The topology of the wet surface, that is, the fluid-structure interface, is not varied. The key components of the proposed methodology are a Sequential Augmented Lagrangian method for solving the resulting large-scale parameter optimization problem, a staggered procedure for computing the steady-state solution of the underlying nonlinear aeroelastic analysis problem, and an analytical adjoint method for evaluating the coupled aeroelastic sensitivities. The fluid-structure interaction problem is modeled by a three-field formulation that couples the structural displacements, the flow field, and the motion of the fluid mesh. The structural response is simulated by a three-dimensional finite element method, and the aerodynamic loads are predicted by a three-dimensional finite volume discretization of a nonlinear Euler flow. The proposed methodology is illustrated by the conceptual design of wing structures. The optimization results show the significant influence of the design dependency of the loads on the optimal layout of flexible structures when compared with results that assume a constant aerodynamic load.

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

topology optimization
sequential augmented lagrangian method

aeroelasticity
fluid-structure interaction
coupled adjoint sensitivity analysis


Repeating image watermarking technique by the visual cryptography A repeating watermarking technique based on visual secret sharing (VSS) scheme provides the watermark repeated throughout the image for avoiding the image cropping. In this paper, the watermark is divided into public watermark and secret watermark by using the VSS scheme to improve the security of the proposed watermarking technique. Unlike the traditional methods, the original watermark does not have to be embedded into the host image directly and, thus, it is hard to be detected or removed by the pirates or hackers. The retrieved watermark extracted from the watermarked image does not require the complete original image, but requires a secret watermark. Furthermore, the watermarking technique suits the watermark with an adaptive size of binary image for designing the watermarking system. The experimental results show that the proposed method can withstand the common image processing operations, such as filtering, lossy compression and the cropping attacking etc. The embedded watermark is imperceptible, and that the extracted watermark identifies clearly the owner's copyright.

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

watermarking
visual secret sharing
common image processing
public watermark
secret watermark


Random access broadcast: Stability and throughput analysis A wireless network in which packets are broadcast to a group of receivers through use of a random access protocol is considered in this work. The relation to previous work on networks of interacting queues is discussed and subsequently, the stability and throughput regions of the system are analyzed and presented. A simple network of two source nodes and two destination nodes is considered first. The broadcast service process is analyzed assuming a channel that allows for packet capture and multipacket reception. It is proved that the stability and throughput regions coincide in this small network. The same problem for a network with N sources and AT destinations is considered next. The channel model is simplified in that packet capture and multipacket reception is no longer permitted. Bounds on the stability region are developed using the concept of stability rank and the throughput region of the system is compared to the bounds. Our results show that as the number of destination nodes increases, the stability and throughput regions diminish. Additionally, a previous conjecture that the stability and throughput regions coincide for a network of arbitrarily many sources is supported for a broadcast scenario by the results presented in this work.

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

multipacket reception
random access
stability
throughput


Non-Parametric Kernel Learning with robust pairwise constraints For existing kernel learning based semi-supervised clustering algorithms, it is generally difficult to scale well with large scale datasets and robust pairwise constraints. In this paper, we propose a new Non-Parametric Kernel Learning ( NPKL ) framework to deal with these problems. We generalize the graph embedding framework into kernel learning, by reforming it as a semi-definitive programming ( SDP ) problem, smoothing and avoiding over-smoothing the functional Hilbert space with Laplacian regularization. We propose two algorithms to solve this problem. One is a straightforward algorithm using SDP to solve the original kernel learning problem, dented as TRAnsductive Graph Embedding Kernel ( TRAGEK ) learning; the other is to relax the SDP problem and solve it with a constrained gradient descent algorithm. To accelerate the learning speed, we further divide the data into groups and used the sub-kernels of these groups to approximate the whole kernel matrix. This algorithm is denoted as Efficient Non-PArametric Kernel Learning ( ENPAKL ). The advantages of the proposed NPKL framework are (1) supervised information in the form of pairwise constraints can be easily incorporated; (2) it is robust to the number of pairwise constraints, i.e., the number of constraints does not affect the running time too much; (3) ENPAKL is efficient to some extent compared to some related kernel learning algorithms since it is a constraint gradient descent based algorithm. Experiments for clustering based on the learned kernels show that the proposed framework scales well with the size of datasets and the number of pairwise constraints. Further experiments for image segmentation indicate the potential advantages of the proposed algorithms over the traditional k-means and N-cut clustering algorithms for image segmentation in term of segmentation accuracy.

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

semi-definitive programming
pairwise constraint
semi-supervised learning


Short term load forecasting using wavelet transform combined with HoltWinters and weighted nearest neighbor models A novel method involving Haar wavelet filter is proposed for load forecasting. Load series is decomposed into deterministic and fluctuation components. HoltWinters and weighted nearest neighbor methods model these subseries. The proposed methodology is tested on California and Spain energy markets. The results obtained are evaluated on MAPE, WMAPE and EVweek metrics.

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

weighted nearest neighbor
haar wavelet
load forecasting


sensor-rich video exploration on a map interface Result presentations from searches into video repositories is still a challenging problem. Current systems usually display a ranked list that shows the first frame of each video. Users then explore the videos one-by-one. In our recent work we have investigated the fusion of captured video with a continuous stream of sensor meta-data. These so-called sensor-rich videos can conveniently be captured with today's smartphones. Importantly, the recorded sensor-data streams enable processing and result resentation in novel and useful ways. In this demonstration we present a system that provides an integrated solution to present videos based on keyframe extraction and interactive, map-based browsing. As a key feature, the system automatically computes popular places based on the collective information from all the available videos. For each video it then extracts keyframes and renders them at their proper location on the map synchronously with the video playback. All the processing is performed in real-time, which allows for an interactive exploration of all the videos in a geographic area.

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


The promise and perils of near-regular texture Motivated by the low structural fidelity for near-regular textures in current texture synthesis algorithms, we propose and implement an alternative texture synthesis method for near-regular texture. We view such textures as statistical departures from regular patterns and argue that a thorough understanding of their structures in terms of their translation symmetries can enhance existing methods of texture synthesis. We demonstrate the perils of texture synthesis for near-regular texture and the promise of faithfully preserving the regularity as well as the randomness in a near-regular texture sample.

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

near-regular texture
lattice
texture analysis
symmetry groups


Balanced Multi-Label Propagation for Overlapping Community Detection in Social Networks In this paper, we propose a balanced multi-label propagation algorithm (BMLPA) for overlapping community detection in social networks. As well as its fast speed, another important advantage of our method is good stability, which other multi-label propagation algorithms, such as COPRA, lack. In BMLPA, we propose a new update strategy, which requires that community identifiers of one vertex should have balanced belonging coefficients. The advantage of this strategy is that it allows vertices to belong to any number of communities without a global limit on the largest number of community memberships, which is needed for COPRA. Also, we propose a fast method to generate "rough cores", which can be used to initialize labels for multi-label propagation algorithms, and are able to improve the quality and stability of results. Experimental results on synthetic and real social networks show that BMLPA is very efficient and effective for uncovering overlapping communities.

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


Improving RFID adoption in Taiwan's healthcare industry based on a DEMATEL technique with a hybrid MCDM model RFID adoption is a problem requiring a multi-criteria decision analysis. This study is presented to demonstrate the effectiveness of hybrid MCDM model. DEMATEL for solving the problems of interdependence and feedback problem. DANP and VIKOR for identify influential weights and gaps base on TOEC framework. The results can provide the best way to improve existing RFID adoption processes.

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

decision making trial and evaluation laboratory (dematel)

multiple criteria decision making (mcdm)


Deterministic recognizability of picture languages with Wang automata We present a model of automaton for picture language recognition, called Wang automaton, which is based on labeled Wang tiles. Wang automata combine features of both online tessellation acceptors and 4-way automata: as in online tessellation acceptors, computation assigns states to each picture position; as in 4-way automata, the input head visits the picture moving from one pixel to an adjacent one, according to some scanning strategy. Wang automata recognize the class REC, i.e. they are equivalent to tiling systems or online tessellation acceptors, and hence strictly more powerful than 4-way automata. We also introduce a natural notion of determinism for Wang automata, and study the resulting class, extending the more traditional approach of diagonal-based determinism, used e. g. by deterministic tiling systems. In particular, we prove that the concept of row (or column) ambiguity defines the class of languages recognized by Wang automata directed by boustrophedonic scanning strategies.

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

picture language
tiling systems
online tessellation acceptors
determinism

2d language
4-way automata
wang systems
unambiguity