an empirical study on selective sampling in active learning for splog detection This paper studies how to reduce the amount of human supervision for identifying splogs / authentic blogs in the context of continuously updating splog data sets year by year. Following the previous works on active learning, against the task of splog / authentic blog detection, this paper empirically examines several strategies for selective sampling in active learning by Support Vector Machines (SVMs). As a confidence measure of SVMs learning, we employ the distance from the separating hyperplane to each test instance, which have been well studied in active learning for text classification. Unlike those results of applying active learning to text classification tasks, in the task of splog / authentic blog detection of this paper, it is not the case that adding least confident samples peforms best.

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


Stability analysis of nonlinear multivariable Takagi-Sugeno fuzzy control systems This paper points out how the nonlinearities involved in multivariable Takagi-Sugeno (T-S) fuzzy control systems could originate complex behavior phenomena, such as multiple equilibrium points or limit cycles, that cannot be detected using conventional stability analysis techniques. In the paper, the application of MMO frequency-domain methods to predict the existence of multiple equilibria and of limit cycles are presented. The proposed method is based on the formulation of a Lur'e problem from the original structure of a TS fuzzy system with a fuzzy controller. Furthermore, this technique makes straightforward the application of input-output stability techniques such as the multivariable circle criterion, also called the conicity criterion, and the harmonic balance method. Moreover, in the paper, the application of the harmonic balance method has been generalized to the case of MIMO fuzzy system with asymmetric nonlinearities and improved by the decreasing conservatism. A new and more general stability index which could be used to perform a bifurcation analysis of fuzzy control systems is presented. The paper includes a collection of examples where the advantages of the proposed approach are made explicit comparing it to the input-output conicity criterion and the Lyapunov direct method.

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

first harmonic method
input-output stability
lyapunov methods
mimo systems
ts fuzzy systems


A Unifying Approach to Moment-Based Shape Orientation and Symmetry Classification In this paper, the problem of moment-based shape orientation and symmetry classification is jointly considered. A generalization and modification of current state-of-the-art geometric moment-based functions is introduced. The properties of these functions are investigated thoroughly using Fourier series analysis and several observations and closed-form solutions are derived. We demonstrate the connection between the results presented in this work and symmetry detection principles suggested from previous complex moment-based formulations. The proposed analysis offers a unifying framework for shape orientation/symmetry detection. In the context of symmetry classification and matching, the second part of this work presents a frequency domain method, aiming at computing a robust moment-based feature set based on a true polar Fourier representation of image complex gradients and a novel periodicity detection scheme using subspace analysis. The proposed approach removes the requirement for accurate shape centroid estimation, which is the main limitation of moment-based methods, operating in the image spatial domain. The proposed framework demonstrated improved performance, compared to state-of-the-art methods.

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

shape orientation
symmetry classification

complex moments
geometric moments
polar fourier transform
singular value decomposition (svd)


Solution of economic dispatch problems by seeker optimization algorithm Seeker optimization algorithm (SOA), a novel heuristic population-based search algorithm, is utilized in this paper to solve different economic dispatch (ED) problems of thermal power units. In the SOA, the act of human searching capability and understanding are exploited for the purpose of optimization. In this algorithm, the search direction is based on empirical gradient by evaluating the response to the position changes and the step length is based on uncertainty reasoning by using a simple fuzzy rule. The effectiveness of the algorithm has been tested on four different small, as well as, large scale test power systems to solve the ED problems. The outcome of the present work is to establish the SOA as a promising alternative approach to solve the ED problems in practical power systems. Both the near-optimality of the solution and the convergence speed of the algorithm are promising. The results obtained are compared with those published in the recent literatures.

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

economic dispatch
seeker optimization algorithm

multiple fuel options
transmission loss
valve point loading


Specifying memory consistency of write buffer multiprocessors Write buffering is one of many successful mechanisms that improves the performance and scalability of multiprocessors. However, it leads to more complex memory system behavior, which cannot be described using intuitive consistency models, such as Sequential Consistency. It is crucial to provide programmers with a specification of the exact behavior of such complex memories. This article presents a uniform framework for describing systems at different levels of abstraction and proving their equivalence. The framework is used to derive and prove correct simple specifications in terms of program-level instructions of the SPARC total store order and partial store order memories. The framework is also used to examine the SPARC relaxed memory order. We show that it is not a memory consistency model that corresponds to any implementation on a multiprocessor that uses write-buffers, even though we suspect that the SPARC version 9 specification of relaxed memory order was intended to capture a general write-buffer architecture. The same technique is used to show that Coherence does not correspond to a write-buffer architecture. A corollary, which follows from the relationship between Coherence and Alpha, is that any implementation of Alpha consistency using write-buffers cannot produce all possible Alpha computations. That is, there are some computations that satisfy the Alpha specification but cannot occur in the given write-buffer 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Existence of solutions of abstract fractional integrodifferential equations of Sobolev type This paper deals with the study of existence of solutions of nonlinear fractional integrodifferential equations of Sobolev type with nonlocal condition in Banach spaces. The results are obtained by using resolvent operators, fractional calculus and fixed point technique. An example is provided to illustrate the theory.

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


Analysis and Construction of Correctors A post-processing function is used to reduce or eliminate statistical weaknesses of physical random number generators. The output bias of a n-bit input m-bit output function is examined, when the input bits are biased. For this purpose, the definition of (n, m, t)-corrector is introduced; many characterizations and properties of a corrector are presented. It appears as a generalization of the notion of resilience for a vectorial function. Several constructions of correctors from old correctors are also proposed.

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

boolean functions
cryptography
dual codes
physical random number generator
resilient functions


identity certified authentication for ad-hoc networks Ad-hoc networks face huge security lacks. In the most general case entities need to build up a well-defined security association without any pre-established secret or common security infrastructure. In previous work we presented a protocol which provides a weak form of authentication that we call zero common-knowledge (ZCK) authentication. The protocol is extremely efficient and only requires symmetric primitives but does not provide identification. In this work we extend this approach in such a way that our new protocol provides identification at the cost of external infrastructure and moderate computing power. Our new protocol can be used to authenticate messages, e.g., to exchange keys for the earlier ZCK authentication protocol. Compared to public-key schemes, our approach is still very efficient.

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


RELAXING THE IMPACT OF EXTREME UNITS IN DATA ENVELOPMENT ANALYSIS Data envelopment analysis (DEA) is a nonparametric linear programming technique for measuring the relative efficiency of decision making units (DMUs) on the basis of multiple inputs and outputs. DEA assessments, however, are proved to be sensitive to extreme units that deviate substantially in their input/output patterns. In this paper we introduce an approach for handling extreme observations in DEA, i.e., observations that exhibit irregularly high values in some outputs and/or low values in some inputs. Unlike the usual practice of removing such observations, we retain them in the production possibility set reducing their impact on the other units. Our modeling approach is based on the concept of diminishing returns, assuming that the contribution of an output (input) to the efficiency score diminishes as the output increases beyond a pre-specified level, i.e., the level beyond which a value is characterized as extreme. According to our approach the original data set is transformed to an augmented data set, where standard DEA models can then be applied, remaining thus in the grounds of the standard DEA methodology. We illustrate our approach with a numerical example.

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

data envelopment analysis
extreme observations


