ppxscal/embedding_network huggingface dataset:
A robust method for real-time thread simulation
Authors: Blazej Kubiak, Nico Pietroni, Fabio Ganovelli, Marco Fratarcangeli
Venue: Proceedings of the 2007 ACM symposium on Virtual reality software and technology (2007)

In this paper, we present a physically based model for real-time simulation of thread dynamics. Our model captures all the relevant aspects of the physics of the thread, including quasi-zero elasticity, bending, torsion and self-collision, and it provides output forces for the haptic feedback. The physical properties are modeled in terms of constraints that are iteratively satisfied while the numerical integration is carried out through a Verlet scheme. This approach leads to an unconditionally stable, controllable and computationally light simulation [M&uuml;ller et al. 2007]. Our results demonstrate the effectiveness of our model, showing the interaction of the thread with other objects in real time and the creation of complex knots.
MODIS Image Compression with Optimal Inter-band Prediction and Integer Wavelet Transform
Authors: Yuan-Xiang Li, Li Deng, Zhongliang Jing
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

In order to store and transmit MODIS (Moderate Resolution Imaging Spectro-radiometer) multispectral images effectively, a practical compression method using optimal inter-band prediction and integer wavelet transform (IWT) is proposed. First, MODIS intrinsic noises are removed. Then, an optimal interband predictor is designed for de-correlating the spectral redundancy, and an error image is produced. Next, spatial redundancy in the error image is removed by using IWT and SPIHT (Set Partitioning in Hierarchical Trees) algorithm. This method can implement lossless compression, quasi-lossless compression and lossy compression with high compression ratio. We demonstrate the compression performance with different compression schemes in details. The experimental results have shown that our proposed method is efficient and practical for MODIS images.
Chemical mechanical planarization operation via dynamic programming
Authors: Chia-Shui Lin, Yung-Chou Lee
Venue: Microelectronic Engineering (2007)

In this paper, the impact on non-planarization index by the down force and rotational speed during a SiO"2 or Cu CMP process was investigated. Since the magnitudes of down force and rotational speed have limits, we choose the dynamic programming approach because of its ability to achieve constrained optimization by the down force and rotational speed. The duration and the amount of input were computed based on the chemical mechanical polishing model by Luo and Dornfeld [J. Luo, D.A. Dornfeld, IEEE Trans. Semiconduct. Manufact. 14(2) (2001) 112-132.] when the other parameters were fixed. Experiments done for blanket wafers based on dynamic programming operation and conventional constant removal rate operation was compared with each other. The non-planarization index could be improved consistently by dynamic programming operation versus constant removal rate operation. The improvement ranges from 2% to 39% improvement over the base recipe of constant removal rate in all experiments as shown in Tables 3 and 6. The thickness removal error is consistently smaller by constant removal rate operation versus dynamic programming operation in all experiments as shown in Tables 3 and 6. To get the best performance of both planarization and thickness removal, it is recommended that planarization step and overpolish step in SiO"2 and Cu CMP should use different mode of operation, i.e., dynamic programming operation during planarization step for minimizing non-planarization index and constant removal rate operation during overpolish step for minimizing thickness removal error. The incremental time calculation for eliminating thickness removal error during overpolish step can be done using the thickness error and removal rate derived from Luos' removal rate model based on constant wafer pressure and platen speed at the end of planarization step. Our contribution is a new approach for CMP. Standard CMP uses constant removal rate operation in both planarization step and overpolish step. Our new approach uses dynamic programming operation during planarization step and constant removal rate operation during overpolish step.
Compile-Time Analysis of Data List-Format List Correspondences
Authors: P. W. Abrahams
Venue: IEEE Transactions on Software Engineering (1979)

Formatted input-output is available in a number of programming languages. In the most general case, the correspondence between data items and format items cannot be determined during compilation, and so it is determined dynamically during execution. However, in most pairs of data and format lists that occur in practice, determination of the correspondence is in fact possible during compilation. Although some commercial compilers make this determination, there is little published literature on the subject. In this paper, we briefly examine three areas in which compile-time determination of the data-format correspondence is useful: optimization, program validation, and automatic test data generation. A formalism for stating the problem is given, and a solution is discussed in terms of formal language theory. Using this formalism, an algorithm for determining the correspondence is given, and its application is illustrated by examples in both PL/I and Fortran.
A DRAM Precharge Policy Based on Address Analysis
Authors: Chiyuan Ma, Shuming Chen
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

