Dynamics and Cooperative Object Manipulation Control of Suspended Mobile Manipulators Dynamics and control of mobile manipulators is obviously a more challenging problem compared to fixed-base robots. Including a suspension system for these mobile platforms increases their maneuverability, but considerably adds to their complexity. In this paper, a suspended wheeled mobile platform with two 6-DOF Puma-type manipulators is used to manipulate an object along a given path. To apply a model-based control algorithm, it is required to have an explicit dynamics model for such highly nonlinear system. This model should be as concise as possible to include fewer mathematical calculations for online computations. Therefore in this paper, a detailed set of dynamics equations for a multiple arm wheeled mobile platform equipped with an effective suspension system is presented. The method is based on the concept of Direct Path Method (DPM), which is extended here for such challenging type of robots. The obtained dynamics model is then verified with a dynamical analysis study using software ADAMS. Then, Natural Orthogonal Complement Method is used to include the non-holonomic constraint of the wheeled platform in a more concise dynamics model. Next, an impedance control law is applied for cooperative manipulation of an object by the two manipulators. The obtained results for a suspended wheeled platform equipped with two 6-DOF Puma-type manipulators reveal a successful performance for moving an object along a mixed circular-straight path, even in the presence of unexpected disturbing forces, system/end-effector flexibility and impacts due to contact with an obstacle.

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

suspension system
dynamics model
impedance control
cooperative object manipulation


Weblog campaigning in the German Bundestag election 2005 Election campaigns are catalysts for new forms of political communication. They are a field of experimentation for new techniques and technologies to reach target groups and influence voters. This article explores how weblogs were used in the 2005 Bundestag election campaign in Germany, examining their effect on the mediatized political field. It is based on an empirical analysis of 317 campaign weblogs. Building on mediatization theory and research on campaign weblogs in other countries, weblog usage is examined along the dimensions of activity, interactivity, and connectedness. The results of the study indicate that weblog communication largely follows the dominant logic of mass media. But weblogs also offer forms of communication that allow political actors to bypass established media practices. Although the results are limited by the fact that the political blogosphere in Germany is still under construction, they reveal the potential of weblogs to enrich campaigns.

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

weblogs
campaign
political communication
election
germany


Influence of DzyaloshinshkiiMoriya interaction on quantum correlations in two-qubit Werner states and MEMS In this paper, we study the influence of DzyaloshinskiiMoriya (DM) interaction on quantum correlations in two-qubit Werner states and maximally entangled mixed states (MEMS). We consider our system as a closed system of a qubit pair and one auxiliary qubit, which interact with any one of the qubit of the pair through DM interaction. We show that DM interaction, taken along any direction (x or y or z), does not affect two-qubit Werner states. On the other hand, the MEMS are affected by x and z components of DM interaction and remain unaffected by the y component. Further, we find that the state (i.e., probability amplitude) of auxiliary qubit does not affect the quantum correlations in both the states, and only DM interaction strength influences the quantum correlations. So one can avoid the intention to prepare the specific state of auxiliary qubit to manipulate the quantum correlations in both the states. We mention here that avoiding the preparation of state can contribute to cost reduction in quantum information processing. We also observe the phenomenon of entanglement sudden death in the present study.

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

werner states
mems
entanglement sudden death
probability amplitude

dzyaloshinskiimoriya interaction
quantum discord


Locating corruptions in a replicated file in a distributed environment When a data file is replicated at more than one site, it is of interest to detect corruption by comparing the multiple copies. In order to reduce the amount of messaging for large files, techniques based on page signatures and combined signatures have been explored. However, for 3 or more sites, the known methods assume that the number of corrupted page copies is at most [M/2] - 1, where M is the number of sites. This is a pessimistic assumption which is unrealistic. In this paper, this assumption is replaced by another assumption which is shown to be reasonable. Based on this assumption, and based on a finer model of the system, three distributed algorithms are derived, which can either improve the performance or provide more tolerance to corruptions compared to previous methods. As in some previous work, the amount of signature transmission in the algorithms varies according to the number and patterns of page copy corruptions that actually occur, and two of the algorithms achieve the optimal amount of signature transmission when no failure occurs.

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

fault tolerance
file comparison
coding theory
performance analysis
message transmission


a logic-based framework for attribute based access control Attribute based access control (ABAC) grants accesses to services based on the attributes possessed by the requester. Thus, ABAC differs from the traditional discretionary access control model by replacing the subject by a set of attributes and the object by a set of services in the access control matrix. The former is appropriate in an identity-less system like the Internet where subjects are identified by their characteristics, such as those substantiated by certificates. These can be modeled as attribute sets. The latter is appropriate because most Internet users are not privy to method names residing on remote servers. These can be modeled as sets of service options. We present a framework that models this aspect of access control using logic programming with set constraints of a computable set theory [DPPR00]. Our framework specifies policies as stratified constraint flounder-free logic programs that admit primitive recursion. The design of the policy specification framework ensures that they are consistent and complete. Our ABAC policies can be transformed to ensure faster runtimes.

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

framework
attribute based access control
aspect
policy
method
recursion
users
design
access control
theory
service
logic
attributes
internet
model
constraint

constrained logic programming with sets
systems
ident
logic program
consistency
runtime
server
certificate
completeness


Snap-stabilization and PIF in tree networks The contribution of this paper is threefold. First, we present the paradigm of snap-stabilization. A snap-stabilizing protocol guarantees that, starting from an arbitrary system configuration, the protocol always behaves according to its specification. So, a snap-stabilizing protocol is a time optimal self-stabilizing protocol (because it stabilizes in 0 rounds). Second, we propose a new Propagation of Information with Feedback (PIF) cycle, called Propagation of Information with Feedback and Cleaning (PFC). We show three different implementations of this new PIF. The first one is a basic PFC cycle which is inherently snap-stabilizing. However, the first PIF cycle can be delayed O(h(2)) rounds (where h is the height of the tree) due to some undesirable local states. The second algorithm improves the worst delay of the basic PFC algorithm from O(h(2)) to 1 round. The state requirement for the above two algorithms is 3 states per processor, except for the root and leaf processors that use only 2 states. Also, they work on oriented trees. We then propose a third snap-stabilizing PIF algorithm on un-oriented tree networks. The state requirement of the third algorithm depends on the degree of the processors, and the delay is at most h rounds. Next, we analyze the maximum waiting time before a PIF cycle can be initiated whether the PIF cycle is infinitely and sequentially repeated or launch as an isolated PIF cycle. The analysis is made for both oriented and un-oriented trees. We show or conjecture that the two best of the above algorithms produce optimal waiting time. Finally, we compute the minimal number of states the processors require to implement a single PIF cycle, and show that both algorithms for oriented trees are also (in addition to being time optimal) optimal in terms of the number of states.

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

fault-tolerance
optimality
self-stabilization
snap-stabilization
wave algorithms


some methods for teaching functions first using java Many CS1 curricula introduce Java topics without giving a strong rationale of why they are needed at that exact point. For example, most all Java texts introduce the keywords public and private long before the students write or see any program involving more than a single class; those keywords can have no demonstrable effect on their program. Such an approach subtly but firmly sends the message "programming is not about problem-solving, but rather about putting certain keywords in the right place." We present a nonstandard arrangement of CS1 topics, guided by the following strategies: (a) simplify the mental model initially needed to understand Java syntax, (b) leverage parallels between programming and high school algebra and (c) demonstrate any new language construct via a program which could not be (easily) written without it. The resulting ordering helps students appreciate why they are learning language constructs, which in turn helps them distinguish syntax from programming principles.

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

