Linear methods for G1 G 1 , G2 G 2 , and G3 G 3 Multi-degree reduction of Bzier curves In this paper, linear methods to find the multi-degree reduction of Bzier curves with G1 G 1 -, G2 G 2 -, and G3 G 3 -continuity at the end points of the curves are derived. This is a significant improvement over existing geometric continuity degree reduction methods. The general equations for G2 G 2 - and G3 G 3 -multi-degree reduction schemes are non-linear; we were able to simplify these non-linear equations to linear ones by requiring C1 C 1 -continuity. Our linear solution is given in an explicit, non-iterative form, and thus has lower computational costs than existing methods which were either non-linear or iterative. Further, there are no other existing G3 G 3 -methods for multi-degree reduction. We give some examples and figures to demonstrate the efficiency, simplicity, and stability of our methods.

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


Improving handover quality in 4G mobile systems In this paper, we propose a new handover algorithm to guarantee handover quality in 4G mobile systems. The proposed algorithm limits the handover interruption time by improving the HARQ retransmission latency of the first packet transmitted from new serving cell. Through the simulations, we proved that our algorithm meets the requirement of handover interruption time for TCP services with high rate.

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


automatic 3d skull reconstruction using invariant features In this work we propose a new method to segment range images. It automatically extracts invariant features directly from point clouds. Points belonging to such features are used as the input to improve an evolutionary approach to 3D range image registration in forensic anthropology. We use such features in the automatic reconstruction of an accurate 3D model of the skull. Our reconstruction method includes a pre-alignment stage, that uses a subset of feature points, and a refinement stage. Results are presented over a set of instances of real problems.

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

3d skull reconstruction
range image registration
invariant features


Reconstruction of structured scenes from two uncalibrated images This paper investigates a practical heuristics method for reconstruction of structured scenes from two uncalibrated images. The method is based on an initial estimation of principal homographies from 2D initial point matches that may contain some outliers, and the homographies are refined recursively by incorporating the supporting matches of both points and lines on principal space surfaces. Then epipolar geometry is recovered directly from the refined homographies and cameras are calibrated from three orthogonal vanishing points and the recovered infinite homography. There are several points of novelty. First, a simple homography-guided method for matching line segments between two views is proposed. Second, under the assumption of zero-skew, the cameras are auto-calibrated with all the four intrinsic parameters varying between the two views. The advantages of the method is that it can build more realistic models with minimal human interactions, and it also allows us to reconstruct more visible surfaces on the detected planes than traditional methods which can only reconstruct the overlapping parts, since the homography provides a one-to-one mapping of points and lines between different views. Extensive experiments with real images illustrate the validity and advantages of the proposed method.

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

plane induced homography
camera calibration
3d reconstruction
absolute conic
structured scene


Characterization of CO2 and mixed methane/CO2 hydrates intercalated in smectites by means of atomistic calculations CO2 and CH4 CO2 hydrates in smectites interlayer are studied by Molecular Dynamics. Water molecules form a gas hydrate-like hydrogen bonding network in the interlayer. The smectite 2:1 layer surface promotes the formation of gas hydrate complexes. Smectite-CH4 hydrate complexes are more stable than smectite-CO2 hydrate complexes.

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

gas hydrates
co2 clathrates
co2 sequestration
methane hydrate


Finite element and sensitivity analysis of thermally induced flow instabilities This paper presents a finite element algorithm for the simulation of thermo-hydrodynamic instabilities causing manufacturing defects in injection molding of plastic and metal powder. Mold-filling parameters determine the flow pattern during filling, which in turn influences the quality of the final part. Insufficiently, well-controlled operating conditions may generate inhomogeneities, empty spaces or unusable parts. An understanding of the flow behavior will enable manufacturers to reduce or even eliminate defects and improve their competitiveness. This work presents a rigorous study using numerical simulation and sensitivity analysis. The problem is modeled by the Navier-Stokes equations, the energy equation and a generalized Newtonian viscosity model. The solution algorithm is applied to a simple flow in a symmetrical gate geometry. This problem exhibits both symmetrical and non-symmetrical solutions depending on the values taken by flow parameters. Under particular combinations of operating conditions, the flow was stable and symmetric, while some other combinations leading to large thermally induced viscosity gradients produce unstable and asymmetric flow. Based on the numerical results, a stability chart of the flow was established, identifying the boundaries between regions of stable and unstable flow in terms of the Graetz number (ratio of thermal conduction time to the convection time scale) and B, a dimensionless ratio indicating the sensitivity of viscosity to temperature changes. Sensitivities with respect to flow parameters are then computed using the continuous sensitivity equations method. We demonstrate that sensitivities are able to detect the transition between the stable and unstable flow regimes and correctly indicate how parameters should change in order to increase the stability of the flow. Copyright (C) 2009 John Wiley & Sons, Ltd.

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

stable and unstable flows
generalized newtonian fluids


Integrating clinical research with the Healthcare Enterprise: From the RE-USE project to the EHR4CR platform ? There are different approaches for repurposing clinical data collected in the Electronic Healthcare Record (EHR) for use in clinical research. Semantic integration of siloed applications across domain boundaries is the raison dtre of the standards-based profiles developed by the Integrating the Healthcare Enterprise (IHE) initiative an initiative by healthcare professionals and industry promoting the coordinated use of established standards such as DICOM and HL7 to address specific clinical needs in support of optimal patient care. In particular, the combination of two IHE profiles the integration profile Retrieve Form for Data Capture (RFD), and the IHE content profile Clinical Research Document (CRD) offers a straightforward approach to repurposing EHR data by enabling the pre-population of the case report forms (eCRF) used for clinical research data capture by Clinical Data Management Systems (CDMS) with previously collected EHR data. Implement an alternative solution of the RFDCRD integration profile centered around two approaches: (i) Use of the EHR as the single-source data-entry and persistence point in order to ensure that all the clinical data for a given patient could be found in a single source irrespective of the data collection context, i.e. patient care or clinical research; and (ii) Maximize the automatic pre-population process through the use of a semantic interoperability services that identify duplicate or semantically-equivalent eCRF/EHR data elements as they were collected in the EHR context. The RE-USE architecture and associated profiles are focused on defining a set of scalable, standards-based, IHE-compliant profiles that can enable single-source data collection/entry and cross-system data reuse through semantic integration. Specifically, data reuse is realized through the semantic mapping of data collection fields in electronic Case Report Forms (eCRFs) to data elements previously defined as part of patient care-centric templates in the EHR context. The approach was evaluated in the context of a multi-center clinical trial conducted in a large, multi-disciplinary hospital with an installed EHR. Data elements of seven eCRFs used in a multi-center clinical trial were mapped to data elements of patient care-centric templates in use in the EHR at the George Pompidou hospital. 13.4% of the data elements of the eCRFs were found to be represented in EHR templates and were therefore candidate for pre-population. During the execution phase of the clinical study, the semantic mapping architecture enabled data persisted in the EHR context as part of clinical care to be used to pre-populate eCRFS for use without secondary data entry. To ensure that the pre-populated data is viable for use in the clinical research context, all pre-populated eCRF data needs to be first approved by a trial investigator prior to being persisted in a research data store within a CDMS. Single-source data entry in the clinical care context for use in the clinical research context a process enabled through the use of the EHR as single point of data entry, can if demonstrated to be a viable strategy not only significantly reduce data collection efforts while simultaneously increasing data collection accuracy secondary to elimination of transcription or double-entry errors between the two contexts but also ensure that all the clinical data for a given patient, irrespective of the data collection context, are available in the EHR for decision support and treatment planning. The RE-USE approach used mapping algorithms to identify semantic coherence between clinical care and clinical research data elements and pre-populate eCRFs. The RE-USE project utilized SNOMED International v.3.5 as its pivot reference terminology to support EHR-to-eCRF mapping, a decision that likely enhanced the recall of the mapping algorithms. The RE-USE results demonstrate the difficult challenges involved in semantic integration between the clinical care and clinical research contexts.

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

