ppxscal/embedding_network huggingface dataset:
Polyhedral classifier for target detection: a case study: colorectal cancer
Authors: M. Murat Dundar, Matthias Wolf, Sarang Lakare, Marcos Salganicoff, Vikas C. Raykar
Venue: Proceedings of the 25th international conference on Machine learning (2008)

In this study we introduce a novel algorithm for learning a polyhedron to describe the target class. The proposed approach takes advantage of the limited subclass information made available for the negative samples and jointly optimizes multiple hyperplane classifiers each of which is designed to classify positive samples from a subclass of the negative samples. The flat faces of the polyhedron provides robustness whereas multiple faces contributes to the flexibility required to deal with complex datasets. Apart from improving the prediction accuracy of the system, the proposed polyhedral classifier also provides run-time speedups as a by-product when executed in a cascaded framework in real-time. We evaluate the performance of the proposed technique on a real-world Colon dataset both in terms of prediction accuracy and online execution speed.
FES: A System for Combining Face, Ear and Signature Biometrics Using Rank Level Fusion
Authors: Md. Maruf Monwar, Marina Gavrilova
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Performance rate of unimodal biometric system is often reduced due to physiological defects, user mode and the environment. Multibiometric systems seek to alleviate some of these drawbacks by providing multiple evidences of the same identity. In this paper, we develop a multimodal biometric system, FES, based on Principal Component Analysis (PCA) and Fisher’s Linear Discriminant (FLD) methods that will use face, ear and signature for identity identification and rank level fusion for consolidate the results obtained from these monomodal matchers. The ranks of individual matchers are combined using the Borda count method and the Logistic regression method. The results indicate that fusing individual modalities improve the overall performance of the biometric system.
VR BBS Using Immersive Virtual Environment
Authors: Satoshi Oonuki, Tetsuro Ogi
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

In this research, VR BBS was developed. In this system, a user can post a photograph with a comment from cellular phone. And the users can see and reply to the photograph and comment by using common BBS on the cellular phone and PC. In addition, the user can also use BBS function in the virtual world. In this study, an immersive projection display was used to experience the virtual world. The virtual world is constructed by placing the photograph images at the position measured by GPS function of the cellular phone. In the virtual world, the user can see photographs and comments on the maps, and reply to them while walking through the world. This system enables users to share information mutually using the cellular phone, PC, and immersive projection display. This system also has a feature that the virtual world would be automatically extended when many users use this system.
Fusion Based Quality Control Using Intelligent Estimation and Modeling in Industrial Process Control
Authors: Amin Ramezani, Mohamad Reza Andalibizadeh, Soheil Bahrampour, Hamed Ramezani, Behzad Moshiri
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

In this paper, to improve quality control system and being in the competition at a cement production line, we implemented a Local Linear Neuro-Fuzzy Model (LLNFM) and Kalman Filter Information Fusion (KFIF). We proposed a novel approach for model reference control of a cement milling circuit that has previously been studied several times. To do so, first gathered information from Distributed Sensor Network (DSN), deployed in the plant, is used to model under-control process based on the LLNFM approach. This LLNFM is used to prepare data for a KFIF system to derive the form of the control vector with the goal of driving the response of the system to that of a desired model in a noisy operating environment. The paper demonstrates the extraction of the reference models and the derivation of the control laws and the results observed justify the tracking and stability claims of the paper.
Activity routing in a distributed supply chain: Performance evaluation with two inputs
Authors: Vidhyacharan Bhaskar, Patrick Lallement
Venue: Journal of Network and Computer Applications (2008)

In this paper, an industrial system is represented as a 2-input, three-stage queuing network. The two input queuing network receives orders from clients, and the orders are waiting to be served. Each order comprises (i) time of occurrence of the orders and (ii) quantity of items to be delivered in each order. The objective of this paper is to compute the minimum response time for the delivery of items to the final destination along the three stages of the network. The average number of items that can be delivered with this minimum response time constitute the optimum capacity of the queuing network. After getting serviced by the last node (a queue and its server) in each stage of the queuing network, a decision is made to route the items to the appropriate node in the next stage which can produce the least response time. Performance measures such as average queue lengths, average response times, and average waiting times of the jobs in the 2-input network are derived and plotted. Closed-form expressions for the equivalent service rate, equivalent average queue lengths, and equivalent response and waiting times of a single queue with a single server representing the 2-input queuing network are also derived and plotted.
Unit-level test adequacy criteria for visual dataflow languages and a testing methodology
Authors: Marcel R. Karam, Trevor J. Smedley, Sergiu M. Dascalu
Venue: ACM Transactions on Software Engineering and Methodology (TOSEM) (2008)

