ppxscal/embedding_network huggingface dataset:
A System of Recognition of Characters based on Paraconsistent Artificial Neural Networks
Authors: Luís Fernando Pompeo Ferrara, Keiji Yamanaka, João Inácio da Silva Filho
Venue: Proceeding of the 2005 conference on Advances in Logic Based Intelligent Systems: Selected Papers of LAPTEC 2005 (2005)

In this paper we presented a System capable to realize a recognition of characters with base in the theoretical concepts of the Paraconsistent Annotated Logic. The Paraconsistent Annotated Logic PAL as shown in [1] is a class of the Non-Classic Logic which allows to manipulate contradictory signals. In [5] were presented the Paraconsistent Artificial Neural Cells built with Algorithms based on PAL. These Cells showed the capacity of learning certain signals in form of functions applied in their inputs. In this work, based on these Cells, were made connections and groupings among the algorithms to create a Recognizer of Characters Paraconsistent System (RCPS) capable of to learning and recognizing different types of alphabet letters or sources of signals. After the learning characters, the RPCS can recognize the letter with a high efficiency and further compares it to the group of characters learned previously. The results of tests demonstrate that the RPCS can be used as Specialist Systems of words and images Recognition
Dreamweaver CS3 in Easy Steps: For Windows and Mac
Authors: Nick Vandome
Venue:  (2007)

This helpful guide allows even novice Web designers to turn their ideas for dynamic websites into reality. It guides them through Dreamweaver CS3s working environment, then shows how to add and format content in both HTML and CSS, including text, images, hyperlinks, templates, forms, and more. Also covered are the new Javascript libraries, integration with Photoshop, and designing websites for mobile devices. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Tracing and Revoking Pirate Rebroadcasts
Authors: Aggelos Kiayias, Serdar Pehlivanoglu
Venue: Proceedings of the 7th International Conference on Applied Cryptography and Network Security (2009)

All content distribution systems are vulnerable to the attack of rebroadcasting: in a pirate rebroadcast a pirate publishes the content in violation of the licensing agreement. This attack defeats any tracing mechanism that requires interaction with the pirate decoder for identifying compromised keys. Merely tracing pirate rebroadcasts is of little use and one should be also able to revoke the involved traitor keys. The only currently known scheme addressing this issue is implemented as part of the Advanced Access Content System (AACS) used in Blu-Ray and HD-DVD disks. In this paper we perform an analysis of this construction and we find it has serious limitations: the number of revocations is bound by the size of the receiver storage (for the actual parameters reported this is merely 85 keys).We address the limitations of the state of the art (i) by formally modeling the problem of tracing and revoking pirate rebroadcasts and (ii) by presenting the first efficient constructions of tracing and revoking pirate rebroadcasts that are capable of performing tracing for unlimited numbers of traitors and revoking unlimited numbers of users. We present three instantiations of our framework: our first construction achieves a linear communication overhead in the number of revoked users and traitors and is capable of eliminating a pirate rebroadcast by any number of traitors in time that depends logarithmically in the number of users and polynomially on the number of revocations and traitors. Our second construction assumes a fixed bound on the number of traitors and improves the elimination time to depend only logarithmically on the number of revocations. Both of these constructions require merely a binary marking alphabet. Our third construction utilizes a larger marking alphabet and achieves even faster pirate rebroadcast elimination; our analysis improves the previously known bound for the same alphabet size due to Fiat and Tassa from Crypto'99 while offering revocation explicitly.
Hardware-assisted run-time monitoring for secure program execution on embedded processors
Authors: Divya Arora, Srivaths Ravi, Anand Raghunathan, Niraj K. Jha
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2006)

Embedded system security is often compromised when "trusted" software is subverted to result in unintended behavior, such as leakage of sensitive data or execution of malicious code. Several countermeasures have been proposed in the literature to counteract these intrusions. A common underlying theme in most of them is to define security policies at the system level in an application-independent manner and check for security violations either statically or at run time. In this paper, we present a methodology that addresses this issue from a different perspective. It defines correct execution as synonymous with the way the program was intended to run and employs a dedicated hardware monitor to detect and prevent unintended program behavior. Specifically, we extract properties of an embedded program through static program analysis and use them as the bases for enforcing permissible program behavior at run time. The processor architecture is augmented with a hardware monitor that observes the program's dynamic execution trace, checks whether it falls within the allowed program behavior, and flags any deviations from expected behavior to trigger appropriate response mechanisms. We present properties that capture permissible program behavior at different levels of granularity, namely inter-procedural control flow, intra-procedural control flow, and instruction-stream integrity. We outline a systematic methodology to design application-specific hardware monitors for any given embedded program. Hardware implementations using a commercial design flow, and cycle-accurate performance simulations indicate that the proposed technique can thwart several common software and physical attacks, facilitating secure program execution with minimal overheads.
A new iterative approach for dominant points extraction in planar curves
Authors: Cecilia Di Ruberto, Andrea Morgera
Venue: WSEAS Transactions on Computers (2009)