terminology
semantic interoperability
hl7
ihe

translational research
clinical protocols
information systems
controlled vocabulary
cdise


New efficient MDS array codes for RAID - Part II: Rabin-like codes for tolerating multiple (>= 4) disk failures A new class of Binary Maximum Distance Separable (MDS) array codes which are based on circular permutation matrices are introduced in this paper. These array codes are used for tolerating multiple ( >= 4) disk failures in Redundant Arrays of Inexpensive Disks (RAID) architecture. The size of the information part is m x n, where n is the number of information disks and (m+1) is a prime integer; the size of the parity-check part is m x r, the minimum distance is r + 1, and the number of parity-check disks is r. In practical applications, m can be very large and n ranges from 20 to 50. The code rate is R= n/n+r. These codes can be used for tolerating up to r disk failures, with very fast encoding and decoding. The complexities of encoding and decoding algorithms are O(rmn) and O(m(3)r(4)), respectively. When r = 4, there need to be 9mn XOR operations for encoding and (9n+95)(m+1) XOR operations for decoding.

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


Implementing Congestion Avoidance Mechanism in Cluster Based Routing Protocol for Wireless Mesh Client Networks The wireless mesh network is a promising technology to help shape the world of pervasive communication for more comfortable, efficient and cheap wireless network platform. One of the challenges before this technology is congestion that causes packet loss. However, the challenge can be efficiently reduced if congestion avoidance mechanism is improvised into the routing protocols. In this paper, we proposed an improved congestion avoidance cluster based routing protocol (i-CBRPCA) for wireless clients in the mesh networks. In the mechanism, the traffic rate of source clusterhead is compared with the traffic rate of the receiving intermediate clusterhead and Arbitration Interframe Space Number of the sending clusterhead is increased or decreased depending on whether the traffic rate is decreased or increased. This congestion metric helps control the rate in order to have maximum allowable traffic traversing the intermediate clusterheads. Based on the simulation results, the proposed approach delivers high packets, reduced delay, delivers high throughput and lower packet loss when compared with CBRP.

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

traffic flows
congestion feedback
hop-by-hop
backpressure
mesh clients


Lose and gain: impacts of ERK5 and JNK cascades on each other Kinase cascades in ERK5 (Extracellular signal-regulated kinases) and JNK (c-Jun N-terminal kinases) signaling pathways mediate the sensing and processing of stimuli. Cross-talks between signaling cascades is a likely phenomenon that can cause apparently different biological responses from a single pathway, on its activation. Feedback loops have the potential to greatly alter the properties of a pathway and its response to stimuli. Based on enzyme kinetic reactions, mathematical models have been developed to predict and analyze the impacts of cross-talks and feedback loops in ERK5 and JNK cascades. It has been observed that, there is no significant impact on neither ERK5 activation nor JNKs activation due to cross-talks between them. But it is due to cross-talks and feedback loops in ERK5 and JNK cascade, ERK5 gets activated in a transient manner in the absence of input signals. Planning to obtain the parameter values from the experimentalist and the result should be validated by experimental verification.

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

enzyme kinetic reactions
feedback loops
jnk cascade

dynamic systems
cross-talks
erk5 cascade


An efficient data structure for lattice operations In this paper, we consider the representation and management of an element set on which a lattice partial order relation is defined. In particular, let n be the element set size. We present an O(n root n)-space implicit data structure for performing the following set of basic operations: 1. Test the presence of an order relation between two given elements, in constant time. 2. Find a path between two elements whenever one exists, in O(l) steps, where l is the path length. 3. Compute the successors and/or predecessors set of a given element, in O(h) steps, where h is the size of the returned set. 4. Given two elements, find all elements between them, in time O(k log d), where k is the size of the returned set and d is the maximum in-degree or out-degree in the transitive reduction of the order relation. 5. Given two elements, find the least common ancestor and/or the greatest common successor in O(root n)-time. 6. Given k elements, find the least common ancestor and/or the greatest common successor in O(root n + k log n)time. (Unless stated otherwise, all logarithms are to the base 2.) The preprocessing time is O(n(2)). Focusing on the first operation, representing the building-box for all the others, we derive an overall O(n root n)-space x time bound which beats the order n(2) bottleneck representing the present complexity for this problem. Moreover, we will show that the complexity bounds for the first three operations are optimal with respect to the worst case. Additionally, a stronger result can be derived. In particular, it is possible to represent a lattice in space O(n root t), where t is the minimum number of disjoint chains which partition the element set.

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

lattices
reachability
least common ancestors
graph decomposition


a vlsi fsm design system This paper describes a fully automated finite-state machine (FSM) synthesis system. The FSM is realized as a PLA. This synthesizer accepts a high-level description of the FSM and generates a mask level layout. Several simulation models are produced at different levels of abstraction; these models can be integrated with other modules on the chip to aid in the debugging of the overall VLSI chip design. Valuable information on speed, area, and testability of the PLA can be obtained through a collection of audit programs. This system has been used to design complex controllers for many VLSI chips at AT & T Bell Laboratories. Although a PLA implementation is assumed, the system can be extended to synthesize a random logic implementation of the FSM.

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

simulation testability design implementation layout audit logic synthesis paper debugging

program
systems
collect
module
complexity
model
laboratory
randomization
informal
automation
finite state machine
control
integrability


Power-aware broadcasting and activity scheduling in ad hoc wireless networks using connected dominating sets In ad hoc mobile wireless networks, owing to host mobility, broadcasting is expected to be more frequently used to find a route to a particular host, to page a host, and to alarm all hosts. A straightforward broadcasting by flooding is usually very costly and will result in substantial redundancy and more energy consumption. Power consumption is an important issue since most mobile hosts operate on battery. Broadcasting based on a connected dominating set is a promising approach, where only nodes in the dominating set need to relay the broadcast packet. A set is dominating if all the nodes in the system are either in the set or are neighbors of nodes in the set. Wu and Li proposed a simple and efficient distributed algorithm for calculating connected dominating set in ad hoc wireless networks, where connections of nodes are determined by their geographical distances. In general, nodes in the connected dominating set consume more energy to handle various bypass traffic than nodes outside the set. To prolong the life span of each node and, hence, the network by balancing the energy consumption in the system, nodes should be alternately chosen to form a connected dominating set. Activity scheduling deals with the way of rotating the role of each node among a set of given operation modes (e.g. dominating nodes versus dominated nodes). In this paper, we propose to apply the notion of power-aware connected dominating set to broadcasting and activity scheduling. The effectiveness of the proposed method in prolonging the life span of the network is confirmed through simulation. Copyright (C) 2003 John Wiley Sons, Ltd.

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

activity scheduling
ad hoc wireless networks

broadcasting dominating sets
energy level
routing simulation


Aggregation of Malmquist productivity indexes In this paper we extend the work of [Fre and Zelenyuk , 2003. On aggregate farrell efficiency scores. European Journal of Operational Research 146(3) 615620] to find a theoretically justified method of aggregating Malmquist Productivity Indexes over individual decision making units (firms, countries, etc.) into a group Malmquist Productivity Index. We also consider the aggregation of decomposed parts of the Malmquist Productivity Index to obtain a decomposition of the Malmquist Productivity Index for a particular group.

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


