Abstract: While the form of crises may change, their essence
remains the same (such as a cycle of abundant liquidity, rapid credit
growth, and a low-inflation environment followed by an asset-price
bubble). The current market turbulence began in mid-2000s when the
US economy shifted to imbalanced both internal and external
macroeconomic positions. We see two key causes of these problems
– loose US monetary policy in early 2000s and US government
guarantees issued on the securities by government-sponsored
enterprises what was further fueled by financial innovations such as
structured credit products. We have discovered both negative and
positive lessons deriving from this crisis and divided the negative
lessons into three groups: financial products and valuation, processes
and business models, and strategic issues. Moreover, we address key
risk management lessons and exit strategies derived from the current
crisis and recommend policies that should help diminish the negative
impact of future potential crises.
Abstract: The intermittent connectivity modifies the “always
on" network assumption made by all the distributed query processing
systems. In modern- day systems, the absence of network
connectivity is considered as a fault. Since the last upload, it might
not be feasible to transmit all the data accumulated right away over
the available connection. It is possible that vital information may be
delayed excessively when the less important information takes place
of the vital information. Owing to the restricted and uneven
bandwidth, it is vital that the mobile nodes make the most
advantageous use of the connectivity when it arrives. Hence, in order
to select the data that needs to be transmitted first, some sort of data
prioritization is essential. A continuous query processing system for
intermittently connected mobile networks that comprises of a delaytolerant
continuous query processor distributed across the mobile
hosts has been proposed in this paper. In addition, a mechanism for
prioritizing query results has been designed that guarantees enhanced
accuracy and reduced delay. It is illustrated that our architecture
reduces the client power consumption, increases query efficiency by
the extensive simulation results.
Abstract: Intelligent Video-Surveillance (IVS) systems are
being more and more popular in security applications. The analysis
and recognition of abnormal behaviours in a video sequence has
gradually drawn the attention in the field of IVS, since it allows
filtering out a large number of useless information, which guarantees
the high efficiency in the security protection, and save a lot of human
and material resources. We present in this paper ADABeV, an
intelligent video-surveillance framework for event recognition in
crowded scene to detect the abnormal human behaviour. This
framework is attended to be able to achieve real-time alarming,
reducing the lags in traditional monitoring systems. This architecture
proposal addresses four main challenges: behaviour understanding in
crowded scenes, hard lighting conditions, multiple input kinds of
sensors and contextual-based adaptability to recognize the active
context of the scene.
Abstract: The Boundary Representation of a 3D manifold contains
FACES (connected subsets of a parametric surface S : R2 -!
R3). In many science and engineering applications it is cumbersome
and algebraically difficult to deal with the polynomial set and
constraints (LOOPs) representing the FACE. Because of this reason, a
Piecewise Linear (PL) approximation of the FACE is needed, which is
usually represented in terms of triangles (i.e. 2-simplices). Solving the
problem of FACE triangulation requires producing quality triangles
which are: (i) independent of the arguments of S, (ii) sensitive to the
local curvatures, and (iii) compliant with the boundaries of the FACE
and (iv) topologically compatible with the triangles of the neighboring
FACEs. In the existing literature there are no guarantees for the point
(iii). This article contributes to the topic of triangulations conforming
to the boundaries of the FACE by applying the concept of parameterindependent
Gabriel complex, which improves the correctness of the
triangulation regarding aspects (iii) and (iv). In addition, the article
applies the geometric concept of tangent ball to a surface at a point to
address points (i) and (ii). Additional research is needed in algorithms
that (i) take advantage of the concepts presented in the heuristic
algorithm proposed and (ii) can be proved correct.
Abstract: Quality of Service (QoS) Routing aims to find path between source and destination satisfying the QoS requirements which efficiently using the network resources and underlying routing algorithm and to fmd low-cost paths that satisfy given QoS constraints. One of the key issues in providing end-to-end QoS guarantees in packet networks is determining feasible path that satisfies a number of QoS constraints. We present a Optimized Multi- Constrained Routing (OMCR) algorithm for the computation of constrained paths for QoS routing in computer networks. OMCR applies distance vector to construct a shortest path for each destination with reference to a given optimization metric, from which a set of feasible paths are derived at each node. OMCR is able to fmd feasible paths as well as optimize the utilization of network resources. OMCR operates with the hop-by-hop, connectionless routing model in IP Internet and does not create any loops while fmding the feasible paths. Nodes running OMCR not necessarily maintaining global view of network state such as topology, resource information and routing updates are sent only to neighboring nodes whereas its counterpart link-state routing method depend on complete network state for constrained path computation and that incurs excessive communication overhead.
Abstract: In this paper we present a technique to speed up
ICA based on the idea of reducing the dimensionality of the data
set preserving the quality of the results. In particular we refer to
FastICA algorithm which uses the Kurtosis as statistical property
to be maximized. By performing a particular Johnson-Lindenstrauss
like projection of the data set, we find the minimum dimensionality
reduction rate ¤ü, defined as the ratio between the size k of the reduced
space and the original one d, which guarantees a narrow confidence
interval of such estimator with high confidence level. The derived
dimensionality reduction rate depends on a system control parameter
β easily computed a priori on the basis of the observations only.
Extensive simulations have been done on different sets of real world
signals. They show that actually the dimensionality reduction is very
high, it preserves the quality of the decomposition and impressively
speeds up FastICA. On the other hand, a set of signals, on which the
estimated reduction rate is greater than 1, exhibits bad decomposition
results if reduced, thus validating the reliability of the parameter β.
We are confident that our method will lead to a better approach to
real time applications.
Abstract: The majority of today's IR systems base the IR task on two main processes: indexing and searching. There exists a special group of dynamic IR systems where both processes (indexing and searching) happen simultaneously; such a system discards obsolete information, simultaneously dealing with the insertion of new in¬formation, while still answering user queries. In these dynamic, time critical text document databases, it is often important to modify index structures quickly, as documents arrive. This paper presents a method for dynamization which may be used for this task. Experimental results show that the dynamization process is possible and that it guarantees the response time for the query operation and index actualization.
Abstract: The Algorithm 2 for a n-link manipulator movement amidst arbitrary unknown static obstacles for a case when a sensor system supplies information about local neighborhoods of different points in the configuration space is presented. The Algorithm 2 guarantees the reaching of a target position in a finite number of steps. The Algorithm 2 is reduced to a finite number of calls of a subroutine for planning a trajectory in the presence of known forbidden states. The polynomial approximation algorithm which is used as the subroutine is presented. The results of the Algorithm2 implementation are given.
Abstract: This paper investigates the problem of designing a robust state-feedback controller for a class of uncertain Markovian jump nonlinear systems that guarantees the L2-gain from an exogenous input to a regulated output is less than or equal to a prescribed value. First, we approximate this class of uncertain Markovian jump nonlinear systems by a class of uncertain Takagi-Sugeno fuzzy models with Markovian jumps. Then, based on an LMI approach, LMI-based sufficient conditions for the uncertain Markovian jump nonlinear systems to have an H performance are derived. An illustrative example is used to illustrate the effectiveness of the proposed design techniques.
Abstract: Repetitive systems stand for a kind of systems that
perform a simple task on a fixed pattern repetitively, which are
widely spread in industrial fields. Hence, many researchers have been
interested in those systems, especially in the field of iterative learning
control (ILC). In this paper, we propose a finite-horizon tracking
control scheme for linear time-varying repetitive systems with uncertain
initial conditions. The scheme is derived both analytically
and numerically for state-feedback systems and only numerically for
output-feedback systems. Then, it is extended to stable systems with
input constraints. All numerical schemes are developed in the forms
of linear matrix inequalities (LMIs). A distinguished feature of the
proposed scheme from the existing iterative learning control is that
the scheme guarantees the tracking performance exactly even under
uncertain initial conditions. The simulation results demonstrate the
good performance of the proposed scheme.