Specifying subtypes in Safety Critical Java programs Real-time and safety-critical code could benefit from the use of design patterns and frameworks that rely on subtyping and dynamic dispatch. However, modular reasoning about programs that use subtypes requires that each overriding method obeys the specifications of all methods that it overrides. For example, if method scale is specified in a supertype Vector2d to take at most 42ns to execute, then an override of scale cannot take more than 42ns to execute in any subtype, such as Vector3d. The problem is that subtype objects typically contain more information, such as the z coordinate in Vector3d, and thus their methods often require more time to execute than the methods they override. In this paper, we show how to specify timing constraints for subtypes in a way that both allows overriding subtype methods to have more time to execute and yet permits precise modular verification and checking of timing constraints. Our techniques allow object-oriented coding and design patterns based on subtype polymorphism to be used in real-time and safety-critical software. Copyright (c) 2012 John Wiley & Sons, Ltd.

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

safejml
safety critical java (scj)
java modeling language (jml)
timing behavior
duration
performance
wcet


Solving large sparse linear systems in a grid environment: the GREMLINS code versus the PETSc library Solving large sparse linear systems is essential in numerous scientific domains. Several algorithms, based on direct or iterative methods, have been developed for parallel architectures. On distributed grids consisting of processors located in distant geographical sites, their performance may be unsatisfactory because they suffer from too many synchronizations and communications. The GREMLINS code has been developed for solving large sparse linear systems on distributed grids. It implements the multisplitting method that consists in splitting the original linear system into several subsystems that can be solved independently. In this paper, the performance of the GREMLINS code obtained with several libraries for solving the linear subsystems is analyzed. Its performance is also compared with that of the widely used PETSc library that enables one to develop portable parallel applications. Numerical experiments have been carried out both on local clusters and on distributed grids.

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

asynchronous iterations
grid computing
iterative method
sparse linear solver


adapting word prediction to subject matter without topic-labeled data Word prediction helps to increase communication rate when using Augmentative and Alternative Communication devices. Basic prediction systems offer topically inappropriate predictions for the context, thus we adapt the predictions to the topic of discourse. However, previous work has relied on texts that are grouped into topics by humans. In contrast, we avoid this restriction by treating each document as a topic. The results are comparable to human-labeled topics and also the method is applicable to unlabeled text.

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

language modeling
statistical methods
topic modeling


Reducing the Switching Activity of Test Sequences under Transparent-Scan Transparent-scan is a test application scheme for scan circuits. It provides unique opportunities for test compaction that do not exist with the standard test application scheme. We show that it also provides unique opportunities for reducing the power dissipation of a scan-based test set. After translating a standard scan-based test set into a transparent-scan sequence, we apply two operations for reducing the power dissipation of the sequence. The first operation attempts to remove a test vector that causes high power dissipation. The second operation attempts to replace a scan clock cycle with a functional clock cycle, or a functional clock cycle with a scan clock cycle, in order to reduce the power dissipation. Both operations are implemented such that they reduce the power dissipation without reducing the fault coverage. We also consider a third operation that attempts to complement arbitrary values in the transparent-scan sequence in order to further reduce the power dissipation.

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

reliability
scan design
stuck-at faults
transparent-scan


ON A GENERALIZED QUANTUM SWAP GATE The SWAP gate plays a central role in network designs for qubit quantum computation. However, there has been a view to generalize qubit quantum computing to higher dimensional quantum systems. In this paper we construct a generalized SWAP gate using only instances of the generalized controlled-NOT gate to cyclically permute the states of d qudits for d prime.

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

elementary quantum gates
quantum circuits
modular binomial coefficients


Haptic systems for training sensorimotor skills: A use case in surgery Learning and training sensorimotor tasks typically involve different phases. Usually, the trainee has first to understand the task. He can read books, listen to explanations, look at videos or observe other people. Then he has to perform the task, either on his own or under the supervision of a mentor, to build his own perception action loops. With time and practice, he will progress towards expertise, more efficiently if he receives an appropriate feedback. This common approach has however a limited applicability for safety-critical tasks and for partially blindfolded activities heavily relying on haptics, both commonly found in surgery. Safety issues prevent initial trials and errors and require good performance on the first trial just from explanations and observation, exactly what is missing for blindfolded activities and difficult for complex movements with force accuracy requirements. Haptic systems and virtual reality (VR) technologies allow reproducing such situations, yet without risks for the patient, and offer new opportunities for training. The trainee can learn the task on a multimodal console until he has reached a sufficient proficiency level before moving to the operating room (OR). In this paper, we present how this approach was applied in the context of maxillofacial surgery (MFS). A novel training platform offering high fidelity haptic interactions was specified, developed and evaluated. The first results tend to prove its efficiency in qualifying expertise and training people.

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


visualization and clustering of crowd video content in mpca subspace This paper presents a novel approach for the visualization and clustering of crowd video contents by using multilinear principal component analysis (MPCA). In contrast to feature-point-based approach and frame-based dimensionality reduction approach, the proposed method maps each short video segment to a point in MPCA subspace to take temporal information into account naturally through tensorial representations. Specifically, MPCA projects each short segment of a video to a low-dimensional tensor first. A few MPCA features are then selected according to the variance captured as the final representation. Thus, a video is visualized as a trajectory in MPCA subspace. The trajectory generated enables visual interpretation of video content in a compact space as well as visual clustering of video events. The proposed method is evaluated on the PETS 2009 datasets through comparison with three existing methods for video visualization. The MPCA visualization shows superior performance in clustering segments of the same event as well as identifying the transitions between events.

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


A wavelet-based watermarking for digital images and video Recently, digital contents are copied easily because of the development of digital technology. So digital wa termark technique which aims at copyright protection of digital contents becomes more and more important, and various watch-marking methods have been proposed. In this paper, we proposed a method of digital watermark for still image by using wavelet packets, and examine the robustness of the watermarking method against several image processings. This method can be easily applied to the watermark for video because in this method, embedded data are detected without original image. Therefore, we extend the wavelet-based watermarking method to the case of watermark for video.

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

digital watermark
video
copyright protection


Scalability of Globally Asynchronous QCA (Quantum-Dot Cellular Automata) Adder Design The concept of clocking for QCA, referred to as the four-phase clocking, is widely used. However, inherited characteristics of QCA, such as the way to hold state, the way to synchronize data flows, and the way to power QCA cells, make the design of QCA circuits quite different from VLSI and introduce a variety of new design challenges. The most severe challenges are due to the fact that the overall timing of a QCA circuit is mainly dependent upon its layout. This issue is commonly referred to as the layout = timing problem. To circumvent the problem, a novel self-timed circuit design technique referred to as the Locally Synchronous, globally asynchronous design for QCA has been recently proposed. The proposed technique can significantly reduce the layouttiming dependency from the global network of QCA devices in a circuit; therefore, considerably flexible QCA circuit design is be possible. Also, the proposed technique is more scalable in designing large-scale systems. Since a less number of cells is used, the overall area is smaller and the manufacturability is better. In this paper, numerous multi-bit adder designs are considered to demonstrate the layout efficiency and robustness of the proposed globally asynchronous QCA design technique.

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

qca (quantum-dot cellular automata)
asynchronous architecture
layout timing problem


