Nonlinear L2-by-3 transform for PAPR reduction in OFDM systems ? Orthogonal frequency division multiplexing (OFDM), the multicarrier modulation technique with high bandwidth efficiency and robustness against multipath fading, is used in several high-speed broadband communication systems including digital video broadcasting (DVB), digital audio broadcasting (DAB), asymmetric digital subscriber line (ADSL), wireless local area network (WLAN IEEE 802.11a,g), high performance radio local area network (HIPERLAN 2), and worldwide interoperability for microwave access (WiMAX IEEE 802.16). However, the transmit signal in OFDM system has a high peak-to-average power ratio (PAPR), one of the major drawbacks of multicarrier transmission, and therefore high dynamic range is required in both the digital to analog converter (DAC) and the power amplifier (PA) for proper operation. Otherwise, the nonlinearities of PA cause out-of-band distortion and increase in bit error rate (BER). Therefore, the reduction in PAPR in OFDM system is desirable in order to obtain power efficiency and increase BER performance. In this paper, a new parametric PAPR reduction technique, L2-by-3 transform from sliding norm transform (SNT) family is proposed. Based on its parameter, a significant PAPR reduction is obtained. This paper presents the analysis of power saving and computational complexity of the proposed method L2-by-3 and comparison to two other methods; selected mapping and partial transmit sequence.

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

wireless lan
peak-to-average power ratio


Flexibility and decoupling in Simple Temporal Networks ? We propose a new metric to determine the flexibility of a Simple Temporal Network (STN). After reviewing some existing flexibility metrics, we conclude that these metrics fail to capture the dependencies between events specified in the STN. As a consequence, these metrics will usually overestimate the available flexibility in such a system. We propose to use an intuitively more acceptable flexibility metric. This metric is based upon the notion of an interval schedule for an STN. Such an interval schedule specifies an interval for every event in the STN in such a way that, for every event, we are free to choose a starting time within its interval independently from the choice made for other events. We show that an interval schedule that maximizes our flexibility metric is computable in low-order polynomial time. As byproducts of this flexibility metric, we discuss simple solutions to problems in STNs with uncertainty (STNUs) and temporal decoupling in STNs. With respect to the latter we show that after computing our flexibility metric, we get a decomposition of the STN almost for free. Even more importantly, we show that contrary to popular belief, such a decomposition does not affect the flexibility of the original STN.

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


mental models, consistency and programming aptitude Learning to program is notoriously difficult. Substantial failure rates plague introductory programming courses the world over, and have increased rather than decreased over the years. Despite a great deal of research into teaching methods and student responses, there have been to date no strong predictors of success in learning to program. Two years ago we appeared to have discovered an exciting and enigmatic new predictor of success in a first programming course. We now report that after six experiments, involving more than 500 students at six institutions in three countries, the predictive effect of our test has failed to live up to that early promise. We discuss the strength of the effects that have been observed and the reasons for some apparent failures of prediction.

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


a meta-learning approach for text categorization We investigate a meta-model approach, called Meta-learning Using Document Feature characteristics (MUDOF), for the task of automatic textual document categorization. It employs a meta-learning phase using document feature characteristics. Document feature characteristics, derived from the training document set, capture some inherent category-specific properties of a particular category. Different from existing categorization methods, MUDOF can automatically recommend a suitable algorithm for each category based on the category-specific statistical characteristics. Hence, different algorithms may be employed for different categories. Experiments have been conducted on a real-world document collection demonstrating the effectiveness of our approach. The results confirm that our meta-model approach can exploit the advantage of its component algorithms, and demonstrate a better performance than existing algorithms.

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

training
task
exploit
performance
demonstrate
algorithm
feature
text categorization
component

statistics method collect meta-model categorical experience learning documentation effect


Detecting distributed denial-of-service attacks using Kolmogorov complexity metrics This paper describes an approach to detecting distributed denial of service (DDoS) attacks that is based on fundamentals of Information Theory, specifically Kolmogorov Complexity. A theorem derived using principles of Kolmogorov Complexity states that the joint complexity measure of random strings is lower than the sum of the complexities of the individual strings when the strings exhibit some correlation. Furthermore, the joint complexity measure varies inversely with the amount of correlation. We propose a distributed active network-based algorithm that exploits this property to correlate arbitrary traffic flows in the network to detect possible denial-of-service attacks. One of the strengths of this algorithm is that it does not require special filtering rules and hence it can be used to detect any type of DDoS attack. We implement and investigate the performance of the algorithm in an active network. Our results show that DDoS attacks can be detected in a manner that is not sensitive to legitimate background traffic.

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

denial-of-service attack
entropy
complexity probes


Discrimination of squamous cell carcinoma in situ from seborrheic keratosis by color analysis techniques requires information from scale, scale-crust and surrounding areas in dermoscopy images Scale-crust, also termed keratin crust, appears as yellowish-to-tan scale on the skin's surface. It is caused by hyperkeratosis and parakeratosis in inflamed areas of squamous cell carcinoma in situ (SCCIS, Bowen's disease) and is a critical dermoscopy feature for detecting this skin cancer. In contrast, scale appears as a white-to-ivory detaching layer of the skin, without crust, and is most commonly seen in benign lesions such as seborrheic keratoses (SK). Distinguishing scale-crust from ordinary scale in digital dermoscopy images holds promise for early SCCIS detection and differentiation from SK. Reported here are image analysis techniques that best characterize scale-crust in SCCIS and scale in SK, thereby allowing accurate separation of these two dermoscopic features. Classification using a logistic regression operating on color features extracted from these digital dermoscopy structures can reliably separate SCCIS from SK.

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

squamous cell carcinoma
seborrheic keratosis
scale
crust
dermoscopy


Texture Analysis and Segmentation Using Modulation Features, Generative Models, and Weighted Curve Evolution In this work, we approach the analysis and segmentation of natural textured images by combining ideas from image analysis and probabilistic modeling. We rely on AM-FM texture models and, specifically, on the Dominant Component Analysis (DCA) paradigm for feature extraction. This method provides a low-dimensional, dense, and smooth descriptor, capturing the essential aspects of texture, namely, scale, orientation, and contrast. Our contributions are at three levels of the texture analysis and segmentation problems: First, at the feature extraction stage, we propose a Regularized Demodulation Algorithm that provides more robust texture features and we explore the merits of modifying the channel selection criterion of DCA. Second, we propose a probabilistic interpretation of DCA and Gabor filtering in general, in terms of Local Generative Models. Extending this point of view to edge detection facilitates the estimation of posterior probabilities for the edge and texture classes. Third, we propose the Weighted Curve Evolution scheme that enhances curve evolution-based segmentation methods by allowing for the locally adaptive combination of heterogeneous cues. Our segmentation results are evaluated on the Berkeley Segmentation Benchmark and compare favorably to current state-of-the-art methods.

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

texture analysis
demodulation
generative models
curve evolution

image segmentation
am-fm models
cue combination


