ppxscal/embedding_network huggingface dataset:
Computer simulation of damage on distal femoral articular cartilage after meniscectomies
Authors: E. Peña, B. Calvo, M. A. Martínez, M. Doblaré
Venue: Computers in Biology and Medicine (2008)

It is commonly accepted that total or partial meniscectomies cause wear of articular cartilages that leads to severe damage in a period of few years. This also produces alteration of the biomechanical environment and increases articular instability, with a progressive and degenerative arthrosic pathology. Due to these negative consequences, total meniscectomy technique has been avoided, with a clear preference for partial meniscectomies. Despite the better results obtained with this latter technique, it has been demonstrated that the knee still suffers progressive long-term wear, which alters the properties of the surface of articular cartilage. In this paper, a phenomenological isotropic damage model of articular cartilage is presented and implemented in a finite element code. We hypothesized that there is a relation between the increase of shear stress and cartilage degeneration. To confirm the hypothesis, the obtained results were compared to experimental ones. It is used to investigate the effect of meniscectomies on articular damage in the human knee joint. Two different situations were compared for the tibio-femoral joint: healthy and after meniscectomy. The distribution of damaged regions and the damage level distribution resulted qualitatively similar to experimental results, showing, for instance that, after meniscectomy, significant degeneration occurs in the lateral compartment. A noteworthy result was that patterns of damage in a total meniscectomy model give better agreement to clinical results when using relative increases in shear stress, rather than an absolute shear stress criterion. The predictions for partial meniscectomies indicated the relative severity of the procedures.
Functional Constraints vs. Test Compression in Scan-Based Delay Testing
Authors: Ilia Polian, Hideo Fujiwara
Venue: Journal of Electronic Testing: Theory and Applications (2007)

We present an approach to prevent overtesting in scan-based delay test. The test data is transformed with respect to functional constraints while simultaneously keeping as many positions as possible unspecified in order to facilitate test compression. The method is independent of the employed delay fault model, ATPG algorithm and test compression technique, and it is easy to integrate into an existing flow. Experimental results emphasize the severity of overtesting in scan-based delay test. Influence of different functional constraints on the amount of the required test data and the compression efficiency is investigated. To the best of our knowledge, this is the first systematic study on the relationship between overtesting prevention and test compression.
Knowledge-based extension of model-referenced adaptive control with application to an industrial process
Authors: Poi Loon Tang, Aun-Neow Poo, Clarence W. Silva,  de
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2001)

This paper studies the development, implementation, and performance of three different types of model-referenced adaptive control with respect to a specific practical application. Conventional model-referenced adaptive control is used as the basis of comparison of the performance of two knowledge-based techniques. Fuzzy logic is used to represent the knowledge base of these techniques, and the compositional rule of inference is used for decision making. In one knowledge-based technique, the parameters of a low-level direct digital controller are adapted by the inference engine so that the physical system tracks a reference model, which specifies the desired performance. In the other knowledge-based technique, the reference input to the system is adapted to achieve the desired performance, as specified by a reference model. Both analytical and practical details of the development and implementation of the adaptive control techniques are systematically presented. Development of the knowledge base is described. Representative experimental results from the three techniques, as applied to a prototype fish cutting machine are given. The performance of the techniques is evaluated on the basis of the developmental experience and the experimental results.
A machine learning approach to web page filtering using content and structure analysis
Authors: Michael Chau, Hsinchun Chen
Venue: Decision Support Systems (2008)

As the Web continues to grow, it has become increasingly difficult to search for relevant information using traditional search engines. Topic-specific search engines provide an alternative way to support efficient information retrieval on the Web by providing more precise and customized searching in various domains. However, developers of topic-specific search engines need to address two issues: how to locate relevant documents (URLs) on the Web and how to filter out irrelevant documents from a set of documents collected from the Web. This paper reports our research in addressing the second issue. We propose a machine-learning-based approach that combines Web content analysis and Web structure analysis. We represent each Web page by a set of content-based and link-based features, which can be used as the input for various machine learning algorithms. The proposed approach was implemented using both a feedforward/backpropagation neural network and a support vector machine. Two experiments were designed and conducted to compare the proposed Web-feature approach with two existing Web page filtering methods - a keyword-based approach and a lexicon-based approach. The experimental results showed that the proposed approach in general performed better than the benchmark approaches, especially when the number of training documents was small. The proposed approaches can be applied in topic-specific search engine development and other Web applications such as Web content management.
Generalizing fault contents from a few classes
Authors: Hanna Scott, Philip M. Johnson
Venue: Proceedings of the First International Symposium on Empirical Software Engineering and Measurement (2007)

