ppxscal/embedding_network huggingface dataset:
Temporal Partitioning of Communication Resources in an Integrated Architecture
Authors: Roman Obermaisser
Venue: IEEE Transactions on Dependable and Secure Computing (2008)

Integrated architectures in the automotive and avionic domain promise improved resource utilization and enable a better coordination of application subsystems compared to federated systems. An integrated architecture shares the system's communication resources by using a single physical network for exchanging messages of multiple application subsystems. Similarly, the computational resources (e.g., memory, CPU time) of each node computer are available to multiple software components. In order to support a seamless system integration without unintended side effects in such an integrated architecture, it is important to ensure that the software components do not interfere through the use of these shared resources. For this reason, the DECOS integrated architecture encapsulates application subsystems and their constituting software components. At the level of the communication system, virtual networks on top of an underlying time-triggered physical network exhibit predefined temporal properties (i.e., bandwidth, latency, latency jitter). Due to encapsulation the temporal properties of messages sent by a software component are independent from the behavior of other software components, in particular from those within other application subsystems. This paper presents the mechanisms for temporal partitioning of communication resources in the DECOS integrated architecture. Furthermore, experimental evidence is provided in order to demonstrate that the messages sent by one software component do not affect the temporal properties of messages exchanged by other software components. For this purpose, we use an experimental framework with an implementation of virtual networks on top of a TDMA-controlled Ethernet network.
DARN! A Weighted Constraint Solver for RNA Motif Localization
Authors: Matthias Zytnicki, Christine Gaspin, Thomas Schiex
Venue: Constraints (2008)

Following recent discoveries about the important roles of non-coding RNAs (ncRNAs) in the cellular machinery, there is now great interest in identifying new occurrences of ncRNAs in available genomic sequences. In this paper, we show how the problem of finding new occurrences of characterized ncRNAs can be modeled as the problem of finding all locally-optimal solutions of a weighted constraint network using dedicated weighted global constraints, encapsulating pattern-matching algorithms and data structures. This is embodied in DARN!, a software tool for ncRNA localization, which, compared to existing pattern-matching based tools, offers additional expressivity (such as enabling RNA---RNA interactions to be described) and improved specificity (through the exploitation of scores and local optimality) without compromises in CPU efficiency. This is demonstrated on the actual search for tRNAs and H/ACA sRNA on different genomes.
Free-standing SU-8 subwavelength gratings fabricated by UV curing imprint
Authors: Xudi Wang, Yanlin Liao, Bin Liu, Liangjin Ge, Guanghua Li, Shaojun Fu, Yifang Chen, Zheng Cui
Venue: Microelectronic Engineering (2008)

Fabrication technique for making subwavelength anti-reflective grating structures has been developed, based on nanoimprint of SU-8, for applications in the near infrared spectral range. The depth and duty cycle of the grating structures optimized for wavelengths around 1550nm were calculated using rigorous theory of diffraction. The Si mold was made by electron-beam lithography and deep reactive ion etching. The mold structures were transferred to SU-8 by imprinting and followed by UV curing process. A bilayer process using PMMA as sacrificial layer was developed to release the SU-8 layer. The optical properties of the replicated SU-8 gratings were measured over a wide range of spectral wavelength. The general shapes of the curves are in good agreement with the calculations. The reflectivity has been reduced significantly.
sBGMM: A Stratified Beta-Gaussian Mixture Model for Clustering Genes with Multiple Data Sources
Authors: Xiaofeng Dai, Harri Lähdesmäki, Olli Yli-Harja
Venue: Proceedings of the 2008 International Conference on Biocomputation, Bioinformatics, and Biomedical Technologies (2008)

