ppxscal/embedding_network huggingface dataset:
Evaluation of search performance of bacterial evolutionary algorithm
Authors: K. Yamamoto, T. Yoshikawa, T. Furuhashi, T. Shinogi, S. Tsuruoka
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

The search performance of evolutionary algorithms (EAs) has been widely studied. Interactions between genes in a chromosome, called "epistasis", make the theoretical investigation difficult. The goal of this study is a mathematical analysis of the effects of bacterial mutation on a bacterial evolutionary algorithm (BEA). The NK-landscape problem is employed for the investigation of this analysis in this paper. The search ability of bacterial mutation is formulated and compared with those of conventional mutation operations. It is shown that the bacterial mutation surpasses conventional ones in search performance.
How to rank with few errors
Authors: Claire Kenyon-Mathieu, Warren Schudy
Venue: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007)

We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for Kemeny-Young rank aggregation.
A Real-Time Component-Oriented Middleware for Wireless Sensor and Actor Networks
Authors: J. Barbaran, M. Diaz, I. Esteve, D. Garrido, L. Llopis, B. Rubio
Venue: Proceedings of the First International Conference on Complex, Intelligent and Software Intensive Systems (2007)

Wireless Sensor and Actor Networks (WSANs) consti- tute an emerging and pervasive technology that is attract- ing increased interest for a wide range of applications. The increasing functionality of this kind of network makes it necessary to propose tools and methodologies to facili- tate software development. This paper proposes a middle- ware called MWSAN to provide a set of high level services for sensor and actor networks. The middleware meets the component-oriented paradigm and developers can config- ure it depending on the actor and sensor resources. It takes into account issues such as the network configuration, the quality of service (QoS) and the coordination among ac- tors. MWSAN is specified in UM-RTCOM, a component model oriented to real time systems adapted to WSANs that allows us to take into account real time requirements in the applications. Additionally, we present an implementation model based on RT Java for actors. In order to apply the proposed middleware we describe an example specified in UM-RTCOM and its RT Java implementation.
Learning causal networks from microarray data
Authors: Nasir Ahsan, Michael Bain, John Potter, Bruno Gaëta, Mark Temple, Ian Dawes
Venue: Proceedings of the 2006 workshop on Intelligent systems for bioinformatics - Volume 73 (2006)

We report on a new approach to modelling and identifying dependencies within a gene regulatory cycle. In particular, we aim to learn the structure of a causal network from gene expression microarray data. We model causality in two ways: by using conditional dependence assumptions to model the independence of different causes on a common effect; and by relying on time delays between cause and effect. Networks therefore incorporate both probabilistic and temporal aspects of regulation. We are thus able to deal with cyclic dependencies amongst genes, which is not possible in standard Bayesian networks. However, our model is kept deliberately simple to make it amenable for learning from microarray data, which typically contains a small number of samples for a large number of genes. We have developed a learning algorithm for this model which was implemented and experimentally validated against simulated data and on yeast cell cycle microarray time series data sets.
A trust-region method by active-set strategy for general nonlinear optimization
Authors: Ying Ji, Ke-Cun Zhang, Shao-Jian Qu, Ying Zhou
Venue: Computers Mathematics with Applications (2007)

The paper explores a trust-region active-set algorithm for general nonlinear optimization with nonlinear equality and inequality constraints. In this algorithm, an active-set strategy is used together with trust-region methods to compute the trial step. L"1 penalty functions are employed to obtain the global convergence. The global convergence of this algorithm is proved under standard conditions. The numerical tests show the efficiency of the proposed algorithm.
Study and realisation of a micromechanical relay for use in a harsh environment
Authors: F. Conseil, P. Derderian, M.-F. Ravat, D. Collard, L. Buchaillot
Venue: Proceedings of the Symposium on Design, Test, Integration and Packaging of MEMS/MOEMS (2003)

A novel out-of-plane actuated microrelay designed in order to be used in a harsh environment is reported. This microrelay consists in an Al/SiO/sub 2/ bimorph cantilever and a gold-to-gold electrical contact. This device switches through a combined electrostatic and thermal actuation. The manufacturing process allows the integration of these devices on standard IC (the Integrated circuit). An analytical model describing the combined electrical, thermal, and mechanical behavior of the cantilever beam is used to set appropriate geometrical parameters in order to improve reliability for use in a harsh environment. This paper presents the theory, the design, the fabrication process and the experimental results of this microrelay.
The Landscape of Service-Oriented Systems: A Research Perspective
Authors: Kostas Kontogiannis, Grace A. Lewis, Dennis B. Smith, Marin Litoiu, Hausi Muller, Stefan Schuster, Eleni Stroulia
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

