ppxscal/embedding_network huggingface dataset:
Experiments on cryptanalysing block ciphers via evolutionary computation paradigms
Authors: N. Nalini, G. Raghavendra Rao
Venue: Proceedings of the 7th WSEAS International Conference on Evolutionary Computing (2006)

Evolutionary computation techniques have been effectively used to solve a number of optimisation problems. Cryptanalysis of ciphers has been attempted through several methods such as brute force attack, linear and differential cryptanalysis and heuristic-based approaches. Most papers in the literature use heuristic search to classical ciphers such as simple substitution or transposition ciphers. To demonstrate the power of evolutionary techniques for attacks of modern-day ciphers, we report for the first time systematic experiments on heuristic-based attacks of Simplified Data Encryption Standard (SDES) and Modified version of Data Encryption Standard (DES) and present our conclusions. Though these are simpler ciphers, they contain the significant building blocks and features present in other complex ciphers. Thus the studies reported in this paper will be useful for the heuristic attack of other similar ciphers.
Link-adaptive distributed coding for multisource cooperation
Authors: Alfonso Cano, Tairan Wang, Alejandro Ribeiro, Georgios B. Giannakis
Venue: EURASIP Journal on Advances in Signal Processing (2008)

Combining multisource cooperation and link-adaptive regenerative techniques, a novel protocol is developed capable of achieving diversity order up to the number of cooperating users and large coding gains. The approach relies on a two-phase protocol. In Phase 1, cooperating sources exchange information-bearing blocks, while in Phase 2, they transmit reencoded versions of the original blocks. Different from existing approaches, participation in the second phase does not require correct decoding of Phase 1 packets. This allows relaying of soft information to the destination, thus increasing coding gains while retaining diversity properties. For any reencoding function the diversity order is expressed as a function of the rank properties of the distributed coding strategy employed. This result is analogous to the diversity properties of colocated multi-antenna systems. Particular cases include repetition coding, distributed complex field coding (DCFC), distributed space-time coding, and distributed error-control coding. Rate, diversity, complexity, and synchronization issues are elaborated. DCFC emerges as an attractive choice because it offers high-rate, full spatial diversity, and relaxed synchronization requirements. Simulations confirm analytically established assessments.
An enhanced pitch modeling supporting a Greek text to speech system
Authors: Ilias Spais, George Bafas, Xenofon Papadopoulos
Venue: Proceedings of the 4th WSEAS International Conference on Signal Processing, Computational Geometry & Artificial Vision (2004)

This paper tries to describe as accurately as possible an enhanced procedure for predicting the appropriate prosodic structure of speech and apply it to a Greek Text to Speech system. The main focus will be a particular linear stylization of the fundamental frequency function F0 contour (pitch), by using the most important syntactic, grammatical and lexical features of the Greek language. Finally, we present an evaluation on the results of plugging the pitch model into the system.
Cellular neural network-based object recognition with deformable grids
Authors: Piotr Korbel, Krzysztof Slot
Venue: Machine Graphics Vision International Journal (2006)

The following paper presents an idea for a parallel implementation of the deformable grid paradigm within the framework of Cellular Neural Networks. Parallel processing may alleviate the problem of high complexity of deformable template matching and significantly speed up object recognition tasks. The paper presents details of a CNN-based implementation of the basic element of the deformable grid-based image processing, which is image-grid matching. Estimated execution speed of the CNN-based method and recognition rates achieved in the experiments make the method an attractive framework for applications such as high-speed coarse object classification.
Query evaluation with soft-key constraints
Authors: Abhay Jha, Vibhor Rastogi, Dan Suciu
Venue: Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2008)

Key Violations often occur in real-life datasets, especially in those integrated from different sources. Enforcing constraints strictly on these datasets is not feasible. In this paper we formalize the notion of soft-key constraints on probabilistic databases, which allow for violation of key constraint by penalizing every violating world by a quantity proportional to the violation. To represent our probabilistic database with constraints, we define a class of markov networks, where we can do query evaluation in PTIME. We also study the evaluation of conjunctive queries on relations with soft keys and present a dichotomy that separates this set into those in PTIME and the rest which are #P-Hard.
Letter to the Editor: A note on preconditioned AOR method for L-matrices
Authors: Jae Heon Yun
Venue: Journal of Computational and Applied Mathematics (2008)

In this note, some errors in a recent article by Li et al. (Improvements of preconditioned AOR iterative methods for L-matrices, J. Comput. Appl. Math. 206 (2007) 656-665) are pointed out and some correct results are presented.
Organizational Adoption of XBRL
Authors: Bill Doolin, Indrit Troshani
Venue: Electronic Markets (2007)

