Developmental Scaffolding The concept of scaffolding has wide resonance in several scientific fields. Here we attempt to adopt it for the study of development. In this perspective, the embryo is conceived as an integral whole, comprised of several hierarchical modules as in a recurrent circularity of emerging patterns. Within the developmental hierarchy, each module yields an inter-level relationship that makes it possible for the scaffolding to mediate the production of selectable variations. A wide range of genetic, cellular and morphological mechanisms allows the scaffolding to integrate these modular variations into a functionally coordinate unit. A genetic scaffolding accounts for the inherited invariance of pattern formation during the embryos growth. At higher level, cells behave as agents endowed with the capacity to interpret any scaffolding variation as signs. The full hierarchy of a multi-level scaffolding is eventually attained when the embryo acquires the capacity to impose a number of developmental constraints on its constituting parts in a top-down direction. The acquisition of this capacity allows a semiotic threshold to emerge between the living cellular world and the underlying non-living molecular world. As this boundary is gradually defined during development, cells enter into new functional relationships, while, at the same time, are relieved from their physical determinism. The resulting constraints can thus become the driving forces that upgrade embryonic scaffolding from the simple molecular signalling to the complexity of sign recognition proper of a cellular community. In this semiotic perspective, the apparent goal directness of any developmental strategy should no longer be accounted for by a predetermined genetic program, but by the gradual definition of the relationships selected amongst the ones historically explored.

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


Artificial neural networks and neuro-fuzzy systems for modelling and controlling real systems: a comparative study This article presents a comparison of artificial neural networks and neuro-fuzzy systems applied for modelling and controlling a real system. The main objective is to model and control the temperature inside of a kiln for the ceramic industry. The details of all system components are described. The steps taken to arrive at the direct and inverse models using the two architectures: adaptive neuro fuzzy inference system and feedforward neural networks are described and compared. Finally, real-time control results using internal model control strategy are presented. Using available Matlab software for both algorithms, the objective is to show the implementation steps for modelling and controlling a real system. Finally, the performances of the two solutions were compared through different parameters for a specific real didactic case.

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

model-based control and real-time control


Analytical Theory of an Artificial Satellite of the Moon The dynamics of an artificial satellite of the moon is quite different from the dynamics of an artificial satellite of the Earth. Indeed, the C22 term is only 1/10 of the J2 term, and the effect of the Earth on the lunar satellite is much larger than the effect of the Moon on a terrestrial satellite. The method used here is the Lie method for averaging the Hamiltonian of the problem, in canonical variables. The solution is developed in powers of the small factors linked to J2 and C22. Short period terms (linked to l, the mean anomaly) are eliminated first, and then the long period terms (linked to g, the mean argument of the periaster, and to h, the longitude of the ascending node), which finally gives the secular motion. The results are obtained in a closed form, without any series developments in eccentricity or inclination. Thus, the solution applies for a wide range of values, except for few isolated critical values. The results are only very preliminary. As a side result, we were able to check the solution given by Kozai for the effect of the J2 term on an artificial satellite.

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


Waiting time in a combined first-come-first-served and shortest-time-first queue In this paper, we study the regular M/G/1 queue with a combination of FCFS and STF queueing disciplines. The advantage of this combined discipline is the reduction of mean waiting time. Customers are divided into two groups: an FCFS group and an STF group. Customers are first put into FCFS group and are then moved into STF group. An embedded Markov chain is formulated at the times when the STF group is empty. Results are compared with regular M/G/1 queues of FCFS. Scope and purpose First-come-first-served (FCFS) queueing discipline probably is the most commonly used rule in queueing systems. To reduce the mean waiting time, shortest-time-first (STF) rule may be considered, but the disadvantage associated with STF is the long waiting time for customers with long service times. In this paper, we attempt to balance these two queueing disciplines, hoping to achieve better system performance. The impact of the combined queueing disciplines is investigated and compared with FCFS.

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

order statistics
probability generating function
priority queue
queueing control
steady-state probability


Fuzzy Particle Filter for Video Surveillance Video object tracking is the process of locating one or several moving objects in time by the use of optical cameras. In this paper, an algorithm for object tracking by the use of particle filtering is presented. The algorithm employs fuzzy techniques for feature estimation. The algorithm handles color video image sequences from a stationary camera under changing illumination conditions. The proposed algorithm successfully tracks multiple objects by the use of an adaptive Gaussian mixture model for background modeling and a sequential Monte-Carlo-based tracking algorithm. Various fuzzy distance measures have been applied and compared for the estimation of the object location.

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

adaptive gaussian mixture model
particle filter


the imax-432 object filing system iMAX is the operating system for Intel's iAPX-432 computer system. The iAPX-432 1 is an object-oriented multiprocessor architecture that supports capability-based addressing. The object filing system is that part of iMAX that implements a permanent reliable object store. In this paper we describe the key elements of the iMAX object filing system design. We first contrast the concept of an object filing system with that of a conventional file system. We then describe the iMAX design paying particular attention to five problems that other object filing designs have either solved inadequately or failed to address. Finally, we discuss an effect of object filing on the programming semantics of Ada.

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

attention
architecture
design
operating system
concept
addressing
object
paper
effect
multiprocessor

program
systems
semantic
reliability
computation
object-oriented
file systems


Seeing eye to eye? An exploratory study of free open source software users perceptions This study develops a typology that permits the classification of free open source software (FOSS) users into market segments. Based on the typology the nature and extent of perception differences between core FOSS users and FOSS users in other market segments is examined. Significant perception differences are observed between users in different market segments. Consequently, the potential barriers to FOSS adoption are identified and recommendations that may drive greater FOSS adoption are proposed.

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


Longitudinal data model selection In longitudinal data with correlated errors, we apply the likelihood and residual likelihood approaches to obtain the corrected Akaike information criterion (AICc) and the residual information criterion (RIC), respectively. Simulation studies show that AICc outperforms the Akaike information criterion (AIC) when the numbers of subjects and repeated observations are small, and RIC is superior to the Bayesian information criterion (BIC) when the signal-to-noise ratio is moderate to large. We illustrate the practical use of these selection criteria with an empirical example for modeling the serum cholesterol measured at six time occasions.

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

model selection
akaike information criterion
bayesian information criterion
longitudinal data


Implicit application of non-reflective boundary conditions for Navier-Stokes equations in generalized coordinates The non-reflective boundary conditions (NRBC) for Navier-Stokes equations originally suggested by Poinsot and Lele (J. Comput. Phys. 1992; 101:104-129) in Cartesian coordinates are extended to generalized coordinates. The characteristic form Navier-Stokes equations in conservative variables are given. In this characteristic-based method, the NRBC is implicitly coupled with the Navier-Stokes flow solver and are solved simultaneously with the flow solver. The calculations are conducted for a subsonic vortex propagating flow and the steady and unsteady transonic inlet-diffuser flows. The results indicate that the present method is accurate and robust, and the NRBC are essential for unsteady flow calculations. Copyright (c) 2005 John Wiley & Sons, Ltd.

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

non-reflective boundary conditions
navier-stokes equations