In this paper the problem of dominant point detection on digital curves is addressed. Based on an initial set of curvature points, our approach adds iteratively significant points by looking for the higher curvature contour points. The process continues until all the sums of the distances of contour points in the arcs subtended to the chord between two next dominant points is less then a predefined threshold. A final refinement process adjusts the position of located dominant points by a minimum integral square error criterion. We test our method by comparing its performance with other well known dominant point extraction techniques succesfully. In the last section some examples of polygonal approximation are shown.
Malicious Code Detection Using Active Learning
Authors: Robert Moskovitch, Nir Nissim, Yuval Elovici
Venue: Privacy, Security, and Trust in KDD: Second ACM SIGKDD International Workshop, PinKDD 2008, Las Vegas, NV, USA, August 24, 2008, Revised Selected Papers (2009)

The recent growth in network usage has motivated the creation of new malicious code for various purposes, including economic and other malicious purposes. Currently, dozens of new malicious codes are created every day and this number is expected to increase in the coming years. Today's signature-based anti-viruses and heuristic-based methods are accurate, but cannot detect new malicious code. Recently, classification algorithms were used successfully for the detection of malicious code. We present a complete methodology for the detection of unknown malicious code, inspired by text categorization concepts. However, this approach can be exploited further to achieve a more accurate and efficient acquisition method of unknown malicious files. We use an Active-Learning framework that enables the selection of the unknown files for fast acquisition. We performed an extensive evaluation of a test collection consisting of more than 30,000 files. We present a rigorous evaluation setup, consisting of real-life scenarios, in which the malicious file content is expected to be low, at about 10% of the files in the stream. We define specific evaluation measures based on the known precision and recall measures, which show the accuracy of the acquisition process and the improvement in the classifier resulting from the efficient acquisition process.
Utilization of a Cartesian grid based numerical scheme in analysis of rotorcraft flows
Authors: Jae-Doo Lee, Stephen M. Ruffin
Venue: Proceedings of the 15th american conference on Applied mathematics (2009)

Despite the high cost of memory and CPU time required to resolve the boundary layer, a viscous unstructured grid solver has many advantages over a structured grid solver such as the convenience in automated grid generation and shock or vortex capturing by solution adaption. In present study, an unstructured Cartesian grid solver is applied and results evaluated in rotorcraft flowfields. Recently, an existing solver, NASCART-GT was modified to use an immersed boundary approach (instead of a cut-cell approach). This approach is applied with ghost cell boundary condition, which increases the accuracy and minimizes unphysical fluctuations of the flow properties. The standard k-epsilon model by Launder and Spalding is employed for the turbulence modeling, and a new wall function was incorporated for the unstructured Cartesian grid solver. This model was previously only validated for 2-D flows, but in the present paper is applied to 3-D rotorcraft flowfields. For rotor modeling, an actuator disk model is chosen, since it is efficient and is widely verified in the study of the rotor-fuselage interaction. The full three dimensional calculations of Euler and RANS equations are performed for the GT rotor model and ROBIN configuration to test implemented actuator disk model along with the developed turbulence modeling.
Nonconforming Maxwell Eigensolvers
Authors: Susanne C. Brenner, Fengyan Li, Li-Yeng Sung
Venue: Journal of Scientific Computing (2009)

Three Maxwell eigensolvers are discussed in this paper. Two of them use classical nonconforming finite element approximations, and the other is an interior penalty type discontinuous Galerkin method. A main feature of these solvers is that they are based on the formulation of the Maxwell eigenproblem on the space H 0(curl;¿)¿H(div0;¿). These solvers are free of spurious eigenmodes and they do not require choosing penalty parameters. Furthermore, they satisfy optimal order error estimates on properly graded meshes, and their analysis is greatly simplified by the underlying compact embedding of H 0(curl;¿)¿H(div0;¿) in L 2(¿). The performance and the relative merits of these eigensolvers are demonstrated through numerical experiments.
Optimal balancing of multi-objective assembly lines via metaheuristic approach
Authors: Supaporn Suwannarongsri, Deacha Puangdownreong
Venue: Proceedings of the 10th WSEAS international conference on evolutionary computing (2009)