robust pre-processing techniques for ocr applications on mobile devices Text detection and recognition in natural images using a single mobile device is becoming relevant due to the increasing interest in Optical Character Recognition (OCR) applications. OCR application on mobile devices is no longer a dream due to the advancement in mobile technology. There are many ongoing researches in this field. Most of the researches focus on the OCR engine of the application and there is not much focus on the processing stage of the OCR application. Pre-processing plays a major role in optimizing the image for character recognition. Thus, in this paper, two pre-processing techniques are proposed for the mobile OCR application. The first technique helps to locate a sign in a natural image efficiently, while the second technique implements Otsu's threshold algorithm to convert images into binary image. These techniques are implemented in an OCR mobile application which is developed using desktop open sources library. After implementation, the OCR application is tested with 50 sign images to verify the accuracy. Experimental results have demonstrated that these techniques can significantly improve the OCR accuracy and decrease the overall computation time.

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

ocr
optical character recognition
mobile device


Contextual affect sensing and metaphor interpretation Sensing social representations (e.g. relationships and common interests) of a conversation and recognizing affect and metaphor from context are challenging but essential for the building of an intelligent agent with emotion and social intelligence. In this paper, we report contextual affect detection based on emotion modeling of personal and social improvisational context. We also discuss cooking and sensory metaphor (including temperature, light, taste, and smell metaphors) interpretation. The overall affect sensing model has been embedded in an AI agent interacting with human users. The evaluation results indicated that the new development made the AI agent perform generally better in improvisational interaction.

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

contextual affect sensing
metaphor interpretation

drama improvisation and intelligent agents


Objective evaluation of approaches of skin detection using ROC analysis ? Skin detection is an important indicator of human presence and actions in many domains, including interaction, interfaces and security. It is commonly performed in three steps: transforming the pixel color to a non-RGB colorspace, dropping the illuminance component of skin color, and classifying by modeling the skin color distribution. In this paper, we evaluate the effect of these three steps on the skin detection performance. The importance of this study is a new comprehensive colorspace and color modeling testing methodology that would allow for making the best choices for skin detection. Combinations of nine colorspaces, the presence or the absence of the illuminance component, and the two color modeling approaches are compared for different settings (indoor or outdoor) and modeling parameters (the histogram size). The performance is measured by using a receiver operating characteristic (ROC) curve on a large dataset of 845 images (consisting more than 18.6 million pixels) with manual ground truth. The results reveal that (1) colorspace transformations can improve performance in certain instances, (2) the absence of the illuminance component decreases performance, and (3) skin color modeling has a greater impact than colorspace transformation. We found that the best performance was obtained on indoor images by transforming the pixel color to the HSI or SCT colorspaces, keeping the illuminance component, and modeling the color with the histogram approach using a larger size distribution.

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

skin detection
colorspace transformation


computer aided ship design and numerically controlled production of towing tank models A Computer Aided Ship Design (CASD) and a Computer Aided Manufacturing (CAM) program are described. The objective of the program is to provide the capability to design and manufacture towing tank models using interactive CASD and CAM techniques. A three dimensional interactive graphics device supported by a mini-computer is used to drive the design portion of the system. A microprocessor based graphics system, simply and directly interfaced to a CNC controller on the shop floor, is used to perform the postprocessing and drive the milling machine. Experiences with actual use of the system and the benefits derived from this use are discussed for an actual production job.

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

graphics use drive microprocessor device design

interaction object product experience systems model control manufacturability computation


Navigation stability: A new isolation level in ORDBMSs In order to enhance the performance, many database management systems (DBMSs) execute transactions at isolation level 2 rather than at isolation level 3, the strict two phase locking, even if it sacrifices consistency to a certain degree. Cursor stability, a variant of isolation level 2 in relational DBMs (RDBMSs), has been widely used as a useful technique for obtaining concurrency achievable at level 2 without much sacrificing consistency. However, cursor stability is much less usable in object-relational DBMSs (ORDBMSs) because navigational applications in ORDBMSs can suffer from critical inconsistency problems such as dangling pointers, lost updates, and reading inconsistent complex objects. In this paper, we propose a new isolation level, navigation stability, that prevents the inconsistency problems of cursor stability for navigational applications, while avoiding significant degradation of the concurrency of level 3. First, we analyze the inconsistency problems of cursor stability for navigational applications. Second, we define navigation stability as an extension of cursor stability and show that it solves those inconsistency problems of cursor stability in ORDBMSs. Third, through extensive simulation, we show that navigation stability significantly enhances the performance compared with level 3. For workloads consisting of transactions of long duration, compared with level 3, the throughput of navigation stability is enhanced by up to 200%; the average response time reduced by as much as 55%; and the abort ratio reduced by as much as 77%. From these results, we conclude that navigation stability is a useful isolation level in ORDBMSs that can be used in place of isolation level 3 to improve the performance and concurrency without significant sacrifice of consistency.

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

navigation stability
isolation level
cursor stability


The consolidation of learning during sleep: comparing the pseudorehearsal and unlearning accounts We suggest that any brain-like (artificial neural network based) learning system will need a sleep-like mechanism for consolidating newly learned information if it wishes to cope with the sequential/ongoing learning of significantly new information. We summarise and explore two possible candidates for a computational account of this consolidation process in Hopfield type networks. The pseudorehearsal method is based on the relearning of randomly selected attractors in the network as the new information is added from some second system. This process is supposed to reinforce old information within the network and protect it from the disruption caused by learning new inputs. The unlearning method is based on the unlearning of randomly selected attractors in the network after new information has already been learned. This process is supposed to locate and remove the unwanted associations between information that obscure the learned inputs. We suggest that as a computational model of sleep consolidation, the pseudorehearsal approach is better supported by the psychological, evolutionary, and neurophysiological data (in particular accounting for the role of the hippocampus in consolidation).

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

consolidation sleep pseudorehearsal unlearning


energy conscious factory method design pattern for mobile devices with c# and intermediate language Design Patterns have gained more and more acceptances since their emerging in software development world last decade and become another de facto standard of essential knowledge for Object-Oriented Programming developers nowadays. Their target usage, from the beginning, was for regular computers, so, minimizing power consumption had never been a concern. However, in this decade, demands of more complicated software for running on mobile devices has grown rapidly as the much higher performance portable gadgets have been supplied to the market continuously. To get along business reason, time to market, the section of software development for power conscious, battery, devices has shifted itself from using specific low-level languages to higher level ones. Currently, complicated software running on mobile devices are often developed by high level languages those support OOP concepts. These cause the trend of embracing Design Patterns to mobile world. However, using Design Patterns directly in software development for power conscious systems is not recommended because they were not originally designed for such environment. This paper demonstrates the adapted Design Pattern for power limitation system. Because there are numerous original design patterns, it is not possible to mention the whole at once. So, this paper focuses only in creating Energy Concerned version of existing regular Factory Method Pattern to be appropriated for developing low power consumption software especially for mobile gadgets.

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

factory method pattern
design patterns
low power consumption

object oriented programming
power conscious system
software for mobile devices


Characterization of several kinds of quantum analogues of relative entropy Quantum relative entropy D(rho parallel to sigma) (def) Tr rho(log rho - log sigma) plays an important role in quantum information and related fields. However, there are many quantum analogues of relative entropy. In this paper, we characterize these analogues from information geometrical viewpoint. We also consider the naturalness of quantum relative entropy among these analogues.

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

autoparallel curve
divergence
fisher information
monotonicity
additivity