Good reduction of Puiseux series and applications We have designed a new symbolic-numeric strategy for computing efficiently and accurately floating point Puiseux series defined by a bivariate polynomial over an algebraic number field. In essence, computations modulo a well-chosen prime number p are used to obtain the exact information needed to guide floating point computations. In this paper, we detail the symbolic part of our algorithm. First of all, we study modular reduction of Puiseux series and give a good reduction criterion for ensuring that the information required by the numerical part is preserved. To establish our results, we introduce a simple modification of classical Newton polygons, that we call "generic Newton polygons", which turns out to be very convenient. Finally, we estimate the size of good primes obtained with deterministic and probabilistic strategies. Some of these results were announced without proof at ISSAC'08. (C) 2011 Elsevier Ltd. All rights reserved.

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

algebraic functions
finite fields
symbolic-numeric algorithm


B-spline based, large-signal DC and microwave-model for SOI MOSFETs We present a large/small-signal, non-quasi-static, charge conserving, SOI MOSFET modeling technique suitable for DC and high frequency circuit design. The device model is extracted from small signal microwave iso-thermal Y-parameter data and DC I-V characteristics. Low frequency dispersions associated with self-heating and floating body effects are verified to not limit the performance of this technique since it relies on both DC and transient I-V characteristics. The technique is applied to the modeling of a short-channel, partially depleted, SOI nMOSFET simulated on PISCES. The model generated is incorporated into a circuit simulator, which is used to perform large-signal transient and harmonic balance simulations. The transient I-V and gate charge extracted from the iso-thermal small-signal microwave Y-parameters, are in excellent agreement with the iso-thermal transient I-V and gate charge obtained from PISCES, respectively. The model topology is extended with a parasitic bipolar sub-circuit which automatically calculates the DC operating point for self-biasing circuits. Transient and non-linear power characterization results predicted with this model agree well with those obtained from PISCES for a wide range of input power drives. A complete electro-thermal model is proposed and verified to be able to predict temperature and transient I-V response.

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

microwave modeling
soi technology
electro-thermal model
b-spline
kink effect


A Meta-modeling based Approach for the Multi-Disciplinary Design of Web Educational Systems Multi-disciplinary teams might provide a multi-faceted perspective of web educational systems that integrates experience from different fields. Each expert has a view of the system and she uses domain specific languages in order to express solutions to the problems she is concerned with. In this way, the final system can be seen as a combination of a number of complementary views, each of which focuses on problems of a different nature. However, such views are expressed with different specification tools so that they have to be integrated to produce a common design that is complete and consistent. Creating a common language encompassing multi-disciplinary design views is a challenging endeavor but it might impose a cognitive overload to each member of the group who is exposed to unfamiliar concepts of other disciplines in her design view. Alternatively, this paper describes an approach called MODUWEB that consists of letting each designer use the tool she is proficient in for her design tasks and then complementary design perspectives are integrated using meta-modeling techniques. MODUWEB also includes a number of constraints and semantic rules that guarantee the completeness and consistency of the resulting model.

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

model-driven development
multi-disciplinary design
educational design
web design


Clausal Presentation of Theories in Deduction Modulo Resolution modulo is an extension of first-order resolution in which rewrite rules are used to rewrite clauses during the search. In the first version of this method, clauses are rewritten to arbitrary propositions. These propositions are needed to be dynamically transformed into clauses. This unpleasant feature can be eliminated when the rewrite system is clausal, i.e., when it rewrites clauses to clauses. We show in this paper how to transform any rewrite system into a clausal one, preserving the existence of cut free proofs of any sequent.

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


Visual analytics in cheminformatics: user-supervised descriptor selection for QSAR methods The design of QSAR/QSPR models is a challenging problem, where the selection of the most relevant descriptors constitutes a key step of the process. Several feature selection methods that address this step are concentrated on statistical associations among descriptors and target properties, whereas the chemical knowledge is left out of the analysis. For this reason, the interpretability and generality of the QSAR/QSPR models obtained by these feature selection methods are drastically affected. Therefore, an approach for integrating domain experts knowledge in the selection process is needed for increase the confidence in the final set of descriptors.

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

feature selection
visual analytics
qsar
cheminformatics


robust finger tracking for wearable computer interfacing Key to the design of human-machine gesture interface applications is the ability of the machine to quickly and efficiently identify and track the hand movements of its user. In a wearable computer system equipped with head-mounted cameras, this task is extremely difficult due to the uncertain camera motion caused by the user's head movement, the user standing still then randomly walking, and the user's hand or pointing finger abruptly changing directions at variable speeds. This paper presents a tracking methodology based on a robust state-space estimation algorithm, which attempts to control the influence of uncertain environment conditions on the system's performance by adapting the tracking model to compensate for the uncertainties inherent in the data. Our system tracks a user's pointing gesture from a single head mounted camera, to allow the user to encircle an object of interest, thereby coarsely segmenting the object. The snapshot of the object is then passed to a recognition engine for identification, and retrieval of any pre-stored information regarding the object. A comparison of our robust tracker against a plain Kalman tracker showed a 15\% improvement in the estimated position error, and exhibited a faster response time.

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

robust estimation
gesture interfaces
kalman filter tracking


Towards a social and context-aware multi-sensor fall detection and risk assessment platform We propose a new extensible and adaptable cloud-based fall detection framework. An ontology-based approach is used to model the situation of patient and caregivers. The captured information from the sensors is combined with contextual information. Existing fall detection systems can easily be integrated to improve accuracy. Different combinations of fall detection systems and sensors can be used.

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

fall risk assessment
ontology
semantic
context-aware


resilient consensus protocols A consensus protocol enables a system of n asynchronous processes, some of which are faulty, to reach agreement. There are two kinds of faulty processes: fail-stop processes can only die, malicious processes can also send false messages. We investigate consensus protocols that terminate within finite time with probability 1 under certain assumptions on the behavior of the system. With fail-stop processes, we show that [( n + 1)/2] correct processes are necessary and sufficient to reach agreement. In the malicious case, we show that [(2 n + 1)/3] correct processes are necessary and sufficient to reach agreement. This is contrasted with a recent result that there is no consensus protocol for the fail-stop case that always terminates within a bounded number of steps, even if only one process can fail.

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

process probability case behavior consensus

timing systems asynchronicity message resilience


A dynamic programming algorithm for constructing optimal "1"-ended binary prefix-free codes The generic Huffman-Encoding Problem of finding a minimum cost prefix-free code is almost completely understood. There still exist many variants of this problem which are not as well understood, though. One such variant, requiring that each of the codewords ends with a "1," has recently been introduced in the literature with the best algorithms known for finding such codes running in exponential time. In this correspondence we develop a simple O(n(3)) time algorithm for solving the problem.

O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 simple agent based model for detecting abnormal event patterns in distributed wireless sensor networks Wireless Sensor networks (WSN) is a promising technology for current as well as future. There is vast use of WSN in different fields like military surveillance and target tracking, traffic management, weather forecasting, habitat monitoring, designing smart home, structural and seismic monitoring, etc. For success application of ubiquitous WSN it is important to maintain the basic security, both from external and internal attacks else entire network may collapse. Maintaining security in WSN network is not a simple job just like securing wireless networks because sensor nodes are deployed in randomize manner. Hence major challenges in WSNs are security. In this paper we have discussed different attacks in WSN and how these attacks were efficiently detected by using our agent based model. Our model identifies the abnormal event pattern sensor nodes in a largely deployed distributed sensor network under a common anomaly detection framework which will design by agent based learning and distributed data mining technique.

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

