ppxscal/embedding_network huggingface dataset:
Peak power reduction scheme base on transform kernel scrambling for OFDM systems
Authors: Chau-Yun Hsu, Hsin-Chieh Chao
Venue: Wireless Personal Communications: An International Journal (2007)

This work presents a novel transform kernel scrambling (TKS) scheme for reducing the peak-to-average transmitter power ratio (PAPR) for Orthogonal Frequency Division Multiplexing (OFDM) symbols. This scrambling scheme suppresses the peak envelope power of OFDM signals due to de-correlation among the original QAM constellation in multiple OFDM symbols via transformation. The performance of the reduction of PAPR for OFDM signals with various unitary transform kernels is also evaluated. Since specific unitary transform kernels in TKS processing block is only used for scrambling, no side information is required. For the ease of presentation, the system performance has been demonstrated by a computer simulation. Simulation results confirm the superiority of the proposed scheme in the PAPR reduction.
Moving Cast Shadow Detection by Energy Minimization
Authors: Yufei Zha, Yuan Yang, Ming Zhang, Duyan Bi
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

Moving cast shadow causes serious problem while segmenting and extracting true foreground from image sequences, due to the misclassification of moving shadow as foreground. This paper proposes a novel approach for moving cast shadow detection. Firstly, the color and texture information of moving cast shadow is employed with the temporal-spatial coherence of shadow and foreground in a probability framework; after that, the maximization of posterior probability can be converted to energy minimization problem through Gibbs energy; finally, moving cast shadow and foreground can be segmented accurately through graph cut. Results show that the proposed method excels classical method both in indoor and outdoor scene.
A Unified Theory of the Algebraic Topological Methods for the Synthesis of Switching Systems
Authors: M. E. Ulug
Venue: IEEE Transactions on Computers (1974)

A set of logic operators, first proposed by Roth [3], based on an algebraic topological interpretation of a function table, have provided the basis for the subsequent development of algorithms for the computer aided synthesis of combinatorial networks.
A study on multi-agent supply chain framework based on network economy
Authors: Lan Lu, Gong Wang
Venue: Computers and Industrial Engineering (2008)

Network economy is a new economy pattern enabled by information technology and the globalization market. This paper analyses the characteristic of network economy and builds a topological structure of it. The interactive coefficient matrix of network economy has also been suggested to depict the effect of network economy. Then, special attention has been paid to supply chain operation in network economy. A multi-agent approach has been applied to study the framework of supply chain in network economy. The information transfer process and cooperation between agents are two key issues in this framework. In order to make the image of this network economy based multi-agent supply chain framework clearer, a simple case is given to illustrate the supply chain operation and network economy structure.
Monitoring and suppression of vibration in precision machines
Authors: K. Z. Tang, K. K. Tan, C. W. de Silva, T. H. Lee, S. J. Chin
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2001)

In this paper, two approaches to reduce the damage caused by the mechanical vibrations in machines are presented. In the first approach, an adaptive notch filter is employed to detect online the resonant frequencies in the vibration signal and to adaptively align its notch to prevent signals at these frequencies from being propagated and amplified in the control loop. In the second approach, a real-time analyzer, based on a fuzzy fusion technique, is used to continuously monitor and compare the vibrational pattern against a vibration signature. The vibration signal can be acquired using an accelerometer mounted on the machine. As such, it can be applied to existing machines without modifications. Simulation and experimental results are provided to highlight the advantages associated with these approaches.
Analysis of the influence of building modelling in the prediction of over-rooftop multiple diffraction losses in urban areas
Authors: José-Víctor Rodríguez, María-José García-Martínez, José-María Molina-García-Pardo, Leandro Juan-Llácer
Venue: Wireless Personal Communications: An International Journal (2007)

A study of the influence of building modelling when predicting the signal attenuation due to over-rooftop multiple diffraction in urban environments is presented. A straightforward formulation expressed in terms of Uniform Theory of Diffraction (UTD) coefficients is used for the above-mentioned analysis assuming a spherical-wave incidence over the array of buildings and considering the latter modelled as series of different representations such as knife edges, double knife edges, wedges and rectangular sections. The results clearly indicate the importance of an appropriate building modelling in obtaining realistic path-loss predictions in urban environments when multiple diffraction has to be considered.
A wide speed range and high precision position and velocity measurements chip with serial peripheral interface
Authors: Ndubuisi Ekekwe, Ralph Etienne-Cummings, Peter Kazanzides
Venue: Integration, the VLSI Journal (2008)

