automatic recognition of vector and parallel operations in a higher level language A compiler for recognizing statements of a FORTRAN program which are suited for fast execution on a parallel or pipeline machine such as ILLIAC-IV, STAR or ASC is described. The technique employs interval analysis to provide flow information to the vector/parallel recognizer. Where profitable the compiler changes scalar variables to subscripted variables. The output of the compiler is an extension to FORTRAN which shows parallel and vector operations explicitly.

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

compiler interval recognition parallel analysis language pipeline flow

parallel computations
variability
flow analysis
vectorization
vector processing
operability
extensibility
informal
change


Eigenspace updating for non-stationary process and its application to face recognition In this paper, we introduce a novel approach to modeling non-stationary random processes. Given a set of training samples sequentially, we can iteratively update the eigenspace to manifest the current statistics provided by each new sample. The updated eigenspace is derived based more on recent samples and less on older samples, controlled by a number of decay parameters. Extensive study has been performed on how to choose these decay parameters. Other existing eigenspace updating algorithms can be regarded as special cases of our algorithm. We show the effectiveness of the proposed algorithm with both synthetic data and practical applications on face recognition. Significant improvements have been observed on face images with different variations, such as pose, expression and illumination variations. We expect the proposed algorithm to have other applications in active recognition and modeling as well.

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

principal component analysis
non-stationary process


A mixed EulerianLagrangian method for modelling metal extrusion processes A mixed EulerianLagrangian approach for the computational modelling of metal extrusion processes in complex three dimensional geometries is presented. The approach involves the representation of the workpiece as a pseudo-fluid, and requires the solution of non-Newtonian fluid flow equations in an Eulerian context, using a free-surface algorithm to track its extreme deformation during its extrusion. The solid mechanics equations associated with the tools are solved in a conventional Lagrangian context. Thermal interactions between the workpiece and tools are modelled and a fluidstructure interaction technique is employed to capture the effect of the fluid traction load imposed by the workpiece on the tools, and especially the subsequent adaption of the Eulerian mesh to account for the impact of die deformation. Two extrusion test cases are investigated and the results obtained show the potential of the model with regard to representing the physics of the process, the advantages of the model over a more loosely coupled approach, and the parallel scalability of the resulting software.

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

eulerian
lagrangian
fluidstructure interaction


Extreme points of a large 3D point set along multiple directions In reverse engineering CAD modeling, a facet model is usually constructed from a large point cloud data which are obtained from a surface scanning process. The number of points in the point cloud data may range from hundred thousands to several millions depending on the user-defined precision. As a result, the facet model becomes very large in terms of number of facets or vertices. The computational effort required to manipulate such a large set of data becomes enormous. This effort is significant even for some simple operations, e.g. rotating, scaling and translation. In this paper, an algorithm is proposed to determine the extreme points in a large 3D point set along multiple directions. This algorithm uses a cylindrical grid approximation technique to give both approximate solution and exact solution. This algorithm can be used to accelerate the computational process of some geometric problems on a large model, e.g., the minimum bounding box of a facet model [Comput Aid Des 20 (1988) 506; Comput Struct 79I (2001) 1433; Int J Comput Inform Sci 14 (1985) 183] and the fitness problem of a model into a bounded volume [Comput Aid Des 20 (1988) 506].

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

extreme points
cylindrical grid
bounding box
fitness


Communication models for a free-space optical cross-connect switch We design and analyze communication algorithms for an optical switch based on the electroholographic effect, that provides capabilities for configuration changes and a limited multicast. As configuration changes incur a high overhead, we suggest the use of a high-speed forwarding unit as part of the network interface. We develop broadcast algorithms that trade off the number of configuration changes and forwarding operations in order to achieve the minimal completion time. For general point-to-point communication, we use the limited multicast to create a spanning topology along which messages can be forwarded. This requires care to avoid collisions, but is still preferable to using configuration changes if the topology is rich enough but still has a low degree.

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

all-optical network
electroholographic switch
circuit switching
broadcast algorithm
collision avoidance


Comprehensive event based estimation of sensor node distribution strategies using classical flooding routing protocol in wireless sensor networks We derive a new investigation for the wireless sensor networks (WSNs) when the underlying sensor node distribution strategies have strong influence on event specific communication performance. In this paper, we inclusively evaluated eight sensor network distributions namely: normal, gamma, exponential, beta, generalized inverse Gaussian, poison, Cauchy and Weibull. We designed and illustrated our proposed model with these node distributions for data dissemination. Moreover, performance evaluation matrices like sense count, receive count and receive redundant count are also evaluated. Additionally, we emphasized over the routing protocol behavior for different distribution strategies in the deployed WSN framework. Finally, simulation analysis has been carried out to prove the validity of our proposal. However, routing protocol for WSNs seems intractable to the sensor node distribution strategies when varied from one to another in the scenario.

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

classical flooding
sense count
receive count
receive redundant count


Packet Delay Metrics for IEEE 802.11 Distributed Coordination Function In this paper, we introduce a comprehensive packet delay analysis for wireless networks based on IEEE 802.11 Distributed Coordination Function (DCF). We develop mathematical models that calculate a set of packet delay metrics, namely a) the average packet delay for successfully transmitted packets, b) the average packet delay of successfully transmitted packets experiencing a specific number of collisions, c) the average packet drop time, d) the delay jitter and e) the delay distribution by computing the probability of a packet to be successfully transmitted experiencing delay time lower than a given value. All the developed models are based on calculating stations delay time at the transmission slot(s) plus the average time that station defers at backoff slots before successful transmission. The mathematical models are simple, computationally fast and can be used to build admission control algorithms. Simulation results show that our proposed mathematical analysis is highly accurate.

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


Symbolic graphs: Linear solutions to connectivity related problems The importance of symbolic data structures such as Ordered Binary Decision Diagrams (OBDD) is rapidly growing in many areas of Computer Science where the large dimensions of the input models is a challenging feature: OBDD based graph representations allowed to define truly new standards in the achievable dimensions for the Model Checking verification technique. However, OBDD representations pose strict constraints in the algorithm design issue. For example, Depth-First Search (DFS) is not feasible in a symbolic framework and, consequently, many state-of-the-art DFS based algorithms (e.g., connectivity procedures) cannot be easily rearranged to work on symbolically represented graphs. We devise here a symbolic algorithmic strategy, based on the new notion of spine-set, that is general enough to be the engine of linear symbolic step algorithms for both strongly connected components and biconnected components. Our procedures improve on previously designed connectivity symbolic algorithms. Moreover, by an application to the so-called "bad cycle detection problem", our technique can be used to efficiently solve the emptiness problem for various kinds of omega-automata.

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

strongly connected components
biconnected components
ordered binary decision diagrams
model checking


Homology modeling and molecular dynamics simulation of N-myristoyltransferase from protozoan parasites: active site characterization and insights into rational inhibitor design Myristoyl-CoA:protein N-myristoyltransferase (NMT) is a cytosolic monomeric enzyme that catalyzes the transfer of the myristoyl group from myristoyl-CoA to the N-terminal glycine of a number of eukaryotic cellular and viral proteins. Recent experimental data suggest NMT from parasites could be a promising new target for the design of novel antiparasitic agents with new mode of action. However, the active site topology and inhibitor specificity of these enzymes remain unclear. In this study, three-dimensional models of NMT from Plasmodium falciparum (PfNMT), Leishmania major (LmNMT) and Trypanosoma brucei (TbNMT) were constructed on the basis of the crystal structures of fungal NMTs using homology modeling method. The models were further refined by energy minimization and molecular dynamics simulations. The active sites of PfNMT, LmNMT and TbNMT were characterized by multiple copy simultaneous search (MCSS). MCSS functional maps reveal that PfNMT, LmNMT and TbNMT share a similar active site topology, which is defined by two hydrophobic pockets, a hydrogen-bonding (HB) pocket, a negatively-charged HB pocket and a positively-charged HB pocket. Flexible docking approaches were then employed to dock known inhibitors into the active site of PfNMT. The binding mode, structure-activity relationships and selectivity of inhibitors were investigated in detail. From the results of molecular modeling, the active site architecture and certain key residues responsible for inhibitor binding were identified, which provided insights for the design of novel inhibitors of parasitic NMTs.

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