java
cs1
functions first
high school algebra

syllabus
fundamentals first
objects early
objects late


Fuzzy Krasner (m,n) ( m , n ) -hyperrings Recently, Krasner (m,n) ( m , n ) -hyperrings were introduced and analyzed by Mirvakili and Davvaz. Krasner (m,n) ( m , n ) -hyperrings are a suitable generalization of Krasner hyperrings. This paper concerns a relationship between fuzzy sets and hyperstructure theory. It is a continuation of the ideas presented by Davvaz etal. (2009) [B. Davvaz, P. Corsini, V. Leoreanu-Fotea, Fuzzy n n -ary subpolygroups, Computers & Mathematics with Applications 57 (2009) 141152]. The aim of the paper is to introduce the notion of a fuzzy hyperideal of a Krasner (m,n) ( m , n ) -hyperring and to extend the fuzzy results to Krasner (m,n) ( m , n ) -hyperrings.

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

n n -ary operation n n n n n
n n -ary hyperoperation n n n n n
n n -ary polygroup n n n n n
krasner hyperring
fuzzy set


Preemptive scheduling in the presence of transportation times In this paper, we consider the problem of scheduling n independent jobs preemptively on m identical parallel machines, to minimize the total completion time (makespan). Each job Ji J i ( i = 1 , n ) has a processing time pi p i and the transportation of an interrupted job from a machine Mj M j to another machine Mj? M j ? requires djj? d jj ? units of time. We propose a linear programming formulation in real and binary decision variables and we prove that the problem is NP-hard. Some subproblems are analyzed and solved by polynomial algorithms. Finally we present some heuristics and give some lower bounds of the makespan.

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

identical parallel machines
makespan
heuristics

preemption
transportation time
migration delay
complexity


mechanisms for store-wait-free multiprocessors Store misses cause significant delays in shared-memory multiprocessors because of limited store buffering and ordering constraints required for proper synchronization. Today, programmers must choose from a spectrum of memory consistency models that reduce store stalls at the cost of increased programming complexity. Prior research suggests that the performance gap among consistency models can be closed through speculation--enforcing order only when dynamically necessary. Unfortunately, past designs either provide insufficient buffering, replace all stores with read-modify-write operations, and/or recover from ordering violations via impractical fine-grained rollback mechanisms. We propose two mechanisms that, together, enable store-wait-free implementations of any memory consistency model. To eliminate buffer-capacity-related stalls, we propose the scalable store buffer, which places private/speculative values directly into the L1 cache, thereby eliminating the non-scalable associative search of conventional store buffers. To eliminate ordering-related stalls, we propose atomic sequence ordering, which enforces ordering constraints over coarse-grain access sequences while relaxing order among individual accesses. Using cycle-accurate full-system simulation of scientific and commercial applications, we demonstrate that these mechanisms allow the simplified programming of strict ordering while outperforming conventional implementations on average by 32\% (sequential consistency), 22\% (SPARC total store order) and 9\% (SPARC relaxed memory order).

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

applications
order
simulation
synchronization
memory consistency models
performance
access
model
buffers
search
sequential consistency
cache
research
values
demonstrate
consistency
complexity
sequence
cost

scalability
association
design
delay
constraint
store buffer design
read
writing
place
program
systems
atom
wait-free
shared memory multiprocessors
speculating
implementation
capacities
memorialized
operability
programmer


Mining the optimal clustering of peoples characteristics of health care choices In Asian countries, there has been a multi-choice healthcare environment for many years. In Taiwan, peoples multiple health care seeking behavior has resulted in much heavier financial burden of National Health Insurance Program (NHIP) in recent years: investigating the characteristics of people who use multiple health care resources has gained increasing importance for health authorities. In this study, we investigated the socioeconomic and demographic characteristics which underlined peoples choice of health care by using a population representative database. A novel methodology which incorporated k-means cluster analysis with v-fold cross-validation into Multiple Correspondence Analysis (MCA) is proposed. This novel methodology can help us to find the optimal attribute clustering of multiple health care utilization. By using this methodology, researchers not only can avoid the ambiguities of identifying clusters resulted from the traditional hierarchical cluster analysis (HCA), but also can provide more solid and evidence-based analysis for health policy making.

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

health care
multiple correspondence analysis

k-means cluster analysis
v-fold cross-validation


Simultaneous Truth and Performance Level Estimation Through Fusion of Probabilistic Segmentations Recent research has demonstrated that improved image segmentation can be achieved by multiple template fusion utilizing both label and intensity information. However, intensity weighted fusion approaches use local intensity similarity as a surrogate measure of local template quality for predicting target segmentation and do not seek to characterize template performance. This limits both the usefulness and accuracy of these techniques. Our work here was motivated by the observation that the local intensity similarity is a poor surrogate measure for direct comparison of the template image with the true image target segmentation. Although the true image target segmentation is not available, a high quality estimate can be inferred, and this in turn allows a principled estimate to be made of the local quality of each template at contributing to the target segmentation. We developed a fusion algorithm that uses probabilistic segmentations of the target image to simultaneously infer a reference standard segmentation of the target image and the local quality of each probabilistic segmentation. The concept of comparing templates to a hidden reference standard segmentation enables accurate assessments of the contribution of each template to inferring the target image segmentation to be made, and in practice leads to excellent target image segmentation. We have used the new algorithm for the multiple-template-based segmentation and parcellation of magnetic resonance images of the brain. Intensity and label map images of each one of the aligned templates are used to train a local Gaussian mixture model based classifier. Then, each classifier is used to compute the probabilistic segmentations of the target image. Finally, the generated probabilistic segmentations are fused together using the new fusion algorithm to obtain the segmentation of the target image. We evaluated our method in comparison to other state-of-the-art segmentation methods. We demonstrated that our new fusion algorithm has higher segmentation performance than these methods.

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

probabilistic segmentation
reference standard

simultaneous truth and performance level estimation (staple)


Indoor Air Quality of Houses Located in the Urban Environment of Agra, India Increased concern over the adverse health effects of air pollution has highlighted the need for air-pollution measurements, especially in urban areas, where many sources of air pollutants are normally monitored outdoors as part of obligations under the National Air Quality Strategies. Very little is known about air pollution indoors. In fact, the largest exposure to health-damaging indoor pollution probably occurs in the developing world, not in households, schools, and offices of developed countries where most research and control efforts have been focused to date. As a result much of the health impacts from air pollution worldwide seem to occur among the poorest and most vulnerable populations. The authors in their earlier studies have confirmed the importance of ambient air in determining the quality of air indoors. In this study an observation of air quality indoors and outdoors of domestic homes located in an urban environment from October 2004 to December 2005 in Agra, north central India, is performed. The purpose of this study was to characterize the indoor/outdoor (I/O) relationship of airborne pollutants and recognize their probable source in all three seasons, that is, winter, summer, and rainy season. Concentrations of SO2, NO2, CO2, Cl2, H2S, NH3, RSPM, and PAH were monitored simultaneously and I/O ratios were calculated. In order to investigate the effect of seasonality on indoor and ambient air quality, winter to summer and winter to monsoon average ratios were calculated. It is apparent that there is a general pattern of increasing levels from monsoon to summer to winter, and similarly from outdoor to indoor air. Regressions analysis had been done to further investigate the influence of outdoor air-pollutant concentrations on indoor concentrations. The most probable categories of sources for these pollutants have been identified by using principal-component analysis. Indoor air pollution is a complex function of energy housing and behavioral factors. On the basis of this study and observations, some interventions are also suggested.

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