Combined shared and distributed memory ab-initio computations of molecular-hydrogen systems in the correlated state: Process pool solution and two-level parallelism An efficient computational scheme devised for investigations of ground state properties of the electronically correlated systems is presented. As an example, (H2)n ( H 2 ) n chain is considered with the long-range electronelectron interactions taken into account. The implemented procedure covers: (i) single-particle Wannier wave-function basis construction in the correlated state, (ii) microscopic parameters calculation, and (iii) ground state energy optimization. The optimization loop is based on highly effective process-pool solution specific root-workers approach. The hierarchical, two-level parallelism was applied: both shared (by use of Open Multi-Processing) and distributed (by use of Message Passing Interface) memory models were utilized. We discuss in detail the feature that such approach results in a substantial increase of the calculation speed reaching factor of 300 for the fully parallelized solution. The scheme elaborated in detail reflects the situation in which the most demanding task is the single-particle basis optimization.

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

ab initio calculations
electronic correlations
quantum chemistry methods


a scheme to prioritize classes at the early stage for improving observable reliability While testing a program using a test suite of finite size, testing the frequently used classes more thoroughly within the testing budget would lead to higher observable reliability compared to testing all classes uniformly. To achieve this, we first propose a technique to prioritize classes at the design stage according to their impact on the overall reliability of the system. The priority value for a class is calculated based on UML diagrams (Use Case and Sequence diagrams) and operational profile of the system. Then we propose a genetic algorithm-based technique to select test cases for a test suite out of a large pool of test cases such that the intensity with which each class is tested is proportionate to its priority value and the test suite is optimal under other constraints.

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

operational profile
observable reliability

event prioritization
sequence diagram graph


Cylindrical Algebraic Decomposition using validated numerics We present a version of the Cylindrical Algebraic Decomposition (CAD) algorithm which uses interval sample points in the lifting phase, whenever the results can be validated. This gives substantial time savings by avoiding computations with exact algebraic numbers. We use bounds based on Rouche's theorem combined with information collected during the projection phase and during construction of the current cell to validate the singularity structure of roots. We compare empirically our implementation of this variant of CAD with implementations of CAD using exact algebraic sample points (our and QEPCAD) and with our implementation of CAD using interval sample points with validation based solely on interval data. (c) 2006 Elsevier Ltd. All rights reserved.

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

cylindrical algebraic decomposition, cad


Covariance estimation for minimal geometry solvers via scaled unscented transformation ? Scaled unscented transformation (SUT) for minimal geometry solvers (MGS). SUT vs. first-order-propagation (FOP) in uncertainty estimation of MGS. Since MGS are highly nonlinear, SUT is a better uncertainty estimator than FOP.

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


Adoption of automation systems and strategy choices for Hong Kong apparel practitioners Recent developments from the World Trade Organisation (WTO) and other international trade agreements have forced industries worldwide to face a new era of intense competition. The clothing industry sector, which has played a pivotal role in industrial development in Hong Kong, faces challenges from continued global economic restructuring and the accession of China to the WTO. Apparel manufacturers and trading firms need to review their competitive priorities and develop new business and manufacturing practices and strategies to compete. This paper presents the key findings of a recent study on the adoption of automation systems and strategy choices and discusses their relevance to the transformation of the apparel operations and businesses in Hong Kong. Two models namely, for integrated apparel business manufacture and for an apparel sourcing and coordination centre, are devised.

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


Confirmation in the Cognitive Sciences: The Problematic Case of Bayesian Models Bayesian models of human learning are becoming increasingly popular in cognitive science. We argue that their purported confirmation largely relies on a methodology that depends on premises that are inconsistent with the claim that people are Bayesian about learning and inference. Bayesian models in cognitive science derive their appeal from their normative claim that the modeled inference is in some sense rational. Standard accounts of the rationality of Bayesian inference imply predictions that an agent selects the option that maximizes the posterior expected utility. Experimental confirmation of the models, however, has been claimed because of groups of agents that probability match the posterior. Probability matching only constitutes support for the Bayesian claim if additional unobvious and untested (but testable) assumptions are invoked. The alternative strategy of weakening the underlying notion of rationality no longer distinguishes the Bayesian model uniquely. A new account of rationalityeither for inference or for decision-makingis required to successfully confirm Bayesian models in cognitive science.

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

bayesian modeling
levels of explanation
methodology in cognitive science


Semantic Rule Based Image Visual Feature Ontology Creation Multimedia is one of the important communication channels for mankind. Due to the advancement in technology and enormous growth of mankind, a vast array of multimedia data is available today. This has resulted in the obvious need for some techniques for retrieving these data. This paper will give an overview of ontology-based image retrieval system for asteroideae flower family domain. In order to reduce the semantic gap between the low-level visual features of an image and the high-level domain knowledge, we have incorporated a concept of multi-modal image ontology. So, the created asteroideae flower domain specific ontology would have the knowledge about the domain and the visual features. The visual features used to define the ontology are prevalent color, basic intrinsic pattern and contour gradient. In prevalent color extraction, the most dominant color from the images was identified and indexed. In order to determine the texture pattern for a particular flower, basic intrinsic patterns were used. The contour gradients provide the information on the image edges with respect to the image base. These feature values are embedded in the ontology at appropriate slots with respect to the domain knowledge. This paper also defines some of the query axioms which are used to retrieve appropriate information from the created ontology. This ontology can be used for image retrieval system in semantic web.

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

information and knowledge
computer vision
intelligent computing
feature extraction


Learning methods for melanoma recognition Melanoma is the most deadly skin cancer. Early diagnosis is a challenge for clinicians. Current algorithms for skin lesions' classification focus mostly on segmentation and feature extraction. This article instead puts the emphasis on the learning process, testing the recognition performance of three different classifiers: support vector machine (SVM), artificial neural network and k-nearest neighbor. Extensive experiments were run on a database of more than 5000 dermoscopy images. The obtained results show that the SVM approach outperforms the other methods reaching an average recognition rate of 82.5% comparable with those obtained by skilled clinicians. If confirmed, our data suggest that this method may improve classification results of a computer-assisted diagnosis of melanoma. 2010 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 20, 316322, 2010

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

computer assisted diagnosis
support vector machines
kernel methods


Heuristic fuzzy-neuro network and its application to reactive navigation of a mobile robot A novel pattern recognition approach to reactive navigation of a mobile robot is presented in this paper. A heuristic fuzzy-neuro network is developed for pattern-mapping between quantized ultrasonic sensory data and velocity commands to the robot. The design goal was to enable an autonomous mobile robot to navigate safely and efficiently to a target position in a previously unknown environment. Useful heuristic rules were combined with the fuzzy Kohonen clustering network (FKCN) to build the desired mapping between perception and motion. This method provides much faster response to unexpected events and is less sensitive to sensor misreading than conventional approaches. It allows continuous, fast motion of the mobile robot without any need to stop for obstacles. The effectiveness of the proposed method is demonstrated in a series of practical tests on our experimental mobile robot. (C) 2000 Elsevier Science B.V. All rights reserved.

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

fuzzy navigation
fuzzy-neuro network
mobile robots


