ppxscal/embedding_network huggingface dataset:
Cost Analysis of the X-code Double Parity Array
Authors: Alexander Thomasian, Jun Xu
Venue: Proceedings of the 24th IEEE Conference on Mass Storage Systems and Technologies (2007)

The popular RAID5 disk arrays tolerate a single disk failure by using a parity code to reconstruct the contents of a failed disk on demand, but are susceptible to data loss if a second disk fails. The rebuild process which systematically reconstructs the contents of a failed disk on a spare disk may be unsuccessful due to media failures or a second disk failure. Two disk failure tolerant arrays dealing with both problems can be implemented using Reed-Solomon codes or multiple parity schemes such as EVENODD, RDP, Xcode, and RM2. All methods incur the minimum level of redundancy in disk accesses and also capacity overhead (except RM2). An appropriate choice of symbol sizes in EVENODD and RDP results in the same access pattern as RAID6 and little disk load imbalance in degraded mode. In this study we consider the load increase and imbalance of the X-code method, since other methods were investigated in previous studies. We derive a general expression for disk loads and present graphs to quantify the load imbalance.
Software performance tuning of software product family architectures: Two case studies in the real-time embedded systems domain
Authors: Christian Del Rosso
Venue: Journal of Systems and Software (2008)

Software performance is an important non-functional quality attribute and software performance evaluation is an essential activity in the software development process. Especially in embedded real-time systems, software design and evaluation are driven by the needs to optimize the limited resources, to respect time deadlines and, at the same time, to produce the best experience for end-users. Software product family architectures add additional requirements to the evaluation process. In this case, the evaluation includes the analysis of the optimizations and tradeoffs for the whole products in the family. Performance evaluation of software product family architectures requires knowledge and a clear understanding of different domains: software architecture assessments, software performance and software product family architecture. We have used a scenario-driven approach to evaluate performance and dynamic memory management efficiency in one Nokia software product family architecture. In this paper we present two case studies. Furthermore, we discuss the implications and tradeoffs of software performance against evolvability and maintenability in software product family architectures.
Economical Iterative and Range-Transformation Schemes for Division
Authors: E. V. Krishnamurthy
Venue: IEEE Transactions on Computers (1971)

It is shown that the Wilkes-Harvard and Newton-Raphson iterative division schemes with an order of convergence more than two or three are uneconomical for realization in computers.
SVD-QR-T FCM Approach for Virtual MIMO Channel Selection in Wireless Sensor Networks
Authors: Jing Liang, Qilian Liang
Venue: Proceedings of the International Conference on Wireless Algorithms,Systems and Applications (2007)

In this paper, we present Singular-Value Decomposition- QR with Threshold (SVD-QR-T) algorithm to select a subset of channels in virtual MIMO wireless sensor networks (WSN) in order to reduce its complexity and cost. SVDQR- T selects best subset of transmitters while keeping all receivers active. The threshold is adaptive by means of Fuzzy C-Mean (FCM). Under the constraint of the same total transmission power, this approach is compared against the case without channel selection in terms of capacity, bit error rate (BER) and multiplexing gain in the presence of water-filling as well without. It is shown that in spite of less multiplexing gain, when water-filling is applied, SVDQR- T FCM provides lower BER at moderate to high SNR; in case of equal transmission power allocation, SVD-QR-T FCM achieves higher capacity at low SNR and lower BER. In general, it provides satisfying performances compared to the case without channel selection but reduced cost and resource.
PARTES: Performance Analysis of Real-Time Embedded Systems
Authors: Benjamin Gorry, Andrew Ireland, Peter King
Venue: Proceedings of the Fourth International Conference on Quantitative Evaluation of Systems (2007)

The development of performance models from real-time system source code can be a time consuming process. It can be difficult to capture actual system timing values to be used in these models. The tool PARTES is introduced. PARTES facilitates the extraction of CSPL (C-based Stochastic Petri net Language) models from an ANSI-C program which has been annotated by the user. These models are then subjected to sensitivity analysis via the SPNP (Stochastic Petri Net Package). The results from analysis can be used to directly identify any potentially problematic timing areas in the original source code.
In Vivo Model Estimation and Haptic Characterization of Needle Insertions
Authors: L. Barbe, B. Bayle, M. De Mathelin, A. Gangi
Venue: International Journal of Robotics Research (2007)