indoor air quality
urban environment
india


fast computation of marginalized walk kernel for virtual screening in drug discovery We introduce a new kernel function called Fast computation of marginalized walk kernels for graph classification for the virtual screening in drug discovery. This kernel is an extension of marginalized graph kernels. In this paper we use two dimensional graphical representations of chemical structures. The similarity between molecules is measured by using kernel function. For reducing the time complexity of kernel computation we use fast computing methods like Sylvester equation. The efficiency is evaluated using MUTAG dataset. The results show that the new kernel function is more efficient than existing kernel. This gives the same accuracy with lesser time complexity.

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


Kruskal's condition for uniqueness in Candecomp/Parafac when ranks and k k -ranks coincide A key feature of the analysis of three-way arrays by Candecomp/Parafac is the essential uniqueness of the trilinear decomposition. Kruskal has previously shown that the three component matrices involved are essentially unique when the sum of their k -ranks is at least twice the rank of the decomposition plus 2. It was proved that Kruskal's sufficient condition is also necessary when the rank of the decomposition is 2 or 3. If the rank is 4 or higher, the condition is not necessary for uniqueness. However, when the k k -ranks of the component matrices equal their ranks, necessity of Kruskal's condition still holds in the rank-4 case. Ten Berge and Sidiropoulos conjectured that Kruskal's condition is necessary for all cases of rank 4 and higher where ranks and k-ranks coincide. In the present paper we show that this conjecture is false.

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

candecomp
parafac
three-way arrays
k-rank


Clock recovery based on packet inter-arrival time averaging Accurate source clock recovery is an important element of circuit emulation services (CES) over packet networks. A well-known and widely implemented technique for clock recovery in CES is the one that is based on packet inter-arrival time (sometimes called time difference of arrival (TDOA)) averaging. The technique is very simple to implement but provides good performance only when packet losses and packet delay variation (PDV) are very low and well controlled. This technique has not been fully characterized analytically in the literature. In this paper, we provide a full analytical examination of this well-known clock recovery technique. We analyze the effects of correlation of the PDV experienced by the constant bit rate (CBR) traffic stream on the quality of the clock recovered by a receiver. We prove analytically that, for a general input process, high correlation of the PDV produces a large variance of the recovered clock. The paper also describes simple all-digital implementations of the clock recovery scheme using standard digitally controlled oscillators (DCOs). (c) 2005 Elsevier B.V. All rights reserved.

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

circuit emulation
clock recovery
packet networks
packet delay variation
pdv

tdm
timing recovery
clock synchronization
phase-locked loop
digitally controlled oscillator
dco
jitter


Generating gene summaries from biomedical literature: A study of semi-structured summarization Most knowledge accumulated through scientific discoveries in genomics and related biomedical disciplines is buried in the vast amount of biomedical literature. Since understanding gene regulations is fundamental to biomedical research, summarizing all the existing knowledge about a gene based on literature is highly desirable to help biologists digest the literature. In this paper, we present a study of methods for automatically generating gene summaries from biomedical literature. Unlike most existing work on automatic text summarization, in which the generated summary is often a list of extracted sentences, we propose to generate a semi-structured summary which consists of sentences covering specific semantic aspects of a gene. Such a semi-structured summary is more appropriate for describing genes and poses special challenges for automatic text summarization. We propose a two-stage approach to generate such a summary for a given gene first retrieving articles about a gene and then extracting sentences for each specified semantic aspect. We address the issue of gene name variation in the first stage and propose several different methods for sentence extraction in the second stage. We evaluate the proposed methods using a test set with 20 genes. Experiment results show that the proposed methods can generate useful semi-structured gene summaries automatically from biomedical literature, and our proposed methods outperform general purpose summarization methods. Among all the proposed methods for sentence extraction, a probabilistic language modeling approach that models gene context performs the best.

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


Foveated visual search for corners We cast the problem of corner detection as a corner search process. We develop principles of foveated visual search and automated fixation selection to accomplish the corner search, supplying a case study of both foveated search and foveated feature detection. The result is a new algorithm for finding corners, which is also a corner-based algorithm for aiming computed foveated visual fixations. In the algorithm, long saccades move the fovea to previously unexplored areas of the image, while short saccades improve the accuracy of putative corner locations. The system is tested on two natural scenes. As an interesting comparison study, we compare fixations generated by the algorithm with those of subjects viewing the same images, whose eye movements are being recorded by an eye tracker. The comparison of fixation patterns is made using an information-theoretic measure. Results show that the algorithm is a good locater of corners, but does not correlate particularly well with human visual fixations.

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


Channel Assignment Schemes for Infrastructure-Based 802.11 WLANs: A Survey Efficient channel assignment is crucial for successful deployment and operation of IEEE 802.11-based WLANs. In this article we present a survey on the state of the art channel assignment schemes in IEEE 802.11-based WLANs. After detailing out all the schemes, we provide a qualitative comparison among different schemes in terms of algorithm execution behaviors, complexity, and scalability. We then conclude the survey with several research issues open for further investigation.

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

channel allocation
ieee 802.11
network planning
resource allocation
wireless networking


organizational structure and ict strategies in the brazilian justice In this case study, we analyze the influence of the organizational structure in the definition and implementation of information and communication technologies (ICT) strategies in the Brazilian Judiciary System. The analysis shows that the existing organizational structure boosts uncoordinated actions, but the National Council of Justice (NCJ) protagonism in the process of coordinating the strategic planning of the Brazilian Judiciary System (and ICT strategic planning) may change this reality, allowing the Brazilian Judiciary System to fully appropriate the benefits of ICT.

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


a low-power memory hierarchy for a fully programmable baseband processor Future terminals for wireless communication not only must support multiple standards but execute several of them concurrently. To meet these requirements, flexibility and ease of programming of integrated circuits for digital baseband processing are increasingly important criteria for the deployment of such devices, while power consumption and area of the devices remain as critical as in the past.The paper presents the architecture of a fully programmable system-on-chip for digital signal processing in the baseband of contemporary and up-coming standards for wireless communication. Particular focus is given to the memory hierarchy of the multi-processor system and the measures to minimize the power it dissipates. The reduction of the power consumption of the entire chip is estimated to amount to 28\% compared to a straightforward approach.

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

low-power memory
task interleaving
multi-tasked processor


Interval estimation for the Pareto distribution based on the progressive Type II censored sample For the complete sample and the right Type II censored sample, Chen [Joint confidence region for the parameters of Pareto distribution. Metrika 44 (1996), pp. 191-197] proposed the interval estimation of the parameter theta and the joint confidence region of the two parameters of Pareto distribution. This paper proposed two methods to construct the confidence region of the two parameters of the Pareto distribution for the progressive Type II censored sample. A simulation study comparing the performance of the two methods is done and concludes that Method 1 is superior to Method 2 by obtaining a smaller confidence area. The interval estimation of parameter nu is also given under progressive Type II censoring. In addition, the predictive intervals of the future observation and the ratio of the two future consecutive failure times based on the progressive Type II censored sample are also proposed. Finally, one example is given to illustrate all interval estimations in this paper.

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