performance modelling of the o-mac protocol In this paper we derive a qualitative model for O-MAC, an energyefficient MAC protocol designed for sensor networks. Through this model we study how each parameter, such as packet sending rate,node density and end-to-end hop lengths, affects the performance of O-MAC and the limitation of current O-MAC protocol. Moreover,the model gives us the direction of with which to modify thecurrent O-MAC protocol to improve its performance.

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


Trasformation-based bottom-up computation of the well-founded model We present a framework Cot, expressing bottom-up algorithms to compute the well-founded model of non-disjunctive logic programs. Our method is based on the notion of conditional facts and elementary program transformations studied by BRASS and DIX (Brass and Dix. 1994 Brass and Dix, 1999) for disjunctive programs, However. even if we restrict their framework to nondisjunctive programs. their 'residual program' can grow to exponential size. whereas for function-free programs our 'program\ remainder' is always polynomial in the size of the extensional database (EDB). We show that particular orderings of our transformations (we call them strategies) correspond to well-known computational methods like the alternating fixpoint approach (Van Gelder, 1989 Van Gelder, 1993), the kell-rounded magic sets method (Kemp et al., 1995) and the magic alternating fixpoint procedure (Morishita. 1996). Ho Never. due to the confluence of our calculi (first noted in Brass and Dix, 1998). we come up with computations of the well-founded model that are prod ably better than these methods. In contrast to other approaches. Our transformation method treats magic set transformed programs correctly. i.e. it always computes a relevant part of the Well-founded model of the original program. These results show that our approach is a valuable tool to analyze. compare, and optimize existing evaluation methods or to create new strategies that are automatically proven to be correct if they can be described by a sequence of transformations in our framework. We have also developed a prototypical implementation, Experiments illustrate that the theoretical results carry over to the implemented prototype and may be used to optimize real life systems.

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

alternating fixpoint
magic set
transformation

well-founded semantics
bottom-up evaluation


A model-driven approach for real-time road recognition This article describes a method designed to detect and track road edges starting from images provided by an onboard monocular monochromic camera. Its implementation on specific hardware is also presented in the framework of the VELAC project. The method is based on four modules: (1) detection of the road edges in the image by a model-driven algorithm, which uses a statistical model of the lane sides which manages the occlusions or imperfections of the road marking - this model is initialized by an off-line training step; (2) localization of the vehicle in the lane in which it is travelling; (3) tracking to define a new search space of road edges for the next image; and (4) management of the lane numbers to determine the lane in which the vehicle is travelling. The algorithm is implemented in order to validate the method in a real-time context. Results obtained on marked and unmarked road images show the robustness and precision of the method.

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

lane recognition
driving assistance
on-board systems
real-time computer vision
model-driven image analysis


Unified Bundling and Registration of Brain White Matter Fibers Magnetic resonance diffusion tensor imaging is being widely used to reconstruct brain white matter fiber tracts. To characterize structural properties of the tracts, reconstructed fibers are often grouped into bundles that correspond to coherent anatomic structures. For further group analysis of fiber bundles, it is desirable that corresponding bundles from different studies are coregistered. To address these needs simultaneously, a unified fiber bundling and registration (UFIBRE) framework is proposed in this work. The framework is based on maximizing a posteriori Bayesian probabilities using an expectation maximization algorithm. Given a set of segmented template bundles and a whole-brain target fiber set, the UFIBRE algorithm optimally bundles the target fibers and registers them with the template. The bundling component in the UFIBRE algorithm simplifies fiber-based registration into bundle-to-bundle registration, and the registration component in turn guides the bundling process to find bundles consistent with the template. Experiments with in vivo data demonstrate that the estimated bundles have an similar to 80% consistency with ground truth and the root mean square error between their bundle medial axes is less than one voxel. The proposed algorithm is highly efficient, offering potential routine use for group analysis of white matter fibers.

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

bundling
diffusion tensor imaging
registration
white matter fibers


SCALABLE PP-1 BLOCK CIPHER A totally involutional, highly scalable PP-1 cipher is proposed, evaluated and discussed. Having very low memory requirements and using only simple and fast arithmetic operations, the cipher is aimed at platforms with limited resources, e. g., smartcards. At the core of the cipher's processing is a carefully designed S-box. The paper discusses in detail all aspects of PP-1 cipher design including S-box construction, permutation and round key scheduling. The quality of the PP-1 cipher is also evaluated with respect to linear cryptanalysis and other attacks. PP-1's concurrent error detection is also discussed. Some processing speed test results are given and compared with those of other ciphers.

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

symmetric cipher
scalable cipher
s-box construction
resistance against cryptanalysis


mapping cultural friction in cross-border collaboration This paper reviews distinctive attempts to bridge the gap between economic modeling and cultural studies and focus on the advanced tools to measure cultural friction/distance between and among countries. We further suggest that empirical studies such as 62-nations' Global Leadership and Organizational Behavior Effectiveness (GLOBE), contribute to mapping cultural friction and permit predictions in cross-border economic collaboration. The paper displays examples of cultural mapping for the United States and for Russia.

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

globe project
cultural distance
cross-border collaboration


A note on the SPT heuristic for solving scheduling problems with generalized due dates Two NP-hard scheduling problems on parallel identical machines with generalized due dates are studied. We focus on two objectives: (i) minimizing maximum tardiness and (ii) minimizing total tardiness. In both cases, we introduce a shortest processing time first (SPT)-based heuristic and simple lower bounds on the optimal cost. Our numerical study indicates that the SPT heuristic performs extremely well in all settings. In traditional scheduling literature, due dates are job dependent, i.e., a specific job has to be completed by a given due date. When generalized due dates are considered, a certain number of jobs must be completed by each specified due date. The identity of the jobs is immaterial. In this note, we address two hard multi-machine scheduling problems with generalized due dates. We introduce a simple and efficient heuristic, which is shown numerically to produce very close to optimal schedules.

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


Dynamically monitoring the service efficiency with tracking signals Purpose - Nowadays, diversity management in business organizations becomes so imperative in a time-sensitive business. However, diversity should not be measured as a static number. To better understand the fast-changing terrain, the paper aims to strongly propose using the tracking signal method to dynamically monitor the efficiency performance in regard to the future of diversity and best practices. This will allow diversity to play a more strategic role in cultivating sustainable business growth. Design/methodology/approach - The paper employs the tracking signal, widely used to monitor the performance of a forecasting model, with some extension to dynamically monitor the technical efficiency due to its ability in alarming out-of-control signals. Findings - The approach is considered as a quantitative, objective and reasonable evaluation system because it can quickly alert employees with inferior performance and promote those with persistently outstanding performance. It also provides managers the right timing to find assignable causes affecting their workers' performance. Most importantly, it can be unsophisticatedly implemented in many aspects of efficiency evaluation for assisting organizations to improve their competitive power through efficiency gains and well expedite their broadly managerial decisions. Originality/value - The majority of previous researches aggregate multi-dimensional efficiencies by different weighting strategies into a single index before making their judgments. These approaches mainly focus on the first phase of the decision-making procedure by considering the efficiency in a static-state. As efficiency is time-sensitive, it should be evaluated dynamically. Thus, serving as the second phase of the procedure, the method is a complement of previous researches.

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

diversified management
dynamic monitoring


