designing a human-centered, multimodal gis interface to support emergency management Geospatial information is critical to effective, collaborative decision-making during emergency management situations; however conventional GIS are not suited for multi-user access and high-level abstract queries. Currently, decision makers do not always have the real time information they need; GIS analysts produce maps at the request of individual decision makers, often leading to overlapping requests with slow delivery times. In order to overcome these limitations, a paradigm shift in interface design for GIS is needed. The research reported upon here attempts to overcome analyst-driven, menu-controlled, keyboard and mouse operated GIS by designing a multimodal, multi-user GIS interface that puts geospatial data directly in the hands of decision makers. A large screen display is used for data visualization, and collaborative, multi-user interactions in emergency management are supported through voice and gesture recognition. Speech and gesture recognition is coupled with a knowledge-based dialogue management system for storing and retrieving geospatial data. This paper describes the first prototype and the insights gained for human-centered multimodal GIS interface design.

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

speech
data visualization
voice
order
geospatial data
maps
mouse
paper
access
interface design
gis
dialogue
management
research
prototype
support
queries

speech and gesture recognition
multimodal human-computer-interface
interactive maps
human
gestural recognition
interfaces
knowledge
real-time
informal
interaction
multimodality
collaboration
multi user
systems
decision making
abstraction
human-centered design
critic
effect
collaborative work
emergence


Neighbor-aided authentication watermarking based on a chaotic system with feedback A neighbor-aided authentication water-marking based on a chaotic system with feedback is proposed in this paper. This algorithm can not only detect malicious manipulations but reveal block substitutions when the VQ attack occurs. An image is partitioned into non-overlapped blocks. The pixels in one block and its neighboring block are combined to produce an authentication watermark based on a chaotic system with feedback, which is sensitive to the initial value. The produced water-mark is embedded into the current block. During detection, the detector extracts the watermark firstly, then generates a reference sequence and compares it with the extracted watermark to authenticate the integrity of the image and locate the tampered regions. Experimental results prove the effectiveness of our method.

O B O O O O B I O B O O B 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 O O O O O O O O O O O O O B 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 O O 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 Restart for Accelerated Gradient Schemes In this paper we introduce a simple heuristic adaptive restart technique that can dramatically improve the convergence rate of accelerated gradient schemes. The analysis of the technique relies on the observation that these schemes exhibit two modes of behavior depending on how much momentum is applied at each iteration. In what we refer to as the high momentum regime the iterates generated by an accelerated gradient scheme exhibit a periodic behavior, where the period is proportional to the square root of the local condition number of the objective function. Separately, it is known that the optimal restart interval is proportional to this same quantity. This suggests a restart technique whereby we reset the momentum whenever we observe periodic behavior. We provide a heuristic analysis that suggests that in many cases adaptively restarting allows us to recover the optimal rate of convergence with no prior knowledge of function parameters.

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


Application of function deployment model in decision making for new product development In this study, a novel model called Function Deployment Model (FDM) for decision making in new product development is introduced. To demonstrate its usefulness pragmatically, the model is applied to the design problem of development of the micro/nano injection molding machine. Based on the Quality Function Deployment (QFD) technique, this model translates the customer needs to engineering characteristics. An Analytic Hierarchy Process (AHP) is used to prioritize customer requirements while a Linear Programing (LP) optimization method is used to determine the feasible solution of the design variables within limited resources. Also, a program with a tailor-made graphical user interface (GUI) using MATLAB library and Microsoft Component Object Model (COM) technology is implemented to guide the design engineers to employ the proposed methodology for decision making.

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

new product development
decision making
quality function deployment
function deployment model
analytic hierarchy process


Effects of Phytoestrogens and Synthetic Combinatorial Libraries on Aromatase, Estrogen Biosynthesis, and Metabolism Approximately 60% of breast cancer patients have hormone-dependent breast cancer containing estrogen receptors and requiring estrogen for tumor growth. The extent of estrogen biosynthesis and metabolism in the breast cancer tissue microenvironment influences breast-tumor development and growth, and endogenous and exogenous agents may alter the levels of hormonally active estrogens and their metabolites. Isoflavonoid phytoestrogens such as genistein exhibit numerous biochemical activities; however, their effects on estrogen biosynthesis and metabolism in breast cancer cells have not been fully examined. MCF-7 cells (hormone-dependent) and MBA-MB-231 cells (hormone-independent) were treated with genistein (100 nM) for five days and then incubated with radiolabeled estradiol (100 nM, 2.5 ?Ci) for 0 to 48 h. Media were extracted with ethyl acetate, and the organic residues analyzed by reverse-phase HPLC with a radioactivity flow detector. The major metabolite formed in all cases is estrone, although differences were observed between the cell lines and the various drug treatments. The formation of estrone in untreated MCF-7 cells (approximately 9.3% of radioactivity at 24 h) is relatively limited, in contrast to untreated MDA-MB-231 cells (approximately 32.0% of radioactivity at 24 h). Treatment of MCF-7 cells with 100 nM genistein increased the conversion of estradiol to estrone up to 19.5% in 24 h. The effect of genistein on estrone formation in MDA-MB-231 cells resulted in 37.7% of the radioactivity being estrone. Thus, genistein treatment of breast cancer cells resulted in increased 17-?hydroxysteroid dehydrogenase activity and elevated formation of estrone. Increased levels of oxidative 17-?hydroxysteroid dehydrogenase activity (Type II) were confirmed by Western blots. Therefore, exposure of breast cancer cells to genistein results in elevated conversion of estradiol to estrogenically weaker or inactive metabolites. The regulation of breast-tissue aromatase by exogenous agents such as drugs and environmental agents is being investigated. The benzopyranone-ring system is a molecular scaffold of considerable interest, and this scaffold is found in flavonoid natural products that have weak aromatase inhibitory activity. Medicinal chemistry efforts focus on diversifying the benzopyranone scaffold and utilizing combinatorial chemistry approaches to construct small benzopyranone libraries as potential aromatase inhibitors. Several compounds in the initial libraries have demonstrated moderate aromatase inhibitory activity in screening assays.

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

flavonoid
isoflavonoid
benzopyranone
aromatase
genistein
combinatorial chemistry

phytoestrogen
17?-hydroxysteroid dehydrogenase
estrogen metabolism


tem-cell and surface scan to identify the electromagnetic emission of integrated circuits The characterization as well as the control of the electromagnetic emission of integrated circuits is an important step in the design process of state of the art integrated circuits. In the present paper we describe the use of the TEM-cell and the surface scan method according to a standard from the IEC as well as a combined version of these two methods. We present how these methods could be used in the characterization of test chips. We also present how the combined method was used to reduce the electromagnetic emission of a state of the art integrated circuit for automotive applications.

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

tem-cell method
electromagnetic emission (eme)


Beyond the Dimensionality of Visualization in Chemistry This article elaborates a key aspect of applied visualization in chemistry

transformation of data
molecular models
dynamic representation
interactivity


