ppxscal/embedding_network huggingface dataset:
Impulsive control of a new chaotic system
Authors: Jitao Sun
Venue: Mathematics and Computers in Simulation (2004)

Based on the new comparison theorem of impulsive system, this paper derives some sufficient conditions for the stabilization and synchronization of a new chaotic system via impulsive control with varying impulsive intervals. the new chaotic system is a three-dimensional continuous autonomous chaotic system, which can display complex two- and four-scroll attractors in simulations.
Preoperative and Intraoperative Image Processing for Assisting Endovascular Stent Grafting
Authors: Shigeru Eiho, Hiroshi Imamura, Naozo Sugimoto
Venue: Proceedings of the International Conference on Informatics Research for Development of Knowledge Society Infrastructure (2004)

Recent development in interventional radiologyenables minimally invasive treatment of aorticaneurysm: endovascular stent grafting. In this paper,we report image processing method in preoperativeplanning and intraoperative guidance for assistingendovascular stent grafting. In preoperative planning,it is necessary to design stent graft suitable for eachclinical case. Thus we present shape measurementmethod of aneurysmal aorta for computer assisteddesign of stent graft. In stent grafting, fluoroscopicimage is used as intraoperative image for visualizinglesion and interventional device. As fluoroscopicimage is a two dimensional (2-D) image, a doctor hasto imagine three dimensional (3-D) shape ofaneurysmal aorta. For intraoperative guidance, it isuseful to register preoperative 3-D CT image withintraoperative 2-D fluoroscopic images. In this paper,we present intraoperative 3-D/2-D registration methodfor assisting endovascular stent grafting and showapplication result to clinical data.
From the editors
Authors: Wynne W. Chin, Dorothy Leidner
Venue: ACM SIGMIS Database (2004)

We are pleased to present the second issue for this year. Three of the four articles deal with trust and other key factors influencing the adoption and acceptance of electronic commerce. The fourth provides and interesting experiment examining potential factors that influence an individual's willingness to report negative status information for an IS project. The first article by Chen, Gllenson, and Sherrell focuses on consumer acceptance of virtual stores by integrating key factors provided in the Technology Acceptance Model and Innovation Diffusion Theory. In addition, the authors examine the role of information richness, perceive trust, and service quality. Among the many interesting findings, the impact of service quality and trust were approximately equal to the traditional factors of compatibility, perceived usefulness, and ease of use. As contrast, Van Slyke, Belanger, and Comunale's article also focuses on the issue of trust on web-based shopping. Their objective is to examine trust as it relates to Innovation Diffusion Theory. Trust again was found to have an impact on use intention even after controlling for most of the key predictors from Innovation Diffusion Theory. Our third article by Kim and Prabhakar examines the role of initial trust on the adoption of B2C e-commerce. They found that initial trust has an impact on adoption behavior. But what are also of interest are the antecedent factors to trust. As the authors note, antecedents to trust must be explicitly identified and considered separate from trust itself. As such, Kim and Prabhakar found that propensity-to-trust, structural assurances, and word-of-mouth referrals were significant predictors. Finally, we present a very interesting article by Keil, Smith, Pawlowski, and Jin that explores the phenomenon of individuals' reluctance to report bad news during the life of a IS project. If we are able to mitigate such reluctance, obtaining such information as soon as possible would be a key factor to avoid sidelining of a project. The authors present a theoretical model drawn from the whistle-blowing literature and test it under controlled experimental conditions using role-playing scenarios. They found a strong relationship between normative perceptions of whether one ought to report problems with perceived personal responsibility. Moreover, they show the inverse relationship between personal responsibility and reluctance to report problems. Beyond that, via agency theory, they show the impact of organizational climate and information asymmetry was found to indirectly impact willingness to report negative project status information. Enjoy.
Cross-platform network applications with mono
Authors: Ian Pointer
Venue: Linux Journal (2004)

Build and run a useful blogging app and get a jump on .NET-compatible development. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Techniques for Formal Verification of Digital Systems: A System Approach
Authors: Hamid Shojaei, Habib Ghayoumi
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

In this paper we describe a methodology for the formal verification of a processor using the CTL property language. Processors are important in design and verification of digital systems because they have structures that represent most digital systems. Processors are programmable, have control parts, data parts and are rich in bus structure. Verification of CPU structures requires verification of data components, controllers, datapath and instruction level verification. This work uses a processor to discuss various features of formal verification. Because of generality of processors, we will be able to cover most aspects of property-based verification and properties used for this purpose.
Standard Web-Based Clinical Radiology Images and Reports at the Point of Care
Authors: Charlotte A. Seckman, Carol Romano, Stephen Rosenfeld
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