Relative contributions of local cell and passing fiber activation and silencing to changes in thalamic fidelity during deep brain stimulation and lesioning: a computational modeling study Deep brain stimulation (DBS) and lesioning are two surgical techniques used in the treatment of advanced Parkinsons disease (PD) in patients whose symptoms are not well controlled by drugs, or who experience dyskinesias as a side effect of medications. Although these treatments have been widely practiced, the mechanisms behind DBS and lesioning are still not well understood. The subthalamic nucleus (STN) and globus pallidus pars interna (GPi) are two common targets for both DBS and lesioning. Previous studies have indicated that DBS not only affects local cells within the target, but also passing axons within neighboring regions. Using a computational model of the basal ganglia-thalamic network, we studied the relative contributions of activation and silencing of local cells (LCs) and fibers of passage (FOPs) to changes in the accuracy of information transmission through the thalamus (thalamic fidelity), which is correlated with the effectiveness of DBS. Activation of both LCs and FOPs during STN and GPi-DBS were beneficial to the outcome of stimulation. During STN and GPi lesioning, effects of silencing LCs and FOPs were different between the two types of lesioning. For STN lesioning, silencing GPi FOPs mainly contributed to its effectiveness, while silencing only STN LCs did not improve thalamic fidelity. In contrast, silencing both GPi LCs and GPe FOPs during GPi lesioning contributed to improvements in thalamic fidelity. Thus, two distinct mechanisms produced comparable improvements in thalamic function: driving the output of the basal ganglia to produce tonic inhibition and silencing the output of the basal ganglia to produce tonic disinhibition. These results show the importance of considering effects of activating or silencing fibers passing close to the nucleus when deciding upon a target location for DBS or lesioning.

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

deep brain stimulation
dbs
lesioning
computational model
basal ganglia
thalamic fidelity
local cells
fibers of passage
activation
silencing
thalamus
subthalamic nucleus
stn
globus pallidus
gpi


Learning sparse gradients for variable selection and dimension reduction Variable selection and dimension reduction are two commonly adopted approaches for high-dimensional data analysis, but have traditionally been treated separately. Here we propose an integrated approach, called sparse gradient learning (SGL), for variable selection and dimension reduction via learning the gradients of the prediction function directly from samples. By imposing a sparsity constraint on the gradients, variable selection is achieved by selecting variables corresponding to non-zero partial derivatives, and effective dimensions are extracted based on the eigenvectors of the derived sparse empirical gradient covariance matrix. An error analysis is given for the convergence of the estimated gradients to the true ones in both the Euclidean and the manifold setting. We also develop an efficient forward-backward splitting algorithm to solve the SGL problem, making the framework practically scalable for medium or large datasets. The utility of SGL for variable selection and feature extraction is explicitly given and illustrated on artificial data as well as real-world examples. The main advantages of our method include variable selection for both linear and nonlinear predictions, effective dimension reduction with sparse loadings, and an efficient algorithm for large p, small n problems.

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

gradient learning
variable selection
effective dimension reduction


Simulating two-dimensional thermal channel flows by means of a lattice Boltzmann method with new boundary conditions Thermal boundary conditions for a doubled-populations BGK model are introduced and numerically demonstrated. The unknown thermal distribution functions at the boundary are assumed to be equilibrium distribution functions, with a counter-slip internal energy density which is determined consistently with Dirichlet and/or Neumann boundary constraints. The hydrodynamic boundary conditions are adapted to situations of engineering interest, and viscous heating effects are taken in account. The method is used to simulate channel flows; numerical results and theoretical solutions are found in satisfactory agreement for both hydrodynamic and thermal fields.

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

boundary conditions
viscous heating
channel flows

lattice boltzmann thermal model
doubled-populations bgk
heat transfer


Interruptions in the wild: Development of a sociotechnical systems model of interruptions in the emergency department through a systematic review A review and synthesis of the literature on interruptions in the ED was conducted. Gaps were identified in conceptualizing sociotechnical system factors of interruptions. Although interruption outcomes were noted, few were measured. A sociotechnical model of interruptions in complex settings is presented.

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


Camera calibration from video of a walking human A self-calibration method to estimate a camera's intrinsic and extrinsic parameters from vertical line segments of the same height is presented. An algorithm to obtain the needed line segments by detecting the head and feet positions of a walking human in his leg-crossing phases is described. Experimental results show that the method is accurate and robust with respect to various viewing angles and subjects.

B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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-calibration
vanishing point
vanishing line
human tracking


Parallel alternatives for evolutionary multi-objective optimization in unsupervised feature selection Multiobjective unsupervised feature selection with many decision variables is tackled. EEG signals for BrainComputer Interface (BCI) applications are used as benchmarks. Cooperative evolutionary algorithms for multiobjective optimization are given. Parallel implementations obtain quality results in terms of hypervolume and speedup. Superlinear speedups are justified by adjusting models to experimental results.

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

high-dimensional data
multi-objective clustering
parallel evolutionary algorithms
speedup models
unsupervised classification


Discovery and Verification of Neighbor Positions in Mobile Ad Hoc Networks A growing number of ad hoc networking protocols and location-aware services require that mobile nodes learn the position of their neighbors. However, such a process can be easily abused or disrupted by adversarial nodes. In absence of a priori trusted nodes, the discovery and verification of neighbor positions presents challenges that have been scarcely investigated in the literature. In this paper, we address this open issue by proposing a fully distributed cooperative solution that is robust against independent and colluding adversaries, and can be impaired only by an overwhelming presence of adversaries. Results show that our protocol can thwart more than 99 percent of the attacks under the best possible conditions for the adversaries, with minimal false positive rates.

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

neighbor position verification
vehicular networks


Modular Development of Product Service Systems Since the early 1990s, the driver in our economy has been changing from production of material goods to product-service offers based on knowledge and information. More and more researchers, institutes, and programs paid attention to product service systems (PSS) in the last decade because PSS integrates tangible artifact and intangible service to achieve sustainable, improve enterprise competitiveness, and meet customer needs better. In order to respond to the industrial trend towards PSS and guide enterprises to develop PSS, this article aims to propose a framework of modular development for PSS. After a brief review on PSS development, six dimensions of modular product-service were introduced which are the basis of modular development. The process of modular development was proposed which are divided into three parts by order: functional, product, and service modularizations. Functional modularization realizes the planning of product-service family and the design of interface dimension and collaboration dimension. Product modularization realizes the product dimension and production dimension. Service modularization realizes the service dimension and process dimension. Finally, a case study on PSS development was proposed according to the method of modular development.

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

product service systems
modular development
pss development


Stability of elliptic optimal control problems We consider optimal control problems governed by elliptic equations depending on parameters and give sufficient conditions for the continuous dependence of the solutions on the parameters. The techniques are based on variational methods. (C) 2001 Elsevier Science Ltd. All rights reserved.

B 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

elliptic systems
dependence on parameters


Density estimation via exponential model selection We address the problem of estimating some unknown density on a bounded interval using some exponential models of piecewise polynomials. We consider a finite collection of such models based on a family of partitions. And we study the maximum-likelihood estimator built on a data-driven selected model among this collection. In doing so, we validate Akaike's criterion if the partitions that we consider are regular and we modify it if the partitions are irregular. We deduce the rate of convergence of the squared Hellinger risk of our estimator in the regular case when the logarithm of the density belongs to some Besov space.

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

adaptive density estimation
akaike's information criterion
exponential families
kullback-leibler information
penalization