Visual dataflow languages (VDFLs), which include commercial and research systems, have had a substantial impact on end-user programming. Like any other programming languages, whether visual or textual, VDFLs often contain faults. A desire to provide programmers of these languages with some of the benefits of traditional testing methodologies has been the driving force behind our effort in this work. In this article we introduce, in the context of prograph, a testing methodology for VDFLs based on structural test adequacy criteria and coverage. This article also reports on the results of two empirical studies. The first study was conducted to obtain meaningful information about, in particular, the effectiveness of our all-Dus criteria in detecting a reasonable percentage of faults in VDFLs. The second study was conducted to evaluate, under the same criterion, the effectiveness of our methodology in assisting users to visually localize faults by reducing their search space. Both studies were conducted using a testing system that we have implemented in Prograph's IDE.
Multiconstrained QoS multipath routing in wireless sensor networks
Authors: Xiaoxia Huang, Yuguang Fang
Venue: Wireless Networks (2008)

Sensor nodes are densely deployed to accomplish various applications because of the inexpensive cost and small size. Depending on different applications, the traffic in the wireless sensor networks may be mixed with time-sensitive packets and reliability-demanding packets. Therefore, QoS routing is an important issue in wireless sensor networks. Our goal is to provide soft-QoS to different packets as path information is not readily available in wireless networks. In this paper, we utilize the multiple paths between the source and sink pairs for QoS provisioning. Unlike E2E QoS schemes, soft-QoS mapped into links on a path is provided based on local link state information. By the estimation and approximation of path quality, traditional NP-complete QoS problem can be transformed to a modest problem. The idea is to formulate the optimization problem as a probabilistic programming, then based on some approximation technique, we convert it into a deterministic linear programming, which is much easier and convenient to solve. More importantly, the resulting solution is also one to the original probabilistic programming. Simulation results demonstrate the effectiveness of our approach.
A novel ant clustering algorithm based on cellular automata
Authors: Xiaohua Xu, Ling Chen, Ping He
Venue: Web Intelligence and Agent Systems (2007)

Based on the cellular automata in artificial life, an artificial Ants Sleeping Model (ASM) and an ant algorithm for cluster analysis (A$^4$C) are presented. By simulating the swarm intelligence of the real ant colonies, we use the ant agent to represent the data object. In ASM, each ant has two states: sleeping state and active state. The ant's state is controlled by a function of the ant's fitness to the environment it locates and a probability for the ants to become active. The state of an ant is determined only by its local information. By moving dynamically, the ants form different subgroups adaptively, and consequently the data objects they represent are clustered. Experimental results show that the A$^4$C algorithm on ASM is significantly superior to other clustering methods in terms of both speed and quality. It is adaptive, robust and efficient.
A Dual Oxide CMOS Universal Voltage Converter for Power Management in Multi-VDD SoCs
Authors: Dhruva Ghai, Saraju P. Mohanty, Elias Kougianos
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

Level converters are becoming overhead for the circuits they are being employed in. If their power consumption continues to grow, they will fail to serve the very purpose they were built for. In this paper we propose the application of a dual-T_ox} (DOXCMOS)technique for the power-delay optimization of a DC to DC voltage level converter under oxide thickness T_ox$) and transistorgeometry constraints. The results show power savings of 83 % and delay improvement of 60 % over existing designs. The proposed level converter is capable of performing level-up/down conversion, and blocking of the input signal. The design is area optimal, with a minimum number of transistors. It is a robust design producing a stable output for voltages as low as 0.6 V and loads varying from 10 fF to 200 fF for a 90nm technology. The average power dissipation of the converter with a 45fF capacitive load is 19.89\mu W. The entire design cycle has been carried out up to physical design, including parasitic re-simulation. To the best of the authors' knowledge, this is the first level converter designed using a DOXCMOS technology for power-delay optimization.
Second order approximation of tool envelope surface for 5-axis machining with single point contact
Authors: Hu Gong, Li-Xin Cao, Jian Liu
Venue: Computer-Aided Design (2008)