Identification of equivalent dynamic model parameters in eddy current problems Purpose - The goal of the paper is to introduce a new method of obtaining equivalent dynamic model of electromagnetic field quantities. Proposed algorithm allows approximation of the frequency and step response by a simple inertial element model, with adjustable rank and delay. The values of the model parameters may be also used to describe the dynamics of considered system. Design/methodology/approach - The dynamics of interesting field quantity in certain space location may be represented by an equivalent model of inertial element. Parameters of the model are identified using the solution of the problem in quasi-stationary conditions for very limited number of excitation frequencies. These solutions are further used to build a matching approximation of real frequency response function (FRF). Findings - The proposed method allows fast approximation of transient states of linear vector field. It may be useful with fast and relatively precise estimation of dynamic parameters of the electromagnetic field, e.g. in screening and eddy current problems. Research limitationstimplications - The main limitation of the method is the assumption of linearity of the problem. However, many practical tasks similar to the examples presented in the paper can be considered highly linear. Practical implications - The main advantage of the method is that it allows fast estimation of the field dynamics without either solving the problem for whole range of frequencies or computing the transient state in time domain. It does not need the access to the original mass and stiffness matrices. Therefore, it may be used with commercial FEM software, which usually restricts access to its internal data. Originality/value = The method is based on well known concept of moments, but the use of existing stationary FEM solutions for approximating transient states is a novel approach. Proposed procedure may be easily automated for the simulation environments with scripting capabilities.

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


The future flight deck: Modelling dual, single and distributed crewing options Contrasting different crewing options with CWA and SNA. Identification of functional loadings on agents. Using data from SOCA-CAT as input into SNA. Analysis of networked in interactions between agents. Using network analysis to identify system resilience.

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

cognitive work analysis
social network analysis


Magnetic and magnetoelastic properties of the TbDyFeCo system In this study the magnetic and magnetostrictive properties of amorphous and polycrystalline thin films with composition (Tb0.3Dy0.7)40Fe60?xCox (x=10, 25, 30, 33) have been investigated in order to analyze the effect of Co substitution on the magnetic and magnetostrictive properties of (Tb0.3Dy0.7)40Fe60. X-ray diffraction studies revealed that all crystalline compositions retained the C-15 cubic Laves phase structure. Substitution of Fe with Co resulted in lower values of the saturation magnetostriction and higher Curie temperatures of both amorphous and crystalline films.

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


The logic of the RAISE specification language This paper describes the logic of the RAISE Specification Language, RSL. It explains the particular logic chosen for RAISE, and motivates this choice as suitable for a wide spectrum language to be used for designs as well as initial specifications, and supporting imperative and concurrent specifications as well as applicative sequential ones. It also describes the logical definition of RSL, its axiomatic semantics, as well as the proof system for carrying out proofs.

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


Lattice-Boltzmann simulations of the thermally driven 2D square cavity at high Rayleigh numbers The thermal lattice Boltzmann equation (TLBE) with multiple-relaxation-times (MRT) collision model is used to simulate the steady thermal convective flows in the two-dimensional square cavity with differentially heated vertical walls at high Rayleigh numbers. The MRT-TLBE consists of two sets of distribution functions, i.e., a D2Q9 model for the mass-momentum equations and a D2Q5 model for the temperature equation. The dimensionless flow parameters are the following: the Prandtl number Pr=0.71 Pr = 0.71 and the Rayleigh number Ra=106,107, and 108 Ra = 10 6 , 10 7 , and 10 8 . The D2Q9+D2Q5 D2Q9 + D2Q5 MRT-TLBE is shown to be second-order accurate and to be capable of yielding results of benchmark quality, including various Nusselt numbers and local hydrodynamic intensities. Our results also agree well with existing benchmark data obtained by other methods.

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

2d square cavity with differentially heated vertical walls


Modellierungsuntersttzung fr die rollenbasierte Delegation in prozessgesttzten Informationssystemen Der Beitrag stellt einen integrierten Ansatz fr die Modellierung und Durchsetzung von Delegationsrichtlinien in prozessbasierten Informationssystemen vor. In diesem Kontext wird eine entsprechende Erweiterung fr rollenbasierte Zugriffskontrollmodelle (RBAC) beschrieben. Diese Erweiterung ist insofern generisch, als sie prinzipiell verwendet werden kann, um beliebige prozessbasierte Informationssysteme oder Prozessmodellierungssprachen mit Konstrukten fr RBAC-Delegationsmodelle zu erweitern. Des weiteren befasst sich der Beitrag mit der Identifikation delegationsbezogener Konflikte sowie den zugehrigen Lsungsstrategien. Insbesondere ist der Ansatz darauf ausgelegt, die Konsistenz der RBAC-Modelle sowohl zur Entwurfszeit als auch zur Laufzeit sicherzustellen. Basierend auf einem formalen Metamodell wird zudem eine UML-Erweiterung fr die Delegation von Rollen, Aufgaben und Pflichten vorgestellt. Diese UML-Erweiterung kann einerseits gemeinsam mit bereits bestehenden UML-Erweiterungen verwendet werden und demonstriert andererseits das prinzipielle Vorgehen zur Integration der neuen Modellkonstrukte in eine standardisierte Modellierungssprache. Zur Evaluierung der praktischen Anwendbarkeit des Ansatzes wurde eine Fallstudie an einem Realweltbeispiel durchgefhrt. Weiterhin wurden alle vorgestellten Modellkonstrukte als Erweiterung der BusinessActivity Library and Runtime Engine implementiert.

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

geschftsprozesse
sicherheit
zugriffskontrolle
access control
business processes
duties
security


Correlation based speech-video synchronization This paper presents a novel Lip synchronization technique which investigates the correlation between the speech and lips movements. First, the speech signal is represented as a nonlinear time-varying model which involves a sum of AMFM signals. Each of these signals is employed to model a single Formant frequency. The model is realized using Taylor series expansion in a way which provides the relationship between the lip shape (width and height) w.r.t. the speech amplitude and instantaneous frequency. Using lips width and height, a semi-speech signal is generated and correlated with the original speech signal over a span of delays then the delay between the speech and the video is estimated. Using real and noisy data from the VidTimit and in-house diastases, the proposed method was able to estimate small delays of 0.010.1s in the case of noise-less and noisy signals respectively with a maximum absolute error of 0.0022s.

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


concurrency design patterns, software quality attributes and their tactics With the prevalent application of multi-core CPUs, software practitioners are facing the challenge of developing high quality multi-threaded programs. Applying concurrency design patterns is one of the best practices in multi-core software engineering. We comprehensively surveyed 28 concurrency design patterns, and provided a problem-oriented guide that navigates software developers towards the "right" pattern(s) with minimal search/reading effort. The guide also illustrates the relationship between concurrency design patterns and the quality attributes they address. Additionally, further investigation was conducted on how these concurrency design patterns implement quality attributes tactics. We present a mapping between surveyed concurrency design patterns and the tactics for two important quality attributes: performance and modifiability. The results of these studies provide an insight into concurrency design patterns for software developers who are seeking appropriate or improved solutions to multi-threaded software development issues.

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

multi-core
quality attribute tactic
design pattern
quality attribute
parallelism


A variable-size local domain approach for increased design confidence in simulation-based optimization Simulation-based design optimization utilizes computational models that rely on assumptions and approximations. There is a need therefore, to ensure that the obtained designs will exhibit the desired behavior as anticipated given the model predictions. The common approach to accomplish that is to validate the utilized computational models prior to the design optimization process. However, this is practically an impossible task especially for design problems with high-dimensional design and parameter spaces. We have recently proposed a different approach for maximizing confidence in the designs generated during a sequential simulation-based optimization process based on calibrating the computational models when necessary and within local subdomains of the design space. In that work, the size of the local domains was held fixed and not linked to uncertainty, and the confidence in designs was quantified using Bayesian hypothesis testing. In this article, we present an improved methodology. Specifically, we use a statistical methodology to account for uncertainty and to determine the size of the local domains at each stage of the sequential design optimization process using parametric bootstrapping that involves maximum likelihood estimators of model parameters. The sequential process continues until the local domain does not change from stage to stage during the design optimization process, ensuring convergence to an optimal design. The proposed methodology is illustrated with the design of a thermal insulator using one-dimensional, linear heat conduction in a solid slab with heat flux boundary conditions.

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

