ppxscal/embedding_network huggingface dataset:
A Learning Based Widrow-Hoff Delta Algorithm for Noise Reduction in Biomedical Signals
Authors: Jorge Mateo Sotos, César Sánchez Meléndez, Carlos Vayá Salort, Raquel Cervigon Abad, José Joaquín Rieta Ibáñez
Venue: Proceedings of the 2nd international work-conference on The Interplay Between Natural and Artificial Computation, Part I: Bio-inspired Modeling of Cognitive Tasks (2007)

This work presents a noise cancellation system suitable for different biomedical signals based on a multilayer artifical neural network(ANN). The proposed method consists of a simple structure similar to the MADALINE neuronal network (Multiple ADAptive LINear Element). This network is a grown artificial neuronal network which allows to optimize the number of nodes of one hidden layer and coefficients of several matrixes. These coefficients matrixes are optimized using the Widrow-Hoff Delta algorithm which requires smaller computational cost than the required by the back-propagation algorithm.The method's performance has been obtained by computing the cross correlation between the input and the output signals to the system. In addition, the signal to interference ratio (SIR) has also been computed. Making use of the aforementioned indexes it has been possible to compare the different classical methods (Filter FIR, biorthogonal Wavelet 6,8, Filtered Adaptive LMS) and the proposed system based on neural multilayer networks . The comparison shows that the ANN-based method is able to better preserve the signal waveform at system output with an improved noise reduction in comparison with traditional techniques. Moreover, the ANN technique is able to reduce a great variety of noise signals present in biomedical recordings, like high frequency noise, white noise, movement artifacts and muscular noise.
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
Authors: Yehuda Lindell, Benny Pinkas
Venue: Proceedings of the 26th annual international conference on Advances in Cryptology (2007)

Check if we can apply Woodruff's method to our protocol. We show an efficient secure two-party protocol, based on Yao's construction, which provides security against malicious adversaries. Yao's original protocol is only secure in the presence of semi-honest adversaries. Security against malicious adversaries can be obtained by applying the compiler of Goldreich, Micali and Wigderson (the "GMW compiler"). However, this approach does not seem to be very practical as it requires using generic zero-knowledge proofs.Our construction is based on applying cut-and-choose techniques to the original circuit and inputs. Security is proved according to the ideal/real simulation paradigm, and the proof is in the standard model (with no random oracle model or common reference string assumptions). The resulting protocol is computationally efficient: the only usage of asymmetric cryptography is for running O(1) oblivious transfers for each input bit (or for each bit of a statistical security parameter, whichever is larger). Our protocol combines techniques from folklore (like cut-and-choose) along with new techniques for efficiently proving consistency of inputs. We remark that a naive implementation of the cut-and-choose technique with Yao's protocol does not yield a secure protocol. This is the first paper to show how to properly implement these techniques, and to provide a full proof of security.Our protocol can also be interpreted as a constant-round black-box reduction of secure two-party computation to oblivious transfer and perfectly-hiding commitments, or a black-box reduction of secure two-party computation to oblivious transfer alone, with a number of rounds which is linear in a statistical security parameter. These two reductions are comparable to Kilian's reduction, which uses OT alone but incurs a number of rounds which is linear in the depth of the circuit [18].
Power and stability in connectivity games
Authors: Yoram Bachrach, Jeffrey S. Rosenschein, Ely Porat
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2 (2008)

We consider computational aspects of a game theoretic approach to network reliability. Consider a network where failure of one node may disrupt communication between two other nodes. We model this network as a simple coalitional game, called the vertex Connectivity Game (CG). In this game, each agent owns a vertex, and controls all the edges going to and from that vertex. A coalition of agents wins if it fully connects a certain subset of vertices in the graph, called the primary vertices. We show that power indices, which express an agent's ability to affect the outcome of the vertex connectivity game, can be used to identify significant possible points of failure in the communication network, and can thus be used to increase network reliability. We show that in general graphs, calculating the Banzhaf power index is #P-complete, but suggest a polynomial algorithm for calculating this index in trees. We also show a polynomial algorithm for computing the core of a CG, which allows a stable division of payments to coalition agents.
Effect of Neighborhood on In-Network Processing in Sensor Networks
Authors: Muhammad Jafar Sadeq, Matt Duckham
Venue: Proceedings of the 5th international conference on Geographic Information Science (2008)

Wireless sensor networks are growing from a few hand-placed devices to more large-scale networks in terms of coverage and node density. For various concerns, such as scalability, larger network sizes require some management of the large volume of data that a sensor network delivers. One way to manage this data is processing information in the network. This paper investigates how a sensor network's network architecture (specifically, the neighborhood structure) can influence the conclusions that a sensor network makes from its measurements. The results demonstrate that non-planar structures are infeasible for routing and some in-network processing applications. Structures with low average edge lengths give better quantitative results, while those with high edge densities give better qualitative results.
Climbing Longs Peak: The Steep Road to the Future of OpenGL
Authors: Dirk Reiners, Gerrit Voss
Venue: IEEE Computer Graphics and Applications (2007)