For 5-axis machining with single point contact, this paper proposes a method to calculate second order approximation of the tool envelope surface by using only one tool position. As we known, the true machining errors are deviations between designed surface and tool envelope surface. But it is impossible to determine the whole shape of the tool envelope surface before all tool positions are obtained. Hence, it is difficult to position the tool individually and consider true errors at the same time. Basic Curvature Equations of Locally Tool Positioning (BCELTP) are presented to solve this problem in some degree. By using them under some special conditions, given one tool position, the local shape (second order approximation) of the tool envelope surface can be calculated precisely at the corresponding cutter contact point. These equations make it convenient to adjust the tool position individually until true errors are reduced in some degree. So, they are useful for optimizing tool positions locally. Finally, some examples are given to verify the correctness and practicability of theory.
Networking Aspects for Gaming Systems
Authors: Christos Bouras, Vassilis Poulopoulos, Ioannis Sengounis, Vassilis Tsogkas
Venue: Proceedings of the 2008 Third International Conference on Internet and Web Applications and Services (2008)

As the evolution of computer technology introduces new advances in networks among others, online gaming becomes a new trend. Following the trends of our era, Games At Large IST Project introduces an innovative platform for running interactive, rich content multimedia applications over a Wireless Local Area Network. Games at Large project's vision is to provide a new system architecture for Interactive Multimedia which will enhance existing CE devices such as, Set Top Boxes (STB), Small Screen and other devices, which are lacking both the CPU power and the graphical performance to provide a rich user experience. This paper presents the controllers' sub-system of the innovative mechanism that will be implemented in the context of Games at Large project. More specifically, it presents the general architecture of the complete system and focuses on the "capturing" and "execution of commands" modules at the different clients and the remote execution of the commands on server side. The client software captures the input from the different input devices, sends the commands over a Wireless Local Area Network and the server is responsible for receiving and executing the commands to the corresponding application.
Towards A Dynamic Healthcare Process: From Requirement Capture To Simulation
Authors: X. Jin, M. Kagioglou, G. Aouad
Venue: Journal of Integrated Design Process Science (2006)

Both process modelling and simulation play an important role in understanding healthcare processes. Since IDEF0 can effectively capture requirements and is relatively easy to communicate, combining IDEF0 with simulation provides a promising way to analyse processes dynamically and to assist in decision-making. This paper explores the feasibility of building an environment that can be used to simulate real IDEF0 models for healthcare processes. EXPRESS language is used to capture the required information that would make an IDEF0 model capable of simulation. An example IDEF0 model simulator is developed in order to explore some of the issues in simulating healthcare processes. A prototype system structure for this simulator is provided in the paper. The healthcare process is used as an example application in this paper. An example IDEF0 model for "Identify Patient Safety Hazards" process represented by XML is loaded and simulated.
Genome rearrangements and sorting by reversals
Authors: V. Bafna, P. A. Pevzner
Venue: Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science (1993)

Sequence comparison in molecular biology is in the beginning of a major paradigm shift-a shift from gene comparison based on local mutations to chromosome comparison based on global rearrangements. In the simplest form the problem of gene rearrangements corresponds to sorting by reversals, i.e. sorting of an array using reversals of arbitrary fragments. Kececioglu and Sankoff gave the first approximation algorithm for sorting by reversals with guaranteed error bound and identified open problems related to chromosome rearrangements. One of these problems is Gollan's conjecture on the reversal diameter of the symmetric group. We prove this conjecture and further study the problem of expected reversal distance between two random permutations. We demonstrate that the expected reversal distance is very close to the reversal diameter thereby indicating that reversal distance provides a good separation between related and non-related sequences. The gene rearrangement problem forces us to consider reversals of signed permutations, as the genes in DNA are oriented. Our approximation algorithm for signed permutation provides a 'performance guarantee' of 3/2. Finally, we devise an approximation algorithm for sorting by reversals with a performance ratio of 7/4.
Region-Based Image Fusion Approach Using Iterative Algorithm
Authors: Yingjie Zhang, Liling Ge
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

A feature-level image fusion scheme based on segmentation and iterative fashion is introduced in this paper. In this scheme, a total variation based energy model is proposed to estimate the contribution of each feature on the source images, the features are obtained based on segmentation of the source image. A larger energy indicates the feature with a strong pattern on its associated region. Furthermore fusion strategies may be performed by measuring the contributions of the associated features on the images. Different from previous methods, measurement of the contributions of the features in proposed are performed when the features has been fused. Therefore a global optimization could be achieved. In order to keep a low computational cost, the orders of regions have not been considered in current research. Even so, better results have been obtained on several test images, and the performance assessment of the final fusion results also are evaluated by using several classical evaluation methods like Root Mean Square Error and Peak Signal to Noise Ratio.
An HLLC scheme for Ten-Moments approximation coupled with magnetic field
Authors: Afeintou Sangam
Venue: International Journal of Computing Science and Mathematics (2008)