Face stability analysis of shallow shield tunnels in dry sandy ground using the discrete element method Controlling the face stability of shallow shield tunnels is difficult due to the inadequate understanding of face failure mechanism. The failure mechanism and the limit support pressure of a tunnel face in dry sandy ground were investigated by using discrete element method (DEM), which has particular advantages for revealing mechanical properties of granular materials. The contact parameters of the dry sand particles were obtained by calibrating the results of laboratory direct shear tests. A series of three-dimensional DEM models for different ratios of the cover depth to the diameter of the tunnel (C/D=0.5, 1, and 2; i.e., relative depth) were then built to simulated the process of tunnel face failure. The limit support pressure, failure zone and soil arching were discussed and compared with other methods. The results of DEM simulations show that the process of tunnel face failure can be divided into two stages. With the increase of the horizontal displacement of the tunnel face, the support pressure decreases to the limit support pressure and then increases to the residual support pressure. The limit support pressure increases with the rise of relative depth and then tends to be constant. In the process of tunnel face failure, the failure zone is gradually enlarged in size and expands to the ground surface. The numerical results also demonstrate that soil arching occurs in the upper part of the failure zone and the soil becomes loosened in the failure zone. Consequently, the comprehensive analysis of tunnel face failure may help to guarantee safe construction during tunneling.

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

face stability
limit support pressure
failure zone
soil arching

discrete element method (dem)
shallow shield tunnel


A new class of binary constant weight codes derived by groups of linear fractional mappings Let A(n, d, w) denote the maximum possible number of code words in binary (n, d, w) constant weight codes. For smaller instances of (n, d, w)s. many improvements have occurred over the decades. However, unknown instances still remain for larger (n, d, w)s (for example, those of n > 30 and d > 10). In this paper, we propose a new class of binary constant weight codes that fill in the remaining blank instances of (n, d, w)s. Specifically, we establish several new non-trivial lower bounds such as 336 for A(64, 12, 8), etc. (listed in Table 2). To obtain these results, we have developed a new systematic technique for construction by means of groups acting on some sets. The new technique is performed by considering a triad (G, Omega f) := ("Group G," "Set Omega," "Action f on Omega") simultaneously. Our results described in Sect. 3 are obtained by using permutations of the elements of a set that include infinity homogeneously like the other elements, which play a role to improve their randomness. Specifically, in our examples, we adopt the following model such as (PGL(2)(F-q), P-1 (F-q), "linear fractional action of subgroups of PGL(2)(F-q) on P-1(F-q)") as a typical construction model. Moreover, as an application, the essential examples in [7] constructed by using an alternating, group are again reconstructed with our new technique of a triad model, after which they are all systematically understood in the context of finite subgroups that act fractionally on a projective space over a finite field.

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

binary constant weight codes
linear fractional mappings

lower bounds of the number of code words


3D estimation of soft biological tissue deformation from radio-frequency ultrasound volume acquisitions The current research and development of 2D (matrix-shaped) transducer arrays to acquire 3D ultrasound data sets provides new insights into medical ultrasound applications and in particular into elastography. Until very recently, tissue strain estimation techniques commonly used in elastography were mainly 1D or 2D methods. In this paper, a 3D technique estimating biological soft tissue deformation under load from ultrasound radiofrequency volume acquisitions is introduced. This method locally computes axial strains, while considering lateral and elevational motions. Optimal deformation parameters are estimated as those maximizing a similarity criterion, defined as the normalized correlation coefficient, between an initial region and its deformed version, when the latter is compensated for according to these parameters. The performance of our algorithm was assessed with numerical data reproducing the configuration of breast cancer, as well as a physical phantom mimicking a pressure ulcer. Simulation results show that the estimated strain fields are very close to the theoretical values, perfectly discriminating between the harder lesion and the surrounding medium. Experimental strain images of the physical phantom demonstrated the different structures of the medium, even though they are not all detectable on the ultrasound scans. Finally, both simulated and experimental results demonstrate the ability of our algorithm to provide good-quality elastograms, even in the conditions of significant out-of-plane motion.

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

elastography
strain estimation
ultrasound


Service provider oriented management systems over open cellular network infrastructures An interesting concept for the open cellular communications world of the near future is to enable service providers (SPs) to dynamically find, and co-operate with, the best cellular network providers (NPs), i.e., those offering desired quality levels, in the most cost-efficient manner, at a given service area region and time zone. This concept calls for an evolution of legacy management paradigms. In this direction, this paper presents parts of a Service Management System (SMS) that adopts the perspective of an SP (SP-SMS). The paper provides elements of the system design (functionality layers, components in each layer, component distribution pattern and high level functionality) and a more detailed look at the functionality of some of the SP-SMS components. The SP-SMS will be decomposed in three layers, namely session configuration, local planning, and global planning. A component type will be introduced in each layer. The role of the different components in the SP-SMS layers will be described. Emphasis will be given to the description of the functionality of the components in the local planning layer. Specifically, the problem addressed at that layer enables an SP to allocate its service demand, at the best possible (desired) quality levels, and at the most cost-efficient cellular NPs, within a service area region and time-zone. Finally, results showing merits from the introduction of an SP-SMS are presented, and concluding remarks are made.

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


Repeated positioning in accurate radiotherapy based on virtual net technique and contrary reconstruction scheme This paper presents a new repeated positioning system for external radiotherapy. A new scheme is proposed to rebuild patient's body surface 3-D image based on simple stereo vision model and virtual net technique, which improves the reconstruction precision of the template. For the calculation of the positioning error, the contrary reconstruction scheme is adopted and the positioning speed is greatly improved. The 3-D reconstructed video image of the right position in the first positioning is used as the reference template for the next positioning, and the positioning error is evaluated by projecting the template image into the patient's real-time video images and calculating the correlation ratio in the areas limited by the triangle of the reference image.

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

repeated positioning
virtual net
stereo vision
contrary reconstruction


Flexible service selection with user-specific QoS support in service-oriented architecture ? Along with the development of the service-oriented architecture (SOA) and cloud computing, a large number of service providers have created an intense competitive world of business. Consequently, it is becoming increasingly complex to select a service provider for a user as a result of their various economic and social attributes. In this paper, we state the problem of how to find the appropriate services with satisfying the users' multiple QoS requirements. We consider the service's response time, trust degree and monetary cost. And inspired from the mode of Web search engine, such as Yahoo, Google, we propose an innovative service selection algorithm for SOA systems. The algorithm can recommend a number of suitable services based on the user's QoS requirements. Compared with the existing scheduling algorithms, our solution is much more flexible in supporting the multiple objectives and user personalization. We study the scalability of the algorithm with different numbers of jobs, service providers and QoS criteria. And we find that it can capture user's preferences value in less than six times of job submissions.

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

quality of service
web service
service-oriented architecture


Experimental investigation of electromigration failure in CuSnCu micropads in 3D integrated circuits Electromigration in CuSnCu microconnects in 3D IC is studied. Possible failure mechanisms are proposed. Failed interconnects exhibit voids both in the microconnect and between last metal to microconnect.

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

interconnect
failure analysis
cusncu bonding
reliability


Confidential mobile mail retrieval The method of probalistic searching on encrypted data can be utilized for a confidential mobile mail retrieval system where the e-mails are stored and processed in an untrusted domain. We discuss the necessary modification to the theoretical settings in the procedures and algorithms, but also the actual used technical means. We show that it is possible to deploy an adapted version of the system in [Proceedings of the 21st Institute of Electrical and Electronics Engineers Inc. (IEEE) Symposium on Security and Privacy, Berkeley, CA (2000) 44] in a secure and user-friendly manner in the constraint mobile environment. (C) 2002 Elsevier Science B.V. All rights 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O B O O O O O O O O O O O O O O O O O O O O O O O