The challenges in fault prediction today are to get a prediction as early as possible, at as low a cost as possible, needing as little data as possible and preferably in such a language that your average developer can understand where it came from. This paper presents a fault sampling method where a summary of a few, easily available metrics is used together with the results of a few sampled classes to generalize the fault content to an entire system. The method is tested on a large software system written in Java, that currently consists of around 2 000 classes and 300 000 lines of code. The evaluation shows that the fault generalization method is good at predicting fault-prone clusters and that it is possible to generalize the values of a few representative classes.
A Novel Algorithm of Mining Maximal Frequent Pattern Based on Projection Sum Tree
Authors: Chuanyao Yang, Yunqin Li, Chenghong Zhang, Yunfa Hu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

In this paper, a novel algorithm for mining maximal frequent patterns is proposed based on projection sum frequent items tree. This algorithm projects the transaction base into a projection sum tree and it can store the frequent itemsets in the tree in a compact manner. The algorithm builds frequent patterns tree directly as FPMax algorithm does. However, all the nodes of PSFIT are sorted and ordered, the children of which are also sorted and ordered. It doesn't need to generate conditional FP-tree dynamically and recursively and it can take advantage of computational result that has been done. The experiment shows that PSFIT is an efficient algorithm, it has comparable performance with FPMax, and in most cases it outperforms FPMax. Key words: projection sum tree, maximal frequent patterns, data mining
A Parallel Algorithm to Construct Concept Lattice
Authors: Xuegang Hu, Xiang Wei, Dexing Wang, Peipei Li
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

Concept Lattice is an efficient tool for data analysis and knowledge discovery and has been used in many fields, such as data mining, machine learning, and information searching. With volumes of data growing increasingly, it's important to design the algorithms which are more efficient. Therefore, a parallel algorithm of PSTCL (Parallel Sub-Top Concept Lattice) is developed in this paper. The analysis and experiments show that the time performance of PSTCL has been improved significantly over Godin algorithms. In addition, the space performance is better than the algorithm used under the single computer environment.
The Physical, Mental, and Emotional Stress Effects of VDT Work
Authors: Michael Smith
Venue: IEEE Computer Graphics and Applications (1984)

Are their backs killing them? Do they growl when a supervisor walks by? Something can be done for folks who spend their days in front of VDTs. 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
Face^3 a 2D+3D Robust Face Recognition System
Authors: Alessandro Colombo, Claudio Cusano, Raimondo Schettini
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

We present Face^3, a system for the automatic recognition of people using 2D and 3D images. The system implements several innovative algorithms. A full 3D face detector allows the detection of faces regardless their pose and orientation in the scene. A face restoration module allows the recognition even in presence of occlusions. The recognition is performed using a fusion of 2D and 3D data. Finally, in order to relax the hardware constraints, a simplification algorithm is used to reduce the data complexity of the 3D face models.
Parallel Implementation of Ant Colony Optimization for Vector Quantization Codebook Design
Authors: Xia Li, Xing Yu, Xuehui Luo
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

This paper presents a framework for parallel implementation of ant colony system-based vector quantization codebook design. The most important structure used is the pheromone trail, which is updated in both local and global sense. The local renewal is implemented in each processor and the global modification is realized at the end of each parallel cycle. The algorithm is carried out on DeepSuper-21C supercomputer, with 256 P4 Xeon 3.06/2.8GHz Myrinet using MPI. Both the pixel signal-to-noise ratio (PSNR) for the decoded image and the speedup and efficiency for the parallel strategy are used for the evaluation of the proposed algorithm. Experimental results show that the performance of the algorithm improves by 0.1~0.2dB with the execution time decreased considerably to 2~3 minutes.
A Memory-Level Parallelism Aware Fetch Policy for SMT Processors
Authors: Stijn Everman, Lieven Eeckhout
Venue: Proceedings of the 2007 IEEE 13th International Symposium on High Performance Computer Architecture (2007)