design validation
parametric bootstrap
maximum likelihood estimation


2ghz band mimo propagation measurement of dual polarized antennas in a residential area Multiple Input Multiple Output (MIMO) wireless system is the most promising technology for next generation cellular mobile systems due to its high-speed data transmission capability. This paper focuses on the MIMO propagation characteristics in 2GHz bands. From the viewpoint of cell coverage planning of OFDMA-MIMO systems, it is important to know the key parameters required to estimate MIMO capacity. This paper shows the difference in the propagation characteristics of dual and single polarized MIMO by conducting experimental measurements. It emerged that the ratios of the eigenvalues of the channel matrix, which represent the channel capacity, depend on cross-polarization discrimination (XPD). It was confirmed that there is a positive correlation between XPD and the eigenvalue ratio for dual polarization and a negative correlation for single polarization respectively.

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


Low Levels of mtDNA Deletion Mutations in ETS Normal Fibers from Aged Rats The objectives were (1) to determine whether deletion mutations occur in phenotypically normal type I and type II fibers, (2) to quantify the levels of both deletion mutant and wild-type (wt) mtDNA (nondeletion) within single normal fibers containing mutant mtDNA, and (3) to quantify the amount of wt mtDNA in genotypically and phenotypically normal type I and type II fibers. Deletion mutations in normal fibers are not restricted to specific fiber types, although clonal accumulation of mtDNA deletion mutations and subsequent ETS abnormalities occur exclusively in type II fibers.

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

mitochondrial dna
ets abnormality
fiber type
quantitative pcr


improving the performance of fair share scheduling algorithm using fuzzy logic In Fair Share scheduling shares of CPU time for each group of processes is fixed and then accordingly processes from each group are allocated CPU for their execution. We have proposed a FIS using which CPU share of group of Processes will be decided dynamically. FIS has also been constructed for scheduling within the group to minimize the overheads. For scheduling within the group Fair Share Scheduling algorithm uses Round Robin scheduling. If the process do not complete its execution within the time quantum, the process is put at the end of ready queue and process switch occurs where state of the running process is put onto stack and the state of the next process is taken from the stack and its execution is resumed. If the time required for the running process is slightly more than time quantum by a fraction, even then process is preempted and context switch occurs. This results into more waiting time for that process and more overheads due to unnecessary context switch. In this paper an algorithm using fuzzy logic has also been proposed that tries to remove these two problems.

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


A modal logic internalizing normal proofs In the proof-theoretic study of logic, the notion of normal proof has been understood and investigated as a metalogical property. Usually we formulate a system of logic, identify a class of proofs as normal proofs, and show that every proof in the system reduces to a corresponding normal proof. This paper develops a system of modal logic that is capable of expressing the notion of normal proof within the system itself, thereby making normal proofs an inherent property of the logic. Using a modality Delta to express the existence of a normal proof, the system provides a means for both recognizing and manipulating its own normal proofs. We develop the system as a sequent calculus with the implication connective superset of and the modality Delta, and prove the cut elimination theorem. From the sequent calculus, we derive two equivalent natural deduction systems. (C) 2011 Elsevier Inc. All rights reserved.

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

normal proof
modal logic
sequent calculus

natural deduction system
reflective system


WIPOs new strategies on global intellectual property infrastructure ? This article provides a broad view of the current position and anticipated development of intellectual property and patent information, in the wider context of innovation enhancement worldwide. It traces the continuing rise in the value of IP, as reflected in company intangible assets and in rising numbers of patent applications. In creating a better knowledge infrastructure to facilitate these developments, the author notes its great importance and the differing problems that need addressing in this area across the spectrum from least developed to fully developed countries. In these contexts, he outlines a number of strategic goals and recommendations of WIPO and their likely impact in solving the problems of creating effective, coordinated, and accessible databanks in IP, patent information and scientific non-patent literature. Specifically he points to, for example, the increasing value of the internet in these fields, both through databases and, increasingly, through social networks.

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

patent information
knowledge infrastructure
developed countries

ip strategy
global context
wipo strategies
developing countries
internet databases
internet social networks


Optimal control of a fed-batch bioreactor based upon an augmented recurrent neural network model The paper presents a structured approach to building neural network models for a fed batch bioreactor to allow the development of reactor optimal control policy. Since the ultimate interest in batch bioreactor control is on the end-of-batch product quality, accurate long range predictions are essential in developing optimal control policy. To address the long range prediction issue, an augmented recurrent neural network is used to build long range prediction models which can predict the product quality over the batch trajectory. The augmented recurrent neural network contains two recurrent neural networks in series and utilises available process knowledge to improve long range prediction accuracy. The first network predicts an important process state variable while the second network predicts the product quality variable. Based on the augmented neural network model, constrained optimisation techniques are used to find the optimal control policy. The proposed technique is applied to a simulated fed-batch bioreactor. The results obtained are shown to be comparable to those computed using a full phenomenological model which is usually difficult to obtain, demonstrating that the proposed approach can contribute to the optimal control of some batch processes where detailed mechanistic models are difficult or infeasible to develop.

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


A relative patterns discovery for enhancing outlier detection in categorical data Frequent-itemset-mining (FIM) has been used to detect outliers in categorical data. The previous studies, based on FIM, probably encounter the problem of distortion. This paper aims for designing a mechanism without distortion and inefficiency. We introduce a new perspective relative patterns discovery on association analysis. Our method enables users to discover decisive factors towards the right decision.

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

association analysis
categorical data
outlier detection

frequent itemsets mining
unsupervised method


network survivability in large-scale regional failure scenarios In this short paper we present a preliminary study of the impact of large-scale failures on communication networks. Models for study of large-scale failures are studied and unique characteristics of these scenarios as well as their differences with independent multiple-failure scenarios are presented. In particular, we focus on regional large-scale failure scenarios in which node/link failures are location-dependent. Methods for restoration of traffic and the issue of failure notification time are examined. The regional failure scenario is examined on a sample backbone European network and the simulation results including network capacity requirements and failure notification times for various cases are analyzed and discussed.

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

failure recovery
large-scale failures
mesh survivable networks
traffic restoration


Complexity of Finding Graph Roots with Girth Conditions Graph G is the square of graph H if two vertices x,y have an edge in G if and only if x,y are of distance at most two in H. Given H it is easy to compute its square H (2), however Motwani and Sudan proved that it is NP-complete to determine if a given graph G is the square of some graph H (of girth 3). In this paper we consider the characterization and recognition problems of graphs that are squares of graphs of small girth, i.e. to determine if G=H (2) for some graph H of small girth. The main results are the following. There is a graph theoretical characterization for graphs that are squares of some graph of girth at least 7. A corollary is that if a graph G has a square root H of girth at least 7 then H is unique up to isomorphism. There is a polynomial time algorithm to recognize if G=H (2) for some graph H of girth at least 6. It is NP-complete to recognize if G=H (2) for some graph H of girth 4.

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