why ada is not just another programming language Since there have been hundreds of high level languages developed over the past twenty years, many people are asking why there is so much fuss about Ada. The question is frequently askedwhy isn't Ada just another programming language. Although Ada was developed to meet Department of Defense requirements, those requirements were really for embedded computer systems i.e. those in which the computer is integrated with additional hardware. Such systems certainly exist in the nonmilitary environment e.g. process control, microwave ovens, and so Ada is applicable to many cases which have no connection with the military. In addition to being a programming language, Ada provides support for software engineering concepts, as well as a programming support environment, and it is this combination which is unique. Ada is unique non-technically for social, economic, and political reasons which relate to the way in which it was developed and the way in which it is being viewed by many people and organizations. Ada is unique technically because of its support for the concept of software components, its excellent blend of modern useful features, and its support for the production of very large software systems.

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


Degraded Gaussian multirelay channel: Capacity and optimal power allocation We determine the capacity region of a degraded Gaussian relay channel with multiple relay stages. This is done by building an inductive argument based on the single-relay capacity theorem of Cover and El Gamal. For an arbitrary distribution of noise powers, we derive the optimal power distribution strategy among the transmitter and the relays and the best possible improvement in signal-to-noise ratio (SNR) that can be achieved from using a given number of relays. The time-division multiplexing operation of the relay channel in the wideband regime is analyzed and it is shown that time division does not achieve minimum energy per bit.

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

optimal resource allocation
wideband channels


The effectiveness of a training method using self-modeling webcam photos for reducing musculoskeletal risk among office workers using computers An intervention study was conducted to examine the effectiveness of an innovative self-modeling photo-training method for reducing musculoskeletal risk among office workers using computers. Sixty workers were randomly assigned to either: 1) a control group; 2) an office training group that received personal, ergonomic training and workstation adjustments or 3) a photo-training group that received both office training and an automatic frequent-feedback system that displayed on the computer screen a photo of the workers current sitting posture together with the correct posture photo taken earlier during office training. Musculoskeletal risk was evaluated using the Rapid Upper Limb Assessment (RULA) method before, during and after the six weeks intervention. Both training methods provided effective short-term posture improvement; however, sustained improvement was only attained with the photo-training method. Both interventions had a greater effect on older workers and on workers suffering more musculoskeletal pain. The photo-training method had a greater positive effect on women than on men.

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

occupational exposure
ergonomics
telemedicine
feedback
task performance and analysis
algorithm


Capacity scaling of large wireless networks with heterogeneous clusters We analyze the capacity scaling laws of wireless networks where the spatial distribution of nodes over the network area exhibits a high degree of clustering. In particular we consider the presence of heterogeneous clusters, both in size and in population, which are common in many real systems. We completely characterize the scaling exponent of the resulting network capacity by providing upper and lower bounds which differ at most by a poly-logarithmic factor in the number of nodes.

O O O O B I 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 O O O O O O O O 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 Enhancement for User Equipments in LTE-A Downlink Physical Layer Network In this paper, we propose a real LTE-A downlink physical layer network with multiple relay stations (RSs). RSs improve the weak received signal at user equipments (UEs). LTE-A with RSs can be used to increase the coverage area of BSs and increase the system capacity. It also enhances the service of the user at cell edge and cover shadowed areas. The performance of the proposed LTE-A network is illustrated and modeled. We also take the effect of different environments scenarios of the WINNER Phase II channel model. The received signals of UEs scenarios are mathematically derived and analyzed in this paper. The weighted least square method for signal combining is mathematically analyzed. The performance of LTE-A with RSs is evaluated by calculating the SER and the capacity for a certain range of SNRs. The SER and capacity are calculated for different UEs scenarios to investigate the effect of RSs in LTE-A network. Simulation results reveal that UEs which receive multiple signals from RSs have low SER values for a certain range of SNRs and enhances the service performance of the UEs at cell edge.

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


Exact Legendre moment computation for gray level images A novel method is proposed for exact Legendre moment computation for gray level images. A recurrence formula is used to compute exact values of moments by mathematically integrating the Legendre polynomials over digital image pixels. This method removes the numerical approximation errors involved in conventional methods. A fast algorithm is proposed to accelerate the moment's computations. A comparison with other conventional methods is performed. The obtained results explain the superiority of the proposed method.

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


A knowledge-based approach to merging information There is an increasing need for technology for merging semi-structured information (such as structured reports) from heterogeneous sources. For this, we advocate a knowledge-based approach when the information to be merged incorporates diverse, and potentially complex, conflicts (inconsistencies). In this paper, we contrast the goals of knowledge-based merging with other technologies such as semantic web technologies, information mediators, and database integration systems. We then explain how a system for knowledge-based merging can be constructed for a given application. To support the use of a knowledgebase, we use fusion rules to manage the semi-structured information that is input for merging. Fusion rules are a form of scripting language that defines how structured reports should be merged. The antecedent of a fusion rule is a call to investigate the information in the structured reports and the background knowledge, and the consequent of a fusion rule is a formula specifying an action to be undertaken to form a merged report. Fusion rules are not necessarily a definitive specification of how the input can be merged. They can be used by the user to explore different ways that the input can be merged. However, if the user has sufficient confidence in the output from a set of fusion rules, they can be regarded as a definitive specification for merging, and furthermore, they can then be treated as a form of meta-knowledge that gives the provenance of the merged reports. The integrated usage of fusion rules with a knowledgebase offers a practical and valuable technology for merging conflicting information.

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

information integration
knowledge fusion
semi-structured information
knowledge merging
inconsistent information


Adaptive Continuous-Scale Morphology for Matrix Fields In this article we consider adaptive, PDE-driven morphological operations for 3D matrix fields arising e.g. in diffusion tensor magnetic resonance imaging (DT-MRI). The anisotropic evolution is steered by a matrix constructed from a structure tensor for matrix valued data. An important novelty is an intrinsically one-dimensional directional variant of the matrix-valued upwind schemes such as the Rouy-Tourin scheme. It enables our method to complete or enhance anisotropic structures effectively. A special advantage of our approach is that upwind schemes are utilised only in their basic one-dimensional version, hence avoiding grid effects and leading to an accurate algorithm. No higher dimensional variants of the schemes themselves are required. Experiments with synthetic and real-world data substantiate the gap-closing and line-completing properties of the proposed method.

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

mathematical morphology
pdes
dt-mri
tensor field
dilation
erosion


Geometric dynamics of nonlinear circuits and jump effects Purpose - This paper seeks to give an outline about the geometric concept of electronic circuits, where the jump behavior of nonlinear circuits is emphasized. Design/methodology/approach - A sketch of circuit theory in a differential geometric setting is given. Findings - It is shown that the structure of circuit theory can be given in a much better way than by means of a description of circuits using concrete coordinates. Furthermore, the formulation of a concrete jump condition is given. Originality/value - In this paper, an outline is given about the state of the art of nonlinear circuits from a differential geometric point of view. Moreover, differential geometric methods were applied to two example circuits (flip flop and multivibrator) and numerical results were achieved.

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


group synchronization control over haptic media in a networked real-time game with collaborative work This paper deals with group (or inter-destination) synchronization control over haptic media in the case where two groups each of which consists of two players play a networked real-time game in which the two players in each group work with each other collaboratively. The group synchronization control adjusts the output timing of haptic media among the players' terminals. We enhance the synchronization maestro scheme, which the authors previously proposed, for the control so that we can handle two reference output timings, to which the players' terminals adjust their output timings. We examine the influence of the determination methods of the reference output timings on the fairness among the players and the efficiency of the work. By experiment, we demonstrate the effectiveness of a method which employs two reference output timings. The method adjusts the output timing of a terminal with the smaller network latency in a group to that in the other group, and it also adjusts the remaining two output timings.

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