Linear Time Algorithms for Generalizations of the Longest Common Substring Problem In its simplest form, the longest common substring problem is to find a longest substring common to two or multiple strings. Using (generalized) suffix trees, this problem can be solved in linear time and space. A first generalization is the k -common substring problem: Given m strings of total length n, for all k with 2 <= k <= m simultaneously find a longest substring common to at least k of the strings. It is known that the k-common substring problem can also be solved in O(n) time (Hui in Proc. 3rd Annual Symposium on Combinatorial Pattern Matching, volume 644 of Lecture Notes in Computer Science, pp. 230-243, Springer, Berlin, 1992). A further generalization is the k -common repeated substring problem: Given m strings T ((1)),T ((2)),......T ((m)) of total length n and m positive integers x (1),.........,x (m) , for all k with 1 <= k <= m simultaneously find a longest string omega for which there are at least k strings T((i1)), T((i2)),......, T((ik)) (1 <= i(1) < i(2) < ....... < i(k) <= m) such that omega occurs at least x(ij) times in T((ij)) for each j with 1 <= j <= k. (For x (1)= ....=x (m) =1, we have the k-common substring problem.) In this paper, we present the first O(n) time algorithm for the k-common repeated substring problem. Our solution is based on a new linear time algorithm for the k-common substring problem.

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

suffix arrays
longest common repeat
string mining
repeat analysis


Algorithms for generating maximum weight independent sets in circle graphs, circular-arc overlap graphs, and spider graphs In this paper we propose an algorithm for generating maximum weight independent sets in a circle graph, that is, for putting out all maximum weight independent sets one by one without duplication. The time complexity is O(n(3) + beta), where n is the number of vertices, beta output size, i.e., the sum of the cardinalities of the output sets. It is shown that the same approach can be applied for spider graphs and for circuiar-arc overlap graphs.

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

independent set
generation algorithm
intersection graph
interval graph
overlap graph
spider graph
circular-arc overlap graph


First specifications of a telegeomonitoring system for the transportation of hazardous materials The present work gives general specifications for a monitoring system for the transportation of hazardous materials. The initial structure of the spatial decision support system integrates a range of databases on an interoperable environment. The data integration task illustrates the complex nature of the hazardous materials monitoring system. Three important components of the project, strongly linked to the spatial information system technology, are: (1) operators of graph traversal that is schematized by an object software component; (2) operators of communications proposing the basics of communication between trucks using a global positioning system (GPS) and the supervision system; and (3) the opening of services put at the disposal of the various professional users: public and private operators, etc. The advent of Internet technology democratizes communication and accesses possibilities to services given by the monitoring system. However, for professional utilization an adequate technical infrastructure is proposed. The dynamic knowledge integration in the system of supervision of hazardous materials transportation ensures that spatio-temporal data, real-time constraints, and history of events are taken into account.

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

telegeomonitoring system
transportation
hazardous materials


Queueing model based resource optimization for multimedia cloud We optimize cloud resources considering both QoS requirement and resource cost. We propose queueing model to characterize service process in multimedia cloud. We study resource allocation problems in three different scenarios. We minimize the response time and minimize the resource cost in each scenario.

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

multimedia cloud
resource optimization
queueing model
response time
resource cost

quality of service (qos)
convex optimization
priority service


a locality-preserving cache-oblivious dynamic dictionary This paper presents a simple dictionary structure designed for a hierarchical memory. The proposed data structure is cache oblivious and locality preserving. A cache-oblivious data structure has memory performance optimized for all levels of the memory hierarchy even though it has no memory-hierarchy-specific parameterization. A locality-preserving dictionary maintains elements of similar key values stored close together for fast access to ranges of data with consecutive keys.The data structure presented here is a simplification of the cache-oblivious B-tree of Bender, Demaine, and Farach-Colton. Like the cache-oblivious B-tree, this structure supports search operations using only O (log B N ) block operations at a level of the memory hierarchy with block size B. Insertion and deletion operations use O (log B N + log 2 N/B ) amortized block transfers. Finally, the data structure returns all k data items in a given search range using O (log B N + k/B ) block operations.This data structure was implemented and its performance was evaluated on a simulated memory hierarchy. This paper presents the results of this simulation for various combinations of block and memory sizes.

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

cache use simplification structure simulation values size dynamic performance parameterization data access paper search locality

tree
hierarchic
dictionaries
data structures
operability
memorialized
memory hierarchies
blocking


Sexual self-presentation on social network sites: Who does it and how is it perceived? Online sexual self-presentation is highly influenced by peer norms. Girls who present themselves in sexual ways are evaluated more negatively by other girls but more positively by boys. Boys who present themselves in sexual ways are evaluated more positively by girls but not by boys.

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

sexual self-presentation
need for popularity


trends in high performance graphic systems(panel session) Accompanying the rapid development of integrated circuit fabrication technology has been a parallel, but slower, development of IC design techniques and systems. Recent approaches to IC design enable individual designers to consider developing their own VLSI circuits. Such capability may open the door to a more varied set of system designs than could previously be considered in most design environments. The panel members are all currently designing graphic systems oriented towards VLSI implementation. Each will give a short presentation describing one of their system designs. Following these presentations, three members of the previous session (Forest Baskett, Andreas Bechtolsheim, and Fred Parke) will discuss common issues, problems, and future prospects.

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

design techniques
systems
parallel
design
implementation
future
circuits

present
design environment
technologies
developer
high-performance
graphics
integrability


Hardware Designs for Decimal Floating-Point Addition and Related Operations Decimal arithmetic is often used in commercial, financial, and Internet-based applications. Due to the growing importance of decimal floating-point (DFP) arithmetic, the IEEE 754-2008 Standard for Floating-Point Arithmetic (IEEE 754-2008) includes specifications for DFP arithmetic. IBM recently announced adding DFP instructions to their POWER6, z9, and z10 microprocessor architectures. As processor support for DFP arithmetic emerges, it is important to investigate efficient arithmetic algorithms and hardware designs for common DFP arithmetic operations. This paper gives an overview of DFP arithmetic in IEEE 754-2008 and discusses previous research on decimal fixed-point and floating-point addition. It also presents novel designs for a DFP adder and a DFP multifunction unit (DFP MFU) that comply with IEEE 754-2008. To reduce their delay, the DFP adder and MFU use decimal injection-based rounding, a new form of decimal operand alignment, and a fast flag-based method for rounding and overflow detection. Synthesis results indicate that the proposed DFP adder is roughly 21 percent faster and 1.6 percent smaller than a previous DFP adder design, when implemented in the same technology. Compared to the DFP adder, the DFP MFU provides six additional operations, yet only has 2.8 percent more delay and 9.7 percent more area. A pipelined version of the DFP MFU has a latency of six cycles, a throughput of one result per cycle, an estimated critical path delay of 12.9 fanout-of-four (FO4) inverter delays, and an estimated area of 45,681 NAND2 equivalent gates.

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

floating-point
computer arithmetic
subtraction
logic design


A block-based layer building approach for the 2D guillotine strip packing problem We apply three successful ideas for the 2D strip packing with guillotine-cut. We pack a block of rectangles instead of a single rectangle in each step. We divide the strip into horizontal layers and pack layer by layer. We unload and repack the last portion of a solution repeated to improve it. We outperform all existing approaches on standard benchmark instances.

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

cutting
guillotine-cut
best-fit heuristic
layer-building