graph powers
recognition algorithms
np-completeness


An optimization-model-based interactive decision support system for regional energy management systems planning under uncertainty In this study, an interactive decision support system (UREM-IDSS) has been developed based on an inexact optimization model (UREM, University of Regina Energy Model) to aid decision makers in planning energy management systems. Optimization modeling, scenario development, user interaction, policy analysis and visual display are seamlessly integrated into the UREM-IDSS. Uncertainties in energy-related parameters are effectively addressed through the interval linear programming (ILP) approach, improving the robustness of the UREM-IDSS for real-world applications. Thus, it can be used as an efficient tool for analyzing and visualizing impacts of energy and environmental policies, regional/community sustainable development strategies, emission reduction measures and climate change in an interactive, flexible and dynamic context. The Region of Waterloo has been selected to demonstrate the applicability and capability of the UREM-IDSS. A variety of scenarios (including a reference case) have been identified based on different energy management policies and sustainable development strategies for in-depth analysis of interactions existing among energy, socio-economy, and environment in the Region. Useful solutions for the planning of energy management systems have been generated, reflecting complex tradeoffs among energy-related, environmental and economic considerations. Results indicate that the UREM-IDSS can be successfully used for evaluating and analyzing not only the effects of an individual policy scenario, but also the variations between different scenarios compared with a reference case. Also, the UREM-IDSS can help tackle dynamic and interactive characteristics of the energy management system in the Region of Waterloo, and can address issues concerning cost-effective allocation of energy resources and services. Thus, it can be used by decision makers as an effective technique in examining and visualizing impacts of energy and environmental policies, regional/community development strategies, emission reduction measures, and climate change within an integrated and dynamic framework.

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

energy management systems
interactive decision support system
optimization
sustainable development
uncertainty


Automatic mesh generation and transformation for topology optimization methods This paper presents automatic tools aimed at the generation and adaptation of unstructured tetrahedral meshes in the context of composite or heterogeneous geometry. These tools are primarily intended for applications in the domain of topology optimization methods but the approach introduced presents great potential in a wider context. Indeed, various fields of application can be foreseen for which meshing heterogeneous geometry is required, such as finite element simulations (in the case of heterogeneous materials and assemblies, for example), animation and visualization (medical imaging, for example). Using B-Rep concepts as well as specific adaptations of advancing front mesh generation algorithms, the mesh generation approach presented guarantees, in a simple and natural way, mesh continuity and conformity across interior boundaries when trying to mesh a composite domain. When applied in the context of topology optimization methods, this approach guarantees that design and non-design sub-domains are meshed so that finite elements are tagged as design and non-design elements and so that continuity and conformity are guaranteed at the interface between design and non-design sub-domains. The paper also presents how mesh transformation and mesh smoothing tools can be successfully used when trying to derive a functional shape from raw topology optimization results. (C) 2013 Elsevier Ltd. All rights reserved.

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

mesh generation
advancing front
topology optimization

multiple domains
conforming boundaries
b-rep
cad/fea integration


Bijective Counting of Involutive Baxter Permutations We enumerate bijectively the family of involutive Baxter permutations according to various parameters; in particular we obtain an elementary proof that the number of involutive Baxter permutations of size 2n with no fixed points is 3.2(n-1)/(n+1)(n+2) ((2n)(n)), a formula originally discovered by M. Bousquet-Melou using generating functions. The same coefficient also enumerates planar maps with n edges, endowed with an acyclic orientation having a unique source, and such that the source and sinks are all incident to the outer face.

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

bipolar orientations
bijections
lattice paths


DENSITY WAVE IN A NEW ANISOTROPIC CONTINUUM MODEL FOR TRAFFIC FLOW In this paper, we apply a new anisotropic continuum model proposed by Gupta and Katiyar (GK model, for short) [J .Phys .A: Math. Gen. 38, 4069 (2005)] to study the density wave of traffic flow. The GK model guarantees the characteristic speeds are always less than or equal to the macroscopic flow speed and overcomes the wrong way travel problem which exists in many high-order continuum models. The stability condition of the GK model is obtained. Applying nonlinear analysis to the GK model, we can obtain the soliton, one type of local density wave, which is induced by the density fluctuation in traffic flow. The soliton wave, which is determined near the neutral stability line by the Korteweg-de Vries (KdV) equation, is discussed in great detail. The numerical results show that local cluster effects which are consistent with the diverse nonlinear phenomena observed in realistic traffic flow can be induced from the GK model.

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

anisotropic continuum model
density wave
kdv equation


Profile distance method- a multi-attribute decision making approach for information system investments This article addresses the area of decision making for information systems (IS). We recognize the great demand for methods and techniques that can be of practical help by presenting a new, conceptual approach, the profile distance method, to support the IS selection problem. This approach combines the merits; of two prominent concepts individually applied in decision making: the utility ranking method (URM) and the data envelopment analysis (DEA). In addition, the method involves calculating distances between the desired system profile defined in the additive multi-attribute utility model and the individual alternative profiles calculated by the DEA derived optimization process. The results can be visualized to support the decision maker in justifying and communicating the model outcomes. The proposed method is illustrated within a real-life case study concerning an enterprise resource planning (ERP) software selection problem. (c) 2005 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 B I O O O O O O O O O O O O O O O O O O O O O O O O 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 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

information systems
data envelopment analysis
utility ranking method


List 2-distance coloring of planar graphs The \(2\)-distance coloring of a graph \(G\) is to color the vertices of \(G\) so that every two vertices at distance at most \(2\) from each other get different colors. Let \(\chi _{2}^{l}(G)\) be the list 2-distance chromatic number of \(G\). In this paper, we show that (1) a planar graph \(G\) with \(\Delta (G)\ge 12\) which contains no \(3,5\)-cycles and intersecting 4-cycles has \(\chi _{2}^{l}(G)\le \Delta +6\); (2) a planar graph \(G\) with \(\Delta (G)\le 5\) and \(g(G)\ge 5\) has \(\chi _{2}^{l}(G)\le 13\).

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

choice chromatic number
the maximum degree
2-distance coloring


Control circuits simplification and computer programs design on bipedal robot This study is expected to provide the best design of bipedal robot, which will help widen the application in the future. A new design system is presented through simplification of the control circuit, and the design of computer programs not only lowers the research barriers of the robots but also decreases the development costs. This design system can be used for various operations of manufacturing processes to make up the shortages of the flexibility for the robots. In recent years, the progress in electronics and the control technology has made the robots useful not only for dangerous and automatic tasks, but also for advanced and friendly people service. Thus, the robots have been used in the factories for automation and towards the general use in regular life. Of all robots, the bipedal robot attracts the most attention for its humanoid outlook, user-friendly design, and artificial intelligence for the human society. Many bipedal robots are developed to satisfy consumers needs. The control circuits and the program design are the key issues to make the bipedal robots. In this study, a synchronous robot controller for 31-axis freedom is developed. The authors also equip a memory in the hardware architecture to store all moving commands of the bipedal robot. In terms of internal programs, the authors develop a human interface that synchronizes the movement of the robot and collects the pace data of the robot. The authors use the statistical method to analyze the data and establish a database of the robot's movement. With the database, one can finally drive the robot to walk and generate the pace design of the bipedal robots.

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

bipedal robot
humanoid outlook
simplification
control circuit
computer programs