group synchronization control
experiment
haptic media
fairness
collaborative work


Enhancement of gettering efficiencies of different silicon substrates during a 0.18 ?m LTB CMOS process simulation : Stratigraphy by a novel chemical ultra-trace depth-profiling We have performed a gettering efficiency (GE) test at different stages in a 0.18 ?m LTB CMOS process simulation with maximal temperatures of 1000C. Four sorts of wafer substrates (epi, polished) were processed to the point before the step to be studied and then contaminated with 51012 atoms/cm2 Cu or Ni with a spin-on technique that was optimized for reproducibility. Afterwards, the wafers were process simulated and analyzed by ICP-MS in combination with a novel chemical depth-profiling procedure. Although none of the wafers showed detectable BMDs by preferential etching and FTIR measurements, BMDs could be found by LST measurements. Epitaxial p/p+ wafers exhibited an outstandingly high GE for Cu at each studied process step due to segregation gettering by the heavily boron doped substrate. Polished wafers showed a lower GE which increased with the process time. Thus, Cu gettering was a function of the size of oxygen precipitates. On the contrary, Ni gettering was not enhanced in epi wafers compared to the polished wafers. Also, no segregation gettering is assumed for Ni, however, a higher initial oxygen concentration led to a higher GE. Thus, Ni gettering is strongly influenced by the oxygen precipitate size, too. A more stable Cu and Ni gettering was found with BMD-densities of 109 cm?3, measured by LST, although preferential etching and FTIR measurements were below the detection limit.

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

gettering mechanisms
copper (cu)
nickel (ni)
silicon (si)
low-thermal-budget (ltb) cmos process


A family of random trees with random edge lengths We introduce a family of probability distributions on the space of trees with I labeled vertices and possibly extra unlabeled vertices of degree 3, whose edges have positive real lengths. Formulas for distributions of quantities such as degree sequence, shape, and total length are derived. An interpretation is given in terms of sampling from the inhomogeneous continuum random tree of Aldous and Pitman (1998). (C) 1999 John Wiley & Sons, Inc.

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

continuum tree
enumeration
spanning tree
weighted tree
cayley's multinomial expansion


Design of a nanopower current reference with reduced process variability In this paper we present the design of a 0.18 mu m CMOS current reference based on a variability-aware approach, in such a way to obtain a very low process sensitivity of the reference current. Its relative standard deviation is 1.4 % based on measurements performed over 23 samples from a single batch. The requirement of low process sensitivity is met together with the very low power consumption of 290 nW, at the cost of a large area occupation of 0.245 mm(2). Key to obtain this result are the use of the "classical" bipolar bandgap topology, which can be optimized for low-power/low-spread operation so as to outperform MOS-based bandgap circuits, and the use of devices that are intrinsically more stable towards process, such as diffusion resistors.

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

reference current generator
variability-aware design
analog design
low power cmos circuits


Interaction of a shock with a density disturbance via shock fitting An accurate solution to the problem of a normal shock moving into still fluid with a density variation is presented. The solution is obtained using a shock fitted approach and RungeKutta time integration. Uniform third order accuracy of the scheme us demonstrated. Comparisons with shock captured solutions show that the fitted solution presented here is more accurate.

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


Surrogate assisted-hybrid differential evolution algorithm using diversity control Evolutionary algorithms (EAs) being a major optimization framework, typically require a considerable number of function evaluations to locate an optimal solution for computationally intensive real-world optimization problems. In order to solve complex multimodal problems within a limited computational budget, surrogate models are integrated with EA. The overall performance of such algorithms not only depends on the construction and integration procedure of the model, but also on the efficiency of the underlying EA in overcoming premature convergence. This can be achieved through diversity control and parameter adaptation methodology in EAs. In this paper, an improved algorithm, namely Diversity Controlled Parameter adapted Differential Evolution with Local Search (DCPaDE-LS) is integrated into two dynamic surrogate models and two variants, namely Surrogate Assisted Parameter adapted Differential Evolution with Artificial Neural Networks and Response Surface Methodology (SAPDE-ANN and SAPDE-RSM) are proposed. They reduce the exact function evaluations for complex, multimodal problems. The performance of the proposed variants are compared on a set of 26 bound-constrained benchmark functions scalable with 10 and 30 dimensions, with respect to average number of function evaluations (NFE), success rate (SR) and % reduction in NFE in 30 independent trials. The SAPDE variants are compared with Self-adaptive Differential Evolution, DCPaDE-LS, Increasing Population Size Covariance Matrix Adaptation Evolution Strategy and Comprehensive Learning Particle Swarm Optimization. The SAPDE variants are able to reduce the NFE without loss in SR for all the functions. The algorithms are also validated using 12 solvable functions from CEC 2005. Of the two variants, SAPDE-ANN reports reduced NFE in more functions compared with SAPDE-RSM. Results reveal that the proposed SAPDE algorithm can be applied to real-world optimization problems.

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

surrogate models
local search
parameter adaptation


Vertically-partitioned parallel signature file method Recently, parallel signature file methods have been proposed for better retrieval performance in signature files. In this paper, we propose a vertically-partitioned parallel signature file (VPSF) method which can partition a signature file vertically. Our VPSF method uses an extendable hashing technique for dynamic environment and uses a frame-sliced signature file technique for efficient retrieval. Our VPSF method also can eliminate the data skew and the execution skew by allocating each frame to a processing node. To prove the efficiency of our VPSF method, we compare its performance with those of the conventional parallel signature file methods, i.e., HPSF and Hamming filter, in terms of retrieval time, storage overhead, and insertion time. The experimental result shows that our VPSF achieves about 40% better retrieval performance than the Hamming filter. In addition, we evaluate the performance of our VPSF methods on several normal distributions with half and double standard deviations of the real data. From the performance evaluation on record sets with half standard deviation, we show that our VPSF gains about 2050% improvement in retrieval time, compared with the Hamming filter and the HPSF. Finally, we show that our VPSF generally outperforms the conventional parallel signature files on retrieval performance when the records of a database are uniform in size.

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

parallel signature file
extendable hashing

information retrieval
multimedia data
vertical partition
frame-sliced signature


A Traffic Cellular Automaton with Estimation of Time to Collision We present a new traffic CA model in which each vehicle moves considering an estimated time for a following vehicle to catch up with the one ahead (Time-to-Collision: TTC), and investigate characteristics of the model with the simulation. We also analyze analytically the possibility of a collision between two cars in this model. The model is simulated under open boundary conditions and each car is parallel-updated. We show fundamental diagrams of the traffic flow in the simulation. In the diagrams, we find two distinct phases: a free flow and wide moving jam. Between the two phases, the region where the dots spread sparsely is seen clearly. In addition to this, by using different values of parameter, we can see the several patterns of the trajectory of vehicles. Based on these findings, we believe it is possible for this model to reproduce synchronized flow.

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

traffic flow
ttc
ca
cellular automaton
synchronized flow


Specification and verification of fault-tolerance, timing, and scheduling Fault-tolerance and timing have often been considered to be implementation issues of a program, quite distinct from the functional safety and liveness properties. Recent work has shown how these non-functional and functional properties can be verified in a similar way. However, the more practical question of determining whether a real-time program will meet its deadlines, i.e., showing that there is a feasible schedule, is usually done using scheduling theory, quite separately from the verification of other properties of the program. This makes it hard to use the results of scheduling analysis in the design, or redesign, of fault-tolerant and real-time programs. This article shows how fault-tolerance, timing, and schedulability can be specified and verified using a single notation and model. This allows a unified view to be taken of the functional and nonfunctional properties of programs and a simple transformational method to be used to combine these properties. It also permits results from scheduling theory to be interpreted and used within a formal proof framework. The notation and model are illustrated using a simple example.

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

