ppxscal/embedding_network huggingface dataset:
Gene regulatory networks with incorporated delay
Authors: Arcady Ponosov, Andrei Shindiapin, Jose Joao Miguel
Venue: Proceedings of the 12th WSEAS International Conference on Applied Mathematics (2007)

A method to study asymptotic properties of solutions to systems of differential equations with distributed time-delays and Boolean-type nonlinearities (step functions) is offered. Such systems arise in many applications, but this paper deals with specific examples of such systems coming from genetic regulatory networks. A challenge is to analyze stable stationary points which belong to the discontinuity set of the system (thresholds). The paper describes an algorithm of localizing stationary points in the presence of delays as well as stability analysis around such points. The basic technical tool consists in replacing step functions by the so-called "logoid functions" and investigating the smooth systems thus obtained.
Feedback-Switch Logic (FSL): A High-Speed Low-Power Differential Dynamic-Like Static CMOS Circuit Family
Authors: Charbel J. Akl, Magdy A. Bayoumi
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

We present a new dynamic-like static circuit family called Feedback-Switch Logic (FSL) that is suitable for high-speed low-power applications. FSL is a derivative of Cascode Voltage Switch Logic (CVSL) family. However, it does not suffer from the contention problems of clockless CVSL, and it consumes much less power than clocked CVSL (dual-rail domino). FSL gates offer fast switching, reduced capacitance, and input-switching dependent activity factor without the need of clock connection. An 18-bit majority voting circuit is simulated in a 90-nm technology, in order to compare static, clockless CVSL, dual-rail domino and FSL. Simulation results show that FSL reduces delay by 21% compared to static logic, and offers at least 46% power reduction compared to dynamic dual-rail domino logic with two-phase skew-tolerant clocking
A Rate Control Protocol for High Speed Streaming Video
Authors: Xiaogang Yang, Baosong Shan, Yaping Yang
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

In this paper, we propose a rate control for high speed streaming video, which is based on scalable TCP and TEAR. Scalable TCP offers an effective and robust mechanism for bulk data transmitting in high bandwidth-delay network. However it has a big rate oscillation when transmitting video data. TEAR is a rate control protocol that emulates TCP at receivers, which is suitable for streaming video, and however it is TCP friendly and keeps the same low utilization as TCP in high-speed network environment. RDSTCP adopts TEAR idea, emulates scalable TCP at receiver. RDSTCP shifts most functions of scalable TCP to the receiver, and reduces the rate oscillation as well as keeping high link utilization. In the end, we emulate and evaluate RDSTCP performance by using NS2.
A 1000W RMS class D amplifier with feedback
Authors: F. R. S. Vincenzi, L. C. Gomes de Freitas, N. J. Moreira,  Jr., E. A. A. Coelho, J. B. Vieira,  Jr., L. C. De Freitas
Venue: Proceedings of the 9th International Conference on Circuits (2005)

This paper presents a new Class D power amplifier suitable for sub-woofer and woofer. The proposed topology has high efficiency (more than 90%) when operating at nominal power. The proposed topology does not need an output low pass filter to remove the high switching frequency because it uses two current sources to modulate the desired waveform in an output capacitor. This operation plus the feedback control provides low THD (less than 1%) and there is no need to use controlled voltage source supplies as in the conventional Class D structure.
Confidence level solutions for stochastic programming
Authors: Yu. Nesterov, J. -Ph. Vial
Venue: Automatica (Journal of IFAC) (2008)

We propose an alternative approach to stochastic programming based on Monte-Carlo sampling and stochastic gradient optimization. The procedure is by essence probabilistic and the computed solution is a random variable. We propose a solution concept in which the probability that the random algorithm produces a solution with an expected objective value departing from the optimal one by more than @e is small enough. We derive complexity bounds on the number of iterations of this process. We show that by repeating the basic process on independent samples, one can significantly reduce the number of iterations.
On lacunary polynomial perfect powers
Authors: Mark Giesbrecht, Daniel S. Roche
Venue: Proceedings of the twenty-first international symposium on Symbolic and algebraic computation (2008)