progressive type ii censoring
pareto distribution


A multiuser k-ary code for the noisy multiple-access adder channel Multiuser k-ary coding is proposed for a noisy multiple-access adder channel. It is shown that when a T-user delta -decodable k-ary code C is given a priori, a qT-user lambda delta -decodable k-ary code C* is obtained by using a matrix, suchas a Hadamard matrix or a conference matrix of order, where lambda is a positive integer depending on the matrix. More noteworthy is that the code C is an arbitrary delta -decodable k-ary code, and that the coding scheme preserves the total rate, i.e., the total rate of C* is equal to that of C.

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

delta-decodable code
multiple-access communication
multiuser code


Integration of High Resolution EEG and functional magnetic resonance in the study of human movement-related potentials Cortical sources of human movement-related potentials (i.e. unilateral finger extension) were modeled using functional magnetic resonance imaging (fMR) data as a constraint of a linear inverse source estimation from highly sampled (128 channels) EEG data. Remarkably, this estimation was performed within realistic subject's MR-constructed head models by boundary element techniques, An appropriate figure of merit served to set the optimal amount of fMR constraints. With respect to standard linear inverse source estimates, fMR-constrained ones presented increased spatial detail and provided a more reliable timing of activation in bilateral sensorimotor cortical regions of interest.

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

functional magnetic resonance imaging (fmr)


cost recurrences for dml programs A cost recurrence describes an upper bound for the running time of a program in terms of the size of its input. Finding cost recurrences is a frequent intermediate step in complexity analysis, and this step requires an abstraction from data to data size. In this article, we use information contained in dependent types to achieve such an abstraction: Dependent ML (DML), a conservative extension of ML, provides dependent types that can be used to associate data with size information, thus describing a possible abstraction. We automatically extract cost recurrences from first-order DML programs, guiding the abstraction from data to data size with information contained in DML type derivations.

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

ml program use abstraction input size data cost

order
dependencies
complex analysis
extraction
extensibility
timing
informal
dependent type


Energy conservation in Newmark based time integration algorithms Energy balance equations are established for the Newmark time integration algorithm, and for the derived algorithms with algorithmic damping introduced via averaging, the so-called ?-methods. The energy balance equations form a sequence applicable to: Newmark integration of the undamped equations of motion, an extended form including structural damping, and finally the generalized form including structural as well as algorithmic damping. In all three cases the expression for energy, appearing in the balance equation, is the mechanical energy plus some additional terms generated by the discretization by the algorithm. The magnitude and character of these terms as well as the associated damping terms are discussed in relation to energy conservation and stability of the algorithms. It is demonstrated that the additional terms in the energy lead to periodic fluctuations of the mechanical energy and are the cause of the phenomenon of response overshoot, previously observed empirically in the application of Newmark based algorithms to high-frequency components. It is also demonstrated that the stability limit of the explicit Newmark algorithm is reached, when the stiffness term in the algorithmic energy vanishes, and that energy fluctuations take place for integration intervals close to the stability limit.

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

numerical integration
structural dynamics


Multiparallel systolic arrays for multidimensional FFT-architectures on 3D-VLSI Efficient architectures for the integration of multidimensional Fast Fourier transforms (FFTs) on three-dimensional integrated circuitry are presented. Input and output data are processed multiparallel in a three-dimensional array-serial data format. The three-dimensional interconnect structure of 3D-VLSI with active devices in multiple chip layers enables completely systolic realizations of radix-2 and radix-4-FFTs. The presented architectures outperform previous approaches for three-dimensional integration of multidimensional spectral transforms in terms of throughput and the number of multiplications while relying on a regular and modular system architecture with a nearest-neighbor interconnection 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

3d-vlsi
multiparallel data format
fast fourier transform
systolic array


Generalized theory of uncertainty (GTU) - principal concepts and ideas Uncertainty is an attribute of information. The path-breaking work of Shannon has led to a universal acceptance of the thesis that information is statistical in nature. Concomitantly, existing theories of uncertainty are based on probability theory. The generalized theory of uncertainty (GTU) departs from existing theories in essential ways. First, the thesis that information is statistical in nature is replaced by a much more general thesis that information is a generalized constraint, with statistical uncertainty being a special, albeit important case. Equating information to a generalized constraint is the fundamental thesis of GTU. Second, bivalence is abandoned throughout GTU, and the foundation of GTU is shifted from bivalent logic to fuzzy logic. As a consequence, in GTU everything is or is allowed to be a matter of degree or, equivalently, fuzzy. Concomitantly, all variables are, or are allowed to be granular, with a granule being a clump of values drawn together by a generalized constraint. And third, one of the principal objectives of GTU is achievement of NL-capability, that is, the capability to operate on information described in natural language. NL-capability has high importance because much of human knowledge, including knowledge about probabilities, is described in natural language. NL-capability is the focus of attention in the present paper. The centerpiece of GTU is the concept of a generalized constraint. The concept of a generalized constraint is motivated by the fact that most real-world constraints are elastic rather than rigid, and have a complex structure even when simple in appearance. The paper concludes with examples of computation with uncertain information described in natural language. (C) 2006 Elsevier B.V. All rights reserved.

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


On fractional Gaussian random fields simulations To simulate Gaussian fields poses serious numerical problems: storage and computing time. The midpoint displacement method is often used for simulating the fractional Brownian fields because it is fast. We propose an effective and fast method, valid not only for fractional Brownian fields, but for any Gaussian fields. First, our method is compared with midpoint for fractional Brownian fields. Second, the performance of our method is illustrated by simulating several Gaussian fields. The software FieldSim is an R package developed in R and C and that implements the procedures on which this paper focuses.

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


controlling teams of uninhabited air vehicles We describe a Multi-Agent System (MAS) for controlling teams of uninhabited air vehicles (UAVs) in the context of a larger system that has been used to evaluate potential concepts of use and technologies. The approach is one of a decision-making partnership between a human operator and an intelligent uninhabited capability. The MAS controls the UAVs and self-organises to achieve the tasks set by the operator with interaction via a variable autonomy interface. We describe how the agents are integrated with the rest of the system and present a number of system integration issues that have arisen. The overall system has been evaluated in a number of human-in-the-loop trials within a detailed synthetic environment.

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

uninhabited air vehicles
variable autonomy

multi-agent system
human-machine partnership


Vibrations and large postbuckling deflections of optimal pinned columns with elastic foundations The optimal distribution of material to maximize the critical load of columns has been studied extensively in the past, along with initial postbuckling behavior. Here, large postbuckling deflections are analyzed for optimal columns with pinned ends. Small vibrations of the optimal columns about postbuckled equilibrium shapes are also investigated. A shooting method is utilized to obtain numerical solutions. In some examples, an elastic foundation is attached to the column. The foundation includes the usual transverse resistance and an axial resisting force. The bifurcation is subcritical in some cases, and then the column is imperfection-sensitive. Results are compared to those for the corresponding uniform column with the same total volume.

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