Web-based standard radiology images were successfully piloted and initially deployedto over 1300 users for on-sight intranet access. User feedback from the pilot yieldedpositive reports for ease of use, convenience and acceptable format. Technical deploymentof thin client technology was found to be complex, time consuming and replaced with analternate vendor strategy. One month implementation utilization data suggests moderateuse of standard images. Recommendations yielded interest in pursuing web access toenhanced digital radiology images and off-sight access.
Model and algorithm of an inventory problem with the consideration of transportation cost
Authors: Qiu-Hong Zhao, Shou-Yang Wang, K.-K. Lai, Guo-Ping Xia
Venue: Computers and Industrial Engineering (2004)

In this paper, we address the problem of deciding the optimal ordering quantity and frequency for a supplier-retailer logistic system in which the transportation cost as well as the multiple uses of the vehicles are considered. Based on the traditional economic order quantity (EOQ) formula, a modified EOQ model is set up and an algorithm for the model is presented. Computational results verify the proposed model as well as the efficiency of the algorithm.
Dependable Initialization of Large-Scale Distributed Software
Authors: Yansong (Jennifer) Ren, Rick Buskens, Oscar Gonzalez
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

Most documented efforts in fault-tolerantcomputing address the problem of recovering fromfailures that occur during normal system operation. Tobring a system to a point where it can begin performingits duties first requires that the system successfullycomplete initialization. Large-scale distributed systemsmay take hours to initialize. For such systems, a keychallenge is tolerating failures that occur duringinitialization, while still completing initialization in atimely manner. In this paper, we present a dependableinitialization model that captures the architecture of thesystem to be initialized, as well as interdependenciesamong system components. We show that overallsystem initialization may sometimes complete morequickly if recovery actions are deferred as opposed tocommencing recovery actions as soon as a failure isdetected. This observation leads us to introduce arecovery decision function that dynamically assesseswhen to take recovery actions. We then describe adependable initialization algorithm that combines thedependable initialization model and the recoverydecision function for achieving fast initialization.Experimental results show that our algorithm incurslower initialization overhead than that of aconventional initialization algorithm. This work is thefirst effort we are aware of that formally studies thechallenges of initializing a distributed system in thepresence of failures.
System Level Design and Verification Using a Synchronous Language
Authors: Gérard Berry, Michael Kishinevsky, Satnam Singh
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

Synchronous languages such as Esterel, Lustre, Signal, andothers were originally developed for safety-critical embedded software and compiled into C. They have recently been extended to hardware with new language features and compilers to RTL. Contrary to traditional HDL languages (Verilog, VHDL) and recent system-level languages (SystemC, System Verilog), they have well defined formal semantics,which facilitate bug avoidance using correct-by-constructioncompilation and verification techniques.The tutorial will demonstrate what the synchronous language offers for the modeling, design, analysis and implementation of systems that comprise hardware and software.It will be based on Esterel. Esterel models have proved tobe useful for rapid design space exploration and verificationat system level, without resorting to detailed implementation and slow bit-level event-based simulation. We show how to model control-dominated IP blocks at a higher levelof abstraction and how to use the target C code or RTL inconjunction with other system-level tools. Case studies include examples of design space exploration by synthesizing equivalent hardware or software from the same Esterel description, with formal verification of safety properties such as bus protocol conformance. We conclude with a review of future research directions.
Image-space silhouettes for unprocessed models
Authors: Michael Ashikhmin
Venue: Proceedings of Graphics Interface 2004 (2004)

A set of image-space techniques for visualizing silhouettes of 3D models is presented. We assume that very little information is available about the data and rely only on simple counting arguments. This also allows us to automatically handle surface boundaries. While based on previous work, the presented technique is generally simpler and provides some extra convenience compared to the few existing methods which work under similar conditions. We also introduce a method for visualizing all silhouettes of a model in a single view which in many cases allows faster and better understanding of underlying geometric structure.
The effects of latency on online madden NFL football
Authors: James Nichols, Mark Claypool
Venue: Proceedings of the 14th international workshop on Network and operating systems support for digital audio and video (2004)

