ppxscal/embedding_network huggingface dataset:
A study of electronic interface for MEMS Variable Optical Attenuator (VOA)
Authors: H. Cai, C. W. Chan, C. S. Thian, X. M. Zhang, C. Lu
Venue: Proceedings of the Symposium on Design, Test, Integration and Packaging of MEMS/MOEMS (2003)

A digital electronics control system design for a Microelectromechanical System (MEMS) Variable Optical Attenuator (VOA) is studied. This MEMS VOA is based on applying voltage to position a moving micro-mirror to control the optical power levels. The digital control system reported in this paper is implemented to operate the MEMS VOA. Here, by use of the proportional integral (PI) controlled system, each VOA module implements the functions as an optical power regulator or optical power equalizer. Moreover, this control system ensures the device with leading performance, stability, reliability and speed, but also fast dynamic response. A more attraction of this electronic control system is its programmability.
Pattern mining across massive biological networks for functional discovery
Authors: Ting Chen
Venue:  (2006)

With rapidly accumulated biological networks, it is of great importance to retrieve information from these networks. While most existing network analysis methods focus on the analysis of a single biological network that only provides static descriptions of the network features, algorithms capable of integrating massive biological networks and providing information on network dynamics are highly desirable. This thesis proposes a series of algorithms to identify patterns (connected subgraphs) across multiple biological networks to discover biologically meaningful modules. CODENSE is a novel algorithm to mine COherent and DENSE subgraphs across massive biological networks. In CODENSE, a new algorithm MODES is developed to mine overlapping dense subgraphs in a single network. CODENSE is scalable in the number and the size of the input graphs, flexible in mining either weighted or unweighted graphs, and adjustable in terms of exact or approximate pattern mining. The experimental study on 39 yeast microarray datasets demonstrates that CODENSE can discover the frequent dense subgraph patterns from multiple biological networks efficiently and effectively. Network biclustering algorithm, NETBICLUSTER, identifies condition specific activation of network modules from a large number of biological networks. The NETBICLUSTER algorithm can not only identifies network modules corresponding to particular biological processes, but also provides network dynamics information such as condition-specific activation and pathway cross-talking. Applying NETBICLUSTER to 97 mouse gene co-expression networks derived from microarray datasets, we discovered a large number of condition-specific network modules. As an application study, we applied NETBICLUSTER on 32 cancer datasets and 17 control datasets to identify network signatures for cancer. We demonstrated that NETBICLUSTER was able to find network modules related to cancer. Transcriptional study on these network signatures showed potential in clarifying regulatory mechanisms in cancer. Although finding biological meaningful network modules from large scale, noisy and heterogeneous biological networks is still a challenging problem, the success of CODENSE and NETBICLUSTER algorithm suggests that pattern mining strategy will help solve this problem and thus help biologists understand the functioning of cellular systems.
Toward Automatic Concurrent Debugging Via Minimal Program Mutant Generation with AspectJ
Authors: Shady Copty, Shmuel Ur
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

Debugging is one of the most time-consuming activities in program design. Work on automatic debugging has received a great deal of attention and there are a number of symposiums dedicated to this field. Automatic debugging is usually invoked when a test fails in one situation, but succeeds in another. For example, a test fails in one version of the program (or scheduler), but succeeds in another. Automatic debugging searches for the smallest difference that causes the failure. This is very useful when working to identify and fix the root cause of the bug. A new testing method instruments concurrent programs with schedule-modifying instructions to reveal concurrent bugs. This method is designed to increase the probability of concurrent bugs (such as races, deadlocks) appearing. This paper discusses integrating this new testing technology with automatic debugging. Instead of just showing that a bug exists, we can pinpoint its location by finding the minimal set of instrumentations that reveal the bug. In addition to explaining a methodology for this integration, we show an AspectJ-based implementation. We discuss the implementation in detail as it both demonstrates the advantage of the adaptability of open source tools and how our specific change can be used for other testing tools.
A new scalable DSP architecture for system on chip (SoC) domains
Authors: M. H. Weiss
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

The ongoing advances in semiconductor technology are the enabler for complete system on chip (SoC) solutions. In this SoC domain digital signal processors (DSPs) are employed to carry out software driven digital signal processing tasks. Although DSPs could still be modified in the SoC domain, they are mainly employed as fixed DSP cores. Possible adaptations to the embedding system cannot be carried out. Thus, our work is targeted to design expandable DSP architectures. To achieve this expandability, we designed a sliced DSP architecture. Here, the number of slices can be adapted towards the system's needs. Specific system requirements can be achieved by adding dedicated datapaths to these slices. With this approach one magnitude of order in performance boost can be achieved, which creates new demands for I/O processing. Thus, within our DSP architecture we integrated a dedicated I/O processor. We present this new scalable DSP architecture, tools to map algorithms onto this DSP architecture, and the concept of our new I/O controller. These technologies allow one to easily adapt this DSP architecture to different system requirements.
Samba and windows NT security interoperability
Authors: Luke Kenneth Casson Leighton
Venue: Proceedings of the 3rd conference on Large Installation System Administration of Windows NT - Volume 3 (2000)

