ppxscal/embedding_network huggingface dataset:
On the Performance of Parallel Neural Network Implementations on Distributed Memory Architectures
Authors: K. Ganeshamoorthy, D. N. Ranasinghe
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

In this paper, we study the impact of multi processor memory systems in particular, the distributed memory (DM) and virtual shared memory (VSM), on the implementation of parallel back propagation neural network algorithms. In the first instance, neural network is partitioned into sub neural networks by applying a hybrid partitioning scheme. In the second, each partitioned network is evaluated with matrix multiplication. Three different sizes of neural networks are used and exchange rate prediction used as a reference problem. Parallel implementations for each ofthe distributed memory and virtual shared memory scenarios is obtained. These algorithms are implemented on a high performance cluster, "Monolith" consisting of over 396 nodes. Programming is realized using Message Passing Interface (MPI) library and C-Linda. The partitioned, matrix multiplication has the fastest execution time, and DM/MPI implementation is always faster than the VSM/Linda equivalent. However in VSM/Linda it is possible to allow the parallel neural network to choose the optimum number ofprocessors dynamically.
Detecting Key Players in 11-M Terrorist Network: A Case Study
Authors: Nasrullah Memon, David L. Hicks
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

This article focuses on the study and development of recently introduced new measures, theories, mathematical models and algorithms to detect key players in March 11 Madrid train bombing terrorist network. Specific models and tools are described, and applied to a case study to demonstrate their applicability to the area. We are confident that the models described can help intelligence agencies in understanding and splitting terrorist networks.
Secure Steganography in Compressed Video Bitstreams
Authors: Bin Liu, Fenlin Liu, Chunfang Yang, Yifeng Sun
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

A new compressed video secure steganography (CVSS) algorithm is proposed. In the algorithm, embedding and detection operations are both executed entirely in the compressed domain, with no need for the decompression process. The new criteria employing statistical invisibility of contiguous frames is used to adjust the embedding strategy and capacity, which increases the security of proposed algorithm. Therefore, the collusion resistant properties are obtained. Video steganalysis with closed loop feedback manner is design as a checker to find out obvious bugs. Experimental results showed this scheme can be applied on compressed video steganography with high security properties.
USING REENGINEERING FOR KNOWLEDGE-BASED SYSTEMS
Authors: Anne Håkansson, Ronald Hartung
Venue: Cybernetics and Systems (2007)

Reverse engineering, also called reengineering, is used to modify systems that have functioned for many years, but which can no longer accomplish their intended tasks and, therefore, need to be updated. Reverse engineering can support the modification and extension of the knowledge in an already existing system. However, this can be an intricate task for a large, complex and poorly documented knowledge-based system. The rules in the knowledge base must be gathered, analyzed and understood, but also checked for verification and validation. We introduce an approach that uses reverse engineering for the knowledge in knowledge-based systems. The knowledge is encapsulated in rules, facts and conclusions, and in the relationships between them. Reverse engineering also collects functionality and source code. The outcome of reverse engineering is a model of the knowledge base, the functionality and the source code connected to the rules. These models are presented in diagrams using a graphic representation similar to Unified Modeling Language and employing ontology. Ontology is applied on top of rules, facts and relationships. From the diagrams, test cases are generated during the reverse engineering process and adopted to verify and validate the system.
The feasibility of a mixed reality surgical training environment
Authors: Louise Moody, Alan Waterworth, Avril D. McCarthy, Peter J. Harley, Rod H. Smallwood
Venue: Virtual Reality (2008)

The Sheffield knee arthroscopy training system (SKATS) was originally a visual-based virtual environment without haptic feedback, but has been further developed as a mixed reality-training environment through the use of tactile augmentation (or passive haptics). The design of the new system is outlined and then tested. In the first experiment described, the effect of tactile augmentation on performance is considered by comparing novice performance using the original and mixed reality system. In the second experiment the mixed reality system is assessed in terms of construct validity by comparing the performance of users with differing levels of surgical expertise. The results are discussed in terms of the validity of a mixed reality environment for training knee arthroscopy.
Using an efficient hash chain and delaying function to improve an e-lottery scheme
Authors: Yining Liu, Lei Hu, Heguo Liu
Venue: International Journal of Computer Mathematics (2007)