XBRL is an emerging innovation that has the potential to play an important role in the electronic production and consumption of financial information. Since the organizational adoption of XBRL is not well understood, we use an exploratory approach grounded in qualitative data to provide an analysis of the reasons for its relatively limited uptake in Australia. Our analysis synthesises a technology-organization-environment adoption model that explains the XBRL innovation outcome in this context. The research confirms the usefulness of this approach for studying network innovations in electronic business and markets, and extends it to a novel innovation domain. It adds a new dimension to such studies by emphasizing the interactions that occur between innovation adoption factors in the diffusion of complex network innovations. The research also has implications for policy-makers and adoption decision-makers in Australia and other similar contexts.
Review: Coverage and connectivity issues in wireless sensor networks: A survey
Authors: Amitabha Ghosh, Sajal K. Das
Venue: Pervasive and Mobile Computing (2008)

Sensing coverage and network connectivity are two of the most fundamental problems in wireless sensor networks. Finding an optimal node deployment strategy that would minimize cost, reduce computation and communication overhead, be resilient to node failures, and provide a high degree of coverage with network connectivity is extremely challenging. Coverage and connectivity together can be treated as a measure of quality of service in a sensor network; it tells us how well each point in the region is covered and how accurate is the information gathered by the nodes. Therefore, maximizing coverage as well as maintaining network connectivity using the resource constrained nodes is a non-trivial problem. In this survey article, we present and compare several state-of-the-art algorithms and techniques that aim to address this coverage-connectivity issue.
Associating Faces and Names in Japanese Photo News Articles on the Web
Authors: Akio Kitahara, Taichi Joutou, Keiji Yanai
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

We propose a system which extracts faces and person names from news articles with photos on the Web and associates them automatically. The system detects face images in news photos with a face detector and extracts person names from news text with a morphological analyzer. In addition, the bag-of-keypoints technique is applied to the extracted face images for filtering out non-face images. The system uses the eigenface representation as image features of the extracted faces, and associates them with the extracted names by the modified k-means clustering in the eigenface subspace. In the experiment, we obtained the 66% precision rate regarding association of faces and names.
A quantitative evaluation of the MeshTest wireless testbed
Authors: Brenton Walker, Charles Clancy
Venue: Proceedings of the 4th International Conference on Testbeds and research infrastructures for the development of networks & communities (2008)

The MeshTest testbed is designed to subject wireless devices and protocols to realistic and repeatable mobile scenarios, including multi-hop and disconnected topologies. The testbed makes it possible to efficiently test real implementations of ad-hoc and delay-tolerant routing protocols. With the completion of its mobility control software, the testbed has recently become operational for mobile scenarios. In this paper we report on some of the challenges encountered in building the testbed and implementing the control software, switch calibration, and some basic testbed results. We compare the basic results achieved on the testbed to results from live tests with comparable real systems. Since we first introduced plans for the MeshTest testbed, multiple researchers have expressed an interest in building similar setups. Therefore we believe it is valuable to share our experiences and lessons learned so far in bringing this testbed into operation.
Effect of number of faults on NoC power and performance
Authors: M. H. Ghadiry, M. Nadi, M. T. Manzuri-Shalmani, D. Rahmati
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01 (2007)

According to International Technology Roadmap for Semiconductors (ITRS), before the end of this decade, we will be entering the era of a billion transistors on a single chip. The major threat toward the achievement of billion transistor on a chip is poor scalability of current interconnect infrastructure. With the advent of &#x201C;Network on Chip (NoC)&#x201D; various characters and methodologies of traditional networks were hardly considered on-chip. Failure, Power and Area are the major concepts that should be considered when migrating from traditional interconnection networks to NoCs. In this paper we study the effects of faulty links and nodes on power and performance of mesh based NoC, Also several routing algorithms have been implemented and simulated using a cycle accurate VHDL model of NoC1.
A novel design of the sample holder for broadband complex permittivity measurements
Authors: Roman Tkadlec, Zbynek Raida, Mikko Keskilammi, Lauri Kettunen
Venue: Proceedings of the 4th WSEAS International Conference on Applied Informatics and Communications (2004)

The paper provides a novel design of the sample holder for the complex permittivity determination of nonmagnetic linear dielectric materials by measuring reflection and transmission coefficients. The sample holder is made of the common N connector female-female adapter. The design described is very simple and compact. Especially the price of our design is much cheaper than price for commonly used airline coaxial waveguide from verification kit with comparative measurement accuracy. Several plastics in the frequency range from 0.4 GHz up to 18 GHz were measured and reached results are presented and discussed.
An Improved Method Based on Maximal Clique for Predicting Interactions in Protein Interaction Networks
Authors: Jianxin Wang, Zhao Cai, Min Li
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