Samba provides Windows NT File, Print and Login compatibility for Unix. Starting life in 1991 as Server 0.1 with 2,000 lines of code, it now consists of just over 300,000, providing full Windows NT Domain integration - a project that began in August 1997 and is still in progress. With the introduction of Windows 2000 (and even with Service Pack 4 for Windows NT 4.0), developers of Samba have had to address several issues related to the interoperability with Windows NT/2000 clients. This paper presents the technical security issues confronted by Samba developers during further implementation of the Windows NT 4.0 domain control protocol.
Heavy Ion Test Results in a CMOS triple Voting Register for a High-Energy Physics Experiment
Authors: X. Cano, S. Bota, R. Graciani, D. Gascon, A. Herms, A. Comerma, J. Segura, L. Garrido
Venue: Proceedings of the 13th IEEE International On-Line Testing Symposium (2007)

A heavy ion radiation test has been performed to evaluate the SEU sensitivity on a mixed-mode ASIC. We present the results obtained when the Triple Voting Registers used in the digital block of the ASIC are irradiated with heavy ions.
Enabling GTK+ and Gnome for the blind
Authors: Paolo Molaro
Venue: Proceedings of the 3rd annual conference on Atlanta Linux Showcase - Volume 3 (1999)

Graphical user interfaces are a challenge for blind people to use because a bit-mapped display is not easily and effectively mapped to non-visual interfaces. However working at the toolkit level it's possible to have access to the application internals and to provide a satisfactory auditory and braille interface. The flexibility of the object model of the Gtk+ graphical library allows the development of an (application independent) module (GSpeech) that enables the blind to use most of the Gtk+ and Gnome applications. Programmability and application-specific support can further expand the usability of such applications. Additionally, with the use of auditory icons we try to give the visually-impaired some of the benefits that GUIs give to sighted people.
Globus Monitoring and Discovery Service and SensorML for Grid Sensor Networks
Authors: Giovanni Aloisio, Dario Conte, Cosimo Elefante, Gian Paolo Marra, Giangiuseppe Mastrantonio, Gianvito Quarta
Venue: Proceedings of the 15th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2006)

This paper describes an approach based on Globus toolkit for developing grid sensor networks. In fact, the Globus Monitoring and Discovery Service is used to integrate sensor networks in Grid environments by means of the design of an information structure based on Sensor Modeling Language (SensorML). A case study is also presented in order to provide some relevant details about our approach and to verify the concrete applicability of the proposed methodology.
Nonblocking Operation of Asymmetrical Clos Networks
Authors: Fotios K. Liotopoulos, Suresh Chalasani
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 01 (1994)

In this paper, we study the nonblocking operation of asymmetrical three-stage Clos networks. We consider a control algorithm for operating the. asymmetrical Clos networks in the nonblocking mode. We derive sufficient conditions under which these networks are nonblocking for this control algorithm. Further, we provide results on the number of faults tolerated by the algorithm in the nonblocking mode of operation. We next design a different control algorithm for nonblocking operation of asymmetrical Clos networks. Using simulation results, the new control algorithm is shown to perform better than the previous one in terms of network utilization, blocking probability and fault-tolerance.
Scalable techniques for the application of machine learning to large datasets
Authors: Edward Y. Chang
Venue:  (2006)

Concept learning finds application in diverse domains like image retrieval, protein/gene classification and face recognition. Kernel based techniques like support vector machines (SVMs) have become increasingly popular due to their strong theoretical foundations and remarkable empirical performance over diverse data domains. The widespread application of SVMs on real-world datasets, however, has lagged due to issues arising from the scalability of the training and classification stages. In this thesis, we propose solutions for rapid concept-learning and retrieval of the top-k set of relevant instances. Our approach reduces the training time of SVMs in the multi-category scenario by intelligently pruning training instances. Our retrieval solution naturally extends to the active learning scenario where the most ambiguously labeled instances are of interest. We also develop an approach for speeding up nearest neighbor based classification which continues to be popular and is widely used for many real-world classification tasks.
Application of Content-Based Network for Sensor Data Distribution System
Authors: Hideya Ochiai, Zhiyong Wang, Ryo Oguchi, Tetsuhiro Sugiyama, Yusuke Sakamoto, Shinichi Ishida, Hiroshi Esaki
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet Workshops (2007)

