ppxscal/embedding_network huggingface dataset:
Respiratory Noise Correction Using Phase Information
Authors: Hu Cheng, Yu Li
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

A novel method called RCP is proposed to correct for the respiratory noise in functional MRI using phase information of the complex image data. The hypothesis is that the information of the respiration-induced signal change is embedded in the phase variation, which can be measured readily. Respiratory noise is significantly reduced after the correction. The new method is compared with RETROICOR and showed comparable results. RCP is superior to RETROICOR in case the respiration deviates from being periodic. This technique is useful for correcting respiratory noise from abnormal breathing.
Security Threats on EPC Based RFID Systems
Authors: Joaquin Garcia-Alfaro, Michel Barbeau, Evangelos Kranakis
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

We present an evaluation of threats on the Radio Frequency IDentification (RFID) system of the Electronic Product Code (EPC) Network architecture. We analyze attacks on the communication channel between RFID components due to the use of an insecure wireless channel. We analyze the threats according to the methodology proposed by the European Telecommunications Standards Institute (ETSI), and we rank them in order of relevance.
Product range spaces, sensitive sampling, and derandomization
Authors: H. Bronnimann, B. Chazelle
Venue: Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science (1993)

We introduce the concept of a sensitive /spl epsi/-approximation, and use it to derive a more efficient algorithm for computing /spl epsi/-nets. We define and investigate product range spaces, for which we establish sampling theorems analogous to the standard finite VC-dimensional case. This generalizes and simplifies results from previous works. We derive a simpler optimal deterministic convex hull algorithm, and by extending the method to the intersection of a set of balls with the same radius, we obtain an O(nlog/sup 3/ n) deterministic algorithm for computing the diameter of an n-point set in 3-dimensional space.
Performance Evaluation for Scheduling Algorithms in WiMAX Network
Authors: Jin-Cherng Lin, Chun-Lun Chou, Cheng-Hsiung Liu
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

In the last years, demand for high-speed internet access and multimedia service has increased greatly. The IEEE 802.16 Working Group on Broadband Wireless Access is developing the IEEE 802.16 standards for Wireless Metropolitan Area Networks. IEEE 802.16 aims at providing broadband wireless last-mile access in a Metropolitan Area Network, easy deployment, high speed data rate and large spanning area. WiMAX also support quality of service architecture include priority scheduling and queuing for bandwidth allocation to support our system more efficient. Therefore, we have an idea to implement some scheduling schemes on WiMAX system in NS2 to analysis in uplink and downlink direction to get better performance. By simulation results, it can show the performance of different scheduling schemes clearly, and which one suit for different specific environment. Finally, we can support an efficient Queuing scheduling theory on dynamic bandwidth allocation to get better performance for the IEEE 802.16 system.
Finding strongly connected components in parallel using O(log2n) reachability queries
Authors: Warren Schudy
Venue: Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures (2008)

We give a randomized (Las-Vegas) parallel algorithm for computing strongly connected components of a graph with n vertices and m edges. The runtime is dominated by O(log2n) multi-source parallel reachability queries; i.e. O(log2n) calls to a subroutine that computes the union of the descendants of a given set of vertices in a given digraph. Our algorithm also topologically sorts the strongly connected components. Using Ullman and Yannakakis's [22] techniques for the reachability subroutine gives our algorithm runtime Õ(t) using mn/t2 processors for any (n2/m)1/3 ≤= t ≤= n. On sparse graphs, this improves the number of processors needed to compute strongly connected components and topological sort within time n1/3 ≤= t ≤= n from the previously best known (n/t)3 [20] to (n/t)2.
Vertical devices of self-assembled hybrid organic/inorganic monolayers based on tungsten polyoxometalates
Authors: E. Makarona, E. Kapetanakis, D. M. Velessiotis, A. Douvas, P. Argitis, P. Normand, T. Gotszalk, M. Woszczyna, N. Glezos
Venue: Microelectronic Engineering (2008)

In this work, metal-insulator-semiconductor (MIS) devices containing self-assembled monolayers (SAM) of tungsten polyoxometalates (POMs) have been fabricated with a CMOS-compatible process. Electrical characterization in terms of C-V and I-V measurements has followed, and the resulting data have been extensively studied in order to assess the charge transport phenomena in such structures. STM measurements on the SAMs have completed the characterization and further substantiated our view of the possible electron transport mechanisms involved, as well as the charge confinement properties of POM monolayers that could be exploited in viable molecular electronic devices.
Graph relations, clique divergence and surface triangulations
Authors: F. Larrión, V. Neumann-Lara, M. A. Pizaña
Venue: Journal of Graph Theory (2006)