Systematic identifiability study based on the Fisher Information Matrix for reducing the number of parameters calibration of an activated sludge model This work proposes a procedure for calibration and validation of complex models by systematically obtaining identifiable parameter subsets according to the available data. The procedure uses the new RDE criteria calculated from the Fisher Information Matrix (FIM) as the ratio of normalized D to modified E criteria (RDE). It does not require expert knowledge and it defines automatically the dimension of the identifiable subset without requiring a threshold for the RDE. It was applied successfully to the study of the IWA-ASM2d model, which was implemented, calibrated and validated for an anaerobic/anoxic/oxic (A2/O) pilot WWTP operated under three different influent ammonium concentrations (15, 20 and 30mg/L) and two internal recycling ratios (IRR=2 and 5). Starting from 51 among all the ASM2d parameters, a sensitivity analysis around the ASM2d default values was performed. From the sensitivity ranking, the 20 best-ranked parameters were named seeds, since each one served for growing a parameter subset for model calibration. The subset generation process added to the seed a parameter that presented the highest RDE among all the remaining parameters of the sensitivity ranking. The process of parameter addition was repeated until the RDE decreased from the current iteration to the previous one. The best subset determined by the methodology {bPAO, YPO4, ?A} presented the highest possible value of the RDE. Finally, the simulation of the WWTP with this subset fitted adequately the experimental data while the parameters obtained had low confidence intervals.

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


Differential transform method for the system of two-dimensional nonlinear Volterra integro-differential equations In this paper, we develop the differential transform method (DTM) for solving a class of the system of two-dimensional linear and nonlinear Volterra integro-differential equations of the second kind. To this end, we give some preliminary results of the differential transform and describe the method of this paper. We also give some examples to demonstrate the accuracy of the presented method.

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

two-dimensional volterra integro-differential equations


Recent developments in Japans intellectual property industry There have been many changes and new initiatives in the field of intellectual property (IP) and the use of patent information (PI) in Japan in recent years. In this article the author provides a concise survey of these developments. Topics embraced include the increased corporate emphasis on IP and the moves towards greater integration of IP and PI into other core activities such as R & D and strategic planning. Japanese government initiatives covered include the Intellectual Property Policy Outline and the Intellectual Property Strategic Program, as well as major efforts to reduce backlogs of patent applications awaiting search and examinationsuch as outsourcing and the increased recruitment of examiners. Other topics referred to include the increasing need for better prior art searches early in the R & D process, patent databases and licensing activities.

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

patent information
japan
strategic planning
outsourcing
prior art searches
patent databases
licensing

intellectual property developments
corporate policy
government policy
patent application backlogs
examiner recruitment


Modeling the longitudinality of user acceptance of technology with an evidence-adaptive clinical decision support system ? This paper presents multiple innovations associated with an electronic health record system developed to support evidence-based medicine practice, and highlights a new construct, based on the technology acceptance model, to explain end users' acceptance of this technology through a lens of continuous behavioral adaptation and change. We show that this new conceptualization of technology acceptance reveals a richer level of detail of the developmental course whereby individuals adjust their behavior gradually to assimilate technology use. We also show that traditional models such as technology acceptance model (TAM) are not capable of delineating this longitudinal behavioral development process. Our TAM-derived analysis provides a lens through which we summarize the significance of this project to research and practice. We show that our application is an excellent exemplar of the end-to-end IS design realization process; it has drawn upon multiple disciplines to formulate and solve challenges in medical knowledge engineering, just-in-time provisioning of computerized decision-support advice, diffusion of innovation and individual users' technology acceptance, usability of human-machine interfaces in healthcare, and sociotechnical issues associated with integrating IT applications into a patient care delivery environment.

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

innovation adoption
electronic health records
social network analysis
usability assessments
clinical workflow
user interface design


a critique of common lisp A major goal of the COMMON LISP committee was to define a Lisp language with sufficient power and generality that people would be happy to stay within its confines and thus write inherently transportable code. We argue that the resulting language definition is too large for many short-term and medium-term potential applications. In addition many parts of COMMON LISP cannot be implemented very efficiently on stock hardware. We further argue that the very generality of the design with its different efficiency profiles on different architectures works against the goal of transportability.

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

applications lisp efficiency language code definition design power hardware profiles


Video Block Motion Estimation Based on Gray-Code Kernels Motion in modern video coders is estimated using a block matching algorithm that calculates the distance and direction of motion on a block-by-block basis. In this paper, a novel fast block-based motion estimation algorithm is proposed. This algorithm uses an efficient projection framework that bounds the distance between a template block and candidate blocks. Fast projection is performed using a family of highly efficient filter kernels-the gray-code kernels-requiring only 2 operations per pixel per kernel. The projection framework is combined with a rejection scheme which allows rapid rejection of candidate blocks that are distant from the template block. The tradeoff between computational complexity and quality of results can be easily controlled in the proposed algorithm; thus, it enables adaptivity to image content to further improve the results. Experiments show that the proposed adaptive algorithm outperforms other popular fast motion estimation algorithms.

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

gray-code kernels (gck)
video coding
walsh-hadamard transform (wht)


Web classification of conceptual entities using co-training Social networking websites, which profile objects with predefined attributes and their relationships, often rely heavily on their users to contribute the required information. We, however, have observed that many web pages are actually created collectively according to the composition of some physical or abstract entity, e.g., company, people, and event. Furthermore, users often like to organize pages into conceptual categories for better search and retrieval, making it feasible to extract relevant attributes and relationships from the web. Given a set of entities each consisting of a set of web pages, we name the task of assigning pages to the corresponding conceptual categories conceptual web classification. To address this, we propose an entity-based co-training (EcT) algorithm which learns from the unlabeled examples to boost its performance. Different from existing co-training algorithms, EcT has taken into account the entity semantics hidden in web pages and requires no prior knowledge about the underlying class distribution which is crucial in standard co-training algorithms used in web classification. In our experiments, we evaluated EcT, standard co-training, and other three non co-training learning methods on Conf-425 dataset. Both EcT and co-training performed well when compared to the baseline methods that required large amount of training examples.

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

conceptual web classification
web classification


ROM reduction for OFDM system using time-stealing strategy Modern communication systems frequently exploit the OFDM (Orthogonal Frequency Division Multiplex) technique to obtain a highly robust transmission of multimedia information, such as digital audio/video broadcast. OFDM and most of the other multimedia compression techniques usually require expensive computations, e.g., FFT (Fast Fourier Transform) and IMDCT (Inverse Modified Discrete Cosine Transform) processing. Traditionally, designing FFT and IMDCT separately involves a significant amount of redundancy in hardware. To reduce the required hardware, this investigation proposes a new ROM-sharing design for storing both FFT twiddle factors and IMDCT coefficients in a DAB (Digital Audio Broadcasting) receiver. We first analyze the correlation between FFT operations and IMDCT operations, and then the combinational logic circuit in the FFT processor is modified such that both IMDCT coefficients and FFT twiddle factors can be obtained simultaneously from a shared ROM. This design can also be applied for computing IFFT (Inverse Fast Fourier Transform) and MDCT for DAB transmitter. Compared with the traditional design using separate module scheme, our design does not need extra ROM for IMDCT/MDCT modules. Therefore, the new scheme offers superior solution for combining high-performance FFT (IFFT) operation and IMDCT (MDCT) operation.

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