theory verification schedulability specification

fault-tolerance
real time
transformation


when negative emotions effect positive change This paper introduces emotive aesthetics as visual language that expresses and/or evokes an emotion or a series of emotions from the target audience for a rhetorical purpose. (e.g. persuading them to make a positive change in a life-threatening behaviorial pattern). Historically, political graphics have been popular examples of products that use emotive aesthetics to promote positive social change. However, there's a problem today with the lack of time graphic designers have to devote their skills to the continued development of polemical products. A solution lies in broadening the scope of graphic design into a research discipline by demystifying the graphic design process with a methodological view of its components.

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

emotive aesthetics
social change
political graphics
graphic design process


Learning a factor model via regularized PCA We consider the problem of learning a linear factor model. We propose a regularized form of principal component analysis (PCA) and demonstrate through experiments with synthetic and real data the superiority of resulting estimates to those produced by pre-existing factor analysis approaches. We also establish theoretical results that explain how our algorithm corrects the biases induced by conventional approaches. An important feature of our algorithm is that its computational requirements are similar to those of PCA, which enjoys wide use in large part due to its efficiency.

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

high-dimensional data
covariance matrix estimation
regularization


Exploratory modeling of yeast stress response and its regulation with gCCA and associative clustering We model dependencies between m multivariate continuous-valued information sources by a combination of (i) a generalized canonical correlations analysis (gCCA) to reduce dimensionality while preserving dependencies in m - 1 of them, and (ii) summarizing dependencies with the remaining one by associative clustering. This new combination of methods avoids multiway associative clustering which would require a multiway contingency table and hence suffer from curse of dimensionality of the table. The method is applied to summarizing properties of yeast stress by searching for dependencies (commonalities) between expression of genes of baker's yeast Saccharomyces cerevisiae in various stressful treatments, and summarizing stress regulation by finally adding data about transcription factor binding sites.

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

canonical correlation analysis (cca)
exploratory data analysis
gene expression


A cognitive model for predicting esthetical judgements as similarity to dynamic prototypes ? We present a framework for cognitive modeling of esthetic decision making based on dynamic prototypes. Starting point of our work is empirical evidence which shows that subjects initial ratings of attractiveness of objects can be influenced by adapting them to new, typically more innovative objects. The framework consists of three steps: (1) Estimating an initial prototype from the ratings, (2) adapting the prototype due to the impact of the new objects, and (3) predicting the attractiveness ratings for subsequently presented object by their similarity to the adapted prototype. The framework allows representation of prototypes and objects as feature vectors containing metrical or categorial attributes or as structural representations. Within the framework, a variety of similarity measures and similarity-to-rating mappings can be explored to gain more precise insight into the cognitive processes underlying esthetical appreciations. We instantiated the framework for a first set of data obtained in a psychological experiment. In this experiment subjects rated the attractiveness of an initial set of chairs which varied in length of the backrest and the saturation of the color. Subjects then were adapted to a new set of chairs with extreme values on both dimensions. Finally, subjects again rated the initial objects. The framework was instantiated with an e-function to model the non-linear effects of variations in length and saturation on the judgements. Although there were only 25 data points per subject, we got satisfying results in predicting the shift of esthetical judgements due to adaptation to novel stimuli.

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

prototypes
esthetic decision making
cognitive modeling


can an inter-disciplinary research community on location privacy be successful? The newly starting MODAP project (www.modap.org), funded by EU FP7 Future and Emerging Technologies Programme with nearly one million euro funding for three years, aims to coordinate and boost the research activities in the intersection of mobility, data mining, and privacy. The key challenge is to gather an interdisciplinary community of people including, lawyers, psychologists, computer scientists, geographers, and end-users. This panel discusses opportunities, challenges and risks.

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


Reading performance as screening tool for visual complaints from stereoscopic content Some people experience visual discomfort when watching stereoscopic content, which to a large extent can be predicted by their binocular visual status. Earlier research has proven that the binocular status can be assessed by the difference in reading speed between 2-D and 3-D. In this paper, we further substantiate the evidence for a tool to screen people on their susceptibility to such visual complaints based on this reading speed difference. In an experiment participants were asked to (1) perform the Wilkins Rate of Reading Test (WRRT) at three disparities (?1.5, 0 and 1.5) preceded and followed by fusion measurements and self-reports, and (2) scale the screen disparity of stimuli to a threshold of visual discomfort. Participants were categorized based on the WRRT-ratio, being the ratio of the number of words read at 0 disparity over the number of words read at ?1.5 disparity. Our results showed that only participants with a high WRRT-ratio revealed a tendency in changed fusion range indicating visual fatigue. They also reported significantly more visual discomfort in stereoscopic conditions and had lower thresholds in screen disparity for visual discomfort than participants with a normal WRRT-ratio. Hence, the WRRT-ratio has potential as a visual screening tool in 3-D consumer applications to warn viewers that are susceptible to visual discomfort when watching stereoscopic content.

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

visual discomfort
visual fatigue
reading performance
screening tool


visualizing relativistic effects in spacetime We have developed an innovative ray-tracing algorithm to describe R elativistic E ffects in S pace T ime (REST). Our algorithm, called REST-frame , simulates a generalized world in Spacetime and gives the fine details implicit in the Special Theory of Relativity that have not yet been made apparent. These novel simulations disclose the non-intuitive realm of Special Relativity and, by visualization means, advance beyond the findings of past revelations concerning relativistic effects. Through the application of state-of-the-art computation technology and simulation techniques to earlier quests in Physics, REST-frame offers a flexible visualization tool to study some of the most exciting aspects of the natural world; particularly, the rich visual properties associated with the finite speed of light.

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

visualization simulation computation tool theory algorithm

innovating
applications
aspect
technologies
ray tracing
association
flexibility
physical
general
relation
art
effect
lighting


Enhancing Routing Robustness of Unstructured Peer-to-Peer Networks Using Mobile Agents The growing popularity of Peer-to-Peer (P2P) technology in real applications in recent years has sparked increasing interest from both academia and industry in designing resilient P2P networks for these applications. Routing is a crucial technique to support successful P2P applications, and designing robust routing mechanisms is still a technical challenge for P2P systems and applications due to their inherent dynamics. This paper addresses the issue of resilient routing in unstructured P2P networks. To this end, we first propose a novel query routing approach to improving query performance in unstructured P2P networks, and then develop a mobile agent based network reconfiguration mechanism that provides a combined node and link failure diagnosis and restoration to maintain routing performance even in dynamic network environments. Simulated results show that the proposed query routing approach can achieve a good tradeoff between query hit rates and space costs in scale-free networks and that the mobile agent based network reconfiguration mechanism outperforms the existing methods in different types of network topologies.

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

routing
reconfiguration mechanism
mobile agents

peer-to-peer networks
failure restoration


integrating back, history and bookmarks in web browsers Most Web browsers include Back, History and Bookmark facilities that simplify how people return to previously seen pages. While useful, these three facilities all operate on quite different underlying models, which undermines their usability. Our alternative revisitation system uses a single model of a recency-ordered history list to integrate Back, History and Bookmarks. Enhancements include: Back as a way to step through this list; implicit and explicit 'dog-ears' to mark pages on the list (replacing Bookmarks); searching/filtering the list through dynamic queries; and visual thumbnails to promote page recognition.

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