This work has two aims: first, we introduce a powerful technique for proving clique divergence when the graph satisfies a certain symmetry condition. Second, we prove that each closed surface admits a clique divergent triangulation. By definition, a graph is clique divergent if the orders of its iterated clique graphs tend to infinity, and the clique graph of a graph is the intersection graph of its maximal complete subgraphs. &copy; 2005 Wiley Periodicals, Inc. J Graph Theory
Leakage current optimization techniques during test based on don't care bits assignment
Authors: Wei Wang, Yu Hu, Yin-He Han, Xiao-Wei Li, You-Sheng Zhang
Venue: Journal of Computer Science and Technology (2007)

It is a well-known fact that test power consumption may exceed that during functional operation. Leakage power dissipation caused by leakage current in Complementary Metal-Oxide-Semiconductor (CMOS) circuits during test has become a significant part of the total power dissipation. Hence, it is important to reduce leakage power to prolong battery life in portable systems which employ periodic self-test, to increase test reliability and to reduce test cost. This paper analyzes leakage current and presents a kind of leakage current simulator based on the transistor stacking effect. Using it, we propose techniques based on don't care bits (denoted by Xs) in test vectors to optimize leakage current in integrated circuit (IC) test by genetic algorithm. The techniques identify a set of don't care inputs in given test vectors and reassign specified logic values to the X inputs by the genetic algorithm to get minimum leakage vector (MLV). Experimental results indicate that the techniques can effectually optimize leakage current of combinational circuits and sequential circuits during test while maintaining high fault coverage.
Grammar-based whitebox fuzzing
Authors: Patrice Godefroid, Adam Kiezun, Michael Y. Levin
Venue: ACM SIGPLAN Notices (2008)

Whitebox fuzzing is a form of automatic dynamic test generation, based on symbolic execution and constraint solving, designed for security testing of large applications. Unfortunately, the current effectiveness of whitebox fuzzing is limited when testing applications with highly-structured inputs, such as compilers and interpreters. These applications process their inputs in stages, such as lexing, parsing and evaluation. Due to the enormous number of control paths in early processing stages, whitebox fuzzing rarely reaches parts of the application beyond those first stages. In this paper, we study how to enhance whitebox fuzzing of complex structured-input applications with a grammar-based specification of their valid inputs. We present a novel dynamic test generation algorithm where symbolic execution directly generates grammar-based constraints whose satisfiability is checked using a custom grammar-based constraint solver. We have implemented this algorithm and evaluated it on a large security-critical application, the JavaScript interpreter of Internet Explorer 7 (IE7). Results of our experiments show that grammar-based whitebox fuzzing explores deeper program paths and avoids dead-ends due to non-parsable inputs. Compared to regular whitebox fuzzing, grammar-based whitebox fuzzing increased coverage of the code generation module of the IE7 JavaScript interpreter from 53% to 81% while using three times fewer tests.
On efficient band matrix arithmetic
Authors: W. Eberly
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