Service orientation has been touted as one of the most important technologies for designing, implementing and deploying large scale service provision software systems. In this position paper we attempt to investigate an initial classification of challenge areas related to service orientation and service-oriented systems. We start by organizing the research issues related to service orientation in three general categories - Business, Engineering and Operations, plus a set of cross-cutting concerns across domain. We further propose the notion of Service Strategy as a binding model for these three categories. Finally, concluding this position paper, we outline a set of emerging opportunities to be used for further discussion.
Keyboards and covert channels
Authors: Gaurav Shah, Andres Molina, Matt Blaze
Venue: Proceedings of the 15th conference on USENIX Security Symposium - Volume 15 (2006)

This paper introduces JitterBugs, a class of inline interception mechanisms that covertly transmit data by perturbing the timing of input events likely to affect externally observable network traffic. JitterBugs positioned at input devices deep within the trusted environment (e.g., hidden in cables or connectors) can leak sensitive data without compromising the host or its software. In particular, we show a practical Keyboard JitterBug that solves the data exfiltration problem for keystroke loggers by leaking captured passwords through small variations in the precise times at which keyboard events are delivered to the host. Whenever an interactive communication application (such as SSH, Telnet, instant messaging, etc) is running, a receiver monitoring the host's network traffic can recover the leaked data, even when the session or link is encrypted. Our experiments suggest that simple Keyboard JitterBugs can be a practical technique for capturing and exfiltrating typed secrets under conventional OSes and interactive network applications, even when the receiver is many hops away on the Internet.
Lattice-ladder structured adaptive decorrelation filtering for co-channel speech separation
Authors: Kuan-Chich Yen
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

A lattice-ladder adaptive decorrelation filtering (ADF) algorithm is proposed with the aim of developing a more efficient co-channel speech separation system. It is shown that based on the joint forward and backward linear predictions, a lattice-ladder structure can be derived for ADF. Experimental results show that the proposed algorithm is effective in reducing cross-interference between co-channel speech sources and has better tracking ability on the variations in the acoustic environment compared to the original direct-form ADF algorithm.
Collaborative structuring: organizing document repositories effectively and efficiently
Authors: Harris Wu, Michael Gordon
Venue: Communications of the ACM (2007)

Improving how documents are managed and data is storedand exchanged in systems.
Service Management: An Interview with Alan Ganek
Authors: Dejan Milojicic
Venue: IEEE Distributed Systems Online (2007)

Service management represents the dawn of a new software era. The time when applications ran on a small computer somewhere in the corner is long gone. Today, services run over the whole Internet. They introduce a lot of opportunities, but also a lot of management problems. Dejan interviews Alan Ganek, the chief technology officer of IBM Tivoli Software, about these problems.
Professor Silicon and Professor Maestro-the perfect combination
Authors: B. L. Crynes
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

There is a growing evolution, if not a revolution, coming to engineering education. The classroom of the future is somewhat like today's, except that every student (up to several hundred) has a computer station or a docking port for his or her own computer. The live professor, Professor Maestro, is present just as in today's classroom. There are three important points that distinguish the classroom of the future: the professor is now focused on the actual learning experience of the students as opposed to dispensing of expertise; the student is focused upon the learning objectives and course content and not upon the technology computer games, etc.; and the combined Professors Maestro and Silicon (the computer) create nearly unlimited flexibility in approach to the subject matter and students' learning styles and needs. Basic course materials must be developed into modules to be utilized throughout the curriculum. When modules are prepared for sub topics of the basic or core subjects like chemistry, physics, mathematics and engineering sciences, these modules can be appropriately introduced throughout the entire engineering educational experience in support of the major engineering discipline subjects (mechanical or chemical or civil engineering, etc). With Professor Maestro focused on student learning, with full application of information technology to deliver modules of core and basic subjects in the classroom of the future, a significant change in engineering education can occur-a revolution in learning. 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
Reducing SoC Test Time and Test Power in Hierarchical Scan Test: Scan Architecture and Algorithms
Authors: V. R. Devanathan, C. P. Ravikumar, V. Kamakoti
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