A multi-level hash chain structure is employed to improve a fair e-lottery scheme which ensures secure winning number generation and verification and to make verification more efficient. In addition, an implementation of a delaying function based on a secure hash function is presented.
Multi-criterion optimization for the EWMA and MEWMA quality control charts employing genetic algorithms
Authors: Francisco Aparisi, J. Carlos García-Díaz
Venue: Proceedings of the 4th WSEAS International Conference on Applied Mathematics and Computer Science (2005)

The EWMA quality control chart, and its multivariate version (MEWMA), may be designed to efficiently detect small shifts in the mean vector of a set of p quality characteristics of a production process. However, this work presents a method for the optimal design of the parameters of the MEWMA and EWMA charts to control processes where it is not convenient to detect small magnitude shifts and, at the same time, powerful enough to detect shifts considered important. This problem can be considered as a multiobjective optimization where two regions of different performance are defined. The objective of this paper is to find the best MEWMA and EWMA quality control charts given the previous regions, where the requirements for each region has to be balanced to decide which solution is better. For this purpose, friendly Windows software has been developed to optimize this problem, using Genetic Algorithms. Results show that the design using our approach outperforms the other designs.
An e-learning environment based on open-source software
Authors: Sebastiano Pizzutilo, Filippo Tangorra, Bernardina De Carolis
Venue: Proceedings of the 4th WSEAS International Conference on Telecommunications and Informatics (2005)

The system we have built is aimed at supporting learning activities of the degree course in computer science. The defined learning environment is based on ATutor, a freeware and multiplatform Learning Component Management System developed by the University of Toronto. Among the present courses, the attention is pointed out on the computer architecture course, which also integrates a processor simulation within the courseware.
SOPC Co-design Platform for UWB System in Wireless Sensor Network Context
Authors: Daniela Dragomirescu, Aubin Lecointre, Robert Plana
Venue: Proceedings of the Third International Conference on Systems (2008)

This paper presents our approach of the radio interface problematic for Wireless Sensor Network. We introduce the WSN context and constraints associated. We propose an IR-UWB solution and illustrate why it could be a viable solution for WSN. A high level modelling and simulation platform for IR-UWB radio interface is proposed on Matlab. It allows us to determine according to BER versus Eb/N0 criteria and the WSN constraints what kind of design is more adequate. Moreover, a co-design co-simulation platform Matlab VHDL is proposed here. Using this platform we designed IR-UWB transceiver having reconfigurable capabilities, such as data rate reconfiguration, time hopping code, spectrum occupation and radio range reconfiguration.
On a new extension of Wilcox's method
Authors: I. Gladkova, D. Chebanov
Venue: Proceedings of the 5th WSEAS International Conference on Applied Mathematics (2004)

In this paper we extend Wilcox's classical results to the case of subregions of R2. This generalization enables us to construct many promising new waveforms with desired ambiguity profiles in the regions being considered.
A cluster-based simulation of facet-based search
Authors: Thierry Urruty, Frank Hopfgartner, Robert Villa, Nicholas Gildea, Joemon M. Jose
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

The recent increase of online video has challenged the research in the field of video information retrieval. Video search engines are becoming more and more interactive, helping the user to easily find what he or she is looking for. In this poster, we present a new approach of using an iterative clustering algorithm on text and visual features to simulate users creating new facets in a facet-based interface. Our experimental results prove the usefulness of such an approach.
A Simulation Model for Doppler Ultrasound Signals from Pulsatile Blood Flow in Stenosed Vessels
Authors: Lifang Wang, Yufeng Zhang, Dingkang Wang, Nafeng Su, Chengyan Du
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

