ppxscal/embedding_network huggingface dataset:
On Minty vector variational-like inequality
Authors: Xiao Gang, Sanyang Liu
Venue: Computers Mathematics with Applications (2008)

This paper is devoted to the study of relationships between solutions of Minty vector variational-like inequalities (MVVLI) and solutions of vector optimization problems (VOP), as well as some relations between solutions of MVVLI and Stampacchia vector variational-like inequalities (SVVLI). Moreover, some relations between MVVLI and perturbed vector variational-like inequalities are established. Our results generalize some known results.
Gaining features in medicine using multimethod data-mining powerful techniques: a case study
Authors: Matej Mertik, Bojan Zalar
Venue: Proceedings of the 4th WSEAS International Conference on Applied Informatics and Communications (2004)

Widespread use of medical information systems and explosive growth of medical databases require traditional manual data analysis to be coupled with methods for efficient computer-assisted analysis. In this article we present a novel powerful toolkit for knowledge discovery in databases called Multimethod. The Multimethod toolkit dynamically combines some of the classical datamining methods and as such offers better results by generalization and representation of extracted knowledge in a final decision tree. We present the use of Multimethod toolkit in the medicine domain, more especially on the domain of complementary and alternative medicine in bronchial asthma. We demonstrate the importance of using the tool for the research purposes and discuss the outputs compared with some of the classical datamining methods in real application based on our experiences.
Perfecto: A systemc-based design-space exploration framework for dynamically reconfigurable architectures
Authors: Pao-Ann Hsiung, Chao-Sheng Lin, Chih-Feng Liao
Venue: ACM Transactions on Reconfigurable Technology and Systems (TRETS) (2008)

To cope with increasing demands for higher computational power and greater system flexibility, dynamically and partially reconfigurable logic has started to play an important role in embedded systems and systems-on-chip (SoC). However, when using traditional design methods and tools, it is difficult to estimate or analyze the performance impact of including such reconfigurable logic devices into a system design. In this work, we present a system-level framework, called Perfecto, which is able to perform rapid exploration of different reconfigurable design alternatives and to detect system performance bottlenecks. This framework is based on the popular IEEE standard system-level design language SystemC, which is supported by most EDA and ESL tools. Given an architecture model and an application model, Perfecto uses SystemC transaction-level models (TLMs) to simulate the system design alternatives automatically. Different hardware-software copartitioning, coscheduling, and placement algorithms can be embedded into the framework for analysis; thus, Perfecto can also be used to design the algorithms to be used in an operating system for reconfigurable systems. Applications to a simple illustration example and a network security system have shown how Perfecto helps a designer make intelligent partition decisions, optimize system performance, and evaluate task placements.
Performance modelling of asynchronous replica distribution technique on distributed database systems
Authors: M. Mat Deris, Z. Aznida, M. Y. Saman, W. A. Suryani, M. Zarina
Venue: International Journal of Computer Mathematics (2007)

In distributed database systems, replication is the most widely used approach to offering high data availability, increased fault tolerance, and improved scalability of the overall system. However, the primary concern with this technique is not only to provide high availability and reliability but also to boost the performance of data replication, i.e. to minimize response time and maximize throughput. We propose an analytical model for asynchronous replication technique (ART) by copying the data and replicating it to remote sites on a continuous basis. A remote copy of the data is created at a subsequent time after the primary copy is updated. The model is based on the M/G/1 queuing system by taking into account intersite communication between sites in the systems.
Fast Timing Update under the Effect of IR Drop
Authors: Muzhou Shao
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

As the IC feature size advances to nanometer, IR drop and power network noise produce significant effects on delay and signal integrity. Traditional timing analysis and closure should not be regarded as complete without taking into consideration voltage fluctuation on the PG network. Moreover, the interaction between the timing and IR drop makes this issue more complicated. At the gate level, timing and PG rail analysis need to perform several iterative loops until they come to converge. Whenever the supply voltage changes, the conventional approach of moment-based timing calculation needs to fully re-compute from scratch. However, the variation of the power supply does not affect signal nets and mainly changes the gate driving ability. Based on this observation, we propose a new method to efficiently calculate timing. This method can update timing from arithmetic operations based on results in the previous iteration rather than the time-consuming tree traversal.
Algorithms for quantum computation: discrete logarithms and factoring
Authors: P. W. Shor
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