Joint Spatial Division and Multiplexing-The Large-Scale Array Regime We propose joint spatial division and multiplexing (JSDM), an approach to multiuser MIMO downlink that exploits the structure of the correlation of the channel vectors in order to allow for a large number of antennas at the base station while requiring reduced-dimensional channel state information at the transmitter (CSIT). JSDM achieves significant savings both in the downlink training and in the CSIT uplink feedback, thus making the use of large antenna arrays at the base station potentially suitable also for frequency division duplexing (FDD) systems, for which uplink/downlink channel reciprocity cannot be exploited. In the proposed scheme, the multiuser MIMO downlink precoder is obtained by concatenating a prebeamforming matrix, which depends only on the channel second-order statistics, with a classical multiuser precoder, based on the instantaneous knowledge of the resulting reduced dimensional "effective" channel matrix. We prove a simple condition under which JSDM incurs no loss of optimality with respect to the full CSIT case. For linear uniformly spaced arrays, we show that such condition is approached in the large number of antennas limit. For this case, we use Szego's asymptotic theory of Toeplitz matrices to show that a DFT-based prebeamforming matrix is near-optimal, requiring only coarse information about the users angles of arrival and angular spread. Finally, we extend these ideas to the case of a 2-D base station antenna array, with 3-D beamforming, including multiple beams in the elevation angle direction. We provide guidelines for the prebeamforming optimization and calculate the system spectral efficiency under proportional fairness and max-min fairness criteria, showing extremely attractive performance. Our numerical results are obtained via asymptotic random matrix theory, avoiding lengthy Monte Carlo simulations and providing accurate results for realistic (finite) number of antennas and users.

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

3-d beamforming
antenna correlation
deterministic equivalents


Cache consistency by design In this paper we present a proof of the sequential consistency of the lazy caching protocol of Afek, Brown, and Merritt. The proof will follow a strategy of stepwise refinement, developing the distributed caching memory in five transformation steps from a specification of the serial memory, whilst preserving the sequential consistency in each step. The proof, in fact, presents a rationalized design of the distributed caching memory. We will carry out our proof using a simple process-algebraic formalism for the specification of the various design stages. We will not follow a strictly algebraic exposition, however. At some points the correctness will be shown using direct semantic arguments, and we will also employ higher-order constructs like action transducers to relate behaviours. The distribution of the design/proof over five transformation steps provides a good insight into the variations that could have been allowed at each point of the design while still maintaining sequential consistency. The design/proof in fact establishes the correctness of a whole family of related memory architectures. The factorization in smaller steps also allows for a closer analysis of the fairness assumptions about the distributed memory.

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

formal design
caching protocols
reactive systems
process algebra
correctness preserving
transformations


conflict estimation of abstract plans for multiagent systems In hierarchical planning, selecting a plan at an abstract level affects planning performance because an abstract plan restricts the scope of primitive plans. However, if all primitive plans under the selected abstract plan have difficult-to-resolve conflicts with the plans of other agents, the final plan after conflict resolution will be inefficient or of low quality. In this paper, we propose a conflict estimation method to generate quality plans efficiently for multiagent systems by appropriately selecting abstract plans in hierarchical planning. This method enables agents to learn which abstract plans are less likely to cause conflicts or which conflicts will be easy to resolve.

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


Single machine due date assignment scheduling problem with customer service level in fuzzy environment ? Due date assignment scheduling problems with deterministic and stochastic parameters have been studied extensively in recent years. In this paper, we consider a single machine due date assignment scheduling problem with uncertain processing times and general precedence constraint among the jobs. The processing times of the jobs are assumed to be fuzzy numbers. We first propose an optimal polynomial time algorithm for the problem without precedence constraints among jobs. Then, we show that if general precedence constraint is involved, the problem is NP-hard. Finally, we show that if the precedence constraint is a tree or a collection of trees, the problem is still polynomially solvable.

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

due date assignment
customer service level

fuzzy scheduling
earliness-tardiness costs
possibilistic theory


On S-homogeneity property of seminormed fuzzy integral: An answer to an open problem We give ananswer to Problem 9.3 stated by Mesiar and Stup?anov [8]. We show that the class of semicopulas solving this problem contains any associative semicopula S such that for each a ? [0, 1] the function x ? S(a, x) is continuous and increasing on a countable number of intervals.

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

generalized sugeno integral
fuzzy integrals
seminorm
capacity
monotone measure


Precoloring extension on unit interval graphs ? In the precoloring extension problem a graph is given with some of the vertices having preassigned colors and it has to be decided whether this coloring can be extended to a proper k-coloring of the graph. Answering an open question of Hujter and Tuza [Precoloring extension. III. Classes of perfect graphs, Combin. Probab. Comput. 5 (1) (1996) 3556], we show that the precoloring extension problem is NP-complete on unit interval graphs.

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

precoloring extension precoloring extension precoloring extension precoloring extension

unit interval graphs unit interval graphs unit interval graphs unit interval graphs

np-completeness np - completeness np-completeness np - completeness np-completeness np - completeness np - completeness


A Hyperlink and Semantic Network Analysis of the Triple Helix (University-Government-Industry): The Interorganizational Communication Structure of Nanotechnology This study investigates the interorganizational communication structures of the academic, private, and public sectors of nanotechnology in cyberspace. Few studies have examined systematically the ways these three major sectors contribute to the social construction of nanotechnology. The current study examines hyperlink and semantic networks of nanotechnology websites. Results show that academic websites revealed specific aspects of nanotechnology such as the uses and scales (units) of nanotechnology. However, the business sector exhibited a salient clustering of words regarding the developers and possible applications of nanotechnology. In hyperlink networks, the industry website nanobot.blogspot.com demonstrated high centrality. There were transitive and cyclic linkages among the 3 sectors. Findings offer important implications for the social construction of nanotechnology.

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

nanotechnology
semantic network
triple helix


an interoperability service framework for high-resolution image applications This poster presents a prototype architecture and potential use-cases for a standards-based service framework to simplify development of high-resolution image viewing clients.

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

oai-ore
digital libraries
json
digital imaging
openurl
standards
jpeg 2000


Identification of dynamic stiffness matrices of elastomeric joints using direct and inverse methods New experiments are designed to permit direct comparison between direct and inverse identification methods of the dynamic stiffness matrices of elastomeric joints, including non-diagonal terms. The joints are constructed with combinations of inclined elastomeric cylinders to control non-diagonal terms in the stiffness matrix. The inverse experiment consists of an elastic metal beam end-supported by elastomeric joints coupling the in-plane transverse and longitudinal beam motion. A prior method is extended to identify the joint dynamic stiffness matrices of dimension 3 from limited modal measurements of the beam. The dynamic stiffness and loss factors of the elastomeric cylinders are directly measured in a commercial elastomer test machine in shear, compression, and inclined configurations and a coordinate transformation is used to estimate the kinematic non-diagonal stiffness terms. Agreement is found for both dynamic stiffness and loss factors between the direct and inverse methods at small displacements. Further, the identified joint properties are employed in a model that successfully predicts the modal parameters and accelerance spectra of the inverse experiment. This article provides valuable insight on the difficulties encountered when comparing system and elastomeric component test results.

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

joint identification
experimental dynamics
stiffness coupling
elastomer properties
beam structures


Using Basic Image Features for Texture Classification Representing texture images statistically as histograms over a discrete vocabulary of local features has proven widely effective for texture classification tasks. Images are described locally by vectors of, for example, responses to some filter bank; and a visual vocabulary is defined as a partition of this descriptor-response space, typically based on clustering. In this paper, we investigate the performance of an approach which represents textures as histograms over a visual vocabulary which is defined geometrically, based on the Basic Image Features of Griffin and Lillholm (Proc. SPIE 6492(09):1-11, 2007), rather than by clustering. BIFs provide a natural mathematical quantisation of a filter-response space into qualitatively distinct types of local image structure. We also extend our approach to deal with intra-class variations in scale. Our algorithm is simple: there is no need for a pre-training step to learn a visual dictionary, as in methods based on clustering, and no tuning of parameters is required to deal with different datasets. We have tested our implementation on three popular and challenging texture datasets and find that it produces consistently good classification results on each, including what we believe to be the best reported for the KTH-TIPS and equal best reported for the UIUCTex databases.

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