Investigation on propagation properties of terahertz waveguide hollow plastic fiber The propagation properties of terahertz (THz) waveguide plastic hollow fiber have been investigated in this paper. The effects of radiation frequency, bore diameters and dielectric coating layers on the waveguide property have been shown and discussed. The results show that the attenuation loss of TM mode increases and that of TE mode decreases as radiation frequency increases. The attenuation loss decreases with the increasing of fiber bore diameter. The attenuation loss decreases as the refractive index of dielectric coating layer and the ratio of the refractive index of outer dielectric layer to that of inner dielectric layer increase.

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


Optimal dynamic voltage scaling in energy-limited nonpreemptive systems with real-time constraints Dynamic voltage scaling is used in energy-limited systems as a means of conserving energy and prolonging their life. We consider a setting in which the tasks performed by such a system are nonpreemptive and aperiodic. Our objective is to control the processing rate over different tasks so as to minimize energy subject to hard real-time processing constraints. Under any given task scheduling policy, we prove that the optimal solution to the offline version of the problem can be efficiently obtained by exploiting the structure of optimal sample paths, leading to a new dynamic voltage scaling algorithm termed the Critical Task Decomposition Algorithm (CTDA). The efficiency of the algorithm rests on the existence of a set of critical tasks that decompose the optimal sample path into decoupled segments within which optimal processing times are easily determined. The algorithm is readily extended to an online version of the problem as well. Its worst-case complexity of both offline and online problems is O(N-2).

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

hard real-time system
optimal control
sensor networks


Sustained activity with low firing rate in a recurrent network regulated by spike-timing-dependent plasticity In order to study roles of spike-timing-dependent plasticity (STDP) at the network level, we applied STDP to a model of the cortical recurrent network. We found that STDP brought self-organization of a bistable neural activity that is essential for the working memory function. Furthermore, our simulations showed that the typical two firing patterns during the persistent activity were achieved, which depend on the time window of STDP; the short time window ( ) yielded an asynchronous firing activity, whereas the longer one ( ) produced a synchronous spike packet propagating along a chain of cell assemblies.

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

long-term potentiation/depression
synfire chain
computational model


International roaming charges: over-charging and competition law International roaming is a major technical achievement of the GSM standard. Initially, users were impressed by the technical facility that a mobile phone would work initially across the European Union (EU) and in many other countries, and with a tri-band phone, in North America. Estimates of the market size at the end of 1999 were in the range of US$ 1000 million, with continuing rapid growth. However, users quickly realized that the costs of international roaming were far higher than could be justified. At a time when fixed telecommunications costs and prices were falling, the prices for mobile roaming were spiralling out of control. The response from user organizations has been to withdraw phones, to forbid their use abroad and to encourage alternatives, such as phone-cards and visits to local offices. A series of surveys by INTUG in 1999 and 2000 gathered comparative data on international roaming charges in Europe. The results showed price variances of 210 times for the same or a similar call. These data have attracted the interest of the Competition Directorate-General of the European Commission and a formal investigation has been initiated. A decision is expected in late-2000, which could have influence outside the EU, since the principles of competition law, and the terms of international roaming agreements are similar around the world. The indications are that the complexity of the charges, the backroom negotiations and other factors demonstrate that this is very far from being a competitive market. As the GSM Association begins to create a Global Roaming Forum to prepare for 3G (UMTS) roaming, it is clear that a more open and competitive regime is essential if the prices are to be driven down to reasonable levels. That in turn is necessary if we are to see the innovations in uses necessary for the next stage of the development of the mobile telecommunications industry and mobileInternet convergence.

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


a population-based approach to finding the matchset of a learning classifier system efficiently Profiling of the learning classifier system XCS [11] has revealed that its execution time tends to be dominated by rule matching [8], it is therefore important for rule matching to be efficient. To date, the fastest speedups for matching have been achieved by exploiting parallelism [8], but efficient sequential approaches, such as bitset and "specificity" matching [2], can be utilised if there is no platform support for the vector instruction sets that [8] employs. Previous sequential approaches have focussed on improving the efficiency of matching individual rules; in this paper, we introduce a population-based approach that partially matches many rules simultaneously. This is achieved by maintaining the rule-base in a rooted 3-ary tree over which a backtracking depth-first search is run to find the matchset. We found that the method generally outperformed standard and specificity matching on raw matching and on several benchmarking tasks. While the bitset approach attained the best speedups on the benchmarking tasks, we give an analysis that shows that it can be the least efficient of the approaches on long rule conditions. A limitation of the new method is that it is inefficient when the proportion of "don't care" symbols in the rule conditions is very large, which could perhaps be remedied by combining the method with the specificity technique.

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

efficient matching
learning classifier systems
lcs


A controlled experiment to assess the impact of system architectures on new system requirements While much research attention has been paid to transitioning from requirements to software architectures, relatively little attention has been paid to how new requirements are affected by an existing system architecture. Specifically, no scientific studies have been conducted on the characteristic differences between the newly elicited requirements gathered in the presence or absence of an existing software architecture. This paper describes an exploratory controlled study investigating such requirements characteristics. We identify a multitude of characteristics (e.g., end-user focus, technological focus, and importance) that were affected by the presence or absence of an SA, together with the extent of this effect. Furthermore, we identify the specific aspects of the architecture that had an impact on the characteristics. The study results have implications for RE process engineering, post-requirements analysis, requirements engineering tools, traceability management, and future empirical work in RE based on several emergent hypotheses resultant from this study.

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

requirements engineering
software architecture
controlled study

empirical study
software engineering
software process


Precedents reconceived: Urban design learning catalysed through data rich 3-D digital models Design students are increasingly seeking precedent information through web-based digital archives of design cases. Little is known, however, about the use, relative merits or opportunities of digital cases as a knowledge source for design students. This paper uses a study of web-based urban design reference tools to examine new opportunities for using precedents in urban design. The research includes focus groups, content analysis of student work and an auto-ethnography by one of the authors to examine student use of the reference tools in 3 urban design studios in planning and landscape architecture. Students used 3-D digital models of precedents to review, replicate, revise, reshape and recreate elements of urban design in an environment of accelerated learning.

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

design precedents
design education
3-d visualization
built environment


Algorithmic asymptotic analysis of the NF-?B NF- ? B signaling system The results of a detailed, step-by-step, asymptotic analysis of the NF-?B NF- ? B signaling system are reported, in the case where the system exhibits limit cycle behavior. The analysis is based on the dimensional form of the model and exploits the various fast/slow time scale gaps that develop as the solution evolves along the limit cycle. It is shown that under the action of fast time scales of dissipative character, the limit cycle is confined on a low-dimensional surface in the phase space. The cycle can be divided in three parts, each one related to a different characteristic time scale. The first part refers to the slow rate of NF-?B NF- ? B release in the cytoplasm. The second part refers to the even slower rate by which the free NF-?B NF- ? B enters into the nucleus. The last part refers to the fast rate by which the nuclear NF-?B NF- ? B is first produced and then depleted. It is demonstrated that these and many other findings (regarding the fast variables, the equilibrated fast processes, the rate limiting and/or driving steps, etc.) can be acquired by simple algorithmic tools.

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

nf-?b nf- ? b signaling system nf-?b nf- ? b nf-?b nf- ? b nf- ? b