A computer is generally considered to be a universal computational device; i.e., it is believed able to simulate any physical computational device with a cost in computation time of at most a polynomial factor: It is not clear whether this is still true when quantum mechanics is taken into consideration. Several researchers, starting with David Deutsch, have developed models for quantum mechanical computers and have investigated their computational properties. This paper gives Las Vegas algorithms for finding discrete logarithms and factoring integers on a quantum computer that take a number of steps which is polynomial in the input size, e.g., the number of digits of the integer to be factored. These two problems are generally considered hard on a classical computer and have been used as the basis of several proposed cryptosystems. We thus give the first examples of quantum cryptanalysis.
Effective Generation of Data Broadcast Schedules with Different Allocation Numbers for Multiple Wireless Channels
Authors: Song-Yi Yi, Seunghoon Nam, Sungwon Jung
Venue: IEEE Transactions on Knowledge and Data Engineering (2008)

Existing methods of scheduling data items over multiple wireless broadcast channels focus on the assignment of a data item to a channel. But data items are not allocated more than once per broadcast cycle to a single channel. Our scheme considers the numbers of copies of a data item that should be allocated in the context of the channel assignment problem, and aims to reduce the average data access time by allocating a popular data item more than once per cycle to the channel to which it is assigned. The number of times that each data item is allocated reflects its access probability. Simulation results show that our scheme reduces the average expected delay, especially when there are few channels.
A Look into the Future Impact of ICT on Our Lives
Authors: Luciano Floridi
Venue: The Information Society (2006)

This paper may be read as a sequel to a 1995 paper, published in this journal, in which I predicted what sort of transformations and problems were likely to affect the development of the Internet and our system of organized knowledge in the medium term. In this second attempt, I look at the future developments of information and communication technologies and try to estimate what their impact on our lives will be. The forecast is that, in information societies, the threshold between online and offline will soon disappear, and that once there is no difference, we shall become not cyborgs but rather inforgs, that is, connected informational organisms.
Towards a better collaboration of static and dynamic analyses for testing concurrent programs
Authors: Jun Chen, Steve MacDonald
Venue: Proceedings of the 6th workshop on Parallel and distributed systems: testing, analysis, and debugging (2008)

Testing concurrent programs remains a difficult task due to the non-deterministic nature of concurrent executions. Many approaches have been proposed to combine static and dynamic analysis to reduce the complexity of uncovering potential concurrency bugs. However, the existing collaboration schemes only provide a limited mechanism for exchanging relevant information between the two analyses. For example, alias information only flows from the static analysis module to the dynamic analysis module at the beginning of the dynamic analysis. Therefore, we cannot fully exploit the advantages of each type of analysis. Motivated by this observation, in this paper we present a new testing technique which enables a tighter collaboration between static analysis and dynamic analysis. In this collaboration scheme, static analysis and dynamic analysis interact iteratively throughout the whole testing process. Static analysis uses coarse-grained analysis to guide the dynamic analysis to concentrate on the relevant search space, while dynamic analysis collects concrete runtime information during the guided exploration. The runtime information provided by the dynamic analysis helps the static analysis to refine its coarse-grained analysis and provides better guidance on dynamic analysis. Currently, our implementation consists of a static analysis module based on Soot and a dynamic analysis module based on JPF (Java PathFinder).
Efficient Morse Decompositions of Vector Fields
Authors: Guoning Chen, Konstantin Mischaikow, Robert S. Laramee, Eugene Zhang
Venue: IEEE Transactions on Visualization and Computer Graphics (2008)

Existing topology-based vector field analysis techniques rely on the ability to extract the individual trajectories which are sensitive to noise and errors introduced by simulation and interpolation. This makes such vector field analysis unsuitable for rigorous interpretations. We advocate the use of Morse decompositions, which are robust with respect to perturbations, to encode the topological structures of a vector field in the form of a directed graph, called a Morse connection graph (MCG). While an MCG exists for every vector field, it need not be unique. Previous techniques for computing MCG's, while fast, are overly conservative and usually results in MCG's that are too coarse to be useful. To address this issue, we present a new technique for performing Morse decomposition based on the concept of tau-maps, which typically provides finer MCG's than existing techniques. Furthermore, the choice of tau provides a natural tradeoff between the fineness of the MCG's and the computational costs. We provide efficient implementations of Morse decomposition based on tau-maps, which include the use of forward and backward mapping techniques and an adaptive approach in constructing better approximations of the images of the triangles. Furthermore, we propose the use of spatial tau-maps in addition to the original temporal tau-maps.
Improving GridFTP transfers by means of a multiagent parallel file system
Authors: Alberto Sánchez, María S. Pérez, Pierre Gueant, Jesús Montes, Pilar Herrero, Toni Cortes
Venue: Multiagent and Grid Systems (2007)