During percutaneous interventions, the haptic perception of transitions and ruptures in the tissues is fundamental. In the medical robotics context, these events should be conveyed to a remote telemanipulating practitioner or should be taken into account in a robotic control scheme. However, this problem is extremely complex given the nature and the variety of tissues involved in percutaneous procedures. In this article, in vivo percutaneous experiments associated with an online model estimation of the interaction between tissues and a surgical needle are presented for the first time. The estimation scheme is then used to provide a robust method to automatically detect the transitions that occur during needle insertion. Finally, the principle of a modified teleoperation scheme that would allow better haptic discrimination of ruptures is proposed and illustrated.
An approximate efficient finite element approach to simulating a rotary forming process and its application to a wheel-bearing assembly
Authors: H. K. Moon, M. C. Lee, M. S. Joun
Venue: Finite Elements in Analysis and Design (2007)

We propose an approximate efficient rigid-plastic finite element method that reduces both the computational time and volume changes during the simulation of a rotary forming process. The proposed approach was verified and applied to a computer simulation of a wheel bearing assembly process encountered during the manufacture of bearings. We compared the analyzed predictions with experiment data and observed good agreement.
Taylor series approach to fuzzy multiobjective linear fractional programming
Authors: M. Duran Toksarı
Venue: Information Sciences: an International Journal (2008)

This paper presents the use of a Taylor series for fuzzy multiobjective linear fractional programming problems (FMOLFP). The Taylor series is a series expansion that a representation of a function. In the proposed approach, membership functions associated with each objective of fuzzy multiobjective linear fractional programming problem transformed by using a Taylor series are unified. Thus, the problem is reduced to a single objective. Practical applications and numerical examples are used in order to show the efficiency and superiority of the proposed approach.
Rough set based approach for inducing decision trees
Authors: Jin-Mao Wei, Shu-Qin Wang, Ming-Yang Wang, Jun-Ping You, Da-You Liu
Venue: Knowledge-Based Systems (2007)

This paper presents a new approach for inducing decision trees based on Variable Precision Rough Set Model. The presented approach is aimed at handling uncertain information during the process of inducing decision trees and generalizes the rough set based approach to decision tree construction by allowing some extent misclassification when classifying objects. In the paper, two concepts, i.e. variable precision explicit region, variable precision implicit region, and the process for inducing decision trees are introduced. The authors discuss the differences between the rough set based approaches and the fundamental entropy based method. The comparison between the presented approach and the rough set based approach and the fundamental entropy based method on some data sets from the UCI Machine Learning Repository is also reported.
Interactive Visual Exploration of a Large Spatio-temporal Dataset: Reflections on a Geovisualization Mashup.
Authors: Jo Wood
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

Exploratory visual analysis is useful for the preliminary investigation of large structured, multifaceted spatio-temporaldatasets. This process requires the selection and aggregation of records by time, space and attribute, the ability to transform data and the flexibility to apply appropriate visual encodings and interactions. We propose an approach inspired by geographical 'mashups' in which freely-available functionality and data are loosely but flexibly combined using de facto exchange standards. Our case study combines MySQL, PHP and the LandSerf GIS to allow Google Earth to be used for visual synthesis and interaction with encodings described in KML. This approach is applied to the exploration of a log of 1.42 million requests made of a mobile directory service. Novel combinations of interaction and visual encoding are developed including spatial 'tag clouds', 'tag maps', 'data dials' and multi-scale density surfaces. Four aspects of the approach are informally evaluated: the visual encodings employed, their success in the visual exploration of the dataset, the specific tools used and the 'mashup' approach. Preliminary findings will be beneficial to others considering using mashups for visualization. The specific techniques developed may be more widely applied to offer insights into the structure of multifarious spatio-temporal data of the type explored here.
Poly-vinyl alcohol hydrogel vascular models for in vitro aneurysm simulations: the key to low friction surfaces
Authors: Makoto Ohta, Akira Handa, Hiroo Iwata, Daniel A. Rüfenacht, Sadami Tsutsumi
Venue: Technology and Health Care (2004)

Purpose: To develop a vessel model with poly-vinyl alcohol hydrogel (PVA-H) with low surface friction for in vitro simulations of vascular pathologies. Materials and methods: Simulations of variable vascular pathologies were based on human vessel casts reproduced in wax. Constructions of vascular models were then obtained by lost wax techniques. As materials, liquid silicon or PVA in organic solvents were used. After solidification, the wax was drained by heating. Comparison of PVA-H with silicone models included evaluation of surface characteristics (friction coefficient), of visibility (transparence and compatibility with medical imaging techniques), and of stiffness (pulsatility of vascular lumen). Both model types were integrated in a circulation circuit allowing for flow simulations and testing with endovascular medical devices. Results and conclusion: Both model types were transparent and compatible with current medical imaging methods. PVA-H models exhibited much lower friction characteristics. PVA-H stiffness was closer to soft tissue when compared to silicone, allowing for pulsations during flow simulations.
ABCGrid
Authors: Ying Sun, Shuqi Zhao, Huashan Yu, Ge Gao, Jingchu Luo
Venue: Bioinformatics (2007)