texture classification
basic image features


Influence of process parameters on the deep drawing of stainless steel Optimization of process parameters in sheet metal forming is an important task to reduce manufacturing cost. To determine the optimum values of the process parameters, it is essential to find their influence on the deformation behaviour of the sheet metal. The significance of three important process parameters namely, die radius, blank holder force and friction coefficient on the deep-drawing characteristics of a stainless steel axi-symmetric cup was determined. Finite element method combined with Taguchi technique form a refined predictive tool to determine the influence of forming process parameters. The Taguchi method was employed to identify the relative influence of each process parameter considered in this study. A reduced set of finite element simulations were carried out as per the Taguchi orthogonal array. Based on the predicted thickness distribution of the deep drawn circular cup and analysis of variance test, it is evident that die radius has the greatest influence on the deep drawing of stainless steel blank sheet followed by the blank holder force and the friction coefficient. Further, it is shown that a blank holder force application and local lubrication scheme improved the quality of the formed part.

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

deep drawing
process parameters
stainless steel
taguchi technique


Sampling methods for summarizing unordered vehicle-to-vehicle data streams In the vehicle-to-vehicle (V2V) communication environment, vehicles interchange traffic data with each other. Because of the unbounded size of traffic data streams, sampling is used for summarization of traffic data, instead of storing the original data directly, for estimating traffic characteristics such as speed in the next step. All existing sampling methods assume that data arrivals are in the increasing timestamp order. However, this assumption may not be true in the V2V environment due to multiple data sources, transmission delays and different ways of dissemination. This disordered issue is explored in two ways in this paper. First, the traditional sampling methods for ordered streams are extended to be compatible with the disorder, especially the Unordered Extension of Exponentially Biased Reservoir Sampling (UEEBRS). Second, we propose a novel method, called the polynomially biased reservoir sampling (PBRS), to summarize unordered traffic data streams. Two measurements, the relative bias of speed and the cover rate of information obtained from the constructed summarizations, are used to assess performance of the extended methods and the novel way of comparing them with the classical methods. Preliminary simulation results show the proposed methods (UEEBRS and PBRS) reduce the relative bias of speed by about 10% with respect to the best reported result, while their cover rates of information are comparable at least to the others and are sufficiently high to support real-world applications.

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

vehicle-to-vehicle environment
unordered data stream
biased sampling
traffic state estimation


High Discovery Proportion and Fault Tolerance of Grid Information Service Resource Information Service has been one of the fundamental issues in the Grid computing environment. A resource information mechanism should efficiently manipulate the registering, discovering (querying), updating, etc. of grid resources. Various approaches about resource discovery have been suggested, which are either centralized or hierarchical. They operate inefficiently as the scale of grid systems rapidly increases. In this paper, we propose a distributed GIS system (QFIS) that is based on our Legion model and deploys a number of registry servers at the service region. With a small quorum size root N and the symmetric property, the Leg-Ring scheme can be extended to a fault tolerant and load balanced GIS algorithm. Due to the characteristics of our Legion structure, the user could obtain 100 percent of resource information satisfying the query constraints without the need to search all GIS servers, even if some of them crashed. In addition, we have completed the optimality proof of Legion, which indicates the minimal quorum size in our scheme. Moreover, the cost analysis evaluates the performances of QFIS model and typical hierarchical (HRIS) model and shows that QFIS performance is between the performances of H = 3 (tree height) and H = 4 of HRIS. Finally, the simulation analysis also illustrates that our proposed QFIS can work better than HRIS and possess fault tolerant capability.

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


Two-stage discrete choice models for scanner panel data: An assessment of process and assumptions Discrete choice models such as the multinomial logit assume that consumers choose from the full set of alternatives available to them. However, because (i) consumers may not be able to recall or recognize available brands, (ii) consumers may not have the cognitive capacity or mental energy to process information pertaining to all available brands, or (iii) careful consideration of all available brands might be suboptimal from an economic standpoint given the cost of information search, consumers tend to make choices from a relatively small subset of the available brands. This study assesses the process assumptions of existing two-stage models for scanner panel data and their consistency with the actual processes believed to be used by consumers in forming choice sets. After reviewing what is known from two-stage models in scanner data applications, we highlight issues in need of research.

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


Formal neural network specification and its implications on standardization1 This paper introduces a formal framework for describing and specifying neural networks and discusses several important issues with implications for neural network standardization. In particular, a neural network definition and two tools for graphical description and formal specification are introduced. Issues such as the theoretical impossibility of canonical description, or the need for complete specification (including global algorithms) are discussed. Several examples, making use of the developed tools, illustrate these discussions. In summary, this paper aims at contributing to the important endeavour of neural network standardization both practically and theoretically.

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

artificial neural networks
formal description
neural network paradigms
comparison


design of power conversion system for fuel cell scooter application In this paper, the fuel cell scooter drive system is designed. In case that the separated two input sources are adopted, the current sharing control algorithm is proposed in order to control the current sharing of both converters. And the regulated output voltage of dc-dc converter is applied to dc chopper stage. The dc motor is controlled using the switching behavior of dc chopper according to speed variation.

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


Application-level causally ordered broadcast for large-scale group communication Gossip-based reliable broadcast protocols with reasonably weak reliability properties scale well to large groups and degrade system performance gracefully even if node failure or message loss rates increase compared with traditional protocols. However, although many distributed applications require highly steady performance only by allowing causality to be used asynchronously, there is no existing gossip-based protocol offering causally ordered delivery property more lightweight than totally ordered delivery one. This paper presents an application-level broadcast algorithm to guarantee causally-ordered delivery semantics based on peer to peer interaction models for scalability, reasonable reliability and stable throughput. Processes propagate each message with a vector time stamp much like the spread of rumor in society for a fixed number of rounds. Upon receipt of these messages, correct processes immediately deliver the corresponding messages to the application layers in a causal order. Simulation results show that the proposed algorithm outperforms the existing ones in terms of delivery throughput.

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

group communication
scalability
reliability


ic design challenges for ambient intelligence The vision of Ambient Intelligence opens a world of unprecedente experiences: the interaction of people with electronic devices is changed as contextual awareness, natural interfaces and ubiquitous availability of information are realized. We analyze the consequences of the ambient intelligence vision for electronic devices by mapping the involved technologies on a power-information graph. Based on the differences in power consumption, three types of devices are introduce: the autonomous or microWatt-node, the personal or milliWatt-node and the static or Watt-node. Ambient intelligent functions are realized by a network of these devices with the computing, communication and interface electronics realized in Silicon IC technologies.Three case studies highlight the IC design challenges involved, and show the variety of problems that have to be solved.

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

communication
network
intelligence
design
interfaces
interaction
availability
case studies
technologies
power consumption
types
awareness
graph
ubiquitous
vision
contextual

challenge
personality
ambient intelligence
computation
map
experience
informal
autonomic
device
power