Cluster analysis is widely applied to discover the function of previously unannotated genes. This paper presents a novel stratified Beta-Gaussian mixture model, sBGMM, for clustering genes based on gene expression data, protein-DNA binding data and data that can provide information for constructing priors such as protein-protein interaction (PPI) data. An expectation maximization (EM) type of algorithm for Beta mixture model is first developed and then combined with that of Gaussian mixture model. This combined algorithm can jointly estimate the parameters for both Beta and Gaussian distributions and is used as the core in the sBGMM method. The stratification property of sBGMM is exhibited as Stratum-specific prior probabilities and is constructed by the pre-cluster results obtained from PPI data in this study. This proposed sBGMM method differs from other mixture model based methods in its integration of two different data types into a single and unified probabilistic modeling framework and incorporation of prior information from a third data source. Several well-studied model selection methods, such as Akaike information criterion (AIC), modified AIC (AIC3), Bayesian information criterion (BIC), and integrated classification likelihood-BIC (ICL-BIC) are applied to estimate the number of clusters, and simulation results show that AIC3 works best for sBGMM. Simulations also indicate that combining two different data sources into a single mixture model can greatly improve the clustering accuracy and stability, and employing priors to stratify the model can further enhance its performance. This proposed method provides a more efficient use of multiple data sources than methods that analyze different data sources separately.
Inter-brand comparison of online auction markets
Authors: James K. Ho
Venue: Electronic Commerce Research (2008)

A methodology for studying brand variations in online auction markets is presented. A topological model for such market is a simultaneous graphical display of all the dimensions of its relevant database, which provides a geometrical shape as a descriptive, visual statistics of the market at any particular instance of its development. In particular, various dimensions were identified for constructing a multi-attribute dichotomy that can help discern relative advantages to buyers and sellers using only available, operational data, and without expert knowledge of the items involved or the prices attained. Using a reference subset of diverse cases, the configuration of the dimensions and the angles among them can be optimized for a topology that maximizes the resolution of such dichotomies. The approach is illustrated in a comparative study of four brands of digital cameras on eBay.com. It can be a useful data mining tool in market research, product positioning, and strategic analysis in e-commerce.
Maximum agreement subtree in a set of evolutionary trees-metrics and efficient algorithms
Authors: D. Keselman
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

In this paper we prove that the maximum homeomorphic agreement subtree problem is /spl Nscr//spl Pscr/-complete for three trees with unbounded degrees. We then show an approximation algorithm of time O(kn/sup 5/) for choosing the species that are not in a maximum agreement subtree of a set of k trees. Our approximation is guaranteed to provide a set that is no more than 4 times the optimum solution. While the set of evolutionary trees may be large in practice, the trees usually have very small degrees, typically no larger than three. We develop a new method for finding a maximum agreement subtree of k trees, of which one has degree bounded by d. This new method enables us to find a maximum agreement subtree in time O(kn/sup d+1/).
UNAGI: a protocol testbed with practical smart antennas for ad hoc networks
Authors: Naoya Kohmura, Hikaru Mitsuhashi, Masahiro Watanabe, Masaki Bandai, Sadao Obana, Takashi Watanabe
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2008)

This paper describes a protocol testbed system called UNAGI/ESPAR for ad hoc networks, which enables the evaluation of communication protocols with a gain-controlled antenna. It incorporates ESPAR as a practical smart antenna, IEEE802.15.4/ZigBee, GPS and gyro modules to allow easy installation of different protocols. Some experimental results are also shown.
Attack Detection for Resource-Constrained Network Devices
Authors: H. Karen Lu
Venue: Proceedings of the Third International Conference on Systems (2008)

Many small devices are capable of connecting to the Internet now. The trend of pervasive computing and networking is going strong. At the same time, security threats on the Internet continue to increase. Existing defense mechanisms against network-based attacks can hardly apply to small network devices due to limitations of their computing resources. This paper presents a method to mitigate this problem. The approach embeds the attack detection mechanism inside the device’s network module. It focuses on the operational behavior of the module to identify abnormal events. The mechanism does not compete for resources with the main function of the device. It has little impact on the system performance. Furthermore, the method may detect unknown attacks.
An image background detection project for a visual exploration of DFS and BFS
Authors: Ali Erkan, Diyan Gochev
Venue: Proceedings of the 39th SIGCSE technical symposium on Computer science education (2008)