An efficient parallel Las Vegas algorithm is presented for computation of the determinant of a non-singular band matrix and for the solution of a system of linear equations with a band matrix as coefficient matrix. The algorithm can be implemented using time polylogarithmic in n with O(nm/sup omega -1/) processors, in order to process an input matrix with order n and band width m, provided that n*n matrices can be multiplied in logarithmic time with O(n/sup omega /) processors. If asymptotically efficient matrix multiplication is used ( omega
Application layer multicast techniques in grid environments
Authors: Rafael Moreno-Vozmediano
Venue: Proceedings of the 2007 Euro American conference on Telematics and information systems (2007)

Resource and service discovery, data transfer or replica management, are some examples of basic operations of a grid which can gain efficiency by using multicast transmission techniques. However, the sparse deployment of IP multicast is the internet today is a major limitation for exploiting this communication paradigm in grid environments. Over the last few years, Application Layer Multicast has emerged as a novel and powerful technique for providing one-to-many and many-to-many data transfer over networks without infrastructure support for IP multicast. In this approach multicast functionality is implemented at the end-host systems instead of network routers, and it is based on the construction of a logical overlay over the underlying network topology. Application layer multicast techniques have been used mainly for real-time multimedia applications (such as Internet telephony, video streaming services, videoconferencing, etc.), and P2P applications (like data delivery and dissemination, etc.). However, the application of these techniques to grid environments has not been deeply analyzed.
Extracting Frame-Semantics Knowledge using Lattice Theory
Authors: Francisco J. Valverde-Albacete
Venue: Journal of Logic and Computation (2008)

In this article, we introduce a new representation based on lattice theory for lexical data from a lexical-database embodying the frame-semantic approach to language description, FrameNet. We present proof of the abundance of Concept Lattices as proposed in Formal Concept Analysis both in the theory of frames and in its present-day incarnation, the FrameNet resource, by constructing several types of these. We further argue for the adequacy of such lattices in representing linguistic data with contributions that range from data-visualization to the fine-tuning of some frame-theoretical concepts. We argue finally that FrameNet is better thought of as being a lexical resource rather than an ontology, but we make the case throughout the article for Concept Lattices being a linguistically adequate, formally effective intermediate representations from which knowledge representation languages may draw knowledge-rich, linguistic facts from FrameNet at their convenience.
A theory of learning simple concepts under simple distributions and average case complexity for the universal distribution
Authors: M. Li
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

It is pointed out that in L.G. Valiant's learning model (Commun. ACM, vol.27, p.1134-42, 1984) many concepts turn out to be too hard to learn, whereas in practice, almost nothing we care to learn appears to be not learnable. To model the intuitive notion of learning more closely, it is assumed that learning happens under an arbitrary distribution, rather than under an arbitrary simple distribution, as assumed by Valiant. A distribution is called simple if it is dominated by a semicomputable distribution. A general theory of learning under simple distributions is developed. In particular, it is shown that one can learn under all simple distributions if one can learn under one fixed simple distribution, called the universal distribution. Interesting learning algorithms and several quite general new learnable classes are presented. It is shown that for essentially all algorithms, if the inputs are distributed according to the universal distribution, then the average-case complexity is of the same order of magnitude as the worst-case complexity.
Racer: effective race detection using aspectj
Authors: Eric Bodden, Klaus Havelund
Venue: Proceedings of the 2008 international symposium on Software testing and analysis (2008)

Programming errors occur frequently in large software systems, and even more so if these systems are concurrent. In the past researchers have developed specialized programs to aid programmers detecting concurrent programming errors such as deadlocks, livelocks, starvation and data races. In this work we propose a language extension to the aspect-oriented programming language AspectJ, in the form of three new pointcuts, lock(), unlock() and maybeShared(). These pointcuts allow programmers to monitor program events where locks are granted or handed back, and where values are accessed that may be shared amongst multiple Java threads. We decide thread-locality using a static thread-local objects analysis developed by others. Using the three new primitive pointcuts, researchers can directly implement efficient monitoring algorithms to detect concurrent programming errors online. As an example, we expose a new algorithm which we call Racer, an adoption of the well-known Eraser algorithm to the memory model of Java. We implemented the new pointcuts as an extension to the AspectBench Compiler, implemented the Racer algorithm using this language extension and then applied the algorithm to the NASA K9 Rover Executive. Our experiments proved our implementation very effective. In the Rover Executive Racer finds 70 data races. Only one of these races was previously known. We further applied the algorithm to two other multi-threaded programs written by Computer Science researchers, in which we found races as well.
An impedance-based approach to predict the state-of-charge for carbon-based supercapacitors
Authors: Zhongxue Li, Jie Chen
Venue: Microelectronic Engineering (2008)

The impedance behavior of supercapacitors is not only a key issue for the parameterize modeling of the supercapacitor, but also an important factor for the design processes of an intelligent energy-management system which monitors the state of the supercapacitor and predicts its performance. In this paper, a simple equivalent circuit model and convolution algorithm based on impedance analysis were presented to assess state-of-charge, terminal voltage and charge/discharge capability of supercapacitors. Furthermore, an impedance function based on the equivalent impedance model was established to simulate the dynamic performance of a supercapacitor. The results can be used to control the reliable prediction of supercapacitors performance in electric vehicles, hybrid electric vehicles, fuel cell vehicles and classical automotive applications.
Quality assessment of gene selection in microarray data
Authors: C. H. Park, M. Jeon, P. Pardalos, H. Park
Venue: Optimization Methods Software (2007)

In microarray data, gene selection can make data analysis efficient and biological interpretations of the selected genes can be very useful. However, microarray data have typically several thousands of genes but only tens of samples, referred to as a small sample-size problem. In this paper, we discuss some problems on gene selection that can occur owing to a small sample size: whether gene selection relying on the extremely small number of samples is reliable and meaningful. Experimental comparisons of well-known three gene selection methods show that classification performances can be very sensitive to training samples and preprocessing steps. We also measure consistency in gene ranking under the changes of training samples or different selection criteria.
Study and realisation of the PWM control of the three-level NPC inverter application for asynchronous machine
Authors: H. Denoun, M. Zaouia, M. Rachek, R. Khaldi, M. Bouheraoua, R. Kachnoura
Venue: Proceedings of the 9th International Conference on Circuits (2005)

In this paper, study and realisation of the PWM Control of the three-level NPC voltage source inverter is presented. The proposed PWM strategy is triangulo - sinusoidal strategy. This structure allows us to have high voltage and great power and it is shown that it improves the out put voltage quality. Experimental results of the inverter feeding the asynchronous machine show tat the proposed command is very effective.
Implementation and performance analysis for the multimedia home network based on IP over IEEE1394
Authors: Tak-Goa Tsuei, Kun-Chang Chen, Han-Chieh Chao
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

To utilize the features of the IEEE 1394 protocol, a new multimedia home network is presented to facilitate the ever-popular broadband network and multimedia applications. In this paper, we also design some experiments and use two kinds of operating systems to test the ability of IP packets over IEEE 1394. The performance of both IPv4 and IPv6 over IEEE 1394 are quite satisfactory.
WSPE: a peer-to-peer programming environment for grid-unaware applications
Authors: Romulo B. Rosinha, Cláudio F. R. Geyer, Patrícia Kayser Vargas
Venue: Proceedings of the 5th international workshop on Middleware for grid computing: held at the ACM/IFIP/USENIX 8th International Middleware Conference (2007)

Grid programming environments are tools designed to isolate users from issues like heterogeneity, scalability, and adaptability, thus simplifying the use of Grid infrastructure. This paper presents WSPE, a Grid programming environment for Grid-unaware applications. WSPE consists of a simple programming interface and a fully decentralized runtime system following a peer-to-peer organization. WSPE's runtime system employs a new scheduling mechanism, called Round Stealing, inspired on the idea of work stealing. The main focus of this work is to research methods to achieve efficient execution of parallel applications in a Grid computing infrastructure. By simulation, we show that our scheduling mechanism outperforms a more traditional mechanism, in a Grid environment. We also demonstrate how an appropriate choice for a network overlay mechanism can further improve execution efficiency.
Similarity solutions of a MHD boundary-layer flow of a non-Newtonian fluid past a continuous moving surface
Authors: M. Benlahcen, A. Hakim, M. Guedda, Z. Mahani
Venue: Proceedings of the 12th WSEAS International Conference on Applied Mathematics (2007)

The present paper deals with a theoretical and numerical analysis of similarity solutions of the two-dimensional boundary-layer flow of a power-law non-Newtonian fluid past a permeable surface in the presence of a magnitic field B(x) applied perpendiculaire to the surface. The magnetic field B is assumed to be proportional to xm-1/2, where x is the coordinate along the plate measured from the leading edge and m is a constant. The problem depends on the power law exponent m, the power-law index, n, and the magnetic parameter M or the Stewart number. It is shown, under certain circumstance, that the problem has an infinite number of solutions.
CAKES-NEGO: Causal knowledge-based expert system for B2B negotiation
Authors: Kun-Chang Lee, Soonjae Kwon
Venue: Expert Systems with Applications: An International Journal (2008)

As the advent of the Internet, B2B negotiation process on the Internet has been given attention from both researchers and practitioners. Therefore, B2B ecommerce decision making will be a challenge for organizations in the foreseeable future. Some literature shows that important issues to reduce uncertainty in the development of long-term relationships among B2B commerce partners. In this sense, this paper proposes a new negotiation support system to incorporate causal relationships of negotiation terms in the process of B2B negotiation, on the basis of a cognitive map. The proposed a CAKES-NEGO (CAusal Knowledge-driven Expert System) suggests that causal relationships of negotiation terms could be explicitly represented by using the cognitive map as knowledge representation vehicle as well as inference engine. Cognitive maps can illustrate causal relationships among the factors describing a given object and/or problem, and it can also describe experts' tacit knowledge about a certain object. A fuzzy cognitive map (FCM) is an extension of a cognitive map with the additional capability of representing feedback through weighted causal links. FCM, a fuzzy signed digraph with causal relationships between concept variables found in a specific application domain, is used for the causal knowledge acquisition. The objectives of this paper are to (1) suggest a fuzzy cognitive mapping based expert system that support decision process of decision makers and (2) apply it to the illustrative examples, which are B2B negotiation problems, to show the validity of our proposed system. In addition, statistical tests proved that the proposed negotiation mechanism could improve decision performance significantly in B2B negotiations.
Configuration of anchorage holes affects cemented fixation of the acetabular component in total hip replacement - An in vitro study
Authors: Rajshree Mootanah, Paul Jarrett, Paul Ingle, Kevin Cheah, John K. Dowell, Julia C. Shelton
Venue: Technology and Health Care (2008)

Although surgical fixation techniques are major contributing factors to the survivorship of total hip replacements, they vary considerably among orthopaedic surgeons. We investigated the effect of the following configuration of anchorage holes on the stability of acetabular component fixation: 3 &times; 12 mm, 3 &times; 6 mm, 6 &times; 6 mm, and 12 &times; 6 mm. The reconstructed acetabulae were tested to torque failure, whilst being subjected to a compressive load of 2.1 KN. Higher torque to failure values were obtained for specimens with three 12 mm anchorage holes, compared with six or more 6 mm anchorage holes and were in line with our computer simulation results. We propose that the longevity of cemented total hip replacements could be improved by drilling a few large anchorage holes.