This paper presents a VLSI chip, with a serial peripheral interface (SPI), that obtains position and velocity measurements from incremental optical encoder feedback. It combines period and frequency countings to provide velocity estimates with good dynamic behavior over a wide speed range (10Hz-50MHz). By sensing the velocity of the encoder, it reserves the computational power of a supervisory microcontroller, and subsequently enhances the performance of the total system. It is compact with lower power consumption when compared to traditional FPGA implementations. Although designed for use in the control unit of a medical robot with 34-axes and tight space and power constraints, it can be readily used in other applications. It is implemented in a 2P3M 0.5@mm CMOS process and consumes 4.82mW power with active area of 0.45mm^2.
An Interpreter of Attribute Grammars and Its Application to Waveform Analysis
Authors: G. K. Papakonstantinou
Venue: IEEE Transactions on Software Engineering (1981)

A simple portable interpreter for testing the specifications of problems is presented in this paper. These specificiations are supposed to be expressed in the formalism of attribute grammars. The parsing and the semantics evaluation are carried out simultaneously, so that the parsing can be directed by the semantics. This increases the power of the grammars and context sensitive characteristics of a language can be described.
Induction of multiple criteria optimal classification rules for biological and medical data
Authors: Han-Lin Li, Ming-Hsien Chen
Venue: Computers in Biology and Medicine (2008)

To induce critical classification rules from observed data is a major task in biological and medical research. A classification rule is considered to be useful if it is optimal and simultaneously satisfies three criteria: is highly accurate, has a high rate of support, and is highly compact. However, current classification methods, such as rough set theory, neural networks, ID3, etc., may only induce feasible rules instead of optimal rules. In addition, the rules found by current methods may only satisfy one of the three criteria. This study proposes a multi-criteria model to induce optimal classification rules with better rates of accuracy, support and compactness. A linear multi-objective programming model for inducing classification rules is formulated. Two practical data sets, one of HSV patients results and another of European barn swallows, are tested. The results illustrate that the proposed method can induce better rules than current methods.
On the Representer Theorem and Equivalent Degrees of Freedom of SVR
Authors: Francesco Dinuzzo, Marta Neve, Giuseppe De Nicolao, Ugo Pietro Gianazza
Venue: The Journal of Machine Learning Research (2007)

Support Vector Regression (SVR) for discrete data is considered. An alternative formulation of the representer theorem is derived. This result is based on the newly introduced notion of pseudoresidual and the use of subdifferential calculus. The representer theorem is exploited to analyze the sensitivity properties of ε-insensitive SVR and introduce the notion of approximate degrees of freedom. The degrees of freedom are shown to play a key role in the evaluation of the optimism, that is the difference between the expected in-sample error and the expected empirical risk. In this way, it is possible to define a Cp-like statistic that can be used for tuning the parameters of SVR. The proposed tuning procedure is tested on a simulated benchmark problem and on a real world problem (Boston Housing data set).
A Hybrid Tactical Plan Recognition Method Base on Planning System
Authors: W. S. Li, W. X. Wang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

Taken first-order predicate logic as formal language, this paper first introduces the knowledge representation form in intelligent planning and plan recognition system. A plan recognition model based on intelligent planning is then set up. For the process of solving problems of planning is to search from initial to final state or from final to initial state, an algorithm for producing the plan sequence is described. The Dempster-Shafer evidential theory, an effective inference method with uncertainty, is combined in the solving process to implement the inference with uncertainty of plan recognition. Finally, a tactical plan recognition example is proposed to explain the process of planning inference with uncertainty, which shows the feasibility of using the presented method for solving the problems of plan recognition.
On Modifying Logic Networks to Improve Their Diagnosability
Authors: J. P. Hayes
Venue: IEEE Transactions on Computers (1974)

This paper considers the use of control logic to reduce the number of tests required by a logic network and to simplify test generation. The properties of EXCLUSIVE-OR (EOR) circuits as control elements are examined. Systematic procedures are presented for modifying any combinational or sequential network so that the resulting network requires only five tests. These tests can easily be generated using a set of predefined test patterns of length five. The design of diagnosable networks using a limited amount of control logic is also discussed.
A Hybrid Algorithm of Fast and Accurate Computing Zernike Moments
Authors: Bo Fu, Jin Liu, XiuXiang Fan, Yi Quan
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