A highly topology adaptable ad hoc routing protocol with complementary preemptive link breaking avoidance and path shortening mechanisms Ad-hoc on-demand distance vector routing (AODV) is a well-known routing protocol for mobile ad hoc networks. The original AODV protocol works in a semi-dynamic fashion, by establishing a route on demand and using that route until it breaks. However, to suit the changing network topology of ad hoc networks, more aggressive and adaptable routing strategies are required. A number of researches have proposed improving AODV performance by locally repairing broken links, predicting and replacing potentially vulnerable links, or shortening a link through removing redundant nodes from the transmission path. Although local repair may relieve some problems, it usually results in longer paths and thus a considerable performance drop in heavy traffic conditions. There are also issues regarding packet loss and communication delay due to route rebuilding once the link is broken. Predicting and replacing potentially vulnerable links may require special hardware, additional tables to maintain, or other extra overhead. Finally, path shortening may result in shorter and more efficient routes, but there is no guarantee that the new paths will be robust. This paper proposes integrating preemptive link breaking avoidance and path shortening mechanisms into a modified AODV protocol. However, the difficult issue lies in determining the right timing to initiate the two independent mechanisms so that the two dynamically and complementarily operating mechanisms can work together to improve the routing performance. Through numerical analysis and simulation, we have arranged a simple parameter setting for controlling the activation of each mechanism at the appropriate time. The proposed combination is a highly dynamic ad hoc routing protocol that is capable of adapting itself to the changing network topology and achieving extremely good performance in various routing performance metrics. Extensive simulations show that each of the two schemes alone improves AODV performance. More importantly, the integrated protocol performs even better in terms of data delivery rate, average delay time, and network overhead. To be more specific, in the best cases our protocol can reduce up to 82% in control overhead and 66% in delay time, while achieving 12% more in data delivery rate comparing to AODV.

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

dynamic routing
dynamic link breaking avoidance
dynamic path shortening


Data fusion in intelligent transportation systems: Progress and challenges - A survey In intelligent transportation systems (ITS), transportation infrastructure is complimented with information and communication technologies with the objectives of attaining improved passenger safety, reduced transportation time and fuel consumption and vehicle wear and tear. With the advent of modern communication and computational devices and inexpensive sensors it is possible to collect and process data from a number of sources. Data fusion (DF) is collection of techniques by which information from multiple sources are combined in order to reach a better inference. DF is an inevitable tool for ITS. This paper provides a survey of how DF is used in different areas of ITS. (C) 2010 Elsevier B.V. All rights reserved.

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

information fusion
advanced traveler information systems
global positioning systems
incident detection


Prototype selection based on sequential search In this paper, we propose and explore the use of the sequential search for solving the prototype selection problem since this kind of search has shown good performance for solving selection problems. We propose three prototype selection methods based on sequential search. The main goal of our methods is to reduce the training data without losing too much classification accuracy. Experiments and results are reported showing the effectiveness of the proposed methods and comparing their performance against other prototype selection methods.

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

quality training set
supervised classification


Two-dimensional metric tensor visualization using pseudo-meshes Riemannian metric tensors are used to control the adaptation of meshes for finite element and finite volume computations. To study the numerous metric construction and manipulation techniques, a new method has been developed to visualize two-dimensional metrics without interference from an adaptation algorithm. This method traces a network of orthogonal tensor lines, tangent to the eigenvectors of the metric field, to form a pseudo-mesh visually close to a perfectly adapted mesh but without many of its constraints. Anisotropic metrics can be visualized directly using such pseudo-meshes but, for isotropic metrics, the eigensystem is degenerate and an anisotropic perturbation has to be used. This perturbation merely preserves directional information usually present during metric construction and is small enough, about 1% of the prescribed target element size, to be visually imperceptible. Both analytical and solution-based examples show the effectiveness and usefulness of the present method. As an example, pseudo-meshes are used to visualize the effect on metrics of Laplacian-like smoothing and gradation control techniques. Application to adaptive quadrilateral mesh generation is also discussed.

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

mesh adaptation
tensor line
hyperstreamline


Analytical diagonal elements of regularized meshless method for regular domains of 2D 2 D Dirichlet Laplace problems This note is to present a simple approach to derive the analytical formula of the diagonal elements of the interpolation matrix of the regularized meshless method (RMM) for regular domain problems, which is a very new boundary-type numerical discretization technique. In literature, these diagonal elements are mostly calculated numerically by the desingular technique, except for the circular domain problems. Our numerical experiments show that the analytical diagonal elements can improve the solution accuracy of the RMM for some regular domain problems, and the diagonal elements are critical to the solution accuracy of the RMM. Thus, a searching process is employed to find the optimal diagonal elements for RMM.

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

regularized meshless method
regular domain
analytical diagonal elements

desingularization technique
null fields equation


Interval neutrosophic sets and topology Purpose - In 2005, Smarandache generalized the Atanassov's intuitionistic fuzzy sets (IFSs) to neutrosophic sets (NS), and other researchers introduced the notion of interval neutrosophic set (INSs), which is an instance of NS, and studied various properties. The notion of neutrosophic topology on the non-standard interval is also due to Smarandache. The purpose of this paper is to study relations between INSs and topology. Design/methodology/approach - The paper investigates the possible relations between INSs and topology. Findings - Relations on INSs and neutrosophic topology. Research limitations/implications - Clearly, the paper is confined to IFSs and NSs. Practical implications - The main applications are in the mathematical field. Originality/value - The paper shows original results on fuzzy sets and topology.

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


Darwin's Legacy and the Study of Primate Visual Communication After Charles Darwin's The Expression of the Emotions in Man and Animals, published in 1872, we had to wait 60 years before the theme of animal expressions was picked up by another astute observer. In 1935, Nadezhda Ladygina-Kohts published a detailed comparison of the expressive behavior of a juvenile chimpanzee and of her own child. After Kohts, we had to wait until the 1960s for modern ethological analyses of primate facial and gestural communication. Again, the focus was on the chimpanzee, but ethograms on other primates appeared as well. Our understanding of the range of expressions in other primates is at present far more advanced than that in Darwin's time. A strong social component has been added

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


Single machine earlinesstardiness scheduling with resource-dependent release dates This paper deals with the single machine earliness and tardiness scheduling problem with a common due date and resource-dependent release dates. It is assumed that the cost of resource consumption of a job is a non-increasing linear function of the job release date, and this function is common for all jobs. The objective is to find a schedule and job release dates that minimize the total resource consumption, and earliness and tardiness penalties. It is shown that the problem is NP-hard in the ordinary sense even if the due date is unrestricted (the number of jobs that can be scheduled before the due date is unrestricted). An exact dynamic programming (DP) algorithm for small and medium size problems is developed. A heuristic algorithm for large-scale problems is also proposed and the results of a computational comparison between heuristic and optimal solutions are discussed.

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

scheduling theory
heuristics
computational analysis


Emotions manage 2000 We give a brief of account of theoretical background together with our personal experience in an emotion governing software - Emotions Manager 2000. Operational capabilities of the program are analysed. Advantages and drawbacks are discussed.

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

cybernetics
data collection
counselling
computers


The Lagrangian View-Point Compared with the Eulerian One, in the Framework of Extended Thermodynamics The salient points of Extended Thermodynamics are here revised according to the Lagrangian view-point. The conservation laws of mass, momentum and energy, from the Lagrangian view-point, have already been treated in literature. Here a similar procedure is followed for all the balance laws of Extended Thermodynamics with an arbitrary number of moments. It is also shown how the Galilean Relativity Principle and some symmetry condition, which are present in the Eulerian view-point, can be translated in the Lagrangian view-point, where they are no more so self-evident.

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

balance laws and constitutive relations
continuum thermomechanics