anomaly detection
distributed data mining

machine learning
wireless sensor network


Development of a WLAN Based Monitoring System for Group Activity Measurement in Real-Time In recent years, there has been a rise in epidemiological evidence suggesting the health benefits of a physically active lifestyle. However, it is not always easy for individuals to personally recognize the optimal conditions for exercise and physical activity. Wearable acceleration-based pedometers have become widely used in estimating the amount of physical activity, and to a limited extent, providing information regarding exercise intensity, but they have never been used to assess adaptation to exercise. In order to realize simultaneous activity monitoring for multiple users exercising outdoors, we developed a prototype wireless local area network (WLAN) based system. In our system, a WLAN is deployed outside, and a user wearing a smart phone and monitoring device exercises freely within the coverage area of the wireless network. By doing so, the developed system is able to monitor the activity of each user and measures various parameters including those related to exercise adaptation. In a demonstration experiment, the developed system was evaluated and used to monitor users enjoying a Nordic walk, after which users were immediately able to receive their exercise report. In this paper, we discuss the requirements and issues in developing an activity monitoring system and report the findings we obtained through the demonstration experiment.

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

multiple simultaneous monitoring
nordic walking
outdoor wireless local area network


towards an apl compiler A modification of the APL function - calling mechanism allows the compilation of defined functions in many cases.

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


Flash Crowd in P2P Live Streaming Systems: Fundamental Characteristics and Design Implications Peer-to-peer (P2P) live video streaming systems have recently received substantial attention, with commercial deployment gaining increased popularity in the internet. It is evident from our practical experiences with real-world systems that, it is not uncommon for hundreds of thousands of users to choose to join a program in the first few minutes of a live broadcast. Such a severe flash crowd phenomenon in live streaming poses significant challenges in the system design. In this paper, for the first time, we develop a mathematical model to: 1) capture the fundamental relationship between time and scale in P2P live streaming systems under a flash crowd, and 2) explore the design principle of population control to alleviate the impact of the flash crowd. We carry out rigorous analysis that brings forth an in-depth understanding on effects of the gossip protocol and peer dynamics. In particular, we demonstrate that there exists an upper bound on the system scale with respect to a time constraint. By trading peer startup delays in the initial stage of a flash crowd for system scale, we design a simple and flexible population control framework that can alleviate the flash crowd without the requirement of otherwise costly server deployment.

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


Semi-Thue systems with an inhibitor A semi-Thue system with an inhibitor is one having a special symbol, called an inhibitor, that appears on the right side of every rule but does not appear on the left side of any rule. The main result of this paper is that the uniform halting problem is decidable for the class of such systems. The concept of inhibitor is related to the concept of well-behaved derivation in systems without an inhibitor. The latter concept has received some attention from those interested in the open question as to whether the uniform termination problem for one-rule semi-Thue systems is decidable.

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

string rewriting
semi-thue system
uniform termination
well behaved derivation


A method to take account of inhomogeneity in mechanical component reliability calculations This paper proposes a method by which material inhomogeneity may be taken into account in a reliability calculation. The method employs Monte-Carlo simulation; and introduces a material strength index, and a standard deviation of material strength to model the variation in the strength of a component throughout its volume. The method is compared to conventional load-strength interference theory. The results are identical for the case of homogeneous material, but reliability is shown to reduce for the same load as the component volume increases. The case of a tensile bar is used to explore the variation of reliability with component volume.

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


A success story of formal description techniques: Estelle specification and test generation for MIL-STD 188-220 This paper presents a success story of specifying a complex real-life protocol (MIL-STD 188-220) in Estelle and generating test sequences from the formal specification. 188-220 is being developed in the US Army, Navy and Marine Corps systems for mobile combat network radios. A key factor in this success story has been the collaboration among the researchers of the University of Delaware and the City College of the City University of New York, the developers of the US Army Communications-Electronics Command (CECOM), and the protocol designers in the Joint Combat Net Radio Working Group. Based on the research results, 188-220 test sequences are realizable without timer interruptions while providing a 200% increase in Lest coverage. The test cases are being installed at a CECOM test facility. (C) 2000 Elsevier Science B.V. All rights reserved.

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

conformance resting
test case generation
protocol specification
testing
mil-std 188-220


Bandwidth enhancement in delta sigma modulator transmitter using low complexity time-interleaved parallel delta sigma modulator In this paper, the bandwidth of the delta sigma modulator (DSM)-transmitter is improved using low complexity time-interleaved DSM. The high clock speed requirement of DSM is the main limitation to increase the signal bandwidth in DSM-transmitter. In this research, the bandwidth of DSM-transmitter is increased four times by using low complexity four-branch time-interleaved parallel DSM without the need for increasing clock speed. This low complexity parallel DSM is designed based on polyphase implementation technique. Then, the transmitter architecture is simulated using MATLAB simulink and Advanced Design System (ADS). For this simulation, the uplink long-term evolution (LTE) signal with different bandwidths of up to 7.68MHz is used. The simulation shows that by using four-branch time-interleaved parallel DSM in transmitter architecture for 7.68MHz LTE signal with oversampling ratio (OSR) of 16, the signal to noise and distortion ratio (SNDR) is about 41dB with the clock speed of only 30.72MHz. This is four times lower than the required clock speed of the conventional transmitter to achieve the same SNDR.

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

signal to noise and distortion ratio (sndr)


Fabrication of roll mold using electron-beam direct writing and metal lift-off process Roll-to-roll nanoimprint lithography (RTR-NIL) has received considerable attention as a potential solution for large-area nanopatterning with simultaneous high resolution and throughput. However, progress in RTR-NIL is restricted by the difficulty of fabricating nanoscale roll molds. For example, a seamless roll mold is ideal since seams result in lower product yield. To produce a seamless roll mold with the desired nanopatterns, we previously developed a technique that uses an electron beam (EB) for direct writing onto a rotating cylindrical substrate. However, the EB resist is typically made of soft polymer materials and is not sufficiently tough to withstand RTR-NIL. Thus, after development of the EB resist, a pattern transfer process such as dry etching or metal deposition and lift-off is necessary, but dry etching of the roll substrate is difficult because the substrate must rotate in plasma ambient. Therefore, we used the metal lift-off process to fabricate seamless metal-patterned roll molds, with which we successfully achieved RTR-NIL.

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

roll-to-roll nanoimprint
electron beam lithography
lift-off process
metal patterning


A three-layer model of skin and its application in simulating wrinkling Human skin is a complex multi-layer material. Many existing numerical skin models accurately simulate several of its complex mechanical characteristics. However, few models simulate wrinkling - a phenomenon common to all human skin. In this study, a multi-layer model of skin was developed to simulate wrinkling. The model consisted of the stratum corneum, dermis and underlying hypodermis. The results of the simulations were compared with results of in vivo wrinkling experiments performed on the volar forearm. The proposed three-layer skin model simulates wrinkling more realistically than models of fewer layers. The size of the wrinkles predicted by the model fell within the range of the wrinkle sizes measured in the experiments. The maximum range and average roughness differed by 34 and 43% from the corresponding mean experimental results, respectively. Applications of the model include simulating skin aging, designing more realistic artificial skin and the development of surgical simulators.

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

multi-layer model
finite element
surface profilometer