A hybrid particle swarm optimization approach for the sequential ordering problem The sequential ordering problem is a version of the asymmetric travelling salesman problem where precedence constraints on vertices are imposed. A tour is feasible if these constraints are fulfilled, and the objective is to find a feasible solution with minimum cost. A particle swarm optimization approach hybridized with a local search procedure is discussed in this paper. The method is shown to be very effective in guiding a sophisticated local search previously introduced in the literature towards high quality regions of the search space. Differently from standard particle swarm algorithms, the proposed hybrid method tends to fast convergence to local optima. A mechanism to self-adapt a parameter and to avoid stagnation is therefore introduced. Extensive experimental results, where the new method is compared with the state-of-the-art algorithms, show the effectiveness of the new approach.

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

sequential ordering problem
particle swarm optimization


automatic production of controller specifications from control and timing behavioral descriptions This paper presents a method for the generation of controller specifications from high-level behavioral descriptions in control and timing graph form. Input descriptions may contain multiple timing constraints, asynchronous and synchronous inputs, data dependent internal loops, and parallel and conditional branches. The timing graph model is transformed automatically to a state table specification of a synchronous finite state machine. The specification method is effective not only for independent data processors, but also for processors constrained by interface requirements and performing I/O protocol translation. The method has been programmed and tested on selected examples. Results from one example are given along with a comparison with results on the same example from another system.

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

requirements
generation
examples
input
timing
paper
control
translation
method
parallel
data
graph
finite state machine

synchronization
graph models
intern
time constraint
interfaces
comparisons
processor
product
dependencies
systems
asynchronicity
behavior
effect


Elastic analysis and application tables of rectangular plates with unilateral contact support conditions In the present study, a numerical methodology for the elastic analysis of single plates is presented, which takes into account any unilateral support conditions (uplift potential) that can occur in one or more supporting boundaries. The plates are discretized with a fine mesh of finite elements and the unilateral support conditions are simulated through proper link elements, while the determination of the uplifted regions of the plates is part of the problem's solution. A parametric study is then carried out for rectangular edge-supported plates for various combinations of support conditions and aspect ratios. From the processing of the results of this analysis, proper application tables for the calculation of stress state of the plates were created, in a form similar to the well-known tables compiled by Czerny.

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

unilateral supported plates
application tables of plates


Across the Hill: The congressional research service and providing research for congressA retrospective on origins The Congressional Research Service (CRS) of today is a 1970 extension of the Legislative Reference Service, which was initially established through the appropriations process in 1914 and statutorily given permanent, institutional status in 1946. Throughout their existence, these entities have been, in varying degrees, part of the Library of Congress, which, itself, dates to the arrival of the federal government in the new capital in 1800. Provided here is a retrospective on these organizationstheir origins, structural development, changing missions, and, in the case of the CRS, its current operational status.

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

congressional research service
legislative reference service
library of congress


A hybrid interface method for three-dimensional multiphase flows based on front tracking and level set techniques Successful interface methods for multiphase flows need to be designed to operate well in the opposite extremes of strongly surface tension-dominant flows on the one hand and strongly deforming flows on the other. To this end, recent advances in direct numerical simulation of multiphase flows have involved the hybridization of popular methods. One hybrid approach developed by the authors is the level contour reconstruction method (LCRM), which combines the characteristics of both the front tracking and the level set method. It was designed specifically for general 3D multiphase flow problems where very dynamic and deformable interfaces interact and where accuracy, reliability, and simplicity are essential features. In this paper, we carry the hybridization of the LCRM with the level set technique to a further level in that the explicit calculation of a distance function is introduced and plays a crucial role in the interface reconstruction procedure as well as in the calculation of the surface tension force. An accurate method of computing the distance function directly from the tracked interface is presented whereby a vector distance function is found, i.e. the minimum distance to the interface as well as the corresponding minimum distance point location on the interface itself. This information allows us to calculate a compact Curvature field for the computation of the surface tension force, which decreases the level of parasitic Currents to a negligible level. Various benchmark test cases to demonstrate the accuracy of the new schemes compared with other existing methods are provided. Copyright (c) 2008 John Wiley & Sons, Ltd.

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

numerical simulation
front tracking
level set
multiphase flow
curvature


The point collocation-based method of finite spheres (PCMFS) for real time surgery simulation Simulation based medical training requires real time interactivity. While real time graphical display requires an update rate of 30Hz, real time force feedback requires a much higher update rate of 1kHz. The demand for extreme computational efficiency delimits the complexity of the computational models that can be used for simulation. In this paper we develop two specializations of a meshfree technique, the point collocation-based method of finite spheres (PCMFS), for real time simulation of soft tissues during minimally invasive surgery (MIS). Simulations using realistic three-dimensional geometries are presented and are compared with solutions using more traditional finite element methods in terms of speed and accuracy. The integration of the proposed schemes into a practical surgical simulation system is also discussed.

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

method of finite spheres
surgery simulation

meshfree method
point collocation
structural reanalysis


Numerical approximation for singular second order differential equations We consider numerical approximation of solutions of singular second order differential equations. In particular, we study the backward ( or implicit) Euler method. We prove results concerning consistency, global error and stability. We show that the global error is linear with respect to the step size. Numerical results are also given, which demonstrate the linear convergence and we compare the numerical results with known approximations. (C) 2008 Elsevier Ltd. All rights reserved.

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

numerical approximation
implicit euler method

singular differential equations
backward euler method


M-2-computable real numbers The article concerns subrecursive computability of real numbers. Certain significant real numbers are shown to be M-2-computable, and the set of the M-2-computable real numbers is shown to be closed under the elementary functions of calculus.

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

subrecursive
elementary functions of calculus

computable real number
computable real-valued function
m-2
delta(0) definable


on securing untrusted clouds with cryptography In a recent interview, Whitfield Diffie argued that "the whole point of cloud computing is economy" and while it is possible in principle for "computation to be done on encrypted data, [...] current techniques would more than undo the economy gained by the outsourcing and show little sign of becoming practical ". Here we explore whether this is truly the case and quantify just how expensive it is to secure computing in untrusted, potentially curious clouds. We start by looking at the economics of computing in general and clouds in particular. Specifically, we derive the end-to-end cost of a CPU cycle in various environments and show that its cost lies between 0.5 picocents in efficient clouds and nearly 27 picocents for small enterprises (1 picocent = $1 x 10 -14 ), values validated against current pricing . We then explore the cost of common cryptography primitives as well as the viability of their deployment for cloud security purposes. We conclude that Diffie was correct. Securing outsourced data and computation against untrusted clouds is indeed costlier than the associated savings, with outsourcing mechanisms up to several orders of magnitudes costlier than their non-outsourced locally run alternatives.

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


collaborative knowledge semantic graph image search In this paper, we propose a Collaborative Knowledge Semantic Graphs Image Search (CKSGIS) system. It provides a novel way to conduct image search by utilizing the collaborative nature in Wikipedia and by performing network analysis to form semantic graphs for search-term expansion. The collaborative article editing process used by Wikipedia's contributors is formalized as bipartite graphs that are folded into networks between terms. When a user types in a search term, CKSGIS automatically retrieves an interactive semantic graph of related terms that allow users to easily find related images not limited to a specific search term. Interactive semantic graph then serve as an interface to retrieve images through existing commercial search engines. This method significantly saves users' time by avoiding multiple search keywords that are usually required in generic search engines. It benefits both nave users who do not possess a large vocabulary and professionals who look for images on a regular basis. In our experiments, 85\% of the participants favored CKSGIS system rather than commercial search engines.

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

keyword expansion
social network
re-ranking


