Journal of
Systemics, Cybernetics and Informatics
 



ISSN: 1690-4524 (Online)


Indexed by
EBSCO, Cabell, DOAJ (Directory of Open Access Journals)Benefits of supplying DOAJ with metadata:
  • DOAJ's statistics show more than 900 000 page views and 300 000 unique visitors a month to DOAJ from all over the world.
  • Many aggregators, databases, libraries, publishers and search portals collect our free metadata and include it in their products. Examples are Scopus, Serial Solutions and EBSCO.
  • DOAJ is OAI compliant and once an article is in DOAJ, it is automatically harvestable.
  • DOAJ is OpenURL compliant and once an article is in DOAJ, it is automatically linkable.
  • Over 95% of the DOAJ Publisher community said that DOAJ is important for increasing their journal's visibility.
  • DOAJ is often cited as a source of quality, open access journals in research and scholarly publishing circles.
JSCI Supplies DOAJ with Meta Data
, Academic Journals Database, and Google Scholar


Listed in
Cabell Directory of Publishing Opportunities and in Ulrich’s Periodical Directory


Re-Published in
Academia.edu
(A Community of about 40.000.000 Academics)


Honorary Editorial Advisory Board's Chair
William Lesso (1931-2015)

Editor-in-Chief
Nagib C. Callaos


Sponsored by
The International Institute of
Informatics and Systemics

www.iiis.org
 

Editorial Advisory Board

Editors

Journal's Reviewers
 

Description and Aims

Submission of Articles

Areas and Subareas

Information to Contributors

Editorial Peer Review Methodology

Integrating Reviewing Processes


Detection of Minimal Set of Trips Causing the Necessity to Use Extra Vehicle for Vehicle Scheduling Problem
Katerina Pastircáková, Jaromír Šulc
(pages: 1-4)

Key Factors in the Success of Self - Directed Learning of Military Personnel - Taking Smartphone as an Example
Yen-Hsi Lo, Yen-Fen Lo, Po-Yun Chiang, Jung Hsiao
(pages: 5-8)

Machine Learning Based IP Network Traffic Classification Using Feature Significance Analysis
Te-Shun Chou, John Pickard, Ciprian Popoviciu
(pages: 9-12)

The Information System for US Stock Market: Fundamental and Technical Analysis
Sergejs Hilkevics, Galina Hilkevica
(pages: 13-24)

The Impact of Environmental and Social Performance on the Market Value of Shares of Czech Joint-Stock Corporations
Alena Kocmanova, Marie Pavlakova Docekalova, Iveta Simberova
(pages: 25-31)

Play the Game! Analogue Gamification for Raising Information Security Awareness (Invited Paper)
Margit Scholl
(pages: 32-35)

Using Informatics and Technology Practices for Academic Performance Review
Kim Moorning
(pages: 36-41)

Multiple Research Perspectives as a Paradigm to Co-Create Meaningful Real-life Experiences
Jan Detand, Marina Emmanouil
(pages: 42-46)

A Methodology to Integrate Regulatory Expertise, Research and Education to Accelerate Biomedical Device Translation
Diana Easton
(pages: 47-52)

Active Learning through Smart Grid Model Site in Challenge Based Learning Course
Ellen A. Kalinga, Kwame S. Ibwe, Nerey H. Mvungi, Hannu Tenhunen
(pages: 53-64)

Non-Linear Static Analysis of Masonry Buildings under Seismic Actions
Maria Luisa Beconcini, Paolo Cioni, Pietro Croce, Paolo Formichi, Filippo Landi, Caterina Mochi
(pages: 65-70)

Toward an Engaging Hands-on Environment for a Beginning Networking and Security Class
Lopamudra Roychoudhuri
(pages: 71-76)

Designing Representations, Affecting Reality: A Meta-Model Proposal to Address the Question of Design Epistemology from the Perspective of Cognitive Science
Andrea Zammataro
(pages: 77-80)

Dielectrophoretic Movement of Cell around Surface Electrodes in Flow Channel
Yusuke Takahashi, Shigehiro Hashimoto, Manabu Watanabe
(pages: 81-87)


 

Abstracts

 


ABSTRACT


An Ad Hoc Adaptive Hashing Technique forNon-Uniformly Distributed IP Address Lookup in Computer Networks

Christopher Martinez, Wei-Ming Lin


Hashing algorithms long have been widely adopted to design a fast address look-up process which involves a search through a large database to find a record associated with a given key. Hashing algorithms involve transforming a key inside each target data to a hash value hoping that the hashing would render the database a uniform distribution with respect to this new hash value. The close the final distribution is to uniform, the less search time would be required when a query is made. When the database is already key-wise uniformly distributed, any regular hashing algorithm, such as bit-extraction, bit-group XOR, etc., would easily lead to a statistically perfect uniform distribution after the hashing. On the other hand, if records in the database are instead not uniformly distributed as in almost all known practical applications, then even different regular hash functions would lead to very different performance. When the target database has a key with a highly skewed distributed value, performance delivered by regular hashing algorithms usually becomes far from desirable. This paper aims at designing a hashing algorithm to achieve the highest probability in leading to a uniformly distributed hash result from a non-uniformly distributed database. An analytical pre-process on the original database is first performed to extract critical information that would significantly benefit the design of a better hashing algorithm. This process includes sorting on the bits of the key to prioritize the use of them in the XOR hashing sequence, or in simple bit extraction, or even a combination of both. Such an ad hoc hash design is critical to adapting to all real-time situations when there exists a changing (and/or expanding) database with an irregular non-uniform distribution. Significant improvement from simulation results is obtained in randomly generated data as well as real data.

Full Text