model history bookmark usability recognition revisitation dynamic

web browser
paging
www
visualization
systems
filtering
integrability
browser design
navigation


Prediction and optimization of depth of penetration for stainless steel gas tungsten arc welded plates using artificial neural networks and simulated annealing algorithm The quality of a weld joint is highly influenced by depth of penetration. Hence, accurate prediction and maximization of depth of penetration is highly essential to ensure a good-quality joint. This paper highlights the development of neural network model for predicting depth of penetration and optimizing the process parameters for maximizing depth of penetration using simulated annealing algorithm. The process parameters chosen for the study are welding current, welding speed, gas flow rate and welding gun angle. The chosen output parameter was depth of penetration. The experiments were conducted based on design of experiments using fractional factorial with 125 runs. Using the experimental data, feed-forward backpropagation neural network model was developed and trained using LevenbergMarquardt algorithm. It was found that ANN model based on network 4-15-1 predicted depth of penetration more accurately. A mathematical model was also developed correlating the process parameters with depth of penetration for doing optimization. A source code was developed in MATLAB to do the optimization. The optimized process parameters gave a value of 3.778mm for depth of penetration.

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

artificial neural networks
fractional factorial
simulated annealing
depth of penetration


Symmetry-based 3-D reconstruction from perspective images ? Symmetry is an important geometric cue for 3-D reconstruction from perspective images. In this paper, we introduce a unified theoretical framework for extracting poses and structures of 2-D symmetric patterns in space from calibrated images. The framework uniformly encompasses all three fundamental types of symmetry, i.e., reflective, rotational, and translational, based on a systematic study of the homography groups in image induced by the symmetry groups in space. We claim that if a planar object admits rich enough symmetry, no 3-D geometric information is lost through perspective imaging. Based on two fundamental principles that utilize common spatial relations among symmetric objects, we have developed a prototype system which can automatically extract and segment multiple 2-D symmetric patterns present in a single perspective image. The result of such a segmentation is a hierarchy of new geometric primitives, called symmetry cells and complexes, whose 3-D structures and poses are fully recovered. Finally, we propose a new symmetry-based matching technique, which can effectively establish correspondences among the extracted symmetry cells across multiple images. We demonstrate the application of the proposed algorithms on image segmentation, matching, and 3-D reconstruction with extensive experimental results. The algorithms and systems are more accurate and easier to implement than existing point- or line-based methods.

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

structure from symmetry
symmetry group
homography group
symmetry-based matching
3-d reconstruction


Optimization of cascade stilling basins using GA and PSO approaches In high head dams, the kinetic energy at the spillway toe is very high and the tail-water depth available for energy dissipation is relatively small. Cascade stilling basins are energy dissipation systems for high head dams, the design of which is based on a trial-and-error procedure. Although such an approach yields feasible designs in which hydraulic and topographic considerations are met, there may exist many cost-effective designs. Therefore, optimization tools can help find the least construction cost while keeping hydraulic and topographic considerations satisfied. Particle Swarm Optimization (PSO) and Genetic Algorithms (GA) were used to determine the optimal design of cascade stilling basins in terms of the height of falls and length of stilling basins. The approach was evaluated by application to the design of an energy dissipation system for the Tehri Dam on the Bhagirathi River. Comparison of the proposed methods with dynamic programming and an alternative approach not utilizing an optimization tool revealed that GA and PSO lead to significant savings in the construction cost with less computational effort.

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

construction cost
high head dams
spillway

evolutionary algorithms
sensitivity
tail-water


New adaptive artificial viscosity method for hyperbolic systems of conservation laws We propose a new finite volume method for solving general multidimensional hyperbolic systems of conservation laws. Our method is based on an appropriate numerical flux and a high-order piecewise polynomial reconstruction. The latter is utilized without any computationally expensive nonlinear limiters, which are typically needed to guarantee nonlinear stability of the scheme. Instead, we enforce stability of the proposed method by adding a new adaptive artificial viscosity , whose coefficients are proportional to the size of the weak local residual, which is sufficiently large (?? ? , where ? ? is a discrete small scale) at the shock regions, much smaller (??? ? ? , where ? ? is close to 2) near the contact waves, and very small (??4 ? 4 ) in the smooth parts of the computed solution. We test the proposed scheme on a number of benchmarks for both scalar conservation laws and for one- and two-dimensional Euler equations of gas dynamics. The obtained numerical results clearly demonstrate the robustness and high accuracy of the new method.

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

hyperbolic systems of conservation laws
weak local residual
artificial viscosity


on delineability of varieties in cad-based quantifier elimination with two equational constraints Let V ? R r denote the real algebraic variety defined by the conjunction f = 0 ? g = 0, where f and g are real polynomials in the variables x 1 , ..., x r and let S be a submanifold of R r -2 . This paper proposes the notion of the analytic delineability of V on S with respect to the last 2 variables . It is suggested that such a notion could be useful in solving more efficiently certain quantifier elimination problems which contain the conjunction f = 0 ? g = 0 as subformula, using a variation of the CAD-based method. Two bi-equational lifting theorems are proved which provide the basis for such a method.

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


Characterizing free-living light exposure using a wrist-worn light monitor It was the purpose of this study to pilot the use of a new wrist-worn light monitoring device to document that indoor lighting for a particular day-shift work environment could serve as the primary light exposure dosage in healthy free-living humans. Twelve employees of a local hospital volunteered to wear a wrist-worn light monitor during all waking hours for an entire workweek (MondayFriday). Light data were analyzed (3-Factor RM ANOVA) for the dose of light exposure (minutes of exposure x light intensity) within six light intensity categories ( 1000lx) relative to time spent within their work environment and all other time of the day. The greatest dose of exposure occurred within the 201500lx range during the subjects work shift. These data support the premise of others that long term exposure to dim indoor light intensities commonly experienced within a variety of work environments may serve as the primary entrainment factor for physiological and behavioral processes following a circadian rhythm.

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


adaptive computer assisted instruction (cai) for students with dyscalculia (learning disability in mathematics) Dyscalculia refers to a persistent difficulty in the learning or understanding of number concepts (e.g. 4 > 5), counting principles (e.g. cardinality -- that the last word tag, such as "four", stands for the number of counted objects), or arithmetic (e.g. remembering that 2 + 3 = "5"). These difficulties are often called a mathematical disability. Learning-disability (LD) students face difficulties in processing and retaining information and thus have problems in time keeping up with classroom instruction. It follows that students with dyscalculia may have difficulty with numerical operations, both in terms of understanding the process of the operation and in carrying out the procedure. Further difficulties may arise in understanding abstract mathematical concepts, symbolic and graphical representations. The lack of specialized teacher training, as well as unavailability of effective study material and traditional LD-friendly curricula further worsen the educational problems Learning-Disabled student must challenge. Here we develop a E-learning and an Adaptive E-learning tool, that trains dyscalculia children on an entertaining numerical comparison task, by presenting problems adapted to the performance level of individual child and the adaptation was implemented using Multidimensional Learning Algorithm to constantly adapt the difficulty of the problem to the Childs difficulty level. This Multimedia tool for students with math learning disabilities gives students an opportunity to maximize learning and skill improvement through Educational software. Multimedia tutoring provides students the opportunity to proceed at a self-guided pace with immediate feedback.

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

e-learning
multi dimensional learning algorithm
learning disability (ld)
adaptive e-learning