The article proposes the metaheuristic approach for solving the assembly line balancing (ALB) problems. The adaptive tabu search (ATS) method and the practicing heuristic (PH) technique are combined to provide optimal solutions of the ALB problems. The ATS is used to address the number of tasks assigned for each workstation, while the PH is conducted to assign the sequence of tasks for each workstation according to precedence constraints. The workload variance, the idle time and the line efficiency are performed as the multiple objective function. The proposed approach is tested against six benchmark ALB problems and one real-world ALB problem. Obtained results are compared with those obtained by the single objective approach. As results, the proposed metaheuristic approach based on the ATS and the PH associated with the multi-objective function is capable of producing solutions superior to the single objective function.
Open framework middleware: an experimental middleware design concept for wireless sensor networks
Authors: Muhammad Sohaib Aslam, Eoin O'Regan, Susan Rea, Dirk Pesch
Venue: Proceedings of the 6th international workshop on Managing ubiquitous communications and services (2009)

Wireless Sensor Networks (WSN) represents an inherently more complex domain for the design and implementation of middleware than traditional Enterprise systems. Existing examples of middleware within WSN are limited in their scope and are primarily affiliated with influencing the behaviour of nodes only, with some middleware being capable of operating at node and gateway level. We propose an Open Framework Middleware (OFM) that addresses these limitations. It is loosely based on the principles of Model Driven Engineering (MDE) and also incorporates some of the concepts of cloud computing's ubiquity and pervasiveness. It views the network as a single entity, that is a middleware operating at all levels of the network i.e. node, gateway and control level. It provides distribution, scalability, flexibility and adaptability at deployment, operation and integration levels.
Ubiquitous and pervasive computing: architectures and protocols for applications design
Authors: Mohamed Bakhouya
Venue: Proceedings of the 3rd workshop on Agent-oriented software engineering challenges for ubiquitous and pervasive computing (2009)

Ubiquitous and pervasive computing are recent paradigms with a goal to provide computing and communication services anytime and everywhere. In ubiquitous computing, the main objective is to provide users the ability to access services and resources all the time and irrespective to their location, while in pervasive computing, the main objective is to provide spontaneous emergent services created on the fly by mobiles that interact by ad hoc connections. The design and development of ubiquitous and pervasive applications require new protocols and architectures to efficiently use resources and services. Gaber's classification of interaction paradigms emphasizes two alternative paradigms to the traditional client-to-server paradigm (CSP) to design and implement Ubiquitous and Pervasive applications, which are the Adaptive Services-to-Client Paradigm (SCP) and the Spontaneous Service Emergence Paradigm (SEP). These paradigms involve context awareness, auto-adaptive and emergence principles that could be implemented by self-organizing and reactive intelligent networks. Approaches and protocols that are mainly proposed to meet these requirements can be classified into two major research directions. The first direction addresses semantic languages to specify and describe application components, including complex planning mechanisms that utilize these descriptions to generate the whole application or composite service. The second direction aims to develop architectures that enable scalable, fault tolerance, and adaptive applications in dynamic environments. This talk will survey current approaches and protocols proposed to design and built ubiquitous and pervasive applications. We will present service-oriented architecture principles with service description languages. We will also highlight new research directions that can leverage the tremendous potential of this new category of applications.
Anisotropic magnetoresistive sensors of the magnetic field and current
Authors: S. I. Kasatkin, A. M. Murav'Ev, N. V. Plotnikova, V. V. Amelichev, A. I. Galushkov, I. A. Gamarts, V. V. Lopatin, A. N. Saurov
Venue: Automation and Remote Control (2009)

Results are presented of the work in the domain of investigation and production of thin-filmed anisotropic magnetoresistive sensors (AMRSs) of the magnetic field and current on the basis of the single-layer or the double-layer metallic ferromagnetic nanostructure with a thickness of the magnetic film of 12---25 nm. The problems of design of the AMRS structures and their efficiency are considered with the investigation of the basic characteristics and technology of their production.
Global and Local Synchronization of General Multi-linked Delayed Complex Dynamical Networks
Authors: Yongqing Zhao, Minghui Jiang
Venue: Proceedings of the 6th International Symposium on Neural Networks on Advances in Neural Networks (2009)

This paper investigates the phenomena of a new and general multi-linked complex network with delayed nodes and couplings. Via constructing Lyapunov-Krasovskii function and using inequality technique, the criteria for locally exponential synchronization and globally asymptotical synchronization are derived. The latter neither requires the outer-coupling configuration matrix to be symmetric and irreducible nor needs the network to be linearized at its synchronization state, it is obtained by Kronecker product method. Finally, a numerical example illustrates the theoretical results.
Skolem Machines
Authors: John Fisher, Marc Bezem
Venue: Fundamenta Informaticae (2009)