A thread executing on a simultaneous multithreading (SMT) processor that experiences a long-latency load will eventually stall while holding execution resources. Existing long-latency load aware SMT fetch policies limit the amount of resources allocated by a stalled thread by identifying long-latency loads and preventing the given thread from fetching more instructions - and in some implementations, instructions beyond the long-latency load may even be flushed which frees allocated resources. This paper proposes an SMT fetch policy that takes into account the available memory-level parallelism (MLP) in a thread. The key idea proposed in this paper is that in case of an isolated long-latency load, i.e., there is no MLP, the thread should be prevented from allocating additional resources. However, in case multiple independent logn-latency loads overlao, i.e., there is MLP, the thread should allocate as many resources as needed in order to fully expose the available MLP. The proposed MLP-aware fetch policy achieves better performance for MLP-intensive threads on a SMT processor and achieves a better overall balance between performance and fairness than previously proposed fetch policies.
Institutional memory and risk management
Authors: Richard Riehle
Venue: ACM SIGSOFT Software Engineering Notes (2007)

Software risk management is a critical aspect of software engineering. Software risks based on metrics derived from a large number of similar projects, along with effective statistical methods, can improve risk prediction, assessment, and management.
Finger-Written Chinese Characters Recognition Using Hierarchical LDA
Authors: D. Yang, L. Jin, L.-X. Zhen, J.-C. Huang
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

In our camera based user interface, user inputs Chinese characters by moving fingertip with his/her fingers. Therefore, we call those characters "finger written Chinese characters" (FWCCs). To recognize FWCCS with high recognition accuracy, we propose a new method to discriminate similar FWCCs based on a two stages Linear Discriminant Analysis (LDA) architecture. Experimental results show the proposed method is useful for the improvements of recognition rate and outperforms our previous hybrid recognition method. Comparing with MQDF-based method, the proposed method can reach similar classification performance but with much less storage requirement.
Procuring Requirements for ERP Software Based on Semantic Similarity
Authors: Juntao Gao, Li Zhang, Wei Jiang
Venue: Proceedings of the International Conference on Semantic Computing (2007)

Enterprise resource planning (ERP) system is one of the most widely accepted choices to gain competitive edge for manufacturing related enterprises. However, the rate of successful implementation is lower than expected. One of the main reasons is that there is a gap between application domain and software discipline. In this paper, a methodology is proposed to procure the requirements for ERP software, by which both sides do their jobs in their familiar domain. The methodology consists three phases: business modeling, gap analysis, requirement analysis for software. This paper focuses on the second phase, which aims at identifying the business processes beyond the capability of ERP software. Based on Ontology an algorithm to measure the similarity of business process models is designed and Hungarian algorithm is used to reduce its time complexity. Finally, an experiment is given to evaluate the method.
Location Update versus Paging Trade-Off in Cellular Networks: An Approach Based on Vector Quantization
Authors: Abhishek Roy, Archan Misra, Sajal K. Das
Venue: IEEE Transactions on Mobile Computing (2007)

In this paper we propose two information-theoretic techniques for efficiently trading off the location update and paging costs associated with mobility management in wireless cellular networks. Previous approaches attempt to always accurately convey a mobile’s movement sequence and hence, cannot reduce the signaling cost below the entropy bound. Our proposed techniques, however, exploit rate-distortion theory to arbitrarily reduce the update cost, at the expense of an increase in the corresponding paging overhead. To this end, we describe two location tracking algorithms, based on spatial quantization and temporal quantization, which first quantize the movement sequence into a smaller set of codewords, and then report a compressed representation of the codeword sequence. While the spatial quantization algorithm clusters individual cells into registration areas, the more powerful temporal quantization algorithm groups sets of consecutive movement patterns. The quantizers themselves are adaptive and periodically reconfigure to accommodate changes in the mobile’s movement pattern. Simulation study with synthetic as well as real movement traces for both single-system and multi-system cellular networks demonstrate that the proposed algorithms can reduce the mobile’s update frequency to 3-4 updates/day with reasonable paging cost, low computational complexity, storage overhead and codebook updates.
Specification and Runtime Enforcement of Security Policies
Authors: Ying Jin, Jing Zhang, Xiaojuan Zheng
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