A self-healing clustering algorithm for underwater sensor networks Underwater wireless sensor networks (UWSNs) is a novel networking paradigm to explore aqueous environments. The characteristics of mobile UWSNs, such as low communication bandwidth, large propagation delay, floating node mobility, and high error probability, are significantly different from terrestrial wireless sensor networks. Energy-efficient communication protocols are thus urgently demanded in mobile UWSNs. In this paper, we develop a novel clustering algorithm that combines the ideas of energy-efficient cluster-based routing and application-specific data aggregation to achieve good performance in terms of system lifetime, and application-perceived quality. The proposed clustering technique organizes sensor nodes into direction-sensitive clusters, with one node acting as the head of each cluster, in order to fit the unique characteristic of up/down transmission direction in UWSNs. Meanwhile, the concept of self-healing is adopted to avoid excessively frequent re-clustering owing to the disruption of individual clusters. The self-healing mechanism significantly enhances the robustness of clustered UWSNs. The experimental results verify the effectiveness and feasibility of the proposed algorithm.

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

underwater sensor networks (uwsns)
energy efficiency
cluster head
self healing


Spectral clustering with density sensitive similarity function In recent years, spectral clustering has become quite popular for data analysis because it can be solved efficiently by standard linear algebra tools and do not suffer from the problem of local optima. The clustering effect by using such spectral method, however, depends heavily on the description of similarity between instances of the datasets. In this paper, we defined the adjustable line segment length which can adjust the distance in regions with different density. It squeezes the distances in high density regions while widen them in low density regions. And then a density sensitive distance measure satisfied by symmetric, non-negative, reflexivity and triangle inequality was present, by which we can define a new similarity function for spectral clustering. Experimental results show that compared with conventional Euclidean distance based and Gaussian kernel function based spectral clustering, our proposed algorithm with density sensitive similarity measure can obtain desirable clusters with high performance on both synthetic and real life datasets.

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

spectral clustering
density sensitive
similarity function


Piecewise constant level set method for topology optimization of unilateral contact problems The paper deals with the structural optimization of the elastic body in unilateral contact with a rigid foundation using the level set approach. A piecewise constant level set method is used to represent the evolution of interfaces rather than the standard method. The piecewise constant level set function takes distinct constant values in each subdomain of a whole design domain. Using a two-phase approximation the original structural optimization problem is reformulated as an equivalent constrained optimization problem in terms of the piecewise constant level set function. Necessary optimality condition is formulated. Finite difference and finite element methods are applied as the approximation methods. Numerical examples are provided and discussed.

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

unilateral contact problems
topology optimization
necessary optimality condition
piecewise constant level set method

augmented lagrangian method
uzawa method


Transform and embedded coding techniques for maximum efficiency and random accessibility in 3-D scalable compression This study investigates random accessibility and efficiency enhancements in highly scalable video and volumetric compression. With the advent of interactive multimedia technology, random accessibility has emerged as an increasingly important consideration in the design and optimization process. In this paper, we assess the impact that the transform, embedded coding components, and code-block configurations have on the compression efficiency and accessibility of a scalable codestream. We develop performance bounds on techniques which exploit temporal redundancy within the confines of a feed-forward compression system. We also examine their random access properties to argue the significance of motion-adaptive subband transforms. When information-theoretic measures are used to determine the potential benefits of three-dimensional (3-D) context coding, we find that most of the coding gain is attributed to code-block extension, rather than interstice context modeling itself. To gain further insight into the tradeoffs that the coding part has to offer, we run a series of simulations to determine code-block partitioning strategies which maximize reconstruction quality and space-time localization. The LIMAT framework and EBCOT coding paradigm have laid a solid foundation for further progress in the development of highly scalable 3-D compression systems.

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

context modeling
random accessibility
scalable compression

coding efficiency
motion-adaptive transform


compressing java class files Java class files are often distributed as jar files, which are collections of individually compressed class files (and possibility other files). Jar files are typically about 1/2 the size of the original class files due to compression. I have developed a wire-code format for collections of Java class files. This format is typically 1/2 to 1/5 of the size of the corresponding compressed jar file (1/4 to 1/10 the size of the original class files).

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


Beat-to-beat QT interval variability before and after cardiac surgery Non-uniform recovery of excitability may be essential in triggering malignant ventricular tachycardia after cardiac surgery. Thirty-five channels ECG was recorded for in 27 patients before and after heart surgery and in 20 control subjects. Off-line analysis was performed. RR interval duration, RR SD, QT SD and power spectra of RR variability were computed from stable RR and QT interval series. When compared to controls, patients had decreased RR SD and increased QT SD before surgery (p<0.002 and p<0.0005, respectively); RR SD further decreased and QT SD increased after the surgery (p<0.0001 and p<0.0002, respectively). Increase of QT variability and decrease of RR variability after cardiac surgery may reflect disrupted electrophysiological stability of the myocardium and thus electrophysiological substrate for triggering malignant arrhythmia.

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

qt variability
rr variability
cardiac surgery


Load-prediction scheduling algorithm for computer simulation of electrocardiogram in hybrid environments Sorting tasks and allocating it to different computing components. Various computing units bear reasonable iteration amounts by scheduling algorithm. Setting up a dynamic window regarding to different hardware. Reducing computing time dramatically with our original algorithm. An application of interdiscipline of computer science and medicine.

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

computer simulation of ecg
load-prediction scheduling
sliding window mechanism


Point-free program transformation Functional programs are particularly well suited to formal manipulation by equational reasoning. In particular, it is straightforward to use calculational methods for program transformation. Well-known transformation techniques, like tupling or the introduction of accumulating parameters, can be implemented using calculation through the use of the fusion (or promotion) strategy. In this paper we revisit this transformation method, but, unlike most of the previous work on this subject, we adhere to a pure point-free calculus that emphasizes the advantages of equational reasoning. We focus on the accumulation strategy initially proposed by Bird, where the transformed programs are seen as higher-order folds calculated systematically from a specification. The machinery of the calculus is expanded with higher-order point-free operators that simplify the calculations. A substantial number of examples (both classic and new) are fully developed, and we introduce several shortcut optimization rules that capture typical transformation patterns.

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

program transformation
accumulation strategy

functional programming
program calculation
point-free programming


Accelerating FPGA Routing Through Parallelization and Engineering Enhancements Special Section on PAR-CAD 2010 We present parallelization and heuristic techniques to reduce the run-time of field-programmable gate array (FPGA) negotiated congestion routing. Two heuristic optimizations provide over 3x speedup versus a sequential baseline. In our parallel approach, sets of design signals are assigned to different processor cores and routed concurrently. Communication between cores is through the message passing interface communications protocol. We propose a geographic partitioning of signals into independent sets to help minimize the communication overhead. Our parallel implementation provides approximately 2.3x speedup using four cores and produces deterministic/repeatable results. When combined, the parallel and heuristic techniques provide over 7x speedup with four cores versus the router in the widely used Versatile Place and Route (VPR) FPGA placement/routing framework, with no significant impact on circuit speed or wirelength.

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

fast routing
fpgas
parallel cad
parallel fpga routing


Wave propagation in locally perturbed periodic media (case with absorption): Numerical aspects We are interested in the numerical simulation of wave propagation in media which are a local perturbation of an infinite periodic one. The question of finding artificial boundary conditions to reduce the actual numerical computations to a neighborhood of the perturbation via a DtN operator was already developed in [1] at the continuous level. We deal in this article with the numerical aspects associated to the discretization of the problem. In particular, we describe the construction of discrete DtN operators that relies on the numerical solution of local cell problems, non stationary Ricatti equations and the discretization of non standard integral equations in Floquet variables.

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

