汽车司机安全驾驶性向测验常模的编制

In this research, the Driver Safety Aptitude Testing is normalized and its state norm formulated. The sample consists of 2045 drivers whohave at least one year driving experience, and a selected from 12 cities in 8 provinces and one city. The results of examining shows that the Driver Safety Aptitude Test have a good reliability and good validity. The forms of norm are <> and <Sum Score of Ability Tests>>.

On the Behavior of the Homogeneous Self-Dual Model for Conic Convex Optimization

There is a natural norm associated with a starting point of the homogeneous self-dual (HSD) embedding model for conic convex optimization. In this norm two measures of the HSD model’s behavior are precisely controlled independent of the problem instance: (i) the sizes of ε-optimal solutions, and (ii) the maximum distance of ε-optimal solutions to the boundary of the cone of the HSD variables. This norm is also useful in developing a stopping-rule theory for HSD-based interior-point methods such as SeDuMi. Under mild assumptions, we show that a standard stopping rule implicitly involves the sum of the sizes of the ε-optimal primal and dual solutions, as well as the size of the initial primal and dual infeasibility residuals. This theory suggests possible criteria for developing starting points for the homogeneous self-dual model that might improve the resulting solution time in practice

An Analog VLSI Chip for Estimating the Focus of Expansion

For applications involving the control of moving vehicles, the recovery of relative motion between a camera and its environment is of high utility. This thesis describes the design and testing of a real-time analog VLSI chip which estimates the focus of expansion (FOE) from measured time-varying images. Our approach assumes a camera moving through a fixed world with translational velocity; the FOE is the projection of the translation vector onto the image plane. This location is the point towards which the camera is moving, and other points appear to be expanding outward from. By way of the camera imaging parameters, the location of the FOE gives the direction of 3-D translation. The algorithm we use for estimating the FOE minimizes the sum of squares of the differences at every pixel between the observed time variation of brightness and the predicted variation given the assumed position of the FOE. This minimization is not straightforward, because the relationship between the brightness derivatives depends on the unknown distance to the surface being imaged. However, image points where brightness is instantaneously constant play a critical role. Ideally, the FOE would be at the intersection of the tangents to the iso-brightness contours at these "stationary" points. In practice, brightness derivatives are hard to estimate accurately given that the image is quite noisy. Reliable results can nevertheless be obtained if the image contains many stationary points and the point is found that minimizes the sum of squares of the perpendicular distances from the tangents at the stationary points. The FOE chip calculates the gradient of this least-squares minimization sum, and the estimation is performed by closing a feedback loop around it. The chip has been implemented using an embedded CCD imager for image acquisition and a row-parallel processing scheme. A 64 x 64 version was fabricated in a 2um CCD/ BiCMOS process through MOSIS with a design goal of 200 mW of on-chip power, a top frame rate of 1000 frames/second, and a basic accuracy of 5%. A complete experimental system which estimates the FOE in real time using real motion and image scenes is demonstrated.

The topological behaviour of 3D null points in the Sun's corona

Brown D. S. and Priest E. R. 2001, The topological behaviour of 3D null points in the Sun's corona, Astronomy and Astrophysics, 367, 339-346

Rozproszone algorytmy aproksymacyjne dla grafów dyskowych

Wydział Matematyki i Informatyki: Zakład Matematyki Dyskretnej

O wielomianach cyklotomicznych

Wydział Matematyki i Informatyki

Kształcenie zdalne w szkole wyższej – stan i perspektywy

Wydział Studiów Edukacyjnych

Rola systemu podatkowego przed, w trakcie i po kryzysie finansowym

Celem niniejszego artykułu jest podsumowanie najnowszych wyników badań analizujących rolę systemu podatkowego w kolejnych fazach kryzysu zapoczątkowanego w 2008 r. Przeprowadzona w opracowaniu analiza wskazuje, że jego rola ulegała istotnym zmianom: 1) przed wybuchem kryzysu stwarzał bodźce do takich zachowań podmiotów gospodarczych, które przyczyniały się do narastania nierównowagi leżącej u podstaw kryzysu; 2) po jego wybuchu wzrosło znaczenie stabilizacyjne systemu podatkowego: zarówno w obszarze oddziaływania tak zwanych automatycznych stabilizatorów, jak i dyskrecjonalnych zmian obciążeń podatkowych; 3) obecnie zmiany systemu podatkowego zmierzają w kierunku wsparcia procesu konsolidacji fiskalnej oczekiwanej w najbliższych latach w wielu gospodarkach rozwiniętych i w części krajów rozwijających się.

Analiza struktury przestrzennej i czasoprzestrzennej maksymalnych opadów dobowych w Polsce w latach 1956-1980

Jednym z wyników prognoz wykonywanych z zastosowaniem globalnych i regionalnych modeli klimatycznych jest odkrycie wysokiego prawdopodobieństwa wzrostu częstości oraz natężenia ekstremalnych opadów. Poznanie prawidłowości ich powtarzalności i zasięgu przestrzennego ma oczywiście bardzo duże znaczenie gospodarcze i społeczne. Dlatego, niezależnie od wprowadzania nowych technik pomiarowych należy dokonywać analizy i reinterpretacji archiwalnych danych, korzystając z możliwości stwarzanych przez rozwój GIS. Głównym celem opracowania jest analiza prawidłowości przestrzennej i czasowej zmienności miesięcznych oraz rocznych maksymalnych dobowych sum opadów (MSDO) z lat 1956-1980, z obszaru Polski. W pracy wykorzystano nowe w geografii polskiej metody geostatystyczne. Do publikacji dołączono dysk DVD ze źródłową bazą danych i najważniejszymi wynikami w postaci numerycznej i kartograficznej.