multiple copy simultaneous search
active sites

parasitic n-myristoyltransferase
three-dimensional structures
flexible molecular docking
ligand selectivity


automatic document metadata extraction using support vector machines Automatic metadata generation provides scalability and usability for digital libraries and their collections. Machine learning methods offer robust and adaptable automatic metadata extraction. We describe a Support Vector Machine classification-based method for metadata extraction from header part of research papers and show that it outperforms other machine learning methods on the same task. The method first classifies each line of the header into one or more of 15 classes. An iterative convergence procedure is then used to improve the line classification by using the predicted class labels of its neighbor lines in the previous round. Further metadata extraction is done by seeking the best chunk boundaries of each line. We found that discovery and use of the structural patterns of the data and domain based word clustering can improve the metadata extraction performance. An appropriate feature normalization also greatly improves the classification performance. Our metadata extraction method was originally designed to improve the metadata extraction quality of the digital libraries Citeseer [17] and EbizSearch[24]. We believe it can be generalized to other digital libraries.

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

metadata
task
quality
generation
use
usability
scalability
performance
digital libraries
normalization
robust
classification
convergence
research
method
support vector machine
extraction
data
machine learning
feature
class

collect general paper pattern label adapt structure discoveries documentation iter cluster


Integrating RFID with quality assurance system - Framework and applications A quality assurance system (QAS) is designed and used to inspect product quality, determine causes of abnormal by collecting, analyzing and testing data from the product line, and then determining how an improvement plan should be conducted. By utilizing radio frequency identification (RFID), a QAS may be able to detect, and even prevent, quality problems more effectively than the traditional quality assurance system. The proposed framework provides a structure for an RFID-based QAS that allows on-site staff to monitor complicated variations in production process by handling numerous possible abnormalities simultaneously. Two industry applications are provided to demonstrate using of the proposed framework. (C) 2009 Published by Elsevier Ltd.

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

quality assurance system
radio frequency identification
improvement plan


An application of case-based reasoning with machine learning for forensic autopsy We modeled the CBR technique of forensic autopsy report preparation. The CBR model was coupled with Nave Bayes learner for feature weight learning and also the outcome prediction. Feature weight learning improves the CBR system accuracy. The outcome prediction is improved with Nave Bayes prediction.

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

case-based reasoning
autopsy report system
decision-support system
feature-weight learning


an approach to teaching design patterns using musical composition We present an approach to teaching design patterns using a music composition project. The project is distinctive in that students are encouraged to discover and express their innate musical talents, and are exposed to some deep connections between programming and art. In addition to design patterns, the material provides opportunities for incorporating a surprisingly diverse range of topics---from data structures, grammars, parsing, to formal proofs.The approach has been used successfully in both introductory and advanced courses over a number of years.

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


Fuzzy SPC filter for a feed-forward control system for a three-phase oil field centrifuge In this work we describe a signal filter for a feed-forward controller based on the application of fuzzy logic, combined with statistical process control (SPC). The feed-forward controller is for a three-phase oil field centrifuge. The centrifuge system is used to separate meta-stable three-phase oil and water emulsions that are stabilized by solids. These emulsions are considered to be unusable wastes and must be disposed of in an environmentally acceptable manner. The centrifuge is capable of turning these wastes into clean saleable oil, water that can be reused in an operating process or re-injected into oil wells, and solids that can be disposed of in landfills. The feed-forward controller is used for feed disturbance rejection. It works in conjunction with, and is capable of over-riding the actions of, a feedback controller. The measured feed variables for the feed-forward controller each exhibit reasonably large random fluctuations. It is therefore quite important to use a signal filter that truly recognizes the difference between random noise and a "caused" event, in order to prevent over-riding a perfectly good correction from the feedback controller.

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

feed-forward control
statistical process control (spc)