We outline a Data Structures project that visualizes the operation of depth first search (DFS) and breadth first search (BFS). We use color to illustrate how these two techniques differ as they traverse a search space. We present additional exercises that outline how students can further explore the underlying data structures, algorithmic concepts, and efficiency issues. We also provide a limited amount of student assessment to gauge the effectiveness of our approach.
On the perfect orderability of unions of two graphs
Authors: Chính T. Hoàng, Xiaodan Tu
Venue: Journal of Graph Theory (2000)

A graph G is perfectly orderable, if it admits an order < on its vertices such that the sequential coloring algorithm delivers an optimum coloring on each induced subgraph (H, <) of (G, <). A graph is a threshold graph, if it contains no P4, 2K2, and C4 as induced subgraph. A theorem of Chv&aacute;tal, Ho&agrave;ng, Mahadev, and de Werra states that a graph is perfectly orderable, if it is the union of two threshold graphs. In this article, we investigate possible generalizations of the above theorem. Ho&agrave;ng has conjectured that, if G is the union of two graphs G1 and G2, then G is perfectly orderable whenever G1 and G2 are both P4-free and 2K2-free. We show that the complement of the chordless cycle with at least five vertices cannot be a counter-example to this conjecture, and we prove a special case of it: if G1 and G2 are two edge-disjoint graphs that are P4-free and 2K2-free, then the union of G1 and G2 is perfectly orderable. &copy; 2000 John Wiley & Sons, Inc. J Graph Theory 33: 32&ndash;43, 2000
Communication on noisy channels: a coding theorem for computation
Authors: L. J. Schulman
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

Communication is critical to distributed computing, parallel computing, or any situation in which automata interact-hence its significance as a resource in computation. In view of the likelihood of errors occurring in a lengthy interaction, it is desirable to incorporate this possibility in the model of communication. The author relates the noisy channel and the standard (noise less channel) complexities of a communication problem by establishing a 'two-way' or interactive analogue of Shanon's coding theorem: every noiseless channel protocol can be simulated by a private-coin noisy channel protocol whose time bound is proportional to the original (noiseless) time bound and inversely proportional to the capacity of the channel, while the protocol errs with vanishing probability. The method involves simulating the original protocol while implementing a hierarchical system of progress checks which ensure that errors of any magnitude in the simulation are, with high probability, rapidly eliminated.
Systematic viewpoint for integrating computational resources by using the technique of PC cluster
Authors: Kun-Lin Hsieh, Cheng-Chang Jeng, Williams Tsai, Chun-Hung Lee
Venue: Proceedings of the 6th WSEAS International Conference on Systems Theory & Scientific Computation (2006)

When we take a systematic view to screen out the general colleges or universities, we can find out a fact that many computational resources will be existed. During the competitive environment, how to sufficiently and efficiently utilize the computational resources under the consideration of the resource constrained had became an important job to most practitioners, especial for the general colleges or universities. In this study, we will introduce a case study in Taiwanese University owing the issue of computational resources integration based on the PC cluster environmental architecture and technique. This case is an application of clustering technique to DNA analysis. Not only the hardware/software architecture of PC cluster, but the clustering algorithm based on such cluster architecture was also proposed in this study to demonstrate the rationality and feasibility of real applications.
A compact and disposable transdermal drug delivery system
Authors: M. Matteucci, M. Casella, M. Bedoni, E. Donetti, M. Fanetti, F. De Angelis, F. Gramatica, E. Di Fabrizio
Venue: Microelectronic Engineering (2008)

This work presents a portable transdermal drug delivery system that combines a magnetically actuated micro gear pump with a microneedle array. Micropart fabrication is performed through DXRL and LIGA techniques. The manufacturing process of both micropump and microneedle array are described together with wear issues. Results show that the assembled device can deliver rates that go from 0.1 to 1.2ml/min at gear speed ranging from 1000 to 8500rpm. First skin piercing experiments are also described.
Accurate and scalable simulation of network of heterogeneous sensor devices
Authors: Ye Wen, Selim Gurun, Navraj Chohan, Rich Wolski, Chandra Krintz
Venue: Journal of Signal Processing Systems (2008)