We consider the problem of determining whether a t-sparse or lacunary polynomial f is a perfect power, that is, f=hr for some other polynomial h and positive integer r, and of finding h and r should they exist. We show how to determine if f is a perfect power in time polynomial in the size of the lacunary representation. The algorithm works over GF(q)[x] (at least for large characteristic) and over Z[x], where the cost is also polynomial in the log of the infinity norm of f. Subject to a conjecture, we show how to find h if it exists via a kind of sparse Newton iteration, again in time polynomial in the size of the sparse representation. Finally, we demonstrate an implementation using the C++ library NTL.
Advancing test automation technology to meet the challenges of model-driven software development: report on the 3rd workshop on automation of software test
Authors: Hong Zhu, W. Eric Wong, Fevzi Belli
Venue: Companion of the 30th international conference on Software engineering (2008)

The Third Workshop on Automation of Software Test (AST 2008) at the 30th Interna¬tional Conference on Software Engineering (ICSE 2008) sets a special theme on model-based software testing. Nine full research papers and six short papers will be presented in four sessions at the workshop. This report summarizes the organization of the workshop as well as the sessions and papers to be presented at the workshop.
Circular perfect graphs
Authors: Xuding Zhu
Venue: Journal of Graph Theory (2005)

For 1 &le; d &le;k, let Kk-d be the graph with vertices 0, 1,&hellip;, k - 1, in which i <<i>j if d &le; |i - j| &le;k - d. The circular chromatic number &chi;c(G) of a graph G is the minimum of those k-d for which G admits a homomorphism to Kk-d. The circular clique number &omega;c(G) of G is the maximum of those k-d for which Kk-d admits a homomorphism to G. A graph G is circular perfect if for every induced subgraph H of G, we have &chi;c(H) =&omega;c(H). In this paper, we prove that if G is circular perfect then for every vertex x of G, NG[x] is a perfect graph. Conversely, we prove that if for every vertex x of G, NG[x] is a perfect graph and G - N[x] is a bipartite graph with no induced P5 (the path with five vertices), then G is a circular perfect graph. In a companion paper, we apply the main result of this paper to prove an analog of Hajos theorem for circular chromatic number for k-d &ge; 3. Namely, we shall design a few graph operations and prove that for any k-d &ge; 3, starting from the graph Kk-d, one can construct all graphs of circular chromatic number at least k-d by repeatedly applying these graph operations. &copy; 2005 Wiley Periodicals, Inc. J Graph Theory 48: 186209, 2005
Microsoft Excel 2007 Introduction Quick Reference Guide
Authors: Beezix Inc
Venue:  (2007)

Laminated quick reference guide showing step-by-step instructions and shortcuts for how to use Microsoft Office Excel 2007. The following topics are covered: Creating Workbooks, Entering and Editing Data, Clearing Cells, Undo and Redo, Inserting and Deleting Rows Columns and Cells, Column Width and Row Height, Entering Dates, Entering Sequences, Entering Formulas & Functions, Using AutoSum, Absolute vs. Relative Cell References, Resizing the Formula Bar, Formatting Numbers and Cells, Aligning Cell Contents, Borders and Grids, Previewing, Printing and Page Setup, Repeating Rows/Columns on Every Page, Copying and Moving Data: Fill Handle; Cut, Copy, Paste; Drag & Drop. Sheet Features: Renaming, Moving, Copying, Selecting, Inserting, Deleting, Editing Multiple Worksheets Simultaneously, and Copying Data and Formatting to Multiple Worksheets. Also includes: Lists of Selection and Movement Shortcuts. This guide is suitable as a training handout, or simply an easy to use reference guide, for any type of user.
A Novel Screening Method of Dextran Binding Antibody Using Phage Display Libraries
Authors: Duwoon Kim, Seok-Ryel Kim, Donal F. Day, Myung-Joo Oh
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