Informe final y cuaderno de diseño. Regional Centro Oriente, municipio de Silvania, departamento de Cundinamarca.

61 hojas : ilustraciones.

Informe final y cuaderno de diseño. Regional Centro Oriente, municipio del Guamo departamento Tolima. Asesoría en diseñoen el Oficio de Costura con trenza de palma real

10 hojas : cuadros.

Swarming on optimized graphs for n-way broadcast

In an n-way broadcast application each one of n overlay nodes wants to push its own distinct large data file to all other n-1 destinations as well as download their respective data files. BitTorrent-like swarming protocols are ideal choices for handling such massive data volume transfers. The original BitTorrent targets one-to-many broadcasts of a single file to a very large number of receivers and thus, by necessity, employs an almost random overlay topology. n-way broadcast applications on the other hand, owing to their inherent n-squared nature, are realizable only in small to medium scale networks. In this paper, we show that we can leverage this scale constraint to construct optimized overlay topologies that take into consideration the end-to-end characteristics of the network and as a consequence deliver far superior performance compared to random and myopic (local) approaches. We present the Max-Min and MaxSum peer-selection policies used by individual nodes to select their neighbors. The first one strives to maximize the available bandwidth to the slowest destination, while the second maximizes the aggregate output rate. We design a swarming protocol suitable for n-way broadcast and operate it on top of overlay graphs formed by nodes that employ Max-Min or Max-Sum policies. Using trace-driven simulation and measurements from a PlanetLab prototype implementation, we demonstrate that the performance of swarming on top of our constructed topologies is far superior to the performance of random and myopic overlays. Moreover, we show how to modify our swarming protocol to allow it to accommodate selfish nodes.

On the Complexity of Quantum ACC

For any q > 1, let MOD_q be a quantum gate that determines if the number of 1's in the input is divisible by q. We show that for any q,t > 1, MOD_q is equivalent to MOD_t (up to constant depth). Based on the case q=2, Moore has shown that quantum analogs of AC^(0), ACC[q], and ACC, denoted QAC^(0)_wf, QACC[2], QACC respectively, define the same class of operators, leaving q > 2 as an open question. Our result resolves this question, implying that QAC^(0)_wf = QACC[q] = QACC for all q. We also prove the first upper bounds for QACC in terms of related language classes. We define classes of languages EQACC, NQACC (both for arbitrary complex amplitudes) and BQACC (for rational number amplitudes) and show that they are all contained in TC^(0). To do this, we show that a TC^(0) circuit can keep track of the amplitudes of the state resulting from the application of a QACC operator using a constant width polynomial size tensor sum. In order to accomplish this, we also show that TC^(0) can perform iterated addition and multiplication in certain field extensions.

Robust Sketching and Aggregation of Distributed Data Streams

The data streaming model provides an attractive framework for one-pass summarization of massive data sets at a single observation point. However, in an environment where multiple data streams arrive at a set of distributed observation points, sketches must be computed remotely and then must be aggregated through a hierarchy before queries may be conducted. As a result, many sketch-based methods for the single stream case do not apply directly, as either the error introduced becomes large, or because the methods assume that the streams are non-overlapping. These limitations hinder the application of these techniques to practical problems in network traffic monitoring and aggregation in sensor networks. To address this, we develop a general framework for evaluating and enabling robust computation of duplicate-sensitive aggregate functions (e.g., SUM and QUANTILE), over data produced by distributed sources. We instantiate our approach by augmenting the Count-Min and Quantile-Digest sketches to apply in this distributed setting, and analyze their performance. We conclude with experimental evaluation to validate our analysis.

Implications of Selfish Neighbor Selection in Overlay Networks

In a typical overlay network for routing or content sharing, each node must select a fixed number of immediate overlay neighbors for routing traffic or content queries. A selfish node entering such a network would select neighbors so as to minimize the weighted sum of expected access costs to all its destinations. Previous work on selfish neighbor selection has built intuition with simple models where edges are undirected, access costs are modeled by hop-counts, and nodes have potentially unbounded degrees. However, in practice, important constraints not captured by these models lead to richer games with substantively and fundamentally different outcomes. Our work models neighbor selection as a game involving directed links, constraints on the number of allowed neighbors, and costs reflecting both network latency and node preference. We express a node's "best response" wiring strategy as a k-median problem on asymmetric distance, and use this formulation to obtain pure Nash equilibria. We experimentally examine the properties of such stable wirings on synthetic topologies, as well as on real topologies and maps constructed from PlanetLab and AS-level Internet measurements. Our results indicate that selfish nodes can reap substantial performance benefits when connecting to overlay networks composed of non-selfish nodes. On the other hand, in overlays that are dominated by selfish nodes, the resulting stable wirings are optimized to such great extent that even non-selfish newcomers can extract near-optimal performance through naive wiring strategies.