As the gap between processor speed and memory speed continues to increase, memory system becomes the bottleneck of the processor. Multiple instructions queuing for accessing main memory appear frequently, the regular changes of the access address stream often appear as well. Utilizing the characteristics of memory access, and considering different speeds of accessing DRAM in the hit, empty and conflict miss cases, this paper proposes a DRAM precharge policy based on address analysis. By collecting statistical information of address distribution of all the instructions waiting for accessing memory, and analyzing the regular changes of access addresses, this method can predict the access of each bank, make judgment of the appropriate moment to precharge each DRAM bank. The experimental results show that comparing with the commonly used close page and open page precharge policies, this method can decrease the cycles per instruction by 15.7% and 4.3% respectively.
Job-Mix Modeling and System Analysis of an Aerospace Multiprocessor
Authors: E. G. Mallach
Venue: IEEE Transactions on Computers (1972)

An aerospace guidance computer organization, consisting of multiple processors and memory units attached to a central time-multiplexed data bus, is described. A job mix for this type of computer is obtained by analysis of Apollo mission programs. Multiprocessor performance is then analyzed using: 1) queuing theory, under certain "limiting case" assumptions; 2) Markov process methods; and 3) system simulation. Results of the analyses indicate: 1) Markov process analysis is a useful and efficient predictor of simulation results; 2) efficient job execution is not seriously impaired even when the system is so overloaded that new jobs are inordinately delayed in starting; 3) job scheduling is significant in determining system performance; and 4) a system having many slow processors may or may not perform better than a system of equal power having few fast processors, but will not perform significantly worse.
New design of the miniature microstrip antennas for mobile communications
Authors: A. Latif, R. Hilal, A. Ait Ouahman
Venue: Ubiquity (2007)

The aim of this paper is to study the miniature patch antenna (patch antenna λ/8) fed by a coaxial line, and the design comparison of this antenna by two methods: The Transmission Line Model (TLM) and the G-L-C Parallel Circuit Model. An adaptation of the microstrip antenna λ/8, by the setting up of a capacitor in the middle of the probe-feed is achieved. The modeling and the design of the miniature patch antenna will be made by the TLM; a particular attention will be carried on the results got on the level of the bandwidth. The second part is based on the idea of microstrip patch antenna starting from the G-L-C Parallel Circuit Model, (by order of 14 %), which gives the bandwidth more interest than in the first method (TLM). The results obtained by the two methods (Input Impedance, reflection coefficient, SWR and bandwidth) will be given by the programs in MATLAB software.
Developing a general purpose intelligent control system for particle accelerators
Authors: William B. Klein, Robert T. Westervelt, George F. Luger
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (1999)

Tuning and controlling particle accelerators is time consuming and expensive. Inherently nonlinear, this control problem is one to which conventional methods have not satisfactorily been applied; the result is constant and expensive monitoring by human operators. In recent years, and with isolated successes, advanced information technologies such as expert systems and neural networks have been applied to the individual pieces of this problem. Most advanced information technology attempts are also very special purpose and built in a manner not at all generalizable to other accelerator installations. In this paper, we discuss preliminary results of our research combining various methodologies from the field of artificial intelligence into a general control system for accelerator tuning. We consider state space search and adaptive/learning algorithms including fuzzy logic, rule-based reasoning, neural networks, and genetic algorithms. We then propose a framework for applying these methods to a general purpose system for control. Finally, we discuss future plans for extending the system to include parallel distributed reasoning, an enhanced object structure, and additional heuristic control methods.
Implementing component reuse strategy in complex products environments
Authors: Ilan Oshri, Sue Newell, Shan L. Pan
Venue: Communications of the ACM (2007)

Tensions grow---and often so do costs---when operating procedures change. This corporate study illustrates how friction between engineers and management can be eased by introducing complementary initiatives.
A Case Study of Simulation as a Computer System Design Tool
Authors: G. J. Nutt
Venue: Computer (1978)

Simulation can be a powerful design tool, allowing system architects and programmers to optimize both hardware and software before a final design is chosen.
Near-Optimal Ordering of Electronic Circuit Equations
Authors: M. Silverberg
Venue: IEEE Transactions on Computers (1968)

Abstract An implementation of an algorithm for near-optimal ordering of sparse network equations is described. Such ordering can result in considerable savings in computer time and may be applied to various types of analysis programs. A sample problem demonstrates a saving in computer time in excess of 50 percent.
Ant colony intelligence in multi-agent dynamic manufacturing scheduling
Authors: W. Xiang, H. P. Lee
Venue: Engineering Applications of Artificial Intelligence (2008)