Accretive equations in cones of Banach space The purpose of this paper is to study the existence of solutions for the equation x,(t) =, -Ax(t), x(0) = x is an element of D(A), where P is a cone of a Banach space and A : P --> P is an accretive mapping satisfying (I + lambda A)(P) =, and to give some sufficient conditions which ensure A(D(A))= P and (I + lambda A)(D(A))= P. (C) 2000 Elsevier Science Ltd. All rights reserved.

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

m-accretive mapping
m-accretive mapping in cone


IN-GM(0, N) cost forecasting model of commercial aircraft based on interval grey numbers Purpose - The purpose of this paper is to construct a novel GM(0, N) model based on grey number sequences and to solve the problem of cost forecasting of commercial aircraft which puzzled managers, especially the factors of cost with uncertain information. Design/methodology/approach - Based on the definition of traditional GM(0, N) model, the paper considers the limited information and knowledge, and the algorithm of grey numbers with greyness and kernel was designed. A novel GM(0, N) model based on grey number sequences, named the IN-GM(0, N) model, is proposed according to the definition of the grey numbers algorithm. The steps of the proposed model are then given. Finally, a case of domestic commercial aircrafts is developed as an example, based on information gathering and model calculating. Findings - The results of this research indicate that the IN-GM(0,N) model is effective in cost calculating, providing reliable technical support for cost estimation of large-scale complex equipment including commercial aircraft. Practical implications - Cost forecasting of commercial aircraft can be solved effectively and the model can also be utilized to predicate other products. Originality/value - The paper succeeds in constructing a novel grey forecasting model. This work contributes significantly to improving grey forecasting theory and to undoubtedly propose more novel grey forecasting models.

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

grey forecasting model
forecasting
commercial aircraft

grey system
gm(0, n) model
interval grey number
accumulating generation
modelling


A neural network to classify fatigue from humancomputer interaction Fatigue, especially in its mental form, is one of the most worrying health problems nowadays. It affects not only health but also motivation, emotions and feelings and has an impact both at the individual and organizational level. Fatigue monitoring and management assumes thus, in this century, an increased importance, that should be promoted by private organizations and governments alike. While traditional approaches are mostly based on questionnaires, in this paper we present an alternative one that relies on the observation of the individual's interaction with the computer. We show that this interaction changes with the onset of fatigue and that these changes are significant enough to support the training of a neural network that can classify mental fatigue in real time. The main outcome of this work is the development of non-invasive systems for the continuous classification of mental fatigue that can support effective and efficient fatigue management initiatives, especially in the context of desk jobs.

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

ambient intelligence
neural networks
human computer interaction


On Potential Cognitive Abilities in the Machine Kingdom Animals, including humans, are usually judged on what they could become, rather than what they are. Many physical and cognitive abilities in the animal kingdom are only acquired (to a given degree) when the subject reaches a certain stage of development, which can be accelerated or spoilt depending on how the environment, training or education is. The term potential ability usually refers to how quick and likely the process of attaining the ability is. In principle, things should not be different for the machine kingdom. While machines can be characterised by a set of cognitive abilities, and measuring them is already a big challenge, known as universal psychometrics, a more informative, and yet more challenging, goal would be to also determine the potential cognitive abilities of a machine. In this paper we investigate the notion of potential cognitive ability for machines, focussing especially on universality and intelligence. We consider several machine characterisations (non-interactive and interactive) and give definitions for each case, considering permanent and temporal potentials. From these definitions, we analyse the relation between some potential abilities, we bring out the dependency on the environment distribution and we suggest some ideas about how potential abilities can be measured. Finally, we also analyse the potential of environments at different levels and briefly discuss whether machines should be designed to be intelligent or potentially intelligent.

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

machine intelligence measurement
(universal) turing machines
universality probability
potential intelligence
(universal) psychometrics


Model of world: Her cities, languages and countries The time evolution of Earth with her cities, languages and countries is considered in terms of the multiplicative noise(1) and the fragmentation processes, where the related families, size distributions, lifetimes, bilinguals, etc. are studied. Earlier we treated the cities and the languages differently (and as connected; languages split since cities split, etc.). Hence, two distributions are obtained in the same computation at the same time. The same approach is followed here and Pareto-Zipf law for the distribution of the cities, log-normal for the languages, decreasing exponential for the city families (countries) in the rank order over population, and power law -2 for the language families over the number of languages in rank order are obtained theoretically in this combination for the first time (up to our knowledge) in the literature; all of which are in good agreement with the present empirical data.

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


a system for peer-to-peer video streaming in resource constrained mobile environments Peer-to-Peer based near-live video streaming is becoming more and more popular with users of fixed-line broadband network access, but it is mostly unavailable to mobile users, as cellular networks, such as GPRS/UMTS, cannot meet the bitrate requirements, while other wireless technologies, such as WLAN, may be fast enough but cover only very limited areas. However, there is a small but important set of scenarios, where several mobile users in close physical proximity are interested in retrieving the same content. We propose a P2P-TV system that enables them to retrieve video chunks in a cooperative way. The coordinated and efficient usage of all wireless resources available to a group of mobile hosts is the key to enable P2P-TV in mobile environments. This paper introduces our general concept. Simulation based studies are presented to assess different resource allocation strategies and to demonstrate the feasibility of our approach for delivering near-live TV in resource constrained mobile environments.

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

mobile iptv
cooperative network access
peer-to-peer


Knowledge organization landscape: A content analysis of introductory courses This paper presents the results of a study examining the subject content of knowledge organization courses taught in ALA-accredited Library and Information Science (LIS) programmes. Close to 2000 course readings of introductory-level knowledge organization courses from 34 LIS schools in the USA and Canada were analysed and indexed. Results indicate that traditional bibliographic methods and practices remain at the core of knowledge organization courses. Findings also show that metadata has become a central component of course content and new topics from information architecture to markup languages and semantic web are becoming part of introductory-level knowledge organization education.

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


a distributed qos guaranteed scheme for ieee 802.16 broadband wireless access systems This paper proposes a distributed quality of service (QoS) guaranteed scheme to guarantee QoS for multimedia services of connection users in IEEE 802.16 broadband wireless access (BWA) Systems. An environment of combination of the fixed wireless connections and mobile wireless connections is considered in this paper. In order to provide better QoS guarantees for connection users in the IEEE 802.16 BWA Systems, efficient QoS guaranteed schemes and corresponding algorithms must be developed in the base station (BS) and subscriber station (SS). According to the connection requests of service types, the QoS influence factors of connection-level and packet-level are analyzed in this paper. We utilize the concept of distributed load balance to share the overheads of BS and SS reasonably. Simulation results show that the proposed scheme is efficient for reducing the connection-blocking probability (CBP), connection-dropping probability (CDP), and packet delay rate.

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

connection-dropping probability
connection-blocking probability
quality of service (qos)
ieee 802.16


Nested splitting conjugate gradient method for matrix equation AXB = C and preconditioning In this paper, we present a nested splitting conjugate gradient (NSCG) iteration method for solving a class of matrix equations with nonsymmetric coefficient matrices. This method is actually inner/outer iterations, which employs a CG-like method as inner iteration to approximate each outer iterate, while each outer iteration is induced by a convergent and symmetric positive definite splitting of the coefficient matrices. Convergence conditions of this method are studied in depth and numerical experiments show the efficiency of this method. Moreover, we show that the use of the quasi-Hermitian splitting as a pre-conditioner can induce an accurate, robust and effective preconditioned Krylov subspace method. (C) 2013 Elsevier Ltd. All rights reserved.

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