Modelling of a self-led critical friend topology in inter-cooperative grid communities For decades, much work has been done to increase the effectiveness and efficiency of job sharing amongst available computational resources. Resources can be organized into a variety of topologies, and recent work has shown that a decentralized distributed resource topology is a crucial but complicated scenario. This is because decentralized resources are normally grouped into independent virtual organizations (VOs) and isolated from each other by VO boundaries. To convey jobs across gaps between various virtual organizations, a novel resource topology called the self-led critical friend model (CFM) is proposed in this work. The CFM deals with trust credits between resources according to their historical collaboration records. This trust reveals a feasible, realistic, and transferable correlation to facilitate the resource selection process for job delegation between arbitrarily connected physical resources. Consequently, the CFM is able to overcome the constraints caused by virtual organization boundaries. Besides the theoretical model, a simulation-based implementation is carried out together with a complementary high-level community-aware scheduling protocol. After evaluating a number of compositional scenarios and criteria objectives, the observed results show the benefit of job scheduling across multiple VOs, as well as the capability of the self-led critical friend model as a novel cross-VO resource topology to represent and interconnect resources.

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

grid scheduling
critical friend model (cfm)
self-led critical friend
inter-cooperative grid


Simulation of shearing by node separation method The objective of the present work is to clarify ductile fracture phenomena in bulk metal forming, by means of finite-element analyses and experiments. We have developed a computer program, based on a conventional computer program of the finite-element method, with which the behavior of crack growth after ductile fracture can be analyzed. The phenomenon that a material is divided into two materials upon shearing has been simulated by the program, and the following results were obtained. First, in order to perform a precise simulation, we have developed a method of representing the sharp change in the direction of material flow at the tool corners, a method of controlling tool displacement so that an element is fractured in each step and a method of separating nodes at fracture. Second, analytical results of the shape of the sheared surface, the shape of the fractured surface, the length of the sheared surface, the length of the fractured surface and the relationship between the punch displacement and punch force are found to agree with the experimental results. Hence, we have confirmed the validity of the methods.

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

shearing
node separation
ductile fracture

severe plastic deformation
rigid-plastic finite-element method
gurson model


Effect of Ferrous Iron on Arsenate Sorption to Amorphous Ferric Hydroxide Amorphous ferric hydroxide (AFH) sorbents are commonly used for removal of arsenate from water. When disposed in microbially active, reducing environments, such as landfills, Fe(II) will be generated by reductive dissolution of the AFH surface and arsenate will be desorbed. However, the observed ratio of arsenate (and, in fact, total arsenic) to total iron in the leachate is not consistent with the original ratio of arsenate to iron on the AFH. Work to determine if ferrous iron re-adsorption to the AFH can partially explain this inconsistency is described. As pH increases above 7, Fe(II) increasingly sorbs onto the AFH surface. This sorption is largely independent of ionic strength and somewhat irreversible at high pH. In contrast, arsenate partitioning to AFH decreases with increasing pH. However, over the pH range from 5 to 9, the presence of Fe(II) sorbed to the AFH surface increases the capacity for arsenate sorption. In addition, when no Fe(II) is present, arsenate binding is largely to surface sites inaccessible to Fe(II) binding. The results are also consistent with Fe(II) sorption to AFH sites, otherwise unfavorable to arsenate binding and transformation of those sites into arsenate-amenable binding sites.

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

amorphous ferric hydroxide
ferrous iron
arsenate
sorption

fe(ii)
as(v)
absr
water treatment residuals
arsenic residuals disposal


Reliable moving vehicle detection based on the filtering of swinging tree leaves and raindrops An efficient method for detecting moving vehicles based on the filtering of swinging trees and raindrops is proposed. To extract moving objects from the background, an adaptive background subtraction scheme with a shadow elimination model is used. Swinging trees are removed from foreground objects to reduce the computational complexity of subsequent tracking. Raindrops are removed from foreground objects when necessary. Performance evaluations are carried out using seven real-world traffic image sequences. Experimental results show average recognition rates of 96.83% and 97.20% for swinging trees and raindrops, respectively, indicating the feasibility of the proposed method.

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

background subtraction
shadow elimination

traffic surveillance system
motion detection
motion estimation
motion compensation
swinging trees filtering
raindrops filtering


Omnidirectional visual control of mobile robots based on the 1D trifocal tensor The precise positioning of robotic systems is of great interest particularly in mobile robots. In this context, the use of omnidirectional vision provides many advantages thanks to its wide field of view. This paper presents an image-based visual control to drive a mobile robot to a desired location, which is specified by a target image previously acquired. It exploits the properties of omnidirectional images to preserve the bearing information by using a 1D trifocal tensor. The main contribution of the paper is that the elements of the tensor are introduced directly in the control law and neither any a priori knowledge of the scene nor any auxiliary image are required. Our approach can be applied with any visual sensor obeying approximately a central projection model, presents good robustness to image noise, and avoids the problem of a short baseline by exploiting the information of three views. A sliding mode control law in a square system ensures stability and robustness for the closed loop. The good performance of the control system is proven via simulations and real world experiments with a hypercatadioptric imaging system.

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

visual control
omnidirectional images
1d trifocal tensor
mobile robots


Back-propagation learning algorithm and parallel computers: The CLEPSYDRA mapping scheme This paper deals with the parallel implementation of the back-propagation of errors learning algorithm. To obtain the partitioning of the neural network on the processor network the author describes a new mapping scheme that uses a mixture of synapse parallelism, neuron parallelism and training examples parallelism (if any). The proposed mapping scheme allows to describe the back-propagation algorithm as a collection of SIMD processes, so that both SIMD and MIMD machines can be used. The main feature of the obtained parallel algorithm is the absence of point-to-point communication; in fact, for each training pattern, an all-to-one broadcasting with an associative operator (combination) and an one-to-all broadcasting (that can be both realized in logP time) are needed. A performance model is proposed and tested on a ring-connected MIMD parallel computer. Simulation results on MIMD and SIMD parallel machines are also shown and commented.

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

back-propagation
mimd parallel computers
simd parallel computers


cluster miss prediction for instruction caches in embedded networking applications In this paper, we describe a new method of instruction prefetching that reduces the cache miss penalty by anticipating the cache behavior based on previous execution. Our observations indicate that instruction cache misses often repeat in clusters under certain conditions prevalent in real time embedded networking systems. By identifying the start of a cluster miss sequence and preparing an instruction buffer for the upcoming cache misses, the miss penalty can be reduced if a miss does occur. A sample industrial networking example is used to illustrate the effectiveness of this technique compared with other prefetch methods.

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

wcet
hiding memory latency
embedded systems
compulsory cache misses
cache prefetch
cache design


a prolog-based framework for search, integration and empirical analysis on software evolution data Software projects use different repositories for storing project and evolution information such as source code, bugs and patches. An integrated system that combines these multiple repositories and can answer a broad range of queries regarding the project's evolution history would be beneficial to both software developers and researchers. For example, the list of source code changes or the list of developers associated with a bug fix are frequent queries for both developers and researchers. Integrating and gathering this information is a tedious, cumbersome, error-prone process when done manually, especially for large projects. Previous approaches to this problem use frameworks that limit the user to a set of pre-defined query templates, or use query languages with limited power. In this paper, we argue the need for a framework built with recursively enumerable languages, that can answer temporal queries, and supports negation and recursion. As a first step toward such a framework, we present a Prolog-based system that we built, along with an evaluation of real-world integrated data from the Firefox project. Our system allows for elegant and concise, yet powerful queries, and can be used by developers and researchers for frequent development and empirical analysis tasks.

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