Simulation is an important tool to study and analyze sensor networks. Prior work in sensor network simulation focuses on homogeneous devices. In this paper, we present a system that performs scalable and accurate simulation of a network of heterogeneous sensor devices, including both Stargate intermediate level devices and mote devices. We study accuracy, performance, and scalability of our system. The results show that we can achieve accurate functional behavior for both standalone Stargate simulation and ensemble simulation of a Stargate and motes. For motes, we have less than 4.06% cycle count error for all benchmarks and for Stargate, we have less than 10% error for most benchmarks, and less than 12.5% error for all benchmarks. We also achieve less than 3.6% error for all benchmarks when simulating an ensemble of Stargate and motes. Our system is also more scalable than prior work. We can simulate 160 sensor nodes in real time speed and 2,048 sensor nodes with ten times slowdown on a 16-node cluster.
RelAltTab: assisting users in switching windows
Authors: Nuria Oliver, Mary Czerwinski, Greg Smith, Kristof Roomp
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2008)

We present RelAltTab, an enhanced ALT+TAB prototype that assists users in switching windows. Our approach uses semantic and temporal information to create a list of related windows to the window that the user is currently engaged in. The main assumption is that the user is more likely to switch to a related window than to any other window in the system. We propose two different user interfaces that present the related window list to the user. We describe in detail the techniques and user interfaces of the RelAltTab system, and present the results of one user study comparing our approach to the standard Windows ALT+TAB program.
A laboratory evaluation framework for pedestrian navigation devices
Authors: Michael Schellenbach, Antonio Krüger, Martin Lövdén, Ulman Lindenberger
Venue: Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology (2007)

The design of personal mobile navigation devices needs to take into account the context of use, including different types of input in order to react to changing cognitive as well as to haptic constraints. In this work we propose a laboratory evaluation framework for pedestrian navigation devices that aims to maximize the significance of results obtained in a virtual environment for later field usage. In order to increase the degree of physical motion of test users, we have designed a Virtual Environment (VE) with a treadmill-based walking interface. In order to validate our approach we present preliminary results from a study comparing over-ground walking with treadmill walking, which shows the applicability of the treadmill VE. With this work we would like to combine methodologies coming from cognitive psychology with field-study methods often used in user-interface design.
Simulation and fabrication for pin-to-plate microjoining by Nd:YAG laser
Authors: C. K. Chung, Y. C. Lin
Venue: Microsystem Technologies (2005)

This paper reports the behavior of pin-to-plate microjoining using the pulsed Nd:YAG laser in the approaches of numerical simulation and metallurgical analysis. A three-dimensional pin-to-plate finite element model has been developed to analyze the transient temperature field and thermal stress distribution during the fabrication process of the laser joint to find a better joining condition. The thermal history of the plate was recorded during the joining process to verify the result of the finite element approach. Metallurgical analysis was done to understand microstructure transformation after joining. The result shows that the micro-pin can be successfully joined to the thin plate in the applied condition using CF50-2 commercial filler alloy. The numerical result is also in good agreement with experimental measurements after joining fabrication.
SAMProc: middleware for self-adaptive mobile processes in heterogeneous ubiquitous environments
Authors: Holger Schmidt, Franz J. Hauck
Venue: Proceedings of the 4th on Middleware doctoral symposium (2007)