A computer simulation model is proposed to generating Doppler ultrasound signals from pulsatile blood flow in the vessels with various stenosis degrees. The model take into account velocity field from pulsatile blood flow in the stenosed vessels, sample volume shape and acoustic factors that affect the Doppler signals. By solving the Navier-Stokes equations, the velocity distributions of pulsatile blood flow in the vessels with various stenosis degrees are firstly calculated according to the velocity at the axis of the circular tube. Secondly, power spectral density (PSD) of the Doppler signals is estimated by summing the contribution of all scatterers passing through the sample volume grouped into elemental volumes. Finally, Doppler signals are generated using cosine-superposed components that are modulated by a power spectral density function varying over the cardiac cycle. The model generates Doppler blood flow signals with the characteristics similar to those found in practice. The results show that the proposed approach is useful for simulating Doppler ultrasound signals from pulsatile blood flow in stenosed vessels.
Hardness-randomness tradeoffs for bounded depth arithmetic circuits
Authors: Zeev Dvir, Amir Shpilka, Amir Yehudayoff
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

In this paper we show that lower bounds for bounded depth arithmetic circuits imply derandomization of polynomial identity testing for bounded depth arithmetic circuits. More formally, if there exists an explicit polynomial f(x1,...,xm) that cannot be computed by a depth d arithmetic circuit of small size then there exists an efficient deterministic algorithm to test whether a given depth d-8 circuit is identically zero or not (assuming the individual degrees of the tested circuit are not too high). In particular, if we are guaranteed that the circuit computes a multilinear polynomial then we can perform the identity test efficiently. To the best of our knowledge this is the first hardness-randomness tradeoff for bounded depth arithmetic circuits. The above results are obtained using the arithmetic Nisan-Wigderson generator of Impagliazzo and Kabanets together with a new theorem on bounded depth circuits, which is the main technical contribution of our work. This theorem deals with polynomial equations of the form P(x1,...,xn,y) ≡ 0 and shows that if P has a circuit of depth d and size s and if the polynomial f(x1,...,xn) satisfies P(x1,...,xn,f(x1,...,xn))≡ 0 then f has a circuit of depth d+3 and size O(s • r + mr), where m is the degree of f and r is the highest degree of the variable y appearing in P. In the other direction we observe that the methods of Impagliazzo and Kabanets imply that if we can derandomize polynomial identity testing for bounded depth circuits then NEXP does not have bounded depth arithmetic circuits. That is, either NEXP ⊄ P/poly or the Permanent is not computable by polynomial size bounded depth arithmetic circuits.
Analysis of the anticipative cobweb model dynamics
Authors: Miroljub Kljajic, Andrej Škraba, Davorin Kofjač, Matevž Bren
Venue: Proceedings of the 9th WSEAS International Conference on Systems (2005)

The cobweb model of competitive market dynamics has been examined in the form of system dynamics model. The classical formulation of the cobweb demand-supply model has been transformed in the set of equations suitable for system dynamics modelling. The model has been expanded by the time parameter Δt which enables the stability analysis of the model for the change in the Δt. The structure of the model has been presented and key relationships in the model have been examined. The cyclical response of the system which is dependent on the demand∼supply parameters and eigenvalues of the characteristic equation has been numerically examined.
Separation Logic for Multiple Inheritance
Authors: Chenguang Luo, Shengchao Qin
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

As an extension to Floyd-Hoare logic, separation logic has been used to facilitate reasoning about imperative programs manipulating shared mutable data structures. Recently, it has also been extended to support modular reasoning in Java-like object-oriented languages where only single inheritance is allowed. In this paper we propose an extension of separation logic to support also the reasoning for multiple inheritance in C++ -like languages. To cater for multiple inheritance, we modified the standard storage model for separation logic in a way that the correct reference to a field or a method can be easily determined. On top of this storage model, a set of proof rules are proposed. Our verification system also provides basic support for behavioral subtyping.
Anytime search in dynamic graphs
Authors: Maxim Likhachev, Dave Ferguson, Geoff Gordon, Anthony Stentz, Sebastian Thrun
Venue: Artificial Intelligence (2008)