With growth in interactive network games comes increased importance in a better understanding of the effects of latency on game performance. While previous work has measured the effects of latency on first-person shooters and real-time strategy games, there has been no systematic investigation of the effects of latency on sports games. In this work, we study the effects of latency on online Madden NFL football, one of the most popular online sports games, through a series of carefully designed experiments in which we systematically control latency between players. Our experiments illustrate the mechanisms Madden NFL uses to compensate for latency. Our user studies show there is little impact from latency on user performance in Madden NFL over typical low Internet latencies. However, for latencies higher than 500 ms, there is a significant impact on user performance, degrading performance by almost 30%. Our network measurements show periodic data rates during game-play with significant command aggregation at higher latencies.
An integral for FHNC calculations
Authors: Gary G. Hoffman
Venue: Journal of Computational Physics (2004)

In considering a modified approximation scheme for Fermi hypernetted chain (FHNC) theory, an integral arose that needed to be evaluated on a routine basis. By evaluating a portion of the integral in closed form, the time required for computation of the complete integral was considerably reduced. This paper presents the closed form evaluation along with some calculations using the result on the electron gas.
Optimality and Stability Study of Timing-Driven Placement Algorithms
Authors: Jason Cong, Michail Romesis, Min Xie
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

This work studies the optimality and stability of timing-drivenplacement algorithms. The contributions of this work include twoparts: 1) We develop an algorithm for generating synthetic examples with known optimal delay for timing driven placement(T-PEKO). The examples generated by our algorithm can closelymatch the characteristics of real circuits. 2) Using these syntheticexamples with known optimal solutions, we studied the optimalityof several timing-driven placement algorithms for FPGAs by comparing their solutions with the optimal solutions, and their stability by varying the number of longest paths in the examples. Our study shows that with a single longest path, the delay produced by these algorithms is from 10% to 18% longer than the optima on the average, and from 34% to 53% longer in the worst case. Furthermore, their solution quality deteriorates as the number of longest paths increases. For examples with more than 5 longest paths, their delay is from 23% to 35% longer than the optima on the average, and is from 41% to 48% longer in the worst case.
Diagonally Subgraphs Pattern Mining
Authors: Moti Cohen, Ehud Gudes
Venue: Proceedings of the 9th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery (2004)

In this paper we present an efficient algorithm, called DSPM, for mining all frequent subgraphs in large set of graphs. The algorithm explores the search space in a DFS fashion, while generating candidates in advance to each mining phase just like the Apriori algorithm does. It combines the candidate generation and anti monotone pruning into one efficient operation thanks to the unique mode of exploration. DSPM efficiently enumerates all frequent patterns by using diagonal search, which is a general scheme for designing effective algorithms for hard enumeration problems. Our experiments show that DSPM has better performance, from several aspects, than the current state of the art - gSpan algorithm.
Sublinear algorithms for testing monotone and unimodal distributions
Authors: Tugkan Batu, Ravi Kumar, Ronitt Rubinfeld
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

The complexity of testing properties of monotone and unimodal distributions, when given access only to samples of the distribution, is investigated. Two kinds of sublinear-time algorithms---those for testing monotonicity and those that take advantage of monotonicity---are provided. The first algorithm tests if a given distribution on [n] is monotone or far away from any monotone distribution in L1-norm; this algorithm uses O(√n) samples and is shown to be nearly optimal. The next algorithm, given a joint distribution on [n] x [n], tests if it is monotone or is far away from any monotone distribution in L1-norm; this algorithm uses O(n3/2) samples. The problems of testing if two monotone distributions are close in L1-norm and if two random variables with a monotone joint distribution are close to being independent in L1-norm are also considered. Algorithms for these problems that use only poly(log n) samples are presented. The closeness and independence testing algorithms for monotone distributions are significantly more efficient than the corresponding algorithms as well as the lower bounds for arbitrary distributions. Some of the above results are also extended to unimodal distributions.
Compression of Three-Dimensional Medical Image Data based on JPEG 2000
Authors: Alberto Aguirre, Sergio D. Cabrera, Aldo Lucero
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

We evaluate a compression scheme that exploits inter-slice redundancy in medical imagingthat is compatible with the JPEG 2000 core coding system extensions (part 2). The scheme consists of applying a decorrelating transform in the cross-slice vertical direction subsequently compressing each slice with a core part 1 JPEG 2000 coder. The rates for each slice are chosen according to a heuristic log-based allocation algorithm. Two transforms were considered, the KLT and the DWT 9x7. A gain of up to 4.4 dB in RMSE was achieved using the DWT 9x7 over a baseline JPEG 2000 system that uses no decorrelating transform.
MISAE: A New Approach for Regulatory Motif Extraction
Authors: Zhaohui Sun, Jingyi Yang, Jitender S. Deogun
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