Identification of vertical total electron content by time series analysis Time series analysis of the vertical total electron content (VTEC) is carried out in order to model variations in these observations dependent on time and frequency for various stationsatellite pairs. The data of global positioning system (GPS) from four stations are processed in order to obtain the VTEC. The experiment was conducted on two successive days, the 12th and 13th April 2006 (days of year, DOY, 102103). The mean of the squares of correlation coefficients (R2 R 2 ) between time and short-term VTEC is 0.81, which shows high linear correlation for the linear trend component analysis of the time series. For each VTEC observation arc, one significant frequency value is found using the peak-peaking (PP) method in the frequency domain for the periodical component analysis. The stochastic component is modeled with a second-order autoregressive [AR(2)] model. VTEC is recovered by 98% combining trend, periodical and stochastic components. In order to analyze the efficiency of these models for prediction, a 5 min ahead prediction is carried out resulting in a 0.19 mean root mean squared error (RMSE). Also, good results were obtained for 10, 15 and 20 min ahead predictions in some VTEC observation arcs.

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

vertical total electron content
time series analysis

peak peaking
autocorrelation function
autoregressive model


Three-dimensional reconstruction and fusion for multi-modality spinal images Medical diagnosis can benefit from the complementary information in different modality images. Multi-modal image registration and fusion is an essential task in numerous three-dimensional (3D) medical image-processing applications. Registered images are not only providing more correlative information to aid in diagnosis, but also assisting with the planning and monitoring of both surgery and radiotherapy. This research is directed at registering different images captured from Computed Tomography (CT) and Magnetic Resonance (MR) imaging devices, respectively, to acquire more thorough information for disease diagnosis. Because MR bone model segmentation is difficult, this research used a 3D model obtained from CT images. This model accomplishes image registration by optimizing the gradient information accumulated around the bony boundary areas with respect to the 3D model. This system involves pre-processing, 2D segmentation, 3D registration, fusion and sub-system rendering. This method provides desired image operation, robustness verification, and multi-modality spinal image registration accuracy. The proposed system is useful in observing the foramen and nerve root. Because the registration can be performed without external markers, a better choice for clinical usage is provided for lumbar spine diagnosis.

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

magnetic resonance imaging
three-dimensional registration


Well-Balanced Adaptive Mesh Refinement for shallow water flows ? Well-balanced shock capturing (WBSC) schemes constitute nowadays the state of the art in the numerical simulation of shallow water flows. They allow to accurately represent discontinuous behavior, known to occur due to the non-linear hyperbolic nature of the shallow water system, and, at the same time, numerically maintain stationary solutions. In situations of practical interest, these schemes often need to be combined with some kind of adaptivity, in order to speed up computing times. In this paper we discuss what ingredients need to be modified in a block-structured AMR technique in order to ensure that, when combined with a WBSC scheme, the so-called water at rest stationary solutions are exactly preserved.

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

structured adaptive mesh refinement
well-balanced schemes
shallow water equations
well-balanced interpolation


Torsional flow of third grade fluid using modified homotopy perturbation method This paper considers the steady flow of an incompressible third grade fluid between two vertical concentric rotating cylinders of infinite lengths. Modified Homotopy perturbation method is used to reduce the volume of tedious calculations involved to solve second order nonlinear differential equation. Special cases with one cylinder, inner or outer at rest (bounded domain case), and fluid flow at a rotating cylinder (unbounded domain case) are obtained. The effect of ? ? , the non-dimensional number related to the material constants, ? ? , rotation of the cylinder and R R , the ratio between radii of outer and inner cylinders, on the velocity profile are discussed and are shown graphically.

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

vertical concentric rotating cylinders
third grade fluid
modified homotopy perturbation method


Improved harmony search algorithm for transmission expansion planning with adequacysecurity considerations in the deregulated power system A complete planning framework for TEP problem is proposed. Minimizing congestion cost has been applied to TEP problem for increasing competition. Improved harmony search algorithm has been applied to solve dynamic TEP problem. Comprehensive comparison between proposed algorithm and GA has been presented. Market ability with regard to LMP has been evaluated.

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

harmony search algorithm
transmission expansion planning

optimization in power systems
n-1 contingency modeling


Chirp imaging vibro-acoustography for removing the ultrasound standing wave artifact Vibro-acoustography (VA) is an imaging technique that uses the dynamic (oscillatory) radiation force of two continuous-wave (CW) ultrasound to image objects at low frequency (within the kHz range). In this technique, the dynamic radiation force is created by means of a confocused transducer emitting two ultrasound beams at slightly-shifted frequencies f(1) and f(2) = f(1) + Delta f. It has been demonstrated previously that high-resolution images of various types of inclusions and tissues can be obtained using this technique. However, if the targeted object reflects ultrasound directly back to the transducer, standing waves are produced that result in an artifact in the VA image. The goal of this study is to remove the standing wave artifact and improve VA images by means of a new process called chirp imaging. The procedure consists of sweeping the frequencies of the primary ultrasound beams in a selected bandwidth while keeping Delta f constant during the sweep. The chirp image is produced by averaging the amplitude of the acoustic emission produced during the sweep. Vibro-acoustography chirp imaging experiments are performed on a stainless-steel sphere attached to a latex sheet in a tank of degassed water. The resulting chirp images demonstrate remarkable reduction of the standing wave artifact compared to the "fixed frequency" VA images.

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

acoustic emission
chirp imaging
dynamic radiation force
standing wave
vibroacoustography


Sub-micron imaging on high-topography wafers using spray coating and projection lithography We propose a method to image inside deep trenches (50?m) using spray-coated resist and the ASML PAS 5500/100 system with the new functionality multi-step imaging. Multi-step imaging allows extending the focus offset range of the PAS 5500/100 system from30?m to200?m. Isolated trenches and contact holes were both imaged inside the deep trenches and on the surface of the wafer to study the versatility of the new functionality. A resolution of 700nm in 3?m thick photoresist, at the bottom of 50?m deep, 200?m wide trench, was obtained with this process. Finally, multi-focus exposure that consists in exposing the same image several times at various focus offsets was performed in order to image thick photoresist on high topographic substrates.

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

resist spray coating
mems
3d structures
high topography


pure patterns type systems We introduce a new framework of algebraic pure type systems in which we consider rewrite rules as lambda terms with patterns and rewrite rule application as abstraction application with built-in matching facilities. This framework, that we call " Pure Pattern Type Systems ", is particularly well-suited for the foundations of programming (meta)languages and proof assistants since it provides in a fully unified setting higher-order capabilities and pattern matching ability together with powerful type systems. We prove some standard properties like confluence and subject reduction for the case of a syntactic theory and under a syntactical restriction over the shape of patterns. We also conjecture the strong normalization of typable terms. This work should be seen as a contribution to a formal connection between logics and rewriting, and a step towards new proof engines based on the Curry-Howard isomorphism.

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

rewriting
matching
pure type systems
patterns
logics


An ontology based framework for mining dependence relationships between news and financial instruments Before news is input into financial trading algorithms/models, it needs human judgements for exploring the market implications of news content, distinguishing significance extent of news, and finding out the impact of polar type of each kind of news on certain financial instrument trading activity. But Dawes and Faust (1989) reported that people usually rely on clinical judgements, especially it is hard for them to distinguish valid decision variables from invalid ones in decision making. Thus, in order to alleviate this problem and provide more objective decision making support about news in financial market, an ontology based framework is proposed, for investigating the actuarial dependence relationships between news and financial instruments trading activities as well as identifying more valid news for trading decision making. This framework is expected to help people in financial market how to consider weight for each kind of news when inputted in trading algorithms/models of certain financial instruments.

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

expert defined rules
data mining
bayesian network technique