conjugate gradient
matrix equations
preconditioning


location-based memory fences Traditional memory fences are program-counter (PC) based. That is, a memory fence enforces a serialization point in the program instruction stream --- it ensures that all memory references before the fence in the program order have taken effect before the execution continues onto instructions after the fence. Such PC-based memory fences always cause the processor to stall, even when the synchronization is unnecessary during a particular execution. We propose the concept of location-based memory fences , which aim to reduce the cost of synchronization due to the latency of memory fence execution in parallel algorithms. Unlike a PC-based memory fence, a location-based memory fence serializes the instruction stream of the executing thread T 1 only when a different thread T 2 attempts to read the memory location which is guarded by the location-based memory fence. In this work, we describe a hardware mechanism for location-based memory fences, prove its correctness, and evaluate its potential performance benefit. Our experimental results are based on a software simulation of the proposed location-based memory fence, and thus expected to incur higher overhead than the proposed hardware mechanism would. Nevertheless, our software experiments show that applications can benefit from using location-based memory fences, but they do not scale as well in some cases, due to the software overhead. These results suggest that a hardware support for location-based memory fences is worth considering.

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

asymmetric synchronization
location-based memory fences
biased locks
the dekker duality
the dekker protocol


Meshless methods with application to metal forming ? In recent years, a new family of computational methods has emerged. The so-called meshless or mesh-free methods have been investigated and used by many researchers for treating a large variety of engineering problems, involving usually large displacements as encountered for example in forming process simulations. The main advantage of meshless methods is the fact that the interpolation accuracy is not significantly affected by the nodal distribution. Nevertheless, a troublesome task in these techniques is the imposition of essential boundary conditions, as in general the Kronecker delta property is not satisfied. Despite of several techniques have been proposed to overcome this problem, an appealing alternative technique which allows to circumvent this difficulty lies in the use of the natural neighbor interpolation (NEM). This paper focuses on the description and analysis of the natural element method, and its application for simulating some forming processes involving large displacements as well as fixed or moving discontinuities.

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

natural neighbor galerkin method
?-shapes
constrained natural element method


The iPICEA-g: a new hybrid evolutionary multi-criteria decision making approach using the brushing technique We propose a new method to model decision-maker preference, the brushing technique. Using the brushing technique, a new decision-making method iPICEA-g is proposed. Experimental results show iPICEA-g performs well.

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

preference articulation
multi-objective optimization
evolutionary algorithms


Research on the relationship between mishap risk and time margin for control: a case study for carrier landing of aircraft The engineering intuitive judgments indicate that the risk levels of many mishaps, including the carrier-landing mishap, are directly related to the time available to correct the abnormal system state. The meaning of time margin and its relationship with the mishap risks is described in this paper. A conceptual model of risk is built, including three variables: mishap probability, mishap severity, and time margin. In a case study of the carrier-landing process, the relationship between mishap risk and carrier-landing time margin for control was investigated using data from 1,978 samples. Statistical analysis shows that in most cases (80% approximately), both mishap probability and mishap severity of carrier landing are negatively correlated with the time margin. Based on these findings, the minimum time margin pilots have to correct possible deviations are quantified in order to minimize the risk during carrier-landing processes.

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

system safety
risk assessment
aircraft carrier-landing


PERFECT STATE TRANSFER ON QUOTIENT GRAPHS We prove new results on perfect state transfer of quantum walks on quotient graphs. Since a graph C has perfect state transfer if and only if its quotient G/pi, under any equitable partition pi, has perfect state transfer, we exhibit graphs with perfect state transfer between two vertices but which lack automorphism swapping them. This answers a question of Godsil (Discrete Mathematics 312(1):129-147, 2011). We also show that the Cartesian product of quotient graphs a square(k)G(k)/pi(k) is isomorphic to the quotient, graph square(k)G(k)/pi, for some equitable partition pi. This provides an algebraic description of a construction due to Feder (Physical Review Letters 97, 180502, 2006) which is based on many-boson quantum walk.

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

quantum walk
perfect state transfer
quotient graphs


Reconfigurable AGU: An Address Generation Unit Based on Address Calculation Pattern for Low Energy and High Performance Embedded Processors Low energy and high performance embedded processor is crucial in the future nomadic embedded systems design. Improvement of memory accesses, especially improvement of spatial and temporal locality is well known technique to reduce energy and increase performance. However, after transformations that improve locality, address calculation often becomes a bottleneck. In this paper, we propose novel AGU (Address Generation Unit) exploration and mapping technique based on a reconfigurable AGU model. Experimental results show that the proposed techniques help exploring AGU architectures effectively and designers can get trade-offs of real life applications for about 10 hours.

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

address generation unit (agu)
reconfigurable architecture
asip design
architecture exploration


A comparative study of automatic techniques for ocular artifact reduction in spontaneous EEG signals based on clinical target variables: A simulation case Eye movement artifacts represent a critical issue for quantitative electroencephalography (EEG) analysis and a number of mathematical approaches have been proposed to reduce their contribution in EEG recordings. The aim of this paper was to objectively and quantitatively evaluate the performance of ocular filtering methods with respect to spectral target variables widely used in clinical and functional EEG studies. In particular the following methods were applied: regression analysis and some blind source separation (BSS) techniques based on second-order statistics (PCA, AMUSE and SOBI) and on higher-order statistics (JADE, INFOMAX and FASTICA). Considering blind source decomposition methods, a completely automatic procedure of BSS based on logical rules related to spectral and topographical information was proposed in order to identify the components related to ocular interference. The automatic procedure was applied in different montages of simulated EEG and electrooculography (EOG) recordings: a full montage with 19 EEG and 2 EOG channels, a reduced one with only 6 EEG leads and a third one where EOG channels were not available. Time and frequency results in all of them indicated that AMUSE and SOBI algorithms preserved and recovered more brain activity than the other methods mainly at anterior regions. In the case of full montage: (i) errors were lower than 5% for all spectral variables at anterior sites; and (ii) the highest improvement in the signal-to-artifact (SAR) ratio was obtained up to 40dB at these anterior sites. Finally, we concluded that second-order BSS-based algorithms (AMUSE and SOBI) provided an effective technique for eye movement removal even when EOG recordings were not available or when data length was short.

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

electroencephalography (eeg)
electrooculography (eog)
blind source separation (bss)
principal component analysis (pca)
independent component analysis (ica)


spurious dependencies and eda scalability Numerous studies have shown that advanced estimation of distribution algorithms (EDAs) often discover spurious (unnecessary) dependencies. Nonetheless, only little prior work exists that would study the effects of spurious dependencies on EDA performance. This paper examines the effects of spurious dependencies on the performance and scalability of EDAs with the main focus on EDAs with marginal product models and the onemax problem. A theoretical model is proposed to analyze the effects of spurious dependencies on the population sizing in EDAs and the theory is verified with experiments. The effects of spurious dependencies on the number of generations are studied empirically. The effects of replacement strategies on the performance of EDAs with spurious linkage are also investigated.

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

population sizing
estimation of distribution algorithms
spurious dependencies
scalability

gambler's ruin model
model accuracy
initial supply
decision making