Data transfer in a grid environment has become one critical activity in a large number of applications that require access to huge volumes of data. In these scenarios, characterized by large latencies, poor performance and complex dependencies, the use of approaches such as multiagents or parallel I/O can provide a great benefit. However, all the attempts to improve the performance of data transfer in grids should achieve the interoperability with already established data transfer schemes. GridFTP is one of the most known and used data grid transfer protocols. This paper describes MAPFS-DSI, a modification of the GridFTP server, based on a multiagent parallel file system. MAPFS-DSI increases the performance of data transfers, but keeping the interoperability with existing GridFTP servers.
A New Low Complexity Iterative Detection for Space-Time Bit-Interleaved Coded Modulation Schemes
Authors: Ying Li, Hongmei Xie, Xudong Guo, Xinmei Wang
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

To reduce the detection complexity of the space-time bit-interleaved coded modulation(ST-BICM) scheme, a turbo type iterative receiver structure consisting of a new group Gaussian approximation(GGA) algorithm and an a posteriori probability(APP) decoder is presented. When calculating the log-likelihood ratio(LLR) of the i-th transmitted symbol, the GGA algorithm first divide the N transmitted signals into two groups, a detecting group consisting of G signals with the i-th transmitted signal included, and an interfering group consisting of the other N-G signals. Taking the superposition of the N-G signals as a Gaussian random variable, the GGA algorithm implements the maximum a posteriori(MAP) detection to obtain the LLR of the signal transmitted from antenna i. At high SNR values or if the receiver has more than two replicas of each transmitted signal, the GGA detection exhibits a good performance as well as low decoding complexity.
Use of Haar wavelet transform based multiple template matching for analyses of speech voice
Authors: Shinji Karasawa, Hiroshi Sakuraba
Venue: Proceedings of the 2007 Euro American conference on Telematics and information systems (2007)

Technologies of wavelet transformation were used in JPEG2000 and those will be available for CODEC. Pivotal reminders for voice recognition were investigated by using multi-resolution of Haar wavelet representation (H-WR). Template of a phoneme differs from that of a syllable. Optimum accuracy of the feature depends on segmentation of template-matching (TM) analyses. 64 components of Haar wavelet coefficients (H-WC) for recognition of a phoneme are able to decrease to 15 components with lower frequency. Here, each set of data begins at peak value in each pitch. Sampling frequency is 10 kHz. The period of segment for a phoneme is 6.4msec. Segmentation of phoneme in speech can be checked by using the fact that ratio (r) between SWC (sum of absolute value of WC in a scale) becomes r=1, at a transition. SWC is available as a constituent in vector quantization for a syllable. Short syllables are decoded by means of 8 pieces of SWC, here the SWC was obtained from a set of data of 1024 pieces on a syllable (sampling frequency is 5 kHz, period of extraction for a syllable is 204.8msec).
Fermat Meets SWAC: Vandiver, the Lehmers, Computers, and Number Theory
Authors: Leo Corry
Venue: IEEE Annals of the History of Computing (2008)

This article describes the work of Harry Schultz Vandiver, Derrick Henry Lehmer, and Emma Lehmer on calculations related with proofs of Fermat's last theorem. This story sheds light on ideological and institutional aspects of activity in number theory in the US during the 20th century, and on the incursion of computer-assisted methods into pure fields of mathematical research.
Computer-generated conjectures(!) and proofs(!!) in combinatorial game theory (abstract only)
Authors: Doron Zeilberger, Thotsaporn "Aek" Thanatipanonda
Venue: ACM Communications in Computer Algebra (2008)

The rapidly growing activity of experimental mathematics is still, to a large extent, a straightforward (albeit far-reaching) extension of the usual mode of paper-and-pencil research, where the pencil just got so much quicker and sharper and the paper so much larger. In order to take full advantage of the great potential of computers, we should learn to kick some old habits, like trying to "understand" what is going on. If we humans can "understand" something, then it can't be very deep. Rather than try to understand mathematics, we should do our best to meta-understand it, by designing algorithms (and meta-algorithms!) for computers to do everything by themselves: generating data, of course, but then going on to formulate conjectures, followed by (fully automated!) proofs. We admit that our computers can't prove the Riemann Hypothesis yet, but they sure can prove some intriguing conjectures of Jeff Erickson about the game "Toads and Frogs". The only way our computers can prove these simply stated (i.e. "beautiful" to human eyes) conjectures, is by making many other "ugly" (to humans) conjectures, and then proving them simultaneously. The full details are available from www.math.rutgers.edu/~zeilberg/mamarim/mamarimhtml/tf1.html.
A Novel Personal Identity Verification Approach Using a Discrete Wavelet Transform of the ECG Signal
Authors: Chuang-Chien Chiu, Chou-Min Chuang, Chih-Yu Hsu
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