optimal columns
elastic foundation
postbuckling


Operational transportation planning of freight forwarding companies in horizontal coalitions Collaborative transportation planning of freight forwarders is studied. Routing of own vehicles is extended by subcontracting and request exchanging. Considering all request fulfillment options may result in considerable cost savings. A new planning framework is proposed for forwarders in horizontal coalitions. Computational results show very high efficiency of the proposed planning framework.

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

logistics
distributed decision making
collaborative planning
request exchange


Multiobjective evolutionary approach to the design of optimal controllers for interval plants via parallel computation Design of optimal controllers satisfying performance criteria of minimum tracking error and disturbance level for an interval system using a multi-objective evolutionary approach is proposed in this paper. Based on a worst-case design philosophy, the design problem is formulated as a minimax optimization problem, subsequently solved by a proposed two-phase multi-objective genetic algorithm (MOGA). By using two sets of interactive genetic algorithms where the first one determines the maximum (worst-case) cost function values for a given set of controller parameters while the other one minimizes the maximum cost function values passed from the first genetic algorithm, the proposed approach evolutionarily derives the optimal controllers for the interval system. To suitably assess chromosomes for their fitness in a population, root locations of the 32 generalized Kharitonov polynomials will be used to establish a constraints handling mechanism, based on which a fitness function can be constructed for effective evaluation of the chromosomes. Because of the time-consuming process that genetic algorithms generally exhibit, particularly the problem nature of minimax optimization, a parallel computation scheme for the evolutionary approach in the MATLAB-based working environment is also proposed to accelerate the design process.

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

genetic algorithms
minimax optimization
parallel computation

multi-objective genetic algorithms
interval systems
robust controllers


STATE ESTIMATION FOR A CLASS OF NONLINEAR SYSTEMS We propose a new type of Proportional Integral (PI) state observer for a class of nonlinear systems in continuous time which ensures an asymptotic stable convergence of the state estimates. Approximations of nonlinearity are not necessary to obtain such results, but the functions must be, at least locally, of the Lipschitz type. The obtained state variables are exact and robust against noise. Naslin's damping criterion permits synthesizing gains in an algebraically simple and efficient way. Both the speed and damping of the observer response are controlled in this way. Model simulations based on a Sprott strange attractor are discussed as an example.

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


An FFT Performance Model for Optimizing General-Purpose Processor Architecture General-purpose processor (GPP) is an important platform for fast Fourier transform (FFT), due to its flexibility, reliability and practicality. FFT is a representative application intensive in both computation and memory access, optimizing the FFT performance of a GPP also benefits the performances of many other applications. To facilitate the analysis of FFT, this paper proposes a theoretical model of the FFT processing. The model gives out a tight lower bound of the runtime of FFT on a GPP, and guides the architecture optimization for GPP as well. Based on the model, two theorems on optimization of architecture parameters are deduced, which refer to the lower bounds of register number and memory bandwidth. Experimental results on different processor architectures (including Intel Core i7 and Godson-3B) validate the performance model. The above investigations were adopted in the development of Godson-3B, which is an industrial GPP. The optimization techniques deduced from our performance model improve the FFT performance by about 40%, while incurring only 0.8% additional area cost. Consequently, Godson-3B solves the 1024-point single-precision complex FFT in 0.368 is with about 40 Watt power consumption, and has the highest performance-per-watt in complex FFT among processors as far as we know. This work could benefit optimization of other GPPs as well.

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

fast fourier transform (fft)
general-purpose processor (gpp)
performance prediction model
vector unit
dma


Combined multi-body and finite element investigation of the effect of the seat height on acetabular implant stability during the activity of getting up An important question in assessing the stability of a total hip arthroplasty is the effect of daily physical activities of patients. The aim of this study is to examine these effects when standing up from three different seat heights. A musculoskeletal body model has been modified to simulate the three different seat heights. The calculated muscle forces have been transferred to a finite element model of a pelvis. The pelvis model was created from a hemipelvis CT dataset. As an implant component, a metal socket with a polyethylene insert was used. A primary implantation situation was modelled. For the analysed patient activities the highest hip contact forces and the highest micromotions occur at the beginning of the motion. The results of this study show that standing up from a certain seat height can have a significant influence on the micromotions in the implantbone interface.

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

multi-body simulation
finite element analysis
micromotion
implantbone-interface
patient activity


The Sarcomeric Control of Energy Conversion Abstract: The Frank-Starling Law, Fenn Effect, and Suga's suggestions of cardiac muscle constant contractile efficiency establish the dependence of cardiac mechanics and energetics on the loading conditions. Consistent with these observations, this review suggests that the sarcomere control of contraction consists of two dominant feedbacks: (1) a cooperativity mechanism (positive feedback), whereby the number of force-generating cross-bridges (XBs) determines the affinity of calcium binding to the troponin regulatory protein; and (2) a mechanical (negative) feedback, whereby the filament shortening velocity affects the rate of XB turnover from the force to the non-force generating conformation. The study explains the roles of these feedbacks in providing the adaptive control of energy consumption by the loading conditions and validates the dependence of the cooperativity mechanism on the number of strong XBs. The cooperativity mechanism regulates XB recruitment. It explains the cardiac force-length calcium relationship, the related Frank-Starling Law of the heart, and the adaptive control of new XB recruitment and the associated adenosine triphosphate (ATP) consumption. The mechanical feedback explains the force-velocity relationship and the constant and high-contractile efficiency. These mechanisms were validated by testing the force responses to large amplitude (100 nm/sarcomere) sarcomere length (SL) oscillations, in intact tetanized trabeculae (utilizing 30 ?M cyclopiazonic). The force responses to large-length oscillations lag behind the imposed oscillations at low extracellular calcium concentration ([Ca2+]0) and slow frequencies (<4 Hz, 25C), yielding counterclockwise hystereses in the force-length plane. The force was higher during shortening than during lengthening. The area within these hystereses corresponds to the external work generated from new XB recruitment during each oscillation, and it is determined by the delay in the force response. Characterization of the delayed response and its dependence on the SL, force, and calcium allows identification of the regulation of XB recruitment. The direct dependence of the phase on force indicates that XB recruitment is determined directly by the force (i.e., the number of strong XBs) and indirectly by SL or calcium. The suggested feedbacks determine cardiac energetics: 1) the constant and high contractile efficiency is an intrinsic property of the single XB, due to the mechanical feedback; and 2) the XBs are the myocyte sensors that modulate XB recruitment in response to length and load changes through the cooperativity mechanism.

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

cardiac mechanics
cooperativity
fenn effect

cross-bridge
excitation-contraction coupling
frank-starling law
myosin


accordion arrays In this work, we present accordion arrays, a straight-forward and effective memory compression technique targeting Unicode-based character arrays. In many non-numeric Java programs, character arrays represent a significant fraction (30-40\% on average) of the heap memory allocated. In many locales, most, but not all, of those arrays consist entirely of characters whose top bytes are zeros, and, hence, can be stored as byte arrays without loss of information. In order to get the almost factor of two compression rate for character vectors, two challenges must be overcome: 1) all code that reads and writes character vectors must dynamically determine which kind of array is being accessed and perform byte or character loads/stores as appropriate, and 2) compressed vectors must be dynamically inflated when an incompressible character is written. We demonstrate how these challenges can be overcome with minimal spaceand execution time overhead, resulting in an average speedup of 2\% across our benchmark suite, with individual speedups as high as 8\%.

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