This study aims at building an efficient agent-based dynamic scheduling for real-world manufacturing systems with various products, processes, and disturbances. Ant colony intelligence (ACI) is proposed to be combined with local agent coordination so as to make autonomous agents adaptive to changing circumstances and to give rise to efficient global performance. The work here differs from other dynamic scheduling research in two areas: (1) a more generic and realistic manufacturing model with multiple product types, multiple/parallel multi-purpose machines with sequence-dependent setup constraints, and various dynamic disturbances is used, (2) ACI integrated with both machine agents and job agents to solve not only the task allocation problem, but also the task sequencing problem. The implementation of the aforementioned issues in a multi-agent system (MAS) is discussed. Simulation results show that, for most of the performance measures, a MAS integrated with well-designed ant-inspired coordination performs well compared to a MAS using dispatching rules.
UPnP based Service Discovery and Service Violation Handling for Distributed Fault Management in WBEM-based Network Management
Authors: Shahnaza Tursunova, Young-Tak Kim
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

Fast fault recovery depends on immediate detection of occurred fault. In some case, it is rather difficult to determine the cause of a fault in order to provide fast fault restoration/isolation. Also, service level fault, such as Service Level Agreement (SLA) violation may not be due to physical device failure. This paper explores in detail the aspects of service level fault detection. We present the design and implementation of service level fault detection mechanism with SLA in WBEM-based inter-AS traffic engineering (TE). We changed existing Service Location Protocol (SLP) based service discovery mechanism to Universal Plug and Play (UPnP) based one, and extended existing providers with new UPnP Provider which has not been supported by OpenPegasus WBEM. We also designed DMTF MOF (Managed Object Format) for service discovery for SLA management in order to handle service violation. UPnP Event Notification mechanism, service violation handling, and C++ based provider implementation on OpenPegasus WBEM for inter-AS TE is explained in detail.
Phylogenetic Networks Based on the Molecular Clock Hypothesis
Authors: Sergey Bereg, Yuanyi Zhang
Venue: IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) (2007)

A classical result in phylogenetic trees is that a binary phylogenetic tree adhering to the molecular clock hypothesis exists if and only if the matrix of distances between taxa is ultrametric. The ultrametric condition is very restrictive. In this paper we study phylogenetic networks that can be constructed assuming the molecular clock hypothesis. We characterize distance matrices that admit such networks for 3 and 4 taxa. We also design two algorithms for constructing networks optimizing the least-squares fit.
On VLSI design of rank-order filtering using DCRAM architecture
Authors: Meng-Chun Lin, Lan-Rong Dung
Venue: Integration, the VLSI Journal (2008)

This paper addresses on VLSI design of rank-order filtering (ROF) with a maskable memory for real-time speech and image processing applications. Based on a generic bit-sliced ROF algorithm, the proposed design uses a special-defined memory, called the dual-cell random-access memory (DCRAM), to realize major operations of ROF: threshold decomposition and polarization. Using the memory-oriented architecture, the proposed ROF processor can benefit from high flexibility, low cost and high speed. The DCRAM can perform the bit-sliced read, partial write, and pipelined processing. The bit-sliced read and partial write are driven by maskable registers. With recursive execution of the bit-slicing read and partial write, the DCRAM can effectively realize ROF in terms of cost and speed. The proposed design has been implemented using TSMC 0.18@mm 1P6M technology. As shown in the result of physical implementation, the core size is 356.1x427.7@mm^2 and the VLSI implementation of ROF can operate at 256MHz for 1.8V supply.
On-line event and topic detection by using the compact sets clustering algorithm
Authors: Aurora Pons-Porrata, Rafael Berlanga-Llavori, José Ruiz-Shulcloper
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2002)

In this paper we propose a new incremental clustering algorithm for Event Detection, which is based on the mathematical properties of the compact sets. Additionally, this algorithm makes use of the temporal references appearing in the document texts to measure the similarity between documents according to the events that they describe. In order to discover the structure of topics and composite events, the clustering algorithm is hierarchically applied to the stream of newspaper articles. Thus, in the first level, documents with a high temporal-semantic similarity are clustered together into events. In the next levels of the hierarchy, these events are successively clustered into more complex events and topics. The evaluation results demonstrate that regarding the temporal references of documents improves the quality of the system-generated clusters, and that the overall performance of the proposed system compares favorably to other on-line detection systems of the literature.
Vector Model Based Indexing and Retrieval of Handwritten Medical Forms
Authors: H. Cao, V. Govindaraju
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