The use of proof in diversity arguments The limits to the reliability that can be claimed for a design-diverse fault-tolerant system are mainly determined by the dependence that must be expected in the failure behaviours of the different versions: claims for independence between version failure processes are not believable. In this note we examine a different approach, in which a simple secondary system is used as a back-up to a more complex primary. The secondary system is sufficiently simple that claims for its perfection (with respect to design faults) are possible, but there is not complete certainty about such perfection. It is shown that assessment of the reliability of the overall fault-tolerant system in this case may take advantage of claims for independence that are more plausible than those involved in design diversity.

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

software fault tolerance
safety
probability
verification


Supporting negotiation mechanism privacy authority method in cloud computing Cloud computing have become a software paradigm, providing services dynamically according to user requirements. However, it is difficult to control personal privacy information because of the opening, virtualization, multi-tenancy and service outsourcing characters. Therefore how to protect user privacy information has become a research focus in cloud computing. Considering the service outsourcing character, we propose a privacy information description method and negotiation mechanism. Firstly, we describe privacy property with Privacy Negotiation Language (PNL) based on description logic. Secondly, we get privacy attribute sequence through pre-negotiation between user and service composer. Thirdly, though exchanging privacy disclosure assertion, we obtain privacy policy that satisfying both parties. In the end, we put forward privacy policy negotiation algorithm. Through case study we proved the feasibility and correctness of this method.

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

cloud computing
description logic
privacy property
privacy policy


Trends in power system protection and control As a consequence of deregulation, competition and problems in securing capital outlays for expansion of the infrastructure, modern power systems are operating at ever-smaller capacity and stability margins. Traditional entities involved in securing adequate protection and control for the system may soon become inadequate, and the emergence of the new participants (non-utility generation, transmission and distribution companies) requires coordinated approach and careful coordination of the new operating conditions. The paper reviews the key issues and design considerations for the present and new generation of SPS and emergency control schemes, and evaluates the strategies for their implementation.

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

wide area protection
power system blackouts
phasor measurements
voltage stability
angular stability
out-of-step relaying


participatory video prototyping At U S WEST Advanced Technologies, we have been using a method we call Video Prototyping to simulate interface ideas for over a dozen software design projects. It is similar to the work described by Curtis and Vertelney [1], because we create a simple stop-motion animation depicting user interface design concepts. However, Video Prototyping requires no post-production editing or any special expertise in video production. In this way it is more like Muller's PICTIVE work [2], where multi-disciplinary design teams use it in informal brainstorming sessions. Unlike PICTIVE, we do not simply record design ideas but create an evocative simulation of the proposed interface.

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

video use method simulation technologies design expertise animation informal teams

product
edit
prototype
software design
concept
brainstorm
project
interfaces
motion
user interface design
records


Occlusion in collaborative augmented environments Augmented environments superimpose computer enhancements on the real world. Such augmented environments are well suited for collaboration of multiple users. To improve the quality and consistency of the augmentation the occlusion of real objects by computer-generated objects and vice versa has to be implemented. We present methods how this can be done for a tracked user's body and other real objects and how irritating artifacts due to misalignments can be reduced. Our method is based on simulating the occlusion of virtual objects by a representation of the user modeled as kinematic chains of articulated solids. Smoothing the border between virtual world and occluding real reduces registration and modeling errors of this model. Finally, an implementation in our augmented environment and the resulting improvements are presented.

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

virtual reality
augmented reality
interaction
inverse kinematics
avatar
visibility


on traffic characteristics and user experience of skype video call in this paper, we study Skype video call in LAN, WAN, and WiMAX. Our main interest is on traffic characteristics and user experience . Using the standard Foreman video sequence (320x240, 30fps, 8 second), we show that a Skype video call can adapt its source rate from < 5kBps up to ~60kBps. The maximum achievable MOS (Mean Opinion Score) and EFR (Effective Frame Rate) is about 3.5 and 20 fps, respectively. Our experimental results also show that source rate is the dominating factor in determining both traffic characteristics and user experience of a Skype video call; while end-to-end delay or transport layer protocol, e.g. TCP or UDP, plays very little role. We also study the minimum RSSI requirement in a typical WiMAX network for achieving various levels of user experience: good, fair , and low , and derive the explicit logarithmic functions using the curve fitting technique to predict MOS and mean packet inter-arrival time (PIT) based on source rate.

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


The design and implementation of a reconfigurable processor for problems of combinatorial computation ? The paper analyses different techniques that might be employed in order to solve various problems of combinatorial optimization and argues that the best results can be achieved by the use of software running on a general-purpose computer together with an FPGA-based reconfigurable co-processor. It suggests an architecture for a combinatorial co-processor that is based on hardware templates and consists of reconfigurable functional and control units. Finally the paper demonstrates how the co-processor can be applied to two practical applications formulated over discrete matrices, the Boolean satisfiability and covering problems.

reconfigurable combinatorial processor
hardware template
combinatorial problems


An ontology-based content model for intelligent Web content access services Intelligent Web content access is a fundamental Web service, representing the first step toward semantic Web services. A lack of adequate and sufficient interpretation for content in current methods impedes access to content. This study regards Web content as any content described and published in the format of a markup language such as HTML or XML. In this paper, we will present our Content Model, combining subjective information from the content itself with objective information from people's perceptions of this content, providing an integrated interpretation of a content item. During accessing, a search engine examines the description of a content item, as found in the Content Model, to find matching files. An ontology-based Content Model is developed and applied to the Web environment to enhance Web content accessibility. Results of this study demonstrate that the proposed Content Model provides essential content descriptions for locating, accessing, and interacting with content providers.

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

content model
web content access
web services


A SVM based classification method for homogeneous data A novel classification method based on SVM is proposed for binary classification tasks of homogeneous data. The proposed method leverages the homogeneity within the same classes and exploits the difference between different classes. Experimental results indicate the power of the proposed method.

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

multi-observation samples
svm classification


Contract Specification for Hardware Interoperability Testing and Fault Analysis Hardware failures occur especially due to external influences, component aging, or faulty interoperability. By testing, faulty components can be localized, allowing for fault isolation or repair. The contract testing strategy from software specifies component interoperability conditions, and systematically creates correspondent tests ensuring the operability of the system. We adapt contract testing to hardware, providing component specification, and monitoring thereof. Contract specification has to be specialized with requirements on the physical environment and component input signals. Contract testing is then executed through the monitoring of the contract parameters. Furthermore, to reason about the external cause of errors, signal faults are categorized. As a case study, we present an (IC)-C-2 communication system. For this system, a contract is defined, and circuits implemented to perform contract testing and fault categorization. Communication faults, related to hardware errors and to sporadic environment disturbance, are injected in the developed system. These faults are completely detected, but can be only partially categorized by the monitoring approach.

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

digital system testing
fault diagnosis
signal processing