Agents operating in the real world often have limited time available for planning their next actions. Producing optimal plans is infeasible in these scenarios. Instead, agents must be satisfied with the best plans they can generate within the time available. One class of planners well-suited to this task are anytime planners, which quickly find an initial, highly suboptimal plan, and then improve this plan until time runs out. A second challenge associated with planning in the real world is that models are usually imperfect and environments are often dynamic. Thus, agents need to update their models and consequently plans over time. Incremental planners, which make use of the results of previous planning efforts to generate a new plan, can substantially speed up each planning episode in such cases. In this paper, we present an A^*-based anytime search algorithm that produces significantly better solutions than current approaches, while also providing suboptimality bounds on the quality of the solution at any point in time. We also present an extension of this algorithm that is both anytime and incremental. This extension improves its current solution while deliberation time allows and is able to incrementally repair its solution when changes to the world model occur. We provide a number of theoretical and experimental results and demonstrate the effectiveness of the approaches in a robot navigation domain involving two physical systems. We believe that the simplicity, theoretical properties, and generality of the presented methods make them well suited to a range of search problems involving dynamic graphs.
Systems of sets such that each set properly intersects at most one other set-Application to cluster analysis
Authors: P. Bertrand
Venue: Discrete Applied Mathematics (2008)

A set X is said to properly intersect a set Y if none of the sets X@?Y, X@?Y and Y@?X is empty. In this paper, we consider collections of subsets such that each member of the collection properly intersects at most one other member. Such collections are hereafter called paired hierarchical collections. The two following combinatorial properties are investigated. First, any paired hierarchical collection is a set of intervals of at least one linear order defined on the ground set. Next, the maximum size of a paired hierarchical collection defined on an n-element set is @?52(n-1)@?. The properties of these collections are also investigated from the cluster analysis point of view. In the framework of the general bijection defined by Batbedat [Les isomorphismes HTS et HTE (apres la bijection de Benzecri-Johnson), Metron 46 (1988) 47-59] and Bertrand [Set systems and dissimilarities, European J. Combin. 21 (2000) 727-743], we characterize the dissimilarities that are induced by weakly indexed paired hierarchical collections. Finally, we propose a proof of the so-called agglomerative paired hierarchical clustering (APHC) algorithm that extends the well-known AHC algorithm in order to allow that some clusters can be merged twice. An implementation and some illustrations of this algorithm and of a variant of it were presented by Chelcea et al. [A new agglomerative 2-3 hierarchical clustering algorithm, in: D. Baier, K.-D. Wernecke (Eds.), Innovations in Classification, Data Science, and Information Systems (GfKL 2003), Springer, Berlin, 2004, pp. 3-10 and Un Nouvel Algorithme de Classification Ascendante 2-3 Hierarchique, in: Reconnaissance des Formes et Intelligence Artificielle (RFIA 2004), vol. 3, Toulouse, France, 2004, pp. 1471-1480. Available at ].
Seven essentials of software process
Authors: Hakan Erdogmus
Venue: Proceedings of the 1st international workshop on Business impact of process improvements (2008)

A hybrid view of software development has risen from the collision and convergence of grassroots and craft-based process trends with research and engineering-based ones. In this talk, I will first explain the seven essential characteristics of this contemporary view: human-centricity, pragmatism, discipline, technical orientation, empiricism, experimentation, and value orientation. These characteristics are not simply complementary: they are mutually reinforcing and mutually balancing. I will then focus on the seventh characteristic, value orientation, in terms of how it interacts with the remaining characteristics. The resulting thinking sheds light to weaknesses and strengths of current packaged approaches, and how successful software development is expected to unfold and effective strategies will be uncovered in the era to come.
Conditional random fields for entity extraction and ontological text coding
Authors: Jana Diesner, Kathleen M. Carley
Venue: Computational Mathematical Organization Theory (2008)