SephadexTM bead agarose electrophoresis (SBAE) was used to enrich the higher dextran binding phages. Phage collection obtained after the 2nd round of SBAE was 3.5 fold higher color intensity than that of phage collections obtained after the 1st round. DNA sequencing of phage collection (SBAE-2R) confirmed that human origin antibody was present. The PCR products of , light chains and heavy chain from phage collection (SBAE-2R) were approximately 420 bp, 550 bp and 600 bp.
Three Dimensional Chaos Game Representation of Genomic Sequences
Authors: Iman Tavassoly, Omid Tavassoly, Mohammad Soltany Rezaee Rad, Negar Mottaghi Dastjerdi
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

Chaos Game Representation (CGR) has been proposed as a method to convert genomic sequences to scale-independent and unique images. Many useful properties and applications have been indicated for these images. In this paper, a new procedure for three-dimensional visualization of genomic sequences is introduced based on Chaos Game Representation algorithm. In this method instead of four points as four bases in nucleotide sequences, eight points are considered as eight corners of a cube. Four different nucleotides in protein coding regions of the sequence (A, C, G and T) and four different nucleotides in non-coding regions (A, C, G and T) are eight corners of the cube. The mapping equations of chaos game for eight points in three dimensional space (a cube) is used to convert a genomic sequence to a three dimensional image. This visualization can be used for analysis of whole genomes based on coding and no-coding regions.
ACT: Adaptive Calibration Test for Performance Enhancement and Increased Testability of Wireless RF Front-Ends
Authors: Vishwanath Natarajan, Rajarajan Senguttuvan, Shreyas Sen, Abhijit Chatterjee
Venue: Proceedings of the 26th IEEE VLSI Test Symposium (2008)

In this paper, a novel adaptive calibration technique for advanced RF front-ends is proposed in which sensors are implanted in the transmitter and the observed device test response to a special calibration test is compared against the known golden response to the same. Tuning ‘knobs’ which are built into the circuit are then used to minimize the error between the observed response and the golden response using an iterative tuning approach. In addition to circuit-level tuning, adaptive digital compensation techniques are employed in the baseband processor. It is shown that this results in increased transmit signal dynamic range over existing techniques and accurate loopback testing of the transceiver modules
The enhanced use of enterprise and simulation modellingtechniques to support factory changeability
Authors: A. Rahimifard, R. Weston
Venue: International Journal of Computer Integrated Manufacturing (2007)

Bearing in mind that activity requirements of manufacturing enterprises (MEs) can usefully be described as a network of dependent processes, the current paper identifies complementary properties of state-of-the-art enterprise modelling and simulation modelling techniques. It is observed that, when these techniques are used in a coherent fashion, they have potential to create semantically rich models of process networks that can be computer-executed so as to replicate and/or predict organizational behaviours. The current paper describes an outline of how a particular choice of well-proved enterprise modelling and simulation modelling techniques can be used in an integrated fashion. Also described are interim research findings when using such an integrated modelling approach in a case study furniture making company. For key segments of business processes currently deployed by the case study company, the outcome has been new qualitative and quantitative understandings about (a) alternative ways of organizing multi-product flows through a constrained (in situ) set of human and technical resources and (b) potential performance enhancements that could be achieved in process segments by purchasing, commissioning and deploying alternative systems of human and technical resources. Research groundwork is now in place to support the case study company as in the future it makes (a) medium-to-long term investment decisions about new manufacturing control strategies and the purchase of new resource systems and (b) short-to-medium term production planning and control decisions.
Soccer video processing for the detection of advertisement billboards
Authors: Alok Watve, Shamik Sural
Venue: Pattern Recognition Letters (2008)

Billboards are placed on the sides of a soccer field for advertisement during match telecast. Unlike regular commercials, which are introduced during a break, on-field billboards appear on the TV screen at uncertain time instances, in different sizes, and also for different durations. Automated processing of soccer telecasts for detection and analysis of such billboards can provide important information on the effectiveness of this mode of advertising. We propose a method in which shot boundaries are first identified and the type of each shot is determined. Frames within each shot are then segmented to locate possible regions of interests (ROIs) - locations in a frame where billboards are potentially present. Finally, we use a combination of local and global features for detecting individual billboards by matching with a set of given templates.
Computing with very weak random sources
Authors: A. Srinivasan
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

