Search results for "ComputerSystemsOrganization_MISCELLANEOUS"
showing 10 items of 56 documents
Naturalistic driving study on the usage of smart phone applications while driving
2017
We present the first results from a study that tracked how Finnish drivers use their smart phones while driving. We monitored 30 heavy-user drivers in Finland in June-September 2016, and recorded the times when they used their phones, the application used at the time of touch, and the location and speed of the car. Touches were used as a proxy for estimating visual distraction due to visual-manual tasks. Our data set allows us to determine whether drivers use their phones differently on different road types (highway, main road, local rural road, urban road). We found that the road type has very little effect on phone use. The drivers produced more touches per hour on urban roads but the ins…
Informācijas tehnoloģijas nozares tiesību un standartu pamati
2005
Fundamentals of laws and standards in information and communication technology sector are presented.
Technoscientific Citizenship in Citizen Science. Assembling Crowds for Biomedical Research
2020
This chapter explores “citizen science” as a contemporary variant of participatory citizenship. It analyzes how two biomedical online citizen science projects address potential participants. What does it mean to enact citizenship in these citizen science projects according to the self-descriptions of the projects? How do their web interfaces regulate participation?
A Rule-Based Multi-agent System for Local Traffic Management
2009
Road Traffic presents a high dynamism which makes necessary the development of traffic management and control strategies to improve traffic flows and more important, road safety. So it is needed the use of intelligent systems to support traffic organizations and road operators to cope with incidents. In this paper we introduce a local autonomous system for traffic management. This way, though there could be a breakdown in the communications between the local system and the TCC, the local system will be able to warn the road users in case of incidents. The system uses multiagent technology to work with the specific characteristics of traffic domain. The expert MAS system is ruled-based that …
Span-Program-Based Quantum Algorithms for Graph Bipartiteness and Connectivity
2016
Span program is a linear-algebraic model of computation which can be used to design quantum algorithms. For any Boolean function there exists a span program that leads to a quantum algorithm with optimal quantum query complexity. In general, finding such span programs is not an easy task. In this work, given a query access to the adjacency matrix of a simple graph G with n vertices, we provide two new span-program-based quantum algorithms:an algorithm for testing if the graph is bipartite that uses $$On\sqrt{n}$$ quantum queries;an algorithm for testing if the graph is connected that uses $$On\sqrt{n}$$ quantum queries.
New Developments in Quantum Algorithms
2010
In this survey, we describe two recent developments in quantum algorithms. The first new development is a quantum algorithm for evaluating a Boolean formula consisting of AND and OR gates of size N in time O(\sqrt{N}). This provides quantum speedups for any problem that can be expressed via Boolean formulas. This result can be also extended to span problems, a generalization of Boolean formulas. This provides an optimal quantum algorithm for any Boolean function in the black-box query model. The second new development is a quantum algorithm for solving systems of linear equations. In contrast with traditional algorithms that run in time O(N^{2.37...}) where N is the size of the system, the …
Quantum Random Walks – New Method for Designing Quantum Algorithms
2008
Quantum walks are quantum counterparts of random walks. In the last 5 years, they have become one of main methods of designing quantum algorithms. Quantum walk based algorithms include element distinctness, spatial search, quantum speedup of Markov chains, evaluation of Boolean formulas and search on "glued trees" graph. In this talk, I will describe the quantum walk method for designing search algorithms and show several of its applications.
Smart cities approach for Colombian Context. Learning from ITS experiences and linking with government organization
2015
The forecast (world bank) related to the growth of world population tends to be around 9000 million to 2050 and most of the people will live in the cities or in conurbations, this means that, a new approach for support the development of the cities needs to be analyzed. Currently, the mankind has developed and produce a lot of technology advances and many of them are related to the Information and communications technology (ICT). In this way, ICT has become in a key element for the development of the cities, even, introduce the ICT concept in the context of the cities has provoked a new scope for the cities that is called Smart City or Digital City. In this paper, it is presented an approac…
Hand-Held texting is less distracting than texting with the phone in a holder: anyway, don't do it
2015
We studied the effects of texting while driving and the effects of mobile phone position (hand-held, holder) on drivers' lane-keeping performance, experienced workload, and in-car glance durations in a motion-platform driving simulator with 24 participants. Overall, we found the known negative effects of texting on lane-keeping performance, workload, and visual attention on road, suggesting that texting on the road in any manner is not risk-free. As a novel finding, we found that hand-held texting led to fewer lane-keeping errors and shorter total glance times off road compared to texting with the phone in a holder. We suggest the explanation is that the drivers had considerably more experi…
Quantum autoencoders via quantum adders with genetic algorithms
2017
The quantum autoencoder is a recent paradigm in the field of quantum machine learning, which may enable an enhanced use of resources in quantum technologies. To this end, quantum neural networks with less nodes in the inner than in the outer layers were considered. Here, we propose a useful connection between quantum autoencoders and quantum adders, which approximately add two unknown quantum states supported in different quantum systems. Specifically, this link allows us to employ optimized approximate quantum adders, obtained with genetic algorithms, for the implementation of quantum autoencoders for a variety of initial states. Furthermore, we can also directly optimize the quantum autoe…