The recognition of regulatory motifs of co-regulated genes is essential for understanding the regulatory mechanisms. However, the automatic extraction of regulatory motifs from a given data set of the upstream non-coding DNA sequences of a family of co-regulated genes is difficult because regulatory motifs are often subtle and inexact. This problem is further complicated by the corruption of the data sets. In this paper, a new approach called Mismatch-allowed Probabilistic Suffix Tree Motif Extraction (MISAE) is proposed. It combines the mismatch-allowed probabilistic suffix tree that is a probabilistic model and local prediction for the extraction of regulatory motifs. The proposed approach is tested on 15 co-regulated gene families and compares favorably with other state-of-the-art approaches. Moreover, MISAE performs well on "corrupted" data sets. It is able to extract the motif from a "corrupted" data set with less than one fourth of the sequences containing the real motif.
Strain characterization of strained Silicon on insulator wafers
Authors: V. Paillard, B. Ghyselen, C. Aulnette, B. Osternaud, N. Daval, F. Fournel, H. Moriceau, T. Ernst, J. M. Hartmann, C. Lagahe-Blanchard, S. Pocas, P. Leduc, L. Vincent, F. Cristiano, Y. Campidelli, O. Kermarrec, P. Besson, Y. Morand
Venue: Microelectronic Engineering (2004)

We show that it is possible to combine both silicon on insulator and strained silicon structures, which are usually considered as independent solutions to improve the performance of silicon-based CMOS transistors. Using Raman spectrometry and electron microscopy, we studied one kind of virtual Si1-xGex substrate produced by reduced pressurechemical vapor deposition, and the strained silicon thin film grown on top of this substrate. These structures are transferred on a silicon substrate using the SMART CUTTM process to form strained silicon on insulator wafers (SSOI). The main result is that the overlayers in the silicon on insulator structures keep the same stress than they had before transfer. The stress, measured in SSOI wafers with Si layers as thin as 10 nm, is not affected by high temperature annealing up to 1000 °C.
Similarity Measure Based on Obbtree for 3D Model Search
Authors: Keitaro Kaku, Yoshihiro Okada, Koichi Niijima
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualization (2004)

Recently the demand of 3D models has been growing in the CG production and the video game industry. Many 3D models have already been created and stored. We need a 3D model database system that allows us to retrieve required 3D models quickly and accurately. In the design of 3D model database systems, there is the question which feature of 3D models is suitable as the similarity measure for 3D model searches. In this paper, the authors propose the use of OBBTree for the similarity measure and describe its usefulness by showing its experimental results and comparison results with the recent major method called D2. The proposed method showed better results than D2.
LRU-SEQ: A Novel Replacement Policy for Transition Energy Reduction in Instruction Caches
Authors: Praveen Kalla, Xiaobo Sharon Hu, Jörg Henkel
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

Leakage energy will be the major energy consumer in futuredeep sub-micron designs. Especially the memory sub-systemof future SOCs will be negatively affected by this trend. Inorder to reduce the leakage energy, memory banks are transitionedto a low-energy state when possible. This transitionitself costs some energy which is termed as the transition energy.In this paper we present, as the first approach of its kind,a novel energy saving replacement policy called LRU-SEQ forinstruction caches. Evaluation of the policy on various architecturesin a system-level environment has shown that upto23% energy savings can be obtained. Considering the negligiblehardware impact, LRU-SEQ offers a viable choice foran energy saving policy.
An exit-flow model used in dynamic traffic assignment
Authors: Malachy Carey, Mark McCartney
Venue: Computers and Operations Research (2004)

We consider the behaviour of a link exit-flow model that has been used to model link flows in dynamic traffic assignment (DTA) on networks. In particular, we investigate how the model behaves when time and space (the link length) discretised and the discretisation is varied. We present numerical examples based on various inflow patterns and exit-flow functions and draw conclusions for applications of the model in discrete space and in discrete or continuous time. If inflows are always less than capacity and the link is homogeneous, with no obstructions at the exit, then if the discretisation is refined to the continuous limit the model goes to the solution of the well-known LWR model. However, we observe, somewhat counter intuitively, that the usual continuous-time model does not give as good an approximation to the LWR solution as does the discrete-time model: for a best approximation, the discretisation of space and time should be synchronised. We also investigate the 'dip' in outflows, or 'jamming' of outflows, that the model display, if inflows are permitted to exceed a capacity limit (as they sometimes do in published applications of the model) and the exit-flow function has a downward sloping part (which has usually been assumed away in DTA applications). In that case, if the number of spatial segments is increased, or the number of time intervals is reduced, then any dip in outflows occurs sooner and is more pronounced, and leads to earlier jamming. In the continuous limit, the jam occurs at the link entrance, preventing inflows in excess of capacity.