A surprising Radon transform result and its application to motion detection An elliptical region of the plane supports a positive-valued function whose Radon transform depends only on the slope of the integrating line. Any two parallel lines that intersect the ellipse generate equal line integrals of the function. We prove that this peculiar property is unique to the ellipse; no other convex, compact region of the plane supports a nonzero-valued function whose Radon transform depends only on slope. We motivate this problem by considering the detection of a constant-velocity moving object in a sequence of images, in the presence of additive, white, Gaussian noise. The intensity distribution of the object is known, but the velocity is only assumed to lie in some known set, for example, an ellipse or a rectangle. The object is to find a space-time linear filter, operating on the image sequence, whose minimum output signal-to-noise ratio (SNR) for any velocity in the set is maximized. For an ellipse (and its special cases, the disk and the line-segment) the special Radon transform property of the ellipse enables us to obtain a closed-form, analytical solution for the minimax filter, which significantly outperforms the conventional three-dimensional (3-D) matched filter. This analytical solution also suggests a constrained minimax filter for other velocity sets, obtainable in closed form, whose SNR can be very close to the minimax SNR.

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


Speech emotion recognition using hidden Markov models In emotion classification of speech signals, the popular features employed are statistics of fundamental frequency, energy contour, duration of silence and voice quality. However, the performance of systems employing these features degrades substantially when more than two categories of emotion are to be classified. In this paper, a text independent method of emotion classification of speech is proposed. The proposed method makes use of short time log frequency power coefficients (LFPC) to represent the speech signals and a discrete hidden Markov model (HMM) as the classifier. The emotions are classified into six categories. The category labels used are, the archetypal emotions of Anger, Disgust, Fear, Joy, Sadness and Surprise. A database consisting of 60 emotional utterances, each from twelve speakers is constructed and used to train and test the proposed system. Performance of the LFPC feature parameters is compared with that of the linear prediction Cepstral coefficients (LPCC) and mel-frequency Cepstral coefficients (MFCC) feature parameters commonly used in speech recognition systems. Results show that the proposed system yields an average accuracy of 78% and the best accuracy of 96% in the classification of six emotions. This is beyond the 17% chances by a random hit for a sample set of 6 categories. Results also reveal that LFPC is a better choice as feature parameters for emotion classification than the traditional feature parameters.

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

log frequency power coefficients
hidden markov model

recognition of emotion
emotional speech
human communication


Identity-based deniable authentication for ad hoc networks Deniable authentication is an important security requirement for ad hoc networks. However, all known identity-based deniable authentication (IBDA) protocols are lack of formal security proof which is very important for cryptographic protocol design. In this paper, we propose a non-interactive IBDA protocol using bilinear pairings. Our protocol admits formal security proof in the random oracle model under the bilinear Diffie-Hellman assumption. Our protocol is faster than all known IBDA protocols of its type. In addition, our protocol supports batch verification that can speed up the verification of authenticators. This characteristic makes our protocol useful in ad hoc networks.

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

ad hoc networks
deniable authentication
bilinear pairings
random oracle model


3E: Energy-efficient elastic scheduling for independent tasks in heterogeneous computing systems Reducing energy consumption is a major design constraint for modern heterogeneous computing systems to minimize electricity cost, improve system reliability and protect environment. Conventional energy-efficient scheduling strategies developed on these systems do not sufficiently exploit the system elasticity and adaptability for maximum energy savings, and do not simultaneously take account of user expected finish time. In this paper, we develop a novel scheduling strategy named energy-efficient elastic (3E) scheduling for aperiodic, independent and non-real-time tasks with user expected finish times on DVFS-enabled heterogeneous computing systems. The 3E strategy adjusts processors supply voltages and frequencies according to the system workload, and makes trade-offs between energy consumption and user expected finish times. Compared with other energy-efficient strategies, 3E significantly improves the scheduling quality and effectively enhances the system elasticity.

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

heterogeneous computing system
energy-efficient
dvfs


Parametric optimization of complex systems using a multi-domain FRF-based substructuring method A general procedure for a parametric sensitivity analysis of a complex system has been presented using a multi-domain FRF-based substructuring formulation. The direct differentiation of reaction forces on the interface boundaries with respect to the design vector is used to obtain a design sensitivity formula of responses in any substructure. A simple example for a ladder structure is introduced to verify the formulation numerically. The proposed method is applied to an optimization problem of an engine mount system to minimize the interior sound over the concerned rpm range. The optimized interior noise in a passenger car shows that the proposed design sensitivity formulation is efficient and accurate.

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

design sensitivity analysis
frf-based substructuring method
vibro-acoustic system


Computer Application in Solving Statically Determinate Truss Problems Using FEA and Matlab Finite Element Analysis (FEA) is a very powerful tool that is used in virtually every area in the held of Mechanical Engineering and many other disciplines. It is beneficial for the mechanical engineering students to have exposure to this tool as early as possible and as frequently as possible in their engineering education. The earliest time comes when the students are taught the truss problems in Statics. However, the traditional finite element formulation uses the displacement as the solution variable, and the deformation theory is generally not covered in a traditional Statics course. In this article, a MATLAB computer model of FEA solution for truss problems is presented, Finite element formulations for truss problems with the solution variables being the forces inside the truss members and the reaction forces at the fixed and sliding joints are presented step by step, The property of the final assembled coefficient matrix, with the boundary conditions applied, determines the truss problem at hand to be statically determinate or statically indeterminate. Using this approach, students in sophomore Statics course can be taught the FEA methodology, without knowing the deformation theory. The computer implementation using Matlab also strengthens the students' knowledge of the software that they learned in a freshman Computer Tools For Engineers class and their programming skills. (C) 2009 Wiley Periodicals, Inc. Comput Appl Eng Educ 17: 363-371, 2009; Published online in Wiley InterScience (www.interscience.wiley.com); DOI 10.1002/cae.20168

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


Multicategory Large-Margin Unified Machines Hard and soft classifiers are two important groups of techniques for classification problems. Logistic regression and Support Vector Machines are typical examples of soft and hard classifiers respectively. The essential difference between these two groups is whether one needs to estimate the class conditional probability for the classification task or not. In particular, soft classifiers predict the label based on the obtained class conditional probabilities, while hard classifiers bypass the estimation of probabilities and focus on the decision boundary. In practice, for the goal of accurate classification, it is unclear which one to use in a given situation. To tackle this problem, the Large-margin Unified Machine (LUM) was recently proposed as a unified family to embrace both groups. The LUM family enables one to study the behavior change from soft to hard binary classifiers. For multicategory cases, however, the concept of soft and hard classification becomes less clear. In that case, class probability estimation becomes more involved as it requires estimation of a probability vector. In this paper, we propose a new Multicategory LUM (MLUM) framework to investigate the behavior of soft versus hard classification under multicategory settings. Our theoretical and numerical results help to shed some light on the nature of multicategory classification and its transition behavior from soft to hard classifiers. The numerical results suggest that the proposed tuned MLUM yields very competitive performance.

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

large-margin
soft classification
support vector machine