By Siggraph 2007, the first version of the new OpenGL specifications will be made public. The changes are significant, and people who haven't been closely following OpenGL's development won't recognize much. To understand what motivated this drastic change after more than a decade of stability, the authors look at the history and motivations behind OpenGL.
Generation of quinqueanary pulse compression sequences using FPGA
Authors: N. Balaji, K. Subba Rao, M. Srinivasa Rao, V. Rajitha
Venue: Proceedings of the 8th WSEAS International Conference on Multimedia systems and signal processing (2008)

Radar signal processing applications require a set of sequences with individually peaky auto correlation and pair wise cross correlation. Obtaining such sequences is a combinational problem. If the auto correlation and cross correlation are taken in the aperiodic sense then there are hardly any theoretical aids available. The main criterion for good pulse compression sequence is the Meritfactor and discrimination. Thus the problem of signal design referred to above are challenging problem for which many global optimization algorithms like genetic algorithm, simulated annealing, tunneling algorithm were reported in the literature. All these optimization algorithms have serious drawbacks of non guaranteed convergence, slow convergence rate and require large number of evaluations of the objective function. To overcome these drawbacks, recently we proposed an efficient VLSI architecture for identification of the Quinqueanary Pulse compression sequences. Integrating this architecture with the currently proposing architecture provides an efficient real time Hardware solution for identification and generation of the Quinqueanary Pulse compression sequences. This paper describes the generation of the Quinqueanary Pulse compression sequences using Field Programmable Gate Array (FPGA). In this paper an effort is made for the generation of the Pulse compression sequences using an efficient VLSI architecture. The Proposed VLSI architecture is implemented on the FPGA as it provides the flexibility of reconfigurability and reprogrammability.
A Novel Non-exclusive Dual-Mode Architecture for MPSoCs-Oriented Network on Chip Designs
Authors: Francesca Palumbo, Simone Secchi, Danilo Pani, Luigi Raffo
Venue: Proceedings of the 8th international workshop on Embedded Computer Systems: Architectures, Modeling, and Simulation (2008)

Multi-Processor Systems-on-Chip (MPSoCs) are the most recent challenge of the VLSI technologies and Networks on Chip represent a high performance alternative to the traditional bus architectures. In this paper, a novel approach to the design of a dual-mode router, based on the idea of supporting both circuit and packet switching in a non-exclusive way, is presented and evaluated. This feature makes the proposed architecture suitable for MPSoCs which have to deal with heterogeneous traffic characteristics especially in terms of data size, such as the Massively Parallel Processors. Non-exclusivity enables packets latency reduction, which in turn implies lower task completion times, and also it increases throughput.
MC2: Multiple Clients on a Multilevel Cache
Authors: Gala Yadgar, Michael Factor, Kai Li, Assaf Schuster
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems (2008)

In today's networked storage environment, it is common to have a hierarchy of caches where the lower levels of the hierarchy are accessed by multiple clients. This sharing can have both positive or negative effects. While data fetched by one client can be used by another client without incurring additional delays, clients competing for cache buffers can evict each other's blocks and interfere with exclusive caching schemes. Our algorithm, MC2, combines local, per client management with a global, system-wide, scheme, to emphasize the positive effects of sharing and reduce the negative ones. The local scheme uses readily available information about the client's future access profile to save the most valuable blocks, and to choose the best replacement policy for them. The global scheme uses the same information to divide the shared cache space between clients, and to manage this space. Exclusive caching is maintained for non-shared data and is disabled when sharing is identified. Our simulation results show that the combined algorithm significantly reduces the overall I/O response times of the system.
Comparing Symmetric-key and Public-key Based Security Schemes in Sensor Networks: A Case Study of User Access Control
Authors: Haodong Wang, Bo Sheng, Chiu C. Tan, Qun Li
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems (2008)

While symmetric-key schemes are efficient in processing time for sensor networks, they generally require complicated key management, which may introduce large memory and communication overhead. On the contrary, public-key based schemes have simple and clean key management, but cost more computational time. The recent progress of elliptic curve cryptography (ECC) implementation on sensors motivates us to design a public-key scheme and compare its performance with the symmetric-key counterparts. This paper builds the user access control on commercial off-the-shelf sensor devices as a case study to show that the public-key scheme can be more advantageous in terms of the memory usage, message complexity, and security resilience. Meanwhile, our work also provides insights in integrating and designing public-key based security protocols for sensor networks.
Towards an XPDL Compliant Process Ontology
Authors: Armin Haller, Walid Gaaloul, Mateusz Marmolowski
Venue: Proceedings of the 2008 IEEE Congress on Services - Part I (2008)