Previous research suggests that one field with a strong yet unsatisfied need for automatically extracting instances of various entity classes from texts is the analysis of socio-technical systems (Feldstein in Media in Transition MiT5, 2007; Hampe et al. in Netzwerkanalyse und Netzwerktheorie, 2007; Weil et al. in Proceedings of the 2006 Command and Control Research and Technology Symposium, 2006; Diesner and Carley in XXV Sunbelt Social Network Conference, 2005). Traditional as well as non-traditional and customized sets of entity classes and the relationships between them are often specified in ontologies or taxonomies. We present a Conditional Random Fields (CRF)-based approach to distilling a set of entities that are defined in an ontology originating from organization science. CRF, a supervised sequential machine learning technique, facilitates the derivation of relational data from corpora by locating and classifying instances of various entity classes. The classified entities can be used as nodes for the construction of socio-technical networks. We find the outcome sufficiently accurate (82.7 percent accuracy of locating and classifying entities) for future application in the described problem domain. We propose using the presented methodology as a crucial step in the process of advanced modeling and analysis of complex and dynamic networks.
Intelligent switch control of an active power line conditioner
Authors: Robert M. O'Connell
Venue: International Journal of Knowledge-based and Intelligent Engineering Systems (2007)

his paper describes the application of various soft computing tools, including the genetic algorithm, artificial neural networks, and fuzzy logic to the control of the semiconductor switches in a novel active power line conditioner (APLC). The use of intelligent control in the APLC is warranted by the complexity and cost of conventional control schemes that could be used alternatively. MATLAB simulations of the APLC with either the neural network controller or the fuzzy logic controller predict that the system can improve the total harmonic distortion of a power line current from over 100% to well under 10% using the relatively low, and therefore relatively lossless, switching frequency of 3840 Hz. Measurements on an experimental prototype showed that in steady-state operation, the neural-network-controlled APLC improved the distortion of a specific line current from 114% to 12%, and the fuzzy-logic-controlled system improved it from 125% to only 30%. On the other hand, the fuzzy-logic-controlled system was able to smoothly track a sudden load change and convert the line current from one compensated steady-state and nearly sinusoidal waveform to another one in approximately one 60 Hz cycle.
Secure Deniable Authenticated Key Establishment for Internet Protocols
Authors: Meng-Hui Lim, SangGon Lee, Youngho Park, Sangjae Moon
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

In 2003, Boyd et al. have proposed two deniable authenticated key establishment protocols for Internet Key Exchange (IKE). However, both schemes have been broken by Chou et al. in 2005 due to their susceptibility to key-compromise impersonation (KCI) attack. In this paper, we put forward the improved variants of both Boyd et al.'s schemes in order to defeat the KCI attack. On top of justifying our improvements, we further present a detailed security analysis to ensure that the desired security attributes: deniability and authenticity remain preserved.
NexusEditor: A Schema-Aware Graphical User Interface for Managing Spatial Context Models
Authors: Daniela Nicklas, Carsten Neumann
Venue: Proceedings of the The Ninth International Conference on Mobile Data Management (2008)

To support context-aware applications, it is beneficial to maintain shared context models that contain different types of information, like mobile objects, stationary objects, or spatially related digital information. This demonstration is about the NexusEditor, a graphical user interface to maintain spatial context models, interactively create queries, send them to a server and visualize the results. The contribution here is to show how schema awareness can improve such a tool: the NexusEditor dynamically parses the underlying data model and provides additional syntactic and semantic checks and short-cuts based on the schema information. Also, it supports export to existing information spaces like Google Earth.