Room for archives? Use of archival materials in No Gun Ri research Archivists have long tried to understand users from the viewpoint of their archival collections. Such an approach misses important perspectives about use in, and users of, archives; how they perform research and develop knowledge while using archives. This study aims to comprehend the use of archival materials in research from the users perspective. It attempts to understand users perceptions of the impact of archival collections on their research, how and when archival materials are involved in the research process and how much weight they grant those materials in support of their thesis, from an actual research topic, the No Gun Ri massacre. The case of the No Gun Ri incident provides a good example of how archival materials play a role in historical discussions and an opportunity to look at archival contributions. No Gun Ri researchers acknowledged that archival documents were essential source materials for details about the incident and a major player in stimulating controversies and, consequently, provided the impetus for further publications. General recordkeeping situations also provided a circumstantial context of the incident. However, No Gun Ri researchers agreed that oral history was the most valuable and influential evidence for their major ideas and used archival documents to provide hard facts about the details of oral history. There are some unique research patterns of No Gun Ri researchers identified in this study which are different from the typical assumptions of archivists.

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

user study
archival impact on historical research


Power quality disturbance classification using Hilbert transform and RBF networks This paper presents the application of Hilbert transform and artificial neural network (ANN) for power quality (PQ) disturbance classification. The input features of the ANN are extracted from the envelope of the disturbance signals by applying Hilbert transform (HT). The features obtained from the Hilbert transform are distinct, understandable and immune to noise. These features after normalization are given to the radial basis function (RBF) neural network. The data required to develop the network are generated by simulating various faults in a test system. The performance of the proposed method is compared with the existing feature extraction techniques in combination with other ANN architectures. Simulation results show the effectiveness of the proposed method for power quality disturbance classification.

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


Hyper-systolic algorithms for N-body computations and parallel level-3 BLAS libraries Hyper-systolic algorithms represent a new class of parallel computing structures. Because of their regular communication and compute patterns they are well suited for implementation on most parallel architectures, in particular, high performance SIMD machines can benefit considerably. After a short explanation of the concept of hyper-systolic algorithms, their application to N-body computations and distributed matrix multiplication is discussed. Results from real implementations are presented.

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

systolic
hyper-systolic
hpc
n-body problem
level-3 blas


A bumpless hybrid supervisory control algorithm for the formation of unmanned helicopters This paper presents a bumpless hybrid supervisory control scheme for the formation of unmanned helicopters. The approach is based on the polar partitioning of the space, from which a finite bisimilar quotient transition system of the original continuous variable control system is obtained. Then, to implement the designed hybrid supervisory control algorithm, a hierarchical control structure is introduced with a discrete supervisor on the top layer that is connected to the regulation layer via an interface layer. Transiting over the partitioned space may cause jumps on the generated control signal which is harmful for a real flight system. Hence, a smooth control mechanism is introduced that has no jump when the system's trajectory transits from one region to its adjacent region while preserving the bisimulation relation between the abstract model and the original partitioned system. Several actual flight tests have been conducted to verify the algorithm and the control performance. (C) 2013 Elsevier Ltd. All rights reserved.

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

formation control
unmanned aerial vehicles (uavs)
implementation issues


A brain tumor segmentation framework based on outlier detection ? This paper describes a framework for automatic brain tumor segmentation from MR images. The detection of edema is done simultaneously with tumor segmentation, as the knowledge of the extent of edema is important for diagnosis, planning, and treatment. Whereas many other tumor segmentation methods rely on the intensity enhancement produced by the gadolinium contrast agent in the T1-weighted image, the method proposed here does not require contrast enhanced image channels. The only required input for the segmentation procedure is the T2 MR image channel, but it can make use of any additional non-enhanced image channels for improved tissue segmentation. The segmentation framework is composed of three stages. First, we detect abnormal regions using a registered brain atlas as a model for healthy brains. We then make use of the robust estimates of the location and dispersion of the normal brain tissue intensity clusters to determine the intensity properties of the different tissue types. In the second stage, we determine from the T2 image intensities whether edema appears together with tumor in the abnormal regions. Finally, we apply geometric and spatial constraints to the detected tumor and edema regions. The segmentation procedure has been applied to three real datasets, representing different tumor shapes, locations, sizes, image intensities, and enhancement.

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

brain tumor segmentation
outlier detection

automatic brain segmentation
level-set evolution
robust estimation


Trajectory-Based Statistical Forwarding for Multihop Infrastructure-to-Vehicle Data Delivery This paper proposes Trajectory-based Statistical Forwarding (TSF) scheme, tailored for the multihop data delivery from infrastructure nodes (e. g., Internet access points) to moving vehicles in vehicular ad hoc networks. To our knowledge, this paper presents the first attempt to investigate how to effectively utilize the packet destination vehicle's trajectory for such an infrastructure-to-vehicle data delivery. This data delivery is performed through the computation of a target point based on the destination vehicle's trajectory that is an optimal rendezvous point of the packet and the destination vehicle. TSF forwards packets over multihop to a selected target point where the vehicle is expected to pass by. Such a target point is selected optimally to minimize the packet delivery delay while satisfying the required packet delivery probability. The optimality is achieved analytically by utilizing the packet's delivery delay distribution and the destination vehicle's travel delay distribution. Through theoretical analysis and extensive simulation, it is shown that our design provides an efficient data forwarding under a variety of vehicular traffic conditions.

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

infrastructure
data forwarding
trajectory
delivery delay
delivery probability


Selective Message Forwarding in Delay Tolerant Networks It is challenging to deliver messages in a network where no instant end-to-end path exists, so called delay-tolerant network (DTN). Node encounters are used for message forwarding. In this paper, we propose a DTN routing protocol SMART. SMART utilizes the travel companions of the destinations (i.e. nodes that frequently meet the destination) to increase the delivery opportunities while limiting message overhead to a bounded number. Our approach differs from related work in that it does not propagate node encounter history nor the delivery probabilities derived from the encounter history. In SMART, a message source injects a fixed number of message copies into the network to forward the message to a companion of the destination, which only forwards the message to a fixed number of the destinations companions. Our analysis and simulation results show that SMART has a higher delivery ratio and a smaller delivery latency than the schemes that only use controlled opportunistically-forwarding mechanism and has a significantly smaller routing overhead than a pure flooding scheme.

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


A novel fingerprint matcher based on an ergodic 2-D Hidden Markov Model In this paper, a new approach for fingerprint ridge orientation field matching based on a novel HMM (Hidden Markov Model) is proposed. The proposed method comprises several steps. First steps are devoted to regular fingerprint preprocesses and ridge orientation estimation. Then, the fingerprint images are registered along a reference point. Next, the proposed HMM topology is applied to the predetermined fingerprint orientation field information around the reference point. The suggested HMM is of improved training abilities. After applying the proposed HMM to the ridge orientation field, the matching cells are produced. These cells consist of transition, observation and initial probability matrices which will be used in the matching procedure. The proposed matching method has been evaluated using some creditable fingerprint databases such as FVC2000 DB2_A, FVC2004 DB3_A and DB4_A. The evaluation results confirm higher efficiency, robustness and accuracy for the proposed method compared with the previously proposed matching ones.

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

ergodic topology
embedded hidden markov modeling (ehmm)
orientation field (of)


Hierarchical facial landmark localization via cascaded random binary patterns A regression framework is designed for multi-view facial landmark localization. The use of comparison based feature is highly efficient for landmark localization. Gradient-boosted decision tree is superior to random forest for localization task. Accuracy and speed are tested on the widely used open dataset: LFW, AFLW and 300-W.

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

random binary pattern
hierarchical regression
gradient boosting decision tree