The degree distribution of random k-trees A power law degree distribution is established for a graph evolution model based on the graph class of k-trees. This k-tree-based graph process can be viewed as an idealized model that captures some characteristics of the preferential attachment and copying mechanisms that existing evolving graph processes fail to model due to technical obstacles. The result also serves as a further cautionary note reinforcing the point of view that a power law degree distribution should not be regarded as the only important characteristic of a complex network, as has been previously argued [D. Achlioptas, A. Clauset, D. Kempe, C. Moore, On the bias of traceroute sampling, or power-law degree distribution in regular graphs, in: Proceedings of the 37th ACM Symposium on Theory of Computing, STOC'05, 2005, pp. 694-703; L Li, D. Alderson, J. Doyle, W. Willinger, Towards a theory of scale-free graphs: Definition, properties, and implications, Internet Mathematics 2 (4) (2005) 431-523: M. Mitzenmacher, The future of power law research, Internet Mathematics, 2 (4) (2005) 525-534]. (C) 2008 Elsevier B.V. All rights reserved.

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

evolving graph models
degree distributions
k-trees
complex networks
random graphs


Strong edge colouring of subcubic graphs ? A strong edge colouring of a graph G G is a proper edge colouring such that every path of length 3 uses three colours. In this paper, we prove that every subcubic graph with maximum average degree strictly less than 15 7 (resp. 27 11 , 13 5 , 36 13 ) can be strong edge coloured with six (resp. seven, eight, nine) colours.

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

subcubic graphs
maximum average degree
strong edge colouring


A locally stabilized immersed boundary method for the compressible NavierStokes equations A higher-order immersed boundary method for solving the compressible NavierStokes equations is presented. The distinguishing feature of this new immersed boundary method is that the coefficients of the irregular finite-difference stencils in the vicinity of the immersed boundary are optimized to obtain improved numerical stability. This basic idea was introduced in a previous publication by the authors for the advection step in the projection method used to solve the incompressible NavierStokes equations. This paper extends the original approach to the compressible NavierStokes equations considering flux vector splitting schemes and viscous wall boundary conditions at the immersed geometry. In addition to the stencil optimization procedure for the convective terms, this paper discusses other key aspects of the method, such as imposing flux boundary conditions at the immersed boundary and the discretization of the viscous flux in the vicinity of the boundary. Extensive linear stability investigations of the immersed scheme confirm that a linearly stable method is obtained. The method of manufactured solutions is used to validate the expected higher-order accuracy and to study the error convergence properties of this new method. Steady and unsteady, 2D and 3D canonical test cases are used for validation of the immersed boundary approach. Finally, the method is employed to simulate the laminar to turbulent transition process of a hypersonic Mach 6 boundary layer flow over a porous wall and subsonic boundary layer flow over a three-dimensional spherical roughness element.

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

higher-order finite-difference
numerical stability analysis
compressible flows


PREDICTION OF EFFECTIVE PERMEABILITY IN POROUS MEDIA BASED ON SPONTANEOUS IMBIBITION EFFECT Permeability is an important parameter for characterizing the transport properties (e. g. heat and mass transfer) of porous media. It is one of the crucial issues that the permeability of porous media is exactly and quickly decided in many fields such as reservoir engineering, groundwater engineering and composite material modeling. Spontaneous imbibition is a fundamental and ubiquitous natural phenomenon extensively existing in a variety of processes. In this paper, the relationships between the height and weight of imbibition versus the time are derived based on Darcy's law, and a simple method for predicting effective permeability of porous media using spontaneous imbibition effect is proposed, including expressions for permeabilities of artificial and natural porous media. The validity of the proposed models is analysed and tested by experimental data.

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

spontaneous imbibition
permeability
porous media


a microinstruction system Classical instruction systems specify all functions, simple and complex, through the same mechanism. This paper describes a new organization in which more elementary operations are programmer specified by a second instruction set in micro-subroutines controlled by a subordinate instruction counter. Contingencies in the execution of primary instructions cause automatic seizure of control by the subordinate level and the execution of the appropriate microinstructions. At the completion of a micro-subroutine control reverts to the primary level for continuation of the suspended primary operation. Coding techniques, priority problems, and validity considerations are explored. The relationship of this system to interruption techniques and parallel instruction counters is discussed.

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

organization systems parallel instruction paper continuation control programmer

relationships code interrupt validation operability complexity completeness priorities


A study of the solvent effect on the morphology of RDX crystal by molecular modeling method Molecular dynamics simulations have been performed to investigate the effect of acetone solvent on the crystal morphology of RDX. The results show that the growth morphology of RDX crystal in vacuum is dominated by the (111), (020), (200), (002), and (210) faces using the BFDH laws, and (111) face is morphologically the most important. The analysis of surface structures of RDX crystal indicates that (020) face is non-polar, while (210), (111), (002), and (200) faces are polar among which (210) face has the strongest polarity. The interaction between acetone solvent and each RDX crystal face is different, and the order of binding energy on these surfaces is (210)>(111)>(002)>(200)>(020). The analysis of interactions among RDX and acetone molecules reveal that the system nonbond interactions are primary strong van der Waals and electrostatic interactions containing p-hole interactions, the weak hydrogen bond interactions are also existent. The effect of acetone on the growth of RDX crystal can be evaluated by comparing the binding energies of RDX crystalline faces. It can be predicted that compared to that in vacuum, in the process of RDX crystallization from acetone, the morphological importance of (210) face is increased more and (111) face is not the most important among RDX polar surfaces, while the non-polar (020) face probably disappears. The experimentally obtained RDX morphology grown from acetone is in agreement with the theoretical prediction.

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

interfacial model
molecular dynamics simulation


Probabilistic analysis of laterally loaded piles using response surface and neural network approaches The response surface and the neural network methodologies are two approaches that are commonly used in reliability analysis of geotechnical problems with implicit performance functions, to deal with the complexity of probabilistic analyses. This paper proposes a two-step hybrid approach for reliability analysis. The first step obtains the design point using the first-degree polynomial response surface model. The second step constructs a neural network model of the performance function at the design point. The proposed method is first illustrated for a hypothetical laterally-loaded pile with analytical solutions. The case of a laterally-loaded steel pipe pile in Arkansas River sand is then presented, which involves non-normal random variables and spatial autocorrelation of soil strength parameters. Comparisons are made with Monte Carlo simulations incorporating importance sampling. Reliability-based parametric studies are performed on the Arkansas River example using the proposed hybrid approach. The influences on the reliability index and the probability of failure by the lateral load, depth of water table and correlation coefficient between unit weight and friction angle are investigated and discussed.

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

laterally loaded piles
response surface
neural network
probability
reliability


Semiparametric inference for open populations using the Jolly-Seber model: a penalized spline approach When there are frequent capture occasions, both semiparametric and nonparametric estimators for the size of an open population have been proposed using kernel smoothing methods. While kernel smoothing methods are mathematically tractable, fitting them to data is computationally intensive. Here, we use smoothing splines in the form of P-splines to provide an alternate less computationally intensive method of fitting these models to capture-recapture data from open populations with frequent capture occasions. We fit the model to capture data collected over 64 occasions and model the population size as a function of time, seasonal effects and an environmental covariate. A small simulation study is also conducted to examine the performance of the estimators and their standard errors.

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


Request differentiation in dynamic light-path establishment for WDM routed all optical networks of data centers Solving dynamic RWA by request buffering to increase total throughput and channel utilization. Improving throughput and channel utilization at the expense of a slight increase in blocking rate. Performance of data center networks is enhanced in terms of different metrics. Providing performance and complexity analyses for comparison purposes.

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

dynamic light-path establishment
routing and wavelength assignment
network of data centers


The modular decomposition of countable graphs. Definition and construction in monadic second-order logic We consider the notion of modular decomposition for countable graphs. The modular decomposition of a graph given with an enumeration of its set of vertices can be defined by formulas of monadic second-order logic. Another result is the definition of a representation of modular decompositions by low degree relational structures. Such relational structures can also be defined in the considered graph by monadic second-order formulas. (C) 2007 Elsevier B.V. All fights reserved.

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

tree
linear order
monadic second-order logic
monadic second-order transduction


Resource allocation under a strategic alliance: How a cooperative network with knowledge flow spurs co-evolution This article explores how a cooperative network with knowledge flow spurs co-evolution under a strategic alliance. For this purpose, this article analyzes the principle of a strategic alliances cooperative network with knowledge flow based on four different types of resource allocation patterns. Further, it presents a theoretical model of co-evolution by using co-evolution game and Synergetics order parameters while simulating the core order parameter density distribution and vector field. The result shows that the cooperative network with knowledge flow under a strategic alliance features path mutation, preferences and spontaneous symmetry breaking. Relationship-oriented and knowledge-embedded resource allocation patterns maintain the stability of network co-evolution. Both the technological network and social relationship network coexist in the course of co-evolution of a cooperative network with knowledge flow under a strategic alliance. If external actions have not been achieved, the cooperative network may still be self-sufficient until the network reaches stability.

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

resource allocation
strategic alliance
knowledge flow
cooperative network


Modulation and Transmission of Sweet Taste Information for Energy Homeostasis Perception of sweet taste is important for animals to detect external energy source of calories. In mice, sweet-sensitive cells possess a leptin receptor. Increase of plasma leptin with increasing internal energy storage in the adipose tissue suppresses sweet taste responses via this receptor. Data from our recent studies indicate that leptin may also modulate sweet taste sensation in humans with a diurnal variation in sweet sensitivity. This leptin modulation of sweet taste information to the brain may influence individuals preference and ingestive behavior, thereby playing important roles in regulation of energy homeostasis.

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

sweet taste
leptin
modulation
energy homeostasis


Integrating fuzzy data mining and fuzzy artificial neural networks for discovering implicit knowledge This study proposes a knowledge discovery model that integrates the modification of the fuzzy transaction data-mining algorithm (MFTDA) and the Adaptive-Network-Based Fuzzy Inference Systems (ANFIS) for discovering implicit knowledge in the fuzzy database more efficiently and presenting it more concisely. A prototype was built for testing the feasibility of the model. The testing data are from a companys human resource management department. The results indicated that the generated rules (knowledge) are useful in supporting the company to predict its employees future performance and then assign proper persons for appropriate positions and projects. Furthermore, the convergence of ANFIS in the model was proven to be more efficient than a generic fuzzy artificial neural network.

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

data mining
fuzzy artificial neural networks
human resource management


Throughput Behavior in Multihop Multiantenna Wireless Networks Multiantenna or MIMO systems offer great potential for increasing the throughput of multihop wireless networks via spatial reuse and/or spatial multiplexing. This paper characterizes and analyzes the maximum achievable throughput in multihop, MIMO-equipped, wireless networks under three MIMO protocols, spatial reuse only (SRP), spatial multiplexing only (SMP), and spatial reuse and multiplexing (SRMP), each of which enhances the throughput, but via a different way of exploiting MIMO's capabilities. We show via extensive simulation that as the number of antennas increases, the maximum achievable throughput first rises and then flattens out asymptotically under SRP, while it increases "almost" linearly under SMP or SRMP. We also evaluate the effects of several network parameters on this achievable throughput, and show how throughput behaves under these effects.

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


web-based student feedback to improve learning A Web-based anonymous feedback facility has been used for three years to give students a voice and some ownership of the subjects they are studying, and to allow staff to make adjustments to the teaching program in time to help the current student group. Improvements have been made to the system, e.g. the ability for students to identify themselves, extensions to staff e-mail copies, discussion threads to delineate topic areas, and automatic generation of statistics on usage. These statistics show how the need for anonymity decreases as the level of maturity of the students increases. Other planned or recently added improvements are described..

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


redirecting direct manipulation or what happens when the goal is in front of you but the interface says to turn left? The feeling of directness arises when the interface permits the user to manipulate an interface object in a way analogous to manipulating the real object. However, we argue here that the essence of direct manipulation is not directness per se, but manipulation of task relevant objects in a task relevant manner. The research reported studies users of HyperCard after 20 hours of practice. We found that when users deviated from taught strategies that 25\% of the time they invented new strategies that attempted a more direct manipulation of the task object than that permitted by the design of the interface.

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

difference-reduction
means-ends analysis
hill-climbing


Feature interaction detection by pairwise analysis of LTL propertiesA case study A Promela specification and a set of temporal properties are developed for a basic call service with a number of features. The properties are expressed in the logic LTL.

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

communicating processes
distributed systems
model checking
communications services


Approximation schemes for degree-restricted MST and red-blue separation problems We develop a quasi-polynomial time approximation scheme for the Euclidean version of the Degree-Restricted MST Problem by adapting techniques used previously by Arora for approximating TSP. Given n points in the plane, d = 3 or 4, and epsilon > 0, the scheme finds an approximation with cost within 1 + epsilon of the lowest cost spanning tree with the property that all nodes have degree at most d. We also develop a polynomial time approximation scheme for the Euclidean version of the Red-Blue Separation Problem, again extending Arora's techniques. Given epsilon > 0, the scheme finds an approximation with cost within 1 + epsilon of the cost of the optimum separating polygon of the input nodes, in nearly linear time.

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

approximation algorithm
degree-restricted minimum spanning tree
low degree


Noisy speech recognition based on Integration/Selection of multiple noise suppression methods using noise GMMs To achieve high recognition performance for a wide variety of noise and for a wide range of signal-to-noise ratio, this paper presents methods for integration of four noise reduction algorithms: spectral subtraction with smoothing of time direction, temporal domain SVD-based speech enhancement, GMM-based speech estimation and KLT-based comb-filtering. In this paper, we proposed two types of combination methods of noise suppression algorithms: selection of front-end processor and combination of results from multiple recognition processes. Recognition results on the CENSREC-1 task showed the effectiveness of our proposed methods.

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


On some convergence properties of the subspace constrained mean shift We investigate convergence properties of the MS and SCMS algorithms. The SCMS is shown to inherit important convergence properties of the MS algorithm. Theoretical guarantees for stopping criteria are provided. Three variations of the SCMS are proposed and tested.

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

subspace constrained mean shift
convergence

unsupervised learning
dimensionality reduction
principal curves
principal surfaces


Satisfying marketdemands with delivery obligations or delivery charges Consider a firm that receives deterministic, time-varying demands for its product. The firm has the flexibility to choose its customer base and receive market-specific revenues for its product. In addition to market revenue and market demand, the parameters of a negotiated contract can also play a role in market selection and fulfillment decisions. Two such parameters are (1) delivery obligation penalties and (2) delivery charges. In this paper, we determine optimal solution approaches for problem settings when either of these contract parameters is present. Our tailored solution techniques can solve each problem in a fraction of the time required by a state-of-the-art commercial optimization solver. (C) 2009 Elsevier Ltd. All rights reserved.

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

market selection
delivery obligations
delivery charges


Baseline detection and localization for invisible omnidirectional cameras Two key problems for camera networks that observe wide areas with many distributed cameras are self-localization and camera identification. Although there are many methods for localizing the cameras, one of the easiest and most desired methods is to estimate camera positions by having the cameras observe each other; hence the term self-localization. If the cameras have a wide viewing field, e.g. an omnidirectional camera, and can observe each other, baseline distances between pairs of cameras and relative locations can be determined. However, if the projection of a camera is relatively small on the image of other cameras and is not readily visible, the baselines cannot be detected. In this paper, a method is proposed to determine the baselines and relative locations of these "invisible" cameras. The method consists of two processes executed simultaneously: (a) to statistically detect the baselines among the cameras, and (b) to localize the cameras by using information from (a) and propagating triangle constraints. Process (b) works for the localization in the case where the cameras are observed each other, and it does not require complete observation among the cameras. However, if many cameras cannot be observed each other because of the poor image resolution, it dose not work. The baseline detection by process (a) solves the problem. This methodology is described in detail and results are provided for several scenarios.

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

omnidirectional camera
identification
localization
baseline detection

distributed vision
invisible camera
triangle constraint
constraint propagation


Agent-based system design for B2B electronic commerce Agent-based systems are increasingly used to support business-to-business (B2B) electronic commerce and other Internet-based transactions. The design complexity resulting from the multiple interconnected systems in these domains has to be managed in order to reduce costs and time to market. This paper introduces the Role-Algebraic Multi-Agent System Design (RAMASD) approach. RAMASD utilizes role models as reusable system-building blocks and a role algebra to capture the basic relations of roles. A two-sorted algebra is used to define the role algebra's semantics. RAMASD reduces the complexity of designing agent-based B2B e-commerce systems by enabling designers to work at a high level of abstraction and by automatically allocating roles to agents according to applicable role models and design constraints. A case study concerning a B2B electronic market for the automotive industry demonstrates the applicability of RAMASD. The advantages and disadvantages of the proposed approach are discussed, and comparisons with relevant work are made.

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

agent-oriented software engineering
agent organizations
agent-based e-business


Assessing the value of public library services: A review of the literature and meta-analysis (project META) This poster summarizes results of the IMLS funded University of South Carolina META project that explored the application of meta-analysis techniques to develop a robust model of public library economic value. Completed in 2014, the project approached this topic with two fundamental questions: (1) whether the reviewed public library valuation studies provide mounting evidence concerning the contributions that public libraries make to the economic prosperity of the communities they serve, and (2) what steps need to be taken in order to strengthen this assertion? The results of the analyses performed to answer these questions suggest that Americans typically receive five to six dollars for every dollar they spend on public library services. The results also lead to recommendations concerning strategies that could add strength to this assertion and provide a powerful new argument for the continuance of public library services: more detailed reporting practices, greater methodological consistency, and systematic consideration of intangible benefits.

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

public libraries
public library valuation
economic value
imls


Toward distributed service discovery in pervasive computing environments The paper proposes a novel distributed service discovery protocol for pervasive environments. The protocol is based on the concepts of peer-to-peer caching of service advertisements and group-based intelligent forwarding of service requests. It does not require a service to be registered with a registry or lookup server. Services are described using the Web Ontology Language ( OWL). We exploit the semantic class/subClass hierarchy of OWL to describe service groups and use this semantic information to selectively forward service requests. OWL-based service description also enables increased flexibility in service matching. We present simulation results that show that our protocol achieves increased efficiency in discovering services ( compared to traditional broadcast-based mechanisms) by efficiently utilizing bandwidth via controlled forwarding of service requests.

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

service discovery architecture
manet
semantic description
peer-to-peer


Re-engineering enterprise security Security concerns plague businesses of all sizes, but for large, international organisations, security management can be very complex. Many companies are therefore taking a fresh look at security to see how it can be re-engineered on an enterprise level to deliver seamless 247 management support globally. This article looks at the steps they must take and the issues they may face, as well as showing how the success of a programme can be measured using KPIs.

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

risk vulnerability threat compliance governance access messaging identity


Inequalities involving generalized interpolation polynomials ? The generalized Vandermonde determinant and the generalized interpolation polynomial are defined. We establish inequalities involving generalized interpolation polynomials under the proper hypotheses. Our main result is:

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

generalized vandermonde determinant
generalized interpolation polynomial


GF(4) based synthesis of quaternary Reversible/Quantum logic circuits Galois field sum of products (GFSOP) has been found to be very promising for reversible/quantum implementation of multiple-valued logic. In this paper, we show nine quaternary Galois field expansions, using which quaternary Galois field decision diagrams (QGFDD) can be constructed. Flattening of the QGFDD generates quaternary GFSOP (QGFSOP). These QGFSOP can be implemented as cascade of quaternary 1-qudit gates and multi-qudit Feynman and Toffoli gates. We also show the realization of quaternary Feynman and Toffoli gates using liquid ion-trap realizable 1-qudit gates and 2-qudit Muthukrishnan-Stroud gates. Besides the quaternary functions, this approach can also be used for synthesis of encoded binary functions by grouping 2-bits together into quaternary value. For this purpose, we show binary-to-quaternary encoder and quaternary-to-binary decoder circuits using quaternary 1-qudit gates and 2-qudit Muthukrishnan-Stroud gates.

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

quaternary galois field decision diagram


Theoretically predicted structures of plasma membrane Ca2+-ATPase and their susceptibilities to oxidation Oxidative damage to the plasma membrane Ca2+-ATPase (PMCA) appears to contribute to the decreased clearance of intracellular Ca2+ in the neurons of aged brain, possibly contributing to its vulnerability to numerous age-related diseases such as Alzheimer's disease. The precise sites of oxidative susceptibility have not been identified. However, it is known that calmodulin (CaM) protects the purified PMCA against oxidative inactivation, perhaps via conformational restructuring of the protein through dissociation of a 20 residue domain (C20W) in the C-terminal region that function as a CaM-binding site. In order to postulate likely oxidation sites and the mechanism underlying the protection offered by CaM, we have generated a three-dimensional model of PMCA via a combination of homology/comparative modeling, threading, proteinprotein docking, and guidance from prior biochemical and analytical studies. The resulting model was validated based on surface polarity/hydrophobicity profiling, standard ProCheck, WhatIF, and PROVE checks, as well as comparison with empirical structurefunction observations. This model was then used to identify likely oxidation sites by comparing time-averaged solvent accessibility of potentially oxidizable surface residues as measured from molecular dynamics simulations of intact PMCA and the PMCA sequence from which C20W has been deleted. The resulting model complex has permitted us to identify three amino acids whose solvent accessibility is greatly reduced by the C20W dissociation: Tyr 589, Met 622, and Met 831.

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

calmodulin
pmca
oxidation
threading
molecular dynamics

plasma membrane ca2+-atpase
homology modeling


Constructive polynomial approximation with a priori error bounds for nonlinear initial value differential problems In this paper, we consider an initial value problem y' = f(x, y), y(0) = y(0), where f is a continuous function satisfying a Lipschitz condition. First, the function f(x,y) is approximated by a Bernstein polynomial in two variables, B-n(f; x,y), of an appropriate degree according to a prescribed accuracy. Second, by application of the Frobenius method to the initial value problem y' = B-n(f; x, y), y(0) = y(0), an exact series solution of the latter problem is constructed. Finally, the infinite series solution is truncated in order to obtain an explicit polynomial whose error with respect to the exact solution of the original problem is less than the prescribed accuracy, in an existence and uniqueness domain which is determined in terms of the initial data. (C) 1999 Elsevier Science Ltd. All rights reserved.

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

differential equation
a priori error bound
two variables bernstein polynomial
truncation error


Domestic violence sentencing: coefficient to a natural process that already reduces recidivism simply as a function of aging Research on domestic violence (DV) sentencing, post-conviction, has mostly focused on incarceration and re-education programs, ignoring more than a dozen other components of the criminal sentence. Therefore, little is known, overall, about the breadth of DV sentencing, antecedents that may shape the content of the sentence, and a possible relationship between the criminal sentence and a theorized natural process believed to significantly reduce DV recidivism simply as a function of aging.

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


An Integer Linear Programming approach to the single and bi-objective Next Release Problem The Next Release Problem involves determining the set of requirements to implement in the next release of a software project. When the problem was first formulated in 2001, Integer Linear Programming, an exact method, was found to be impractical because of large execution times. Since then, the problem has mainly been addressed by employing metaheuristic techniques. In this paper, we investigate if the single-objective and bi-objective Next Release Problem can be solved exactly and how to better approximate the results when exact resolution is costly. We revisit Integer Linear Programming for the single-objective version of the problem. In addition, we integrate it within the Epsilon-constraint method to address the bi-objective problem. We also investigate how the Pareto front of the bi-objective problem can be approximated through an anytime deterministic Integer Linear Programming-based algorithm when results are required within strict runtime constraints. Comparisons are carried out against NSGA-II. Experiments are performed on a combination of synthetic and real-world datasets. We show that a modern Integer Linear Programming solver is now a viable method for this problem. Large single objective instances and small bi-objective instances can be solved exactly very quickly. On large bi-objective instances, execution times can be significant when calculating the complete Pareto front. However, good approximations can be found effectively. This study suggests that (1) approximation algorithms can be discarded in favor of the exact method for the single-objective instances and small bi-objective instances, (2) the Integer Linear Programming-based approximate algorithm outperforms the NSGA-II genetic approach on large bi-objective instances, and (3) the run times for both methods are low enough to be used in real-world situations.

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

integer linear programming
next release problem

multi-objective optimization
requirements optimization
search based software engineering


modeling anisotropic surface reflectance with example-based microfacet synthesis We present a new technique for the visual modeling of spatiallyvarying anisotropic reflectance using data captured from a single view. Reflectance is represented using a microfacet-based BRDF which tabulates the facets' normal distribution (NDF) as a function of surface location. Data from a single view provides a 2D slice of the 4D BRDF at each surface point from which we fit a partial NDF. The fitted NDF is partial because the single view direction coupled with the set of light directions covers only a portion of the "half-angle" hemisphere. We complete the NDF at each point by applying a novel variant of texture synthesis using similar, overlapping partial NDFs from other points. Our similarity measure allows azimuthal rotation of partial NDFs, under the assumption that reflectance is spatially redundant but the local frame may be arbitrarily oriented. Our system includes a simple acquisition device that collects images over a 2D set of light directions by scanning a linear array of LEDs over a flat sample. Results demonstrate that our approach preserves spatial and directional BRDF details and generates a visually compelling match to measured materials.

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

point
fit
slice
spatial
device
data
demonstrate
reflectance
texture synthesis
synthesis
similarity measure
surface

rotate examples redundancy arrays direct imaging model normalization sampling scan lighting locality visualization systems locatability functional matching material distributed completeness


Interactive Problem Solving Support in the Adaptive Educational Hypermedia System MATHEMA This paper describes the interactive problem solving support offered by our adaptive educational hypermedia system called MATHEMA. The general goal of the MATHEMA is the support of senior high school students or the beginners of higher education, through an interactive and constructivist environment, in learning physics (electromagnetism) individually and/or collaboratively, and to overcome their possible misconceptions and learning difficulties. Initially, a review of related work about the implemented AEHS/ITS and the didactic design principles of the MATHEMA are presented. Through the interactive problem solving, the system supports the students in solving electromagnetism problems, individually and/or collaboratively, by following an activity that is based on the experimentation with simulations, explorations, guided discovery, and collaboration didactic approaches. An experimental study with senior high school students showed that they improve their performances when following this activity. A questionnaire that we gave to the students to express their opinion about our system helped us to improve the quality of the courses.

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

adaptive educational hypermedia
interactive problem solving
misconceptions


PLATEAU PROBLEM IN THE WATERSHED TRANSFORM The watershed transform is one of best known and widely used methods for image segmentation in mathematical morphology. Since the definition, deriving from geology and nature observation is quite intuitive and straightforward to implement; many fast and powerful algorithms for watershed transform have already been presented. However, there still occur problems when one wishes to achieve a precise solution on blurred or noised image. The same range of problems is faced when a plateau occurs in the image. In this paper several methods for plateau reduction are discussed and some novel ideas proposed. All algorithms are performed on a set of both natural and synthetic images.

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

mathematical morphology
watershed transform
plateau reduction


AFSO: An Adaptative Frame Size Optimization Mechanism for 802.11 Networks In this paper, we analyze the impact of different frame types on self-similarity and burstiness characteristics of the aggregated frame traffic from a real 802.11 wireless local area network. We find that characteristics of aggregated frame traffic are affected by both mean frame size and the proportion of specified frame types. Based on this new knowledge, an adaptative frame size optimization (AFSO) mechanism is proposed to improve the transmission efficiency by adaptively adjusting data frame size according to the proportions of different frame types. Simulation results show that our proposed mechanism can effectively regulate the burstiness of aggregated frame traffic and improve the successful delivery rate of data frames when a fixed throughput target is set for 802.11 wireless networks.

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

802.11 wireless local area networks
self-similarity


A stochastic multi-criteria decision analysis for sustainable biomass crop selection We propose a stochastic analytical hierarchy process (SAHP) method. Sustainable biomass crop selection has economic, environmental, and social dimensions. Switchgrass is found to be the most sustainable crop type for biofuel production. Wheat and corn get high scores if economic factor is emphasized in decision making. The proposed SAHP model can utilize imprecise expert opinions in decision making.

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

biofuel production
biomass crop
economic

multi-criteria decision analysis (mcda)
stochastic ahp
sustainability
environmental and social factors


Estimation of optimal pivot point for remote center of motion alignment in surgery The determination of an optimal pivot point (\({ OPP}\)) is important for instrument manipulation in minimally invasive surgery. Such knowledge is of particular importance for robotic-assisted surgery where robots need to rotate precisely around a specific point in space in order to minimize trauma to the body wall while maintaining position control. Remote center of motion (RCM) mechanisms are commonly used, where the RCM point is manually and visually aligned. If not positioned appropriately, this misalignment might lead to intolerably high forces on the body wall with increased risk of postoperative complications or instrument damage. An automated method to align the RCM with the \({ OPP}\) was developed and tested.

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

robotic surgery
insertion point
medical imaging


on the education of future software engineers The education of software engineers more and more addresses organizational and management issues, like for instance modeling the business structure and environment which will receive a new software system. The teaching to software engineering students of modeling technologies based on standards like UML and the Rational Unified Process, stressing the focus on designing business-oriented management of software services, raises novel questions than need to be addressed.

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


a study and implementation of self-adaptive allocation algorithm for parallel program The application level load balancing problem that CPU time provided for each data unit is steady but CPU time needed by them is different has been drawing people's attention these years, but actually, the problem that CPU time needed by each data unit is the same but CPU time provided for them is non-steady has more practical value. This paper starts from the changing of provided CPU time for each computing process in a cluster, selects counter propagation neutral network as a basis from 3 predict methods, which can bring high accuracy but only cost a low complexity and can also well manage the interdependency of provided CPU time among the computing processes, then studies and implements an self-adaptive allocation algorithm for parallel programs. From the result of tests, the algorithm can largely raise the efficiency of parallel algorithms. Encapsulate this algorithm into MPI API for engineering applications, and as long as software developers substitute this API for message send and receive functions, adaptive allocation can be achieved. The API encapsulating the algorithm is especially applicable for Microsoft Windows Compute Cluster Server (WCCS) and it is the extension of this system.

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

api
counter propagation neutral network
cpu time


Focal shift in radially polarized beam with high NA lens axicon by using radial cosine phase wavefront Focal shift in radially polarized beam with radial cosine phase wavefront are investigated theoretically by vector diffraction theory. The wavefront phase distribution is cosine function of radial coordinate. Simulation results show that when the radially polarized beam with radial cosine wavefront phase is focused, the focal pattern differs considerably with frequency parameter in the cosine function term. On increasing C, focus can shift along optical axis and focal pattern changes remarkably. Focus may move in different direction under different condition. Focal shift distance fluctuates on increasing C, and fluctuation amplitude also increases simultaneously. In addition, focal shift direction can also be adjusted by changing frequency parameter in cosine function.

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

radially polarized beam
cosine phase wavefront


reconfigurable pipeline systems Systems with pipeline processing capabilities, processors whose computational subsystems are divided into several distinct stages, each of which may be working with an independent set of data at the same instant of time, are one attractive solution to the demand for faster and more cost effective computers. In addition, several of the existing pipelined machines have facilities for a limited amount of restructuring of available resources to provide a system which is more suitable for the efficient execution of a particular problem. The amount of restructuring, or reconfiguration, varies from system to system. The type of reconfiguration, either a reconfiguration of an actual functional unit or a reconfiguration of the information flow between several functional units, varies as well. The reconfigurable aspects of the architecture of several pipelined machines are presented. Performance gains when restructuring is allowed are also examined. Finally, there is a discussion of some possible future reconfigurable pipeline systems.

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

information flow
systems
capabilities
architecture
performance
functional
reconfiguration
data
future
cost

processor
aspect
efficiency
vector processing
restructurable computers
computation
chaining
computer architecture
process
timing
effect
resource
pipelining


graphical programming for simulation of computer systems This paper describes a graphically based programming system for simulation models of systems representable as generalized queueing network models. The model and program development system substantially enhances the capabilities of automating the development process of current graphically-oriented systems. The enhancement includes representations of virtual devices in the model formulation process and use of graphically specified programs as the user visible representation of an executable simulation model.

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

program
development process
use
simulation
systems
capabilities
process
representation
paper
model
user

developer
device
computation
graphics
general
queue
network model
virtualization


mobile phone based ar scene assembly In this paper we describe a mobile phone based Augmented Reality application for 3D scene assembly. Augmented Reality on mobile phones extends the interaction capabilities on such handheld devices. It adds a 6 DOF isomorphic interaction technique for manipulating 3D content. We give details of an application that we believe to be the first where 3D content can be manipulated using both the movement of a camera tracked mobile phone and a traditional button interface as input for transformations. By centering the scene in a tangible marker space in front of the phone we provide a mean for bimanual interaction. We describe the implementation, the interaction techniques we have developed and initial user response to trying the application.

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


Efficient security mechanisms for overlay multicast based content delivery This paper studies the security issues that arise in an overlay multicast architecture where service providers distribute content such as web pages, static and streaming multimedia data, realtime stock quotes, or security updates to a large number of users. In particular, two major security problems of overlay multicast, network access control and group key management, are addressed. We first present a bandwidth-efficient scheme, called CRBR, that seamlessly integrates network access control and group key management. Performance analysis and simulation results show that our scheme incurs much smaller communication overhead than two other well-known schemes when they are directly applied in overlay multicast. Next we propose a DoS-resilient key distribution scheme, called k-RIP, that delivers updated keys to a large fraction of nodes with high probability even if an attacker can selectively compromise nodes in the multicast data delivery hierarchy and command these compromised nodes to drop keying packets. The proposed schemes do not rely on knowledge of overlay topology and can scale up to very large overlay networks. (c) 2006 Elsevier B.V. All rights reserved.

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

overlay multicast
network access control
group key management


Sharing costs in highways: A game theoretic approach This paper introduces a new class of games, highway games, which arise from situations where there is a common resource that agents will jointly use. That resource is an ordered set of several indivisible sections, where each section has an associated fixed cost and each agent requires some consecutive sections. We present an easy formula to calculate the Shapley value, and we present an efficient procedure to calculate the nucleolus for this class of games.

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


IT-intensive value innovation in the electronic economy: Insights from Marshall Industries The emerging electronic economy is bringing with it new forms of IT-enabled intermediation, virtual supply chains, rapidly changing electronic commerce technologies, increasing knowledge intensity, and unprecedented sensitivity for time-to-market by customers. Customers are demanding more value, customized to their exact needs, at less cost, and as quickly as possible. The enterprises that will survive in such a demanding environment will need to innovate and invent new ways of creating value, and will require different enterprise architectures and different IT infrastructures. This article focuses on providing a framework for guiding an enterprise as it transforms itself to function more effectively in the electronic economy. Using the distribution industry in general and Marshall Industries in particular as a context, the article draws insights for transforming an extended enterprise's architecture and its IT infrastructure to enable new ways of creating value in the electronic economy. The article provides a staged junction box model for guiding the transformation and also articulates the elements of the new value logic for enterprises in the electronic economy.

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

electronic economy
intermediation
distribution industry
electronic commerce
value innovation

electronic value chains
supply chain management
intranet
extranet
internet
time-based competition
fast response
cio
it architecture
strategic information systems
total quality management
systems approach
e-business


Computation of large-scale parameters for dispersion in fissured porous medium using finite-volume method In this work, we are interested in solute transport in fissured porous media. The medium is considered as a special case of a two-region system, and a two-equation model previously obtained from a volume averaging technique is used to derive large-scale dispersion coefficients. These coefficients are obtained as solutions of a set of closure problems and the main objective of this work is to present an efficient method to solve these closure problems. The method makes use of an unstructured grid and special techniques to take into account the fissure network. Results are compared with other existing methods on simple fissured media. Finally, the technique is applied to a complex structure.

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

fissured medium
joint element
large-scale dispersion
mass tranfer coefficient
two-equation model


Top-Down modulation of neural responses in visual perception: a computational exploration Visual perception is typically performed in the context of a task or goal. Nonetheless, visual processing has traditionally been conceptualized in terms of a fixed, task-independent hierarchy of feature detectors. We explore the computational implications of allowing early visual processing to be task modulated. Using artificial neural networks, we show that significant improvements in task accuracy can be obtained by allowing the weights to be modulated by task. The primary benefits are obtained under resource-limited processing. A relatively modest task-based modulation of weights and activities can lead to a large performance boost, suggesting an efficient means of increasing effective cortical capacity.

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

neural network
top-down processing
control
computational modeling
cognitive psychology


A revised ideal model for AlGaAs/GaAs quantum well solar cells Quantum well solar cells (QWSCs) are heterostructure devices intended to achieve higher efficiencies than conventional cells. This paper extends a previous model for QWSC currentvoltage characteristics by revising the equations for the absorbed flux and by introducing expressions to calculate radiative recombination coefficients and well effective densities-of-states. This revised model is in agreement with previous experimental results for AlGaAs/GaAs. Since the revised model incorporates detailed balance calculations, its predictions are consistent with the efficiency restrictions of this theory. The revised model, however, does predict efficiency enhancements for QWSCs in some configurations if non-radiative recombination is dominant, even in such a poor QWSC material as AlGaAs/GaAs.

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

quantum well solar cell
models
algaas/gaas


Efficient genetic algorithm of codebook design for text-independent speaker recognition This letter presents text-independent speaker identification results for telephone speech. A speaker identification system based on Karhunen-Loeve transform (KLT) derived from codebook design using genetic algorithm (CA) is proposed. We have combined genetic algorithm (CA) and the vector quantization (VQ) algorithm to avoid typical local minima for speaker data compression. Identification accuracies of 91% were achieved for 100 Mandarin speakers.

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

speaker recognition
genetic algorithm
codebook design
vq algorithm


Acquisition and analysis of compromised firmware using memory forensics To a great degree, research in memory forensics concentrates on the acquisition and analysis of kernel- and user-space software from physical memory to date. With the system firmware, a much more privileged software layer exists in modern computer systems though that has recently become the target in sophisticated computer attacks more often. Compromise strategies used by high profile rootkits are almost completely invisible to standard forensic procedures and can only be detected with special soft- or hardware mechanisms. In this paper, we illustrate a variety of firmware manipulation techniques and propose methods for identifying firmware-level threats in the course of memory forensic investigations. We have implemented our insights into well-known open-source memory forensic tools and have evaluated our approach within both physical and virtual environments.

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

memory acquisition
live forensics
firmware rootkits
incident response


implementing asynchronous circuits using a conventional eda tool-flow This paper presents an approach by which asynchronous circuits can be realised with a conventional EDA tool flow and conventional standard cell libraries. Based on a gate-level asynchronous circuit implementation technique, direct-mapping, and by identifying the delay constraints and exploiting certain EDA tool features, this paper demonstrates that a conventional EDA tool flow can be used to describe, place, route and timing-verify asynchronous circuits.

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


Zero variance Markov chain Monte Carlo for Bayesian estimators Interest is in evaluating, by Markov chain Monte Carlo (MCMC) simulation, the expected value of a function with respect to a, possibly unnormalized, probability distribution. A general purpose variance reduction technique for the MCMC estimator, based on the zero-variance principle introduced in the physics literature, is proposed. Conditions for asymptotic unbiasedness of the zero-variance estimator are derived. A central limit theorem is also proved under regularity conditions. The potential of the idea is illustrated with real applications to probit, logit and GARCH Bayesian models. For all these models, a central limit theorem and unbiasedness for the zero-variance estimator are proved (see the supplementary material available on-line).

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

control variates
garch models
logistic regression
metropolis-hastings algorithm


On the van der Waerden numbers w ( 2 ; 3 , t ) In this paper we present results and conjectures on the ordinary van der Waerden numbers w ( 2 ; 3 , t ) and on the new palindromic van der Waerden numbers pdw ( 2 ; 3 , t ) . We have computed the exact value of the previously unknown number w ( 2 ; 3 , 19 ) = 349 , and we provide new lower bounds for 20?t?39 20 ? t ? 39 , where for 20?t?30 20 ? t ? 30 we conjecture these bounds to be exact. The lower bounds for w ( 2 ; 3 , t ) with 24?t?30 24 ? t ? 30 refute the conjecture that w ( 2 ; 3 , t ) ? t 2 as suggested in Brown etal. (2008). Based on the known values of w ( 2 ; 3 , t ) , we investigate regularities to better understand the lower bounds of w ( 2 ; 3 , t ) . Motivated by such regularities, we introduce palindromic van der Waerden numbers pdw ( k ; t 0 , , t k ? 1 ) , which are defined as the ordinary numbers w ( k ; t 0 , , t k ? 1 ) , but where only palindromic solutions are considered, reading the same from both ends. Different from the situation for ordinary van der Waerden numbers, these numbers need actually to be pairs of numbers. We compute pdw ( 2 ; 3 , t ) for 3?t?27 3 ? t ? 27 , and we provide bounds for t?39 t ? 39 , which we believe to be exact for t?35 t ? 35 . All computations are based on SAT solving, and we discuss the various relations between SAT solving and Ramsey theory. Especially we introduce a novel (open-source) SAT solver, the tawSolver, which performs best on the SAT instances studied here, and which is actually the original DLL-solver by Davis etal. (1962), but with an efficient implementation and a modern heuristic typical for look-ahead solvers, applying the theory developed by the second author (Kullmann, 2009).

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

van der waerden numbers
ramsey theory
sat solver


Stromatoporoid biometrics using image analysis software: A first order approach ? Strommetric is a new image analysis computer program that performs morphometric measurements of stromatoporoid sponges. The program measures 15 features of skeletal elements (pillars and laminae) visible in both longitudinal and transverse thin sections. The software is implemented in C++, using the Open Computer Vision (OpenCV) library. The image analysis system distinguishes skeletal elements from sparry calcite using Otsus method for image thresholding. More than 150 photos of thin sections were used as a test set, from which 36,159 measurements were obtained. The software provided about one hundred times more data than the current method applied until now. The data obtained are reproducible, even if the work is repeated by different workers. Thus the method makes the biometric studies of stromatoporoids objective.

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


a tuning framework for software-managed memory hierarchies Achieving good performance on a modern machine with a multi-level memory hierarchy, and in particular on a machine with software-managed memories, requires precise tuning of programs to the machine's particular characteristics. A large program on a multi-level machine can easily expose tens or hundreds of inter-dependent parameters which require tuning, and manually searching the resultant large, non-linear space of program parameters is a tedious process of trial-and-error. In this paper we present a general framework for automatically tuning general applications to machines with software-managed memory hierarchies. We evaluate our framework by measuring the performance of benchmarks that are tuned for a range of machines with different memory hierarchy configurations: a cluster of Intel P4 Xeon processors, a single Cell processor, and a cluster of Sony Playstation3's.

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

precise
framework
applications
performance
general
paper
memory hierarchies
processor
program
space
process
tuning
cluster

measurement
benchmark
errors
evaluation
management
software
dependencies
bulk decomposition
software-managed memory hierarchy
memorialized
configurability
empirical tuning


Compact UWB microstrip lowpass filter with novel CMRC A novel beeline compact microstrip resonant cell, entitled BCMRC (beeline compact microstrip resonant cell), is firstly proposed and analyzed. The photonic bandgap and slow-wave effect of the BCMRC are evaluated. The compact configuration presents ultrawide stopband and improved slow-wave characteristics. Investigation of its scattering/ radiation level is also included. An ultrawide band lowpass filter, consisting of three BCMRCs connected in series, is designed and fabricated. The filter has the advantages of low insertion loss in the passband, sharp, high and wide rejection in the stopband and compact size. The experimental results show good agreements with simulation results. (c) 2007 Wiley Periodicals, Inc.

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


the nx/2 operating system NX/2 is the operating system which runs on the nodes of the Intel iPSC/2 concurrent supercomputer. NX/2 provides all of the standard system services found in the original iPSC node operating system, such as memory management, multiple process control, message passing services, and intertask protection. This paper focuses on the major node operating system enhancements brought about by two different requirements. First, NX/2 had to support very high speed and high throughput message passing. In this regard, we show how NX/2 was tuned to the 32-bit architecture of the iPSC/2 nodes and the Direct Connect technology used to implement the communication subsystem. Second, NX/2 had to support a more streamlined and flexible set of message passing service calls. In this regard, we describe the new set of message passing system calls and discuss how NX/2 implements them. The calls range from a simple, effective set of synchronous calls to advanced asynchronous calls which allow overlap of message passing and processing as well as interrupt-driven message handling.

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

requirements
communication
protection
throughput
direct
service
paper
control
management
message
architecture
supercomputer
operating system
process
support

synchronization standardization flexibility systems technologies asynchronicity concurrency memorialized message-passing connection effect


Generation of surfaces via equilibrium of forces This paper deals with the generation of minimal surfaces subject to a prescribed volume constraint and surfaces with a given mean curvature. The generation of a surface with a desired curvature is related to finding the equilibrium state of the surface under a uniform state of tension and under a prescribed pressure. Assuming an initial configuration, the surface is discretized into nodes and elements, and its final equilibrating configuration is found in a stepwise manner. In each step, the nodal forces are calculated and the surface is allowed to undergo displacements proportional to the nodal forces. Thus, the equilibrium state of the surface is obtained iteratively. The generation of a minimal surface subject to a prescribed volume constraint is also considered and analyzed by a generalization of the method outlined. Numerical examples are given to illustrate the described approach.

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

tension structures
constrained variational functional
nonlinear equilibrium algorithm
finite elements
energy formulation (surface energy)


Georoy: A location-aware enhancement to Viceroy peer-to-peer algorithm ? The success of experiences such as Seattle and Houston Wireless has attracted the attention on the so called wireless mesh community networks. These are wireless multihop networks spontaneously deployed by users willing to share communication resources. Due to the community spirit characterizing such networks, it is likely that users will be willing to share other resources besides communication resources, such as data, images, music, movies, disk quotas for distributed backup, and so on. To support resource exchange in these wireless mesh community networks, algorithms for efficient retrieval of information are required. In this paper we introduce Georoy, an algorithm for the efficient retrieval of the information on resource location based on the Viceroy peer-to-peer algorithm. Differently from Viceroy, Georoy exploits the capability of setting and managing a direct mapping between the resource ID and the node which maintains information about its location so as to speed up the search process. Simulation results show that Georoy enables efficient and scalable search of resources and can be successfully used in wireless mesh community networks.

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

wireless mesh networks
resource localization
distributed hash tables
scalability


Stochastic Approximation Algorithm for Optimal Throughput Performance of Wireless LANs In this paper, we consider the problem of throughput maximization in an infrastructure based WLAN. We demonstrate that most of the proposed protocols though perform optimally for connected network (no hidden terminals), their performance is worse than even that of standard IEEE 802.11 in presence of hidden terminals. Here we present a stochastic approximation based algorithm that not only provide optimum throughput in a fully connected network but also when hidden nodes are present.

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

performance
hidden nodes
stochastic approximation

algorithms
ieee 802.11
weighted fairness


Towards a computerized Arabic Braille environment People with visual disabilities face many difficulties and barriers when using computers and the Internet. Such people need the help of IT developers to create adaptive technologies that facilitate their interaction with the computers and Internet. This paper presents the design and implementation of an Arabic Braille environment (ABE). The paper also exposes to the reader the ABE's functionality and unique features. The ABE is designed to facilitate Arabic-speaking visually impaired people interaction with computers, as well as helping sighted users to communicate with the visually impaired. Copyright (C) 2003 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 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 B I O O O O O O O