A hierarchical or .divide-and-conquer. scan test methodology enables us to partition a large SoC into several partitions and perform Design-for-Testability (DFT) functions such as scan insertion, pattern generation, and pattern validation separately on individual partitions. Since the effort for DFT related tasks grows super-linearly with gate count, partitioning reduces the effort for DFT tasks. Further, test application can be divided into k + 1 modes, where k modes correspond to independent testing of the partitions and the (k+1)th mode corresponds to a .residual. (or daisy) mode where faults that are not covered by the individual modes are considered. In reality, however, the daisy mode can be a killer and wipe out the benefits of divide-and-conquer testing. This is especially true for partitions that do not have test wrappers. In this paper, we take up the challenge of reducing the overhead of daisy mode in divide-and-conquer testing. By a careful analysis of the interactions between partitions, additional test modes are introduced to increase the coverage of glue logic, at the same time making sure that the number of scan cells involved in these .intermediate daisy modes. are minimal. We refer to this version of hierarchical scan testing as .Quiet and Optimized Divideand- Conquer Scan.. Experimental results reveal that the proposed technique reduces the test time overhead of the conventional daisy mode by about 20X. In addition, the technique drastically reduces the switching activity in the daisy modes and hence reduces the test power.
An event-based method for microphone array speech enhancement
Authors: M. S. Brandstein
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

This paper presents the multi-channel multi-pulse (MCMP) algorithm for the enhancement of speech degraded by reverberations and additive noise. The enhanced speech is synthesized from a sequence of impulses exciting a linear predictive filter. The excitation signal is computed from a nonlinear process which uses impulse clustering of the multi-channel speech data to discriminate portions of the linear prediction residual produced by the desired speech signal from those due to multipath effects and uncorrelated noise. The MCMP algorithm is shown to be capable of identifying and attenuating reverberant portions of the speech signal as well as reducing the effects of additive noise.
Trace back techniques adapted to the surviving memory management in the M algorithm
Authors: E. Boutillon
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

A new architecture for survivor memory management in the M algorithm is presented. So far, classical implementations of the survivor memory management employ the register exchange procedure. The architecture presented here is based on the trace back procedure used in the Viterbi algorithm. Using a new pointer which indicates the number of the surviving path given by the sorting operation during the path metric updating operation, all the trace back techniques that have been proposed for the Viterbi algorithm can be employed for the M algorithm. This architecture is specially attractive for large values of M and L in which case the register exchange approach is impractical due to power consumption and to the area required for wiring. In addition, a combination of the register exchange and the trace back procedures is also presented. The combination of these algorithms reduces both the information to be stored and the processing time.
System- and application-level support for runtime hardware reconfiguration on SoC platforms
Authors: Dimitris Syrivelis, Spyros Lalis
Venue: Proceedings of the annual conference on USENIX '06 Annual Technical Conference (2006)

This paper discusses the design and implementation of a system-level mechanism and corresponding application-level support that enables programs running on a reconfigurable SoC to modify the underlying FPGA at runtime. Applications may request the addition and/or removal of softcore devices at any point in time. Requests are handled in a coordinated way via a separate user-level process that fetches the configuration bistream from an exernal server. System reconfiguration is implemented via a fast suspend-resume mechanism with support for dynamic softcore device address management to achieve flexible device placement on the reconfigurable fabric. Even though our approach does not rely on advanced (and expensive) hardware that supports dynamic partial reconfiguration, the obtained functionality is sufficient for a wide range of application scenarios.
Distributed Symbolic Computations
Authors: Dana Petcu
Venue: Proceedings of the Sixth International Symposium on Parallel and Distributed Computing (2007)

Symbolic computing is one of fastest growing areas of scientific computing. An overview of the state-of-the-art in symbolic computations on distributed architectures, in particular Web and Grid architectures, is presented. The background information, including typical application areas, is followed by a list of past and on-going projects involving symbolic computations on distributed computing environments. To illustrate in more details issues involved in porting computer algebra systems to the Grid, some case studies involving popular environments are presented.
Real-Time State Management in Mobile Peer-to-Peer File-Sharing Services
Authors: Fang Zhiyuan, Chen Xiaoyun, Tang Yong, Zhang Jingchun, Zhou Yu
Venue: Proceedings of the IEEE International Conference on Service-Oriented Computing and Applications (2007)

Resource control becomes a difficult task in mobile P2P networks which are different from wireline networks by the constraints given in mobile 2.5G/3G network and limited capacity of mobile devices. In this paper, we propose a novel Real-Time State Management (RTSM) resource control mechanism to share files efficiently in mobile peers. In order to implement the function of real-time state management, a state server is designed. In this architecture, state server collects real-time states from all mobile peers and employs improved Bittorrent block-select and address-select algorithm to instruct mobile peers controlling resource access. Simulation shows that in used of RTSM resource control mechanism, the burthen of mobile peers is highly decreased, and the average response time to mobile peers is within 180ms, and mobile peers can download a file within 45min, with probability, 90%. These prove that our RTSM method in mobile P2P network is feasible and effective.
A Context Awareness Architecture for Mobile Learning Based on Fuzzy Petri Nets
Authors: Jian Pan, Zhongdong Huang, Guohong Mao, Jinxiang Dong
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