evaluating new search engine configurations with pre-existing judgments and clicks We provide a novel method of evaluating search results, which allows us to combine existing editorial judgments with the relevance estimates generated by click-based user browsing models. There are evaluation methods in the literature that use clicks and editorial judgments together, but our approach is novel in the sense that it allows us to predict the impact of unseen search models without online tests to collect clicks and without requesting new editorial data, since we are only re-using existing editorial data, and clicks observed for previous result set configurations. Since the user browsing model and the pre-existing editorial data cannot provide relevance estimates for all documents for the selected set of queries, one important challenge is to obtain this performance estimation where there are a lot of ranked documents with missing relevance values. We introduce a query and rank based smoothing to overcome this problem. We show that a hybrid of these smoothing techniques performs better than both query and position based smoothing, and despite the high percentage of missing judgments, the resulting method is significantly correlated (0.74) with DCG values evaluated using fully judged datasets, and approaches inter-annotator agreement. We show that previously published techniques, applicable to frequent queries, degrade when applied to a random sample of queries, with a correlation of only 0.29. While our experiments focus on evaluation using DCG , our method is also applicable to other commonly used metrics.

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

relevance estimation
relevance evaluation


Mobile agent based service subscription and customization using the UMTS virtual home environment This paper will study the mobile agent based realization of the Virtual Home Environment concept in an UMTS environment. The VHE concept will enable users to get access to their communication environment including subscribed services and profiles independent of the service provider they are using currently. This makes new concepts for service subscription and service configuration procedures necessary. Mobile agents could help to fulfil these tasks. Therefore a special emphasis will be on the mobile agent based realization of subscription and service configuration concepts. Finally, a mobile service for call control handling will be introduced which uses the previously introduced concepts.

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

universal mobile telecommunication system (umts)


On quiescent reliable communication We study the problem of achieving reliable communication with quiescent algorithms (i.e., algorithms that eventually stop sending messages) in asynchronous systems with process crashes and lossy links. We first show that it is impossible to solve this problem in asynchronous systems (with no failure detectors). We then show that, among failure detectors that output lists of suspects, the weakest one that can be used to solve this problem is lozenge P, a failure detector that cannot be implemented. To overcome this difficulty, we introduce an implementable failure detector called Heartbeat and show that it can be used to achieve quiescent reliable communication. Heartbeat is novel: in contrast to typical failure detectors, it does not output lists of suspects and it is implementable without timeouts. With Heartbeat, many existing algorithms that tolerate only process crashes can be transformed into quiescent algorithms that tolerate both process crashes and message losses. This can be applied to consensus, atomic broadcast, k-set agreement, atomic commitment, etc.

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

algorithms
reliable communication
asynchronous systems
heartbeat

reliability
quiescence
crash failures
link failures
failure detection
fault-tolerance
message passing
processor failures


Architecture Independent Characterization of Embedded Java Workloads This paper presents architecture independent characterization of embedded Java workloads based on the industry standard GrinderBench benchmark which includes different classes of real world embedded Java applications. This work is based on a custom built embedded Java Virtual Machine (JVM) simulator specifically designed for embedded JVM modeling and embodies domain specific details such as thread scheduling, algorithms used for native CLDC APIs and runtime data structures optimized for use in embedded systems. The results presented include dynamic execution characteristics, dynamic bytecode instruction mix, application and API workload distribution, Object allocation statistics, instruction-set coverage, memory usage statistics and method code and stack frame characteristics.

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


Design of directed acyclic graph multiclass structures One of the approaches adopted to generate multiclass classifiers from binary predictors is to decompose the multiclass problem into multiple binary sub-problems. Among the existing decomposition approaches, one may cite the use of Directed Acyclic Graphs (DAG) to combine pairwise classifiers. This work presents a study on the influence of the DAG structure in the performance obtained in multiclass problems when Support Vector Machines are used in the induction of the binary predictors.

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

machine learning
multiclass classification problems
genetic algorithms


On the global output convergence of a class of recurrent neural networks with time-varying inputs ? This paper studies the global output convergence of a class of recurrent neural networks with globally Lipschitz continuous and monotone nondecreasing activation functions and locally Lipschitz continuous time-varying inputs. We establish two sufficient conditions for global output convergence of this class of neural networks. Symmetry in the connection weight matrix is not required in the present results which extend the existing ones.

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

recurrent neural networks
global output convergence

time-varying input
lyapunov diagonal stability
lipschitz continuity
optimization


Consistent Nonparametric Regression for Functional Data Under the Stone-Besicovitch Conditions In this paper, we address the problem of nonparametric regression estimation in the infinite-dimensional setting. We start by extending the Stone's seminal result to the case of metric spaces when the probability measure of the explanatory variables is tight. Then, under slight variations on the hypotheses, we state and prove the theorem for general metric measure spaces. From this result, we derive the mean square consistency of the k-NN and kernel estimators if the regression function is bounded and the Besicovitch condition holds. We also prove that, for the uniform kernel estimate, the Besicovitch condition is also necessary in order to attain L-1 consistency for almost every x.

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

functional data
nonparametric regression


Isogeometric Schwarz preconditioners for linear elasticity systems Isogeometric Schwarz preconditioners are constructed and analyzed for both compressible elasticity in primal formulation and almost incompressible elasticity in mixed formulation. These preconditioners require the solution of local elasticity problems on overlapping subdomains forming a decomposition of the problem domain and the solution of a coarse elasticity problem associated with the subdomain coarse mesh. An h-analysis of the preconditioner for the primal formulation of compressible elasticity yields an optimal convergence rate bound that is scalable in the number of subdomains and is linear in the ratio between subdomain and overlap sizes. Extensive numerical experiments in 2D and 3D confirm this theoretical bound and show that an analogous bound holds for the mixed formulation of almost incompressible elasticity. The numerical tests also show the good preconditioner performance with respect to the polynomial degree p and regularity k of the isogeometric basis functions, as well as with respect to the presence of discontinuous elastic coefficients in composite materials and to domain deformation.

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

scalable domain decomposition preconditioners


Fast estimation algorithm for likelihood-based analysis of repeated categorical responses Likelihood-based marginal regression modelling for repeated, or otherwise clustered, categorical responses is computationally demanding. This is because the number of measures needed to describe the associations within a cluster increase geometrically with increasing cluster size. The proposed estimation methods typically describe the associations using odds ratios, which result in computationally unfeasible solutions for large cluster sizes. An alternative method for joint modelling of the regression, association, and dropout mechanism for clustered categorical responses is presented. The joint distribution of a multivariate categorical response is described by utilizing the mean parameterization, which facilitates maximum likelihood estimation in two important respects. The models are illustrated by analyses of the presence and absence of schizophrenia symptoms on 86 patients at 12 repeated time-points, and a survey of opinions of 607 adults regarding government spending on nine different targets, measured on a common 3-level ordinal scale. Free software is available.

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

repeated categorical data
dependence ratio
marginal model
association model
selection model


Freedom of Privacy: Anonymous Data Collection with Respondent-Defined Privacy Protection The massive amount of sensitive survey data about individuals that agencies collect and share through the Internet is causing a great deal of privacy concerns. These concerns may discourage individuals from revealing their sensitive information. Existing data collection techniques have serious downsides in terms of both efficiency and the levels of protection they offer against various realizations of threats. Moreover, they do not provide any flexibility to the users to be able to specify acceptable levels of privacy protection before deciding whether to participate in the surveys. In this paper, we propose a two-pronged privacy protection model corresponding to these two privacy concerns: these are a new efficient anonymity preserving data collection technique and a method to incorporate heterogeneous privacy constraints. Together, they help preserve the privacy of respondents both during and after data collection.

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