Joint bandwidth allocation, element assignment and scheduling for wireless mesh networks with MIMO links With the unique features of spatial multiplexing and interference suppression, Multiple Input Multiple Output (MIMO) techniques have great potential in the improvement of network capacity over conventional antenna technologies. In order to exploit the benefit of simultaneous transmissions provided by MIMO, researchers have proposed a number of cross-layer optimizations and MAC layer designs to increase the throughput of wireless mesh or ad hoc networks, where the number of elements in the antenna arrays are preallocated or evenly assigned to the routers. In this paper, we argue that using the same number of elements in each antenna array in all routers is not a necessary condition for the improvement of system performance. Tills is because the requirement for the number of elements is quite different for each router. Especially at those critical routers that have huge aggregate traffic toward the gateway, more elements are needed not only for the traffic relay but also for the interference suppression.. Based oil this observation, we define the joint problem of bandwidth allocation, element assignment and scheduling to characterize the throughput benefits of cross-layer optimizations. We propose a Cost-Aware Element Assignment (CAEA) technique to minimize the total number of the antenna elements when still achieving the optimal bandwidth allocation. In addition, to verify the efficiency of the CAEA assignment, a heuristic Traffic-aware Stream-controlled Link Scheduling (TSLS) algorithm is proposed to provide a schedulable bandwidth allocation. We demonstrate through extensive simulations that our solutions (CAEA, TSLS) not only effectively save the total cost on antenna elements but also perform close to optimal on the average. (C) 2008 Elsevier B.V. All rights reserved.

O B I B I O B O B I I O B O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O 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 B I 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 B 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 B I O O O O O O O O O O O O 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 mesh networks
mimo
bandwidth allocation
element assignment
scheduling


Growth and characterisation of dilute antimonide nitride materials for long-wavelength applications The addition of small amounts of nitrogen to IIIV semiconductors leads to a large degree of band gap bowing, giving rise to band-gaps smaller than in the associated binary materials. The incorporation of active nitrogen has been previously demonstrated for InNxSb1?x (x?0.7%) and GaNxSb1?x (x?1.75%) material; however, the as-grown carrier concentrations precluded incorporation into a device structure. Here we report the reduction in the as-grown carrier concentration in InNSb by annealing, whilst retaining the active nitrogen content. FTIR absorption measurements show the first direct experimental evidence of narrowing of the InSb bandgap due to nitrogen incorporation. As an alternative route to defect reduction and device compatible material we report on the growth of Ga1?yInyNxSb1?x with 0?y?30% and x=1.60.2% and demonstrate near lattice matching of the material to GaSb.

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

dilute nitride
indium antimonide
gallium antimonide
infrared
mwir
lwir


Correlating the effects of flow and telepresence in virtual worlds: Enhancing our understanding of user behavior in game-based learning Recent research on online learning suggests that virtual worlds are becoming an important environment to observe the experience of flow. From these simulated spaces, researchers may gather a deeper understanding of cognition in the context of game-based learning. Csikszentmihalyi (1997) describes flow as a feeling of increased psychological immersion and energized focus, with outcomes that evoke disregard for external pressures and the loss of time consciousness, issuing in a sense of pleasure. Past studies suggest that flow is encountered in an array of activities and places, including those in virtual worlds. The authors posit that flow in virtual worlds, such as Second Life (SL), can be positively associated with degrees of the cognitive phenomenon of immersion and telepresence. Flow may also contribute to a better attitude and behavior during virtual game-based learning. This study tested three hypotheses related to flow and telepresence, using SL. Findings suggest that both flow and telepresence are experienced in SL and that there is a significant correlation between them. These findings shed light on the complex interrelationships and interactions that lead to flow experience in virtual gameplay and learning, while engendering hope that learners, who experience flow, may acquire an improved attitude of learning online.

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

flow
telepresence
virtual worlds
online learning


Effects of Deleting Mitochondrial Antioxidant Genes on Life Span Reactive oxygen species (ROS) damage biomolecules, accelerate aging, and shorten life span, whereas antioxidant enzymes mitigate these effects. Because mitochondria are a primary site of ROS generation and also a primary target of ROS attack, they have become a major focus area of aging studies. Here, we employed yeast genetics to identify mitochondrial antioxidant genes that are important for replicative life span. In our studies, it was found that among the known mitochondrial antioxidant genes (TTR1, CCD1, SOD1, GLO4, TRR2, TRX3, CCS1, SOD2, GRX5, PRX1), deletion of only three genes, SOD1 (Cu, Zn superoxide dismutase), SOD2 (Manganese-containing superoxide dismutase), and CCS1 (Copper chaperone), shortened the life span enormously. The life span decreased 40% for ?sod1 mutant, 72% for ?sod2 mutant, and 50% for ?ccs1 mutant. Deletion of the other genes had little or no effect on life span

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

aging
antioxidant genes
mitochondria
ros
ccs1


a multi-model power estimation engine for accuracy optimization RTL power macromodeling is a mature research topic with a variety of equation and table-based approaches. Despite its maturity, macromodeling is not yet widely accepted as an industrial de facto standard for power estimation at the RT level. Each approach has many variants depending upon the parameters chosen to capture power variation. Every macromodeling technique has some intrinsic limitation affecting either its performance or its accuracy. Therefore, alternative macromodeling methods can be envisaged as part of a power modeling toolkit from which the most suitable method for a given component should be automatically selected. Thispaper describes a new multi-model power estimation engine that selects the macromodeling technique leading to the least estimation error for a given system component depending on the properties of its input-vector stream. A proper selection function is built after component characterization and used during estimation. Experimental results show that our multi-model engine improves the robustness of power analysis with negligible usage overhead. Accuracy becomes 3 times better on average, as compared to conventional single-model estimators, while the overall maximum estimation error is divided by 8.

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


A chaotic maximum neural network for maximum clique problem In this paper, based on maximum neural network, we propose a new parallel algorithm that can escape from local minima and has powerful ability of searching the globally optimal or near-optimum solution for the maximum clique problem (MCP). In graph theory a clique is a completely connected subgraph and the MCP is to find a clique of maximum size of a graph. The MCP is a classic optimization problem in computer science and in graph theory with many real-world applications, and is also known to be NP-complete. Lee and Takefuji have presented a very powerful neural approach called maximum neural network for this NP-complete problem. The maximum neural model always guarantees a valid solution and greatly reduces the search space without a burden on the parameter-tuning. However, the model has a tendency to converge to the local minimum easily because it is based on the steepest descent method. By adding a negative self-feedback to the maximum neural network, we proposed a parallel algorithm that introduces richer and more flexible chaotic dynamics and can prevent the network from getting stuck at local minima. After the chaotic dynamics vanishes, the proposed algorithm is then fundamentally reined by the gradient descent dynamics and usually converges to a stable equilibrium point. The proposed algorithm has the advantages of both the maximum neural network and the chaotic neurodynamics. A large number of instances have been simulated to verify the proposed algorithm.

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

maximum clique problem
maximum neural network


Learning-enhanced differential evolution for numerical optimization Differential evolution (DE) is a simple and powerful population-based search algorithm, successfully used in various scientific and engineering fields. However, DE is not free from the problems of stagnation and premature convergence. Hence, designing more effective search strategies to enhance the performance of DE is one of the most salient and active topics. This paper proposes a new method, called learning-enhanced DE (LeDE) that promotes individuals to exchange information systematically. Distinct from the existing DE variants, LeDE adopts a novel learning strategy, namely clustering-based learning strategy (CLS). In CLS, there are two levels of learning strategies, intra-cluster learning strategy and inter-cluster learning strategy. They are adopted for exchanging information within the same cluster and between different clusters, respectively. Experimental studies over 23 benchmark functions show that LeDE significantly outperforms the conventional DE. Compared with other clustering-based DE algorithms, LeDE can obtain better solutions. In addition, LeDE is also shown to be significantly better than or at least comparable to several state-of-art DE variants as well as some other evolutionary algorithms.

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

differential evolution
learning strategy
numerical optimization