Segmentation of Bone Structure in X-ray Images using Convolutional Neural Network The segmentation process represents a first step necessary for any automatic method of extracting information from an image. In the case of X-ray images, through segmentation we can differentiate the bone tissue from the rest of the image. There are nowadays several segmentation techniques, but in general, they all require the human intervention in the segmentation process. Consequently, this article proposes a new segmentation method for the X-ray images using a Convolutional Neural Network (CNN). In present, the convolutional networks are the best techniques for image segmentation. This fact is demonstrated by their wide usage in all the fields, including the medical one. As the X-ray images have large dimensions, for reducing the training time, the method proposed by the present article selects only certain areas (maximum interest areas) from the entire image. The neural network is used as pixel classifier thus causing the label of each pixel (bone or none-bone) from a raw pixel values in a square area. We will also present the method through which the network final configuration was chosen and we will make a comparative analysis with other 3 CNN configurations. The network chosen by us obtained the best results for all the evaluation metrics used, i.e. warping error, rand error and pixel error.

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


GraPHIA: a computational model for identifying phonological jokes Currently in humor research, there exists a dearth of computational models for humor perception. The existing theories are not quantifiable and efforts need to be made to quantify the models and incorporate neuropsychological findings in humor research. We propose a new computational model (GraPHIA) for perceiving phonological jokes or puns. GraPHIA consists of a semantic network and a phonological network where words are represented by nodes in both the networks. Novel features based on graph theoretical concepts are proposed and computed for the identification of homophonic jokes. The data set for evaluating the model consisted of homophonic puns, normal sentences, and ambiguous nonsense sentences. The classification results show that the feature values result in successful identification of phonological jokes and ambiguous nonsense sentences suggesting that the proposed model is a plausible model for humor perception. Further work is needed to extend the model for identification of other types of phonological jokes.

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


an improved introduction to computing emphasizing the development of algorithms and using the apple macintosh pascal Many colleges and universities offer an introductory computer science course based on a specific programming language. The Department of Computer Science at the University of Kansas has recently created a new environment in order to better teach such topics as problem solving, algorithmic design, elementary programming techniques, and elementary computer techniques. This paper will discuss the transition from a time-sharing environment to a modern microcomputer laboratory. It will also discuss the pedagogic techniques used in the new environment. It is hoped that others will benefit from our experiences.

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

computer science
order
design
paper
laboratory
microcomputer
programming language

sharing program environments transit developer computation experience timing algorithm


Improving system performance for stochastic activity network: A simulation approach An activity network with returning loop activities has a wide variety of applications, but can cause a heavy computational burden for large networks. Moreover, if an activity processing time and/or the probability of taking a particular activity changes when the number of activity visits is added, the computation is very complicated and difficult. We propose a simulation approach to deal with stochastic activity networks consisting of multiple terminal nodes, no limit on looping activities, non-constant activity selection probabilities, and non-deterministic activity times following arbitrary distributions. Probability and time control functions are introduced to reflect the acceleration, or learning effect, of repeated activities. Performance measures such as system success/failure probabilities, time to completion/success/failure times, time between success/failure, and the pth percentile times of a project are obtained. A series of sensitivity analysis was performed to understand the trend and behavior of system performance. A cost function is developed to find an optimal strategy by manipulating control factors. To illustrate the efficacy of this simulation approach a new drug discovery and development project was analyzed. The Pro-model simulation language was used for performance evaluations, and the SimRunner optimization tool for obtaining the optimal solution. (C) 2011 Elsevier Ltd. All rights reserved.

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

activity network
stochastic activity
simulation
performance measures

control function
drug discovery and development process


Experimental comparison of recursive self-organizing maps for processing tree-structured data ? Self-organizing neural network models have recently been extended to more general data structures, such as sequences or trees. We empirically compare three recursive models of the self-organizing mapSOMSD, MSOM and RecSOMusing three different tree data sets with the increasing level of complexity: binary syntactic trees, ternary linguistic propositions and 5-ary graphical data. We evaluate the models in terms of our four proposed measures focusing on unit's memory depth and on capability to differentiate among the trees, and using two additional measures introduced earlier, focusing on statistics of labels distribution and the spatiotemporal information encoded into the maps. We focus on models ability to differentiate among the trees and find out that the models differ in how they balance the effects of leaves and the tree structure in achieving this task. SOMSD turns out to have the highest sensitivity to structural information that affects the tree clustering. With respect to input differentiation, only RecSOM can assign unique output representations to different inputs in all three data sets. We also argue that MSOM, despite the commutativity of operation (with respect to children) for calculating context representation, has the potential to differentiate the binary trees with permuted children.

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

feedback self-organizing maps
recursive processing


A linear quadrilateral shell element with fast stiffness computation A new quadrilateral shell element with 5/6 nodal degrees of freedom is presented. Assuming linear isotropic elasticity a HellingerReissner functional with independent displacements, rotations and stress resultants is used. Within the mixed formulation the stress resultants are interpolated using five parameters for the membrane forces as well as for the bending moments and four parameters for the shear forces. The hybrid element stiffness matrix resulting from the stationary condition is integrated analytically. This leads to a part obtained by one point integration and a stabilization matrix. The element possesses the correct rank, is free of locking and is applicable within the whole range of thin and thick shells. The in-plane and bending patch tests are fulfilled and the computed numerical examples show that the convergence behaviour of the stress resultants is very good in comparison to comparable existing elements. The essential advantage is the fast stiffness computation due to the analytically integrated matrices.

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

effective analytical stiffness evaluation

one point integration and stabilization matrix


Evolving Robocode tanks for Evo Robocode Evo Robocode is a competition where the challenge is to use evolutionary techniques to create a Java based controller for a simulated robot tank. The tank competes in a closed arena against other such tanks. The Robocode game is a programming platform that allows such tanks to compete. This article discusses the use of Grammatical Evolution (a form of genetic programming) together with spatial co-evolution. This system harnessed co-evolution to evolve relatively complex behaviours, within the program size constraints of the competition. The entry for the 2013 Evo Robocode competition was not evolved against any human coded robots and yet was able to compete effectively against many previously unseen opponents. The co-evolutionary system was then compared to a system that used a handcrafted fitness gradient consisting of pre-selected human coded robots. The top robots from the co-evolved system performed as well as those evolved using a hand crafted fitness function, scoring well against such robots in head to head battles.

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


Computational evaluation of different numerical tools for the prediction of proximal femur loads from bone morphology We ideally estimate patient-specific loads from bone geometry and density measurement. We combine FE, bone remodeling models, and machine learning techniques. Linear regression and ANN computed a good load prediction with error less than 2%. The support vector machine technique predicts higher relative errors. ANN with multiple outputs obtained a high accuracy in the prediction of a known bone density.

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

support vector machine
linear regression
bone density

artificial neuronal network
loading conditions
inverse bone remodeling problem


F-transform with parametric generalized fuzzy partitions The fuzzy transform (F-transform) has some interesting properties that allow its use in curve fitting and smoothing. We suggest the following: (a) a generalization of fuzzy partitions for the F-transform to control and improve the smoothing effect and (b) a parametrization of the fuzzy numbers constituting the basic functions related to the fuzzy partitions. An optimization criterion is then suggested to obtain the F-transform with best approximation properties, by estimating the basic functions from a family of parametric fuzzy numbers. The generalized fuzzy partitions are characterized by the number of subintervals (the bandwidth of the partition) forming the core of each basic function and we suggest two procedures for bandwidth selection: one based on taut-string variation and a second based on generalized cross validation. Some illustrative examples are included. (C) 2011 Elsevier B.V. All rights reserved.

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