speedup character order array benchmark factor code demonstrate java minimal compression

memory management
challenge
program
vectorization
polymorphism
forward
unicode
memorialized
timing
informal
effect
locality


Extremes of spheroid shape factor based on two dimensional profiles The extremal shape factor of spheroidal particles is studied. Three dimensional particles axe considered to be observed via their two dimensional profiles and the problem is to predict the extremal shape factor in a given size class. We proof the stability of the domain of attraction of the spheroid's and its profile shape factor under a tail equivalence condition. We show namely that the Faxlie-Gumbel-Morgenstern bivariate distributions gives the tail uniformity. We provide a way how to find normalising constants for the shape factor extremes. The theory is illustrated on examples of distributions belonging to Gumbel and Frechet domain of attraction. We discuss the ML estimator based on the largest observations and hence the possible statistical applications 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 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 B I O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O

domain of attraction
normalising constants

sample extremes
fgm system of distributions


The role of lymph node sinus macrophages in host defense Strategically positioned along lymphatic vessels, lymph nodes act as filter stations preventing systemic pathogen dissemination; they are primary sites of innate immune responses and provide the staging grounds for the generation of adaptive immunity. Critical mediators of these lymph node functions are two phenotypically and functionally distinct subsets of macrophages: the subcapsular sinus macrophages and the medullary macrophages. This review focuses on the phenotype and function of these lymph node sinus-resident macrophages and summarizes methods for their proper identification and experimental manipulation.

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

lymph node
subcapsular sinus
macrophages

medullary sinus
cd169
antiviral immunity


Upper bounds on the average eccentricity Sharp upper bounds on the average eccentricity of a connected graph of given order in terms of its independence number, chromatic number, domination number or connected domination number are given. Our results settle two conjectures of the computer program AutoGraphiX (Aouchicheetal., 2005).

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

average eccentricity
independence number
chromatic number
domination number


Mechanical systems and assemblies modeling using knowledge-intensive Petri nets formalisms This paper presents a novel knowledge-based Petri net approach to mechanical systems and assemblies modeling within a design with objects environment. A new unified class of object-oriented knowledge Petri nets, which can incorporate a knowledge-based system with ordinary Petri nets, is defined and used for the unified representations of assembly design and modeling. The object knowledge Petri nets, as a graphical language and a new knowledge-based description scheme, can be used to express the qualitative and quantitative aspects of the assembly design and modeling process in an interactive and integrated way. The four-level hierarchy model is proposed and constructed in terms of function-behaviors, structures, geometries, and features. The function-behavior-structure description is built on more abstract concepts so that it can match well top-down design. The static and dynamic characteristics in the design of assembly can also be captured. With the help of fuzzy logic, the incomplete, imprecise knowledge and uncertainty in the design process can also be dealt with. Therefore, the hybrid design object model can incorporate product data model, top-down design process, and assembly process model using an object-oriented, knowledge-based, feature-based, parametric, and constraint-based modeling approach, and can provide a more accurate and more flexible representation. To verify and demonstrate the effective use of the proposed hybrid design object model, a prototype system has been developed. This research provides a knowledge-intensive framework for intelligent assembly design and modeling.

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

artificial intelligence
assembly modeling
computer-aided design
design for assembly
design with object


Algorithmical determination of the topology of a real algebraic surface We present an algorithm to compute the topology of a non-singular real algebraic surface S in RP3, that is the number of its connected components and a topological model for each of them. Our strategy consists in computing the Euler characteristic of each connected component by means of a Morse-type investigation of S or of a suitably constructed compact affine surface. This procedure can be used to determine the topological type of an arbitrary non-singular surface; in particular it extends an existing algorithm applicable only to surfaces disjoint from a line. (C) 2004 Elsevier Ltd. All rights reserved.

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


More efficient algorithms and analyses for unequal letter cost prefix-free coding There is a large literature devoted to the problem of finding an optimal (min-cost) prefix-free code with an unequal letter-cost encoding alphabet of size. While there is no known polynomial time algorithm for solving it optimally, there are many good heuristics that all provide additive errors to optimal. The additive error in these algorithms usually depends linearly upon the largest encoding letter size. This paper was motivated by the problem of finding optimal codes when the encoding alphabet is infinite. Because the largest letter cost is infinite, the previous analyses could give infinite error bounds. We provide a new algorithm that works with infinite encoding alphabets. When restricted to the finite alphabet case, our algorithm often provides better error bounds than the best previous ones known.

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

entropy
prefix-free codes
redundancy
source-coding


Effective Hybrid Test Program Development for Software-Based Self-Testing of Pipeline Processor Cores This paper presents an effective hybrid test program for the software-based self-testing (SBST) of pipeline processor cores. The test program combines a deterministically developed program which explores different levels of processor core information and a block-based random program which consists of a combination of in-order instructions, random-order instructions, return instructions, as well as instruction sequences used to trigger exception/interrupt requests. Due to the complementary nature of this hybrid test program, it can achieve processor fault coverage that is comparable to the performance of the conventional scan chain method. The test response observation methods and their impacts on fault coverage are also investigated. We present the concept of micro observation versus macro observation and show that the most effective method of using SBST is through a multiple input signature register connected to the processor local bus, while conventional methods that observe only the program results in the memory lead to significantly less processor fault coverage.

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

fault coverage measure
fault observation method
hybrid sbst
processor testing
software-based self-testing (sbst)


Alphabetic trees - Theory and applications in layout-driven logic synthesis Routing plays an important role in determining the total circuit area and circuit performance and hence must be addressed as early as possible during the design process. In this paper, an effective routing-driven approach for technology-dependent logic synthesis, which relies on alphabetic tree construction, is presented. Alphabetic trees are trees generated under the restriction that the initial order on the leaf nodes is maintained while not introducing any internal edge crossing. First, a mechanism for generating all alphabetic trees on a given number of leaf nodes is presented. Next, the number of such trees is calculated under different height and degree restriction and used to derive upper hounds on the complexity of alphabetic tree optimization problem. A classification of tree cost functions, for which alphabetic trees can be generated in polynomial time, is also proposed. Specifically, alphabetic tree optimization algorithms are applied to generate optimal alphabetic fan-out trees. For fan-out optimization, we obtained 14% improvement in chip area at the cost of 1% loss in performance.

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

fan-out optimization
routing-driven logic synthesis
tree enumeration and optimization


Image matching using a local distribution based outlier detection technique In this paper, an efficient image matching algorithm for finding the consistent correspondences between two sets of image feature points has been presented. Correct assignments are usually compatible with each other, and thus likely to form a strong cluster. The main idea of the proposed algorithm is to detect this cluster using a local distribution based outlier detection technique. Based on neighbor similarity (or affinity), we first define an inlier score for each assignment in candidate assignment set. Then, we iteratively detect the correct assignments from the candidate assignment set by exploiting the inlier score. Experimental results on several real-world image matching tasks demonstrate the effectiveness and robustness of the proposed algorithm.

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