The rapid growth in mobile and wireless communications entails serious problem of security. Formal methods can be used to help building secure mobile computing environment. Tabular expressions have proved to be useful and practical in formulating precise and complete documentation for computer systems. In this paper a framework for specification and runtime enforcement of security policies is proposed basing on the use of tabular expressions. A security policy can be specified with a tabular expression, and checking whether an application adheres to a given policy can be achieved by evaluating the tabular expression with respect to information intercepted at runtime. The advantages of our approach includes: (1)providing precise and readable specification of security policies; (2)developing a general policy enforcement engine rather than one policy enforcement engine for each security policy; (3)achieving low overheads by simplifying tabular expressions with static information of mobile code.
Compressing serialized java objects: a comparative analysis of six compression methods
Authors: Ghassan Samara, Ahmad El-Halabi, Jalal Kawash
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

Java objects are serialized into a linear stream of bytes so that they can be stored in persistent storage or passed by value as parameters to remote method invocations. Storing or transmitting a compressed version of the object is desirable for better storage or transmission efficiency. Lossless compression methods have been in use for long and their relative merits have been considered in many studies. In this paper, we study the relative merits of six well known compression methods in the context of serialized Java objects. To our knowledge, this is the only such study that considers all six compression methods in one study. A conclusion of our study is that LZMA yields the best compromise between compression ratio and compression speed for Java objects. BZip2 yields similar results for objects that do not contain images, but requires longer runtime with such objects.
A New Method for Fast Data Searches with Keys
Authors: W. Litwin
Venue: IEEE Software (1987)

Bounded disorder uses hashing and tree indexing to speed key-associative access to data. It supports range searches and is robust, coping well with arbitrary key distributions.
Collision handling of deformable anatomical models for real-time surgery simulation
Authors: Bruno Heidelberger, Matthias Teschner, Thomas Frauenfelder, Markus Gross
Venue: Technology and Health Care (2004)

Efficient collision handling of dynamically deforming anatomical models is a very challenging problem in real-time surgery simulation. In this paper, we present a new, efficient approach that detects collisions and self-collisions of deformable models. Our algorithm is integrated in a simulation framework for multiple interacting objects. This framework consists of three components. The first one computes the dynamic behavior of deformable structures using an efficient and robust approach with distance- and volume-preserving constraints. The second component detects collisions and self-collisions of deformable models. A novel image-space technique is employed that detects volumetric intersections. This allows to compute the penetration depth which is used to resolve collisions in the third component of our framework. Our system handles volumetric deformable models of up to several thousand surface triangles and tetrahedra in real-time and can be used in surgical training systems.
Improving expressional power and validation for multilevel flow models
Authors: Jan Eric Larsson, Jonas Ahnlund, Tord Bergquist, Fredrik Dahlstrand, Bengt Öhman, Lambert Spaanenburg
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2004)

Multilevel flow modeling (MFM) is a modeling method for complex technical systems in which the goals and functions of the system are explicitly described. MFM can be used as a basis for root cause analysis, where primary root causes are separated from consequential faults, in complex fault situations. Model representations for use in diagnostic reasoning usually describe causality, between parameters, faults, or process states. However, the causality of a system may vary depending on details in the construction, as well as over time with the process state. One contribution of this paper is a general method of describing varying causality in a simple and efficient way. The method has been tested using multilevel flow models. Causality is visible in measurements and can be used to increase process understanding. The standard cross-correlation technique is insufficient for causality detection in industrial processes. Another contribution of this paper is a new method that can detect causality in industrial signals, and thus be used to validate the design of multilevel flow models.
The importance of At-Speed Scan Testing: an industrial experience
Authors: F. Baronti, R. Roncella, R. Saletti, P. D'Abramo, L. Di Piro, H. Fabian, M. Giardi
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

At-speed scan testing is becoming more and more popular in the semiconductor industry, as the relevance of delay-induced defects increases with CMOS process scaling and consequent IC complexity growth. This paper reports an industrial experience that demonstrate that at-speed transition fault testing is a crucial manufacturing step also for designs fabricated in mature processes and characterized by rather low working frequency, at least for highly reliable applications, such as automotive electronics and avionics. We present the identification of a timingrelated defect on faulty parts and we discuss the application of at-speed scan testing which allowed us to achieve zero ppm final defect level after tests. The design was a serial communication receiver featuring an internal RC oscillator with 15 MHz typical oscillating frequency, fabricated in 0.8 ìm CMOS technology.