The datasets identified by large-scale, high-throughput methods typically suffer from a relatively high level of noise. Combining the distribution characteristics of noise data and topological properties in the protein interaction network, we described a novel method to improve the reliability of those datasets by predicting missed interactions. The main idea of the method is to predict the interactions among proteins based on the degree of correlation between protein and protein clique, and improve prediction reliability by percolating most amplified noise data. We have applied this approach to some high-throughput datasets. The experimental results show that this method can not only predict more but also higher reliable interactions than the prediction method proposed by Haiyuan Yu in 2006.
Now what was that password again? A more flexible way of identifying and authenticating our seniors
Authors: Karen Renaud, Judith Ramsay
Venue: Behaviour & Information Technology (2007)

The Web offers facilities which can make a huge difference to the lives of users with reduced mobility, something that affects many older users. Users have to be authorized to access restricted websites. This involves a two-step process: identification and authentication. These issues have received scant attention when considering the needs of specific user groups. Web identification and authentication is often treated as a one-size-fits-all problem with ubiquitous use of the password as an authenticator and a variety of different identification mechanisms being used. Neither is tailored to the needs of either the website or the target users. This paper discusses problems related to identification and authentication of older web users, and reports on experiences with field tests of initial solutions.
Computational Complexity: A Conceptual Perspective, 1 edition
Authors: Oded Goldreich
Venue:  (2008)

This book offers a comprehensive perspective to modern topics in complexity theory, which is a central field of the theoretical foundations of computer science. It addresses the looming question of what can be achieved within a limited amount of time with or without other limited natural computational resources. Can be used as an introduction for advanced undergraduate and graduate students as either a textbook or for self-study, or to experts, since it provides expositions of the various sub-areas of complexity theory such as hardness amplification, pseudorandomness and probabilistic proof systems.
An Integrated Simulation Environment for the Investigation of Future THz Communication Systems: Extended Version
Authors: Thomas Kürner, Martin Jacob, Radoslaw Piesiewicz, Joerg Schoebel
Venue: Simulation (2008)

The first stages of developing indoor communication systems operating at frequencies beyond 300 GHz are currently undeway. In this paper, an integrated simulation environment is introduced, where the system parameters of future THz communication systems can be estimated under realistic hardware and propagation conditions. It is shown how this simulation environment can be used to determine the most critical parameters in the whole system and may be used to derive requirements for the development of hardware components. Exemplary simulation results, taking into account various factors of influence (different modulation schemes, antenna gains and wall materials), are presented.
Real time vibration cancellation in magnetic bearing systems
Authors: Esref Turker, Lijiang Qin, Alan Harvey
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

A new approach of vibration cancellation in magnetic bearing systems is presented. It is a feed-forward controller approach. The problem is formulated by designing an adaptive filter type of FIR filter. The reason behind employing the FIR filters is that they are inherently stable due to their structure. The FIR filters use forward paths only. A Recursive Least Square algorithm is used for updating filter coefficients. The experimental results show that the proposed method is effective for vibration cancellation in magnetic bearing systems.
Model analysis for business event processing
Authors: L. Zeng, H. Lei, T. Koyanagi, H. Onsaki, H. Chang
Venue: IBM Systems Journal (2007)

Business event processing requires efficiently processing live events, computing business performance metrics, detecting business situations, and providing real-time visibility of key performance indicators. Given the high volume of events and significant complexity of computation, system performance--event throughput--is critical. In this paper, we advocate model-analysis techniques to improve event throughput. In the build time, a series of model analyses of the application logic are conducted to understand such factors as runtime data-access path, data flow, and control flow. Such analyses can be used to improve throughput three ways: at build time it can be used to facilitate the generation of customized code to optimize I/O and CPU usage; information about the control flow and data flow can be used to ensure that CPU resources are used effectively by distributing event-processing computation logic evenly over time; and at runtime, knowledge gained from the model can be used to plan multithreaded parallel event-processing execution to reduce wait states by maximizing parallelization and reducing the planning overhead. This paper presents a series of model-analysis techniques and the results of experiments that demonstrate their effectiveness.
The reconfigurable instruction cell array
Authors: Sami Khawam, Ioannis Nousias, Mark Milward, Ying Yi, Mark Muir, Tughrul Arslan
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2008)

This paper presents a novel instruction cell-based re-configurable computing architecture for low-power applications, thereafter referred to as the reconfigurable instruction cell array (RICA). For the development of the RICA, a top-down software driven approach was taken and revealed as one of the key design decisions for a flexible, easy to program, low-power architecture. These features make RICA an architecture that inherently solves the main design requirements of modern low-power devices. Results show that it delivers considerably less power consumption when compared to leading VLIW and low-power digital signal processors, but still maintaining their throughput performance.
Randomized simplex algorithms on Klee-Minty cubes
Authors: B. Gartner
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