scalable pedestrian simulation for virtual cities Most of the common approaches for the pedestrian simulation, used in the Graphics/VR community, are bottom-up. The avatars are individually simulated in the space and the overall behavior emerges from their interactions. This can lead to interesting results but it does not scale and can not be applied to populating a whole city. In this paper we present a novel method that can scale to a scene of almost any size. We use a top-down approach where the movement of the pedestrians is computed at a higher level, taking a global view of the model, allowing the flux and densities to be maintained at very little cost at the city level. This information is used for stochastically guiding a more detailed and realistic low level simulation when the user zooms in to a specific region, thus maintaining the consistency.At the heart of the system is an iterative method that models the flow of avatars as a random walk. People are moved around a graph of nodes until the model reaches a steady state which provides feedback for the avatar low level navigation at run time. The Negative Binomial distribution function is used to model the number of people leaving each node while the selected direction is based on the popularity of the nodes through their preference-factor. The preference-factor is a function of a number of parameters including the visibility of a node, the events taking place in it and so on.An important feature of the low-level dynamics is that a user can interactively specify a number of intuitive variables that can predictably modify the collective behavior of the avatars in a region; the density, the flux and the number of people can be selectively modified.

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


a new algorithm for the largest compositionally progressive solution of synchronous language equations The paper addresses the problem of designing a component that combined with a known part of a system, called the context FSM, is a reduction of a given specification FSM. We study compositionally progressive solutions of synchronous FSM equations. Such solutions, when combined with the context, do not block any input that may occur in the specification, so they are of practical use. We show that if a synchronous FSM equation has a compositionally progressive solution, then the equation has the largest compositionally progressive solution. We provide an algorithm to compute the largest compositionally progressive solution that splits states of the largest solution and then removes those inducing a non-progressive composition.

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

sequential synthesis
finite automata
unknown component problem


tactile feedback for predictive text entry Predictive text entry provides a fast way to enter text on phones and other small devices. Early work on predictive text entry highlighted that the reaction time for checking the screen dominates text entry times. Improving accuracy of predictions brings a downside: as prediction gets better, users will drop the slow operation of checking the screen and will thus miss prediction errors and system feedback/suggestions. In this note, we present an experiment into the use of vibration to alert the user when word completion is likely to aid them, using a dynamic approach based on their current typing speed, and when there are no dictionary matches to their entry. Results show significantly faster entry rates for users with vibration alerts, raising speeds from 20wpm to 23wpm once practiced.

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


maximizing transfer opportunities in bluetooth dtns Devices in disruption tolerant networks (DTNs) must be able to communicate robustly in the face of short and infrequent connection opportunities. Unfortunately, one of the most inexpensive, energy-efficient and widely deployed peer-to-peer capable radios, Bluetooth, is not well-suited for use in a DTN. Bluetooth's half-duplex process of neighbor discovery can take tens of seconds to complete between two mutually undiscovered radios. This delay can be larger than the time that mobile nodes can be expected to remain in range, resulting in a missed opportunity and lower overall performance in a DTN. This paper proposes a simple, cost effective, and high performance modification to mobile nodes to dramatically reduce this delay: the addition of a second Bluetooth radio. We showed through analysis and simulation that this dual radio technique improves both connection frequency and duration. Moreover, despite powering two radios simultaneously, nodes using dual radios are more energy efficient, spending less energy on average per second of data transfered.

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

disruption tolerant networks
neighbor discovery
bluetooth


Test set embedding for deterministic BIST using a reconfigurable interconnection network We present a new approach for deterministic built-in self-test (BIST) in which a reconfigurable interconnection network (RIN) is placed between the outputs of a pseudorandom pattern generator and the scan inputs of the circuit under test (CUT). The RIN, which consists only of multiplexer switches, replaces the phase shifter that is typically used in pseudorandom BIST to reduce correlation between the test data bits that are fed into the scan chains. The connections between the linear-feedback shift-register (LFSR) and the scan chains can be dynamically changed (reconfigured) during a test session. In this way, the RIN is used to match the LFSR outputs to the test cubes in a deterministic test set. The control data bits used for reconfiguration ensure that all the deterministic test cubes are embedded in the test patterns applied to the CUT. The proposed approach requires very little hardware overhead, only a modest amount of CPU time, and fewer control bits compared to the storage required for reseeding techniques or for hybrid BIST. Moreover, as a nonintrusive BIST solution, it does not require any circuit redesign and has minimal impact on circuit performance.

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

embedded core testing
system-on-a-chip (soc) testing
test application time
test-data volume


Mixed Bases for Efficient Inversion in F-((22)2)2 and Conversion Matrices SubBytes of AES A lot of improvements and optimizations for the hardware implementation of SubBytes of Rijndael, in detail inversion in F-28 have been reported. Instead of the Rijndael original F-28, it is known that its isomorphic tower field F-(22)2)2 has a more efficient inversion. Then, some conversion matrices are also needed for connecting these isomorphic binary fields. According to the previous works, it is said that the number of 1's in the conversion matrices is preferred to be small; however, they have not focused on the Hamming weights of the row vectors of the matrices. It plays an important role for the calculation architecture, in detail critical path delays. This paper shows the existence of efficient conversion matrices whose row vectors all have the Hamming weights less than or equal to 4. They are introduced as quite rare cases. Then, it is pointed out that such efficient conversion matrices can connect the Rijndael original F-28 to some less efficient inversions in F-(22)2)2 but not to the most efficient ones. In order to overcome these inconveniences, this paper next proposes a technique called mixed bases. For the towerings, most of previous works have used several kinds of bases such as polynomial and normal bases in mixture. Different from them, this paper proposes another mixture of bases that contributes to the reduction of the critical path delay of SubBytes. Then, it is shown that the proposed mixture contributes to the efficiencies of not only inversion in F-(22)2)2 but also conversion matrices between the isomorphic fields F-28 and F-((22)2)2.

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


A Covariance-Tying Technique for HMM-Based Speech Synthesis A technique for reducing the footprints of HMM-based speech synthesis systems by tying all covariance matrices of state distributions is described. HMM-based speech synthesis systems usually leave smaller footprints than unit-selection synthesis systems because they store statistics rather than speech waveforms. However, further reduction is essential to put them on embedded devices, which have limited memory. In accordance with the empirical knowledge that covariance matrices have a smaller impact on the quality of synthesized speech than mean vectors, we propose a technique for clustering mean vectors while tying all covariance matrices. Subjective listening test results showed that the proposed technique can shrink the footprints of an HMM-based speech synthesis system while retaining the quality of the synthesized speech.

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

hmm
decision tree
context-clustering
mdl criterion
embedded device