A fuzzy multi-objective approach for sustainable investments This paper develops models for selecting portfolios for conventional and socially responsible investment (SRI) mutual funds according to the preferences of the SRI investor. This involves constructing an investment portfolio that takes into account both financial and social, environmental and ethical (SEE) criteria. The optimal portfolio selection problem is solved when the expected returns of the assets as well as the periodic returns are not precisely known. Instead, incomplete information on the parameters of the model is modeled by fuzzy numbers, which include the true values and are consistent with the Decision Makers beliefs on assets performance. In this paper, the financial criteria taken into account are the expected return and the difference between the returns of the portfolio and a pre-specified benchmark index i.e. a strategy of tracking error (TE) is followed. Moreover, we assume that the investors preferences about SEE features of the portfolio are imprecisely known. In order to model these flexible preferences we propose to use fuzzy decision making. The multidimensional nature of the problem leads us to work with techniques of multiple criteria decision making (MCDM), namely goal programming (GP), and the incomplete information is handled by a fuzzy robust approach. The proposed fuzzy goal programming (FGP) model is applied to a database of UK mutual funds.

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

socially responsible investment
goal programming
fuzzy decision making
tracking error


foundations of schema mapping management In the last few years, a lot of attention has been paid to the specification and subsequent manipulation of schema mappings, a problem which is of fundamental importance in metadata management. There have been many achievements in this area, and semantics have been defined for operators on schema mappings such as composition and inverse. However, little research has been pursued towards providing formal tools to compare schema mappings, in terms of their ability to transfer data and avoid storing redundant information, which has hampered the development of foundations for more complex operators as many of them involve these notions. In this paper, we address the problem of providing foundations for metadata management by developing an order to compare the amount of information transferred by schema mappings. From this order we derive several other criteria to compare mappings, we provide tools to deal with these criteria, and we show their usefulness in defining and studying schema mapping operators. More precisely, we show how the machinery developed can be used to study the extract and merge operators, that have been identified as fundamental for the development of a metadata management framework. We also use our machinery to provide simpler proofs for some fundamental results regarding the inverse operator, and we give an effective characterization for the decidability of the well-known schema evolution problem.

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

model management
data exchange
data integration


Ring to line mapping and orientation invariant transform for object recognition This research uses the ring to line mapping technique to map the object image to the straight-line signals. The 'vector magnitude invariant transform' technique is used to transfer the object signal to an invariant vector magnitude quantity for object-identification. The 'vector magnitude invariant transform' technique can solve the image rotation problem. Various vertical magnitude quantity strips are generated to cope with the image-shifting problem. In this research, 105 comparisons are conducted to find the accuracy-rate of the developed algorithm. Within those 105 comparisons, 15 comparisons are conducted for self-comparison. The other 90 comparisons are conducted for comparisons between two different object images. The algorithm developed in this research can precisely classify the object image.

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

orientation invariant transform
ring to line mapping


genEnsemble: A new model for the combination of classifiers and integration of biological knowledge applied to genomic data In the last years, microarray technology has become widely used in relevant biomedical areas such as drug target identification, pharmacogenomics or clinical research. However, the necessary prerequisites for the development of valuable translational microarray-based diagnostic tools are (i) a solid understanding of the relative strengths and weaknesses of underlying classification methods and (ii) a biologically plausible and understandable behaviour of such models from a biological point of view. In this paper we propose a novel classifier able to combine the advantages of ensemble approaches with the benefits obtained from the true integration of biological knowledge in the classification process of different microarray samples. The aim of the current work is to guarantee the robustness of the proposed classification model when applied to several microarray data in an inter-dataset scenario. The comparative experimental results demonstrated that our proposal working with biological knowledge outperforms other well-known simple classifiers and ensemble alternatives in binary and multiclass cancer prediction problems using publicly available data.

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

microarray data classification
knowledge integration
inter-dataset robustness


Algebraic model for the counter register behaviour We present an algebraic model based on Milner's SCCS for a specific structure of computer memory, namely the counter register. In this paper a concrete structure of the counter register is. to be considered in order to achieve both the counting-down and the counting-up operations. Following the structural. point of view, the target models are based on the behaviour of the internal components of the counter register, as follows: the T flip-flops, based on JK flip-flops, which are consequently based on the SR flip-flops. For each of these hardware components we define two different specifications and, both formally and automatically, prove that those specifications are equivalent. For the automatic verification of the target equivalences we use here the CWB-NC platform.

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

sccs process algebra
bisimulation equivalence
digital circuits


Incremental Solving Techniques for SAT-based ATPG Automatic test pattern generation (ATPG) based on the Boolean satisfiability (SAT) problem has recently been proven to be a beneficial complement to traditional methods. Efficient SAT techniques yield a robust fault classification. In this paper, we present methodologies to improve the efficiency of SAT-based ATPG. First, we give a detailed run time analysis of a state-of-the-art SAT-based ATPG tool. By only taking circuit partitions into account and applying incremental SAT solving, both SAT instance generation and SAT instance solving can be accelerated and the robustness of the ATPG process is increased. Besides the significant run time reduction of SAT-based ATPG, the methodology can additionally be used to improve the test set quality. The proposed techniques are applied for the stuck-at and for the transition fault model. A set of large industrial designs is used to show the efficiency of the approach.

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

automatic test pattern generation (atpg)


Present Situation and Prospect of Medical Knowledge Based Systems in German-speaking Countries Results of an Online Survey Background: After a decrease of interest in classical medical expert systems, the publication activity concerning the medical application of Artificial Intelligence and the interest in medical decision support have markedly, increased. Nonetheless, no systematic exploratory study has yet been carried out, which directly considers the actual fields of applications, exemplary approaches, obstacles, challenges, and future prospect as seen by pioneering users and developers in a given region. Objectives: This paper reports the results of an online survey designed to fill this gap with the "Knowledge Based Systems" working group of the German Society for Medical Informatics, Biometry and Epidemiology (GMDS) in 2010. Methods: The survey was based on an online questionnaire (5 single and multiple choice questions, 8 Likert-scaled items, 7 free text, questions) consented to by the working group. The answers were analyzed by descriptive statistics and a qualitative analysis (bottom-up coding). All academic institutions of Medical Informatics in the German-speaking, countries and contributors reporting KBS-related projects at the relevant scientific conferences and in a journal specialized in the field were invited to participate. Results: The survey reached a response rate of 33.4%. The results show a gap between the reported obstacles of medical KBS (mainly low acceptance and rare use in clinical practice) and their future prospect as stated by the participants. Problems previously discussed in the literature like low acceptance, integration, and sustainability of KBS projects were confirmed. The current situation was characterized by naming exemplary existing systems and specifying promising fields of application. Conclusions: The field of KBS in medicine is more diversified and has evolved beyond expectations in the German-speaking countries.

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

knowledge based systems
medicine
online survey
future


can relevance of images be inferred from eye movements? Query formulation and efficient navigation through data to reach relevant results are undoubtedly major challenges for image or video retrieval. Queries of good quality are typically not available and the search process needs to rely on relevance feedback given by the user, which makes the search process iterative. Giving explicit relevance feedback is laborious, not always easy, and may even be impossible in ubiquitous computing scenarios. A central question then is: Is it possible to replace or complement scarce explicit feedback with implicit feedback inferred from various sensors not specifically designed for the task? In this paper, we present preliminary results on inferring the relevance of images based on implicit feedback about users' attention, measured using an eye tracking device. It is shown that, in reasonably controlled setups at least, already fairly simple features and classifiers are capable of detecting the relevance based on eye movements alone, without using any explicit feedback.

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

relevance
implicit feedback
eye movements