Sixty years of cybernetics - A comparison of approaches to solving the H-2 control problem The H-2 control problem consists of stabilizing a control system while minimizing the H-2 norm of its transfer function. Several solutions to this problem are available. For systems in state space form, an optimal regulator can be obtained by solving two algebraic Riccati equations. For systems described by transfer functions, either Wiener-Hopf optimization or projection results can be applied. The optimal regulator is then obtained using operations with proper stable rational matrices: inner-outer factorizations and stable projections. The aim of this paper is to compare the two approaches. It is well understood that the inner-outer factorization is equivalent to solving an algebraic Riccati equation. However, why are the stable projections not needed in the state-space approach? The difference between the two approaches derives from a different construction of doubly coprime, proper stable matrix fractions used to represent the plant. The transferfunction approach takes any fixed doubly coprime fractions, while the state-space approach parameterizes all such representations and those selected then obviate the need for stable projections.

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

linear systems
feedback control
stability
norm minimization


Mixed-signal IC design guide to enhance substrate noise immunity in bulk silicon technology Predicting substrate cross-talks in mixed-signal circuits has become a critical issue to preserve signal integrity in future integrated systems. Phenomena that involve substrate parasitic voltage and substrate propagation are discussed. A simple methodology to predict the substrate cross-talk and some associated tools are presented. A typical study shows the possibility of such a method and measurements finally demonstrate its efficiency.

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

mixed analog-digital integrated circuits


Segment dependent dynamic multi-histogram equalization for image contrast enhancement This work utilizes the concept of histogram equalization. It introduces the new concept of even expansion of histogram bins. More emphasis has been given on avoidance of intensity saturation problem. New full dynamic range allocation of narrow segments has been introduced. New normalization function has also been introduced.

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

histogram equalization
contrast enhancement
intensity saturation

brightness preservation
multiple segmentation


A case study validation of a knowledge-based approach for the selection of requirements engineering techniques Requirements engineering (RE) is a critical phase in the software engineering process and plays a vital role in ensuring the overall quality of a software product. Recent research has shown that industry increasingly recognizes the importance of good RE practices and the use of appropriate RE techniques. However, due to the large number of RE techniques, requirements engineers find it challenging to select suitable techniques for a particular project. Unfortunately, technique selection based on personal experience has limitations with regards to the scope, effectiveness and suitability of the RE techniques for the project at hand. In this paper, a Knowledge-based Approach for the Selection of Requirements Engineering Techniques (KASRET) is proposed that helps during RE techniques selection. This approach has three major features. First, a library of requirements techniques was developed which includes detailed knowledge about RE techniques. Second, KASRET integrates advantages of different knowledge representation schemata and reasoning mechanisms. Thus, KASRET provides mechanisms for the management of knowledge about requirements techniques and support for RE process development. Third, as a major decision support mechanism, an objective function evaluates the overall ability and cost of RE techniques, which is helpful for the selection of RE techniques. This paper makes not only a contribution to RE but also to research and application of knowledge management and decision support in process development. A case study using an industrial project shows the support of KASRET for RE techniques selection.

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

knowledge management
reasoning
requirements engineering
techniques
decision support


IT and Firm Agility: An Electronic Integration Perspective Firms evolving in increasingly turbulent environments need to respond to market threats and opportunities with speed. At the same time, firms implement numerous information technologies (IT) in the hope of streamlining processes and providing managers with unfettered access to information from both within and outside the firm. While research shows how agility and IT contribute to firm performance, the relationship between these two constructs remains relatively unexplored. Using an electronic integration perspective, we develop a framework that addresses this issue. The framework suggests that IT applications affect the two components of agility ( sensing and responding) through two types of integration (internal and external). The framework also explains the mediating roles of knowledge exploration, knowledge exploitation, and process coupling. Four propositions are developed and illustrated with different examples. Avenues for future research are developed.

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

electronic integration
firm agility
knowledge exploitation
knowledge exploration
process coupling
sensing
responding


Collective action for a common service platform for independent living services Common service platforms for independent living services are scarce. Government plays a crucial role in encouraging joint platform development. The presence of a central actor is essential to initiate platform collaboration.

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

home care services
information systems
incentives
leadership


Immersed-boundary methods for general finite-difference and finite-volume Navier-Stokes solvers We present an immersed-boundary algorithm for incompressible flows with complex boundaries, suitable for Cartesian or curvilinear grid system. The key stages of any immersed-boundary technique are the interpolation of a velocity field given on a mesh onto a general boundary (a line in 2D, a surface in 3D), and the spreading of a force field from the immersed boundary to the neighboring mesh points, to enforce the desired boundary conditions on the immersed-boundary points. We propose a technique that uses the Reproducing Kernel Particle Method [W.K. Liu, S. Jun, Y.F. Zhang, Reproducing kernel particle methods, Int. J. Numer. Methods Fluids 20(8) (1995) 1081-1106] for the interpolation and spreading. Unlike other methods presented in the literature, the one proposed here has the property that the integrals of the force field and of its moment on the grid are conserved, independent of the grid topology (uniform or non-uniform, Cartesian or curvilinear). The technique is easy to implement, and is able to maintain the order of the original underlying spatial discretization. Applications to two- and three-dimensional flows in Cartesian and non-Cartesian grid system, with uniform and non-uniform meshes are presented. (C) 2010 Elsevier Inc. All rights reserved.

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

incompressible navier-stokes equations
immersed-boundary method


discounted deterministic markov decision processes and discounted all-pairs shortest paths We present two new algorithms for finding optimal strategies for discounted, infinite-horizon, Deterministic Markov Decision Processes (DMDP). The first one is an adaptation of an algorithm of Young, Tarjan and Orlin for finding minimum mean weight cycles. It runs in O ( mn + n 2 log n ) time, where n is the number of vertices (or states) and m is the number of edges (or actions). The second one is an adaptation of a classical algorithm of Karp for finding minimum mean weight cycles. It runs in O ( mn ) time. The first algorithm has a slightly slower worst-case complexity, but is faster than the first algorithm in many situations. Both algorithms improve on a recent O ( mn 2 )-time algorithm of Andersson and Vorobyov. We also present a randomized ( m 1/2 n 2 )-time algorithm for finding Discounted All-Pairs Shortest Paths (DAPSP), improving several previous algorithms.

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

markov decision processes
minimum mean weight cycles
shortest paths


Sliding Mode Control of a Class of Uncertain Nonlinear Time-Delay Systems Using LMI and TS Recurrent Fuzzy Neural Network This paper proposes the sliding mode control using LMI techniques and adaptive recurrent fuzzy neural network (RFNN) for a class of uncertain nonlinear time-delay systems. First, a novel TS recurrent fuzzy neural network (TS-RFNN) is developed to provide more flexible and powerful compensation of system uncertainty. Then, the TS-RFNN based sliding model control is proposed for uncertain time-delay systems. In detail, sliding surface design is derived to cope with the non-Isidori-Bynes canonical form of dynamics, unknown delay time, and mismatched uncertainties. Based on the Lyapunov-Krasoviskii method, the asymptotic stability condition of the sliding motion is formulated into solving a Linear Matrix Inequality (LMI) problem which is independent on the time-varying delay. Furthermore, the input coupling uncertainty is also taken into our consideration. The overall controlled system achieves asymptotic stability even if considering poor modeling. The contributions include: i) asymptotic sliding surface is designed from solving a simple and legible delay-independent LMI; and ii) the TS-RFNN is more realizable (due to fewer fuzzy rules being used). Finally, simulation results demonstrate the validity of the proposed control scheme.

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