We address here an HLLC approximate Riemann solver for the Ten-Moments equations coupled with magnetic field production equation. This new extension HLLC-Riemann solver for Ten-Moments approximation is positivity preserving, resolves exactly isolated 1-shock and 5-shock waves, captures exactly material contact discontinuities. This solver enables us to discretise accurately the hyperbolic part of our magnetic field generation model. The full underlying model consists of Ten-Moments equations for the electron distribution function coupled with the magnetic field evolution equation. Its numerical approximation can predict self-generated magnetic fields, that play a crucial role in laser-plasma interactions in the context of Inertial Confinement Fusion (ICF).
Efficient self-embedding of butterfly networks with random faults
Authors: H. Tamaki
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

The author studies the embedding of the butterfly network in a faulty version of itself where each node is independently faulty with some constant probability. He shows that such a self-embedding of the N-node butterfly with O(1) load, O((log logN)/sup 2.6/) dilation, and 0((log log N)/sup 8.2/) congestion is possible with high probability, assuming sufficiently small node-failure probability. This embedding is level-preserving in the sense that each node is mapped to a node in the same level of the butterfly. He also derives a lower bound of log log log N-c on the dilation of a level-preserving embedding with O(log/sup alpha / N) load, for any alpha , 00, and some constant c depending on alpha and p.
Electrical and structural characterisation of single ZnO nanorods
Authors: Th. Weimann, P. Hinze, E. Schlenker, A. Bakin, A. C. Mofor, A. Behrends, A. Waag
Venue: Microelectronic Engineering (2008)

Zinc oxide (ZnO) nanorods grown by vapor transport were contacted individually with Ti/Au electrodes structured by e-beam lithography. The rectifying behaviour observed in the current-voltage characteristics is likely caused by an interfacial insulating layer between the ZnO nanowires and the contact material. Energy-dispersive X-ray spectroscopy (EDX) measurements performed on electrically measured and non measured reference nanowires reveal that no electromigration of Au or Ti into the nanowires occurs.
Modeling of ADC Nonlinearity by Time-Delay-Based Power Series
Authors: Peng Juan, Ma Hong, Tian Chen
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

As one of the key components in signal processing system, Analog-to-digital converter (ADC) devices play a fundamental role in interfacing the processing core with the analogue world. ADC nonlinear errors limit the performance of signal-processing systems, Identified ADC models could be used to estimate an inverse calibration model in order to compensate the errors and increase the converter dynamic range. This paper presents a novel time-delay-based power series modeling method to identify ADC nonlinear behavior considering phase effects. Also, a set of simulations and experimental results is given, spurious-free dynamic range (SFDR), evaluated before and after calibration, proves the validity and preciseness of the ADC nonlinearity model.
Strategies for Quality CAD PDKs
Authors: Kamesh V. Gadepally, Mark Young, James Lin, Andy Franklin, Ravi Perumal, Sridhar Joshi
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

The competitiveness in the industry to provide quick turn around collateral without compromising quality is a necessity. In addition globalization of engineering activities adds their own challenges and a new dimension to ensuring high quality in a short amount of time. This necessity has given rise to new techniques and strategies. In this paper we discuss some of what we have utilized and learned in our work with respect to continuously enhancing quality while reducing cycle time.
Comparing job allocation schemes where service demand is unknown
Authors: Nigel Thomas
Venue: Journal of Computer and System Sciences (2008)

In this paper a novel job allocation scheme in distributed systems (TAGS) is modelled using the Markovian process algebra PEPA. This scheme requires no prior knowledge of job size and has been shown to be more efficient than round robin and random allocation when the job size distribution is heavy tailed and the load is not high. In this paper the job size distribution is assumed to be of a phase-type and the queues are bounded. Numerical results are derived and compared with those derived from models employing random allocation and the shortest queue strategy. It is shown that TAGS can perform well for a range of performance metrics. Furthermore, an attempt is made to characterise those scenarios where TAGS is beneficial in terms of the coefficient of variation and load.
Motion segmentation using Markov random field model for accurate moving object segmentation
Authors: Cheolkon Jung, Joongkyu Kim
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

In this paper, we propose a new motion segmentation algorithm for accurate moving object segmentation. The proposed algorithm is elaborately designed based on Markov random field (MRF) model. When motion decision is performed on each pixel in images by detection theory, false decisions such as miss and false alarm are occurred. These false decisions cause segmentation errors of moving objects. We remove these errors by using MRF model based on Bayes rule. By means of experiments on test sequences, we demonstrate that our algorithm achieves good performance with respect to the segmentation accuracy.