This paper presents initial results on oXPDL, a process interchange ontology based on the standardised XML Process Definition Language (XPDL). XPDL was introduced to allow process model exchange between information systems, most of which are based on proprietary workflow models. Our process interchange ontology oXPDL explicitly models the complete semantics of XPDL process models in a standard Web ontology language. The oXPDL process models may be used for integrated process analysisby querying and reasoning over multiple models and their instances in combination with business rules described in background ontologies, each of which may originate from different information systems.
Performance of a PIV System for a Combusting Flow and Its Application to a Spray Combustor Model
Authors: M. Kiuchi, N. Fujisawa, S. Tomimatsu
Venue: Journal of Visualization (2005)

The performance of PIV system for combusting flow was evaluated by using artificial images generated from computer graphics and experimental data. The influences of shutter speed, filter, laser power and the PIV algorithms on the measurement uncertainty were studied for optimizing the performance of the PIV system. This system was applied to the spray combustor model for boiler, and the flow patterns with and without combustion were elucidated. Results showed that the burner flow generates complex three-dimensional flow pattern, which contributes to highly mixed fuel flow in the combustor. Although the flow pattern with and without combustion is similar, the growth of burner flow area and an increase in velocity magnitude are found in the flow field by the influence of chemical reactions in combustion.
Temporal Subtraction Versus Dual-Energy Contrast-Enhanced Digital Breast Tomosynthesis: A Pilot Study
Authors: Ann-Katherine Carton, Jean Anne Currivan, Emily Conant, Andrew Maidment
Venue: Proceedings of the 9th international workshop on Digital Mammography (2008)

In contrast-enhanced DBT (CE-DBT), breast lesion vascularity is characterized by administrating an iodinated vascular contrast agent. In this work, a combined temporal and dual-energy (DE) subtraction CE-DBT technique was performed in 4 women with mammographic findings that warranted biopsy. Lesion enhancement characteristics and morphology obtained with both CE-DBT techniques are correlated to lesion enhancement characteristics and morphology obtained with CE-MRI. The findings are compared to the clinical outcome of the regular DBT exam. Preliminary results show that both temporal and DE CE-DBT provide morphologic and qualitative vascular information concordant with CE-MRI. Temporal subtraction is the most sensitive method since background breast tissue can be completely canceled while with DE CE-DBT tissue background can only be partially canceled. However, the temporal CE-DBT image data suffer from significantly more motion artifacts and therefore possible misdiagnosis.
Operations on Interval Matrices
Authors: Barbara Pekala
Venue: Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms (2007)

We consider algebraic properties of interval matrices. Operations on interval matrices are strictly connected with interval-valued fuzzy sets. We examine lattice and semigroup properties of interval matrices. Next, we discuss asymptotic properties in semigroup of powers. In particular, a convergence of power sequence is examined. There is a dependence between this convergence and convergence of powers of boundary matrices.Math. Sub. Class.: 15A30 06D72 65G30
NaviTexte, a Text Navigation Tool
Authors: Javier Couto, Jean-Luc Minel
Venue: Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing (2007)

In this paper, we describe NaviTexte, a software devoted to text navigation. First, we explain our conception of text navigation, which exploits linguistic information in texts to offer dynamic reading paths to a reader. Second, we describe a text representation specially defined to support our approach. Then we present a language for modeling navigation knowledge and its implementation framework. At last, two experimentations are presented: one aiming at teaching French at Danish students and the other one proposes text navigation as an alternative at the process of summarization based on sentences extraction.
Effectiveness of multiple pageable page sizes for commercial applications
Authors: Joefon Jann, Niteesh Dubey, Pratap Pattnaik, R. Sarma Burugula
Venue: Software&mdash;Practice Experience (2008)

This paper investigates the computational characteristics of the software applications that are developed to support typical modern e-commerce applications. These applications have a significant impact on global commerce, and their influence is expected to continue. We show that the micro-architectural features of the memory subsystem, assisted by the operating system (such as the use of concurrent pageable page sizes), can significantly improve the performance of these applications. In particular, we show that using 64&thinsp;kB page size in addition to the default 4&thinsp;kB page size provides substantial throughput improvements for a typical commercial application (Trade6) without adding any complexity for the application developer or the system administrator. Copyright &copy; 2007 John Wiley & Sons, Ltd.
Trident: Scientific Workflow Workbench for Oceanography
Authors: R. S. Barga, J. Jackson, N. Araujo, D. Guo, N. Gautam, K. Grochow, E. Lazowska
Venue: Proceedings of the 2008 IEEE Congress on Services - Part I (2008)