Zernike Moments are useful tools in pattern recognition and image analysis. However, direct computation of these moments is very expensive, limiting their use as feature descriptors especially at high orders. The existing methods by employing quantized polar coordinate systems not only save the computational time, but also reduce the accuracy of the moments. In this paper, we propose a hybrid algorithm, which re-organize Zernike moments with any order and repetition as a linear combination of Fourier-Mellin moments, to calculate Zernike moments at high orders fast and accurately. Firstly, arbitrary precision arithmetic is employed to preserve accuracy. Secondly, the property of symmetry is applied to the Fourier-Mellin moments to reduce their computational cost. Thirdly, the recursive relations of Zernike polynomial coefficients are used to speed up their computation. Experimental results reveal that the proposed method is more efficient than the other methods.
Character Stroke Extraction Based on B-spline Curve Matching by Constrained Alternating Optimization
Authors: X. Liu, Y. Jia
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

This paper proposes a character stroke extraction method for handwriting recognition based on B-spline curve matching. In our method, a character is modeled as a set of B-splines, each of which represents a character stroke. Stroke extraction is accomplished through matching candidate strokes in the skeleton of the input character image with B-splines in the character model. We discussed the character structure modeling, the principal curve based image skeletonization, and the constrained alternating optimization algorithm for affine-invariant B-spline curve matching. With the use of the proposed stroke extraction method, different types of characters can be reliably processed in a common way. The experimental results on data of handwritten numerals, handwritten English letters, and handwritten Chinese characters show the effectiveness of the proposed method.
Tranquility: A Low Disruptive Alternative to Quiescence for Ensuring Safe Dynamic Updates
Authors: Yves Vandewoude, Peter Ebraert, Yolande Berbers, Theo D'Hondt
Venue: IEEE Transactions on Software Engineering (2007)

This paper revisits a problem that was identified by Kramer and Magee: placing a system in a consistent state before and after runtime changes. We show that their notion of quiescence as a necessary and sufficient condition for safe runtime changes is too strict and results in a significant disruption in the application being updated. In this paper, we introduce a weaker condition: tranquility. We show that tranquility is easier to obtain and less disruptive for the running application but still a sufficient condition to ensure application consistency. We present an implementation of our approach on a component middleware platform and experimentally verify the validity and practical applicability of our approach using data retrieved from a case study.
Practices in Mixed-Signal and RF IC Testing
Authors: Salem Abdennadher, Saghir A. Shaikh
Venue: IEEE Design Test (2007)

Most mixed-signal and RF IC testing in industry today involves specification-based testing using ATE. However, some companies employ alternative solutions to ATE testing that use DFT and BIST. This article presents a brief overview of common IC industry practices in mixed-signal testing and RF testing with emphasis on wired and wireless transceiver testing. The authors also discuss the testing challenges of system-in-package (SiP) technology, and present a few practiced DFT solutions.
Design of Knowledge Discovery Agent based on Self Adaptive Components
Authors: Gu-Beom Jeong, Guk-Boh Kim
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

Agents can be autonomous entities, deciding their next step without the interference of a user or they can be controllable ,serving as a me diary between the user and another agent, thereby having some amount of Artificial Intelligence. Knowledge discovering agents are a very interesting approach to software development in computing environments. An agent consists in a thread of execution that can migrate across the network. In this paper, we will employ a multi-agent for the search and extraction of data in a distributed environment. We will use an Integrator Agent in the proposed model on the Knowledge Discovery Agent(KDA). The KDA will address the inadequacy of other data mining tools in processing performance and efficiency when use for knowledge discovery. The Integrator Agent was developed based on CORBA architecture for search and extraction of data from heterogeneous servers in the distributed environment. Our experiment shows that the KDA generated essential association rules which can be practically explained for decision making purposes.
On Linear Variational Surface Deformation Methods
Authors: Mario Botsch, Olga Sorkine
Venue: IEEE Transactions on Visualization and Computer Graphics (2008)

This survey reviews the recent advances in linear variational mesh deformation techniques. These methods were developed for editing detailed high-resolution meshes, like those produced by scanning real-world objects. The challenge of manipulating such complex surfaces is three-fold: the deformation technique has to be sufficiently fast, robust, and intuitive and easy to control to be useful for interactive applications. An intuitive, and thus predictable, deformation tool should provide physically plausible and aesthetically pleasing surface deformations, which in particular requires its geometric details to be preserved. The methods we survey generally formulate surface deformation as a global variational optimization problem that addresses the differential properties of the edited surface. Efficiency and robustness are achieved by linearizing the underlying objective functional, such that the global optimization amounts to solving a sparse linear system of equations. We review the different deformation energies and detail preservation techniques that were proposed in the recent years, together with the various techniques to rectify the linearization artifacts. Our goal is to provide the reader with a systematic classification and comparative description of the different techniques, revealing the strengths and weaknesses of each approach in common editing scenarios.
Three-Dimensional Surface Mesh Segmentation Using Curvedness-Based Region Growing Approach
Authors: Anupama Jagannathan, Eric. L. Miller
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