wave propagation
periodic media
dtn operators


constructing a metacircular virtual machine in an exploratory programming environment Can virtual machine developers benefit from religiously observing the principles more often embraced for exploratory programming? To find out, we are concurrently constructing two artifacts--a Self VM entirely in Self (the Klein VM), and a specialized development environment--with strict adherence to pure object-orientation, metacircularity, heavy code reuse, reactivity, and mirror-based reflection. Although neither artifact is yet complete, the environ-ment supports many remote debugging and incremental update operations, and the exported virtual machine has successfully run the whole compiler.As a result of our adherence to these principles, there have been both positive and negative consequences. We have been able to find and exploit many opportunities for parsimony. For example, the very same code creates objects in the bootstrap image, builds ob-jects in the running VM, and implements a remote debugger. On the other hand, we have been forced to expend effort to optimize the performance of the environment. Overall, this approach trades off the performance of the environment against the architectural sim-plicity and ease of development of the resulting VM artifact. As computers continue to improve in performance, we believe that this approach will increase in value.

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

code reuse
self
debugger
virtual machine
klein
exploratory programming
metacircularity
reactivity

remote reflection
fix-and-continue
meta-recursive
mirror-based reflection
liveness
object oriented
lenses
prototypes


question answering system with recommendation using fuzzy relational product operator When a user finds the answer using question answering system, sometimes the user may not be satisfied with answers. This is because it is difficult to deliver the intention of a user question to the system due to the lack of expression ability and polysemy and etc. So, the system must provide additional ways to search the correct answers. In this paper, we propose a new method to recommend questions that can satisfy the purpose of user question with high probability. We define the supplementary similarity to calculate the similarity between sentences which have a few common terms. And we define the fuzzy relation product operator to find the questions that are recommended when user is not satisfied with the answers. User can select the question among the list of recommended questions and has more chance to find the answers that the user can be satisfied with. We experiment and show that the performance of the system gets high as the recommendation is repeated.

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

question answering system
fuzzy relational product operator
supplementary similarity


A novel heterogeneous algorithm to simulate multiphase flow in porous media on multicore CPUGPU systems Multiphase flow implementations of the lattice Boltzmann method (LBM) are widely applied to the study of porous medium systems. In this work, we construct a new variant of the popular color LBM for two-phase flow in which a three-dimensional, 19-velocity (D3Q19) lattice is used to compute the momentum transport solution while a three-dimensional, seven velocity (D3Q7) lattice is used to compute the mass transport solution. Based on this formulation, we implement a novel heterogeneous GPU-accelerated algorithm in which the mass transport solution is computed by multiple shared memory CPU cores programmed using OpenMP while a concurrent solution of the momentum transport is performed using a GPU. The heterogeneous solution is demonstrated to provide speedup of 2.6 2.6 as compared to multi-core CPU solution and 1.8 1.8 compared to GPU solution due to concurrent utilization of both CPU and GPU bandwidths. Furthermore, we verify that the proposed formulation provides an accurate physical representation of multiphase flow processes and demonstrate that the approach can be applied to perform heterogeneous simulations of two-phase flow in porous media using a typical GPU-accelerated workstation.

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

cuda
heterogeneous computing
graphics processor


Backward compatible HDR stereo matching: a hybrid tone-mapping-based framework Stereo matching under complex circumstances, such as low-textured areas and high dynamic range (HDR) scenes, is an ill-posed problem. In this paper, we introduce a stereo matching approach for real-world HDR scenes which is backward compatible to conventional stereo matchers. For this purpose, (1) we compare and evaluate the tone-mapped disparity maps to find the most suitable tone-mapping approach for the stereo matching purpose. Thereof, (2) we introduce a combining graph-cut based framework for effectively fusing the tone-mapped disparity maps obtained from different tone-mapped input image pairs. And finally, (3) we generate reference ground truth disparity maps for our evaluation using the original HDR images and a customized stereo matching method for HDR inputs. Our experiments show that, combining the most effective features of tone-mapped disparity maps, an improved version of the disparity is achieved. Not only our results reduce the low dynamic range (LDR), conventional disparity errors by the factor of 3, but also outperform the other well-known tone-mapped disparities by providing the closest results to the original HDR disparity maps.

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

stereo matching
low dynamic range
high dynamic range

tone mapping
disparity map
markov random field
graph cut


Seeing the Objects Behind the Dots: Recognition in Videos from a Moving Camera Category-level object recognition, segmentation, and tracking in videos becomes highly challenging when applied to sequences from a hand-held camera that features extensive motion and zooming. An additional challenge is then to develop a fully automatic video analysis system that works without manual initialization of a tracker or other human intervention, both during training and during recognition, despite background clutter and other distracting objects. Moreover, our working hypothesis states that category-level recognition is possible based only on an erratic, flickering pattern of interest point locations without extracting additional features. Compositions of these points are then tracked individually by estimating a parametric motion model. Groups of compositions segment a video frame into the various objects that are present and into background clutter. Objects can then be recognized and tracked based on the motion of their compositions and on the shape they form. Finally, the combination of this flow-based representation with an appearance-based one is investigated. Besides evaluating the approach on a challenging video categorization database with significant camera motion and clutter, we also demonstrate that it generalizes to action recognition in a natural way.

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

object recognition
segmentation
tracking
video analysis


Inventory management of multi-item systems with order size constraint Manufacturing and transportation costs have increased substantially in recent years as demands for raw materials and fossil-based energy continue to grow. To buffer potential loss and increase order quantity, manufacturers often specify requirements when retailers place orders. One widely applied practice is to set up a minimum order size requirement, which is largely driven to achieve improved economies in the production and transportation processes. Many buyers, on the other hand, are left perplexed as to how to effectively establish their inventory policies. In this article, we study a multi-item model in which a retailer faces a minimum order size requirement from its manufacturer and the demands for these items are stochastic. In particular, the total order size of all items has to be at least the minimum order size whenever the retailer decides to place an order. We construct the exact model and develop an accurate lower bound approximation. To better understand the dynamics of the system and the ordering behaviour, we characterise important properties and based on which we propose effective heuristic strategies of simple structure for the multi-item model. Through extensive numerical studies, we show that the policies are consistently robust under a variety of different parameters. Important insights into the systems are also provided.

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

multi-item
inventory model
approximations
heuristics
dynamic programming


SoCDAL: System-on-chip design accelerator Time-to-market pressure and the ever-growing design complexity of multiprocessor system-on-chips have demanded an efficient design environment that enables fast exploration of large design space. In this article, we introduce a new design environment, called SoCDAL, for accelerating multiprocessor system-on-chip design through fast design-space exploration targeting real-time multimedia systems. SoCDAL is a set of mostly automated tools covering system specification,, hardware/software estimation, application-to-architecture mapping, simulation model generation, and system verification through simulation. For system specification, the process network model has been widely used for system specification because of its modeling capability. However, it is hard to use for real-time systems design, since its behavior cannot be estimated statically. We introduce a new approach which enables analyzing a process network model statically with some restrictions. For the hardware/software estimation, we analyze codes statically. Application-to-architecture mapping process implements a novel algorithm to support an arbitrary number of processors, with performance evaluation by static scheduling considering communication behavior. Mapping results are used to generate simulation models automatically at several transaction levels to be pipelined to a commercial tool. We show the effectiveness of our approaches by some experimental results with multimedia applications such as JPEG, H.263, and H.264 encoders, as well as an H.264 decoder.

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