Performance analysis of opportunistic broadcast for delay-tolerant wireless sensor networks This paper investigates a class of mobile wireless sensor networks that are unconnected most of the times; we refer to them as delaytolerant wireless sensor networks (DTWSN). These networks inherit their characteristics from both delay tolerant networks (DTN) and traditional wireless sensor networks. After introducing DTWSNs, three main problems in the design space of these networks are discussed: routing, data gathering, and neighbor discovery. A general protocol is proposed for DTWSNs based on opportunistic broadcasting in delay-tolerant networks with radio device onoff periods. Three performance measures are defined in the study: the energy for sending queries to ask for data from possible neighbors (querying energy), data transfer energy, and absorption time (delay). A simple yet accurate approximation for the data-transfer energy is proposed. An analytic model is provided to evaluate the querying energy per contact (epc). Simulation results for the data propagation delay show that the querying energy per contact measure obtained from the analytic model is proportional to the product of the querying energy and the delay. A practical rule of thumb for an optimal query interval in terms of delay and energy is derived from different parts of the study.

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

delay-tolerant wireless sensor networks
mobility
analytical modeling
performance evaluation
stochastic process


visualizing collaboration networks implicit in digital libraries using ontostarfish This paper presents the design rationale and initial findings derived from preliminary usage of OntoStarFish, a visualization technique aimed at taking advantage of implicit relationships that can be inferred from large collections of documents in digital libraries. OntoStarFish makes such relationships explicit so users may visualize them and detect potential collaboration networks. Users that may be interested in exploring collaboration networks include researchers looking for partners for specific projects as well as funding agencies concerned with the strength of associations among participants of competing proposals. OntoStarFish is based upon the use of multiple fisheye views that can be placed on top of starfields, dynamic scatter plots for which each axis is determined by a lightweight ontology of attributes associated to potential collaborators.

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

visualization
starfields
collaboration networks
fisheye views


Attributed graph transformation with node type inheritance The aim of this paper is to integrate typed attributed graph transformation with node type inheritance. Borrowing concepts from object oriented systems, the main idea is to enrich the attributed type graph with an inheritance relation and a set of abstract nodes. In this way, a node type inherits the attributes and edges of all its ancestors. Based on these concepts, it is possible to define abstract productions, containing abstract nodes. These productions are equivalent to a number of concrete productions, resulting from the substitution of the abstract node types by the node types in their inheritance clan. Therefore, productions become more compact and suitable for their use in combination with meta-modelling. The main results of this paper show that attributed graph transformation with node type inheritance is fully compatible with the existing concept of typed attributed graph transformation. (c) 2007 Elsevier.B.V. All rights reserved.

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

meta-modelling
double pushout approach
visual languages


(EDI)-I-4: Error detection by diverse data and duplicated instructions Errors in computing systems can cause abnormal behavior and degrade data integrity and system availability. Errors should be avoided especially in embedded systems for critical applications. However, as the trend in VLSI technologies has been toward smaller feature sizes, lower supply voltages, and higher frequencies, there is a growing concern about temporary errors as well as permanent errors in embedded systems; thus, it is very essential to detect those errors. Software Implemented Hardware Fault Tolerance (SIHFT) is a low-cost alternative to hardware fault tolerance techniques for embedded processors: It does not require any hardware modification of Commercial Off-The-Shelf (COTS) processors. (EDI)-I-4 is a SIHFT technique that detects both permanent and temporary errors by executing two "different" programs (with the same functionality) and comparing their outputs. (EDI)-I-1 maps each number, x, in the original program into a new number x(1), and then transforms the program so that it operates on the new numbers so that the results can be mapped backwards for comparison with the results of the original program. The mapping in the transformation of (EDI)-I-1 is x' = k (.) x for integer numbers, where k determines the fault detection probability and data integrity of the system. For floating point numbers, we find a value of k(f) for the fraction and k(f) for the exponent separately and use k = k(f) x 2(k) for the value of k. We have demonstrated how to choose an optimal value of k for the transformation. This paper shows that, for integer programs, the transformation with k = -2 was the most desirable choice in six out of seven benchmark programs we simulated. It maximizes fault detection probability under the condition that data integrity is highest.

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

software implemented hardware fault tolerance (sihft)


Fuzzy-pattern recognition for automatic detection of different teeth substances A method for characterizing the surface of a test object on the basis of its oscillatory behaviour is presented. The basic principle of the method is the excitation of oscillations in a small surface element on the elastic solid under investigation and the appropriate measurement of the reaction to this excitation. After calculation of the Fourier transform, a total of 400 magnitude values of the oscillation are available as characteristic features for the classification of an unkown surface. For testing the measuring system experiments were conducted on various test objects and the results of measurements performed on different tooth surface are presented. The automatic classification of tooth surface is important for the detection of the cementoenamel junction in parodontological practice and the soft removal of dental calculus. Because in this application the spectra are subject to severe fluctuations by variations in the test object a fuzzy classifier with weighted distance function is employed for the automatic classification. For solving the essential problem of selecting from a total of 400 spectral features those which appear to be suited for the respective classification problem, a new feature selection algorithm is presented. The highly successful result of these experiments indicates possibilities of applying new diagnostic and therapeutic instruments in the field of periodontology.

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

fuzzy-logic
pattern recognition
medicine


Lagrangian and symmetry structure of the divergence cleaning model based on generalized lagrange multipliers A field theoretical method for the treatment of the often violated charge conservation laws in computational electrodynamics is presented. This approach explores the basic symmetry features of Maxwell theory and the analogy between the gauge field anomalies of quantum field theory and the violation of charge conservation law on the lattice, in Lorentz covariant Lagrangian formalism. A mathematical construction of the counter terms to the anomalous charge conservation law is proposed, and thereby a consistent theory for the Generalized Lagrange Multiplier (GLM) method is presented, which has so far lacked a concrete theoretical framework. Based on the established theoretical framework, the GLM method has been further extended and the question regarding whether GLM method solves "right" equations is answered. This extended GLM method with new insight is then applied to magnetohydrodynamics (MHD) and recently proposed "shallow water" MHD. In particular, a GLM-based Godunov-type finite-volume solver for the "shallow water" MHD system on the Cartesian grid has been developed, and the introduced theoretical framework for GLM model is validated. In addition, associated new analytic features of the "shallow water" MHD system is also 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O

charge conservation in computational electromagnetics (cem)


The adoption of mobile healthcare by hospital's professionals: An integrative perspective The adoption rate of mobile healthcare is relatively low in the hospital. In practice, a study of how healthcare professionals adopt mobile services to support their work is imperative. An integration of TAM and TPB, concerning both technological and organizational aspects, is important for understanding the adoption of mobile healthcare. However, mobile healthcare is a wireless device which is often used in a voluntary motive. Service provisions for pervasive and timely usage and individual psychological states are critical in determining its use. Accordingly, perceived service availability (PSA) and personal innovativeness in IT (PIIT) may be the important drivers to be included in TAM and TPB. This study thus proposed such a research framework from a broader and integrative perspective. The empirical examination showed high predictive power for adoption intention and the influential role of these important variables.

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

mobile healthcare
personal innovativeness in it
tam
tpb