Implicit Large Eddy Simulation of non-wall-bounded turbulent flows based on the multiscale properties of a high-order finite volume method In this paper it is presented the application of a higher-order finite volume method based on Moving Least Squares approximations (FV-MLS) to the resolution of non-wall-bounded compressible turbulent flows. Our approach is based on the monotonically implicit Large Eddy Simulation (MILES). The main idea of MILES methodology is the absence of any explicit subgrid scale (SGS) model in the numerical algorithm to solve turbulent flows. In the case of the FV-MLS method, we take advantage of the multiresolution properties of Moving Least Squares Approximations, and we show that they can be used as an implicit SGS model. The numerical results are encouraging. The third-order FV-MLS method is able to reproduce the inertial subrange, and it obtains better results than other usual numerical schemes in LES computations, such as the MUSCL scheme. We note that in the present state of this research, the numerical method is not yet suited for wall-bounded flows. This paper is the first step in the application of the FV-MLS method to general turbulent flows.

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

moving least squares
finite volume method

high-order methods
turbulence
compressible flows


THE FACTORS AFFECTING STRATEGIC INFORMATION-SYSTEMS APPLICATIONS - AN EMPIRICAL-ASSESSMENT The strategic potential of information systems (IS) is now well accepted. This paper examines some key characteristics of strategic IS applications and investigates their relationship with contextual factors representing the industry environment, the organization structure, and the IS function. Empirical analysis of 81 strategic IS applications in large companies shows that these applications contribute mainly to functions involving customers or competitors, primarily to reduce cost or provide some differentiation. They have limited effect on suppliers. However, the effect on suppliers is greater in decentralized organizations and in heterogeneous environments. Moreover, a heterogeneous environment and a mature IS function enhance the role of information storage. The implications for future research and for IS practice are examined.

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

industry environment
organization structure

information technology
strategic utilization
competitive advantage
information systems maturity


WWW plus smart card: towards a mobile health care management system This paper highlights the benefits of combining the World Wide Web and smart card technologies to support a highly mobile health management framework. In particular, we describe an approach using the SmartCard-Web Gateway Interface (SGI) as a common interface to communicate and access the medical records residing in a smart card. Importantly, by employing HTTP as the baseline protocol to access information on the smart card, SGI promotes the use of de facto standard web browsers as the common client user interface. The initial implementation of the framework has demonstrated the feasibility of the concept in facilitating a truly mobile access of patient's medical records based on SGI. (C) 2000 Elsevier Science Ireland Ltd. All rights reserved.

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

mobile health management
smart card
world wide web
health care


Accurate Bluetooth Positioning Using Weighting and Large Number of Devices Measurements In this paper it considers using the built-in Bluetooth in the cellphone as the positioning device; it is able from the measured received signal strength indication strength to locate the target or the cellphone position. From experimental measurements using Bluetooth positioning technique in various environments we measure signal fading condition and propose signal fading model; three-point localization method is then developed to determine potential target locations. Two specific processes, one is the introduction of weighting factors for the potential target locations and the other is to generate more test points, are then exploited to determine the target final location. With these two specific processes it is possible by using Bluetooth technique to reduce the distance determination error down to 1m range.

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

blue tooth
positioning system
accuracy positioning


A functional correspondence between monadic evaluators and abstract machines for languages with computational effects We extend our correspondence between evaluators and abstract machines from the pure setting of the lambda-calculus to the impure setting of the computational lambda-calculus. We show how to derive new abstract machines from monadic evaluators for the computational lambda-calculus. Starting from (1) a generic evaluator parameterized by a monad and (2) a monad specifying a computational effect, we inline the components of the monad in the generic evaluator to obtain an evaluator written in a style that is specific to this computational effect. We then derive the corresponding abstract machine by closure-converting, CPS-transforming, and defunctionalizing this specific evaluator. We illustrate the construction with the identity monad, obtaining the CEK machine, and with a lifted state monad, obtaining a variant of the CEK machine with error and state. In addition, we characterize the tail-recursive stack inspection presented by Clements and Felleisen as a lifted state mound. This enables us to combine this stack-inspection monad with other monads and to construct abstract machines for languages with properly tail-recursive stack inspection and other computational effects. The construction scales to other monads-including one more properly dedicated to stack inspection than the lifted state monad-and other monadic evaluators. (c) 2005 Elsevier B.V. All rights reserved.

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

abstract machines
monads
effects
stack inspection

transformation into continuation-passing style (cps)


Multifactor dimensionality reduction reveals a three-locus epistatic interaction associated with susceptibility to pulmonary tuberculosis Identifying high-order genetics associations with non-additive (i.e. epistatic) effects in population-based studies of common human diseases is a computational challenge. Multifactor dimensionality reduction (MDR) is a machine learning method that was designed specifically for this problem. The goal of the present study was to apply MDR to mining high-order epistatic interactions in a population-based genetic study of tuberculosis (TB).

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


MOSFET layout modifications for hump effect removal A statistics method of parametric measurement enabled the characterization of hump effect. With TCAD simulation in three dimensions, hump effect can be put in evidence. Hump effect can be suppressed by a MOSFET layout modification without impacted the reliability performances.

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

hump effect
reliability
characterization
simulation


A comprehensive approach to model and use context for adapting applications in pervasive environments With an increasing diversity of pervasive computing devices integrated in our surroundings and an increasing mobility of users, it will be important for computer systems and applications to be context-aware. Lots of works have already been done in this direction on how to capture context data and how to carry it to the application. Among the remaining challenges are to create the intelligence to analyze the context information and deduce the meaning out of it, and to integrate it into adaptable applications. Our work focuses on these challenges by defining generic context storage and processing model and by studying its impact on the application core. We propose a reusable context ontology model that is based on two levels: a generic level and a domain specific level. We propose a generic adaptation framework to guarantee adaptation of applications to the context in a pervasive computing environment. We also introduce a comprehensive adaptation approach that involves content adaptation and presentation adaptation inline with the adaptation of the core services of applications. Our case study shows that the context model and the application adaptation strategies provide promising service architecture.

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

context-aware computing
context modeling
web services


optimal decomposition of p2p networks based on file exchange patterns for multimedia content search & replication In this paper, we address the issues of multimedia content search and replication over peer-to peer networks. We use the concept of semantic proximity that exploits the file exchange patterns exhibited among peer users so as to decompose the network into semantic clusters. Peer nodes are then decomposed into semantic clusters so that a) the probability that a node locates content within its own cluster is maximized, while simultaneously b) the respective probability of finding this content outside this cluster is minimized The semantic organization is then used for applying efficient cluster-based content replication strategies. Two different schemes are examined; the unrestricted and the restricted approach. The first one distributes multimedia content within peers of a cluster so that the average hop distance among nodes and objects weighted by the object popularity is minimized. This approach takes into account no Quality of Service (QoS) guarantees. Instead, the second scheme iteratively partitions the nodes of a cluster during each object replication based on a QoS violation criterion. The proposed algorithms are experimentally evaluated and compared with other approaches to demonstrate the efficacy of the proposed schemes.

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

content search
multimedia
content replication