The Skolem machine is a Turing-complete machine model where the instructions are first-order formulas of a specific form. We introduce Skolem machines and prove their logical correctness and completeness. Skolem machines compute queries for the Geolog language, a rich fragment of first-order logic. The concepts of Geolog trees and complete Geolog trees are defined, and these tree concepts are used to show logical correctness and completeness of Skolem machine computations. The universality of Skolem machine computations is demonstrated. Lastly, the paper outlines implementation design issues using an abstract machine model approach.
Fuzzy homomorphisms of algebras
Authors: Jelena Ignjatović, Miroslav Ćirić, Stojan Bogdanović
Venue: Fuzzy Sets and Systems (2009)

In this paper we consider fuzzy relations compatible with algebraic operations, which are called fuzzy relational morphisms. In particular, we aim our attention to those fuzzy relational morphisms which are uniform fuzzy relations, called uniform fuzzy relational morphisms, and those which are partially uniform F-functions, called fuzzy homomorphisms. Both uniform fuzzy relations and partially uniform F-functions were introduced in a recent paper by us. Uniform fuzzy relational morphisms are especially interesting because they can be conceived as fuzzy congruences which relate elements of two possibly different algebras. We give various characterizations and constructions of uniform fuzzy relational morphisms and fuzzy homomorphisms, we establish certain relationships between them and fuzzy congruences, and we prove homomorphism and isomorphism theorems concerning them. We also point to some applications of uniform fuzzy relational morphisms.
Interactive visualization for computational linguistics
Authors: Christopher Collins, Gerald Penn, Sheelagh Carpendale
Venue: Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics on Human Language Technologies: Tutorial Abstracts (2008)

Interactive information visualization is an emerging and powerful research technique that can be used to understand models of language and their abstract representations. Much of what computational linguists fall back upon to improve NLP applications and to model language "understanding" is structure that has, at best, only an indirect attestation in observable data. An important part of our research progress thus depends on our ability to fully investigate, explain, and explore these structures, both empirically and relative to accepted linguistic theory. The sheer complexity of these abstract structures, and the observable patterns on which they are based, usually limits their accessibility --- often even to the researchers creating or attempting to learn them.
Robust coordinated design of excitation and STATCOM-based controller using genetic algorithm
Authors: Sidhartha Panda, Narayana Prasad Patidar, Rishi Singh
Venue: International Journal of Innovative Computing and Applications (2008)

Power system stability enhancement via robust coordinated design of a power system stabiliser (PSS) and a static synchronous compensator (STATCOM)-based stabiliser is thoroughly investigated in this paper. The coordination among the proposed damping stabilisers and the STATCOM internal AC and DC voltage controllers as well as the current regulator has also been taken into consideration. The coordinated design problem is formulated as an optimisation problem with a time-domain simulation-based objective function and genetic algorithm (GA) is employed to search for optimal controller parameters. The proposed stabilisers are tested on a weakly connected power system with different disturbances and loading conditions. The non-linear simulation results show the effectiveness and robustness of the proposed control schemes over a wide range of loading conditions and disturbances. Further, the proposed design approach is found to be robust and improves stability effectively even under small disturbance and unbalanced fault conditions.
A Multi-scale Feature Based Optic Flow Method for 3D Cardiac Motion Estimation
Authors: Alessandro Becciu, Hans Assen, Luc Florack, Sebastian Kozerke, Vivian Roode, Bart M. Haar Romeny
Venue: Proceedings of the Second International Conference on Scale Space and Variational Methods in Computer Vision (2009)

The dynamic behavior of the cardiac muscle is strongly dependent on heart diseases. Optic flow techniques are essential tools to assess and quantify the contraction of the cardiac walls. Most of the current methods however are restricted to the analysis of 2D MR-tagging image sequences: due to the complex twisting motion combined with longitudinal shortening, a 2D approach will always suffer from through-plane motion. In this paper we investigate a new 3D aperture-problem free optic flow method to study the cardiac motion by tracking stable multi-scale features such as maxima and minima on 3D tagged MR and sine-phase image volumes. We applied harmonic filtering in the Fourier domain to measure the phase. This removes the dependency of intensity changes of the tagging pattern over time due to T1 relaxation. The regular geometry, the size-changing patterns of the MR-tags stretching and compressing along with the tissue, and the phase- and sine-phase plots represent a suitable framework to extract robustly multi-scale landmark features. Experiments were performed on real and phantom data and the results revealed the reliability of the extracted vector field. Our new 3D multi-scale optic flow method is a promising technique for analyzing true 3D cardiac motion at voxel precision, and free of through-plane artifacts present in multiple-2D data sets.