This paper proposes and evaluates a new sensor data distribution system, based on the content based network technology. This system is an overlay XML-based content-based routing system over the plain unicast IP network. As the application of the prototype system, we have selected Live E! project, whose object is collecting the weather information from various weather stations and distributing these digital data to the appropriate receiver nodes using the XML-based content-based multicast service. We have designed (1) the representation format of sensor information with XML, (2) content-based multicast routing algorithm using XPath. We have implemented the proposed system for its technical and functional validation.
Multiple-Phase Collective I/O Technique for Improving Data Access Locality
Authors: David E. Singh, Florin Isaila, Alejandro Calderon, Felix Garcia, Jesus Carretero
Venue: Proceedings of the 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (2007)

This paper presents Multiple-Phase Collective I/O, a novel collective I/O technique for distributed memory multi-processors. Multiple-Phase Collective I/O is a refinement of two-phase collective I/O technique. The communication phase is structured into several steps, which progressively increase the locality of the data to be written to a file system. Besides the description ofMultiple-Phase Collective I/O, our paper addresses two additional objectives. First, we target to improve the efficiency of the Sulphur Transport Eurelian Model 2 (STEM-II) application. STEM-II is an air quality model that simulates transport, chemical transformations, emission and deposition processes in a unified framework. Due to the large amount of processed data, I/O becomes a critical factor for the application performance. Multiple-Phase Collective I/O, considerably enhances the performance of the I/O stage in particular and, consequently, of the whole application in general. Second objective consists of evaluating and comparing the performance of Multiple-Phase Collective I/O with that of other well known parallel I/O techniques.
Computational studies of gene expression and sequence data in yeast
Authors: Steven Skiena
Venue:  (2006)

Advances in genome sequencing and gene expression measurement technologies in recent years have made large amounts of sequence and expression data available for computational analysis. In the present study, the candidate uses computational and statistical mechanisms to analyze sequence and expression data from different yeast species to infer and test various hypotheses of biological interest.The thesis is presented in four parts. In the first, part, a new model of gene conservation for yeast species is proposed: we call it the Correction Model. In the second part, the cell-cycle regulated genes in fission yeast are identified with the help of bioinformatics from newly generated genome-wide microarray expression data. In the third part, we present a novel algorithm for the meta-analysis of microarray data sets. In the fourth part, we describe a computational tool SpikeChart that allows visualization and statistical analysis of spatial patterns of DNA motif distributions.Members of the yeast genus Saccharomyces are descendants of an ancient whole-genome duplication event. The lack of divergence for many paralogous gene-pairs is too strong to be explained solely by the currently known model of gene conservation. We propose the new Correction model of conservation, which is based on gene expression and is validated with a detailed analysis involving data from six yeast species. Based on newly generated microarray data for three fission yeast cell-cycle experiments, we analyzed the expression of all genes with clustering and motif search. Top 750 genes with oscillating transcripts were identified by meta-analysis of the experiments. High-throughput microarray technology measures the expression of thousands of features under various experimental conditions. We present a meta-analysis method to jointly address the dual issues of how to combine the significance values across independent data sets with high power, while controlling the proportion of false positives. Finally, we present SpikeChart, a tool that allows visualization and statistical analysis of spatial patterns in the distributions of transcription factor binding motifs in promoters, which can be used to test hypotheses about possible modes of transcription as well as to detect phylogenetic footprints.
QoS Composition of Services for Data-Intensive Application
Authors: Antonio Bucchiarone, Luigi Presti
Venue: Proceedings of the Second International Conference on Internet and Web Applications and Services (2007)

Service-Oriented Computing (SOC) is a promising means to integrate heterogeneous systems. Services from different providers can be integrated into a composite service regardless of their locations, platforms, and/or execution speeds to implement complex business processes. In this paper we propose an approach for the services composition that takes into account the QoS that the composite system must satisfy. After that we design the service selection algorithm used to construct the optimal composite service with the objective to maximize the values of the well-defined QoS characteristics. In this paper we are interested on the Data-Intensive applications where the QoS attributes are very important for the reliability and performance of these systems.
Cutting through the confusion: a measurement study of homograph attacks
Authors: Tobias Holgers, David E. Watson, Steven D. Gribble
Venue: Proceedings of the annual conference on USENIX '06 Annual Technical Conference (2006)