We introduce Trident, a scientific workflow workbench that is built on top of a commercial workflow system to leverage existing functionality. Trident is being developed in collaboration with the scientific community for oceanography, but the workbench itself can be used for any science project for scientific workflow.
Extraction of Geometrical Features in 3D Environments for Service Robotic Applications
Authors: Paloma Puente, Diego Rodríguez-Losada, Raul López, Fernando Matía
Venue: Proceedings of the 3rd international workshop on Hybrid Artificial Intelligence Systems (2008)

Modeling environments with 3D feature based representations is a challenging issue in current mobile robotics. Fast and robust algorithms are required for applicability to navigation. We present an original and effective segmentation method that uses computer vision techniques and the residuals from plane fitting as measurements to generate a range image from 3D data acquired by a laser scanner. The extracted points of each region are converted into plane patches, spheres and cylinders by means of least-squares fitting.
O'browser: objective caml on browsers
Authors: Benjamin Canou, Vincent Balat, Emmanuel Chailloux
Venue: Proceedings of the 2008 ACM SIGPLAN workshop on ML (2008)

We present a way to run Objective Caml programs on a standard, unmodified web browser, with a compatible data representation and execution model, including concurrency. To achieve this, we designed a bytecode interpreter in JavaScript, as well as an implementation of the runtime library. Since the web browser does not provide the same interaction mechanisms as a typical Objective Caml environment, we provide an add-on to the standard library, enabling interaction with the web page. As a result, one can now build the client side of a web application with the standard Objective Caml compiler and run it on any modern web browser.
Cryptanalysis and Improvement of Practical Convertible Authenticated Encryption Schemes Using Self-Certified Public Keys
Authors: Zuhua Shao
Venue: Informatica (2006)

A convertible authenticated encryption scheme allows a specified recipient to recover and verify a message simultaneously. Moreover the recipient can prove the dishonesty of the sender to any third party if the sender repudiates her signature later. Recently, Lv et al. (2005) showed that the Wu et al.'s (1999) and the Huang et al.'s (2003) convertible authenticated encryption schemes cannot provide the semantic security of encrypted messages. Then they proposed a practical convertible authenticated encryption scheme using self-certified public keys, and extended it to one with message linkages when the signed message is large. In this paper, we show that the verifier can recover messages if given many triples of message, signature and ciphertext in the Lv et al.'s basic convertible authenticated encryption scheme. Finally we propose a new improvement to these schemes to overcome this weakness and to improve its efficiency.
WHURLE 2.0: Adaptive Learning Meets Web 2.0
Authors: Maram Meccawy, Peter Blanchfield, Helen Ashman, Tim Brailsford, Adam Moore
Venue: Proceedings of the 3rd European conference on Technology Enhanced Learning: Times of Convergence: Technologies Across Learning Contexts (2008)

The adoption of Adaptive Educational Hypermedia Systems into `real world' teaching has been poor so far. One of the reasons behind this is believed to be due to their architectural design failing to answer the overall needs of Web-enhanced learning. On the other hand, Web 2.0 emerging technologies are transforming the whole field of e-Learning into one known as "e-Learning 2.0". In this new generation, the learning process becomes a social and collaborative activity. Modern Learning Management Systems (LMS) provide the tools and the environment to enable this social learning. WHURLE 2.0 [1] was proposed as an adaptive LMS framework that allows adaptation functionality to be integrated with a modern LMS, by transforming its overall architecture into a distributed Web service. This paper takes the conceptual framework further by stressing its links with some of the Web 2.0 tools and showing this through an implementation that combines the Web 2.0 social aspects from Moodle as an LMS with the adaptation functionality.
Automatic Segmentation of Single and Multiple Neoplastic Hepatic Lesions in CT Images
Authors: Marcin Ciecholewski, Marek R. Ogiela
Venue: Proceedings of the 2nd international work-conference on Nature Inspired Problem-Solving Methods in Knowledge Engineering: Interplay Between Natural and Artificial Computation, Part II (2007)

This paper describes an automatic method for segmenting single and multiple neoplastic hepatic lesions in computed-tomography (CT) images. The structure of the liver is first segmented using the approximate contour model. Then, the appropriate histogram transformations are performed to enhance neoplastic focal lesions in CT images. To segment neoplastic lesions, images are processed using binary morphological filtration operators with the application of a parameterized mean defining the distribution of gray-levels of pixels in the image. Then, the edges of neoplastic lesions situated inside the liver contour are localized. To assess the suitability of the suggested method, experiments have been carried out for two types of tumors: hemangiomas and hepatomas. The experiments were conducted on 60 cases of various patients. Thirty CT images showed single and multiple focal hepatic neoplastic lesions, and the remaining 30 images contained no disease symptoms. Experimental results confirmed that the method is a useful tool supporting image diagnosis of the normal and abnormal liver. The proposed algorithm is 78.3% accurate.