A Hybrid Symbolic Monte-Carlo method for radiative transfer equations We introduce a new model for radiative transfer equations where low energy groups are treated in the diffusion approximation whereas high energy groups are solution of the classical transport equation. This enables to extend the range of validity of usual Implicit Monte-Carlo techniques which behave poorly in regions characterized by a small mean free path. We show that Flecks numerical scheme [J. Comput. Phys. 8 (1971) 313] is not adapted to this modeling and we present an application of Symbolic Monte-Carlo. Properties of the Monte-Carlo matrix are discussed and numerical results are presented.

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


Prediction and spectral profile estimation in multivariate calibration Direct and indirect calibration have been compared with respect to both prediction and model interpretation. This included their ability to estimate the pure spectral profile of each known constituent in a mixture of different metal-ion complexes. In the examples, the predictions by indirect calibration, represented by the PLS and O-PLS methods, were consistently better than those of direct calibration, exemplified by the CLS method. It was further demonstrated that indirect calibration is equally capable to direct calibration in estimating the pure spectral profiles, as long as the unknown systematic variation is properly handled. A linear transformation of the regression coefficient matrix, given by K = B((BB)-B-T)(-1), is all that is needed. Note that this does not only apply to spectral data, but any situation where the Y-variables can be assumed to additively contribute to the variation in the X matrix. Throughout the examples, the O-PLS method was able to maintain good spectral profile estimates and predictions. This indicates that O-PLS may be the approach for simultaneous good prediction and interpretation of complex multivariate systems. Copyright (C) 2004 John Wiley Sons, Ltd.

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

direct calibration
indirect calibration
cls
pls


Automatic diagnosis of septal defects based on tunable-Q wavelet transform of cardiac sound signals We propose a new method for diagnosis of septal defects using TQWT. New feature set based on SAMDF derived from TQWT has been proposed. The effects of Q and decomposition levels on classification performance have been evaluated. Results have been evaluated with classification performance evaluation parameters and ROC graphs. Performance has been compared with existing TQWT based method with same datasets.

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

septal defects
cardiac sound signals
classification

sum of average magnitude difference function (samdf)

least squares support vector machine (ls-svm)


An extended cellular automation using case-based reasoning form simulating urban development in a large complex region Rule-based cellular automata (CA) have been increasingly applied to the simulation of geographical phenomena, such as urban evolution and land-use changes. However, these models have difficulties and uncertainties in soliciting transition rules for a large complex region. This paper presents an extended cellular automaton in which transition rules are represented by using case-based reasoning (CBR) techniques. The common kappa-NN algorithm of CBR has been modified to incorporate the location factor to reflect the spatial variation of transition rules. Multi-temporal remote-sensing images are used to obtain the adaptation knowledge in the temporal dimension. This model has been applied to the simulation of urban development in the Pearl River Delta which has a hierarchy of cities. Comparison indicates that this model can produce more plausible results than rule-based CA in simulating this large complex region in 1988-2002.

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

case-based reasoning
gis
dynamic transition rules


investigating how to effectively combine static concern location techniques As software systems continue to grow and evolve, locating code for maintenance tasks becomes increasingly difficult. Studies have shown that combining static global concern location techniques like search with more structure-based local techniques can improve effectiveness. However, no studies have yet investigated why this occurs. In this paper, we investigate why combining global and local techniques improves effectiveness, and under what conditions. We explore such questions as: "What are the limits of lexical information in locating concerns?", "How far away does a local technique have to go to locate the remaining relevant elements?", and "How sensitive are these results to the query or scoring thresholds of the techniques?". The results of our study can inform design decisions to maximize effective global and local combinations in future concern location techniques.

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

source code exploration
software maintenance
source code search


a novel watermarking method based on fibonacci numbers A digital image scrambling method based on the Fibonacci numbers is presented in [Zou J. et al. 2004]. A novel audio watermarking method based on Fibonacci numbers is given in this paper. The experiment results show that the algorithm has better robust than the traditional phase watermark algorithm. Based on the property of uniformity of the corresponding Fibonacci transformation, the watermarking method has the following advantages: (1) Encoding and decoding are very simple and they can be applied in real-time situations. (2) The algorithm can endure severe attacks such as extreme noise levels, very high loss in its data or data packets, or m3 compression.

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


A parallel Full-CI algorithm A Full Configuration Interaction (Full-CI) algorithm is described. It is an integral-driven approach. with on-the-fly computation of the string-excitation lists that realize the application of the Hamiltonian to the Full-CI vector. The algorithm has been implemented on vector and parallel architectures, both of shared and distributed-memory type. This gave us the possibility of performing large benchmark calculations, with a Full-CI space dimension up to almost ten billion of symmetry-adapted Slater determinants. (C) 2000 Elsevier Science B.V. All rights reserved.

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

ab initio
full-ci
matrix diagonalization
parallelism
input-output


Ubiquitous media agents: a framework for managing personally accumulated multimedia files A novel idea and framework of ubiquitous media agents is presented for managing personal multimedia objects. Media agents are intelligent systems that can autonomously do the following tasks. They automatically collect and build personalized semantic indices of multimedia data on behalf of the user whenever and wherever he accesses/uses these multimedia data. The sources of these semantic descriptions are the textual context of the same documents that contain these multimedia data. The URLs of these multimedia data are indexed using these textual features. When the user wants to use these multimedia data again, the media agents can help the user find relevant multimedia data and provide proper suggestions based on the semantic indices. The media agents learn from the user's interaction records to refine the semantic indices and to model user intentions and preferences. Various algorithms can be used to implement the framework, and a few of them are described in this paper. As shown in the experiments, the media agents are effective in gathering relevant semantics for media objects and learning to provide precise suggestions when the user wants to reuse relevant media objects again.

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

multimedia information management
personal media management
agent
personalization
user adaptation
natural language processing


Anatomical and Functional Imaging of Tumors in Animal Models This review focuses on anatomical (computed tomography, magnetic resonance imaging) and functional (positron emission tomography) imaging methods for tumor localization and identification of experimentally induced tumors in animal models, especially pheochromocytoma. Although anatomical imaging can precisely locate primary and metastatic tumors, functional imaging has high specificity for some tumors, especially those of endocrine origin. This is due to the fact that endocrine tumor cells take up hormone precursors, express hormone receptors and transporters, and synthesize, store, and release hormones. These characteristic properties of endocrine tumors enable investigators to create highly specific radiopharmaceuticals, particularly for positron emission tomography. For example, localization of pheochromocytoma involves [18F]-6F-dopamine. It is a highly specific radiopharmaceutical since it uses the norepinephrine transporter system expressed in most pheochromocytoma cells. Here we review both anatomical and functional imaging methods that are used conjointly in order to localize and identify specific characteristics of tumors

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

pheochromocytoma
anatomical imaging
functional imaging


A technique for FEM optimization under reliability constraint of process variables in sheet metal forming A method is proposed for the optimization, by finite element analysis, of design variables of sheet metal forming processes. The method is useful when the non-controllable process parameters (e.g. the coefficient of friction or the material properties) can be modelled as random variables, introducing a degree of uncertainty into any process solution. The method is suited for problems with large FEM computational times and small process window. The problem is formulated as the minimization of a cost function, subject to a reliability constraint. The cost function is indirectly optimized through a metamodel, built by Kriging interpolation. The reliability, i.e. the failure probability, is assessed by a binary logistic regression analysis of the simulation results. The method is applied to the u-channel forming and springback problem presented in Numisheet 1993, modified by handling the blankholder force as a time-dependent variable.

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

kriging
metamodel
binary logistic regression
reliability