Web homograph attacks have existed for some time, and the recent adoption of International Domain Names (IDNs) support by browsers and DNS registrars has exacerbated the problem [Gabr02]. Many international letters have similar glyphs, such as the Cyrillic letter P (lower case 'er,' Unicode 0x0440) and the Latin letter p. Because of the large potential for misuse of IDNs, browser vendors, policy advocates, and researchers have been exploring techniques for mitigating homograph attacks [=Mozi05, Appl05, Oper05, Mark05]. There has been plenty of attention on the problem recently, but we are not aware of any data that quantifies the degree to which Web homograph attacks are currently taking place. In this paper, we use a combination of passive network tracing and active DNS probing to measure several aspects of Web homographs. Our main findings are four-fold. First, many authoritative Web sites that users visit have several confusable domain names registered. Popular Web sites are much more likely to have such confusable domains registered. Second, registered confusable domain names tend to consist of single character substitutions from their authoritative domains, though we saw instances of five-character substitutions. Most confusables currently use Latin character homographs, but we did find a non-trivial number of IDN homographs. Third, Web sites associated with non-authoritative confusable domains most commonly show users advertisements. Less common functions include redirecting victims to competitor sites and spoofing the content of authoritative site. Fourth, during our nine-day trace, none of the 828 Web clients we observed visited a non-authoritative confusable Web site. Overall, our measurement results suggest that homograph attacks currently are rare and not severe in nature. However, given the recent increases in phishing incidents, homograph attacks seem like an attractive future method for attackers to lure users to spoofed sites.
Utterance verification of keyword strings using word-based minimum verification error (WB-MVE) training
Authors: R. A. Sukkar, A. R. Setlur, M. G. Rahim, Chin-Hui Lee
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

An utterance verification method based on minimum verification error training is presented. In a two-stage process, the recognition hypothesis produced by an HMM-based speech recognizer is verified using a set of verification-specific models that are independent of the models used in the recognition process. The verification models are trained using a discriminative training procedure that seeks to minimize the verification error by simultaneously maximizing the rejection of non-keywords and misrecognized keywords while minimizing the rejection of correctly recognized keywords. This method is evaluated on a connected digit recognition task with a null grammar. The baseline string error rate for this task was 4.85%. At 5% rejection of valid strings, the string error rate decreased to 2.70% using the proposed verification method. The corresponding performance on non-keyword speech was a rejection rate of over 99.0%.
Nonlinear Simulation of Thermo-viscous Fingering in Miscible Displacements in Porous Media
Authors: M. N. Islam, B. B. Maini, J. Azaiez
Venue: Proceedings of the 21st International Symposium on High Performance Computing Systems and Applications (2007)

The nonlinear simulation of interfacial instabilities in miscible displacements in porous media often requires sophisticated numerical algorithms as well as very fine spatial and temporal resolutions. In this study, Hartley transform based Pseudo-spectral method is used to simulate time evolution of thermo-viscous fingers in rectilinear geometry. The problem is formulated using continuity equation, Darcy's law, and volume-averaged forms of convection-diffusion equation for mass and energy balance. The numerical code is validated against established results for isothermal displacements. The effects of exponential dependence of viscosity on concentration and temperature, Lewis number, and porosity on the stability of the thermo-viscous flow are examined. It has been generally observed that at practical values of porosity and Lewis number, the thermal front always lags behind the fluid front and the instability is dominated by the viscosity variation due to concentration.
Making Decisions in Integration of Automotive Software and Electronics: A Method Based on ATAM and AHP
Authors: Peter Wallin, Joakim Froberg, Jakob Axelsson
Venue: Proceedings of the 4th International Workshop on Software Engineering for Automotive Systems (2007)

In this paper we present a new method for making decisions on integration strategy for in-vehicle automotive systems. We describe the problem of choosing integration strategy and we describe the method, which is a combination of the Architecture Tradeoff Analysis Method, ATAM, and the Analytical Hierarchy Process, AHP. We exemplify the use of the proposed method by evaluating the integration decisions concerning the physical connection of a realistic example system; a computer controlled automatic gearbox. We present analysis on the use of the method and conclude that the method has several benefits compared to ATAM or AHP used individually. The method firstly supports a structured way of listing system goals, and secondly, it also supports the making of design decisions.
Automatic Word Spacing Using Probabilistic Models Based on Character n-grams
Authors: Do-Gil Lee, Hae-Chang Rim, Dongsuk Yook
Venue: IEEE Intelligent Systems (2007)

Automatic word spacing decides the correct boundaries between words in a sentence. Word spacing is important in Korean, and word spacing errors are frequent. Several proposed probabilistic word-spacing models resolve problems with previous statistical approaches. These models regard automatic word spacing as a classification problem similar to part-of-speech tagging. By generalizing hidden Markov models, the models can consider a broader context and estimate more accurate probabilities. The authors tested these models under a wide range of conditions to compare them with the state of the art and performed detailed error analysis of them.
Social Scripting for the Web
Authors: Tessa Lau
Venue: Computer (2007)

Koala makes it possible to capture and share how-to knowledge with others.