A vector model based information retrieval of handwrit- ten medical forms is presented in this paper. In order to im- prove the IR performance on the erroneous output of hand- writing recognition (HR) systems, a variation of the vec- tor model is made to estimate the number of occurrences of terms from word segmentation and recognition proba- bilities. IR Tests show that our approach outperforms the retrieval of ordinary HR text in terms of mean average pre- cision (MAP), R-Precision, and interpolated 11-point pre- cisions.
New (t,n) threshold directed signature scheme with provable security
Authors: Rongxing Lu, Xiaodong Lin, Zhenfu Cao, Jun Shao, Xiaohui Liang
Venue: Information Sciences: an International Journal (2008)

Directed signature scheme allows only a designated verifier to check the validity of the signature issued to him; and at the time of trouble or if necessary, any third party can verify the signature with the help of the signer or the designated verifier as well. Due to its merits, directed signature scheme is widely used in situations where the receiver's privacy should be protected. Threshold directed signature is an extension of the standard directed signature, in which several signers may be required to cooperatively sign messages for sharing the responsibility and authority. To the best of our knowledge, threshold directed signature has not been well studied till now. Therefore, in this paper, we would like to formalize the threshold directed signature and its security model, then present a new (t,n) threshold directed signature scheme from bilinear pairings and use the techniques from provable security to analyze its security.
An AAA Study for Service Provisioning in Vehicular Networks
Authors: Etienne Coronado, Soumaya Cherkaoui
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

This paper investigates the key elements for a scalable solution of authentication, authorization, and accounting for service delivery in vehicular networks. Different approaches were studied to identify their advantages and disadvantages according to main evaluation parameters, two of which are scalability and latency. Upcoming research efforts need to address these elements to provide an appropriate service provisioning framework for the future deployment of vehicular networks.
Machine Perception for Industrial Applications
Authors: W. B. Thompson
Venue: Computer (1980)

Computers are becoming an integral part of the industrial environment. Programmable automation allows a flexibility in manufacturing undreamed of only a few years ago. Conventional control and monitoring functions can be done with greater precision and reliability and at less cost than by traditional means. Recently, the usefulness of computers in manufacturing has been further extended by the development of automated perceptual techniques.
Joint Congestion and Power Control in UWB Based Wireless Sensor Networks
Authors: P. Reena, Lillykutty Jacob
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

In this paper a cross-layer design of joint congestion control and power control is proposed for wireless sensor networks (WSNs). The multiple access communication for the WSNs is assumed to be ultra-wide bandwidth (UWB) time-hopping spread-spectrum (TH-SS) impulse radio. The joint congestion and power control is formulated as an optimization problem which is then solved by distributed iterative algorithms for flow rate adaptation and power adaptation on every link. The transport layer controls the congestion using a hop-by-hop flow rate assignment. Power control algorithm allocates the right amount of power at the right nodes to alleviate the bandwidth bottlenecks by increasing capacity, while maintaining the signal to interference-and-noise ratio above a given threshold for every link. Simulations show that considerable improvement in throughput can be obtained while also transmitting at lower power levels.
Architectural Test Coverage for Component-Based Integration Testing
Authors: Nor Laily Hashim, Sita Ramakrishnan, Heinz W. Schmidt
Venue: Proceedings of the Seventh International Conference on Quality Software (2007)

tion testing method with an architectural test coverage criteria. This method is suitable for systems that lack system documenta- tion and is applicable during regression testing and deployment phase. This paper also presents the initial results of an empirical study that validates the proposed test coverage criteria against an existing method in terms of the test coverage using a test suite precision parameter. We also describe the test models used that are based on probabilistic deterministic finite automata which are used to represent gate usage profiles at run-time and test execution. These models facilitate the representation and validation of the gate protocol, test coverage measurement and monitoring of the test suite coverage of each gate.
Word play
Authors: Lauri Karttunen
Venue: Computational Linguistics (2007)

This article is a perspective on some important developments in semantics and in computational linguistics over the past forty years. It reviews two lines of research that lie at opposite ends of the field: semantics and morphology. The semantic part deals with issues from the 1970s such as discourse referents, implicative verbs, presuppositions, and questions. The second part presents a brief history of the application of finite-state transducers to linguistic analysis starting with the advent of two-level morphology in the early 1980s and culminating in successful commercial applications in the 1990s. It offers some commentary on the relationship, or the lack thereof, between computational and paper-and-pencil linguistics. The final section returns to the semantic issues and their application to currently popular tasks such as textual inference and question answering.