Summary: We have developed a package named Application for Bioinformatics Computing Grid (ABCGrid). ABCGrid was designed for biology laboratories to use heterogeneous computing resources and access bioinformatics applications from one master node. ABCGrid is very easy to install and maintain at the premise of robustness and high performance. We implement a mechanism to install and update all applications and databases in worker nodes automatically to reduce the workload of manual maintenance. We use a backup task method and self-adaptive job dispatch approach to improve performance. Currently, ABCGrid integrates NCBI_BLAST, Hmmpfam and CE, running on a number of computing platforms including UNIX/Linux, Windows and Mac OS X. Availability: The source code, executables and documents can be downloaded from http://abcgrid.cbi.pku.edu.cn Contact: abcgrid@mail.cbi.pku.edu.cn
The business case for automated software engineering
Authors: Tim Menzies, Oussama Elrawas, Jairus Hihn, Martin Feather, Ray Madachy, Barry Boehm
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

Adoption of advanced automated SE (ASE) tools would be favored if a business case could be made that these tools are more valuable than alternate methods. In theory, software prediction models can be used to make that case. In practice, this is complicated by the "local tuning" problem. Normally, predictors for software effort and defects and threat use local data to tune their predictions. Such local tuning data is often unavailable. This paper shows that assessing the relative merits of different SE methods need not require precise local tunings. STAR1 is a simulated annealer plus a Bayesian post-processor that explores the space of possible local tunings within software prediction models. STAR1 ranks project decisions by their effects on effort and defects and threats. In experiments with two NASA systems, STAR1 found that ASE tools were necessary to minimize effort/ defect/ threats.
Some Aspects of the Verification of Loop Computations
Authors: J. Misra
Venue: IEEE Transactions on Software Engineering (1978)

The problem of proving whether or not a loop computes a given function is investigated. We consider loops which have a certain "closure" property and derive necessary and sufficient conditions for such a loop to compute a given function. It is argued that closure is a fundamental concept in program proving. Extensions of the basic result to proofs involving relations other than functional relations, which typically arise in nondeterministic loops, are explored. Several applications of these results are given, particularly in showing that certain classes of programs may be directly proven (their loop invariants generated) given only their input-output relationships. Implications of these results are discussed.
Optimum Prefix Adders in a Comprehensive Area, Timing and Power Design Space
Authors: Jianhua Liu
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

Parallel prefix adder is the most flexible and widely-used binary adder for ASIC designs. Many high-level synthesis techniques have been developed to find optimal prefix structures for specific applications. However, the gap between these techniques and back-end designs is increasingly large. In this paper, we propose an integer linear programming method to build minimal-power prefix adders within given timing and area constraints. It counts both gate and wire capacitances in the timing and power models, considers static and dynamic power consumptions, and can handle gate sizing and buffer insertion to improve the performance further. The proposed method is also adaptive for non-uniform arrival time and required time on each bit position. Therefore our method produces the optimum prefix adder for realistic constraints.
Optimization of Arithmetic Datapaths with Finite Word-Length Operands
Authors: S. Gopalakrishnan, P. Kalla
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

This paper presents an approach to area optimization of arithmetic datapaths that perform polynomial computations over bit-vectors with finite widths. Examples of such designs abound in DSP for audio, video and multimedia computations where the input and output bit-vector sizes are dictated by the desired precision. A bit-vector of size m represents integer values reduced modulo 2m(%2m). Therefore, finite word-length bit-vector arithmetic can be modeled as algebra over finite integer rings, where the bit-vector size dictates the ring cardinality. This paper demonstrates how the number-theoretic properties of finite integer rings can be exploited for optimization of bit-vector arithmetic. Along with an analytical model to estimate the implementation cost at RTL, two algorithms are presented to optimize bit-vector arithmetic. Experimental results, conducted within practical CAD settings, demonstrate significant area savings due to our approach.
Optimal Zero-Correlation Zone Sequence Set Constructed from a Perfect Sequence
Authors: Takafumi Hayashi
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

The present paper introduces the construction of se- quences having a zero-correlation zone. The cross- correlation function and the side-lobe of the auto- correlation function of the proposed sequence set is zero for the phase shifts within the zero-correlation zone. The pro- posed zero-correlation zone sequence set can be generated from an arbitrary perfect sequence, the length of which is the product of a pair of odd integers ((2k + 1)(2n + 1) for k 1 and n 0). A zero-correlation zone sequence set that satisfies the theoretical bound of the sequence member size for the zero-correlation zone and the sequence period is called an optimal zero-correlation zone sequence set The proposed sequence construction can generate an optimal zero-correlation zone sequence set. The proposed sequence set can successfully provide CDMA communication without co-channel interference. In an ultrasonic synthetic aperture imaging system, the proposed sequence set can improve the signal-to-noise ratio of the acquired image.
A Differentiated Service Based Incentive Mechanism in P2P File-sharing Systems
Authors: Qiubo Huang, Shaoyin Huang, Chuanshan Gao
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