empirical studies
prolog
data integration


A hierarchical learning network for face detection with in-plane rotation ? This paper presents a scale and rotation invariant face detection system. The system employs a hierarchical neural network, called SICoNNet, whose processing elements are governed by the nonlinear mechanism of shunting inhibition. The neural network is used as a face/nonface classifier that can handle in-plane rotated patterns. To train the network as a rotation invariant face classifier, an enhanced bootstrap training technique is developed, which prevents bias towards the nonface class. Furthermore, a multiresolution processing is employed for scale invariance: an image pyramid is formed through sub-sampling and face detection is performed at each scale of the pyramid using an adaptive threshold. Evaluated on the benchmark CMU rotated face database, the proposed face detection system outperforms some of the existing rotation invariant face detectors; it has fewer false positives and higher detection accuracy.

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

feedforward neural network
convolutional neural network
scale invariant face detection
shunting inhibitory neurons
bootstrap training method


An evaluation of inter-organizational workflow modeling formalisms This paper evaluates the dynamic aspects of the UML in the context of interorganizational workflows. Two evaluation methodologies are used. The first one is ontological and is based on the BWW (Bunge-Wand-Weber) models. The second validation is based on prototyping and consists of the development of a workflow management system in the aerospace industry. Both convergent and divergent results are found from the two validations. Possible enhancements to the UML formalism are suggested from the convergent results. On the other hand, the divergent results suggest the need for a contextual specification in the BWW models.

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

ontology
conceptual study
prototype validation
is development methods and tools


characterizations of polynomial complexity classes with a better intensionality In this paper, we study characterizations of polynomial complexity classes using first order functional programs and we try to improve their intensionality, that is the number of natural algorithms captured. We use polynomial assignments over the reals. The polynomial assignments used are inspired by the notions of quasiinterpretation and sup-interpretation, and are decidable when considering polynomials of bounded degree ranging over real numbers. Contrarily to quasi-interpretations, the considered assignments are not required to have the subterm property. Consequently, they capture a strictly larger number of natural algorithms (including quotient, gcd, duplicate elimination from a list) than previous characterizations using quasi-interpretations

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

static analysis
quasi-interpretation
resource upper bounds
sup-interpretation


Image-based area estimation of any connected region using y-convex region decomposition In this paper, we address the issue of finding the area of any connected region from its digital image. We have reviewed the existing techniques and brought out their shortcomings. In particular, we observe that none of the existing techniques can satisfactorily find the area of certain types of regions. To overcome such shortcomings, we propose an algorithm for decomposing any connected region R into one or more disjoint regions Yi. The decomposition is such that all the sub-regions satisfy a convexity property, referred to as y-convex property. y-Convex region is one in which no vertical line intersects the boundary curve more than twice. An interesting property of a y-convex region is that its contour can be split into an upper curve and a lower curve, and hence known numerical methods can be used to estimate its area. So, our decomposition algorithm enables us to find the area of R as the summation of the areas of all Yi. Since there are no bench mark images for validation, we have created a new database of images including the images used by previous works. Experimental results show that our method has an average accuracy of 99.01% and the paired t-test confirms that the difference between the actual and estimated area is considered to be not quite statistically significant with t and two-tailed p values of 1.68 and 0.0953, respectively. The proposed approach can be potentially used in applications such as geographical survey, morphological analysis of micro-organisms, medical image analysis, crime scene documentation, agriculture, and food industry.

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

multiply-connected regions
greens theorem
cylindrical algebraic decomposition


Some models for deriving the priority weights from interval fuzzy preference relations Interval fuzzy preference relation is a useful tool to express decision makers uncertain preference information. How to derive the priority weights from an interval fuzzy preference relation is an interesting and important issue in decision making with interval fuzzy preference relation(s). In this paper, some new concepts such as additive consistent interval fuzzy preference relation, multiplicative consistent interval fuzzy preference relation, etc., are defined. Some simple and practical linear programming models for deriving the priority weights from various interval fuzzy preference relations are established, and two numerical examples are provided to illustrate the developed models.

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

priority weight
multiplicative transitivity
additive transitivity


Empowering teachers to create educational software: A constructivist approach utilizing Etoys, pair programming and cognitive apprenticeship This study investigates whether a visual programming environment called Etoys could enable teachers to create software applications meeting their own instructional needs. Twenty-four teachers who participated in the study successfully developed their own educational computer programs in the educational technology course employing cognitive apprenticeship and pair programming approaches as the primary instructional strategies. Two educational software programs created by the participating teachers were described in order to explain what they were trying to do using Etoys and how they accomplished their goals. The results of an anonymous survey evaluating the difficulty of and the attitude toward learning Etoys indicate that teachers enjoyed learning Etoys and would like to continue to use it in the future although they found it was slightly more difficult, compared to their self-evaluated computer skill. The strengths and weaknesses of Etoys, the difficult computer programming concepts, and the educational implications of Etoys programming were also discussed. (C) 2010 Elsevier Ltd. All rights reserved.

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

interactive learning environment
media in education
programming and programming languages
teaching/learning strategies


Simulation of Stochastic Hybrid Systems using probabilistic boundary detection and adaptive time stepping Modeling and simulation of biochemical systems are important tasks because they can provide insights into complicated systems where traditional experimentation is expensive or impossible. Stochastic Hybrid Systems (SHS) are an ideal modeling paradigm for biochemical systems because they combine continuous and discrete dynamics in a stochastic framework. In this work we develop an advanced simulation method for SHS that explicitly considers switching and reflective boundaries and uses probabilistic crossing detection methods to improve accuracy. We also develop an adaptive time stepping algorithm for SHS to improve efficiency. We present case studies for a water/electrolyte balance system in humans and a biodiesel production model. Simulation results are presented to demonstrate the accuracy and efficiency of the improved simulation techniques.

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

modeling
simulation
stochastic
adaptive time stepping


From abstract task knowledge to executable robot programs Robots that are capable of learning new tasks from humans need the ability to transform gathered abstract task knowledge into their own representation and dimensionality. New task knowledge that has been collected e.g. with Programming by Demonstration approaches by observing a human does not a-priori contain any robot-specific knowledge and actions, and is defined in the workspace of the human demonstrator. This article presents a new approach for mapping abstract human-centered task knowledge to a robot execution system based on the target system properties. Therefore the required background knowledge about the target system is examined and defined explicitly.

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

abstract task knowledge
executable robot programs
robots


Exploring spatially prioritized parameters of Feng-Shui from tomb footprint Geographic information systems (GIS) and spatial regression modeling techniques were used to evaluate the spatially prioritized relationships between grave density and various spatial parameters for a total of 5549 grave locations. Solar radiation was the most important predictor of grave density in the Feng-Shui locations. Similarly, spatial clustering technology identified the fact that high concentrations of grave necessarily accompany the significantly increasing trends of solar radiation. The results of the regression analyses indicate that the grave density could be explained by the four landform parameters alone yielding R 2 values of 0.751. In contrast to the typical theory, slope and aspect were not a dominant determining factor upon the dependent variable of grave density. Also, the significantly increasing trends of grave density were not observed in line with a southern direction. A clear verification has been made for the hidden assumptions in Feng-Shui's long history that its approach is found to be more appropriate in avoiding shadow conditions, rather than exploring the ideal landform location.

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

spatially prioritized parameters
tomb footprint
gis