For any fixed /spl epsiv/>0, we show how to simulate RP algorithms in time n/sup O(log n/) using the output of a /spl delta/-source with min-entropy R(/spl epsiv/). Such a weak random source is asked once for R(/spl epsiv/) bits; it outputs an R-bit string such that any string has probability at most 2/sup -R/(/spl epsiv//). If /spl epsiv/>1-1/(k+1), our BPP simulations take time n/sup O(log(k/ n)) (log/sup (k/) is the logarithm iterated k times). We also give a polynomial-time BPP simulation using Chor-Goldreich sources of min-entropy R/sup /spl Omega/(1/), which is optimal. We present applications to time-space tradeoffs, expander constructions, and the hardness of approximation. Also of interest is our randomness-efficient Leftover Hash Lemma, found independently by Goldreich and Wigderson.
Some aspects of DOA estimation using a network of blind sensors
Authors: M. Guerriero, S. Marano, V. Matta, P. Willett
Venue: Signal Processing (2008)

Recently, the DOA (direction of arrival) estimation of an acoustic wavefront has been considered in a setting where the inference task is performed by a wireless sensor network (WSN) made of isotropic (hence individually useless) sensors. The WSN was designed according to the SENMA (SEnsor Network with Mobile Agents) architecture with a mobile agent (MA) that successively queries the sensors lying inside its field of view. In this paper the ideal assumption previously made that the visibility of individual sensors is governed by deterministic laws is relaxed; this yields, interestingly, simpler analytical formulas. Both fast/simple and optimal DOA-estimation schemes are proposed, and an optimization of the MA's observation management is also carried out, with the surprising finding that the MA ought to orient itself at an oblique angle to the expected DOA, rather than directly toward it. The extension to multiple sources is also considered; intriguingly, per-source DOA accuracy is higher when there is more than one source. In all cases, performance is investigated by simulation and compared, when appropriate, with asymptotic bounds; these latter are usually met after a moderate number of MA dwells.
Reconnaissance into distant spaces by multi-robot rescue system with ad hoc networking
Authors: Hisayoshi Sugiyama, Tetsuo Tsujioka, Masashi Murata
Venue: Proceedings of the 1st international conference on Robot communication and coordination (2007)

The system procedure of a victim detection system (VDS) is investigated to reconnoiter distance spaces. VDS is a previously proposed multi-robot rescue system, which searches for victims in urban disaster areas, that consists of mobile robots and one monitor station with operators. An ad hoc wireless network, which connects all of them, is continuously maintained by autonomous path recovery (APR) executed by each robot. The proposed VDS procedure adopts autonomous classification of robots into search and relay robots that act based on the behavior algorithms of each class of robot to configure chain networks threading a path to the spaces. The rules of classification and the behavior algorithm refer to the forwarding tables of each robot constructed for ad hoc networking. Simulation results show that VDS can reconnoiter distant spaces autonomously even though two or three spaces exist beyond different corridors stemming from the safety zone where the monitor station is established.
Decentralized robust Kalman filtering for uncertain stochastic systems over heterogeneous sensor networks
Authors: Adrees Ahmad, Mahbub Gani, Fuwen Yang
Venue: Signal Processing (2008)

This paper investigates the problem of designing decentralized robust Kalman filters for sensor networks observing a physical process with parametric uncertainty. A sensor network consists of distributed collection of nodes, each of which has sensing, communication and computation capabilities. We consider a heterogeneous sensor network consisting of two types of nodes (type A and type B) and central base station. Type A nodes undertake the sensing and make noisy observations of the same physical process while type B nodes play the role of cluster-heads. We derive the information form of robust Kalman filter by using the Krein space approach which proves to be useful to fuse the cluster state estimates. We obtain the decentralized robust Kalman filter for each type B node for the state estimation of uncertain stochastic system by taking into consideration the sensing model of each cluster and the information form of robust Kalman filter. The type B nodes transmit their state estimates along with the inverse of error covariance matrix to the central base station which fuses the cluster state estimates to generate the overall global state estimate. Simulation results demonstrate that the performance of the centralized state estimate is comparable to the performance of the global state estimate and this suggests that they are identical.
Foundations of Mac OS X Leopard Security (Books for Professionals by Professionals)
Authors: Charles Edge, William Barker, Zack Smith
Venue:  (2008)

Foundations of Mac OS X Leopard Security is written in part as a companion to the SANS Institute course for Mac OS X. It contains detailed Mac OS X security information, but also walkthroughs on securing systems. By using the SANS Institute course as a sister to the book, the focus includes both the beginning home user and the seasoned security professional not accustomed to the Mac, and allows this title to establish the best practices for Mac OS X for a wide audience. Additionally, the authors of the book are seasoned Mac and security professionals, having built many of the largest network infrastructures for Apple and spoken at both DefCon and Black Hat on OS X security. What youll learn Security overview Walkthroughs to secure systems Walkthroughs and suggestions for thirdparty applications on systems Mac forensics Mac hacking Apple wireless security Mac OS X security Who is this book for? A wide audience of users, power users, and administrators who wish to make sure their Mac platform is secure. Related Titles Getting StartED with Mac OS X Leopard Mac OS X Leopard: Beyond the Manual Foundation Mac OS X Web Development AppleScript: A Comprehensive Guide to Scripting and Automation on Mac OS X
Porous LSCO electrode fabricated with pulsed laser deposition for advanced thin film fuel cell application
Authors: X. Chen, J. R. Li, L. Smith, Y. Q. Wang, N. J. Wu, A. Ignatiev
Venue: Proceedings of the 5th WSEAS International Conference on Circuits, Systems, Electronics, Control & Signal Processing (2006)

La0.5Sr0.5CoO3-δ (LSCO) electrodes of a porous/dense composite layered structure were fabricated on both sides of a YSZ (111) substrate by pulsed laser deposition. SEM and AFM analysis indicated the outer layer of the LSCO is of micro/nano porous structure and the inner layer is dense. Impedance spectroscopy analysis was performed on the LSCO/YSZ/LSCO sample from 300 to 600°C in air. The electrode area specific resistance was found to be ∼1Ωcm2 at 600°C and was extrapolated to <0.1Ωcm2 for temperatures of ∼700°C, indicating a good potential for the LSCO thin films to be used in applications such as the intermediate temperature thin film solid oxide fuel cells.
A Study on an Effective Group Management Scheme for Secure Multicast in MIPv6
Authors: Hoon Ko, Yong-Jun Lee, Kyung-Sang Sung, Hae-Seok Oh, Yongtae Shin
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

While a lot of important information is being sent and received on the Internet, the information could be exposed to many threats, and the more the multicast service is various and generalized, the more the service range is widened. When a new member joins in or leaves from the multicast group, the group key, which the existing member used, should be newly updated. The existing method had a problem that the performance was depreciated by the key exchanging. This paper proposes the effective group management mechanism for a secure transmission of the multicast data on the multicast group.
Monitoring Software Projects with Earned Value Analysis and Use Case Point
Authors: Jinhua Li, Zhibing Ma, Huanzhen Dong
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

The earned value analysis (EVA) is a project management method for controlling project progress. Two problems cause the difficulty in applying the method on software projects. The first problem is how to consistently express project baselines and to measure technical progress of software projects. The second is due to the conventional Work Breakdown Structure that is prematurely structured around the product cannot reflect the software changes in the development. After discussing the issues and solutions for using EVA on software projects, the paper presents an evolutionary WBS focusing on the elements of software processes, and describes the adoption of use case points as software project baselines and performance measurement. An approach to monitoring software project progress with EVA and use case points is presented. A controlled experiment is described which shows the usefulness and effectiveness of the EVA method for tracking and controlling schedule and costs in software projects.
A 3-approximation algorithm for the subtree distance between phylogenies
Authors: Magnus Bordewich, Catherine McCartin, Charles Semple
Venue: Journal of Discrete Algorithms (2008)

In this paper, we give a (polynomial-time) 3-approximation algorithm for the rooted subtree prune and regraft distance between two phylogenetic trees. This problem is known to be NP-complete and the best previously known approximation algorithm is a 5-approximation. We also give a faster fixed-parameter algorithm for the rooted subtree prune and regraft distance than was previously known.