Inferring Gene Regulatory Networks via Nonlinear State-Space Models and Exploiting Sparsity This paper considers the problem of learning the structure of gene regulatory networks from gene expression time series data. A more realistic scenario when the state space model representing a gene network evolves nonlinearly is considered while a linear model is assumed for the microarray data. To capture the nonlinearity, a particle filter-based state estimation algorithm is considered instead of the contemporary linear approximation-based approaches. The parameters characterizing the regulatory relations among various genes are estimated online using a Kalman filter. Since a particular gene interacts with a few other genes only, the parameter vector is expected to be sparse. The state estimates delivered by the particle filter and the observed microarray data are then subjected to a LASSO-based least squares regression operation which yields a parsimonious and efficient description of the regulatory network by setting the irrelevant coefficients to zero. The performance of the aforementioned algorithm is compared with the extended Kalman filter ( EKF) and Unscented Kalman Filter (UKF) employing the Mean Square Error (MSE) as the fidelity criterion in recovering the parameters of gene regulatory networks from synthetic data and real biological data. Extensive computer simulations illustrate that the proposed particle filter-based network inference algorithm outperforms EKF and UKF, and therefore, it can serve as a natural framework for modeling gene regulatory networks with nonlinear and sparse structure.

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

gene regulatory network
parameter estimation
lasso


regularized locality preserving indexing via spectral regression We consider the problem of document indexing and representation. Recently, Locality Preserving Indexing (LPI) was proposed for learning a compact document subspace. Different from Latent Semantic Indexing (LSI) which is optimal in the sense of global Euclidean structure, LPI is optimal in the sense of local manifold structure. However, LPI is not efficient in time and memory which makes it difficult to be applied to very large data set. Specifically, the computation of LPI involves eigen-decompositions of two dense matrices which is expensive. In this paper, we propose a new algorithm called Regularized Locality Preserving Indexing (RLPI). Benefit from recent progresses on spectral graph analysis, we cast the original LPI algorithm into a regression framework which enable us to avoid eigen-decomposition of dense matrices. Also, with the regression based framework, different kinds of regularizers can be naturally incorporated into our algorithm which makes it more flexible. Extensive experimental results show that RLPI obtains similar or better results comparing to LPI and it is significantly faster, which makes it an efficient and effective data preprocessing method for large scale text clustering, classification and retrieval.

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

dimensionality reduction
document representation and indexing


Toward a representation format for sharable clinical guidelines Clinical guidelines are being developed for the purpose of reducing medical errors and unjustified variations in medical practice, and for basing medical practice on evidence. Encoding guidelines in a computer-interpretable format and integrating them with the electronic medical record can enable delivery of patient-specific recommendations when and where needed. Since great effort must be expended in developing high-quality guidelines, and in making them computer-interpretable, it is highly desirable to be able to share computer-interpretable guidelines (CIGs) among institutions. Adoption of a common format for representing CIGs is one approach to sharing. Factors that need to be considered in creating a format for sharable CIGS include (i) the scope of guidelines and their intended applications, (ii) the method of delivery of the recommendations, and (iii) the environment, consisting of the practice setting and the information system in which the guidelines will be applied. Several investigators have proposed solutions that improve the sharability of CIGs and, snore generally, of medical knowledge. These approaches can be useful in the development of a format for sharable CIGs. Challenges in sharing CIGs also include the need to extend the traditional framework for disseminating guidelines to enable them to be integrated into practice. These extensions include processes for (i) local adaptation of recommendations encoded in shared generic guidelines and (ii) integration of guidelines into the institutional information systems. (C) 2001 Academic Press.

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

knowledge representation
knowledge sharing
decision support
computer-interpretable guidelines
functional requirements
standards


A very high performing system to discriminate tissues in mammograms as benign and malignant In this paper, we compare different state-of-the-art texture descriptors to discriminate tissues in mammograms as either benign or malignant. The three best approaches are the following: A very recent Local Ternary Pattern (LTP) variant based on a random subspace of rotation invariant bins with higher variance, where features are transformed using Neighborhood Preserving Embedding (NPE) and then used to train a support vector machine (SVM). The set of SVMs is combined by sum rule. An ensemble of local phase quantization (LPQ) texture descriptors each obtained varying the parameters of LPQ. For each descriptor a SVM is trained then the SVMs are combined by sum rule. A method that uses all the uniform bins extracted by LTP for training a random subspace of SVMs. The use of these techniques is very promising when applied to the task of distinguishing benign and malignant breast tissues, with the best approach being to use all the uniform bins extracted by LTP. It obtains an area under the ROC curve (AUC) of 0.97.

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

local binary patterns
local ternary patterns
support vector machines


Barriers to innovation adoption: a study of e-markets Purpose - The purpose of this paper is to explore and expound the factors that impinge on the adoption and usage of industrial e-markets. Design/methodology/approach - A review of the literature on e-market adoption was followed by in-depth interviews with senior managers in buyer, supplier, and e-market organisations. Senior level executives (15) reported barriers and challenges to the adoption and usage of e-markets operating in the aerospace and defence and higher education sectors. The interview data is transcribed, coded and analysed using the qualitative data analysis programme QSR N6. Findings - The paper found a number of barriers and challenges related risk perception, knowledge deficits, trust, firm size, and organisational readiness that moderate the adoption and usage of e-markets in the sectors. Research limitations/implications - There is unequal representation of buyer and supplier organisations between the two e-market sectors. However, the case material enabled the research question to be answered and did not compromise the aims of the research. Practical implications - The case material presented in the paper can help academic researchers, managers, practitioners and other professionals better understand the barriers that impinge on e-market adoption and find practical ways to mitigate those barriers. Originality/value - Recently, research on the barriers and challenges to e-markets has been largely anecdotal and patchy with a paucity of studies noting factors that are likely to be conducive to e-markets success. This study departs from such studies by offering empirical. evidence of the factors in moderating the uptake of e-markets.

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

organizational innovation
information systems
electronic commerce
supply chain management


A time series bootstrap procedure for interpolation intervals A sieve bootstrap procedure for constructing interpolation intervals for a general class of linear processes is proposed. This sieve bootstrap provides consistent estimators of the conditional distribution of the missing values, given the observed data. A Monte Carlo experiment is used to show the finite sample properties of the sieve bootstrap and finally, the performance of the proposed method is illustrated with a real data example.

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

time series
interpolation intervals
sieve bootstrap


Use of artificial vision techniques for diagnostic of nitrogen nutritional status in maize plants An artificial vision system to evaluate nitrogen deficiency in maize plants is presented. The system uses images of maize leaves at different stages of crop development. Even in early development stages, the leaves can be analyzed. The results demonstrate that the proposed system isable to diagnose nitrogen levels in maize leaves.

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

zea mays
nutritional diagnosis
macronutrient
computational vision


Long memory and nonlinearities in realized volatility: A Markov switching approach Realized volatility is studied using nonlinear and highly persistent dynamics. In particular, a model is proposed that simultaneously captures long memory and nonlinearities in which level and persistence shift through a Markov switching dynamics. Inference is based on an efficient Markov chain Monte Carlo (MCMC) algorithm that is used to estimate parameters, latent process and predictive densities. The in-sample results show that both long memory and nonlinearities are significant and improve the description of the data. The out-sample results at several forecast horizons show that introducing these nonlinearities produces superior forecasts over those obtained using nested models.

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