Software in Ubiquitous Computing is faced with a dynamic and heterogeneous environment. For tapping the environment's full potential, software must be able to adapt dynamically and react to the environment in a platform-and language-independent manner. However, developing mobile and adaptive applications is a complex and error-prone task. This work presents the design of SAMProc, a new middleware that supports developers in creating ubiquitous applications. We introduce the novel concept of self-adaptive mobile processes, which allows an abstract high-level specification of an application's lifecycle and its distribution aspects. In our system, an application may dynamically migrate with an adaptation of its interface, state and implementation at runtime, while transparently and permanently remaining addressable. The SAMProc middleware uses an MDA-like approach, in which the developer creates a self-adaptive mobile process description. A middleware tool automatically maps these descriptions to our infrastructure, i.e., either self-adaptive migratable CORBA objects or Web services. The developer focuses on application logic; the tool generates migration and adaptation code. We demonstrate the feasibility by presenting an example application in which mobile reporters publish data in a basic workflow.
Performance analysis of four routing protocols in sensor networks
Authors: Abdelghani Bellaachia, Nilkamal Weerasinghe
Venue: International Journal of Ad Hoc and Ubiquitous Computing (2008)

The efficiency of sensor networks strongly depends on the routing protocol used. In this paper, we analyse four different types of routing protocols: LEACH, PEGASIS, HIT-M, and DIRECT. Sensor networks were simulated using TOSSIM simulator. Several experiments were conducted to analyse the performance of these protocols including the power consumption and overall network performance. The experimental results show that HIT-M outperforms all other protocols while PEGASIS has better performance than LEACH and DIRECT. LEACH and DIRECT have similar performance. This paper also shows the power consumption for all protocols. On the average, DIRECT has the worst power consumption.
The design of Tag-It™ compatible 13.56 MHz passive RFID transponder IC employing TSMC 0.18µm process
Authors: M. K. Khaw, F. Mohd-Yasin, M. B. I. Reaz
Venue: Proceedings of the 5th WSEAS International Conference on Circuits, Systems, Electronics, Control & Signal Processing (2006)

This paper presents the design of Tag-It™ compatible 13.56 MHz Passive RFID Transponder IC implemented in TSMC 0.18µm Mixed Signal SALICIDE (1P6M, 1.8V) process. The design is simpler and requires lower power supply, compared to four other works, which in turn can achieve power reduction of 30-50%.
Automatic SIMD vectorization of chains of recurrences
Authors: Yixin Shou, Robert A. van Engelen
Venue: Proceedings of the 22nd annual international conference on Supercomputing (2008)

Many computational tasks require repeated evaluation of functions over structured grids, such as plotting in a coordinate system, rendering of parametric objects in 2D and 3D, numerical grid generation, and signal processing. In this paper, we present a method and toolset to speed up closed-form function evaluations over grids by vectorizing Chains of Recurrences (CR). CR forms of closed-form functions require fewer operations to evaluate per grid point. However, the present CR formalism makes CR forms inherently non-vectorizable due to the dependences carried from one point to the next. To address this limitation, we developed a new decoupling method for the CR algebra to translate math functions into Vector Chains of Recurrences (VCR) forms. The VCR coefficients are packed in short vector registers for efficient execution. Performance results of benchmark functions evaluated in single and double precision VCR forms are compared to the Intel compiler's auto-vectorized code and the high-performance small vector math library (SVML). The results show a significant performance increase of our VCR method over SVML and scalar CRs, from doubling the execution speed to running an order of magnitude faster. An auto-tuning tool for VCR is developed for optimal performance and accuracy.
Modelling for lazy clause generation
Authors: Olga Ohrimenko, Peter J. Stuckey
Venue: Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77 (2008)

Lazy clause generation is a hybrid SAT and finite domain propagation solver that tries to combine the advantages of both: succinct modelling using finite domains and powerful nogoods and back-jumping search using SAT technology. It has been shown that it can solve hard scheduling problems significantly faster than SAT or standard finite domain propagation alone. This new hybrid opens up many choices in modelling problems because of its dual representation of problems as both finite domain and SAT variables. In this paper we investigate some of those choices. Arising out of the modelling choices comes a novel combination of bounds representation and domain propagation which creates a form of propagation of disjunctions. We show this novel modelling approach can outperform more standard approaches on some problems.