Search in Publications

Found 6289 publications

Comparison of localization performance of blind and sighted subjects on a virtual audio display and in real-life environments

József Répás György Wersényi

Publication Name: 132nd Audio Engineering Society Convention 2012

Publication Date: 2012-10-22

Volume: Unknown

Issue: Unknown

Page Range: 306-311

Description:

Localization performance of blind subjects was measured in a virtual audio environment using non-individualized but customized HRTFs. Results were compared with former results of sighted users using the same measurement setup. Furthermore, orientation and navigation tasks in a real-life outdoor environment were performed in order to compare localization ability of sighted and visually impaired including "walking straight" tasks with and without acoustic feedback and test runs using the white cane as an acoustic tool during navigation.

Open Access: Yes

DOI: DOI not available

Alternating least squares for personalized ranking

Gabor Takacs Domonkos Tikk

Publication Name: Recsys 12 Proceedings of the 6th ACM Conference on Recommender Systems

Publication Date: 2012-10-17

Volume: Unknown

Issue: Unknown

Page Range: 83-90

Description:

Two avors of the recommendation problem are the explicit and the implicit feedback settings. In the explicit feedback case, users rate items and the user item preference relationship can be modelled on the basis of the ratings. In the harder but more common implicit feedback case, the system has to infer user preferences from indirect information: presence or absence of events, such as a user viewed an item. One approach for handling implicit feedback is to minimize a ranking objective function instead of the conventional prediction mean squared error. The naive minimization of a ranking objective function is typically expensive. This difficulty is usually overcome by a trade-off: sacrificing the accuracy to some extent for computational efficiency by sampling the objective function. In this paper, we present a computationally effective approach for the direct minimization of a ranking objective function, without sampling. We demonstrate by experiments on the Y!Music and Netix data sets that the proposed method outperforms other implicit feedback recommenders in many cases in terms of the ErrorRate, ARP and Recall evaluation metrics. Copyright © 2012 by the Association for Computing Machinery, Inc. (ACM).

Open Access: Yes

DOI: 10.1145/2365952.2365972

Creating and using key network-performance indicators to support the design of change of enterprise infocommunication infrastructure

No authors available

Publication Name: Proceedings of the 2012 International Symposium on Performance Evaluation of Computer and Telecommunication Systems, SPECTS'12 - Part of SummerSim 2012 Multiconference

Publication Date: 2012-10-08

Volume:

Issue:

Page Range: Unknown

Description:

Nowadays, an increasing number of organisations have to make decisions about the change and optimization of their enterprise infocommunication infrastructure. The usual approach of performance (using QoS, SLA) is not user (enterprise) centred and complex enough to help ICT (Information and Communication Technology) experts to support management decisions. © 2012 Society for Modeling & Sim.

Open Access: No

DOI: DOI not available

Creating and using key network-performance indicators to support the design of change of enterprise infocommunication infrastructure

László Muka Gergely Muka

Publication Name: Proceedings of the 2012 International Symposium on Performance Evaluation of Computer and Telecommunication Systems Spects 12 Part of Summersim 2012 Multiconference

Publication Date: 2012-10-08

Volume: Unknown

Issue: Unknown

Page Range: Unknown

Description:

Nowadays, an increasing number of organisations have to make decisions about the change and optimization of their enterprise infocommunication infrastructure. The usual approach of performance (using QoS, SLA) is not user (enterprise) centred and complex enough to help ICT (Information and Communication Technology) experts to support management decisions. © 2012 Society for Modeling & Sim.

Open Access: Yes

DOI: DOI not available

Hybrid Bacterial Iterated Greedy heuristics for the Permutation Flow Shop Problem

Krisztián Balázs László T. Kóczy Zoltán Horváth

Publication Name: 2012 IEEE Congress on Evolutionary Computation CEC 2012

Publication Date: 2012-10-04

Volume: Unknown

Issue: Unknown

Page Range: Unknown

Description:

This paper proposes approaches for combining the Iterated Greedy (IG) technique, as a presently state-of-the-art method, with a recently proposed adapted version of the Bacterial Evolutionary Algorithm (BEA) in order to efficiently solve the Permutation Flow Shop Problem. The obtained techniques are evaluated via simulation runs carried out on the well-known Taillard's benchmark problem set. Based on the experimental results the hybrid methods are compared to each other and to the original techniques (i.e. to the original IG and BEA algorithms). © 2012 IEEE.