We investigate the behavior of randomized simplex algorithms on special linear programs. For this, we develop combinatorial models for the Klee-Minty cubes (1972) and similar linear programs with exponential decreasing paths. The analysis of two most natural randomized pivot rules on the Klee-Minty cubes leads to (nearly) quadratic lower bounds for the complexity of linear programming with random pivots. Thus we disprove two bounds conjectured in the literature. At the same lime, we establish quadratic upper bounds for random pivots on the linear programs under investigation. This motivates the question whether some randomized pivot rules possibly have quadratic worst-case behavior on general linear programs.
MRBAC: Hierarchical Role Management and Security Access Control for Distributed Multimedia Systems
Authors: Na Zhao, Min Chen, Shu-Ching Chen, Mei-Ling Shyu
Venue: Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing (2008)

In this paper, a Role-based Access Control (RBAC) model is applied and extended to a multimedia version called Multi-Role Based Access Control (MRBAC), which can fully support the comprehensive and multi-level security control requirements of the distributed multimedia applications. The object-oriented concept is adopted in MRBAC to perform the hybrid role hierarchy management and security roles and rules administration. In summary, MRBAC can: 1) support the multi-level security protection for multimedia data; 2) provide access control by checking both the time constrains and IP addresses; and 3) decentralize the administration functions to make the access control management more efficient.
Learning the structure of dynamic Bayesian networks from time series and steady state measurements
Authors: Harri Lähdesmäki, Ilya Shmulevich
Venue: Machine Learning (2008)

Dynamic Bayesian networks (DBN) are a class of graphical models that has become a standard tool for modeling various stochastic time-varying phenomena. In many applications, the primary goal is to infer the network structure from measurement data. Several efficient learning methods have been introduced for the inference of DBNs from time series measurements. Sometimes, however, it is either impossible or impractical to collect time series data, in which case, a common practice is to model the non-time series observations using static Bayesian networks (BN). Such an approach is obviously sub-optimal if the goal is to gain insight into the underlying dynamical model. Here, we introduce Bayesian methods for the inference of DBNs from steady state measurements. We also consider learning the structure of DBNs from a combination of time series and steady state measurements. We introduce two different methods: one that is based on an approximation and another one that provides exact computation. Simulation results demonstrate that dynamic network structures can be learned to an extent from steady state measurements alone and that inference from a combination of steady state and time series data has the potential to improve learning performance relative to the inference from time series data alone.
Histopolating splines
Authors: Ralf Siewer
Venue: Journal of Computational and Applied Mathematics (2008)

Given an integrable function f, we are concerned with the construction of a spline H"n(f) of degree =
Scheduling Asymmetric Parallelism on a PlayStation3 Cluster
Authors: Filip Blagojevic, Matthew Curtis-Maury, Jae-Seung Yeom, Scott Schneider, Dimitrios S. Nikolopoulos
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

Understanding the potential and implications of asymmetric multi-core processors for cluster computing is necessary, as these processors are rapidly becoming mainstream components in HPC environments. In this paper we evaluate a Linux cluster of Sony PlayStation3 consoles, using microbenchmarks and bioinformatics applications. We proceed to develop a model and scheduling techniques for effective execution of parallel applications on this low-cost, yet unconventional HPC platform based on the Cell/BE processor. We present an analytical formulation of layered parallelism for clusters of asymmetric multi-core multi-processors and propose new co-scheduling heuristics for effectively executing MPI code with nested task and data parallelism on these systems. Our model has low execution time prediction error and is reliable in predicting optimal mappings of nested parallelism in MPI programs on the PS3 cluster. The presented co-scheduling heuristics reduce slack time on the accelerator cores of the PS3 and improve the performance of MPI applications by 1.7-2.7 times, when compared against the native OS scheduler.
Understanding BitTorrent Download Performance
Authors: Dongliang Guan, Jiangtao Wang, Yue Zhang, Jun Dong
Venue: Proceedings of the Seventh International Conference on Networking (2008)

We conducted in this paper an experimental study on BitTorrent (BT) download performance. Although BT has been widely deployed, many important features about it are not clear yet. For example, what parameter configuration is Optimal for its download performance and to what extent is its incentive mechanism efficient in preventing free-riding. We focused our study on two aspects in this paper: the impact of maximum concurrent upload number on download speed; the efficiency of BT's incentive mechanism on fairness and download performance in the face of free-riders. Our results reveal that there is not an uniform value for the optimal maximum concurrent upload number, and that BT's incentive mechanism is robust to free-riders at a large scale, however seed's upload capacity should be good engineered and BT's incentive mechanism deserve to beimproved in some aspects, e.g., optimistic unchoke.