In P2P file-sharing systems, incentives to motivate peers to provide their files are essential. The objective of this paper is to enable the peers to get service differentiation in a P2P network based on how much the peers are willing to pay for a file. A peer can obtain higher download bandwidth if he pays a relatively higher price. To do so, he should earn more money by providing more valuable files to others. As a result the system where the peers reside will encourage all peers to contribute to their maximum extent to others. To realize the service differentiation, we propose a bandwidth allocation algorithm, and a reliable and secure payment scheme to serve the algorithm. Through the experiments, we illustrate that the algorithm can achieve its goal of service differentiation and can induce efficient file sharing by rational peers. Also, we show that the algorithm can properly adapt to different events such as peer's arrival, peer's departure and network congestion.
Research on RAIM Algorithm under the Assumption of Simultaneous Multiple Satellites Failure
Authors: Zhang Qiang, Zhang Xiaolin, Chang Xiaoming
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

Most of study on RAIM in the last few years has focused on the single satellite failure problem. However, if GPS, GLONASS, Galileo and other available satellite navigation systems are combined, or the satellite navigation systems are used in the civil navigation field, the assumption of single-satellite-failure is unreasonable. This paper analyses the maximum slope in the position error versus test statistic plot, which is very important for analyzing the RAIM availability. The simulation result shows that the simultaneous multiple faulty satellites will severely degrade RAIM availability. In the case of multiple satellites failure, the identification method used under the single satellite failure is ineffective. In order to solve this problem, this paper provides an approach for identifying the multiple faulty satellites. The simulation result indicates that the identifying method can exclude the multiple faulty satellites correctly.
Automotive Gear-Shifting Decision Making Based on Neural Network Computation Model
Authors: Jingxing Tan, Xiaofeng Yin, Liang Yin, Ling Zhao
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

Precise description of the engine dynamic characteristics plays a crucial role in automatic gear-shifting decision making for the performance match and optimization of vehicle power-train system. In this paper, a multi-layer feed forward neural network was proposed to identify the dynamic torque and fuel consumption models of engine. Based on the neural network models, algorithms to calculate the optimal dynamic and economical gear-shifting rules were constructed respectively. Comparative tests show that the gear-shifting decision based on neural network computation models is better than that based on traditional computation model using curve approximation, and improves the dynamic performance and fuel economy of vehicle power-train system significantly.
Aliasing Errors in Signature in Analysis Registers
Authors: T. W. Williams, W. Daehn, M. Gruetzner, C. W. Starke
Venue: IEEE Design Test (1987)

The authors discuss aliasing errors in signature analysis registers for self-testing networks and review analytical results.The results show that when p, the probability that an error will occur at a network output, is close to 1/2, there is a boundof the aliasing error. The analysis uses a graph to represent the probability of transition, the Markov process, and z-transformsto analyze the behavior of the signature analysis register. For very small p(p?0) and very large p(p?1), the aliasing errorsolution for primitive polynomials is a series of terms (1-?)n in magnitude (where n is the number of random patterns beingapplied to the network or the length of the network output sequence). As compared with nonprimitive polynomials, whose solutionis n(1-?)n or n2(1-?)n, in general primitive polynomials are much better with respect to aliasing. Simulation results areshown for aliasing errors for these polynomials, which give insight as to how aliasing occurs.
Dielectric anisotropy in the integration of Cu-SiLKTM system
Authors: Hai-Sin Tseng, Bi-Shiou Chiou, Wen-Fa Wu, Chia-Cheng Ho
Venue: Microelectronic Engineering (2008)

As device density and performance continue to improve, low dielectric constant (k) materials are needed for interlevel dielectric (ILD) applications. The dielectric anisotropy of polymers with low k is an important property to consider for developing ILD. This is on-going research on the integration aspects of Cu-SiLK(TM) system. In this study, the dielectric anisotropy of SiLK polymer was evaluated with two test structures: the metal-insulator-metal (MIM) parallel capacitor structure for the out-of-phase dielectric constant (k"@?) and comb-and-serpentine interdigitated structure for the in-plane dielectric constant (k"@?). A k"@? of 2.65, a k"@? of 2.75, and a dielectric anisotropy of 3.77% were obtained for SiLK. However, SiLK exhibits larger leakage current as compared to amorphous SiO"2 films. The reliability issue on the integration of Cu-SiLK is discussed.