Open Access: Yes

DOI: 10.1109/CEC.2012.6256167

Bacterial memetic algorithm for simultaneous optimization of path planning and flow shop scheduling problems

János Botzheim Yuichiro Toda Naoyuki Kubota

Publication Name: Artificial Life and Robotics

Publication Date: 2012-10-01

Volume: 17

Issue: 1

Page Range: 107-112

Description:

The paper deals with simultaneous optimization of path planning of mobile robots and flow shop scheduling problem. The goal of the path planning problem is to determine an optimal collision-free path between a start and a target point for a mobile robot in an environment surrounded by obstacles. The objective is to minimize the path length without colliding with an obstacle. On the other hand, shop scheduling problems deal with processing a given set of jobs on a given number of machines. Each operation has an associated machine on which it has to be processed for a given length of time. The problem is to minimize the overall time demand of the whole process. In this paper, we deal with two robots carrying items between the machines. Bacterial memetic algorithm is proposed for solving this combined problem. The algorithm is verified by experimental simulations and compared to classical techniques.

Open Access: Yes

DOI: 10.1007/s10015-012-0021-9

Forecasting of travel demand in urban public transport

Balázs Horváth

Publication Name: Ines 2012 IEEE 16th International Conference on Intelligent Engineering Systems Proceedings

Publication Date: 2012-10-01

Volume: Unknown

Issue: Unknown

Page Range: 317-321

Description:

The key of the planning of public transport systems is the accurate prediction of the traffic load, or the correct execution of the planning stage assignment. This requires not only a well-functioning assignment method, but also reliable passenger data. Reliable passenger data means time-dependent origin-destination matrix. To solve the problem of lack of time-dependent passenger data we have developed a forecasting method. It consists of three stages. In the first stage we collect full scope cross-section data. This can be done either with personnel or an automatic counting system. If personnel are used it costs a lot and there are many possible errors. However the results in most cases are good enough. Automatic counting system can be either a counter machine or even a simple "Check in" E-ticketing system. In the second stage, we link boarding and alighting. As result we get the origin-destination matrix for each run. This method is based on the likelihood of alighting at a given stop. In the third stage, we combine origin-destination matrices of the runs through transfers. At this stage we assume that the probability of a transfer between two runs in a given stop is proportional to the travel possibilities in this relation. To view the entire method in the practice we proved it in a Hungarian cities. The results were reliable, so they could be use in the planning process. © 2012 IEEE.

Open Access: Yes

DOI: 10.1109/INES.2012.6249851

Test calculation for logic and short-circuit faults in digital circuits

Jozsef Sziray

Publication Name: Ines 2012 IEEE 16th International Conference on Intelligent Engineering Systems Proceedings

Publication Date: 2012-10-01

Volume: Unknown

Issue: Unknown

Page Range: 121-124

Description:

In the first part, the paper presents a test calculation principle which serves for producing tests of logic faults in digital circuits. The name of the principle is composite justification. The considered fault model includes stuck-at-0/1 logic faults. Both single and multiple faults are included. In this paper only combinational logic is taken into consideration. The computations are performed at the gate level. In the second part of the paper, the composite justification is extended to an other fault class, namely, short-circuit faults. A short circuit is an erroneous galvanic coupling between two circuit lines. The calculation principle is comparatively simple. It is based only on successive line-value justification, and it yields an opportunity to be realized by an efficient computer program. © 2012 IEEE.

Open Access: Yes

DOI: 10.1109/INES.2012.6249815

Event driven software modeling of combinational logic network based control programs

József Kopják Janos Kovacs

Publication Name: Ines 2012 IEEE 16th International Conference on Intelligent Engineering Systems Proceedings

Publication Date: 2012-10-01

Volume: Unknown

Issue: Unknown

Page Range: 253-257

Description:

Event driven program model is very good tool to write discrete control programs based on sequential logic, but to create combinational logic based controls is more problematic. The paper presents one implementation of event driven software model of combination logic networks. The paper first reviews the basics of event-driven systems. Greater part of article presents the mathematical basic and architecture of event-driven combinational logic and one software implementation of the model. The paper ends with description of event-driven universal software gate. © 2012 IEEE.

Open Access: Yes

DOI: 10.1109/INES.2012.6249840