A new parameter-free graph morphology based segmentation algorithm is proposed to address the problem of partitioning a 3D triangular mesh into disjoint sub- eshes that correspond to the physical parts of the underlying object. Curvedness, which is a rotation and translation invariant shape descriptor, is computed at every vertex in the input triangulation. Iterative graph dilation and morphological filtering of the outlier curvedness values result in multiple, disjoint, maximally connected sub-meshes such that each sub-mesh contains a set of vertices with similar curvedness values, and vertices in disjoint sub-meshes have significantly different curvedness values. Experimental evaluations using the triangulations of a number of complex objects demonstrate the robustness and the efficiency of the proposed algorithm and the results prove that it compares well with a number of state-of-the-art mesh segmentation algorithms.
Web search engine multimedia functionality
Authors: Dian Tjondronegoro, Amanda Spink
Venue: Information Processing and Management: an International Journal (2008)

Web search engines are beginning to offer access to multimedia searching, including audio, video and image searching. In this paper we report findings from a study examining the state of multimedia search functionality on major general and specialized Web search engines. We investigated 102 Web search engines to examine: (1) how many Web search engines offer multimedia searching, (2) the type of multimedia search functionality and methods offered, such as ''query by example'', and (3) the supports for personalization or customization which are accessible as advanced search. Findings include: (1) few major Web search engines offer multimedia searching and (2) multimedia Web search functionality is generally limited. Our findings show that despite the increasing level of interest in multimedia Web search, those few Web search engines offering multimedia Web search, provide limited multimedia search functionality. Keywords are still the only means of multimedia retrieval, while other methods such as ''query by example'' are offered by less than 1% of Web search engines examined.
A Distributed Cut Set Discovery Algorithm in P2P Environment
Authors: Hao Ren, Nong Xiao, Zhiying Wang
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

Most overlay networks are highly decentralized and self-organized. Therefore, vertex cutset often exists in such systems due to the lack of centralized management. Vertex cutset is defined as a minimum number set of vertices whose removal increases the number of components. In this paper, we propose a distributed mechanism which efficiently detects the vertex cutset with 1 or 2 vertices and neutralize them into normal nodes with slight overhead. We prove the correctness of this algorithm and evaluate the performance of our design through trace driven simulations. The results show that our algorithm greatly improves the reliability of an overlay network upon the failure of vertex cutset.
R68-53 A System for Interactive Graphical Programming
Authors: W. R. Sutherland
Venue: IEEE Transactions on Computers (1968)

This paper describes a scheme for organizing and creating the control portions of an interactive graphical program. Since the response of such a program to some console input may depend on the history of previous inputs, the author structures his control programs as finite-state automatons. Thus state diagrams are used as the notation for defining the behavior of an interactive graphical program. Such notation does indeed add clarity and order to the description of this information.
Optimizing Rekeying Cost for Contributory Group Key Agreement Schemes
Authors: Wei Yu, Yan (Lindsay) Sun, K. J. Ray Liu
Venue: IEEE Transactions on Dependable and Secure Computing (2007)

While contributory group key agreement is a promising solution to achieve access control in collaborative and dynamic group applications, the existing schemes have not achieved the performance lower bound in terms of time, communication and computation cost. In this paper we propose a contributory group key agreement that achieves the performance lower bound by utilizing a novel logical key tree structure, called PFMH, and the concept of phantom user position. In particular, the proposed scheme only needs O(1) rounds of two-party DH upon any single user join event and O(log n) rounds of two-party DH upon any single user leave event. Both theoretical bound analysis and simulation show that the proposed scheme achieves lower rekeying cost than the existing tree-based contributory group key agreement schemes.
Word Segmentation for the Sequences Emitted from a Word-Valued Source
Authors: Takashi Ishida, Toshiyasu Matsushima, Shigeichi Hirasawa
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

Word segmentation is the most fundamental and impor- tant process for Japanese or Chinese language processing. Because there is no separation between words in these lan- guages, we firstly have to separate the sequence into words. On this problem, it is known that the approach by proba- bilistic language model is highly efficient, and this is shown practically. On the other hand, recently, a word-valued source has been proposed as a new class of source model for the source coding problem. This model can be supposed to reflect more of the probability structure of natural lan- guages. We may regard Japanese sentence or Chinese sen- tence as the sequence emitting from a non-prefix-free WVS. In this paper, as the first phase of applying WVS to natu- ral language processing, we formulate a word segmentation problem for the sequence from non-prefix-free WVS. Then, we examine the performance of word segmentation for the models by numerical computations.