fnn
time delay
linear matrix inequality (lmi)


Constrained approximation of rational Bezier curves based on a matrix expression of its end points continuity condition For high order interpolations at both end points of two rational Bezier curves, we introduce the concept of C((v,u))-continuity and give a matrix expression of a necessary and sufficient condition for satisfying it. Then we propose three new algorithms, in a unified approach, for the degree reduction of Bezier curves, approximating rational Bezier curves by Bezier curves and the degree reduction of rational Bezier curves respectively; all are in L(2) norm and C((v,u))-continuity is satisfied. The algorithms for the first and second problems can get the best approximation results, and for the third one, resorting to the steepest descent method in numerical optimization obtains a series of degree reduced curves iteratively with decreasing approximation errors. Compared to some well-known algorithms for the degree reduction of rational Bezier curves, such as the uniformizing weights algorithm, canceling the best linear common divisor algorithm and shifted Chebyshev polynomials algorithm, the new one presented here can give a better approximation error, do multiple degrees of reduction at a time and preserve high order interpolations at both end points. (C) 2010 Elsevier Ltd. All rights reserved.

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

rational bezier curves
constrained approximation
degree reduction
numerical optimization


Evolved Features for DNA Sequence Classification and Their Fitness Landscapes A key problem in genomics is the classification and annotation of sequences in a genome. A major challenge is identifying good sequence features. Evolutionary algorithms have the potential to search a large space of features and automatically generate useful ones. This paper proposes a two-stage method that generates features using multiple replicates of a genetic algorithm operating on an augmented finite state machine, called a side effect machine (SEM), and then selects a small diverse feature set using several methods, including a novel method called dissimilarity clustering. We apply our method to three problems related to transposable elements and compare the results to those using k-mer features. We are able to produce a small set of interesting and comprehensible features that create random forest classifiers more accurate and less prone to overfitting than those created using k-mer features. We analyze the SEM fitness landscapes and discuss the use of different fitness functions.

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

automatic feature generation
fitness landscape
side effect machines (sems)


Matrix cubic splines for progressive 3D imaging Mathematical theory of matrix cubic splines is introduced, then adapted for progressive rendering of images. 2D subsets of a 3D digital object are transmitted progressively under some ordering scheme, and subsequent reconstructions using the matrix cubic spline algorithm provide an evolving 3D rendering. The process can be an effective tool for browsing three dimensional objects, and effectiveness is illustrated with a test data set consisting of 93 CT slices of a human head. The procedure has been implemented on a single processor PC system, to provide a platform for full 3D experimentation; performance is discussed. A web address for the complete, documented Mathematica code is given.

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

progressive 3d rendering
progressive transmission of images
matrix polynomial reconstructions


RCytoscape: tools for exploratory network analysis Biomolecular pathways and networks are dynamic and complex, and the perturbations to them which cause disease are often multiple, heterogeneous and contingent. Pathway and network visualizations, rendered on a computer or published on paper, however, tend to be static, lacking in detail, and ill-equipped to explore the variety and quantities of data available today, and the complex causes we seek to understand.

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

biological networks
visualization
exploratory data analysis
statistical programming
bioinformatics


The application of serial MRI analysis techniques to the study of cerebral atrophy in late-onset dementia We have used a serial MR image analysis technique previously developed for studies of cerebral atrophy in early-onset dementia and applied it to a study of late-onset dementia patients with images acquired using a different scanner and scan sequence. Validation and optimisation tests showed that with only small changes to key analysis parameters the technique can successfully be applied to previously untested data with dissimilar image characteristics. The overall accuracy in estimation of cerebral atrophy using the technique was determined to be between 2 and 4 ml (1sigma) depending on the conditions during image acquisition. By comparing the results of alternative registration techniques we demonstrate the potential of using of fully automated 9 DOF image registration as an effective and efficient means of correcting for scanner pixel size variations, even in the presence of significant cerebral atrophy. Applied to the late-onset dementia study, patients were found to have significantly increased mean atrophy rates (p < 0.001) compared to controls. In general the analysis technique is shown to be a robust, accurate and transferable tool of potential value for future studies of dementia and related neuro-degenerative disorders. (C) 2003 Elsevier B.V. All rights reserved.

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

image registration
cerebral atrophy
dementia


The freight allocation problem with lane cost balancing constraint We consider a problem faced by a buying office for one of the largest retail distributors in the world. The buying office plans the distribution of goods from Asia to various destinations across Europe. The goods are transported along shipping lanes by shipping companies, many of which have collaborated to form strategic alliances; each lane must be serviced by a minimum number of companies belonging to a minimum number of alliances. The task involves purchasing freight capacity from shipping companies for each lane based on projected demand, and subject to minimum quantity requirements for each selected shipping company, such that the total transportation cost is minimized. In addition, the allocation must not assign an overly high proportion of freight to the more expensive shipping companies servicing any particular lane, which we call the lane cost balancing constraint. This study is the first to consider the lane cost balancing constraint in the context of freight allocation. We formulate the freight allocation problem with this lane cost balancing constraint as a mixed integer programming model, and show that even finding a feasible solution to this problem is computationally intractable. Hence, in order to produce high-quality solutions in practice, we devised a meta-heuristic approach based on tabu search. Experiments show that our approach significantly outperforms the branch-and-cut approach of CPLEX 11.0 when the problem increases to practical size and the lane cost balancing constraint is tight. Our approach was developed into an application that is currently employed by decision-makers at the buying office in question.

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

minimum quantity commitment
cost balance


An approach for solving nonlinear multi-objective separable discrete optimization problem with one constraint We propose an exact solution approach for solving nonlinear multi-objective optimization problems with separable discrete variables and a single constraint. The approach converts the multi-objective problem into a single objective problem by using surrogate multipliers from which we find all the solutions with objective values within a given range. We call this the surrogate target problem which is solved by using an algorithm based on the modular approach. Computational experiments demonstrate the effectiveness of this approach in solving large-scale problems. A simple example is presented to illustrate an interactive decision making process.

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

multiple objective programming
decision support systems


Fast finite difference Poisson solvers on heterogeneous architectures In this paper we propose and evaluate a set of new strategies for the solution of three dimensional separable elliptic problems on CPUGPU platforms. The numerical solution of the system of linear equations arising when discretizing those operators often represents the most time consuming part of larger simulation codes tackling a variety of physical situations. Incompressible fluid flows, electromagnetic problems, heat transfer and solid mechanic simulations are just a few examples of application areas that require efficient solution strategies for this class of problems. GPU computing has emerged as an attractive alternative to conventional CPUs for many scientific applications. High speedups over CPU implementations have been reported and this trend is expected to continue in the future with improved programming support and tighter CPUGPU integration. These speedups by no means imply that CPU performance is no longer critical. The conventional CPU-controlGPU-compute pattern used in many applications wastes much of CPUs computational power. Our proposed parallel implementation of a classical cyclic reduction algorithm to tackle the large linear systems arising from the discretized form of the elliptic problem at hand, schedules computing on both the GPU and the CPUs in a cooperative way. The experimental result demonstrates the effectiveness of this approach.

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

parallel computing
cpugpu heterogeneous architectures