The purpose of this research is to develop a real time system for individual verification with the electrocardiogram (ECG) signal. The ECG signal varies from person to person and it can be used as a new biometric for individual verification. The discrete wavelet transform extract signal features by wavelet coefficients of one-lead ECG signal. Using the proposed approach on 35 normal subjects and 10 arrhythmia patients, 100% verification rate was obtained for normal subjects and 81% verification rate for arrhythmia patients. Furthermore, the performance of the ECG verification system was evaluated by the false acceptance rate (FAR) and false rejection rate (FRR). The FAR was 0.83% and FRR was 0.86% for a database containing only 35 normal subjects. When 10 arrhythmia patients were added into the database, the FAR became 12.50% and the FRR 5.11%. The experimental results demonstrate that the proposed system works very well for normal subjects.
A Simulator for a Mobile Peer-to-Peer Database Environment
Authors: Verena Kantere, Konstantina Palla, Kostas Patroumpas, Timos Sellis
Venue: Proceedings of the The Ninth International Conference on Mobile Data Management (2008)

We present a simulation environment that can be employed to study P2P mobile networks that are fast-evolving in both their topology and their content. This simulator implements a proposed P2P architecture based on Mobile Agent and Active Database technology and can be employed in order to build simulated mobile networks that are characterized by a diversity in peer needs, specifications and capabilities.
Parameterless Broadcasting in Static to Highly Mobile Wireless Ad Hoc, Sensor and Actuator Networks
Authors: Adnan Afsar Khan, Ivan Stojmenovic, Nejib Zaguia
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

In a broadcasting task, source node wants to send the same message to all the other nodes in the network. Existing solutions range from connected dominating set (CDS) based for static networks, to blind flooding for moderate mobility, to hyperflooding for highly mobile and frequently partitioned networks. The only existing protocol for all scenarios is based on some threshold parameters (which may be expensive to gather) to locally select between these three solution approaches. Here we propose a new protocol, which adjusts itself to any mobility scenario without using any parameter. Unlike existing methods for highly mobile scenarios, in proposed method, two nodes do not transmit every time they discover each other as new neighbors. Each node maintains a list of two hop neighbors by periodically exchanging ‘hello’ messages, and decides whether or not it is in CDS. Upon receipt of the first copy of message intended for broadcasting, it selects a waiting timeout and constructs two lists of neighbors: neighbors that received the same message and neighbors that did not receive it. Nodes not in CDS select longer timeouts than nodes in CDS. These lists are updated upon receipt of further copies of same packet. When timeout expires, node retransmits if the list of neighbors in need of message is nonempty. ‘Hello’ messages received while waiting, or after timeout expiration may revise all lists (and CDS status) and consequently the need to retransmit. This provides a seamless transition of protocol behavior from static to highly mobile scenarios. Our protocol is compared to existing solutions. It was shown to be superior to all of them in number of retransmissions and reliability.
A Novel Cell-Based Heuristic Method for Leakage Reduction in Multi-Million Gate VLSI Designs
Authors: Sandeep Gupta, Jaya Singh, Abhijit Roy
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

This paper presents a heuristic cell-based approach to reduce leakage power in multi-million gate design ASICs in 90nm/65nm processes by swapping low-Vt cells with high-Vt cells on less critical timing paths in the design. It uses heuristics to avoid frequent time-consuming full-design timing updates and has significant run-time improvement over currently available approaches. Unlike traditional approaches, proposed generic approach fits well in the design flow and works on any kind of design having mixture of all type of Vt cells available in the library. The proposed algorithm gives active leakage reduction of up to 64% with run time of 3-15 hours for multi - million gate designs.
Rectifying behavior of individual SnO2 nanowire by different metal electrode contacts
Authors: Meimei Chen, Xiaoxiang Xia, Zongli Wang, Yunlong Li, Junjie Li, Changzhi Gu
Venue: Microelectronic Engineering (2008)

SnO"2 nanowires (NWs) were synthesized by thermal evaporation and were characterized by scanning electron microscope (SEM), transmission electron microscope (TEM) and X-ray diffraction (XRD). Ti/Au and Pt electrode were made on an individual SnO"2 NW to study its electrical properties. Measurement result shows a clear rectification behavior for single SnO"2 NW with Pt and Ti/Au electrodes, and the related rectifying mechanism is discussed.
New magnetic force expressions of the system: filamentary circular coil-massive circular solenoid with rectangular cross section
Authors: Slobodan I. Babic, Cevdet Akyel
Venue: Proceedings of the 9th International Conference on Circuits (2005)

New and fast procedures for calculating the magnetic force between a thin circular filament coil and a massive circular solenoid with rectangular cross section in air are presented. These results are expressed in terms of the complete elliptical integrals of the first and second kind, Heumann's Lambda function and one term that has to be solved numerically. The Gaussian numerical integration is used. These new expressions are accurate and simple to apply for technical applications. Also, another comparative method based on an approximation of the massive solenoid by Maxwell coils is given. The paper discusses the computational cost and the accuracy. Results obtained by the two approaches are in excellent agreement.