What do You Give the Undergraduate Researcher who has Everything? An Academic Librarian We examine 12 library skills curricula developed for two formalized undergraduate research training programs that occurred between the time periods, 19992008 and 20132015, at the University of Tennessee to answer the question: how has library skills instruction for these programs adapted to changing technologies, tools, and expectations of student performance? Our analysis is based upon data mined from course documents. We contextualize these data with reflections on the course design experience from the principal course designer and knowledge holder. Findings from our constructivist analysis of course curricula demonstrate the value of formal partnerships between academic libraries/librarians and undergraduate research training programs/administrators on college and university campuses. Although such relationships seem unnecessary, given the increase in students' unmediated access to research tools, we find that innovations in research tools and other technologies create opportunities to deepen students' engagement with academic librarians. While the more recent curricula (20132015) have required students to demonstrate traditional library (research) skills, such as the ability to search and retrieve information and to properly cite sources, they have also challenged students to think and behave as scholars: to critically evaluate sources and information, to seamlessly integrate information into original scholarship, and to disseminate original scholarship among their respective scholarly communities.

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

library curriculum design
scholarly communication
skills instruction design
research engagement


The effect of decision support system expertise on system use behavior and performance We performed an empirical investigation into the effect of users decision support system (DSS) expertise on their problem-solving strategies. The results indicated that individuals who had only recently learned to use the DSS were confused or restricted by the set of functions provided by the system and did not plan well for their use of the DSS. Those who had previous knowledge of the system exhibited more focused and efficient problem-solving behavior. Our findings suggested that problem-solving strategies depended significantly on the user's level of system expertise.

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

decision support systems
systems usage
decision-making expertise
restrictiveness
focused planning behavior
efficient planning


ModelObjectsa model management component for the development of planning support systems Traditional approaches of building spatial decision support systems based on a GIS environment have not fully addressed the issues of model sharing and reusing among different application systems. This paper aims to design a ModelObjects, an object-oriented model management component, that can be incorporated into an urban planning support system (PSS) to manage analytical models and to help users to build new models by reusing existing model resources in the system. The architecture of ModelObjects component and its essential functions are defined. Procedures for model generalization, representation and decomposition are developed according to object-oriented concepts and methods. These procedures can be adopted to decompose urban planning models into a set of model components and elements, and these model components can be used as the `building blocks' of the model library. Finally, we examine how ModelObjects and its associated procedures and techniques are implemented in a prototype PSS to facilitate the construction, retrieval and execution of analytical models in the planning process.

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

model management systems
object-oriented methods
component-based system development


Pseudo-first-order transition in interacting self-avoiding walks and trails The coil-globule transition of an isolated polymer has been well established to be a second-order phase transition described by a standard tri-critical O(0) field theory. We present Monte Carlo simulations of interacting self-avoiding walks and interacting self-avoiding trails in four dimensions which provide compelling evidence that the approach to this (tri)critical point is dominated by the build-up of first-order-like singularities masking the second-order nature of the coil-globule transition. (C) 2002 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 O

first-order transition
critical point
tri-critical point
scaling theory
interacting self-avoiding walks
interacting self-avoiding trails
polymer collapse
coil-globule transition


MULTIPLE CLASSIFIER COMBINATION FOR RECOGNITION OF WHEAT LEAF DISEASES Wheat industry is an important constituent of Northern China's overall agricultural economy. Proper disease detection using computer vision and pattern recognition has being investigated to minimize the loss, and finally achieve intelligent healthy farming. This paper proposes a new strategy of Multi-Classifier System based on SVM (support vector machine) for pattern recognition of wheat leaf diseases for higher recognition accuracy. Diseased leaf samples with Powdery Mildew, Rust Puccinia Triticina, Leaf Blight, Puccinia Striiformis were collected in the field and images were captured before a uniform black background. Three feature sets including color feature set, shape feature set and texture feature set were created for classification analysis. The proposed combination strategy was based on stacked generalization and included two-level structure: base-level was a module of three kinds of SVM-based classifiers trained by three feature sets and meta-level was one module of SVM-based decision classifier trained by meta-feature set which are generated through a new data fusion mechanism. Compared with other single classifiers and other strategy of classifier ensembles for wheat leaf diseases, this approach is more flexible and has higher success rate of recognition.

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

support vector machine
pattern recognition

multiple classifier system
plant diseases


The MMD codes are proper for error detection The undetected error probability of a linear code used to detect errors on a symmetric channel is a function of the symbol error probability epsilon of the channel and involves the weight distribution of the code. The code is proper, if the undetected error probability increases monotonously in epsilon. Proper codes are generally considered to perform well in error detection. We show in this correspondence that maximum minimum distance (MMD) codes are proper.

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

maximum minimum distance (mmd) codes
proper code


ON EXTREMAL DEPENDENCE OF BLOCK VECTORS Due to globalization and relaxed market regulation, we have assisted to an increasing of extremal dependence in international markets. As a consequence, several measures of tail dependence have been stated in literature in recent years, based on multivariate extreme-value theory. In this paper we present a tail dependence function and an extremal coefficient of dependence between two random vectors that extend existing ones. We shall see that in weakening the usual required dependence allows to assess the amount of dependence in d-variate random vectors based on bidimensional techniques. Simple estimators will be stated and can be applied to the well-known stable tail dependence function. Asymptotic normality and strong consistency will be derived too. An application to financial markets will be presented at the end.

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

multivariate extreme value theory
extremal coefficients


Haptic feedback in teleoperation of multifingered robot hands This paper presents a teleoperated robot hand system with haptic tactile feedback. This system enables an operator to control a multi-fingered robot hand while feeling interactions of the robot hand with the remote environment. We have designed a fingertip tactile sensor to capture high resolution and quality tactile images between the fingertip and the environment based on the optical total reflection principle. In order to feed back the tactile information to the operator, an electrotactile glove and a haptic display with 24 pins driven by structured DC solenoids have been developed. The haptic glove generates excitations when a touch/contact between the fingertips and the environment occurs. The tactile display can present contact points on the finger tips. We have integrated the tactile sensor, the haptic glove and the tactile display into a five-fingered hand system and examined their performance and effectiveness by experiments.

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

haptic feedback
teleoperation
robot hands


Success factors of open-source enterprise information systems development Purpose - The purpose of this paper is to identify the success factors of open-source software in the enterprise level. It expands the application of the information systems (IS) success model in the literature to enterprise information systems (EIS). The paper presents a simplified open-source EIS success model by removing several constructs in the existing open-source software models. Design/methodology/approach - To test the research model, a survey questionnaire was developed, based on previous studies dealing with IS success models and adapting them to the open-source EIS context. The research instrument contained 30 items that represent seven constructs in the research model. Data were collected from 250 open-source enterprise software end-users. Due to its confirmatory nature, this study applied the structural equation model. Findings - The results of the study indicate that only community service quality has a positive direct effect on open-source EIS use, while information quality, EIS quality, and user satisfaction do not. Open-source EIS quality has a direct positive effect on user satisfaction, which in turn has a positive effect on individual net benefits, which also positively affects organizational net benefits. Research limitations/implications - This study focused on the open-source EIS users' perspective. Future studies could expand the scope by covering a broader open-source EIS aspect such as motivation of its use, development processes, social dynamics in the development group, diffusion process, and the like. A longitudinal study could provide a more concrete trend of open-source EIS use by organizations. The small sample size of this study is also a limitation. Practical implications - The present research provides a practical evidence of relationships in the open-source EIS application model. The developers in on-line open-source communities need to take the success factors identified in this study into account when developing open-source EIS. Originality/value - There is a paucity of empirical studies in open-source EIS applications. The paper expends the traditional IS success model to the open-source EIS context by collecting and analyzing data from 150 real-world open-source EIS users.

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

open source
computer software
open-source software
enterprise information systems
success factors of open-source eis