The portability and immediate communication properties of mobile devices influence the learning processes in accessing resources and transferring data. The strength of mobile learning is the personalization and mobility; therefore it must support the availability of sensing contextual information about the learner and provide the learning content with mobile metadata. Based on Fuzzy Petri Nets, a context awareness architecture for mobile learning supporting English learning at anytime and anywhere is proposed in this paper. And then, learning object knowledge representation and reasoning under multi-constraints (contextual information) are discussed. Finally, an algorithm of Approximate Fuzzy Reasoning based on matrix operation is suggested. The example indicates that fuzzy reasoning process is simple and quick, and the efficiency of the reasoning is also improved due to the parallel operation ability of Petri Nets.
Bridging the High Performance Computing Gap: the OurGrid Experience
Authors: Francisco Brasileiro, Eliane Araujo, William Voorsluys, Milena Oliveira, Flavio Figueiredo
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

High performance computing is currently not affordable for those users that cannot rely on having a highly qualified computing support team. To cater for these users' needs we have proposed, implemented and deployed OurGrid. OurGrid is a peer-to-peer grid middleware that supports the automatic creation of large computational grids for the execution of embarrassingly parallel applications. It has been used to support the OurGrid Community - a public free-to-join grid that is in production since December 2004. In this paper we show how the OurGrid Community has been used to support the execution of a number of applications. Further we discuss the main benefits brought up by the system and the difficulties that have been faced by the system developers and the users and managers of the OurGrid Community.
Data Hiding Scheme for Medical Images
Authors: Raul Rodriguez-Colin, Feregrino-Uribe Claudia, Gershom de J. Trinidad-Blas
Venue: Proceedings of the 17th International Conference on Electronics, Communications and Computers (2007)

Digital image watermarking has been proposed as a method to enhance medical data security, confidentiality and integrity. Medical image watermarking requires extreme care when embedding additional data within the medical images because the additional information must not affect the image quality. Many of the exploration systems used for medical diagnosis are based on the medical study images. CR, MR and CT, obtain images that can be stored in digital formats such as (DICOM files) which are related with data of patients and information about the study. In this paper we present a watermarking scheme that combines data compression, encryption and watermarking techniques and image moment theory applied to radiological medical images. In this work we use DICOM data as a watermark to embed in medical images. Image quality is measured with metrics which are used in image processing such as PSNR and MSE. Our results show good accuracy in the watermark extraction process.
Dynamic application-layer protocol analysis for network intrusion detection
Authors: Holger Dreger, Anja Feldmann, Michael Mai, Vern Paxson, Robin Sommer
Venue: Proceedings of the 15th conference on USENIX Security Symposium - Volume 15 (2006)

Many network intrusion detection systems (NIDS) rely on protocol-specific analyzers to extract the higher-level semantic context from a traffic stream. To select the correct kind of analysis, traditional systems exclusively depend on well-known port numbers. However, based on our experience, increasingly significant portions of today's traffic are not classifiable by such a scheme. Yet for a NIDS, this traffic is very interesting, as a primary reason for not using a standard port is to evade security and policy enforcement monitoring. In this paper, we discuss the design and implementation of a NIDS extension to perform dynamic application-layer protocol analysis. For each connection, the system first identifies potential protocols in use and then activates appropriate analyzers to verify the decision and extract higher-level semantics. We demonstrate the power of our enhancement with three examples: reliable detection of applications not using their standard ports, payload inspection of FTP data transfers, and detection of IRC-based botnet clients and servers. Prototypes of our system currently run at the border of three large-scale operational networks. Due to its success, the bot-detection is already integrated into a dynamic inline blocking of production traffic at one of the sites.
Discrete finite variation: a new measure of smoothness for the design of wavelet basis
Authors: J. E. Odegard
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

A new method for measuring and designing a smooth wavelet basis which dispenses with the need for having a large number of zero moments of the wavelet is given. The method is based on minimizing the "discrete finite variation", and is a measure of the local "roughness" of a sampled version of the scaling function giving rise to a "visually smooth" wavelet basis. A smooth wavelet basis is deemed to be important for several applications and in particular for image compression where the goal is to limit spurious artifacts due to non-smooth basis functions in the presence of quantization of the individual subbands. The definition of smoothness introduced here gives rise to new algorithms for designing smooth wavelet basis with only one vanishing moment leaving free parameters, otherwise used for setting moments to zero, for optimization.